Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 24 3 Solution Created 2026-10-03 Updated 2026-10-14
Forcing constructs new first-order models while controlling which ground-model properties survive. Fix a ground model and a partially ordered set , writing when is the stronger condition. A generic filter is upward closed, directed towards stronger conditions, and meets every ground-model dense subset of a forcing order. If is externally a countable transitive model, enumerate its dense subsets and successively choose stronger conditions in them. The resulting filter is -generic. External countability is crucial: this is not a claim that the ground model regards its own universe as countable.
A forcing name is built recursively from pairs of earlier names and conditions. For a generic filter , its evaluation of a forcing name isThe canonical forcing name evaluates to , so . Recursive evaluation also proves transitivity. Name ranks bound the ranks of their evaluations, so an ordinal in the extension is below some ground ordinal and is already a ground ordinal. Thus forcing preserves ordinals.
The central link between syntax and generic interpretation is the forcing theorem. The relation is definable in the ground model, and the forcing truth lemma saysFor an atomic membership assertion, densely many refinements must witness equality with a member-name whose associated condition is compatible with the refinement. Equality is obtained by recursive mutual inclusion of names. For negation, means no stronger condition forces ; for an existential quantification, witnesses must be obtainable densely below . Induction on name rank establishes the atomic clauses, and induction on formulas establishes definability and the truth lemma. The generic filter meets the relevant dense sets at the existential step. An arbitrary semantic assertion about one chosen generic filter is insufficient: the definable relation must work uniformly for all generic interpretations.
This explains preservation of ZFC. Extensionality and foundation follow from transitivity; canonical names supply infinity. Pair and union names give pairing and union. For separation, restrict a name's members to conditions forcing the defining formula. For replacement, the definable forcing relation lets ground axiom schema of collection bound a set of names for all possible witnesses to the unique outputs; evaluating their collected name gives the range. For power set, let name the given set and let be the set of its member-names. Every subset of has an equivalent name drawn from , by the truth lemma, so a ground set of candidate names collects all its subsets. Finally choose a ground well-order of the relevant names; its evaluated image surjects onto the desired set, and choosing the first name for each value well-orders that set. This is why ordinary forcing over a choice model preserves choice.
For a concrete example, Cohen forcing consists of finite partial functions , ordered by extension. The generic union is total because deciding each coordinate is dense. For every ground real , the set of conditions disagreeing with somewhere is dense, so . This construction changes the universe by adding a genuinely new real without changing its ordinals.
The size and compatibility of conditions determine what else changes. With the countable chain condition for forcing, an ordinal-valued name has only countably many possible values at each coordinate: take a maximal antichain deciding that value. Therefore the possible range of a name for a map with infinite ground domain of cardinality lies in a ground set of size at most . This prevents cardinal collapse and changes of uncountable regular cofinalities. Forcing by finite partial functions is ccc: the delta-system lemma thins any uncountable family of finite domains to a delta-system, and a further thinning makes their values agree on its finite root. Two remaining conditions are compatible. Distinct coordinates add distinct reals.
For example, start with GCH and take . This forcing has size and adds distinct reals. A nice name for a real uses countably many antichains, and each antichain is countable. The ground arithmetic bounds the number of such names by . Hencegiving a relative-consistency example of the failure of CH. The ground choice of GCH is available through the constructible universe; no claim that every starting model has this arithmetic is needed.
By contrast, countably closed forcing adds no new countable sequences of ground ordinals. Given a name, recursively strengthen a condition to decide each coordinate, then take a lower bound of the descending sequence. That condition decides the entire sequence. Closure and chain conditions thus control different features; neither should be silently substituted for the other.
Further applications include changing cofinalities, adding branches through trees, and constructing prescribed continuum patterns. If the aim is to violate choice, an ordinary generic extension of a choice model will not do: one restricts to a suitable symmetric collection of names, checking the axioms again. These examples also mark a limitation: forcing proves relative consistency, not absolute consistency of the background theory. The countable-transitive-model picture gives a concrete semantic construction; the definable forcing relation and Boolean-valued formulation supply the corresponding formal consistency arguments without asserting that a transitive ground model can be proved to exist.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 4 ii a Solution Created 2026-10-03 Updated 2026-10-07
The generic extension is . It is transitive: if , an active pair in supplies a subname with . Ground sets belong to it by their canonical names. Without assuming a weakest condition, use ; nonemptiness of gives .
Induction on forcing name rank gives . The right side is an ordinal of . If is an ordinal, its rank equals , so it is at most a ground-model ordinal. Transitivity of then implies . Conversely every ground ordinal remains the same ordinal in the transitive extension, since membership is unchanged. HenceThis proves forcing preserves ordinals directly from ranks, without assuming cardinal preservation.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 6 ii a Solution Created 2026-10-03 Updated 2026-10-07
Choose a name for and a condition forcing that it is a function . The ordinals belong to , by forcing preserves ordinals. For each , choose in a maximal forcing antichain in the cone above , every member deciding as an ordinal below . Conditions deciding an ordinal-valued name are dense, by the forcing theorem.
Let be the set of values decided by members of . The chain condition gives , and Choice and Replacement in assemble all these sets into a function with domain . Since , genericity ensures that meets each deciding forcing antichain above ; equivalently enlarge it to a global maximal forcing antichain by conditions incompatible with . Its chosen value is the actual . ThereforeThis is the possible-values lemma for chain-condition forcing. All size bounds in its construction are internal to the ground model.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 24 6 a i Solution Created 2026-10-03 Updated 2026-10-06
The forcing is cardinal-preserving over when every ground-model cardinal remains a cardinal in every generic extension:Forcing preserves ordinals, and an ordinal that was not a cardinal already has a ground-model bijection with a smaller ordinal, which persists. Thus this definition gives equality of the cardinal ordinals in the two models.
Past exam of the mathematics course of the University of Cambridge 2015 iii Paper 24 6 b ii Solution Created 2026-10-03 Updated 2026-10-06
The PDF's middle equality is , concerning ordinal exponentiation. The TeX incorrectly turns the exponent into a subscript; preserving would be incompatible with forcing CH over many ground models.
Let and use the countable-condition collapse of onto :ordered by extension. Countable unions give lower bounds, so closed forcing adds no short ordinal sequences; in particular it adds no reals and preserves . Dense requirements ensure that the union of the generic filter is a total surjection . ThusFinally forcing preserves ordinals, and the recursion defining ordinal multiplication and exponentiation is absolute. Both models compute as the same order type of successive copies of . This proves the printed middle equality too. Higher cardinals may collapse, which is allowed by the actual PDF.