Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Valuation of names and M[G]

Definition

In ZF, for any G⊆P and P-name tau define

val⁡G(τ)={val⁡G(σ):∃p∈G (⟨σ,p⟩∈τ)}.

The subname relation is well-founded and setlike, as in Absoluteness of names and their ranks and its name definition. For a supplied set function on the predecessors, Separation selects those with a coefficient in G and Replacement takes their values. This is a uniquely valued set rule, so Recursion on well-founded setlike relations gives a unique definable valuation and all its set restrictions. The empty name evaluates to empty. Even G empty is permitted here; then every name evaluates to empty.

For a transitive set ground model M containing P, write

M[G]={val⁡G(τ):τ∈M is a P-name}.

Separation on M and Replacement make this an external set. If M satisfies ZF, namehood in this display agrees with its internal namehood by Absoluteness of names and their ranks. The notation asserts neither genericity of G nor that M[G] is a model of ZF. For a definable class ground model the same display is interpreted as a definable class.

Depends on

Dependency tree · 2 levels

Sources