Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Separation in the constructible universe

Statement

In ZF, for each fixed membership formula ϕ(x,p) and a,p1,…,pn∈L, the set {x∈a:ϕL(x,p)} belongs to L. Thus every instance of Separation holds in L.

Facts & Assumptions

Given: ZF; fixed formula, constructible set and finitely many constructible parameters. Reflection on a parameter-containing level makes the desired subset an actual Def subset.

[F1]

Finite reflection along constructible levels: Above any bound a transitive level reflects the fixed formula for all its parameter tuples.

[F2]

Definable subsets of a membership structure: Every subset defined over a nonempty set level with its parameters belongs to Def of that level.

Proof

1.1F1given

Choose an ordinal bound large enough that one level contains a and every pi. Reflect ϕ above this bound, obtaining a nonempty transitive Lβ containing those parameters. For every x∈a, transitivity puts x in Lβ, so ϕL(x,p) agrees with satisfaction of ϕ(x,p) in Lβ.

2.1F2step 1.1∎

Over Lβ the formula x∈a∧ϕ(x,p) defines exactly the desired subset: the first conjunct uses actual membership and the second agrees by step 1.1. F2 puts this subset in Def⁡(Lβ)=Lβ+1⊆L. An empty a or a formula with no satisfying elements gives the empty subset by the same definition. The argument uses only this fixed formula and ambient ZF.

Depends on

Dependency tree · 2 levels

Sources