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 two different ways: either by constructing an explicit well-ordered set that represents the result of the operation or by using transfinite recursion. Cantor normal form provides a standardized way of writing ordinals. In addition to these usual ordinal operations, there are also the "natural" arithmetic of ordinals and the nimber operations.
Addition
The sum of two well-ordered sets and is the ordinal representing the variant of lexicographical order with least significant position first, on the union of the Cartesian products and. This way, every element of is smaller than every element of, comparisons within keep the order they already have, and likewise for comparisons within.The definition of ordinal addition can also be given by transfinite recursion on. When the right addend, addition gives for any. For, the value of is the smallest ordinal strictly greater than the sum of and for all. Writing the successor and limit ordinals cases separately:
- , where denotes the successor function.
- when is a limit ordinal.
This is different from because in only does not have a direct predecessor while in the two elements and do not have direct predecessors.
Properties
Ordinal addition is, in general, not commutative. For example, since the order relation for is, which can be relabeled to. In contrast is not equal to since the order relation has a largest element and does not.Ordinal addition is still associative; one can see for example that.
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 left-cancellative: if, then. Furthermore, one can define left subtraction for ordinals : there is a unique such that. On the other hand, right cancellation does not work:
Nor does right subtraction, even when : for example, there does not exist any such that.
If the ordinals less than are closed under addition and contain, then is occasionally called a -number. These are exactly the ordinals of the form .
Multiplication
The Cartesian product,, of two well-ordered sets and can be well-ordered by a variant of lexicographical order that puts the least significant position first. Effectively, each element of is replaced by a disjoint copy of. The order-type of the Cartesian product is the ordinal that results from multiplying the order-types of and.The definition of ordinal multiplication can also be given by transfinite recursion on. When the right factor, multiplication gives for any. For, the value of is the smallest ordinal greater than or equal to for all. Writing the successor and limit ordinals cases separately:
- .
- , for a successor ordinal.
- , when is a limit ordinal.
which has the same order type as. In contrast, looks like this:
and after relabeling, this looks just like.
Thus,, showing that multiplication of ordinals is not in general commutative, c.f. pictures.
As is the case with addition, ordinal multiplication on the natural numbers is the same as standard multiplication.
Properties
, and the zero-product property holds: implies or. The ordinal is a multiplicative identity,. Multiplication is associative,. Multiplication is strictly increasing and continuous in the right argument: implies. Multiplication is not strictly increasing in the left argument, for example, but. However, it is increasing, i.e. implies.Multiplication of ordinals is not in general commutative. Specifically, a natural number greater than never commutes with any infinite ordinal, and two infinite ordinals and commute if and only if for some nonzero natural numbers and. The relation " commutes with is an equivalence relation on the ordinals greater than, and all equivalence classes are countably infinite.
Distributivity holds, on the left:. However, the distributive law on the right is not generally true: while, which is different. There is a left cancellation law: If and, then. Right cancellation does not apply, e.g., but and are different. A left division with remainder property holds: for all and, if, then there are unique and such that and. Right division does not work: there is no such that.
The ordinal numbers form a left near-semiring, but do not form a ring. Hence the ordinals are not a Euclidean domain, since they are not even a ring; furthermore the Euclidean "norm" would be ordinal-valued using the left division here.
A -number is an ordinal greater than such that whenever. These consist of the ordinal and the ordinals of the form.
Exponentiation
The definition of exponentiation via order types is most easily explained using Von Neumann's definition of an ordinal as the set of all smaller ordinals. Then, to construct a set of order type consider the set of all functions such that for all but finitely many elements . This set is ordered lexicographically with the least significant position first: that is, we write if and only if for the value. This is a well-ordering and hence gives an ordinal number.The definition of ordinal exponentiation can also be given by transfinite recursion on the exponent. When the exponent, exponentiation gives for any. For, the value of is the smallest ordinal greater than or equal to for all. Writing the successor and limit ordinals cases separately:
- .
- , for a successor ordinal.
- , when is a limit ordinal.
But for infinite exponents, the definition may not be obvious. For example, can be identified with a set of finite sequences of elements of, properly ordered. The equation expresses the fact that finite sequences of zeros and ones can be identified with natural numbers, using the binary number system. The ordinal can be viewed as the order type of finite sequences of natural numbers; every element of can be uniquely written in the form, where,,..., are natural numbers,,..., are nonzero natural numbers, and.
The same is true in general: every element of can be uniquely written in the form where is a natural number,,..., are ordinals smaller than with, and are nonzero ordinals smaller than. This expression corresponds to the function which sends to for and sends all other elements of to.
While the same exponent notation is used for ordinal exponentiation and cardinal exponentiation, the two operations are quite different and should not be confused. The cardinal exponentiation is defined to be the cardinal number of the set of all functions, while the ordinal exponentiation only contains the functions with finite support, typically a set of much smaller cardinality. To avoid confusing ordinal exponentiation with cardinal exponentiation, one can use symbols for ordinals in the former and symbols for cardinals in the latter.
Properties
- .
- If, then.
- .
- .
- .
- .
- There are,, and for which. For instance,.
- Ordinal exponentiation is strictly increasing and continuous in the right argument: If and, then.
- If, then. Note, for instance, that and yet.
- If and, then. If or this is not the case.
- For all and, if and then there exist unique,, and such that such that and.
Beyond exponentiation
There are ordinal operations that continue the sequence begun by addition, multiplication, and exponentiation, including ordinal versions of tetration, pentation, and hexation. See also Veblen function.Cantor normal form
Every ordinal number can be uniquely written as, where is a natural number,,,..., are nonzero natural numbers, and are ordinal numbers. The degenerate case occurs when and there are no s nor s. This decomposition of is called the Cantor normal form of, and can be considered the base- positional numeral system. The highest exponent is called the degree of, and satisfies. The equality 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 equal to and allow the exponents to be equal. In other words, every ordinal number can be uniquely written as, where is a natural number, and are ordinal numbers.
Another variation of the Cantor normal form is the "base expansion", where is replaced by any ordinal, and the numbers are nonzero ordinals less than.
The Cantor normal form allows us to uniquely express—and order—the ordinals that are built from the natural numbers by a finite number of arithmetical operations of addition, multiplication and exponentiation base-: in other words, assuming in the Cantor normal form, we can also express the exponents in Cantor normal form, and making the same assumption for the as for and so on recursively, we get a system of notation for these ordinals.
The ordinal is the set of ordinal values of the finite-length arithmetical expressions of Cantor normal form that are hereditarily non-trivial where non-trivial means when. It is the smallest ordinal that does not have a finite arithmetical expression in terms of, 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 is important for various reasons in arithmetic.
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 ; and to compute products, the essential facts are that when is in Cantor normal form and, then
and
if is a non-zero natural number.
To compare two ordinals written in Cantor normal form, first compare, then, then, then, and so on. At the first occurrence of inequality, the ordinal that has the larger component is the larger ordinal. If they are the same until one terminates before the other, then the one that terminates first is smaller.
Factorization into primes
showed that the ordinals satisfy a form of the unique factorization theorem: every nonzero ordinal can be written as a product of a finite number of prime ordinals. This factorization into prime ordinals is in general not unique, but there is a "minimal" factorization into primes that is unique up to changing the order of finite prime factors.A prime ordinal is an ordinal greater than that cannot be written as a product of two smaller ordinals. Some of the first primes are,,,...,,,,,...,,,,... There are three types of prime ordinals:
- The finite primes,,,...
- The ordinals of the form for any ordinal. These are the prime ordinals that are limits, and are the delta numbers, the transfinite ordinals that are closed under multiplication.
- The ordinals of the form for any ordinal. These are the infinite successor primes, and are the successors of gamma numbers, the additively indecomposable ordinals.
- Every limit prime must occur before any successor prime
- If two consecutive primes of the prime factorization are both limits or both finite, the second one must be less than or equal to the first one.
- First write the ordinal as a product, where is the smallest power of in the Cantor normal form and is a successor.
- If then writing in Cantor normal form gives an expansion of as a product of limit primes.
- Now look at the Cantor normal form of. If + smaller terms, then is a product of a smaller ordinal and a prime and a natural number. Repeating this and factorizing the natural numbers into primes gives the prime factorization of.
into a minimal product of infinite primes and natural numbers is
where each should be replaced by its factorization into a non-increasing sequence of finite primes and
Large countable ordinals
As discussed above, the Cantor normal form of ordinals below can be expressed in an alphabet containing only the function symbols for addition, multiplication and exponentiation, as well as constant symbols for each natural number and for. We can do away with the infinitely many numerals by using just the constant symbol and the operation of successor, that are not expressible. Such ordinals are known as large countable ordinals.The operations of addition, multiplication and exponentiation are all examples of primitive recursive ordinal functions, and more general primitive recursive ordinal functions can be used to describe larger ordinals.
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 . The natural sum of and is often denoted by or, and the natural product by or.The natural sum and product are defined as follows. Let and be in Cantor normal form. Let be the exponents,...,,,..., sorted in nonincreasing order. Then is defined as
The natural product of and is defined as
For example, suppose and. Then, whereas. And, whereas.
The natural sum and product are commutative and associative, and natural product distributes over natural sum. The operations are also monotonic, in the sense that if then ; if then ; and if and then.
We have.
We always have and. If both and then. If both and then.
Natural sum and product are not continuous in the right argument, since, for example, and not ; and, and not.
The natural sum and product are the same as the addition and multiplication of John Conway's field of surreal numbers.
The natural operations come up in the theory of well partial orders; given two well partial orders and, of types and, the type of the disjoint union is, while the type of the direct product is. One may take this relation as a definition of the natural operations by choosing and to be ordinals and ; so is the maximum order type of a total order extending the disjoint union of and ; while is the maximum order type of a total order extending the direct product of and. A useful application of this is when and are both subsets of some larger total order; then their union has order type at most. If they are both subsets of some ordered abelian group, then their sum has order type at most.
We can also define the natural sum by simultaneous transfinite recursion on and, as the smallest ordinal strictly greater than the natural sum of and for all and of and for all. Similarly, we can define the natural product by simultaneous transfinite recursion on and, as the smallest ordinal such that for all and. Also, see the article on surreal numbers for the definition of natural multiplication in that context; however, it uses surreal subtraction, which is not defined on ordinals.
The natural sum is associative and commutative. It is always greater or equal to the usual sum, but it may be strictly greater. For example, the natural sum of and is , but this is also the natural sum of and . The natural product is associative and commutative and distributes over the natural sum. The natural product is always greater or equal to the usual product, but it may be strictly greater. For example, the natural product of and is , but this is also the natural product of and .
Under natural addition, the ordinals can be identified with the elements of the free commutative monoid generated by the gamma numbers. Under natural addition and multiplication, the ordinals can be identified with the elements of the free commutative semiring generated by the delta numbers.
The ordinals do not have unique factorization into primes under the natural product. While the full polynomial ring does have unique factorization, the subset of polynomials with non-negative coefficients does not: for example, if is any delta number, then
has two incompatible expressions as a natural product of polynomials with non-negative coefficients that cannot be decomposed further.