# Von Neumann universe

In set theory and related branches of mathematics, the **von Neumann universe**, or **von Neumann hierarchy of sets**, denoted **V**, is the class of hereditary well-founded sets. This collection, which is formalized by Zermelo–Fraenkel set theory (ZFC), is often used to provide an interpretation or motivation of the axioms of ZFC.

The **rank** of a well-founded set is defined inductively as the smallest ordinal number greater than the ranks of all members of the set.^{[1]} In particular, the rank of the empty set is zero, and every ordinal has a rank equal to itself. The sets in *V* are divided into a transfinite hierarchy, called the **cumulative hierarchy**, based on their rank.

## Definition

The cumulative hierarchy is a collection of sets *V*_{α}
indexed by the class of ordinal numbers, in particular, *V*_{α} is the set of all sets having ranks less than α. Thus there is one set *V*_{α} for each ordinal number α; *V*_{α} may be defined by transfinite recursion as follows:

- Let
*V*_{0}be the empty set, {}: - For any ordinal number β, let
*V*_{β+1}be the power set of*V*_{β}: - For any limit ordinal λ, let
*V*_{λ}be the union of all the*V*-stages so far:

A crucial fact about this definition is that there is a single formula φ(α,*x*) in the language of ZFC that defines "the set *x* is in *V*_{α}".

The class *V* is defined to be the union of all the *V*-stages:

An equivalent definition sets

for each ordinal α, where is the powerset of .

The rank of a set *S* is the smallest α such that

### Finite and low cardinality stages of the hierarchy

The first five von Neumann stages *V*_{0} to *V*_{4} may be visualized as follows. (An empty box represents the empty set. A box containing only an empty box represents the set containing only the empty set, and so forth.)

The set *V*_{5} contains 2^{16}=65536 elements. The set *V*_{6} contains 2^{65536} elements, which very substantially exceeds the number of atoms in the known universe. So the finite stages of the cumulative hierarchy cannot be written down explicitly after stage 5. The set *V*_{ω} has the same cardinality as ω. The set *V*_{ω+1} has the same cardinality as the set of real numbers.

## Applications and interpretations

### Applications of *V* as models for set theories

If ω is the set of natural numbers, then *V*_{ω} is the set of hereditarily finite sets, which is a model of set theory without the axiom of infinity.^{[2]}^{[3]}

*V*_{ω+ω} is the universe of "ordinary mathematics", and is a model of Zermelo set theory.^{[4]} (However, since the fairly "ordinary" set ω+ω is not itself an element of *V*_{ω+ω}, it is questionable whether such a universe is adequate for all "ordinary mathematics".) A simple argument in favour of the adequacy of *V*_{ω+ω} is the observation that *V*_{ω+1} is adequate for the integers, while *V*_{ω+2} is adequate for the real numbers, and most other normal mathematics can be built as relations of various kinds from these sets without needing the axiom of replacement to go outside *V*_{ω+ω}.

If κ is an inaccessible cardinal, then *V*_{κ} is a model of Zermelo-Fraenkel set theory (ZFC) itself, and *V*_{κ+1} is a model of Morse–Kelley set theory.^{[5]}^{[6]} (Note that every ZFC model is also a ZF model, and every ZF model is also a Z model.)

### Interpretation of *V* as the "set of all sets"

V is not "the set of all sets" for two reasons. First, it is not a set; although each individual stage *V*_{α} is a set, their union *V* is a proper class. Second, the sets in *V* are only the well-founded sets. The axiom of foundation (or regularity) demands that every set is well founded and hence in *V*, and thus in ZFC every set is in *V*. But other axiom systems may omit the axiom of foundation or replace it by a strong negation (for example is Aczel's anti-foundation axiom). These non-well-founded set theories are not commonly employed, but are still possible to study.

A third objection to the "set of all sets" interpretation is that not all sets are necessarily "pure sets", which are constructed from the empty set using power sets and unions. Zermelo proposed in 1908 the inclusion of urelements, from which he constructed a transfinite recursive hierarchy in 1930.^{[7]} Such urelements are used extensively in model theory, particularly in Fraenkel-Mostowski models.^{[8]}

*V* and the axiom of regularity

The formula *V* = ⋃_{α}*V*_{α} is often considered to be a theorem, not a definition.^{[9]}^{[10]} Roitman states (without references) that the realization that the axiom of regularity is equivalent to the equality of the universe of ZF sets to the cumulative hierarchy is due to von Neumann.^{[11]}

### The existential status of *V*

Since the class *V* may be considered to be the arena for most of mathematics, it is important to establish that it "exists" in some sense. Since existence is a difficult concept, one typically replaces the existence question with the consistency question, that is, whether the concept is free of contradictions. A major obstacle is posed by Gödel's incompleteness theorems, which effectively imply the impossibility of proving the consistency of ZF set theory.^{[12]}

The integrity of the von Neumann universe depends fundamentally on the integrity of the ordinal numbers, which act as the rank parameter in the construction, and the integrity of transfinite induction, by which both the ordinal numbers and the von Neumann universe are constructed. The integrity of the ordinal number construction may be said to rest upon von Neumann's 1923 and 1928 papers.^{[13]} The integrity of the construction of *V* by transfinite induction may be said to have then been established in Zermelo's 1930 paper.^{[7]}

## History

The cumulative type hierarchy, also known as the von Neumann universe, is claimed by Gregory H. Moore (1982) to be inaccurately attributed to von Neumann.^{[14]} The first publication of the von Neumann universe was by Ernst Zermelo in 1930.^{[7]}

Existence and uniqueness of the general transfinite recursive definition of sets was demonstrated in 1928 by von Neumann for both Zermelo-Fraenkel set theory^{[15]} and Neumann's own set theory (which later developed into NBG set theory).^{[16]} In neither of these papers did he apply his transfinite recursive method to construct the universe of all sets. The presentations of the von Neumann universe by Bernays^{[9]} and Mendelson^{[10]} both give credit to von Neumann for the transfinite induction construction method, although not for its application to the construction of the universe of ordinary sets.

The notation *V* is not a tribute to the name of von Neumann. It was used for the universe of sets in 1889 by Peano, the letter *V* signifying "Verum", which he used both as a logical symbol and to denote the class of all individuals.^{[17]} Peano's notation *V* was adopted also by Whitehead and Russell for the class of all sets in 1910.^{[18]} The *V* notation (for the class of all sets) was not used by von Neumann in his 1920s papers about ordinal numbers and transfinite induction. Paul Cohen^{[19]} explicitly attributes his use of the letter *V* (for the class of all sets) to a 1940 paper by Gödel,^{[20]} although Gödel most likely obtained the notation from earlier sources such as Whitehead and Russell.^{[18]}

## See also

- Universe (mathematics)
- Constructible universe
- Grothendieck universe
- Inaccessible cardinal
- S (set theory)
- John von Neumann

## Notes

- ↑ Template:Harvnb; Template:Harvnb; Template:Harvnb.
- ↑ Template:Harvnb, proves that: "
*V*_{ω}is a model of all of the axioms of ZFC except infinity." - ↑ Template:Harvnb, states: "The first really interesting axiom [of ZF set theory] is the Axiom of Infinity. If we drop it, then we can take as a model for ZF the set
*M*of all finite sets which can be built up from ∅. [...] It is clear that*M*will be a model for the other axioms, since none of these lead out of the class of finite sets." - ↑ Template:Harvnb.
See page 96 for proof that
*V*_{ω+ω}is a Zermelo model. - ↑ Template:Harvnb, states and justifies that if κ is strongly inaccessible, then
*V*_{κ}is a model of ZF.- "It is clear that if A is an inaccessible cardinal, then the set of all sets of rank less than A is a model for ZF, since the only two troublesome axioms, Power Set and Replacement, do not lead out of the set of cardinals less than A."

- ↑ Template:Harvnb, proves that if κ is strongly inaccessible, then
*V*_{κ}is a model of ZFC. - ↑
^{7.0}^{7.1}^{7.2}Template:Harvnb. See particularly pages 36–40. - ↑ Template:Harvnb.
- ↑
^{9.0}^{9.1}Template:Harvnb. See pages 203–209. - ↑
^{10.0}^{10.1}Template:Harvnb. See page 202. - ↑ Template:Harvnb. See page 79.
- ↑ See article On Formally Undecidable Propositions of Principia Mathematica and Related Systems and Template:Harvnb.
- ↑ Template:Harvnb, Template:Harvnb. See also the English-language presentation of von Neumann's "general recursion theorem" by Template:Harvnb.
- ↑ Template:Harvnb. See page 279 for the assertion of the false attribution to von Neumann. See pages 270 and 281 for the attribution to Zermelo.
- ↑ Template:Harvnb.
- ↑ Template:Harvnb. See pages 745–752.
- ↑ Template:Harvnb. See pages VIII and XI.
- ↑
^{18.0}^{18.1}Template:Harvnb. See page 229. - ↑ Template:Harvnb. See page 88.
- ↑ Template:Harvnb.

## References

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:Citation/CS1|citation

|CitationClass=journal }}. English translation: {{#invoke:citation/CS1|citation |CitationClass=citation }}

- {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

- {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

- {{#invoke:citation/CS1|citation

|CitationClass=book }}

- {{#invoke:Citation/CS1|citation

|CitationClass=journal }}