Subcountability

In constructive mathematics, a collection X {\displaystyle X} is subcountable if there exists a partial surjection from the natural numbers onto it. This may be expressed as ∃ ( I ⊆ N ) . ∃ f . ( f : I ↠ X ) , {\displaystyle \exists (I\subseteq {\mathbb {N} }).\,\exists f.\,(f\colon I\twoheadrightarrow X),} where f : I ↠ X {\displaystyle f\colon I\twoheadrightarrow X} denotes that f {\displaystyle f} is a surjective function from I {\displaystyle I} onto X {\displaystyle X} . The surjection is a member of N ⇀ X {\displaystyle {\mathbb {N} }\rightharpoonup X} and here the subclass I {\displaystyle I} of N {\displaystyle {\mathbb {N} }} is required to be a set. In other words, all elements of a subcountable collection X {\displaystyle X} are functionally in the image of an indexing set of counting numbers I ⊆ N {\displaystyle I\subseteq {\mathbb {N} }} and thus the set X {\displaystyle X} can be understood as being dominated by the countable set N {\displaystyle {\mathbb {N} }} .

Note that nomenclature of countability and finiteness properties vary substantially - in part because many of them coincide when assuming excluded middle. To reiterate, the discussion here concerns the property defined in terms of surjections onto the set X {\displaystyle X} being characterized. The language here is common in constructive set theory texts, but the name subcountable has otherwise also been given to properties in terms of injections out of the set being characterized.

The set N {\displaystyle {\mathbb {N} }} in the definition can also be abstracted away, and in terms of the more general notion X {\displaystyle X} may be called a subquotient of N {\displaystyle {\mathbb {N} }} .

Important cases are those where the set in question is some subclass of a bigger class of functions as studied in computability theory. For context, recall that being total is famously not a decidable property of functions. Indeed, Rice's theorem on index sets, most domains of indices are, in fact, not computable sets.

There cannot be a computable surjection n ↦ f n {\displaystyle n\mapsto f_{n}} from N {\displaystyle {\mathbb {N} }} onto the set of total computable functions X {\displaystyle X} , as demonstrated via the function n ↦ f n ( n ) + 1 {\displaystyle n\mapsto f_{n}(n)+1} from the diagonal construction, which could never be in such a surjections image. However, via the codes of all possible partial computable functions, which also allows non-terminating programs, such subsets of functions, such as the total functions, are seen to be subcountable sets: The total functions are the range of some strict subset I {\displaystyle I} of the natural numbers. Being dominated by an uncomputable set of natural numbers, the name subcountable thus conveys that the set X {\displaystyle X} is no bigger than N {\displaystyle {\mathbb {N} }} . At the same time, for some particular restrictive constructive semantics of function spaces, in cases when I {\displaystyle I} is provenly not computably enumerable, such I {\displaystyle I} is then also not countable, and the same holds for X {\displaystyle X} .

Note that no effective map between all counting numbers N {\displaystyle {\mathbb {N} }} and the unbounded and non-finite indexing set I {\displaystyle I} is asserted in the definition of subcountability - merely the subset relation I ⊆ N {\displaystyle I\subseteq {\mathbb {N} }} . A demonstration that X {\displaystyle X} is subcountable at the same time implies that it is classically (non-constructively) formally countable, but this does not reflect any effective countability. In other words, the fact that an algorithm listing all total functions in sequence cannot be coded up is not captured by classical axioms regarding set and function existence. We see that, depending on the axioms of a theory, subcountability may be more likely to be provable than countability.

In constructive logics and set theories tie the existence of a function between infinite (non-finite) sets to questions of decidability and possibly of effectivity. There, the subcountability property splits from countability and is thus not a redundant notion. The indexing set I {\displaystyle I} of natural numbers may be posited to exist, e.g. as a subset via set theoretical axioms like the separation axiom schema. Then by definition of I ⊆ N {\displaystyle I\subseteq {\mathbb {N} }} , ∀ ( i ∈ I ) . ( i ∈ N ) . {\displaystyle \forall (i\in I).(i\in {\mathbb {N} }).} But this set may then still fail to be detachable, in the sense that ∀ ( n ∈ N ) . ( ( n ∈ I ) ∨ ¬ ( n ∈ I ) ) {\displaystyle \forall (n\in {\mathbb {N} }).{\big (}(n\in I)\lor \neg (n\in I){\big )}} may not be provable without assuming it as an axiom. One may fail to effectively count the subcountable set X {\displaystyle X} if one fails to map the counting numbers N {\displaystyle {\mathbb {N} }} into the indexing set I {\displaystyle I} , for this reason. Being countable implies being subcountable. In the appropriate context with Markov's principle, the converse is equivalent to the law of excluded middle, i.e. that for all proposition ϕ {\displaystyle \phi } holds ϕ ∨ ¬ ϕ {\displaystyle \phi \lor \neg \phi } . In particular, constructively this converse direction does not generally hold.

Asserting all laws of classical logic, the disjunctive property of I {\displaystyle I} discussed above indeed does hold for all sets. Then, for nonempty X {\displaystyle X} , the properties numerable (which here shall mean that X {\displaystyle X} injects into N {\displaystyle {\mathbb {N} }} ), countable ( N {\displaystyle {\mathbb {N} }} has X {\displaystyle X} as its range), subcountable (a subset of N {\displaystyle {\mathbb {N} }} surjects into X {\displaystyle X} ) and also not ω {\displaystyle \omega } -productive (a countability property essentially defined in terms of subsets of X {\displaystyle X} ) are all equivalent and express that a set is finite or countably infinite.

Without the law of excluded middle, it can be consistent to assert the subcountability of sets that classically (i.e. non-constructively) exceed the cardinality of the natural numbers. Note that in a constructive setting, a countability claim about the function space N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} out of the full set N {\displaystyle {\mathbb {N} }} , as in N ↠ N N {\displaystyle {\mathbb {N} }\twoheadrightarrow {\mathbb {N} }^{\mathbb {N} }} , may be disproven. But subcountability I ↠ N N {\displaystyle I\twoheadrightarrow {\mathbb {N} }^{\mathbb {N} }} of an uncountable set N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} by a set I ⊆ N {\displaystyle I\subseteq {\mathbb {N} }} that is not effectively detachable from N {\displaystyle {\mathbb {N} }} may be permitted.

A constructive proof is also classically valid. If a set is proven uncountable constructively, then in a classical context is it provably not subcountable. As this applies to N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} , the classical framework with its large function space is incompatible with the constructive Church's thesis, an axiom of Russian constructivism.

A set X {\displaystyle X} shall be called ω {\displaystyle \omega } -productive if, whenever any of its subsets W ⊂ X {\displaystyle W\subset X} is the range of some partial function on N {\displaystyle {\mathbb {N} }} , there always exists an element d ∈ X ∖ W {\displaystyle d\in X\setminus W} that remains in the complement of that range.^[1]

If there exists any surjection onto some X {\displaystyle X} , then its corresponding compliment as described would equal the empty set X ∖ X {\displaystyle X\setminus X} , and so a subcountable set is never ω {\displaystyle \omega } -productive. As defined above, the property of being ω {\displaystyle \omega } -productive associates the range W {\displaystyle W} of any partial function to a particular value d ∈ X {\displaystyle d\in X} not in the functions range, d ∉ W {\displaystyle d\notin W} . In this way, a set X {\displaystyle X} being ω {\displaystyle \omega } -productive speaks for how hard it is to generate all the elements of it: They cannot be generated from the naturals using a single function. The ω {\displaystyle \omega } -productivity property constitutes an obstruction to subcountability. As this also implies uncountability, diagonal arguments often involve this notion, explicitly since the late seventies.

One may establish the impossibility of computable enumerability of X {\displaystyle X} by considering only the computably enumerable subsets W {\displaystyle W} and one may require the set of all obstructing d {\displaystyle d} 's to be the image of a total recursive so called production function.

N ⇀ X {\displaystyle {\mathbb {N} }\rightharpoonup X} denotes the space that exactly hold all the partial functions on N {\displaystyle {\mathbb {N} }} that have, as their range, only subsets W {\displaystyle W} of X {\displaystyle X} . In set theory, functions are modeled as collection of pairs. Whenever P N {\displaystyle {\mathcal {P}}{\mathbb {N} }} is a set, the set of sets of pairs ∪ I ⊆ N X I {\displaystyle \cup _{I\subseteq {\mathbb {N} }}X^{I}} may be used to characterize the space of partial functions on N {\displaystyle {\mathbb {N} }} . The for an ω {\displaystyle \omega } -productive set X {\displaystyle X} one finds

∀ ( w ∈ ( N ⇀ X ) ) . ∃ ( d ∈ X ) . ∀ ( n ∈ N ) . w ( n ) ≠ d . {\displaystyle \forall (w\in ({\mathbb {N} }\rightharpoonup X)).\exists (d\in X).\forall (n\in {\mathbb {N} }).w(n)\neq d.}

Read constructively, this associates any partial function w {\displaystyle w} with an element d {\displaystyle d} not in that functions range. This property emphasizes the incompatibility of an ω {\displaystyle \omega } -productive set X {\displaystyle X} with any surjective (possibly partial) function. Below this is applied in the study of subcountability assumptions.

As reference theory we look at the constructive set theory CZF, which has Replacement, Bounded Separation, strong Infinity, is agnostic towards the existence of power sets, but includes the axiom that asserts that any function space Y X {\displaystyle Y^{X}} is set, given X , Y {\displaystyle X,Y} are also sets. In this theory, it is moreover consistent to assert that every set is subcountable. The compatibility of various further axioms is discussed in this section by means of possible surjections on an infinite set of counting numbers I ⊆ N {\displaystyle I\subseteq {\mathbb {N} }} . Here N {\displaystyle {\mathbb {N} }} shall denote a model of the standard natural numbers.

Recall that for functions g : X → Y {\displaystyle g\colon X\to Y} , by definition of total functionality, there exists a unique return value for all values x ∈ X {\displaystyle x\in X} in the domain,

∃ ! ( y ∈ Y ) . g ( x ) = y , {\displaystyle \exists !(y\in Y).g(x)=y,}

and for a subcountable set, the surjection is still total on a subset of N {\displaystyle {\mathbb {N} }} . Constructively, fewer such existential claims will be provable than classically.

The situations discussed below—onto power classes versus onto function spaces—are different from one another: Opposed to general subclass defining predicates and their truth values (not necessarily provably just true and false), a function (which in programming terms is terminating) does makes accessible information about data for all its subdomains (subsets of the X {\displaystyle X} ). When as characteristic functions for their subsets, functions, through their return values, decide subset membership. As membership in a generally defined set is not necessarily decidable, the (total) functions X → { 0 , 1 } {\displaystyle X\to \{0,1\}} are not automatically in bijection with all the subsets of X {\displaystyle X} . So constructively, subsets are a more elaborate concept than characteristic functions. In fact, in the context of some non-classical axioms on top of CZF, even the power class of a singleton, e.g. the class P { 0 } {\displaystyle {\mathcal {P}}\{0\}} of all subsets of { 0 } {\displaystyle \{0\}} , is shown to be a proper class.

Below, the fact is used that the special case ( P → ¬ P ) → ¬ P {\displaystyle (P\to \neg P)\to \neg P} of the negation introduction law implies that P ↔ ¬ P {\displaystyle P\leftrightarrow \neg P} is contradictory.

For simplicitly of the argument, assume P N {\displaystyle {\mathcal {P}}{\mathbb {N} }} is a set. Then consider a subset I ⊆ N {\displaystyle I\subseteq {\mathbb {N} }} and a function w : I → P N {\displaystyle w\colon I\to {\mathcal {P}}{\mathbb {N} }} . Further, as in Cantor's theorem about power sets, define^[2] d = { k ∈ N ∣ k ∈ I ∧ D ( k ) } {\displaystyle d=\{k\in {\mathbb {N} }\mid k\in I\land D(k)\}} where, D ( k ) = ¬ ( k ∈ w ( k ) ) . {\displaystyle D(k)=\neg (k\in w(k)).} This is a subclass of N {\displaystyle {\mathbb {N} }} defined in dependency of w {\displaystyle w} and it can also be written d = { k ∈ I ∣ ¬ ( k ∈ w ( k ) ) } . {\displaystyle d=\{k\in I\mid \neg (k\in w(k))\}.} It exists as subset via Separation. Now assuming there exists a number n ∈ I {\displaystyle n\in I} with w ( n ) = d {\displaystyle w(n)=d} implies the contradiction n ∈ d ↔ ¬ ( n ∈ d ) . {\displaystyle n\in d\,\leftrightarrow \,\neg (n\in d).} So as a set, one finds P N {\displaystyle {\mathcal {P}}{\mathbb {N} }} is ω {\displaystyle \omega } -productive in that we can define an obstructing d {\displaystyle d} for any given surjection. Also note that the existence of a surjection f : I ↠ P N {\displaystyle f\colon I\twoheadrightarrow {\mathcal {P}}{\mathbb {N} }} would automatically make P N {\displaystyle {\mathcal {P}}{\mathbb {N} }} into a set, via Replacement in CZF, and so this function existence is unconditionally impossible.

We conclude that the subcountability axiom, asserting all sets are subcountable, is incompatible with P N {\displaystyle {\mathcal {P}}{\mathbb {N} }} being a set, as implied e.g. by the power set axiom.

Following the above prove makes it clear that we cannot map I {\displaystyle I} onto just P I {\displaystyle {\mathcal {P}}I} either. Bounded separation indeed implies that no set X {\displaystyle X} whatsoever maps onto P X {\displaystyle {\mathcal {P}}X} .

Relatedly, for any function h : P Y → Y {\displaystyle h\colon {\mathcal {P}}Y\to Y} , a similar analysis using the subset of its range { y ∈ Y ∣ ∃ ( S ∈ P Y ) . y = h ( S ) ∧ y ∉ S } {\displaystyle \{y\in Y\mid \exists (S\in {\mathcal {P}}Y).y=h(S)\land y\notin S\}} shows that h {\displaystyle h} cannot be an injection. The situation is more complicated for function spaces.^[3]

In classical ZFC without Powerset or any of its equivalents, it is also consistent that all subclasses of the reals which are sets are subcountable. In that context, this translates to the statement that all sets of real numbers are countable.^[4] Of course, that theory does not have the function space set N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} .

By definition of function spaces, the set N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} holds those subsets of the set N × N {\displaystyle {\mathbb {N} }\times {\mathbb {N} }} which are provably total and functional. Asserting the permitted subcountability of all sets turns, in particular, N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} into a subcountable set.

So here we consider a surjective function f : I ↠ N N {\displaystyle f\colon I\twoheadrightarrow {\mathbb {N} }^{\mathbb {N} }} and the subset of N × N {\displaystyle {\mathbb {N} }\times {\mathbb {N} }} separated as^[5] { ⟨ n , y ⟩ ∈ N × N ∣ ( n ∈ I ∧ D ( n , y ) ) ∨ ( ¬ ( n ∈ I ) ∧ y = 1 ) } {\displaystyle {\Big \{}\langle n,y\rangle \in {\mathbb {N} }\times {\mathbb {N} }\mid {\big (}n\in I\land D(n,y){\big )}\lor {\big (}\neg (n\in I)\land y=1{\big )}{\Big \}}} with the diagonalizing predicate defined as D ( n , y ) = ( ¬ ( f ( n ) ( n ) ≥ 1 ) ∧ y = 1 ) ∨ ( ¬ ( f ( n ) ( n ) = 0 ) ∧ y = 0 ) {\displaystyle D(n,y)={\big (}\neg (f(n)(n)\geq 1)\land y=1{\big )}\lor {\big (}\neg (f(n)(n)=0)\land y=0{\big )}} which we can also phrase without the negations as D ( n , y ) = ( f ( n ) ( n ) = 0 ∧ y = 1 ) ∨ ( f ( n ) ( n ) ≥ 1 ∧ y = 0 ) . {\displaystyle D(n,y)={\big (}f(n)(n)=0\land y=1{\big )}\lor {\big (}f(n)(n)\geq 1\land y=0{\big )}.} This set is classically provably a function in N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} , designed to take the value y = 0 {\displaystyle y=0} for particular inputs n {\displaystyle n} . And it can classically be used to prove that the existence of f {\displaystyle f} as a surjection is actually contradictory. However, constructively, unless the proposition n ∈ I {\displaystyle n\in I} in its definition is decidable so that the set actually defined a functional assignment, we cannot prove this set to be a member of the function space. And so we just cannot draw the classical conclusion.

In this fashion, subcountability of N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} is permitted, and indeed models of the theory exist. Nevertheless, also in the case of CZF, the existence of a full surjection N ↠ N N {\displaystyle {\mathbb {N} }\twoheadrightarrow {\mathbb {N} }^{\mathbb {N} }} , with domain N {\displaystyle {\mathbb {N} }} , is indeed contradictory. The decidable membership of I = N {\displaystyle I={\mathbb {N} }} makes the set also not countable, i.e. uncountable.

Beyond these observations, also note that for any non-zero number a {\displaystyle a} , the functions i ↦ f ( i ) ( i ) + a {\displaystyle i\mapsto f(i)(i)+a} in I → N {\displaystyle I\to {\mathbb {N} }} involving the surjection f {\displaystyle f} cannot be extended to all of N {\displaystyle {\mathbb {N} }} by a similar contradiction argument. This can be expressed as saying that there are then partial functions that cannot be extended to full functions in N → N {\displaystyle {\mathbb {N} }\to {\mathbb {N} }} . Note that when given a n ∈ N {\displaystyle n\in {\mathbb {N} }} , one cannot necessarily decide whether n ∈ I {\displaystyle n\in I} , and so one cannot even decide whether the value of a potential function extension on n {\displaystyle n} is already determined for the previously characterized surjection f {\displaystyle f} .

The subcountibility axiom, asserting all sets are subcountable, is incompatible with any new axiom making I {\displaystyle I} countable, including LEM.

The above analysis affects formal properties of codings of R {\displaystyle \mathbb {R} } . Models for the non-classical extension of CZF theory by subcountability postulates have been constructed.^[6] Such non-constructive axioms can be seen as choice principles which, however, do not tend to increase the proof-theoretical strengths of the theories much.

• There are models of IZF in which all sets with apartness relations are subcountable.^[7]
• CZF has a model in, for example, the Martin-Löf type theory M L 1 V {\displaystyle {\mathsf {ML_{1}V}}} . In this constructive set theory with classically uncountable function spaces, it is indeed consistent to assert the Subcountability Axiom, saying that every set is subcountable. As discussed, the resulting theory is in contradiction to the axiom of power set and with the law of excluded middle.
• More stronger yet, some models of Kripke–Platek set theory, a theory without the function space postulate, even validate that all sets are countable.

Subcountability as judgement of small size shall not be conflated with the standard mathematical definition of cardinality relations as defined by Cantor, with smaller cardinality being defined in terms of injections and equality of cardinalities being defined in terms of bijections. Constructively, the preorder " ≤ {\displaystyle \leq } " on the class of sets fails to be decidable and anti-symmetric. The function space N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} (and also { 0 , 1 } N {\displaystyle \{0,1\}^{\mathbb {N} }} ) in a moderately rich set theory is always found to be neither finite nor in bijection with N {\displaystyle {\mathbb {N} }} , by Cantor's diagonal argument. This is what it means to be uncountable. But the argument that the cardinality of that set would thus in some sense exceed that of the natural numbers relies on a restriction to just the classical size conception and its induced ordering of sets by cardinality.

As seen in the example of the function space considered in computability theory, not every infinite subset of N {\displaystyle {\mathbb {N} }} necessarily is in constructive bijection with N {\displaystyle {\mathbb {N} }} , thus making room for a more refined distinction between uncountable sets in constructive contexts. Motivated by the above sections, the infinite set N N {\displaystyle {\mathbb {N} }^{\mathbb {N} }} may be considered "smaller" than the class P N {\displaystyle {\mathcal {P}}{\mathbb {N} }} .

A subcountable set has alternatively also been called subcountably indexed. The analogous notion exists in which " ∃ ( I ⊆ N ) {\displaystyle \exists (I\subseteq {\mathbb {N} })} " in the definition is replaced by the existence of a set that is a subset of some finite set. This property is variously called subfinitely indexed.

In category theory all these notions are subquotients.

• Cantor's diagonal argument
• Computable function
• Constructive set theory
• Schröder–Bernstein theorem
• Subquotient
• Total order