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.
Continuous countable unions of sweetness models remain sweet
Statement
Assume Countable Choice (The Axiom of Countable Choice ()). Let be a continuous increasing chain of sweetness models, where has countable cofinality and every successor extends its predecessor in the exact sweetness-model sense, and all stages have the same distinguished weakest condition. Then the direct union forcing, dense set, and stabilized equivalence relations form a sweetness model, and every is a complete subforcing of the union.
Facts & Assumptions
Given: Countable Choice and a continuous increasing chain of sweetness models with a common distinguished weakest condition , indexed by an ordinal of countable cofinality, with extension relations as in the definition. Increasing means that for every , the stage extends stage in that relation; the cofinal sequence is fixed from the hypothesis .
Shelah sweetness models for forcing: the sweetness clauses, and the five extension clauses, in particular that every new class meeting an old dense set is contained in it and that the old relations are the restrictions of the new ones.
Under The Axiom of Countable Choice (), a natural-number-indexed union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming ).
Proof
Fix an increasing cofinal sequence in and replace the chain by its cofinal subsequence: every stage lies below some , so the union forcing, dense set and relations are unchanged. Put , and . The inherited order is reflexive and transitive: each finite collection of conditions and comparisons lies in one later stage. The union is nonempty since each forcing stage is nonempty. Its distinguished condition is weakest: every lies in a stage where , and this comparison persists in the union. For take a stage containing it and a strengthening in that stage's dense set. Then and , proving dense in .
Every is complete in the union. The order on is the restriction of the union order by the extension clauses. If two conditions of have a common lower bound in the union, that lower bound belongs to some later stage , and completeness of in that stage reflects compatibility back to ; thus incompatibility is also the restriction. Finally let be a maximal antichain of and . Choose a later stage containing both and . The extension relation makes maximal in , so some is compatible with there and hence in the union. Thus every maximal antichain of remains maximal in , which is exactly completeness in [F1].
The relations are well defined: is the restriction of for by [F1], so the union relation is an equivalence relation on extending each stage relation and satisfying .
At most countably many classes. First, for stages , if , density gives with . The last extension clause implies , so . If and , the class-containment clause gives , and the preceding identity gives . Restriction of the relations now gives . Consequently the class of under is the union of its classes at the stages, and it equals its -class, because every later class meeting is contained in and restricts to the old relation. Since every has countably many classes and countable choice counts countable unions of countable sets, has countably many classes.
Downward directedness: if lie in one -class, take a stage containing both and realizing their relations; the -class of equals the -class, and the stage model is directed, so a common lower bound exists inside that stage class, hence inside the union class.
Sequential clause: let for , and choose a stage containing . By step 3.1, for every the entire union -class of is its old -class and is contained in . Hence every already belongs to that one stage and satisfies there. The sequential clause of the stage model supplies a common lower bound of the whole sequence and, for every , a common lower bound of the tail in the -class of ; these are also valid lower bounds and the same classes in the union.
Transfer clause: given and , take a stage containing both. The transfer clause of that stage model supplies a modulus . If in the union, step 3.1 puts in the same old -class, hence in ; and any assumed witness from the union -class of is likewise already in its old stage class. The stage transfer clause therefore supplies the required witness, which also serves in the union.
Steps 2.1 through 4.2 verify the four sweetness clauses and completeness of the stage embeddings for , which is the assertion of the Statement.
Depends on
Used by
Dependency tree · two levels
14 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
- Saharon Shelah, Can You Take Solovay's Inaccessible Away? (standard reference, not scraped)