Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2015/iii/paper-24/5/c/ii/solution

The finite binary-function Cohen forcing is countable in . It preserves , and the countable levels, height, and normal extensions of the ground-model tree remain unchanged.
If the extension contained an uncountable tree antichain, apply the ground-model uncountable subset lemma for countable forcing to obtain an uncountable contained in it. Incomparability in the fixed ground-model tree is absolute, so already regards as an uncountable tree antichain, contradicting that is Suslin in . Similarly, a new cofinal branch has an uncountable ground-model subset. Comparability is absolute, so this would be an uncountable chain in the ground-model tree, again impossible.
Therefore countable forcing preserves Suslin trees, and in particular

New to topics? Read the docs here!