Laboratory demand management strategies: An overview

In set theory, a universal set is a set which contains all objects, including itself.^[1] In set theory as usually formulated, it can be proven in multiple ways that a universal set does not exist. However, some non-standard variants of set theory include a universal set.

Reasons for nonexistence

Many set theories do not allow for the existence of a universal set. There are several different arguments for its non-existence, based on different choices of axioms for set theory.

Russell's paradox

Russell's paradox concerns the impossibility of a set of sets, whose members are all sets that do not contain themselves. If such a set could exist, it could neither contain itself (because its members all do not contain themselves) nor avoid containing itself (because if it did, it should be included as one of its members).^[2] This paradox prevents the existence of a universal set in set theories that include either Zermelo's axiom of restricted comprehension, or the axiom of regularity and axiom of pairing.

Regularity and pairing

In Zermelo–Fraenkel set theory, the axiom of regularity and axiom of pairing prevent any set from containing itself. For any set $A$ , the set $\{A\}$ (constructed using pairing) necessarily contains an element disjoint from $\{A\}$ , by regularity. Because its only element is $A$ , it must be the case that $A$ is disjoint from $\{A\}$ , and therefore that $A$ does not contain itself. Because a universal set would necessarily contain itself, it cannot exist under these axioms.^[3]

Comprehension

Russell's paradox prevents the existence of a universal set in set theories that include Zermelo's axiom of restricted comprehension. This axiom states that, for any formula $\varphi (x)$ and any set $A$ , there exists a set $\{x\in A\mid \varphi (x)\}$ that contains exactly those elements $x$ of $A$ that satisfy $\varphi$ .^[2]

If this axiom could be applied to a universal set $A$ , with $\varphi (x)$ defined as the predicate $x\notin x$ , it would state the existence of Russell's paradoxical set, giving a contradiction. It was this contradiction that led the axiom of comprehension to be stated in its restricted form, where it asserts the existence of a subset of a given set rather than the existence of a set of all sets that satisfy a given formula.^[2]

When the axiom of restricted comprehension is applied to an arbitrary set $A$ , with the predicate $\varphi (x)\equiv x\notin x$ , it produces the subset of elements of $A$ that do not contain themselves. It cannot be a member of $A$ , because if it were it would be included as a member of itself, by its definition, contradicting the fact that it cannot contain itself. In this way, it is possible to construct a witness to the non-universality of $A$ , even in versions of set theory that allow sets to contain themselves. This indeed holds even with predicative comprehension and over intuitionistic logic.

Cantor's theorem

Another difficulty with the idea of a universal set concerns the power set of the set of all sets. Because this power set is a set of sets, it would necessarily be a subset of the set of all sets, provided that both exist. However, this conflicts with Cantor's theorem that the power set of any set (whether infinite or not) always has strictly higher cardinality than the set itself.

Theories of universality

The difficulties associated with a universal set can be avoided either by using a variant of set theory in which the axiom of comprehension is restricted in some way, or by using a universal object that is not considered to be a set.

Restricted comprehension

There are set theories known to be consistent (if the usual set theory is consistent) in which the universal set $V$ does exist (and $V\in V$ is true). In these theories, Zermelo's axiom of comprehension does not hold in general, and the axiom of comprehension of naive set theory is restricted in a different way. A set theory containing a universal set is necessarily a non-well-founded set theory. The most widely studied set theory with a universal set is Willard Van Orman Quine's New Foundations. Alonzo Church and Arnold Oberschelp also published work on such set theories. Church speculated that his theory might be extended in a manner consistent with Quine's,^[4] but this is not possible for Oberschelp's, since in it the singleton function is provably a set,^[5] which leads immediately to paradox in New Foundations.^[6]

Another example is positive set theory, where the axiom of comprehension is restricted to hold only for the positive formulas (formulas that do not contain negations). Such set theories are motivated by notions of closure in topology.

Universal objects that are not sets

The idea of a universal set seems intuitively desirable in the Zermelo–Fraenkel set theory, particularly because most versions of this theory do allow the use of quantifiers over all sets (see universal quantifier). One way of allowing an object that behaves similarly to a universal set, without creating paradoxes, is to describe $V$ and similar large collections as proper classes rather than as sets. Russell's paradox does not apply in these theories because the axiom of comprehension operates on sets, not on classes.

The category of sets can also be considered to be a universal object that is, again, not itself a set. It has all sets as elements, and also includes arrows for all functions from one set to another. Again, it does not contain itself, because it is not itself a set.

Notes

^ Forster (1995), p. 1.
^ ^a ^b ^c Irvine & Deutsch (2021).
^ Cenzer et al. (2020).
^ Church (1974, p. 308). See also Forster (1995, p. 136), Forster (2001, p. 17), and Sheridan (2016).
^ Oberschelp (1973), p. 40.
^ Holmes (1998), p. 110.

References

Cenzer, Douglas; Larson, Jean; Porter, Christopher; Zapletal, Jindrich (2020). Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic. World Scientific. p. 2. doi:10.1142/11324. ISBN 978-981-12-0192-9. S2CID 208131473.
Church, Alonzo (1974). "Set theory with a universal set". Proceedings of the Tarski Symposium: An international symposium held at the University of California, Berkeley, June 23–30, 1971, to honor Alfred Tarski on the occasion of his seventieth birthday. Proceedings of Symposia in Pure Mathematics. Vol. 25. Providence, Rhode Island: American Mathematical Society. pp. 297–308. MR 0369069.
Forster, T. E. (1995). Set Theory with a Universal Set: Exploring an Untyped Universe. Oxford Logic Guides. Vol. 31. Oxford University Press. ISBN 0-19-851477-8.
Forster, Thomas (2001). "Church's set theory with a universal set". In Anderson, C. Anthony; Zelëny, Michael (eds.). Logic, Meaning and Computation: Essays in Memory of Alonzo Church. Synthese Library. Vol. 305. Dordrecht: Kluwer Academic Publishers. pp. 109–138. MR 2067968.
Holmes, M. Randall (1998). Elementary set theory with a universal set. Cahiers du Centre de Logique [Reports of the Center of Logic]. Vol. 10. Université Catholique de Louvain, Département de Philosophie, Louvain-la-Neuve. ISBN 2-87209-488-1. MR 1759289.
Irvine, Andrew David; Deutsch, Harry (Spring 2021). "Russell's Paradox". In Zalta, Edward N. (ed.). The Stanford Encyclopedia of Philosophy.
Oberschelp, Arnold (1973). Set theory over classes. Dissertationes Mathematicae (Rozprawy Matematyczne). Vol. 106. Instytut Matematyczny Polskiej Akademii Nauk. MR 0319758.
Willard Van Orman Quine (1937) "New Foundations for Mathematical Logic," American Mathematical Monthly 44, pp. 70–80.
Sheridan, Flash (2016). "A variant of Church's set theory with a universal set in which the singleton function is a set" (PDF). Logique et Analyse. 59 (233): 81–131. JSTOR 26767819. MR 3524800.

External links

Weisstein, Eric W. "Universal Set". MathWorld.
Bibliography: Set Theory with a Universal Set, originated by T. E. Forster and maintained by Randall Holmes.

[FOOTNOTEForster19951-1] Forster (1995), p. 1.

[FOOTNOTEIrvineDeutsch2021-2] Irvine & Deutsch (2021).

[FOOTNOTECenzerLarsonPorterZapletal2020-3] Cenzer et al. (2020).

[4] Church (1974, p. 308). See also Forster (1995, p. 136), Forster (2001, p. 17), and Sheridan (2016).

[FOOTNOTEOberschelp197340-5] Oberschelp (1973), p. 40.

[FOOTNOTEHolmes1998110-6] Holmes (1998), p. 110.

[1]

[2]

[3]

[4]

[5]

[6]

Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy projective Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo