Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

Chain conditions preserve high cofinalities and ccc preserves cardinals

Statement

In ZFC, if θ is regular and P is θ-cc, then forcing with P preserves every ground-model cofinality at least θ and every ground-model cardinal at least θ. In particular ccc forcing preserves all cofinalities and cardinals.

Proof

1.1

If pf˙:μˇλˇ, choose for each ξ<μ a maximal antichain below p deciding f˙(ξ). Each has size <θ, so the ground-model set Bξ of possible values has size <θ. Then pran(f˙)ξ<μBξ. AC is used for maximal antichains and their simultaneous selection.

F1
2.1

Let λθ be regular and μ<λ. If a condition forced f˙:μλ cofinal, step 1.1 and regularity would put its range inside a ground set of size max(μ,<θ)<λ, which is bounded in λ, contradiction. Thus regular cofinalities at least θ are preserved; F2 transfers this to every ground cofinality at least θ.

F2F3step 1.1
3.1

Suppose a ground cardinal λθ were collapsed. By F4, some μ<λ and a condition p would force a surjection f˙:μλ. Step 1.1 puts its range inside the ground set U=ξ<μBξ, with Bξ<θ. If λ=θ, regularity of θ gives U<θ; if λ>θ, cardinal arithmetic under AC gives Uμθ=max(μ,θ)<λ (with the finite cases immediate). Either way p cannot force f˙ onto λ. Thus every ground cardinal at least θ remains a cardinal. For ccc, θ=1; finite and countable cardinals and cofinalities are absolute, so steps 2.1 and 3.1 cover all of them.

F3F4step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

37 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