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

Witness functions and their hulls

Definition

Fix a nonempty L-structure M, an element m0M, and a supplied witness family. The family's indices are pairs (x,ψ) where ψ is an L-formula and x a variable. List FV(ψ){x} in increasing variable-index order as yˉ of length r. The function hx,ψ:MrM must satisfy

Mxψ[aˉ]  Mψ[yˉ:=aˉ,x:=hx,ψ(aˉ)],

and take the value m0 when the existential assertion is false. The index set is a set since formulas and variables form sets. Tuple truth is well defined by Coincidence for term values and satisfaction. If a well-order of M is supplied instead, take its least element as m0 and its least satisfying witness for each nonempty witness set. Separation and Replacement give this family using Existence and uniqueness of set satisfaction. No claim that an arbitrary M admits such a well-order or family in ZF is included.

For AM, put H0=A{m0}. Given Hn, let Hn+1 be its union with all original constant values, all values of original function symbols on finite tuples from Hn, and every hx,ψ(aˉ) for aˉHnr. Define

HullM,h(A)=n<ωHn.

The successor operation is a total function P(M)P(M), so The recursion theorem produces the unique sequence. Witness functions of arity zero are evaluated on the unique empty tuple; original function and relation symbols have positive arity. The insertion of m0 makes the hull nonempty even when A and the original constant set are empty. Its inherited structure restricts the original functions and relations; closure under finite tuples follows by taking a stage containing all tuple entries and passing to its successor. This definition supplies no elementarity or cardinality conclusion in advance.

Conventions and prerequisites: Elementary embeddings, substructures and chains.

Depends on

Used by

Dependency tree · two levels

11 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