Not collapsing cardinals \(\leq\kappa\) in \((<\kappa)\)-support iterations (Q1424102): Difference between revisions

Preservation theorems are essential tools in applications of iterated forcing. A great many of these theorems were proved by the author and much of his work on finite and countable support iterations is surveyed in his book [Proper and improper forcing. 2nd ed. Berlin: Springer (1998; Zbl 0889.03041)]. The present paper investigates iterations with larger supports. The specific goal is stated in the title: preservation of cardinals when the supports in the iteration have size smaller than~\(\kappa\), where \(\kappa>\aleph_1\); this goal is optimal in that, generally, cardinals from~\(\kappa^+\) and up will be collapsed no matter what the partial orders in the iteration are. The author develops completeness-like properties that (1) preserve all cardinals from~\(\kappa\) and down; and (2) are preserved under \(<\kappa\)-support iterations. These are akin to \(S\)-completeness, as formulated in Chapter 5 of the book cited above. The applications are similar: uniformization results for ladder systems and new aspects of Whitehead groups. This is not to say that the proofs are in any way similar; new and interesting techniques will keep the interested reader busy for a while.