Forcing axioms and stationary sets (Q1201333): Difference between revisions

Using entangled sets of reals discovered by Todorčević and a way of coding subsets of \(\omega_ 1\) by partitions, it is shown that PFA (even \(\text{FA}(\sigma\)-\(\text{closed}*\text{ccc})\)) implies \(2^{\aleph_ 1}= \aleph_ 2\). By introducing the notion of \(V\)-thin stationary subsets, it is shown that a model of \(\text{SPFA}^ +\) can be extended to a model of SPFA in which \(\text{FA}^ + (\sigma\)- \(\text{closed}*\text{ccc})\) fails. Extending an unpublished theorem of Todorčević, it is proved that if \(\lambda\) is regular and every stationary subset of \(\lambda\) strongly reflects, then \(\lambda^{\aleph_ 0}= \lambda\). For \(\lambda=\omega_ 2\) reflection in \([\omega_ 2]^ \omega\) is equiconsistent with the existence of a weakly compact cardinal and is not implied by reflection of subsets of \(S_ 0^ 2\). The following nice consequence is also proved. (SPFA) If \(M\) is an inner model such that \(\omega_ 2^ M= \omega_ 2\), then \(P(\omega_ 1)\subseteq M\). Todorčević's \(\zeta\)-function is used to show that under \(\square\) a Kurepa tree can be added by a ccc poset. From this it is proved that if SPFA is consistent then so is that \(\text{NS}(\omega_ 1)\) is ccc destructibly saturated.