Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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 (ACω)). Let (Pi,Di,(Eni))i<δ 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 Pi 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 1, indexed by an ordinal δ of countable cofinality, with extension relations as in the definition. Increasing means that for every ij<δ, the stage j extends stage i in that relation; the cofinal sequence is fixed from the hypothesis cf(δ)=ω.

[F1]

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.

[F2]

Under The Axiom of Countable Choice (ACω), a natural-number-indexed union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming ACω).

Proof

1.1

Fix an increasing cofinal sequence γ0<γ1< in δ and replace the chain by its cofinal subsequence: every stage lies below some γk, so the union forcing, dense set and relations are unchanged. Put P=kPγk, D=kDγk and En=kEnγk. 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 1 is weakest: every p lies in a stage where p1, and this comparison persists in the union. For pP take a stage containing it and a strengthening d in that stage's dense set. Then dD and dp, proving D dense in P.

F1
2.1

Every Pi is complete in the union. The order on Pi is the restriction of the union order by the extension clauses. If two conditions of Pi have a common lower bound in the union, that lower bound belongs to some later stage Pγk, and completeness of Pi in that stage reflects compatibility back to Pi; thus incompatibility is also the restriction. Finally let A be a maximal antichain of Pi and pP. Choose a later stage Pγk containing both Pi and p. The extension relation makes A maximal in Pγk, so some aA is compatible with p there and hence in the union. Thus every maximal antichain of Pi remains maximal in P, which is exactly completeness in [F1].

F1step 1.1
2.2

The relations are well defined: Enγk is the restriction of Enγj for jk by [F1], so the union relation is an equivalence relation on D extending each stage relation and satisfying En+1En.

F1step 1.1
3.1

At most countably many classes. First, for stages ij, if rDjPi, density gives dDi with dr. The last extension clause implies rDi, so DjPi=Di. If pDi and rEnjp, the class-containment clause gives rPi, and the preceding identity gives rDi. Restriction of the relations now gives rEnip. Consequently the class of qDγk under En is the union of its classes at the stages, and it equals its Enγk-class, because every later class meeting Dγk is contained in Dγk and restricts to the old relation. Since every Enγk has countably many classes and countable choice counts countable unions of countable sets, En has countably many classes.

F1F2step 2.2
3.2

Downward directedness: if x1,x2 lie in one En-class, take a stage γk containing both and realizing their relations; the Enγk-class of x1 equals the En-class, and the stage model is directed, so a common lower bound exists inside that stage class, hence inside the union class.

F1step 2.2
4.1

Sequential clause: let qiEiqω for i<ω, and choose a stage Pγk containing qω. By step 3.1, for every i the entire union Ei-class of qω is its old Eiγk-class and is contained in Dγk. Hence every qi already belongs to that one stage and satisfies qiEiγkqω there. The sequential clause of the stage model supplies a common lower bound of the whole sequence and, for every n, a common lower bound of the tail in the Enγk-class of qω; these are also valid lower bounds and the same classes in the union.

F1step 3.1
4.2

Transfer clause: given p,qD and n, take a stage γj containing both. The transfer clause of that stage model supplies a modulus k. If pEkp in the union, step 3.1 puts p in the same old Ekγj-class, hence in Dγj; and any assumed witness from the union En-class of q is likewise already in its old stage class. The stage transfer clause therefore supplies the required witness, which also serves in the union.

F1step 3.1
5.1

Steps 2.1 through 4.2 verify the four sweetness clauses and completeness of the stage embeddings for (P,D,(En)), which is the assertion of the Statement.

step 4.1step 4.2step 2.1

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