Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Canonical Skolem hulls in constructible levels

Definition

Work in ZF. Fix a nonzero limit ordinal α, put S=Lα, and let AS. The levels are those of The constructible hierarchy and constructible rank. Fix an enumeration (φi(y,v0,,vki1))i<ω of all membership formulas with a distinguished witness variable, allowing unused parameter variables and ki=0. Satisfaction refers to the set structure (S,), as constructed in Existence and uniqueness of set satisfaction; it is never truth in the class L.

Let <L be the fixed order in The canonical definable global well-order of L. For aSki let fi(a) be the <L-least bS satisfying φi(b,a) if a witness exists, and the <L-least member of S otherwise. This default is available because α0 implies S. Define

H0=A,Hn+1=Hn{fi(a):i<ω, aHnki},HullLα(A)=n<ωHn.

In particular, Hn0 contains the empty tuple even when Hn is empty: parameter-free witnesses enter at stage one. The enumeration, default and least-witness rule are fixed; no family of arbitrary choices is implicit. Canonical L-hulls are elementary and small supplies set existence, elementarity and size. The finite-tuple convention agrees with Finite-tuple satisfaction is absolute when its transitive-ZF-model hypothesis holds; that hypothesis is not being asserted of S.

Depends on

Used by

Dependency tree · two levels

18 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