nLab
universes in SEAR

This page develops a theory of universes in the structural set theory called SEAR, parallel to the theory of Grothendieck universes for ZF and the theory of a universe in a topos. See also categories in SEAR.

David Roberts: Can we talk about Grothendieck universes or analogous size-related mechanisms? (this is a naive question, since there may be (no need for/obvious way to do) this in a structural set theory that I am unaware of.

Mike Shulman: Universes can be defined in any structural set theory in a fairly straightforward way, modulo the usual translation from “set of sets” to “family of sets.” There is some stuff from a more ETCS-like perspective at universe in a topos; I’m sure that this can be rephrased in SEAR (if you want to take a shot, feel free!).

David Roberts: I’d certainly like to, subject to real-world time constraints. It seems to me that something could be done to the axiom of collection if we had a axiom of universes (for every set there is a universe acting as a universal family for it, or similar).

Mike Shulman: I’m not sure that Collection can really be eliminated using universes, but maybe it can.

Using families

David Roberts: Some sketchy thoughts - a universe will be a relation UE satisfying axioms analogous to those at universe in a topos. There are few points that need translating into SEAR-language first so we can define smallness of a family of sets IA

  • Pullback - unless I am mistaken, the appropriate version is this: Given a function IU, the family IE should be regarded as the 'pullback' family. This family should be isomorphic to the family IA. This leads us to wonder how to define two families to be isomorphic.

  • Dependent product - this is tricker and I’m not going to do that right now.

Fix a family of sets UE.

Definition: A family a:IA is called U-small if there is a function f:IU such that for the composite relation IE

A set A is called U-small if the relation 1A, which holds of * and a for all elements a of A, is a U-small family.

For ease of language, we define a composite of families to be the composite relation of the two relations defining the families.

Definition: A family of sets UE is called a universe if the following axioms are satisfied:

  • The composite of two U-small families is U-small
  • The relation f o:BA opposite to an injective function f:AB is a U-small family
  • P1 is a U-small set
  • (Something about dependent products, once these are defined)

There is an optional axiom, given the axiom of infinity from before:

Without this axiom we do not have that universes contain infinite sets.

Given a universe UE, we want to define a (meta-)category USet

Using mere sets

Mike Shulman: The main idea of SEAR is that in a well-pointed topos, global elements suffice for everything. In particular, we can usually dispense with families of things and consider only single ones. So here’s a formulation that I think is more in the spirit of SEAR.

Given a family E:UX, recall that for uU we let E u be a tabulation of {xXE(u,x)}X. We say that a set A is U-small (although really, it would be more appropriate to say ”E-small”) if there exists a uU with AE u. Now we say that U (equipped with E) is a universe if it satisfies:

  • There exists an inhabited U-small set.
  • The tabulation of any relation between two U-small sets is U-small.
  • If A is U-small, then so is PA.
  • (Replacement) If f:AB is a function such that B is U-small and for each bB, the set f 1(b) is U-small, then A is U-small.
  • (Collection) If p:BA is a surjective function where A is U-small, then there exists a U-small set C, a surjection q:CA and a function f:CB such that q=pf.

The optional axiom is the same:

  • There exists an infinite U-small set (in the sense of Axiom 4).

The first two properties of a universe clearly imply that the U-small sets satisfy Axioms 0–2 of SEAR all by themselves. In particular, and 1 are U-small, any subset of a U-small set is U-small, and if A and B are small then so is A×B. Thus from the additional assumption of the smallness of powersets, we can conclude that if A and B are small, so is the set B A of functions from A to B. It also follows that coproducts and quotient sets preserve smallness. (For a notion of “predicative universe” we would replace the smallness of powersets with the smallness of function sets, and we might have to separately assume smallness of coproducts and quotients, I’m not sure.)

In order to show that the U-small sets model SEAR all by themselves, it remains to show:

Theorem

The U-small sets for a universe U satisfy the Collection axiom of SEAR.

Proof

Let A be a U-small set and P a property as in the Collection axiom. Let P be a property such that P(a,X) holds iff P(a,X) holds and X is U-small. By the Collection axiom for all sets applied to P, there exists a set B, a function p:BA, and a B-indexed family of sets M:BY satisfying the desired properties: (1) for any bB, we have P(p(b),M b) and M b is U-small, and (2) for any aA, if there exists a U-small set X with P(a,X), then aim(p). Our goal is to replace B and Y by U-small sets B and Y with a relation M:BY maintaining the truth of these statements.

Now the induced function p¯:Bim(p) is surjective, and since im(p) is a subset of A it is U-small. Thus, by the “Collection” property of a universe, there exists a U-small set C, a surjection q:Cim(p) and a function f:CB such that q=p¯f. We take B=C and the composite Cim(p)A as the function p; we claim that the composite relation Mf still satisfies (1) and (2) above. (We have not replaced Y yet, so this is still an intermediate step.) Property (1) follows since p(c)=p(f(c)) and (Mf) cM f(c), while property (2) follows since im(p)=im(p) by construction.

Now consider a tabulation BrZsY of Mf. Note that for any bB we have r 1(b)(Mf) b, and therefore in particular r 1(b) is U-small by (1). Since B is also U-small, the “Replacement” property of a universe implies that Z is also U-small. But the family r o:BZ is equivalent to Mf, in the sense that (r o) b(Mf) b for all bB, so it also satisfies (1) and (2); thus we can take Y=Z and M=r o.

Note that both the “Replacement” and “Collection” properties of a universe are required to show the SEAR Collection axiom for U-small sets. The naming of these two properties appears to be traditional, however. See in particular the book Algebraic Set Theory by Joyal and Moerdijk.

What about families and dependent products? We define a function, considered as a family of sets, to be U-small if each of its fibers is. Note that then we can state the Replacement property as “the composite of U-small functions is U-small.” Now for functions g:CB and f:BA, the fiber of the dependent product Π fg over aA is the subset of the function set ((fg) 1(a)) f 1(a) consisting of functions s:f 1(a)(fg) 1(a) such that gs=id. Thus, if f and g are U-small, so is fg (by the “Replacement” property), and thus so is this fiber. Hence U-small functions are closed under dependent products.

Also of interest is the following, which should be compared to the “descent” axiom in Joyal-Moerdijk.

Theorem

The following are equivalent for a function f:BA.

  1. f is U-small.

  2. There exist a surjection p:CA and a function g:CU and two pullback squares

    B q P k E f j A p C g U\array{B &\overset{q}{\leftarrow} & P & \overset{k}{\to} & {|E|}\\^f\downarrow && \downarrow^j && \downarrow\\ A &\underset{p}{\twoheadleftarrow} & C & \underset{g}{\to} & U}
  3. (If the axiom of choice holds) There exists a function g:AU and a pullback square

    B E f A g U\array{B & \overset{}{\to} & {|E|}\\^f\downarrow && \downarrow\\ A & \underset{g}{\to} & U}
Proof

Clearly the third condition implies the second. The second implies the first, since pullbacks have isomorphic fibers. And in the presence of AC, the second implies the third, since the surjection p has a section. Thus the difficulty is in showing that the first implies the second.

Suppose that f:BA is U-small. This means that for any aA, there exists a uU and a bijection f 1(a)E u. Let C be the subset of A×U×P(B×E) consisting of those triples (a,u,h) such that h is a bijection f 1(a)E u, and let p:CA and g:CU be the projections. Since f is U-small, p is surjective. Define P to be a pullback of f along p, with projections q:PB and j:PC, and define k:PE by (informally speaking) k(x)=h(q(x)) where j(x)=(a,u,h). Since each h is a bijection, k makes P a pullback of E.