The inductive definition of ordinal addition is , , and for a nonzero limit ordinal . The synthetic definition is the order type of the order sum obtained by putting a copy of after a disjoint copy of .
These agree by transfinite induction on the second argument. Appending no points gives ; appending one new greatest point gives a successor. At a limit stage, the order sum is exhausted by the increasing initial segments obtained by appending each , so its order type is their supremum. Thus the synthetic construction satisfies all three recursion clauses, and uniqueness of transfinite recursion proves equivalence.
False. By the successor and limit clauses for ordinal multiplication,
Multiplication is not commutative because it counts ordered copies, rather than merely the cardinality of their union.
Always true. In the order-sum interpretation of ordinal multiplication, consists of copies of indexed first by and then by . The first portion has order type and the second , proving . Equivalently, transfinite induction on uses the successor rule, associativity of ordinal addition, and continuity of both operations in the right argument at limit ordinals.
False. Take , which satisfies the proposed lower bound. Associativity of ordinal addition and give
The final successor survives only in the second expression.
False. Take . Continuity of ordinal multiplication in the right argument gives . For a precise bound, for each countable ordinal monotonicity gives
Both bounding expressions have supremum as ranges below , because is still countable and these indices are cofinal. But the successor rule gives

Articles by others on the same topic (0)

There are currently no matching articles.