Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

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=⋃α∈Ord⁡Vα 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:y∈x}. The empty supremum is 0, so rank⁡(∅)=0. If y∈x, 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.1F2

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

2.1F1step 1.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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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