# Universal set

{{#invoke:Hatnote|hatnote}} In set theory, a universal set is a set which contains all objects, including itself.[1] In set theory as usually formulated, the conception of a universal set leads to a paradox (Russell's paradox) and is consequently not allowed. However, some non-standard variants of set theory include a universal set.

## Reasons for nonexistence

Zermelo–Fraenkel set theory and related set theories, which are based on the idea of the cumulative hierarchy, do not allow for the existence of a universal set. Its existence would cause paradoxes which would make the theory inconsistent.

Russell's paradox prevents the existence of a universal set in Zermelo–Fraenkel set theory and other set theories that include Zermelo's axiom of comprehension. This axiom states that, for any formula ${\displaystyle \varphi (x)}$ and any set Template:Mvar, there exists another set

${\displaystyle \{x\in A\mid \varphi (x)\}}$

that contains exactly those elements Template:Mvar of Template:Mvar that satisfy ${\displaystyle \varphi }$. If a universal set Template:Mvar existed and the axiom of comprehension could be applied to it, then there would also exist another set ${\displaystyle \{x\in V\mid x\not \in x\}}$, the set of all sets that do not contain themselves. However, as Bertrand Russell observed, this set is paradoxical. If it contains itself, then it should not contain itself, and vice versa. For this reason, it cannot exist.

### Cantor's theorem

A second 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 automatically 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 Template:Mvar does exist (and ${\displaystyle 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,[2] but this is not possible for Oberschelp’s, since in it the singleton function is provably a set,[3] which leads immediately to paradox in New Foundations.[4]

### Universal objects that are not sets

{{#invoke:main|main}} 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 Template:Mvar and similar large collections as proper classes rather than as sets. One difference between a universal set and a universal class is that the universal class does not contain itself, because proper classes cannot be elements of other classes.{{ safesubst:#invoke:Unsubst||date=__DATE__ |\$B= {{#invoke:Category handler|main}}{{#invoke:Category handler|main}}[citation needed] }} 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

1. Forster 1995 p. 1.
2. Church 1974 p. 308. See also Forster 1995 p. 136 or 2001 p. 17.
3. Oberschelp 1973 p. 40.
4. Holmes 1998 p. 110.

## References

|CitationClass=book }}