Math 2.0

Mathematical logic and foundations Definition

Ordinal arithmetic

Builds on Ordinal numberTransfinite inductionSupremum

Definition

Let α\alpha and β\beta be ordinal numbers. In the clauses below, λ\lambda is a nonzero limit ordinal, and sup⁡\sup is the supremum of a set of ordinals, which is its union. The sum, product and power of ordinals are defined by transfinite recursion on β\beta:

  1. α+0=α\alpha + 0 = \alpha, α+(β+1)=(α+β)+1\alpha + (\beta + 1) = (\alpha + \beta) + 1, and α+λ=sup⁡β<λ(α+β)\alpha + \lambda = \sup_{\beta < \lambda} (\alpha + \beta).
  2. α⋅0=0\alpha \cdot 0 = 0, α⋅(β+1)=α⋅β+α\alpha \cdot (\beta + 1) = \alpha \cdot \beta + \alpha, and α⋅λ=sup⁡β<λα⋅β\alpha \cdot \lambda = \sup_{\beta < \lambda} \alpha \cdot \beta.
  3. α0=1\alpha^0 = 1, αβ+1=αβ⋅α\alpha^{\beta + 1} = \alpha^\beta \cdot \alpha, and αλ=sup⁡β<λαβ\alpha^\lambda = \sup_{\beta < \lambda} \alpha^\beta when α>0\alpha > 0, with 0λ=00^\lambda = 0.

Here β+1=β∪{β}\beta + 1 = \beta \cup \set{\beta} is the successor of β\beta.

Remarks

Example: ω+1\omega + 1 is the successor of ω\omega, and ω⋅2=ω+ω\omega \cdot 2 = \omega + \omega by clauses 2 and 1. Non-example of commutativity: 1+ω=sup⁡n<ω(1+n)=ω1 + \omega = \sup_{n < \omega} (1 + n) = \omega, while ω+1≠ω\omega + 1 \ne \omega. Likewise 2⋅ω=sup⁡n2n=ω2 \cdot \omega = \sup_n 2n = \omega, while ω⋅2=ω+ω>ω\omega \cdot 2 = \omega + \omega > \omega. Equivalently, α+β\alpha + \beta is the order type of α\alpha followed by β\beta. And α⋅β\alpha \cdot \beta is the order type of the pairs (b,a)(b, a) with b<βb < \beta and a<αa < \alpha, compared first by bb and then by aa. Addition and multiplication are associative, and α⋅(β+γ)=α⋅β+α⋅γ\alpha \cdot (\beta + \gamma) = \alpha \cdot \beta + \alpha \cdot \gamma, but the other distributive law fails. On finite ordinals the operations agree with those of the natural numbers. Ordinal exponentiation differs from cardinal exponentiation: 2ω=ω2^\omega = \omega as ordinals, while 2ℵ0>ℵ02^{\aleph_0} > \aleph_0 as cardinals.

Reading path

To understand this page from the ground up, read these 25 pages in order. The foundations come first.

Show the path as a graph
Element, definition, no evidence levelElementdefinitionProposition, concept, no evidence levelPropositionconceptSet bounded above, definition, no evidence levelSet bounded abovedefinitionSet, definition, no evidence levelSetdefinitionImplication, definition, no evidence levelImplicationdefinitionPredicate, definition, no evidence levelPredicatedefinitionSupremum, definition, no evidence levelSupremumdefinitionOrdered pair, definition, no evidence levelOrdered pairdefinitionUniversal quantifier, definition, no evidence levelUniversal quantifierdefinitionCartesian product, definition, no evidence levelCartesian productdefinitionSubset, definition, no evidence levelSubsetdefinitionBinary relation, definition, no evidence levelBinary relationdefinitionAntisymmetric relation, definition, no evidence levelAntisymmetric relationdefinitionReflexive relation, definition, no evidence levelReflexive relationdefinitionTransitive relation, definition, no evidence levelTransitive relationdefinitionPreorder, definition, no evidence levelPreorderdefinitionPartial order, definition, no evidence levelPartial orderdefinitionLeast element, definition, no evidence levelLeast elementdefinitionMinimal element, definition, no evidence levelMinimal elementdefinitionTotal order, definition, no evidence levelTotal orderdefinitionWell-founded relation, definition, no evidence levelWell-founded relationdefinitionWell-order, definition, no evidence levelWell-orderdefinitionOrdinal number, definition, no evidence levelOrdinal numberdefinitionTransfinite induction, statement, no evidence levelTransfinite inductionstatementOrdinal arithmetic, definition, no evidence levelOrdinal arithmeticdefinition
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Element definition
  2. Proposition concept
  3. Set bounded above definition
  4. Set definition
  5. Implication definition
  6. Predicate definition
  7. Supremum definition
  8. Ordered pair definition
  9. Universal quantifier definition
  10. Cartesian product definition
  11. Subset definition
  12. Binary relation definition
  13. Antisymmetric relation definition
  14. Reflexive relation definition
  15. Transitive relation definition
  16. Preorder definition
  17. Partial order definition
  18. Least element definition
  19. Minimal element definition
  20. Total order definition
  21. Well-founded relation definition
  22. Well-order definition
  23. Ordinal number definition
  24. Transfinite induction statement
  25. Ordinal arithmetic definition

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Ordinal_arithmetic
About this page
Tag2C7MBG93AZ
URIm2://2C7MBG93AZ
Kinddefinition
WritingW0 stub
MSC03E10
DefinesOrdinal arithmetic
UsesOrdinal number, Transfinite induction, Supremum
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by