 Ordinal arithmetic

In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation. Each can be defined in essentially two different ways: either by constructing an explicit wellordered set which represents the operation or by using transfinite recursion. Cantor normal form provides a standardized way of writing ordinals. The socalled "natural" arithmetical operations retain commutativity at the expense of continuity.
Contents
Addition
The union of two disjoint wellordered sets S and T can be wellordered. The ordertype of that union is the ordinal which results from adding the ordertypes of S and T. If two wellordered sets are not already disjoint, then they can be replaced by orderisomorphic disjoint sets, e.g. replace S by S × {0} and T by T × {1}. Thus the wellordered set S is written "to the left" of the wellordered set T, meaning one defines an order on S T in which every element of S is smaller than every element of T. The sets S and T themselves keep the ordering they already have. This addition is associative and generalizes the addition of natural numbers.
The first transfinite ordinal is ω, the set of all natural numbers. Let's try to visualize the ordinal ω + ω: two copies of the natural numbers ordered in the normal fashion and the second copy completely to the right of the first. If we write the second copy as {0' < 1' < 2', ...} then ω + ω looks like
 0 < 1 < 2 < 3 < ... < 0' < 1' < 2' < ...
This is different from ω because in ω only 0 does not have a direct predecessor while in ω + ω the two elements 0 and 0' do not have direct predecessors. Here are 3 + ω and ω + 3:
 0 < 1 < 2 < 0' < 1' < 2' < ...
 0 < 1 < 2 < ... < 0' < 1' < 2'
After relabeling, the former just looks like ω itself while the latter does not: we have 3 + ω = ω. But ω + 3 is not equal to ω since ω + 3 has a largest element (namely, 2') and ω does not. So our addition is not commutative.
One can see for example that (ω + 4) + ω = ω + (4 + ω) = ω + ω.
The definition of addition can also be given inductively (the following induction is on β):
 α + 0 = α,
 α + (β + 1) = (α + β) + 1 (here, "+ 1" denotes the successor of an ordinal),
 and if δ is a limit ordinal then α + δ is the limit of the α + β for all β < δ.
Using this definition, we also see that ω + 3 is a successor ordinal (it is the successor of ω + 2) whereas 3 + ω is the limit of 3 + 0 = 3, 3 + 1 = 4, 3 + 2 = 5, etc., which is just ω.
Zero is an additive identity α + 0 = 0 + α = α.
Addition is associative (α + β) + γ = α + (β + γ).
Addition is strictly increasing and continuous in the right argument:
but the analogous relation does not hold for the left argument; instead we only have:
Ordinal addition is leftcancellative: if α + β = α + γ, then β = γ. Furthemore, one can define left subtraction for ordinals β ≤ α: there is a unique γ such that α = β + γ. On the other hand, right cancellation does not work:
 3 + ω = 0 + ω = ω but
Nor does right subtraction, even when β ≤ α: for example, there does not exist any γ such that γ + 42 = ω.
Multiplication
The Cartesian product, S×T, of two wellordered sets S and T can be wellordered by a variant of lexicographical order which puts the least significant position first. Effectively, each element of T is replaced by a disjoint copy of S. The ordertype of the Cartesian product is the ordinal which results from multiplying the ordertypes of S and T. Again, this operation is associative and generalizes the multiplication of natural numbers.
Here is ω·2:
 0_{0} < 1_{0} < 2_{0} < 3_{0} < ... < 0_{1} < 1_{1} < 2_{1} < 3_{1} < ...
and we see: ω·2 = ω + ω. But 2·ω looks like this:
 0_{0} < 1_{0} < 0_{1} < 1_{1} < 0_{2} < 1_{2} < 0_{3} < 1_{3} < ...
and after relabeling, this looks just like ω and so we get 2·ω = ω ≠ ω·2. Hence multiplication of ordinals is not commutative.
Distributivity partially holds for ordinal arithmetic: R(S + T) = RS + RT. However, the other distributive law (T + U)R = TR + UR is not generally true: (1 + 1) ·ω = 2·ω = ω while 1·ω + 1·ω = ω + ω which is different. Therefore, the ordinal numbers do not form a ring.
The definition of multiplication can also be given inductively (the following induction is on β):
 α·0 = 0,
 α·(β + 1) = (α·β) + α,
 and if δ is limit then α·δ is the limit of the α·β for all β < δ.
The main properties of the product are:
 α·0 = 0·α = 0.
 One is a multiplicative identity α·1 = 1·α = α.
 Multiplication is associative (α·β)·γ = α·(β·γ).
 Multiplication is strictly increasing and continuous in the right argument: (α < β and γ > 0) γ·α < γ·β
 In the left argument, do not have the same as in the right argument. For example, 1 < 2 but 1·ω = 2·ω = ω. Instead one gets α ≤ β α·γ ≤ β·γ.
 There is a left cancellation law: If α > 0 and α·β = α·γ, then β = γ.
 Right cancellation does not work e.g. 1·ω = 2·ω = ω but 1 and 2 are different
 α·β = 0 α = 0 or β = 0.
 Distributive law on the left: α·(β + γ) = α·β + α·γ
 No distributive law on the right: e.g. (ω + 1)·2 = ω + 1 + ω + 1 = ω + ω + 1 = ω·2 + 1 which is not ω·2 + 2.
 Left division with remainder: for all α and β, if β > 0, then there are unique γ and δ such that α = β·γ + δ and δ < β. (This does not however mean the ordinals are a Euclidean domain, since they are not even a ring, and the Euclidean "norm" is ordinalvalued.)
 Right division does not work: there is no α such that α·ω ≤ ω^{ω} ≤ (α + 1)·ω.
Exponentiation
Exponentiation of well ordered sets is defined as follows. If the exponent is a finite set, the power is the product of iterated multiplication. For instance, ω^{2} = ω·ω using the operation of ordinal multiplication.
To generalize this to the case when the exponent is an infinite ordinal requires a different viewpoint. Note that ω·ω can be visualized as the set of functions from 2 = {0,1} to ω = {0,1,2,...}, ordered lexicographically with the least significant position first:
 (0,0) < (1,0) < (2,0) < (3,0) < ... < (0,1) < (1,1) < (2,1) < (3,1) < ... < (0,2) < (1,2) < (2,2) < ...
Here for brevity, we have replaced the function {(0,k), (1,m)} by the ordered pair (k, m).
Similarly, for any finite exponent n, ω^{n} can be visualized as the set of functions from n (the domain) to the natural numbers (the range). These functions can be abbreviated as ntuples of natural numbers.
For ω^{ω}, we might try to visualize the set of infinite sequences of natural numbers. However, if we try to use any absolutely defined ordering on this set, we find it is not wellordered. Using the variant lexicographical ordering again, we restrict the set of sequences to those for which only a finite number of elements of the sequence are different from zero. This is naturally motivated as the limit of the finite powers of the base (similar to the concept of coproduct in algebra). This can also be thought of as the infinite union .
The lexicographical order on this set is a well ordering that resembles the ordering of natural numbers written in decimal notation, except with digit positions reversed, and with arbitrary natural numbers instead of just the digits 09:
 (0,0,0,...) < (1,0,0,0,...) < (2,0,0,0,...) < ... <
 (0,1,0,0,0,...) < (1,1,0,0,0,...) < (2,1,0,0,0,...) < ... <
 (0,2,0,0,0,...) < (1,2,0,0,0,...) < (2,2,0,0,0,...)
 < ... <
 (0,0,1,0,0,0,...) < (1,0,1,0,0,0,...) < (2,0,1,0,0,0,...)
 < ...
In general, any well ordered set B can be raised to the power of another well ordered set E, resulting in another well ordered set, the power B^{E}. Each element of B^{E} is a function from E to B such that only a finite number of elements of the domain E map to an element larger than the least element of the range B (essentially, we consider the functions with finite support). The order is lexicographic with the least significant position first.
 We find 1^{ω} = 1, 2^{ω} = ω, .
The order type of the power B^{E} is the ordinal which results from applying ordinal exponentiation to the order type of the base B and the order type of the exponent E.
The definition of exponentiation can also be given inductively (the following induction is on β, the exponent):
 α^{0} = 1,
 α^{β+1} = (α^{β})·α, and
 if δ is limit, then α^{δ} is the limit of the α^{β} for all β < δ.
Properties of ordinal exponentiation:
 α^{0} = 1.
 If 0 < α, then 0^{α} = 0.
 1^{α} = 1.
 α^{1} = α.
 α^{β}·α^{γ} = α^{β + γ}.
 (α^{β})^{γ} = α^{β·γ}.
 There are α, β, and γ for which (α·β)^{γ} ≠ α^{γ}·β^{γ}. For instance, (ω·2)^{2} = ω^{2}·2 ≠ ω^{2}·4.
 Ordinal exponentiation is strictly increasing and continuous in the right argument: If γ > 1 and α < β, then γ^{α} < γ^{β}.
 If α < β, then α^{γ} ≤ β^{γ}. Note, for instance, that 2 < 3 and yet 2^{ω} = 3^{ω} = ω.
 If α > 1 and α^{β} = α^{γ}, then β = γ. If α = 1 or α = 0 this is not the case.
 For all α and β, if β > 1 and α > 0 then there exist unique γ, δ, and ρ such that α = β^{γ}·δ + ρ such that 0 < δ < β and ρ < β^{γ}.
Warning: Ordinal exponentiation is quite different from cardinal exponentiation. For example, the ordinal exponentiation 2^{ω} = ω, but the cardinal exponentiation is the cardinality of the continuum which is larger than . To avoid confusing ordinal exponentiation with cardinal exponentiation, one can use symbols for ordinals (e.g. ω) in the former and symbols for cardinals (e.g. ) in the latter.
Cantor normal form
Ordinal numbers present a rich arithmetic. Every ordinal number α can be uniquely written as , where k is a natural number, are positive integers, and are ordinal numbers (we allow β_{k} = 0). This decomposition of α is called the Cantor normal form of α, and can be considered the baseω positional numeral system. The highest exponent β_{1} is called the degree of α, and satisfies . The equality β_{1} = α applies if and only if α = ω^{α}. In that case Cantor normal form does not express the ordinal in terms of smaller ones; this can happen as explained below.
A minor variation of Cantor normal form, which is usually slightly easier to work with, is to set all the numbers c_{i} equal to 1 and allow the exponents to be equal. In other words, every ordinal number α can be uniquely written as , where k is a natural number, and are ordinal numbers.
The Cantor normal form allows us to uniquely express—and order—the ordinals α which are built from the natural numbers by a finite number of arithmetical operations of addition, multiplication and “raising ω to the power of”: in other words, assuming β_{1} < α in the Cantor normal form, we can also express the exponents β_{i} in Cantor normal form, and making the same assumption for the β_{i} as for α and so on recursively, we get a system of notation for these ordinals (for example,
denotes an ordinal).
The ordinal ε_{0} (epsilon nought) is the set of ordinal values of the finite arithmetical expressions of this form. It is the smallest ordinal that does not have a finite arithmetical expression, and the smallest ordinal such that , i.e. in Cantor normal form the exponent is not smaller than the ordinal itself. It is the limit of the sequence
The ordinal ε_{0} is important for various reasons in arithmetic (essentially because it measures the prooftheoretic strength of the firstorder Peano arithmetic: that is, Peano's axioms can show transfinite induction up to any ordinal less than ε_{0} but not up to ε_{0} itself).
The Cantor normal form also allows us to compute sums and products of ordinals: to compute the sum, for example, one need merely know that
if β' > β (if β' = β one can obviously rewrite this as ω^{β}(c + c'), and if β' < β the expression is already in Cantor normal form); and to compute products, the essential facts are that when is in Cantor normal form (and α>0) then
and
if n is a nonzero natural number.
To compare two ordinals written in Cantor normal form, first compare β_{1}, then c_{1}, then β_{2}, then c_{2}, etc.. At the first difference, the ordinal which has the larger component is the larger ordinal. If they are the same until one terminates before the other, then the one which terminates first is smaller.
Natural operations
The natural sum and natural product operations on ordinals were defined in 1906 by Gerhard Hessenberg, and are sometimes called the Hessenberg sum (or product). (Jacobsthal defined a natural power operation in 1907, which is very rarely used.) They are also sometimes called the Conway operations, as they are just the addition and multiplication (restricted to ordinals) of Conway's field of surreal numbers. They have the advantage that they are associative and commutative, and natural product distributes over natural sum. The cost of making these operations commutative is that they lose the continuity in the right argument which is a property of the ordinary sum and product. The natural sum of α and β is sometimes denoted by α # β, and the natural product by a sort of doubled × sign: α ⨳ β. To define the natural sum of two ordinals, consider once again the disjoint union of two wellordered sets having these order types. Start by putting a partial order on this disjoint union by taking the orders on S and T separately but imposing no relation between S and T. Now consider the order types of all wellorders on which extend this partial order: the least upper bound of all these ordinals (which is, actually, not merely a least upper bound but actually a greatest element) is the natural sum^{[1]}. Alternatively, we can define the natural sum of α and β inductively (by simultaneous induction on α and β) as the smallest ordinal greater than the natural sum of α and γ for all γ < β and of γ and β for all γ < α.
The natural sum is associative and commutative: it is always greater or equal to the usual sum, but it may be greater. For example, the natural sum of ω and 1 is ω+1 (the usual sum), but this is also the natural sum of 1 and ω.
To define the natural product of two ordinals, consider once again the cartesian product S × T of two wellordered sets having these order types. Start by putting a partial order on this cartesian product by using just the product order (compare two pairs if and only if each of the two coordinates is comparable). Now consider the order types of all wellorders on S × T which extend this partial order: the least upper bound of all these ordinals (which is, actually, not merely a least upper bound but actually a greatest element) is the natural product. There is also an inductive definition of the natural product (by mutual induction), but it is somewhat tedious to write down and we will not do so (see the article on surreal numbers for the definition in that context, which, however, uses Conway subtraction, something which obviously cannot be defined on ordinals).
The natural product is associative and commutative and distributes over the natural sum: it is always greater or equal to the usual product, but it may be greater. For example, the natural product of ω and 2 is ω·2 (the usual product), but this is also the natural product of 2 and ω.
Yet another way to define the natural sum and product of two ordinals α and β is to use the Cantor normal form: one can find a sequence of ordinals γ_{1} > … > γ_{n} and two sequences (k_{1}, …, k_{n}) and (j_{1}, …, j_{n}) of natural numbers (including zero, but satisfying k_{i} + j_{i} > 0 for all i) such that
and defines
Notes
References
 Jech, Thomas, 2003. Set Theory: The Third Millennium Edition, Revised and Expanded. Springer. ISBN 3540440852.
 Kunen, Kenneth, 1980. Set Theory: An Introduction to Independence Proofs. Elsevier. ISBN 0444868399.
External links
 Ordinal calculator for download (MSDOS executable or Borland C++ source)
Categories: Set theory
 Ordinal numbers
Wikimedia Foundation. 2010.
Look at other dictionaries:
Ordinal number — This article is about the mathematical concept. For number words denoting a position in a sequence ( first , second , third , etc.), see Ordinal number (linguistics). Representation of the ordinal numbers up to ωω. Each turn of the spiral… … Wikipedia
Ordinal notation — In mathematical logic and set theory, an ordinal notation is a finite sequence of symbols from a finite alphabet which names an ordinal number according to some scheme which gives meaning to the language. There are many such schemes of ordinal… … Wikipedia
Ordinal analysis — In proof theory, ordinal analysis assigns ordinals (often large countable ordinals) to mathematical theories as a measure of their strength. The field was formed when Gerhard Gentzen in 1934 used cut elimination to prove, in modern terms, that… … Wikipedia
Ordinal collapsing function — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger … Wikipedia
ordinal variable — noun A variable with values whose order is significant, but on which no meaningful arithmetic like operations can be performed … Wiktionary
Large countable ordinal — In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of… … Wikipedia
Limit ordinal — A limit ordinal is an ordinal number which is neither zero nor a successor ordinal. Various equivalent ways to express this are: *It cannot be reached via the ordinal successor operation S ; in precise terms, we say lambda; is a limit ordinal if… … Wikipedia
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 … Wikipedia
Additively indecomposable ordinal — In set theory, a branch of mathematics, an additively indecomposable ordinal α is any ordinal number that is not 0 such that for any eta,gamma … Wikipedia
Transfinite arithmetic — In mathematics, transfinite arithmetic is the generalization of elementary arithmetic to infinite quantities like infinite sets. It was originally invented by the German mathematician Georg Cantor. See also * transfinite number * cardinal… … Wikipedia