Alphabeta Math
Pipeline-generated
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.

Well-Founded Relations, Rank, and the Cumulative Hierarchy: Examples and Counterexamples

1 · Prerequisites

2 · Summary

The examples compute small hierarchy stages and a finite Mostowski collapse, show why extensionality is required for injectivity, and separate singleton cardinality from hereditary size and rank. The final refutation explains why the hierarchy exhausts the universe only as a class.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

First hierarchy stages and their ranks

Example

The first hierarchy stages are V0=, V1={} and V2={,{}}. Their ranks are respectively 0,1,2. Also rank({{}})=2, even though this last singleton is not the ordinal 2.

Facts & Assumptions

Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.

[F1]

In ZF, for every ordinal α, rank(α)=α and rank(Vα)=α. (Ranks of ordinals and hierarchy stages)

Verification

1.1

Unfolding the empty stage and two power sets gives the displayed sets. The rank-of-stages formula gives rank(Vi)=i for i=0,1,2.

F1
2.1

The membership-rank equation gives rank({{}})=rank({})+1=2. This singleton omits , while the ordinal 2={,{}} contains it. Equal ranks therefore do not identify sets.

F1step 1.1
ExampleConstruction: AI-adaptedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Collapsing a relation that is not transitive

Example

Take distinct nodes a,b,c and R={(a,b),(b,c)}. This relation is well-founded and extensional but not transitive. Its collapse is a, b{}, c{{}}.

Facts & Assumptions

Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.

[F1]

Every well-founded setlike extensional relation R on a definable class X is isomorphic to membership on a unique transitive definable class Y, by a unique definable isomorphism π:XY. For a set domain X, the isomorphism and its image are sets. This holds without ambient Foundation. (Mostowski collapse for extensional relations)

Verification

1.1

The predecessor sets are respectively ,{a},{b}, which are distinct. In any nonempty subset of the nodes, the first present node in the list a,b,c has no predecessor in that subset, proving well-foundedness. Yet aRb and bRc hold while aRc does not.

given
2.1

The collapse equation successively gives the three displayed values. Its range is transitive: the members of {} and of {{}} are already in that range. The collapse theorem makes this the unique isomorphism to a transitive membership structure.

F1step 1.1
CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Extensionality is needed for injective collapse

Statement refuted

False claim: every well-founded relation has an injective collapse. Let X={a,b} with ab and R=.

Facts & Assumptions

Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement refuted.

[F1]

A setlike relation R on X is extensional when predR(x)=predR(y) implies x=y for x,yX. If R is also well-founded, its collapse map is the unique definable function π(x)={π(y):yRx}. Existence and uniqueness follow from well-founded recursion with G(x,h)=ran(h), a set by Replacement. A collapse map is defined even without extensionality; injectivity is a further conclusion requiring extensionality. The construction for a supplied well-founded relation uses no ambient Foundation. Conventions and prerequisites: thm-recursion-on-well-founded-setlike-relations. (Extensional relations and collapse maps)

Counterexample

1.1

Every member of every nonempty subset of X is minimal, so R is well-founded and setlike. Its two predecessor sets are both empty, so it is not extensional.

F1
2.1

The collapse rule gives π(a)==π(b), because both predecessor images are empty. Thus the collapse exists but is not injective.

F1step 1.1
ExampleConstruction: AI-adaptedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A singleton can have large rank and hereditary size

Example

For every infinite ordinal α, the singleton s={α} has rank α+1 although it has exactly one element. Its root-inclusive closure TC({s}) contains every ordinal below α. In particular when α=κ is an infinite initial ordinal, sHκ.

Facts & Assumptions

Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.

[F1]

Let κ be an infinite initial ordinal. In ZF set Hκ={x:λ<κ j (j:TC({x})λ)}. This initially defines a class. Its root-inclusive transitive closure contains x as an element. When TC({x}) is well-orderable its hereditary cardinality means the least ordinal equinumerous with it; under Choice this exists for every set. The injection formulation above is used without Choice. For infinite κ, replacing TC({x}) by TC(x) gives the same class. Indeed TC({x})={x}TC(x) by the finite-stage formula. Adding one point to a set injecting into finite λ gives an injection into λ+1<κ; for infinite λ, keep indices at least ω, shift natural indices by one, and use index zero for the added point, obtaining an injection into λ. Restriction gives the converse. We retain the root-inclusive convention throughout. Conventions and prerequisites: prop-transitive-closure-minimality, def-cardinal. (Hereditary size and H_kappa)

[F2]

In ZF, for every ordinal α, rank(α)=α and rank(Vα)=α. (Ranks of ordinals and hierarchy stages)

Verification

1.1

The ordinal-rank formula and membership-rank equation give rank(s)=sup{rank(α)+1}=α+1. Its only element is α, so its cardinality is one.

F2
2.1

Starting from {s}, transitive closure contains s, then αs, and then all βα. If α=κ and this closure injected into λ<κ, restriction would inject κ into λ, impossible for an initial ordinal: the image subset of λ has order type at most λ and is equinumerous with κ. Thus the defining witness for Hκ cannot exist.

F1step 1.1
False statementConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

V is a set

Statement

False statement: the class V of all sets is itself a set. Equivalently, there is a set containing every set as an element.

Facts & Assumptions

Given: Work in ZF unless the statement explicitly weakens or supplements it; fix the objects and hypotheses of the statement.

[F1]

In ZF every set x belongs to Vrank(x)+1. Consequently V=αOrdVα in the class sense: every set lies in a stage. This is not a union indexed by a set of all ordinals. (The universe is the class union of its stages)

[F2]

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. (Membership rank under Foundation)

Refutation

1.1

Suppose a set U contains every set. In particular it contains itself, since U is a set. Under ZF its membership rank is an ordinal, and the strict membership-rank inequality gives rank(U)<rank(U).

F2
2.1

An ordinal cannot be strictly below itself, so such U does not exist. The class-union assertion about the hierarchy states only that every set belongs to some stage, and therefore does not supply a set U to evade this contradiction.

F1step 1.1

Sources