You are on page 1of 1

1

Suppose P is almost homogeneous, (v1 , . . . , vn ) is a formula, x1 , . . . , xn are sets, p P, and p (1 , . . . , xn ). Then for any q P, there is an i : P P, an automorphism of P, such that i(p) is x compatible with q. Then pick r a common extension of i(p) and q. Immediately, i (k ) = xk , since i(1) = 1, so i(p) x (1 , . . . , xn ), so r x (1 , . . . , xn ). Thus x q (1 , . . . , xn ). x But q was chosen arbitrarily, so this holds for all q P; thus 1 (1 , . . . , xn ), so 1 (1 , . . . , xn ). x x So, if any p forces , then so does 1; if not, then by construction of forcing negation, 1 (1 , . . . , xn ). x

You might also like