Stationary partition by cofinal-sequence fibers Created 2026-10-06 Updated 2026-10-07
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 .
Uniformly narrow regular-height tree branch theorem Created 2026-10-07 Updated 2026-10-14
For infinite regular cardinals , a -tree whose levels all have size less than has a cofinal branch. At levels of cofinality , bound all heights distinguishing distinct predecessor chains. The Fodor lemma makes this bound constant on a stationary set; one predecessor at that height occurs stationarily often. The resulting predecessor chains agree below their common heights and unite into a branch through every level. Distinct limit-level nodes with identical predecessor chains do not affect this argument.