Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2018/iii/paper-121/3/iv/c/solution
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 3 iv c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Assume satisfies the countable chain condition for forcing. We prove cardinal preservation by chain-condition forcing using the possible-values lemma for chain-condition forcing, and give the argument explicitly for ccc.
Let be an uncountable cardinal of . If it ceased to be a cardinal, some ordinal would admit a surjection onto in an extension. By the forcing theorem, there would be a condition and a forcing name such thatInside , for each choose a maximal antichain in a forcing order below deciding the ordinal value of . Conditions deciding that value are dense below . The chain condition makes the chosen antichain countable in , so the corresponding set of possible decided values is countable in .
A generic filter containing meets the downward closure of every such maximal antichain, so its value belongs to . Therefore its whole range lies in the ground-model setThe last inequality is infinite cardinal arithmetic and uses only that is uncountable and ; no regularity of is needed. Some ordinal in exists already in and cannot occur in the range, contradicting the forced surjectivity.
Finite cardinals cannot collapse, and cannot become finite: a finite domain has finite image, and transitive models agree on the natural numbers. Old non-cardinals cannot become cardinals because their old bijections persist. Thus
New to topics? Read the docs here!