Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

The Solovay inner model satisfies ZF and every real set has a real–ordinal definition

Statement

M=HOD(S) is a transitive ZF inner model with the same ordinals and reals as V[G]. Every AR in M is definable in V[G] from a real and finitely many ordinals, equivalently from one countable ordinal sequence.

Facts & Assumptions

Given: The supplied Solovay extension.

[F1]

The hereditarily ordinal-sequence-definable Solovay model: defines M by hereditary S-ordinal definability.

[F2]

The Lévy collapse localizes countable ordinal data: localizes every member of S and every real.

[F3]

Absorption, factorization, and homogeneous truth in the Solovay collapse: homogeneous tail truth is independent of its generic.

Proof

1.1

Hereditary definability makes M transitive, contains every ordinal, and contains every real because a real is itself an S-parameter; Extensionality, Foundation, Pairing, Union and Infinity are therefore inherited.

F1
2.1

Separation is obtained by conjoining the defining formula of the separated class with the fixed OD(S) definitions of its set parameters. For Replacement, if f,xM and f is functional on x, the ambient set fx is defined from the fixed hereditary codes of f and x by yfx(zx)(z,y)f; every such y is already in the transitive class M, so the image is hereditarily OD(S) and belongs to M. No per-value codes are selected or combined. For Power Set, the ambient set {yx:yM} is defined from x by the uniform OD(S) predicate, and all members of its transitive closure lie in M. Thus every ZF axiom holds in M.

F1step 1.1
3.1

Let AR lie in M. Heredity gives a definition of A from sS and finitely many ordinals α. By F2, s lies in a bounded initial extension. The real-capture clause of F3 supplies a real r and ordinal β such that s is definable over V[r] from (r,β). By F4, V[r]=L[r]. The class L[r] is uniformly definable in V[G] from r, so syntactically restricting every quantifier in the fixed defining formula to L[r] defines the same unique s in V[G]. Substitute that ambient definition of s into the definition of A. Thus A is definable in V[G] from r and the finite ordinal tuple (β,α). Conversely, interleave the natural-number bits of r and the finite tuple (β,α) into one countable ordinal sequence in S. Hence the advertised parameter forms are equivalent, without claiming that an arbitrary ordinal is real-coded or that M=L(R).

F2F3F4step 2.1

Depends on

Used by

Dependency tree · two levels

19 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