Math 2.0

Theorem

The Fundamental Theorem of Proper Forcing

Statement

The Fundamental Theorem of Proper Forcing, due to Shelah, states that any countable support iteration of proper forcings is itself proper. This follows from the Proper Iteration Lemma, which states that whenever (Pα)α≤κ(P_\alpha)_{\alpha\leq\kappa} is a countable support forcing iteration based on (Qα)α<κ(Q_\alpha)_{\alpha<\kappa} and NN is a countable elementary substructure of HλH_\lambda for a sufficiently large regular cardinal λ\lambda, and Pκ∈NP_\kappa\in N and α∈κ∩N\alpha\in \kappa\cap N and pp is (N,Pα)(N,P_\alpha)-generic and pp forces q∈Pκ/GPα∩N[GPα]q\in P_\kappa/G_{P_\alpha}\cap N[G_{P_\alpha}], then there exists r∈Pκr\in P_\kappa such that rr is NN-generic and the restriction of rr to PαP_\alpha equals pp and pp forces the restriction of rr to [α,κ)[\alpha,\kappa) to be stronger or equal to qq.

This version of the Proper Iteration Lemma, in which the name qq is not assumed to be in NN, is due to Schlindwein.

The Proper Iteration Lemma is proved by a fairly straightforward induction on κ\kappa, and the Fundamental Theorem of Proper Forcing follows by taking α=0\alpha=0.

Further reading

  1. Wikipedia, page 6250799, revision 1306783118, Proper forcing axiom, section The Fundamental Theorem of Proper Forcing. adopted
About this page
TagVY0F6FAA5S
URIm2://VY0F6FAA5S
Kindstatement, theorem
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status VY0F6FAA5S.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.