For Fodor's theorem, let be regular uncountable, stationary, and regressive: for every nonzero . A club set is unbounded in and closed under limits below ; a stationary set meets every club. Removing preserves stationarity. We prove that some fibre of is stationary, not merely that one fibre is large.
We first check the club facts used in the argument. An intersection of fewer than club subsets of is club. Closure is immediate. For unboundedness, given and clubs with , choose an increasing sequence starting above , such that is above a point of every beyond . Regularity bounds the supremum of the fewer-than- points at each step. Then , and the chosen points in each are cofinal in ; closure puts in their intersection.
For a sequence of clubs its diagonal intersection
is also club. To obtain a point above , recursively choose in , possible by the preceding result, and take the supremum of the sequence. For each , every sufficiently late belongs to , so . For closure, if diagonal-intersection points are cofinal in , then for each their sufficiently late points lie in , and closure again puts there.
Suppose every fibre were nonstationary. Choose a club disjoint from each fibre. Stationarity supplies , with . Put . By diagonal membership , but by its definition , a contradiction. Thus
This is precisely the pressing-down assertion. Regularity and uncountability were used to keep the club-building suprema below .
For the Cantor normal form theorem, every nonzero ordinal has a unique expression
All operations are ordinal operations, so the order of the terms matters. The ordinal zero has the empty expression. We give the greedy existence proof and then prove uniqueness.
The powers are strictly increasing and continuous at limit exponents, and satisfy . Hence the set of exponents with is nonempty and bounded, and its supremum belongs to it by continuity (or is already its last successor member). Thus there is a largest such exponent and
Since the last product is the supremum of the finite multiples, there is a unique positive finite satisfying
The initial segment of of length leaves a tail of unique order type , so
The bound follows from strict increase of ordinal addition in its right argument: a tail at least would contradict the preceding interval. This is the relevant instance of the ordinal division algorithm.
If , apply the same construction to it. Its leading exponent must be below . Continue with the remainder. An infinite continuation would produce an infinite strictly descending sequence of ordinals, impossible by well-foundedness. Thus the process terminates after finitely many steps and gives the required form.
To prove uniqueness, first observe that a finite decreasing-exponent suffix with leading exponent is smaller than . This follows by induction on its number of terms: the later tail is below , so adding it to a finite multiple of stays below the next finite multiple and hence below . Consequently the tail after a term with exponent is below .
Any proposed normal form therefore places in exactly the interval
Its first exponent is recoverable as the largest exponent whose power does not exceed , and its first coefficient is recoverable as the largest finite multiple not exceeding . The right remainder is unique because ordinal addition is strictly increasing in its right argument. Apply the same reasoning to the remainder, successively fixing every exponent and coefficient. This proves uniqueness without treating ordinal addition as commutative or cancelling arbitrary left summands.

Articles by others on the same topic (0)

There are currently no matching articles.