Von Neumann universe

From testwiki
Jump to navigation Jump to search

Template:Short description In set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted by 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 concept is named after John von Neumann, although it was first published by Ernst Zermelo in 1930.

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 the transfinite hierarchy Template:V-N-UTemplate:Space, called the cumulative hierarchy, based on their rank.

Definition

An initial segment of the von Neumann universe. Ordinal multiplication is reversed from our usual convention; see Ordinal arithmetic.

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

A crucial fact about this definition is that there is a single formula φ(α,x) in the language of ZFC that states "(α is an ordinal and) the set x is in Template:V-N-U".

The sets Template:V-N-U are called stages or ranks.

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

V:=⋃αVα.

Rank of a set

The rank of a set S is the smallest α such that S⊆Vα. In other words, 𝒫(Vα) is the set of sets with rank ≤α. The stage Template:V-N-U can also be characterized as the set of sets with rank strictly less than α, regardless of whether α is 0, a successor ordinal, or a limit ordinal:

Vα:=⋃β<α𝒫(Vβ).

This gives an equivalent definition of Template:V-N-U by transfinite recursion.

Substituting the above definition of Template:V-N-U back into the definition of the rank of a set gives a self-contained recursive definition:

Template:Block indent

In other words,

rank⁡(S)=⋃{rank⁡(z)+1∣z∈S}.

Finite and low cardinality stages of the hierarchy

The first five von Neumann stages Template:V-N-U to Template:V-N-U 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.)

First 5 von Neumann stages
First 5 von Neumann stages

This sequence exhibits tetrational growth. The set Template:V-N-U contains 2Template:Sup = 65536 elements; the set Template:V-N-U contains 2Template:Sup elements, which very substantially exceeds the number of atoms in the observable universe; and for any natural n, the set Template:V-N-U contains 2↑↑n elements using Knuth's up-arrow notation. So the finite stages of the cumulative hierarchy cannot physically be written down explicitly after stage 5. The set Template:V-N-U has the same cardinality as ω. The set Template:V-N-U has the same cardinality as the set of real numbers.

Applications and interpretations

Interpretation as the set-theoretical universe

In the standard Zermelo–Fraenkel set theory, Template:Mvar is simply the universe, i.e., the class of all sets. It is a proper class, and thus not "the set of all sets", even though each individual stage Template:V-N-U is a set, because the index Template:Mvar ranges over the class of all ordinals, a proper class. The universality of Template:Mvar also depends on the axiom of foundation (also known as the axiom of regularity). In non-well-founded set theories, the universe is larger than Template:Mvar since the former also contains non-well-founded sets.

Often, Template:Mvar is defined as the universe, and then the formula Template:Math means "the universe of ZF sets is equal to the cumulative hierarchy"—not a definition, but a theorem equivalent to the axiom of regularity.[2][3] Roitman states (without references) that the realization of this equivalence is due to von Neumann.[4]

By the modern definition, Template:Mvar also does not include urelements in the first stage, and thus only contains "pure sets". However, Zermelo's original construction of his transfinite recursive hierarchy in 1930 includes all urelements in Template:V-N-U (Template:Math in his notation), with the empty set considered a special case of an urelement.[5]

Applications of V as models for set theories

If ω is the set of natural numbers, then Template:V-N-U is the set of hereditarily finite sets, which is a model of set theory without the axiom of infinity.[6][7]

'Template:V-N-U is the universe of "ordinary mathematics", and is a model of Zermelo set theory (but not a model of ZF).[8] A simple argument in favour of the adequacy of Template:V-N-U is the observation that Template:V-N-U is adequate for the integers, while Template:V-N-U 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 Template:V-N-U.

If κ is an inaccessible cardinal, then Template:V-N-U is a model of Zermelo–Fraenkel set theory (ZFC) itself, and Template:V-N-U is a model of Morse–Kelley set theory.[9][10] (Note that every ZFC model is also a ZF model, and every ZF model is also a Z model.)

Hilbert's paradox

The von Neumann universe satisfies the following two properties:

  • 𝒫(x)∈V for every set x∈V.
  • ⋃x∈V for every subset x⊆V.

Indeed, if x∈V, then x∈Vα for some ordinal α. Any stage is a transitive set, hence every y∈x is already y∈Vα, and so every subset of x is a subset of Vα. Therefore, 𝒫(x)⊆Vα+1 and 𝒫(x)∈Vα+2⊆V. For unions of subsets, if x⊆V, then for every y∈x, let βy be the smallest ordinal for which y∈Vβy. Because by assumption x is a set, we can form the limit α=sup⁡{βy:y∈x}. The stages are cumulative, and therefore again every y∈x is y∈Vα. Then every z∈y is also z∈Vα, and so ∪x⊆Vα and ∪x∈Vα+1.

Hilbert's paradox implies that no set with the above properties exists .[11] For suppose V was a set. Then V would be a subset of itself, and U=∪V would belong to V, and so would 𝒫(U). But more generally, if A∈B, then A⊆∪B. Hence, 𝒫(U)⊆∪V=U, which is impossible in models of ZFC such as V itself.

Interestingly, x is a subset of V if, and only if, x is a member of V. Therefore, we can consider what happens if the union condition is replaced with x∈V⟹∪x∈V. In this case, there are no known contradictions, and any Grothendieck universe satisfies the new pair of properties. However, whether Grothendieck universes exist is a question beyond ZFC.

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 in ZF set theory itself, provided that it is in fact consistent.[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.[5]

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.[5]

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 von 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[2] and Mendelson[3] 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

Template:Div col

Template:Colend

Notes

Template:Reflist

References

Template:Set theory Template:Mathematical logic

  1. ↑ Template:Harvnb; Template:Harvnb; Template:Harvnb.
  2. ↑ 2.0 2.1 Template:Harvnb. See pages 203–209.
  3. ↑ 3.0 3.1 Template:Harvnb. See page 202.
  4. ↑ Template:Harvnb. See page 79.
  5. ↑ 5.0 5.1 5.2 Template:Harvnb. See particularly pages 36–40.
  6. ↑ Template:Harvnb, proves that: "Template:V-N-U is a model of all of the axioms of ZFC except infinity."
  7. ↑ 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."
  8. ↑ Template:Harvnb. See page 96 for proof that Template:V-N-U is a Zermelo model.
  9. ↑ Template:Harvnb, states and justifies that if κ is strongly inaccessible, then Template:V-N-U 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."
  10. ↑ Template:Harvnb, proves that if κ is strongly inaccessible, then Template:V-N-U is a model of ZFC.
  11. ↑ A. Kanamori, "Zermelo and Set Theory", p.490. Bulletin of Symbolic Logic vol. 10, no. 4 (2004). Accessed 21 August 2023.
  12. ↑ See article On Formally Undecidable Propositions of Principia Mathematica and Related Systems and Template:Harvnb.
  13. ↑ Template:Harvnb, Template:Harvnb. See also the English-language presentation of von Neumann's "general recursion theorem" by Template:Harvnb.
  14. ↑ 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.
  15. ↑ Template:Harvnb.
  16. ↑ Template:Harvnb. See pages 745–752.
  17. ↑ Template:Harvnb. See pages VIII and XI.
  18. ↑ 18.0 18.1 Template:Harvnb. See page 229.
  19. ↑ Template:Harvnb. See page 88.
  20. ↑ Template:Harvnb.