Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 121 4 b Solution Created 2026-10-03 Updated 2026-10-06
One can take . Finite induction gives for every finite : every subset of a finite level is definable using its finitely many elements as parameters. Hence , the set of hereditarily finite sets.
Now reason inside the constructible universe , a model of ZFC. The set is countable there, and there are countably many first-order formulas and finite parameter tuples. Thus is countable in . But the constructible power set is uncountable in by the Cantor theorem. ChooseThis is constructible and a subset of , so and . ThereforeAll comparisons were made inside ; this avoids assuming that the constructible reals are uncountable in the ambient universe. The witness remains valid externally because the two structures use the same , the same , and the same constructible level. Thus constructible sets of low rank can appear at later stages.