Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2013/iii/paper-19/3/iv/solution
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 3 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
There is a cofinal branch. We give a proof that does not require distinct limit-level nodes to have different predecessor chains.
The set is stationary. Indeed a strictly increasing continuous -sequence in any club set has supremum in that club set, below , of cofinality . At each , there are fewer than pairs of nodes on . For every pair whose predecessor chains below differ, choose a height where they differ. Since , all these heights are bounded by some . Consequently nodes in having the same predecessor at have identical predecessor chains below .
The Fodor lemma states that a regressive function on a stationary subset of a regular uncountable cardinal is constant on a stationary subset. Applying it here, has a constant value on a stationary subset . Choose for each . The level has fewer than nodes. Partitioning according to the predecessor of at height , one fiber is stationary, since the union of fewer than nonstationary sets is nonstationary. Let its common predecessor be .
For in , the predecessor of at level and have the same predecessor at level . Their chains below therefore agree. For each , choose above and let be the predecessor of at level . The preceding comparison makes independent of that choice. The nodes form a chain through every level:This proves the uniformly narrow regular-height tree branch theorem. The uniform bound below the smaller regular is stronger than merely bounding each level below .
New to topics? Read the docs here!