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.
Master-condition characterizations
Statement
Let and be as in the master-condition definition. For the following are equivalent:
- (i) is -generic;
- (ii) for every dense , ;
- (iii) ;
- (iv) .
Here . Moreover, the club-of-countable-models formulation of properness is equivalent to the all-model formulation in sufficiently large structures .
Facts & Assumptions
Given: ZFC, the displayed , and the stronger-is-smaller forcing convention.
-genericity means that is predense below for every dense . Master conditions and proper posets
The forcing theorem supplies definability and the truth lemma for the formulas and names used below. Forcing theorem
Forcing is persistent, every formula is densely decided, and truth on a dense set below a condition is equivalent to being forced by that condition. Monotonicity, density, and decision for forcing
Downward Löwenheim--Skolem supplies elementary Skolem hulls containing specified parameters. Downward Löwenheim–Skolem with parameters
AC supplies maximal antichains, well-orders of them, and the ambient well-orders/Skolem closures. The Axiom of Choice
Proof
Fix dense. If is predense below , then conditions below that extend a condition of are dense below ; F2 gives . Conversely, if some were incompatible with every member of , then would force that intersection empty. This proves (1) if and only if (2).
Assume (1). The inclusion follows from check names. For the reverse inclusion, let force that a name equals a ground object . Define to contain (a) every for which some ground object satisfies , and (b) every below which no condition has property (a). This set is dense: from any condition, either an extension has property (a), or the original condition has property (b). By definability of forcing it belongs to . Since is predense below , some is compatible with . It cannot have property (b), because a common extension with would force while admitting no ground-value extension. Hence has property (a); by elementarity its witness may be taken as some . A common extension of and forces both and , so . Thus forces every ground member of to lie in , proving (3). Statement (3) immediately implies (4), since ordinals are ground objects and check names give the opposite inclusion.
Assume (4), and let be a maximal antichain. In , use A1 to fix a bijection from an ordinal , and form by mixing the name for the unique index of the member of . Then and by (4). Consequently forces , so is predense below . Every dense contains, by elementarity and A1, such a maximal antichain ; hence is predense below and (1) follows.
The all-model definition immediately gives the club formulation, since the countable elementary submodels of a fixed well-ordered structure form a club by F4 and A1. Conversely, suppose the good models contain a club in , where . Represent a subclub as the models closed under a function . Choose and a well-order so that may be taken as the -least such witness. Every countable is then closed under , so is a good club model. Every subset of , and hence every dense set or maximal antichain in , belongs to ; therefore . An -master below is thus also an -master. This proves the all-model formulation and completes both claimed equivalences. AC is used exactly for A1; no countable transitive model or generic filter is selected.
Depends on
Used by
- Baumgartner's finite-condition generic club forcing is proper Example
- Countable-support fusion at a limit Example
- Proper iteration master-condition lemma Lemma
- Ccc and countably closed forcings are proper Theorem
- Countable-support iterations preserve properness Theorem
- PFA implies the P-ideal dichotomy Theorem
- PFA implies the simple ideal dichotomy Theorem
- Proper forcing preserves stationary subsets of omega-one Theorem
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
- Karagila, Forcing & Symmetric Extensions, Proposition 8.4 and complete proof, printed pp. 38-39 (standard reference, not scraped)
- Cummings, Iterated Forcing and Elementary Embeddings, Lemma 24.2, printed pp. 97-98 (standard reference, not scraped)
- Jech, Set Theory, Theorem 31.7 and Lemma 31.16, printed pp. 603-605 (standard reference, not scraped)