Alphabeta Math
TheoremStatement: 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.

Ranks agree and hierarchy membership is absolute

Statement

If MN are transitive models of ZF and xM, then rankM(x)=rankN(x). For every αMOrd, (Vα)M=M(Vα)N. Equality of the two internal power sets or stage sets is not asserted.

Facts & Assumptions

[F1]

Ordinals and omega in transitive models: In ambient ZF, ordinalhood is absolute between transitive membership domains containing the parameter. A transitive set model of ZF contains precisely the real finite ordinals as its natural numbers and has ωM=ω. Its ordinals form an initial segment of the actual ordinals.

[F2]

Membership rank under Foundation: Now assume ZF, including Foundation. Membership on the universe is well-founded and setlike, so its ordinal rank is defined for every set. Write

rank(x)=sup{rank(y)+1:yx}.

The empty supremum is 0, so rank()=0. If yx, then rank(y)<rank(x). This is the Foundation-dependent special case of relation rank. The earlier construction of Vα did not require Foundation.

Conventions and prerequisites: def-rank-of-a-well-founded-relation, thm-foundation-equivalent-to-hierarchy-exhaustion.

[F3]

Absolute basic set operations and relations: The graphs of empty set, subset, unordered pair, singleton, union, intersection (with =), difference, Kuratowski ordered pair, Cartesian product, relation domain/range, functionhood, evaluation and injection have Δ0 definitions. Thus their values agree between transitive membership structures whenever the input and output sets are in the smaller domain. This is graph agreement, not an assertion that an arbitrary transitive domain is closed under these operations.

[F4]

Rank characterizes hierarchy membership: In ZF, for every set x and ordinal α,

xVα    rank(x)<α,xVα    rank(x)α.

Thus rank(x) is the least α with xVα, and rank(x)=α iff xVα+1Vα.

Proof

Given: MN are transitive ZF models; x,αM and α is an ordinal.

1.1

Each model has its rank function by its ZF axioms; F1 identifies its ordinal values with actual ordinals. Suppose by external membership induction that both ranks agree on every yx. Transitivity ensures these are exactly the predecessors considered inside either model.

F1given
2.1

By F2, each rank of x is the supremum of the predecessor ranks plus one. Ordinal successor and union have their actual values by F3, so both suprema are the same actual ordinal. For x= both are the empty supremum 0. Foundation validates this external induction, proving rank agreement for every xM.

F2F3step 1.1
3.1

For xM, F4 applied inside the two ZF models gives x(Vα)MrankM(x)<αrankN(x)<αx(Vα)N. Also every element of (Vα)M belongs to M by transitivity. These two statements give precisely the displayed intersection equality.

F4step 2.1

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