Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Von Neumann universe

From Wikipedia, the free encyclopedia
Set theory concept

Inset theory and related branches ofmathematics, thevon Neumann universe, orvon Neumann hierarchy of sets, denoted byV, is theclass ofhereditarywell-founded sets. This collection, which is formalized byZermelo–Fraenkel set theory (ZFC), is often used to provide an interpretation or motivation of the axioms of ZFC. The concept is named afterJohn von Neumann, although it was first published byErnst Zermelo in 1930.

Therank of a well-founded set is defined inductively as the smallestordinal number greater than the ranks of all members of the set.[1] In particular, the rank of theempty set is zero, and every ordinal has a rank equal to itself. The sets inV are divided into thetransfinite hierarchyVα, calledthe cumulative hierarchy, based on their rank.

Definition

[edit]
An initial segment of the von Neumann universe. Ordinal multiplication is reversed from our usual convention; seeOrdinal arithmetic.

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

A crucial fact about this definition is that there is a single formula φ(α,x) in the language of ZFC that states "the setx is inVα".

The setsVα are calledstages orranks.

The classV is defined to be the union of all theV-stages:

V:=αVα.{\displaystyle V:=\bigcup _{\alpha }V_{\alpha }.}

Rank of a set

[edit]

Therank of a setS is the smallest α such thatSVα.{\displaystyle S\subseteq V_{\alpha }\,.} In other words,P(Vα){\displaystyle {\mathcal {P}}(V_{\alpha })} is the set of sets with rank ≤α. The stageVα 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α:=β<αP(Vβ).{\displaystyle V_{\alpha }:=\bigcup _{\beta <\alpha }{\mathcal {P}}(V_{\beta }).}

This gives an equivalent definition ofVα by transfinite recursion.

Substituting the above definition ofVα back into the definition of the rank of a set gives a self-contained recursive definition:

The rank of a set is the smallest ordinal number strictly greater than the rank of all of its members.

In other words,

rank(S)={rank(z)+1zS}.{\displaystyle \operatorname {rank} (S)=\bigcup \{\operatorname {rank} (z)+1\mid z\in S\}.}

Finite and low cardinality stages of the hierarchy

[edit]

The first five von Neumann stagesV0 toV4 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 exhibitstetrational growth. The setV5 contains 216 = 65536 elements; the setV6 contains 265536 elements, which very substantially exceeds thenumber of atoms in the observable universe; and for any naturaln{\displaystyle n}, the setVn+1 contains2↑↑n{\displaystyle 2\uparrow \uparrow n} elements usingKnuth's up-arrow notation. So the finite stages of the cumulative hierarchy cannot physically be written down explicitly after stage 5. The setVω has the same cardinality as ω. The setVω+1 has the same cardinality as the set of real numbers.

Applications and interpretations

[edit]

Applications ofV as models for set theories

[edit]

If ω is the set ofnatural numbers, thenVω is the set ofhereditarily finite sets, which is amodel of set theory without theaxiom of infinity.[2][3]

Vω+ω is theuniverse of "ordinary mathematics", and is a model ofZermelo set theory (but not a model ofZF).[4] A simple argument in favour of the adequacy ofVω+ω is the observation thatVω+1 is adequate for the integers, whileVω+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 theaxiom of replacement to go outsideVω+ω.

If κ is aninaccessible cardinal, thenVκ is a model ofZermelo–Fraenkel set theory (ZFC) itself, andVκ+1 is a model ofMorse–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 ofV as the "set of all sets"

[edit]

V is not "theset of all (naive) sets" for two reasons. First, it is not a set; although each individual stageVα is a set, their unionV is aproper class. Second, the sets inV are only the well-founded sets. Theaxiom of foundation (or regularity) demands that every set be well founded and hence inV, and thus in ZFC every set is inV. But other axiom systems may omit the axiom of foundation or replace it by a strong negation (an example isAczel'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 ofurelements, from which he constructed a transfinite recursive hierarchy in 1930.[7] Such urelements are used extensively inmodel theory, particularly in Fraenkel-Mostowski models.[8]

Hilbert's paradox

[edit]

The von Neumann universe satisfies the following two properties:

Indeed, ifxV{\displaystyle x\in V}, thenxVα{\displaystyle x\in V_{\alpha }} for some ordinalα{\displaystyle \alpha }. Any stage is atransitive set, hence everyyx{\displaystyle y\in x} is alreadyyVα{\displaystyle y\in V_{\alpha }}, and so every subset ofx{\displaystyle x} is a subset ofVα{\displaystyle V_{\alpha }}. Therefore,P(x)Vα+1{\displaystyle {\mathcal {P}}(x)\subseteq V_{\alpha +1}} andP(x)Vα+2V{\displaystyle {\mathcal {P}}(x)\in V_{\alpha +2}\subseteq V}. For unions of subsets, ifxV{\displaystyle x\subseteq V}, then for everyyx{\displaystyle y\in x}, letβy{\displaystyle \beta _{y}} be the smallest ordinal for whichyVβy{\displaystyle y\in V_{\beta _{y}}}. Because by assumptionx{\displaystyle x} is a set, we can form the limitα=sup{βy:yx}{\displaystyle \alpha =\sup\{\beta _{y}:y\in x\}}. The stages are cumulative, and therefore again everyyx{\displaystyle y\in x} isyVα{\displaystyle y\in V_{\alpha }}. Then everyzy{\displaystyle z\in y} is alsozVα{\displaystyle z\in V_{\alpha }}, and soxVα{\displaystyle \cup x\subseteq V_{\alpha }} andxVα+1{\displaystyle \cup x\in V_{\alpha +1}}.

Hilbert's paradox implies that no set with the above properties exists .[9] For supposeV{\displaystyle V} was a set. ThenV{\displaystyle V} would be a subset of itself, andU=V{\displaystyle U=\cup V} would belong toV{\displaystyle V}, and so wouldP(U){\displaystyle {\mathcal {P}}(U)}. But more generally, ifAB{\displaystyle A\in B}, thenAB{\displaystyle A\subseteq \cup B}. Hence,P(U)V=U{\displaystyle {\mathcal {P}}(U)\subseteq \cup V=U}, which is impossible in models of ZFC such asV{\displaystyle V} itself.

Interestingly,x{\displaystyle x} is a subset ofV{\displaystyle V} if, and only if,x{\displaystyle x} is a member ofV{\displaystyle V}. Therefore, we can consider what happens if the union condition is replaced withxVxV{\displaystyle x\in V\implies \cup x\in V}. In this case, there are no known contradictions, and anyGrothendieck universe satisfies the new pair of properties. However, whether Grothendieck universes exist is a question beyond ZFC.

V and the axiom of regularity

[edit]

The formulaV = ⋃αVα is often considered to be a theorem, not a definition.[10][11] Roitman states (without references) that the realization that theaxiom of regularity is equivalent to the equality of the universe of ZF sets to the cumulative hierarchy is due to von Neumann.[12]

The existential status ofV

[edit]

Since the classV 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 byGö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.[13]

The integrity of the von Neumann universe depends fundamentally on the integrity of theordinal numbers, which act as the rank parameter in the construction, and the integrity oftransfinite 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.[14] The integrity of the construction ofV by transfinite induction may be said to have then been established in Zermelo's 1930 paper.[7]

History

[edit]

The cumulative type hierarchy, also known as the von Neumann universe, is claimed by Gregory H. Moore (1982) to be inaccurately attributed tovon Neumann.[15] The first publication of the von Neumann universe was byErnst 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[16] and von Neumann's own set theory (which later developed intoNBG set theory).[17] 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[10] and Mendelson[11] 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 notationV is not a tribute to the name of von Neumann. It was used for the universe of sets in 1889 by Peano, the letterV signifying "Verum", which he used both as a logical symbol and to denote the class of all individuals.[18] Peano's notationV was adopted also by Whitehead and Russell for the class of all sets in 1910.[19] TheV 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[20] explicitly attributes his use of the letterV (for the class of all sets) to a 1940 paper by Gödel,[21] although Gödel most likely obtained the notation from earlier sources such as Whitehead and Russell.[19]

Philosophical perspectives

[edit]

There are two approaches to understanding the relationship of the von Neumann universeV to ZFC (along with many variations of each approach, and shadings between them). Roughly, formalists will tend to viewV as something that flows from the ZFC axioms (for example, ZFC proves that every set is inV). On the other hand, realists are more likely to see the von Neumann hierarchy as something directly accessible to the intuition, and the axioms of ZFC as propositions for whose truth inV we can give direct intuitive arguments in natural language. A possible middle position is that the mental picture of the von Neumann hierarchy provides the ZFC axioms with a motivation (so that they are not arbitrary), but does not necessarily describe objects with real existence.[citation needed]

See also

[edit]

Notes

[edit]
  1. ^Mirimanoff 1917;Moore 2013, pp. 261–262;Rubin 1967, p. 214.
  2. ^Roitman 2011, p. 136, proves that: "Vω is a model of all of the axioms of ZFC except infinity."
  3. ^Cohen 2008, p. 54, 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 setM of all finite sets which can be built up from ∅. [...] It is clear thatM will be a model for the other axioms, since none of these lead out of the class of finite sets."
  4. ^Smullyan & Fitting 2010.See page 96 for proof thatVω+ω is a Zermelo model.
  5. ^Cohen 2008, p. 80, states and justifies that if κ is strongly inaccessible, thenVκ 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."
  6. ^Roitman 2011, pp. 134–135, proves that if κ is strongly inaccessible, thenVκ is a model of ZFC.
  7. ^abcZermelo 1930. See particularly pages 36–40.
  8. ^Howard & Rubin 1998, pp. 175–221.
  9. ^A. Kanamori, "Zermelo and Set Theory", p.490. Bulletin of Symbolic Logic vol. 10, no. 4 (2004). Accessed 21 August 2023.
  10. ^abBernays 1991. See pages 203–209.
  11. ^abMendelson 1964. See page 202.
  12. ^Roitman 2011. See page 79.
  13. ^See articleOn Formally Undecidable Propositions of Principia Mathematica and Related Systems andGödel 1931.
  14. ^von Neumann 1923,von Neumann 1928b. See also the English-language presentation of von Neumann's "general recursion theorem" byBernays 1991, pp. 100–109.
  15. ^Moore 2013. See page 279 for the assertion of the false attribution to von Neumann. See pages 270 and 281 for the attribution to Zermelo.
  16. ^von Neumann 1928b.
  17. ^von Neumann 1928a. See pages 745–752.
  18. ^Peano 1889. See pages VIII and XI.
  19. ^abWhitehead & Russell 2009. See page 229.
  20. ^Cohen 2008. See page 88.
  21. ^Gödel 1940.

References

[edit]
Overview
Venn diagram of set intersection
Axioms
Operations
  • Concepts
  • Methods
Set types
Theories
Set theorists
General
Theorems (list)
 and paradoxes
Logics
Traditional
Propositional
Predicate
Set theory
Types ofsets
Maps and cardinality
Set theories
Formal systems (list),
language and syntax
Example axiomatic
systems
 (list)
Proof theory
Model theory
Computability theory
Related
Retrieved from "https://en.wikipedia.org/w/index.php?title=Von_Neumann_universe&oldid=1317119353"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp