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.

Closure, distributivity, and absence of new short sequences

Statement

In ZFC, for an infinite regular κ and a separative forcing order P, κ-distributivity of P is equivalent to P adding no new sequences of ground-model elements of length below κ. For an arbitrary forcing preorder, the equivalence applies to its separative quotient. Every κ-closed P is κ-distributive. Hence κ-closed forcing adds no new subsets of any ordinal γ<κ and preserves all ground-model cofinalities and cardinals at most κ.

Facts & Assumptions

Given: AC, a regular infinite κ, and a forcing preorder P; in the equivalence, P is separative, meaning that qp has an extension incompatible with p.

[F1]

Closure, distributivity, and chain conditions for forcing orders fixes the strict length bounds and order orientation.

[F2]

Forcing theorem supplies deciding extensions and the truth lemma.

[F3]

Transfinite recursion constructs sequences of decisions of length below κ.

Proof

1.1

Suppose P is κ-closed. Given p and dense open Dξ for ξ<γ<κ, recursively choose pξ+1pξ in Dξ and at each limit take a lower bound. Regularity keeps every stage below κ; a final lower bound belongs to every Dξ. Thus P is κ-distributive. AC is used for the recursive choices.

F1F3
1.2

Suppose P is κ-distributive and pf˙:γˇVˇ for γ<κ. For each ξ<γ, the set of conditions deciding f˙(ξ) is dense open. A common extension q decides every coordinate, say as xξV. Replacement forms f=xξ:ξ<γ in the ground model and qf˙=fˇ. Conversely, assume that separative P adds no such sequence. Given maximal antichains Aξ for ξ<γ, let f˙(ξ) be the unique member of Aξ met by the generic. This is a name for a γ-sequence of ground-model conditions, hence conditions deciding its whole ground-model value are dense. If q decides that value as fq, then qfq(ξ) for every ξ: otherwise separativity gives rq incompatible with fq(ξ), while a generic through r must both realize the decision and meet Aξ, a contradiction. A maximal antichain of such q therefore refines every Aξ. Replacing each dense open set by a maximal antichain contained in it proves that the intersection of the original family is dense. AC is used to choose the maximal antichains.

F1F2
2.1

A subset of γ<κ is a 2-valued sequence of length γ, so closure adds none. A new cofinal map into a ground-model ordinal of cofinality at most κ, or a collapse of a cardinal at most κ, would yield after restricting to a cofinal domain a new sequence of ground-model ordinals of length below κ. Hence those cofinalities and cardinals are preserved.

step 1.1step 1.2

Depends on

Used by

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