Alphabeta Math
PropositionStatement: AI-adaptedProof: 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.

H_omega equals V_omega

Statement

In ZF, Hω=Vω. These are exactly the sets whose root-inclusive transitive closure is finite, called hereditarily finite sets.

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 infinite initial ordinal κ, Hκ is a transitive set and HκVκ. For infinite initial ordinals κμ, one has HκHμ. (H_kappa is a transitive subset of V_kappa)

[F2]

In ZF without Foundation define the cumulative hierarchy by V0=,Vα+1=P(Vα),Vλ=β<λVβ(λ a nonzero limit ordinal). For each ordinal θ, use the set well-order recursion schema on θ+1. On histories of domain 0 return ; on domain β+1 return the power set of the last value; on nonzero limit domains return the union of the range. Each is a unique set. Recursions on different ordinal intervals agree on overlaps by the uniqueness clause applied to the smaller interval. Hence the definition of Vα as the value at α is uniform and independent of the chosen interval. Power Set is used at successors and Replacement and Union at limits. The notation Vα:αOrd denotes a definable class function, not a set sequence. Conventions and prerequisites: thm-transfinite-recursion, lem-ordinal-basics, def-limit-ordinal. (The cumulative hierarchy)

Proof

1.1

The general bound gives HωVω. The definition of Hω says its root closure injects into a finite ordinal, exactly finiteness: a subset of a finite ordinal can be enumerated in increasing order, and a finite set injects into its size.

F1
1.2

Every Vn is finite by natural induction. V0 is empty. If Vn has m elements, membership bits relative to a finite enumeration biject its power set with the length-m binary words. Those form a finite set: for zero length there is one word, and appending either bit doubles the previous finite number. Thus Vn+1 is finite.

F2
2.1

If xVω, choose n<ω with xVn. The finite transitive set Vn contains x as an element, hence contains TC({x}) by minimality. That closure is finite, so xHω. Together with step 1.1 this proves equality.

F1F2step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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