This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Von Neumann cardinal assignment" – news ·newspapers ·books ·scholar ·JSTOR(February 2010) (Learn how and when to remove this message) |
Thevon Neumann cardinal assignment is acardinal assignment that usesordinal numbers. For awell-orderable setU, we define itscardinal number to be the smallest ordinal numberequinumerous toU, using the von Neumann definition of an ordinal number. More precisely:
where ON is theclass of ordinals. This ordinal is also called theinitial ordinal of the cardinal.
That such an ordinal exists and is unique is guaranteed by the fact thatU is well-orderable and that the class of ordinals is well-ordered, using theaxiom of replacement. With the fullaxiom of choice,every set is well-orderable, so every set has a cardinal; we order the cardinals using the inherited ordering from the ordinal numbers. This is readily found to coincide with the ordering via ≤c. This is a well-ordering of cardinal numbers.
Each ordinal has an associatedcardinal, its cardinality, obtained by simply forgetting the order. Any well-ordered set having that ordinal as itsorder type has the same cardinality. The smallest ordinal having a given cardinal as its cardinality is called the initial ordinal of that cardinal. Every finite ordinal (natural number) is initial, but most infinite ordinals are not initial. Theaxiom of choice is equivalent to the statement that every set can be well-ordered, i.e. that every cardinal has an initial ordinal. In this case, it is traditional to identify the cardinal number with its initial ordinal, and we say that the initial ordinalis a cardinal.
The-th infinite initial ordinal is written. Its cardinality is written (the-thaleph number). For example, the cardinality of is, which is also the cardinality of,, and (all arecountable ordinals). So we identify with, except that the notation is used for writing cardinals, and for writing ordinals. This is important becausearithmetic on cardinals is different fromarithmetic on ordinals, for example = whereas > . Also, is the smallestuncountable ordinal (to see that it exists, consider the set ofequivalence classes of well-orderings of the natural numbers; each such well-ordering defines a countable ordinal, and is the order type of that set), is the smallest ordinal whose cardinality is greater than, and so on, and is the limit of for natural numbers (any limit of cardinals is a cardinal, so this limit is indeed the first cardinal after all the).
Infinite initial ordinals are limit ordinals. Using ordinal arithmetic, implies, and 1 ≤α < ωβ impliesα · ωβ = ωβ, and 2 ≤α < ωβ impliesαωβ = ωβ. Using theVeblen hierarchy,β ≠ 0 andα < ωβ imply and Γωβ = ωβ. Indeed, one can go far beyond this. So as an ordinal, an infinite initial ordinal is an extremely strong kind of limit.