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

What the collapse fixes

Statement

Let π:X→Xˉ be a collapse of actual membership as above. It fixes every transitive subset A⊆X pointwise. If α∈X is an actual ordinal, π(α) is the order type of X∩α. In particular, if X∩α is transitive, π(α)=X∩α.

Facts & Assumptions

[F1]

Collapse of elementary membership submodels: Let M be a set with (M,∈)⊨Extensionality and let X≺(M,∈). In ambient ZF, ∈ restricted to X is well-founded and extensional. It has a unique transitive collapse π:X→Xˉ, and the inverse collapse followed by inclusion is an elementary embedding Xˉ→M. Countability is preserved by π.

[F2]

Ordinal (von Neumann): A set α is an ordinal when both of the following hold.

  1. α is a transitive set: every element of α is also a subset of α, that is x∈α⇒x⊆α.
  2. The membership relation restricted to α, namely {(x,y)∈α×α:x∈y}, is a strict well-order of α (def-well-order): it is irreflexive, transitive as a relation, trichotomous on α, and every nonempty subset of α has an ∈-least element.

Ordinals are written with lowercase Greek letters, and for ordinals we set

α<β:  ⟺  α∈β,α≤β:  ⟺  (α∈β or α=β).

Write 0:=∅, which is an ordinal because both clauses hold vacuously, and write α+:=α∪{α} for the successor of α.

Proof

Given: A membership-collapse isomorphism π, a transitive A⊆X, and an actual ordinal α∈X.

1.1F1given

For a∈A, transitivity gives a⊆A⊆X. Assuming the collapse fixes every member u∈a, its equation (F1) gives π(a)={π(u):u∈a}=a. External membership induction proves this for all a∈A, starting with the empty predecessor set.

1.2F1F2given

The restriction of π to X∩α is an order isomorphism onto the elements of π(α), by its equation and injectivity. This image is transitive: if v∈π(u) and u∈X∩α, then v=π(t) for t∈X∩u; ordinal transitivity gives t∈α, so v∈π(α). The induced membership order is a well-order since X∩α inherits one from α (F2). Thus π(α) is an ordinal of the indicated order type.

2.1step 1.2algebra∎

If X∩α is transitive it is itself an ordinal, and the unique ordinal isomorphic to its membership order is itself. Therefore its order type, hence π(α), equals X∩α. Without the hypothesis α⊆X this need not equal α.

Depends on

Dependency tree · 2 levels

Sources