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 π:XXˉ be a collapse of actual membership as above. It fixes every transitive subset AX 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 π:XXˉ, 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)α×α:xy}, 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 AX, and an actual ordinal αX.

1.1

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

F1given
1.2

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 uXα, then v=π(t) for tXu; 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.

F1F2given
2.1

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 α.

step 1.2algebra

Depends on

Used by

Dependency tree · two levels

9 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