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 [\lnot \exist W (C \in W) \iff \exist F ( \forall x [\exist W (x \in W) \Rightarrow \exist s (s \in C \and \langle s, x \rangle \in F)] \and
\forall x \forall y \forall s [(\langle s, x \rangle \in F \and \langle s, y \rangle \in F) \Rightarrow x = y])].

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 can then replace replacement, global choice, specification and union in von Neumann–Bernays–Gödel or Morse–Kelley set theory.

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",[3] 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 axiom of choice rather than axiom of limitation of size.

[edit] See also

[edit] Notes

  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),. 762-763
  3. ^ 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 donnot give "too bigger" sets than the ones they use; it is known as "limitation of size", Fraenkel & al call it "limitation of size doctrine", see p 32.

[edit] References


Personal tools
Namespaces
Variants
Actions
Navigation
Interaction
Toolbox
Print/export
Languages