Scribd
Upload
38 views

ordinal-arithmetic

The document discusses ordinal arithmetic, which extends arithmetic to infinite numbers as developed by Cantor. It covers definitions of ordinals, their addition, ordering, multiplication, exponentiation, prime ordinals, and the significance of the ordinal ε₀. The document highlights the unique properties of ordinal operations, including non-commutativity and the existence of limits and continuity in certain operations.

Uploaded by

유인웅
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
38 views

ordinal-arithmetic

The document discusses ordinal arithmetic, which extends arithmetic to infinite numbers as developed by Cantor. It covers definitions of ordinals, their addition, ordering, multiplication, exponentiation, prime ordinals, and the significance of the ordinal ε₀. The document highlights the unique properties of ordinal operations, including non-commutativity and the existence of limits and continuity in certain operations.

Uploaded by

유인웅
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Ordinal arithmetic

Berkeley Math Circle


2018-3-5

Problem: How can we extend arithmetic to infinite numbers in an interesting


way? The answer was found by Cantor: use ordinal arithmetic.

1 Definition of ordinals
Countable ordinals can be represented as subsets of the real line so that one can
only make a finite number of leftward jumps in the subset. We only care about
the order of points in the ordinal, so two subsets ordered in the ”same way”
count as the same ordinal. For example, {0, 1, 2} and {−37, 3, π} count as the
same ordinal. Equivalently any nonempty subset of the ordinal has a smallest
element.
Examples: 0, 1, 2, ... are subsets with 0, 1, 2, ... points. ω is the smallest
infinite ordinal and can be represented as a subset 0,1/2, 2/3, 3/4,... with an
infinite number of points.

2 Addition of ordinals
α + β is given by putting β to the right of α. So ω + 1 might be represented
by 0, 1/2, 2/3, 3/4, ...., 1. Note that 1 + ω = ω 6= ω + 1 (Hilbert’s hotel). In
particular addition is not commutative, but is associative.
In general about half of the usual rules of arithmetic hold for ordinals.

3 Ordering of ordinals
We can compare α with β by matching their first elements, then their second
elements, and so on. We find that either α < β (if α runs out first) or α = β
or α > β (if β runs out first). Most of the usual rules hold for < (but note that
1 + ω = ω).
Limits. An increasing sequence of ordinals may get ”closer and closer” to α:
we say the sequence has limit α. For example 0, 1, 2, ... has limit ω. Continuity
of functions can be defined as for real functions. Note that α + β is continuous
in β but not in α: look at n + 1.
Subtraction. If α ≥ β we can define α − β. so that β + (α − β) = α.

1
4 Multiplication of ordinals
The product αβ means ”take β copies of α”. It can also be defined by α.0 = 0,
α.(β +1) = α, β +α, αβ is continuous in β. (But αβ is not continuous in α: look
at (limn→ω n)ω = ωω 6= ω = limn→ω (nω).) Multiplication is associative but not
commutative (2ω 6= ω.2). Example: ωω is the ”lexicographic” order of points
in a quadrant. Multiplication is sort of half distributive: α(β + γ) = αβ + αγ,
but (ω + 1)2 6= ω2 + 1.2.
Division-with-remainder: if β > 0 and α is an ordinal then α = βq + r for
unique q, r with r < b.
Ordinals up to ω ω are polynomials in ω with coefficients 0, 1, 2, ....

5 Exponentiation
Exponentiation can be defined by: αβ continuous in β, αβ+1 = αβ .α, α0 = 1.
αβ can be represented by functions from a finite subset of β to α, which can be
thought of as words of length β to an alphabet α with most letters of the words
missing 0, or as polynomials in α with coefficients < α and exponents in β. It
is continuous in β but not continuous in α: nω = ω. αβ+γ = αβ αγ .
Ordinals have a base α expansion (if α > 1). Cantor normal form is base ω
expansion. Example: (ω 3 .2 + 2)(ω + 5) = ω 4 + ω 3 .15 + ω + 10.Some e

6 Prime ordinals
The prime ordinals are 2, 3, 5, ..., ω, ω + 1. ω + 2 = (ω + 1)2. ω 2 + 1, ω 3 + 1,...ω ω ,
α
ω ω + 1, ...In general the primes are finite primes, ω ω and ω α + 1.
Factorization in to primes need not be unique. 2 × 3 = 3 × 2, 2 × ω = ω,
ω × ω ω = ω ω . Unique if (1) limits come first (2) limits in decreasing order (3)
successors in decreasing order.

7 The ordinal 0
Problem with cantor normal form: ω α is usually far bigger than α, but some
ω
ordinals may satisfy α = ω α 0 is the limit of ω, ω ω , ω ω ,.... and is the smallest
ordinal that cannot be written using ω and 0 and addition and multiplication
and exponentiation. Ordinals up to 0 can be represented as rooted trees.
α is the α’th ordinal with α = ω α . More generally we get the Veblen
hierarchy: φ0 (α) = ω α . ψβ (α) enumerates fixed points of φγ for γβ . So α =
φ1 (α. Γ0 is the smallest ordinal that cannot be written even using φ. There are
also even bigger ordinals Γα .
Some even bigger ordinals: the Church-Kleene ordinal is the smallest that
cannot be described in a computable (recursive) way. Far beyond this is the
first uncountable ordinal ℵ1 .

You might also like