Successor Ordinal

When defining the ordinal numbers, an absolutely fundamental operation that we can perform on them is a successor operation S to get the next higher one. Using von Neumann's ordinal numbers (the standard ordinals used in set theory), we have, for any ordinal number,
S(\alpha) = \alpha \cup \{\alpha\}.
It is immediate that there is no ordinal number between α and S(α) and with the ordering on the ordinal numbers α < β if and only if \alpha \in \beta, it is clear that α < S(α). An ordinal number which is S(β) for some ordinal β is called a successor ordinal. Ordinals which are not successors are called limit ordinals. We can use this operation to define ordinal addition rigorously via transfinite induction as follows:
\alpha + 0 = \alpha
\alpha + S(\beta) = S(\alpha + \beta)
and for a limit ordinal λ
\alpha + \lambda = \bigcup_{\beta < \lambda} (\alpha + \beta)
In particular, S(α) = α + 1. Multiplication and exponentiation are defined similarly. Also see limit ordinal.

 

<< PreviousWord BrowserNext >>
william cohen
love and rockets (comics)
buzzerquiz
jim
frank (comics)
faygo
jim woodring
mountaineering: the freedom of the hills
successor cardinal
medal
terry zwigoff
black bag job
crumb
estres
list of major ufo sightings
olympia snowe
irish rugby football union
titoism
coalition for freedom of information
lansdowne road
dick shelby
jeff sessions
southern cone
gordon smith
puuc
serpentine
bob packwood
university of maryland baltimore county
len bias
chuck grassley
little, big
tom harkin
dialer
colorimetry
sagarmatha national park
kabah, yucatn
patriot's day
robin butler, baron butler of brockwell
operation ivory coast
condominium (international law)
condominium
penobscot
long toed stint
rice cooker