Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Condensation for constructible levels

Statement

In ZF, let α be a nonzero limit ordinal, let X(Lα,), and let π:XM be the Mostowski collapse. Then

M=Lβfor β=MOrd.

Moreover, π fixes every transitive set AX pointwise. For every ordinal ξX, π(ξ) is the order type of Xξ; in particular, if Xξ is transitive then π(ξ)=Xξ.

Facts & Assumptions

Given: Ambient ZF, a nonzero limit ordinal α, an elementary substructure XLα, and its collapse π:XM.

[F1]

Finite-stage L histories and weak limit-level absoluteness supplies one fixed finite sentence C which holds in every nonzero limit L-level and characterizes such levels among nonempty transitive sets.

[F2]

Collapse of elementary membership submodels says that the membership relation on X has a unique transitive collapse and that the collapse is an isomorphism XM.

[F3]

What the collapse fixes gives the stated fixing and ordinal-order-type conclusions for any actual-membership collapse.

Proof

1.1

By F1, (Lα,)C. Since XLα, also (X,)C. F2 makes π an isomorphism from (X,) to the transitive set (M,), so MC. In particular M is nonempty; no assertion that Lα or M satisfies Infinity, Power Set, Replacement, Separation, or Choice has been used.

F1F2given
2.1

Put β=MOrd. The converse direction of F1 applies directly to the nonempty transitive set M satisfying C and yields M=Lβ. This includes the boundary α=ω: the supplier proves Lω=Vω, verifies C there by finite certificates, and explicitly does not infer Infinity.

F1step 1.1
3.1

F3 applied to this collapse fixes each transitive AX pointwise. It also gives π(ξ)=otp(Xξ) for every actual ordinal ξX, and gives π(ξ)=Xξ when that intersection is transitive. These conclusions do not require X itself to be transitive, and the empty transitive part is fixed vacuously.

F3step 2.1

Depends on

Used by

Dependency tree · two levels

18 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