nLab subset collection

Subset collection

Subset collection


In set theory and the foundations of mathematics, the axiom of fullness is an axiom intermediate in strength between the existence of power sets and function sets. Of course, these can only be distinguished in constructive mathematics, since classically power sets and function sets are equivalent (at least if you have the set 2={,}\mathbf{2} = \{\top, \bot\}).

The axiom of subset collection combines fullness with the axiom of collection to apply in the situations where fullness is used. In the presence (I think) of either collection or full separation, subset collection is equivalent to fullness.


In its guise as fullness, the axiom states that, given any sets XX and YY, there is a set F X,YF_{X,Y} of enough entire relations from XX to YY in this sense:

  • Every element of F X,YF_{X,Y} is an entire relation from XX to YY;
  • If RR is an entire relation from XX to YY, then for some SF X,YS \in F_{X,Y}, SRS \subseteq R.

We have written this in a material fashion; structurally, the axiom says that F X,YF_{X,Y} parametrises enough entire relations in this sense:

  • There is a subset E X,YE_{X,Y} of F X,Y×X×YF_{X,Y} \times X \times Y such that:

    • for every element rr of F X,YF_{X,Y} and every element aa of XX, there is an element bb of YY such that (r,a,b)E X,Y(r,a,b) \in E_{X,Y};

    (we think of E X,YE_{X,Y} as giving the evaluation, as a truth value, of rr, as an entire relation, on the elements aa and bb).

  • If RR is an entire relation from XX to YY, then for some ss in F X,YF_{X,Y}:

    • for every element aa of XX and bb of YY, if (s,a,b)E X,Y(s,a,b) \in E_{X,Y}, then aa is RR-related to bb;

    (we think of ss as an entire relation via E X,YE_{X,Y} and say that it is contained in RR).

In the context of material set theory, the structural axiom is weaker than the material axiom, but they become equivalent in the presence of restricted replacement, which is quite weak.

You can also write down an internal version of fullness by adding arbitrary additional parameters to the structural version above (analogously to the generalisation from power set to power object, although more complicated since F X,YF_{X,Y} is not given by a universal property).

Given function sets, fullness is equivalent to the set theory having sets of inhabited subsets, since an entire relation between AA and BB is a function from AA to the set of inhabited subsets of BB. (Power sets on the other hand are sets of all subsets).

In its guise as subset collection, the axiom states …

I need to look this up again, including the conditions for its equivalence with fullness. In the meantime, see the Stanford Encyclopedia’s list of axioms.

 In dependent type theory

In dependent type theory, given a Russell universe UU, the type of all entire relations between types A:UA:U and B:UB:U is given by the type

R:A×BU x:A( y:AisProp(R(x,y)))×y:A.R(x,y)\sum_{R:A \times B \to U} \prod_{x:A} \left(\prod_{y:A} \mathrm{isProp}(R(x, y))\right) \times \exists y:A.R(x, y)

In general, this type is not U U -small. The axiom of fullness for UU states that the above type is UU-small, and is given by the following inference rules:

ΓA:UΓB:UΓEntRel(A,B):U\frac{\Gamma \vdash A:U \quad \Gamma \vdash B:U}{\Gamma \vdash \mathrm{EntRel}(A, B):U}
ΓA:UΓB:UΓEntRel(A,B) R:A×BU x:A( y:AisProp(R(x,y)))×y:A.R(x,y)type\frac{\Gamma \vdash A:U \quad \Gamma \vdash B:U}{\Gamma \vdash \mathrm{EntRel}(A, B) \equiv \sum_{R:A \times B \to U} \prod_{x:A} \left(\prod_{y:A} \mathrm{isProp}(R(x, y))\right) \times \exists y:A.R(x, y) \; \mathrm{type}}

Similarly, for Tarski universes (U,T)(U, T), the type of all entire relations between UU-small types A:UA:U and B:UB:U is given by the type

R:T(A)×T(B)U x:T(A)( y:T(A)isProp(T(R(x,y))))×y:T(A).T(R(x,y))\sum_{R:T(A) \times T(B) \to U} \prod_{x:T(A)} \left(\prod_{y:T(A)} \mathrm{isProp}(T(R(x, y)))\right) \times \exists y:T(A).T(R(x, y))

There are similar inference rules for strict Tarski universes:

ΓA:UΓB:UΓEntRel(A,B):U\frac{\Gamma \vdash A:U \quad \Gamma \vdash B:U}{\Gamma \vdash \mathrm{EntRel}(A, B):U}
ΓA:UΓB:UΓT(EntRel(A,B)) R:T(A)×T(B)U x:T(A)( y:T(A)isProp(T(R(x,y))))×y:T(A).T(R(x,y))type\frac{\Gamma \vdash A:U \quad \Gamma \vdash B:U}{\Gamma \vdash T(\mathrm{EntRel}(A, B)) \equiv \sum_{R:T(A) \times T(B) \to U} \prod_{x:T(A)} \left(\prod_{y:T(A)} \mathrm{isProp}(T(R(x, y)))\right) \times \exists y:T(A).T(R(x, y)) \; \mathrm{type}}

For weak Tarski universes, one uses an equivalence of types instead of judgmental equality

ΓA:UΓB:UΓfullness(A,B):T(EntRel(A,B)) R:T(A)×T(B)U x:T(A)( y:T(A)isProp(T(R(x,y))))×y:T(A).T(R(x,y))\frac{\Gamma \vdash A:U \quad \Gamma \vdash B:U}{\Gamma \vdash \mathrm{fullness}(A, B):T(\mathrm{EntRel}(A, B)) \simeq \sum_{R:T(A) \times T(B) \to U} \prod_{x:T(A)} \left(\prod_{y:T(A)} \mathrm{isProp}(T(R(x, y)))\right) \times \exists y:T(A).T(R(x, y))}

and the two inference rules could be reduced down to the element:

fullness: F:U×UU A:U B:UT(F(A,B)) R:T(A)×T(B)U x:T(A)( y:T(A)isProp(T(R(x,y))))×y:T(A).T(R(x,y))\mathrm{fullness}:\sum_{F:U \times U \to U} \prod_{A:U} \prod_{B:U} T(F(A, B)) \simeq \sum_{R:T(A) \times T(B) \to U} \prod_{x:T(A)} \left(\prod_{y:T(A)} \mathrm{isProp}(T(R(x, y)))\right) \times \exists y:T(A).T(R(x, y))

If the dependent type theory does not have any type universes at all, one could still express the axiom of fullness by explicitly postulating the type of all entire relations using inference rules.

Relation to other axioms

In the presence of the usual basic axioms of set theory (in particular, the axioms of bounded separation and pairing in a material set theory and the existence of equalisers and products in a structural set theory), we have:

power sets → fullness → function sets

On the one hand, F X,YF_{X,Y} can be constructed as the subset of the power set 𝒫(X×Y)\mathcal{P}(X \times Y) consisting of all entire relations from XX to YY. On the other hand, the function set Y XY^X may be constructed as a subset of F X,YF_{X,Y} consisting of those elements SS such that SRS \subseteq R for RR (the graph of) some function from XX to YY; (the key here is that S=RS = R must follow when SS is entire and RR is a function). Conversely, if we have function sets, then the axiom of choice states precisely that the function set Y XY^X always qualifies as F X,YF_{X,Y} (although function sets and excluded middle are already sufficient for power sets and thus fullness).

Fullness also follows from function sets in the presence of COSHEP, a fairly strong but constructive (in that it implies no general principle of omniscience) form of the axiom of choice. If PP is a projective set with a surjection p:PXp\colon P \to X (which this axiom asserts must exist), then we may take Y PY^P as F X,YF_{X,Y}, with (r,a,b)E X,Y(r,a,b) \in E_{X,Y} iff, for some cc in PP, p(c)=ap(c) = a and r(c)=br(c) = b.

Note that F X,YF_{X,Y} is not categorical (in the logicians' sense); that is, there may be many sets F,F,F, F', \ldots that all satisfy the axiom without being (in an appropriate sense) equal. This is the downside to adopting the fullness axiom, compared to power sets or function sets; this is also why the internal version is complicated.

As fullness is weaker than power sets in a constructive framework, we may consider it predicative in the sense of the constructive school; this is one reason for adopting it while rejecting power sets. One reason for adopting it instead of (only) function sets is this: it is strong enough to construct the set R\mathbf{R} of (located Dedekind) real numbers from the set N\mathbf{N} of natural numbers without assuming excluded middle or countable choice; see below.

Relation to type theory

Subset collection is justified by predicative versions of constructive type theory in the sense of Martin–Löf or Thierry Coquand. To see this, note that these theories justify COSHEP; their types define (not sets in general but) presets (following Bishop) or completely presented sets, which (as sets) are projective. Analogously, an element of F X,YF_{X,Y} may be considered an operation or prefunction (following ‘preset’) from XX to YY.

But note that the type of prefunctions from XX to YY, like the preset underlying XX, is a categorical (unique) construction in type theory, while F X,YF_{X,Y}, like COSHEP, is not. Thus type theory (or rather preset theory) gives us constructions that are not available in set theory (even with fullness or even COSHEP), such as the predicate that states whether two functions have equal underlying prefunctions.

Definition of R\mathbf{R}

We consider this application in some detail; see also real number object.

Using function sets, one can easily construct the set R C\mathbf{R}_C of Cauchy reals as a subquotient of the function set N N\mathbf{N}^{\mathbf{N}}. Both classical and constructive mathematicians usually adopt axioms in which one can prove that R=R C\mathbf{R} = \mathbf{R}_C; this is equivalent to a weak countable choice principle (identified by Fred Richman et al) that follows from either excluded middle (classically accepted) or countable choice (usually constructively accepted). But there are (for example) some Grothendieck toposes in which R=R C\mathbf{R} = \mathbf{R}_C (as a statement in the Mitchell–Bénabou language) fails, so any sort of constructive mathematics that wants to apply to such toposes cannot rely on this method to define the real numbers object R\mathbf{R}.

Of course, in a topos, there are other ways to define R\mathbf{R}, but what if you want your theory to also be predicative? If you adopt the fullness axiom, then you can modify the definition of R C\mathbf{R}_C to produce a definition of R\mathbf{R} without assuming any choice principle. Instead of using N N\mathbf{N}^{\mathbf{N}}, you use F N,NF_{\mathbf{N},\mathbf{N}} instead; R\mathbf{R} can be constructed as a subquotient of that set.

Let an element of F N,NF_{\mathbf{N},\mathbf{N}} be a presequence of natural numbers, and fix a bijection ϕ:NQ\phi\colon \mathbf{N} \to \mathbf{Q} between N\mathbf{N} and the set Q\mathbf{Q} of rational numbers. We call such a presequence rr regular if, whenever i,j,x,yi,j,x,y are natural numbers such that r(i,x)r(i,x) and r(j,y)r(j,y), we have

|ϕ(x)ϕ(y)|1/i+1/j. {|\phi(x) - \phi(y)|} \leq 1/i + 1/j .

(It is common, but not really necessary in the presence of function sets, to use regular sequences instead of the more general Cauchy sequences when defining R C\mathbf{R}_C in constructive mathematics, and we follow that here.) We call two regular presequences r,sr,s equivalent if, whenever i,j,x,yi,j,x,y are natural numbers such that r(i,x)r(i,x) and s(j,y)s(j,y), we have

|ϕ(x)ϕ(y)|1/i+1/j. {|\phi(x) - \phi(y)|} \leq 1/i + 1/j .

Then this defines an equivalence relation on the set of regular presequences, and the quotient set is R\mathbf{R}. (That is, it may be given, in the usual way, the structure of a linearly ordered Heyting field which is Dedekind-complete relative to located pairs of upper and lower sets.)

Last revised on October 15, 2023 at 21:32:06. See the history of this page for a list of all contributions to it.