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 π:X→M be the Mostowski collapse. Then

M=Lβfor β=M∩Ord⁡.

Moreover, π fixes every transitive set A⊆X 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 X≺Lα, and its collapse π:X→M.

[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 X≅M.

[F3]

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

Proof

1.1F1F2given

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

2.1F1step 1.1

Put β=M∩Ord⁡. 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.

3.1F3step 2.1∎

F3 applied to this collapse fixes each transitive A⊆X 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.

Depends on

Dependency tree · 2 levels

Sources