Axiom of limitation of size

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In class theories, the axiom of limitation of size says that for any class C, C is a proper class, that is a class which is not a set (an element of other classes), if and only if it can be mapped onto the class V of all sets.[1]

\forall C \biggl( \lnot \exist W \left( C \in W \right) \iff \exist F \Bigl( \forall x \bigl( \exist W \left( x \in W \right) \Rightarrow \exist s \left( s \in C \and \langle s, x \rangle \in F \right) \bigr) \and \forall x \forall y \forall s \bigl( \left( \langle s, x \rangle \in F \and \langle s, y \rangle \in F \right) \Rightarrow x = y \bigr) \Bigr) \biggr).

This axiom is due to John von Neumann. It implies the axiom schema of specification, axiom schema of replacement, axiom of global choice, and even, as noticed later by Azriel Levy, axiom of union[2] at one stroke. The axiom of limitation of size implies the axiom of global choice because the class of ordinals is not a set, so there is a surjection from the ordinals to the universe, thus an injection from the universe to the ordinals, that is, the universe of sets is well-ordered.

Together the axiom of replacement and the axiom of global choice (with the other axioms of von Neumann–Bernays–Gödel set theory) imply this axiom. This axiom is thus equivalent to the combination of replacement, global choice, specification and union in von Neumann–Bernays–Gödel or Morse–Kelley set theory.

However, the axiom of replacement and the usual axiom of choice (with the other axioms of von Neumann–Bernays–Gödel set theory) do not imply von Neumann's axiom. In 1964, Easton used forcing to build a model that satisfies the axioms of von Neumann–Bernays–Gödel set theory with one exception: the axiom of global choice is replaced by the axiom of choice. In Easton's model, the axiom of limitation of size fails dramatically: the universe of sets cannot even be linearly ordered.[3]

It can be shown that a class is a proper class if and only if it is equinumerous to V, but von Neumann's axiom does not capture all of the "limitation of size doctrine",[4] because the axiom of power set is not a consequence of it. Later expositions of class theories (Bernays, Gödel, Kelley, ...) generally use replacement and a form of the axiom of choice rather than the axiom of limitation of size.

History[edit]

Von Neumann developed the axiom of limitation of size as a new method of identifying sets. ZFC identifies sets via its set building axioms. However, as Abraham Fraenkel pointed out: "The rather arbitrary character of the processes which are chosen in the axioms of Z [ZFC] as the basis of the theory, is justified by the historical development of set-theory rather than by logical arguments."[5]

The historical development of the ZFC axioms began in 1908 when Zermelo chose axioms to support his proof of the well-ordering theorem and to avoid contradictory sets.[6] In 1922, Fraenkel and Skolem pointed out that Zermelo's axioms cannot prove the existence of the set {Z0, Z1, Z2, … } where Z0 is the set of natural numbers, and Zn+1 is the power set of Zn.[7] They also introduced the axiom of replacement, which guarantees the existence of this set.[8] However, adding axioms as they are needed neither guarantees the existence of all reasonable sets nor clarifies the difference between sets that are safe to use and collections that lead to contradictions.

In a 1923 letter to Zermelo, von Neumann outlined an approach to set theory that identifies the sets that are "too big" (now called proper classes) and that can lead to contradictions.[9] Von Neumann identified these sets using the criterion: "A set is 'too big' if and only if it is equivalent to the set of all things."[10] He then restricted how these sets may be used: "… in order to avoid the paradoxes those [sets] which are 'too big' are declared to be impermissible as elements."[11] By combining this restriction with his criterion, von Neumann obtained the axiom of limitation of size (which in the language of classes states): A class X is not an element of any class if and only if X is equivalent to the class of all sets.[12] So von Neumann identified sets as classes that are not equivalent to the class of all sets. Von Neumann realized that, even with his new axiom, his set theory does not fully characterize sets.[13]

Gödel found von Neumann's axiom to be "of great interest":

"In particular I believe that his [von Neumann's] necessary and sufficient condition which a property must satisfy, in order to define a set, is of great interest, because it clarifies the relationship of axiomatic set theory to the paradoxes. That this condition really gets at the essence of things is seen from the fact that it implies the axiom of choice, which formerly stood quite apart from other existential principles. The inferences, bordering on the paradoxes, which are made possible by this way of looking at things, seem to me, not only very elegant, but also very interesting from the logical point of view.[14] Moreover I believe that only by going farther in this direction, i.e., in the direction opposite to constructivism, will the basic problems of abstract set theory be solved."[15]

Zermelo's models and the axiom of limitation of size[edit]

In 1930, Zermelo published an article on models of set theory, in which he proved that some of his models satisfy the axiom of limitation of size. These models are built in ZFC by using the cumulative hierarchy Vα, which is defined by transfinite recursion:

  1. V0 = .[16]
  2. Vα+1 = VαP(Vα). That is, the union of Vα and its power set.[17]
  3. For limit β: Vβ = ∪α < β Vα. That is, Vβ is the union of the preceding Vα.

Zermelo worked with models of the form Vκ where κ is a cardinal. The classes of the model are the subsets of Vκ, and the model's ∈-relation is the standard ∈-relation. The sets of the model Vκ are the classes X such that XVκ.[18] Zermelo identified cardinals κ such that Vκ satisfies:[19]

Theorem 1. A class X is a set if and only if | X | < κ.
Theorem 2. | Vκ | = κ.

Since every class is a subset of Vκ, Theorem 2 implies that every class X has cardinality ≤ κ. Combining this with Theorem 1 proves: Every proper class has cardinality κ. Hence, every proper class can be put into one-to-one correspondence with Vκ, so the axiom of limitation of size holds for the model Vκ.

The proof of the axiom of global choice in Vκ is more direct than von Neumann's proof. First note that κ (being a von Neumann cardinal) is a well-ordered class of cardinality κ. Since Theorem 2 states that Vκ has cardinality κ, there is a one-to-one correspondence between κ and Vκ. This correspondence produces a well-ordering of Vκ, which implies the axiom of global choice.[20] Von Neumann uses the Burali-Forti paradox to prove by contradiction that the class of all ordinals is a proper class, and then he applies the axiom of limitation of size to well-order the universal class.[21]

The model Vω[edit]

To demonstrate that Theorems 1 and 2 hold for some Vκ, we need to prove that if a set belongs to Vα then it belongs to all subsequent Vβ, or equivalently: VαVβ for α ≤ β. This is proved by transfinite induction on β:

  1. β = 0: V0V0.
  2. For β+1: By inductive hypothesis, VαVβ. Hence, VαVβVβP(Vβ) = Vβ+1.
  3. For limit β: If α < β, then Vα ⊆ ∪ξ < β Vξ = Vβ. If α = β, then VαVβ.

Note that sets enter the hierarchy only through the power set P(Vβ) at step β+1. We will need the following definitions:

If x is a set, rank(x) is the least ordinal β such that xVβ+1.[22]
The supremum of a set of ordinals A, denoted by sup A, is the least ordinal β such that α ≤ β for all α ∈ A.

Zermelo's smallest model is Vω. Induction proves that Vn is finite for all n < ω:

  1. | V0 | = 0.
  2. | Vn+1 | = | VnP(Vn) | ≤ | Vn | + 2 | Vn |, which is finite since Vn is finite by inductive hypothesis.

To prove Theorem 1: since a set X enters Vω only through P(Vn) for some n < ω, we have XVn. Since Vn is finite, X is finite. Conversely: if a class X is finite, let N = sup {rank(x): xX}. Since rank(x) ≤ N for all xX, we have XVN+1, so XVN+2Vω. Therefore, XVω.

To prove Theorem 2, note that Vω is the union of countably many finite sets. Hence, Vω is countably infinite and has cardinality \aleph_0 (which equals ω by von Neumann cardinal assignment).

It can be shown that the sets and classes of Vω satisfy all the axioms of NBG (von Neumann–Bernays–Gödel set theory) except the axiom of infinity.

The models Vκ where κ is a strongly inaccessible cardinal[edit]

To find models satisfying the axiom of infinity, observe that two properties of finiteness were used to prove Theorems 1 and 2 for Vω:

  1. If λ is a finite cardinal, then 2λ is finite.
  2. If A is a set of ordinals such that | A | is finite, and α is finite for all α ∈ A, then sup A is finite.

Replacing "finite" by "< κ" produces the properties that define strongly inaccessible cardinals. A cardinal κ is strongly inaccessible if κ > ω and:

  1. If λ is a cardinal such that λ < κ, then 2λ < κ.
  2. If A is a set of ordinals such that | A | < κ, and α < κ for all α ∈ A, then sup A < κ.

These properties assert that κ cannot be reached from below. The first property says κ cannot be reached by power sets; the second says κ cannot be reached by the axiom of replacement.[23] Just as the axiom of infinity is required to obtain ω, an axiom is needed to obtain strongly inaccessible cardinals. Zermelo postulated the existence of an unbounded sequence of strongly inaccessible cardinals.[24]

If κ is a strongly inaccessible cardinal, then transfinite induction proves | Vα | < κ for all α < κ:

  1. α = 0: | V0 | = 0.
  2. For α+1: | Vα+1 | = | VαP(Vα) | ≤ | Vα | + 2 | Vα | = 2 | Vα | < κ. Last inequality uses inductive hypothesis and κ being strongly inaccessible.
  3. For limit α: | Vα | = | ∪ξ < α Vξ | ≤ sup {| Vξ | : ξ < α} < κ. Last inequality uses inductive hypothesis and κ being strongly inaccessible.

To prove Theorem 1: since a set X enters Vκ only through P(Vα) for some α < κ, we have XVα. Since | Vα | < κ, we have | X | < κ. Conversely: if a class X has | X | < κ, let β = sup {rank(x): xX}. Since κ is strongly inaccessible, | X | < κ, and rank(x) < κ for all xX, we have β < κ. Also, rank(x) ≤ β for all xX implies XVβ+1, so XVβ+2Vκ. Therefore, XVκ.

To prove Theorem 2, we compute: | Vκ | = | ∪α < κ Vα | ≤ sup {| Vα | : α < κ}. Let β be this supremum. Since each ordinal in the supremum is less than κ, we have β ≤ κ. Now β cannot be less than κ. If it were, there would be a cardinal λ such that β < λ < κ; for example, take λ = 2 | β |. Since λ ⊆ Vλ and | Vλ | is in the supremum, we have λ ≤ | Vλ | ≤ β. This contradicts β < λ. Therefore, | Vκ | = β = κ.

It can be shown that the sets and classes of Vκ satisfy all the axioms of NBG.[25]

See also[edit]

Notes[edit]

  1. ^ This is roughly von Neumann's original formulation, see Fraenkel & al, p. 137.
  2. ^ showing directly that a set of ordinals has an upper bound, see A. Levy, " On von Neumann's axiom system for set theory ", Amer. Math. Monthly, 75 (1968), p. 762-763.
  3. ^ Easton 1964.
  4. ^ Fraenkel & al, p. 137. A guiding principle for ZF to avoid set theoretical paradoxes is to restrict to instances of full (contradictory) comprehension scheme that do not give sets "too much bigger" than the ones they use; it is known as "limitation of size", Fraenkel & al call it "limitation of size doctrine", see p. 32.
  5. ^ Historical Introduction in Bernays 1991, p. 31.
  6. ^ "... we must, on the one hand, restrict these principles [axioms] sufficiently to exclude all contradictions and, on the other hand, take them sufficiently wide to retain all that is valuable in this theory." (Zermelo 1908, p. 261; English translation, p. 200). Gregory Moore analyzed Zermelo's reasons behind his axiomatization and concluded that "his axiomatization was primarily motivated by a desire to secure his demonstration of the Well-Ordering Theorem …" and "For Zermelo, … the paradoxes were an inessential obstacle to be circumvented with as little fuss as possible." (Moore 1982, p. 159–160).
  7. ^ Frankel 1922, p. 230–231; Skolem 1922 (English translation, p. 296–297).
  8. ^ Ferreirós 2007, p. 369. In 1917, Mirimanoff published a form of replacement based on cardinal equivalence (Mirimanoff 1917, p. 49).
  9. ^ He gave a detailed exposition of his set theory in two articles: von Neumann 1925 and von Neumann 1928.
  10. ^ Hallett 1984, p. 288.
  11. ^ Hallett 1984, p. 290.
  12. ^ Hallett 1984, p. 290. Von Neumann later changed "equivalent to the class of all sets" to "can be mapped onto the class of all sets."
  13. ^ To be precise, von Neumann investigated whether his set theory is categorical; that is, whether it uniquely determines sets in the sense that any two of its models are isomorphic. He showed that it is not categorical because of a weakness in the axiom of regularity: this axiom only excludes descending ∈-sequences from existing in the model; descending sequences may still exist outside the model. A model having "external" descending sequences is not isomorphic to a model having no such sequences since this latter model lacks isomorphic images for the sets belonging to external descending sequences. This led von Neumann to conclude "that no categorical axiomatization of set theory seems to exist at all" (von Neumann 1925, p. 239; English translation: p. 412).
  14. ^ For example, von Neumann's proof that his axiom implies the well-ordering theorem uses the Burali-Forte paradox (von Neumann 1925, p. 223; English translation: p. 398).
  15. ^ From a Nov. 8, 1957 letter Gödel wrote to Stanislaw Ulam (Kanamori 2003, p. 295).
  16. ^ This is the standard definition of V0. Zermelo let V0 be a set of urelements and proved that if this set contains a single element, the resulting model satisfies the axiom of limitation of size (his proof also works for V0 = ∅). Zermelo stated that the axiom is not true for all models built from a set of urelements. (Zermelo 1930, p. 38; English translation: p. 1227.)
  17. ^ This is Zermelo's definition (Zermelo 1930, p. 36; English translation: p. 1225 & p. 1209), which is equivalent to Vα+1 = P(Vα) since VαP(Vα) (Kunen 1980, p. 95; Kunen uses the notation R(α) instead of Vα).
  18. ^ In NBG, X is a set if there is a class Y such that XY. Since YVκ, we have XVκ. Conversely, if XVκ, then X belongs to a class, so X is a set.
  19. ^ These theorems are part of Zermelo's Second Development Theorem. (Zermelo 1930, p. 37; English translation: p. 1226.)
  20. ^ The domain of the global choice function consists of the non-empty sets of Vκ; this function uses the well-ordering of Vκ to choose the least element of each set.
  21. ^ Von Neumann 1925, p. 223. English translation: p. 398. Von Neumann's proof, which only uses axioms, has the advantage of applying to all models rather than just to Vκ.
  22. ^ Kunen 1980, p. 95.
  23. ^ Zermelo introduced strongly inaccessible cardinals κ so that Vκ would satisfy ZFC. The axioms of power set and replacement led him to the properties of strongly inaccessible cardinals. (Zermelo 1930, p. 31–35; English translation: p. 1221–1224.) Independently, Sierpiński and Tarski also introduced these cardinals in 1930.
  24. ^ Zermelo used this sequence of cardinals to obtain a sequence of models that explains the paradoxes of set theory — such as, the Burali-Forti paradox and Russell's paradox. He stated that the paradoxes "depend solely on confusing set theory itself … with individual models representing it. What appears as an 'ultrafinite non- or super-set' in one model is, in the succeeding model, a perfectly good, valid set with both a cardinal number and an ordinal type, and is itself a foundation stone for the construction of a new domain [model]." (Zermelo 1930, p. 46–47; English translation: p. 1233.)
  25. ^ Zermelo proved that ZFC without the axiom of infinity is satisfied by Vκ for κ = ω and κ strongly inaccessible. To prove the class existence axioms of NBG (Gödel 1940, p. 5), note that Vκ is a set when viewed from the set theory that constructs it. Therefore, the axiom of specification produces subsets of Vκ that satisfy the class existence axioms.

References[edit]

  • William B. Easton (1964), Powers of Regular Cardinals, Ph.D. thesis, Princeton University.
  • Ferreirós, José (2007), Labyrinth of Thought: A History of Set Theory and Its Role in Mathematical Thought (2nd revised ed.), Basel, Switzerland: Birkhäuser, ISBN 3-7643-8349-6 .
  • Fraenkel, Abraham; Bar-Hillel, Yehoshua; Levy, Azriel (1973), Foundations of Set Theory (2nd revised ed.), Basel, Switzerland: Elsevier, ISBN 0-7204-2270-1 .
  • Gödel, Kurt (1940), The Consistency of the Continuum Hypothesis, Princeton University Press .
  • Kanamori, Akihiro, "Stanislaw Ulam",   in: Solomon Fefermann and John W. Dawson, Jr. (editors-in-chief) (2003), Kurt Gödel Collected Works, Volume V, Correspondence H-Z, Clarendon Press, pp. 280–300 .
  • Moore, Gregory H. (1982), Zermelo's Axiom of Choice: Its Origins, Development, and Influence, Springer, ISBN 0-387-90670-3 .
  • Skolem, Thoralf (1922), "Einige Bemerkungen zur axiomatischen Begründung der Mengenlehre", Matematikerkongressen i Helsingfors den 4-7 Juli, 1922, pp. 217–232 . English translation: van Heijenoort, Jean (1967), "Some remarks on axiomatized set theory", From Frege to Godel: A Source Book in Mathematical Logic, 1879-1931, Harvard University Press, pp. 290–301, ISBN 978-0-674-32449-7 .