If is stationary and for a kappa-filtration, then is constant on a stationary subset. Restrict to limit indices and use continuity to find a smaller stage containing each value. Fodor lemma fixes that stage on a stationary subset. Its size is less than , so club filter completeness makes one value fiber stationary.
Minimal-walk tree 2026-10-06
The tree of restrictions , ordered by extension. For a club sequence on with club order types at most , the Continuum hypothesis bounds each level by . Trace injectivity and Fodor lemma exclude a cofinal branch.
Let . This set is stationary: in any club set, choose a strictly increasing countable sequence and take its supremum, which lies in the club set and has cofinality . For each choose an increasing cofinal sequence .
Fix . For every above , some exceeds . Partition this stationary tail by the least such . A countable union of nonstationary sets is nonstationary, because fewer than club sets have club filter completeness, so some cell is stationary. On it the regressive function has, by Fodor lemma, a stationary fiber at a value .
Let . The preceding argument says is unbounded in . Since , at least one is unbounded and therefore has size . Its fibers are pairwise disjoint stationary sets. Enumerate of them as , , and define for , while
Adding a remainder preserves stationarity and introduces no overlap. Consequently
This proves the stationary partition by cofinal-sequence fibers directly for every regular uncountable .
A kappa-filtration is an increasing continuous sequence with union and at every stage. Intersect with the club set of nonzero limit ordinals. For each remaining , continuity gives , so choose with . This is a regressive function. Fodor lemma gives a stationary subset and a fixed such that all these values lie in .
Since , partition into fewer than fibers of . If every fiber were nonstationary, choose a club set avoiding each one. Their intersection is club set by regularity, contradicting stationarity of . Thus one fiber is stationary, and
This proves the filtration form of Fodor lemma; continuity at limit stages, the small size of each stage, and regularity of are all used.
Take and choose a club sequence on , each of order type at most . For a successor use its predecessor as a singleton; at a limit use a cofinal sequence of minimal length. Form the minimal-walk tree
ordered by proper extension. Its height is .
For , the initial segment has order type strictly below , and is countable. The strict inequality follows because a point of at or above occurs later in its enumeration. Hence every entry of every trace is countable. Under the Continuum hypothesis, for ,
There are at most finite sequences of such sets. The trace coherence lemma for minimal walks says that, for , the value determines . The case adds at most one node. Thus for every level.
Suppose that had a cofinal branch, and take the union of its functions, , with domain . Every is injective by the proper-initial-segment argument, so is injective too. On the stationary set
this set is stationary because the supremum of a strictly increasing -sequence from any club set has cofinality and lies in that club. The union of the finitely many countable entries of is bounded below . Assign a strict upper bound below to obtain a regressive function. By Fodor lemma, there is a stationary and a single such that every entry of lies inside for . There are at most such finite sequences by the same cardinal arithmetic, but , contradicting injectivity.
Therefore is an aleph-two Aronszajn tree:
Fodor lemma says that if is a regular uncountable cardinal, is stationary, and is regressive, then
Here a regressive function satisfies at every nonzero ; removing has no effect on stationarity. Both regularity and stationarity are part of the hypotheses.
Regressive function 2026-10-06
A function on a set of ordinals with at every nonzero point of its domain. On a stationary subset of a regular uncountable cardinal, Fodor lemma makes it constant on a stationary subset.
For an uncountable regular cardinal , choose cofinal sequences for the stationary set of ordinals of cofinality . Above any bound, some fixed coordinate exceeds the bound on a stationary subset; Fodor lemma makes that coordinate constant on a stationary subset. Thus the stationary constant fibers, over all coordinates, have unboundedly many values. Regularity makes one coordinate have such values. Its fibers are disjoint stationary sets; adding all leftover ordinals to one piece partitions .