Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2014/iii/paper-19/3/iv/a/solution
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 19 3 iv a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For a regular uncountable kappa-tree, keep exactly the nodes whose extensions have unbounded heights:This set is predecessor-closed. At any level , if no node survived, the extension heights above each of its fewer than nodes would be bounded. Regularity would give a single bound for their union, contradicting the height of the original set-theoretic tree. Thus every level of is nonempty and still has size less than .
If and , consider its extensions at level . If none survived, fewer than bounded extension sets would again bound every extension of , a contradiction. Therefore a surviving level- extension exists. HenceThis unbounded-extension kernel of a regular tree uses regularity essentially. If one permits singular-height set-theoretic trees in the term “-tree”, the unrestricted assertion is false: take fewer than disjoint branches with lengths cofinal in a singular . The levels are small and the height is , but no node has unbounded extensions. A common root can be added without creating a well-pruned subtree. The usual regular-height convention is therefore the one used here.
New to topics? Read the docs here!