Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedaudited 2026-09-14
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 Pξ,Q˙ξ:ξ<η be a countable-support iteration of forced-proper iterands. For a relevant countable M containing the iteration and η, and pPηM, the limit-stage construction can be traced through cofinal stages so that it meets every dense subset of Pη belonging to M. 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, M, η, and p in the Statement.

[F1]

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

[F2]

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

[F3]

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

1.1

Because cf(η)=ω and ηM, choose in M an increasing cofinal sequence 0=η0<η1<<η, and enumerate the dense subsets of Pη which belong to M as Dn:n<ω, repeating a dense set if necessary. Put q0=1P0 and let p˙0=pˇ. Then q0 is the trivial (M,P0)-master and forces p0η0G0.

F1F3Given
2.1

Recursively suppose that qn is an (M,Pηn)-master and forces that pnPηM with pnηnGηn. Work in a Pηn-generic extension containing qn and resolve pn. This value is a ground-model condition in M, so the ground set En={uPηn:upnηn or (rpn)[rDn & urηn]}. This set belongs to M and is dense: below a condition compatible with pnηn, take a common extension, paste it to the tail of pn, and strengthen the resulting Pη-condition into Dn. By F2 the generic below qn meets EnM. Its member cannot take the incompatible alternative because pnηn is in the same generic. Elementarity therefore gives a name p˙n+1 forced to satisfy pn+1DnM,pn+1pn,pn+1ηnGηn. Apply F1 from ηn to ηn+1 to obtain an (M,Pηn+1)-master qn+1 such that qn+1ηn=qn and qn+1 forces pn+1ηn+1Gηn+1.

F1F2F3step 1.1
3.1

Define q=n<ωqn. The displayed coherence makes this a function whose restriction to every ηn is exactly qn. Its support is contained in the countable union of the countable supports of the qn, hence is countable; cofinality of the ηn leaves no unfilled coordinate below η. Thus F3 gives qPη. This is the fusion step. It takes no lower bound of the sequence qn(ξ):n<ω inside a single iterand: after coordinate ξ first appears, later conditions preserve the already constructed initial segment containing it.

F1F3step 2.1
4.1

The conclusion that q forces each pn+1 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 qpn+1DnMG˙η for every n. It follows that every DnM is predense below q, so q is an (M,Pη)-master. Also F1 gives qpˇG˙η, so q is compatible with p. Choose a common extension qq,p; mastery and all displayed forced conclusions persist below q. Hence q is the promised master literally below p. The index n=0, the empty initial stage, one-coordinate supports, and a finite list of dense sets are all covered by the same recursion.

F1step 1.1step 2.1step 3.1

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