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 is a countable support forcing iteration based on and is a countable elementary substructure of for a sufficiently large regular cardinal , and and and is -generic and forces , then there exists such that is -generic and the restriction of to equals and forces the restriction of to to be stronger or equal to .
This version of the Proper Iteration Lemma, in which the name is not assumed to be in , is due to Schlindwein.
The Proper Iteration Lemma is proved by a fairly straightforward induction on , and the Fundamental Theorem of Proper Forcing follows by taking .
Further reading
- Wikipedia, page 6250799, revision 1306783118, Proper forcing axiom, section The Fundamental Theorem of Proper Forcing. adopted
About this page
| Tag | VY0F6FAA5S |
|---|---|
| URI | m2://VY0F6FAA5S |
| Kind | statement, theorem |
| Writing | W0 stub |
| Status | This copy of the site has no build data. Run m2 status VY0F6FAA5S. |
| Changed | 4 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.