Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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 iterations preserve properness

Statement

In ZFC, if every iterand in a countable-support iteration is forced proper by its preceding stage, then the full iteration and every initial segment are proper.

Facts & Assumptions

Given: A countable-support iteration ⟨Pξ,Q˙ξ:ξ<δ⟩ such that Pξ⊩Q˙ξ is proper for every ξ<δ.

[F1]

The proper-iteration master lemma extends a master at an earlier stage to a master at any later stage while placing a named model condition into the generic. Proper iteration master-condition lemma

[F2]

Properness means that below every p∈P∩M there is an (M,P)-master, for every relevant countable elementary model M. Master conditions and proper posets

[F3]

Properness on a club of relevant countable models is equivalent to the all-model formulation. Master-condition characterizations

[A1]

AC supplies the well-ordered elementary structures and countable models quantified over by properness. The Axiom of Choice

Proof

1.1F1F3A1Given

Fix α≤δ and a sufficiently large well-ordered Hθ containing the full iteration and α. The countable elementary submodels containing these fixed parameters form a club. Fix one such M and p∈Pα∩M; then Pα and the restricted iteration belong to M. At the trivial stage P0, its unique condition q0 is (M,P0)-generic, and the canonical P0-name pˇ is forced to belong to Pα∩M with trivial restriction in G0. Apply F1 with γ=0 to obtain an (M,Pα)-generic q such that q⊩pˇ∈G˙α. Hence q and p are compatible: otherwise directedness of a generic filter would make q force pˇ∉G˙α. Choose a common extension q′≤q,p. Predensity below q persists below the stronger condition q′, so q′ is still (M,Pα)-generic and is now literally below p.

2.1F1F2F3A1step 1.1∎

Step 1.1 proves the master condition on the club of models containing the full iteration and α; F3 converts this to the all-model formulation in F2. Thus Pα is proper. Since α≤δ was arbitrary and the hypotheses restrict to every initial segment, every Pα, including Pδ, is proper. Successor lengths, limits of countable cofinality, and limits where M∩α is bounded are already the exhaustive cases in F1; no closure of the individual iterands is assumed. AC is used only as recorded in A1 and in the supplier F1.

Depends on

Used by

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