Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 19 / 6 / i

The forcing theorem has two central clauses. Definability: for each first-order formula $\phi$, the relation $p⊩\phi (\vec{\tau })$ on conditions and ground-model names is first-order definable in $M$. Truth lemma: for every $M$-generic $G$ and every tuple of names in $M$,Forcing is monotone under strengthening and agrees with the generic-extension semantics. Together with the generic model construction, $M[G]$ is a transitive model of ZFC containing $M$ with the same ordinals. The definability and truth clauses are the auxiliary parts used when proving individual extension axioms.

The canonical forcing name $\dot{a}=\check{a}$ is defined recursively byIf a weakest condition $1_P$ is provided, one may instead pair each $\check{b}$ only with $1_P$. The all-conditions version works for an arbitrary nonempty forcing without that extra convention. Induction on rank gives ${\check{a}}^G=a$ for every generic filter, since each element $b\in a$ is activated by some condition of the nonempty $G$. Thus all ground-model objects have canonical names.

A precise form of the generalized delta-system lemma is this. Let $\mu <\theta$ be infinite cardinals, with $\theta$ regular and uncountable, and suppose $|[\alpha {]}^{<\mu }|<\theta$ for every $\alpha <\theta$. Every family $\mathcal{A}$ of $\theta$ distinct sets, each of cardinality less than $\mu$, contains a subfamily $\mathcal{B}$ of size $\theta$ and a set $r$ such thatThe members form a delta-system with root $r$. A sufficient usual arithmetic hypothesis is ${\alpha }^{\mu }<\theta$ for all infinite cardinals $\alpha <\theta$. The finite-set case $\mu =\omega$ needs only regular uncountable $\theta$, since finite subsets of each $\alpha <\theta$ form a family of size less than $\theta$. This is the form used for the finite-support collapse below.