Another way of defining a limit ordinal is to say that λ is a limit ordinal if and only if:
- There is an ordinal less than λ and whenever β is an ordinal less than λ, then there exists an ordinal γ such that β < γ < λ.
So in the following sequence:
- 0, 1, 2, ... , ω, ω+1
ω is a limit ordinal because for any smaller ordinal (in this example, a natural number) we can find another ordinal (natural number) larger than it, but still less than ω.
Various other ways to define limit ordinal are:
- It is equal to the supremum of all the ordinals below it, but is not zero. (Compare with a successor ordinal: the set of ordinals below it has a maximum, so the supremum is this maximum, the previous ordinal.)
- It is not zero and has no maximum element.
- It can be written in the form ωα for α > 0. That is, in the Cantor normal form there is no finite number as last term, and the ordinal is nonzero.
- It is a limit point of the class of ordinal numbers, with respect to the order topology. (The other ordinals are isolated points.)
Some contention exists on whether or not 0 should be classified as a limit ordinal, as it does not have an immediate predecessor; some textbooks include 0 in the class of limit ordinals while others exclude it.
Because the class of ordinal numbers is well-ordered, there is a smallest infinite limit ordinal; denoted by ω (omega). The ordinal ω is also the smallest infinite ordinal (disregarding limit), as it is the least upper bound of the natural numbers. Hence ω represents the order type of the natural numbers. The next limit ordinal above the first is ω + ω = ω·2, which generalizes to ω·n for any natural number n. Taking the union (the supremum operation on any set of ordinals) of all the ω·n, we get ω·ω = ω2, which generalizes to ωn for any natural number n. This process can be further iterated as follows to produce:
In general, all of these recursive definitions via multiplication, exponentiation, repeated exponentiation, etc. yield limit ordinals. All of the ordinals discussed so far are still countable ordinals. However, there is no recursively enumerable scheme for systematically naming all ordinals less than the Church–Kleene ordinal, which is a countable ordinal.
Beyond the countable, the first uncountable ordinal is usually denoted ω1. It is also a limit ordinal.
Continuing, one can obtain the following (all of which are now increasing in cardinality):
In general, we always get a limit ordinal when taking the union of a set of ordinals that has no maximum element.
The ordinals of the form ω²α, for α > 0, are limits of limits, etc.
The classes of successor ordinals and limit ordinals (of various cofinalities) as well as zero exhaust the entire class of ordinals, so these cases are often used in proofs by transfinite induction or definitions by transfinite recursion. Limit ordinals represent a sort of "turning point" in such procedures, in which one must use limiting operations such as taking the union over all preceding ordinals. In principle, one could do anything at limit ordinals, but taking the union is continuous in the order topology and this is usually desirable.
If we use the Von Neumann cardinal assignment, every infinite cardinal number is also a limit ordinal (and this is a fitting observation, as cardinal derives from the Latin cardo meaning hinge or turning point): the proof of this fact is done by simply showing that every infinite successor ordinal is equinumerous to a limit ordinal via the Hotel Infinity argument.
Cardinal numbers have their own notion of successorship and limit (everything getting upgraded to a higher level).
- for example, Thomas Jech, Set Theory. Third Millennium edition. Springer.
- for example, Kenneth Kunen, Set Theory. An introduction to independence proofs. North-Holland.