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 fusion at a limit
Statement
Let be a limit ordinal of cofinality , and let be a countable-support iteration of forced-proper iterands. For a relevant countable containing the iteration and , and , the limit-stage construction can be traced through cofinal stages so that it meets every dense subset of belonging to . The fusion is the union of coherent initial segments; it is not a coordinatewise fusion assertion for arbitrary proper iterands.
Facts & Assumptions
Given: ZFC, the iteration, , , and in the Statement.
The proper-iteration master lemma extends an earlier-stage master to a later-stage master with the exact earlier restriction and forces a named model condition into the later generic. Proper iteration master-condition lemma
A model-generic condition forces generic intersections with every dense set in the model; equivalently it makes each such intersection predense below it. Master-condition characterizations
At a countable-cofinality limit, a coherent family of initial conditions with countable union of supports defines a condition in the countable-support inverse limit. Countable-support forcing iterations
Verification
Because and , choose in an increasing cofinal sequence and enumerate the dense subsets of which belong to as , repeating a dense set if necessary. Put and let . Then is the trivial -master and forces .
Recursively suppose that is an -master and forces that with . Work in a -generic extension containing and resolve . This value is a ground-model condition in , so the ground set This set belongs to and is dense: below a condition compatible with , take a common extension, paste it to the tail of , and strengthen the resulting -condition into . By F2 the generic below meets . Its member cannot take the incompatible alternative because is in the same generic. Elementarity therefore gives a name forced to satisfy Apply F1 from to to obtain an -master such that and forces .
Define The displayed coherence makes this a function whose restriction to every is exactly . Its support is contained in the countable union of the countable supports of the , hence is countable; cofinality of the leaves no unfilled coordinate below . Thus F3 gives . This is the fusion step. It takes no lower bound of the sequence inside a single iterand: after coordinate first appears, later conditions preserve the already constructed initial segment containing it.
The conclusion that forces each into the full generic is the limit conclusion of F1 applied to exactly the recursion in steps 1.1--3.1. It does not follow merely from compatibility of all bounded restrictions, and no such inverse-limit compactness is asserted here. F1 therefore gives for every . It follows that every is predense below , so is an -master. Also F1 gives , so is compatible with . Choose a common extension ; mastery and all displayed forced conclusions persist below . Hence is the promised master literally below . The index , the empty initial stage, one-coordinate supports, and a finite list of dense sets are all covered by the same recursion.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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 complete proof, printed pp.605-606 (standard reference, not scraped)