Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2013/iii/paper-19/1/ii/a/solution
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 1 ii a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use a definable cumulative hierarchy of set-sized stages: for , at nonzero limits, and . Class parameters and the hierarchy are fixed definable data. The reflection theorem for definable hierarchies says that for every finite collection of formulas there is a closed unbounded class of ordinals such thatThis is a schema of ZFC for each finite collection and class definition, not a purported truth predicate for all formulas over the universe at once.
Close under subformulas. For each existential subformula and each tuple in , if a witness exists in , take the least stage index containing a witness. There are only set-many parameter tuples and finitely many formulas. The Axiom schema of replacement therefore bounds all these least indices by an ordinal , chosen larger than . No definable selection of the witnesses themselves is needed.
Above any prescribed bound choose with , and put . Every tuple in lies in some , and each true existential instance for that tuple has a witness in . Induction over the subformulas now proves agreement between and : atomic formulas use the same membership relation, Boolean operations preserve agreement, and the existential step uses this witness property. Thus reflecting stages are unbounded.
For closedness, suppose reflecting stages have limit . Every tuple in lies in a reflecting stage below , and every true existential instance has a witness there. The same subformula induction proves reflection at . Hence the reflecting stages for the subformula-closed collection form a closed unbounded class, proving the Lévy reflection theorem in this relative form.
New to topics? Read the docs here!