Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2015/iii/paper-24/5/c/i/solution
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 24 5 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Countability of the forcing and uncountability of are understood internally in and , respectively. This matters because the model itself is externally countable. Choose a name and a ground-model set containing every ground-model element that can occur in . Such an exists: the rank of bounds the ranks of its values, so a sufficiently high contains .
For , ground-model axiom schema of separation and the forcing definability lemma giveBy the forcing truth lemma,If every for were countable in , it would remain countable in , where is countable. Then would be countable, contrary to the hypothesis. Thus some has uncountable in ; otherwise its ground-model enumeration would still enumerate it in the extension. Let . Every one of its members is forced by into , soThe countable chain condition for forcing also preserves its uncountability. Separativity is not needed for this particular argument. This is the ground-model uncountable subset lemma for countable forcing.
New to topics? Read the docs here!