How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Countable-support iterations preserve properness
Statement
In ZFC, if every iterand in a countable-support iteration is forced proper by its preceding stage, then the full iteration and every initial segment are proper.
Facts & Assumptions
Given: A countable-support iteration such that is proper for every .
The proper-iteration master lemma extends a master at an earlier stage to a master at any later stage while placing a named model condition into the generic. Proper iteration master-condition lemma
Properness means that below every there is an -master, for every relevant countable elementary model . Master conditions and proper posets
Properness on a club of relevant countable models is equivalent to the all-model formulation. Master-condition characterizations
AC supplies the well-ordered elementary structures and countable models quantified over by properness. The Axiom of Choice
Proof
Fix and a sufficiently large well-ordered containing the full iteration and . The countable elementary submodels containing these fixed parameters form a club. Fix one such and ; then and the restricted iteration belong to . At the trivial stage , its unique condition is -generic, and the canonical -name is forced to belong to with trivial restriction in . Apply F1 with to obtain an -generic such that . Hence and are compatible: otherwise directedness of a generic filter would make force . Choose a common extension . Predensity below persists below the stronger condition , so is still -generic and is now literally below .
Step 1.1 proves the master condition on the club of models containing the full iteration and ; F3 converts this to the all-model formulation in F2. Thus is proper. Since was arbitrary and the hypotheses restrict to every initial segment, every , including , is proper. Successor lengths, limits of countable cofinality, and limits where is bounded are already the exhaustive cases in F1; no closure of the individual iterands is assumed. AC is used only as recorded in A1 and in the supplier F1.
Depends on
Used by
Dependency tree · two levels
16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jech, Set Theory, Proper Iteration Lemma 31.17 and Theorem 31.15, printed pp. 604-606 (standard reference, not scraped)
- Karagila, Forcing & Symmetric Extensions, Fact 8.15 (standard reference, not scraped)