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

Los schema for the universe ultrapower

Statement

In ZFC, for each fixed first-order membership formula φ and set functions f1,,fn:IV, the Scott ultrapower satisfies

φE([f1]U,,[fn]U){iI:φ(f1(i),,fn(i))}U.

Here the left side is the fixed formula relativized to the definable Scott domain, with E replacing membership. Thus the ultrapower is extensional and the constant map preserves and reflects every fixed first-order formula. This is a schema, not a uniform truth predicate for V.

Facts & Assumptions

Given: ZFC. Formula induction is proved with both existential directions; minimum witness ranks and Separation reduce coordinate class witnesses to a set family before AC.

[F1]

Scott coding and set-likeness of ultrapower membership: Equality and E are exactly their coordinate U-large predicates.

[F2]

Los theorem for set ultraproducts: The finite Boolean and existential induction pattern applies; the universe witness bound is supplied below.

[F3]

The Axiom of Choice: AC selects from a set family of bounded-rank witness sets.

Proof

1.1

Fix the formula externally. Atomic equality and membership are the coordinate clauses of F1. Negation complements the truth set, and conjunction intersects two truth sets. A proper ultrafilter contains exactly one of a set and its complement, and contains an intersection exactly when it contains both factors. These prove the Boolean induction steps, as in F2, without using satisfaction for a proper-class structure.

F1F2
2.1

Suppose the coordinate truth set A={i:xψ(x,f1(i),,fn(i))} lies in U. For each i in A there is a least ordinal ρi which is the rank of a witness: first bound the search by the rank of any one witness, then minimize ordinals. This defines rho_i uniquely, so Replacement collects these ordinals. For each i in A, Separation in Vρi+1 gives the nonempty set Wi of witnesses of rank rho_i. Replacement collects the family of W_i, and F3 supplies choices g(i) in W_i. Set g(i) to empty outside A. This is a set function on I. Its matrix truth set contains A, so the induction hypothesis gives a Scott-domain witness [g]. The choices were from sets, not proper classes.

F3step 1.1
3.1

Conversely a Scott-domain existential witness has the form [g] for a set function g. The matrix induction hypothesis says its coordinate matrix truth set belongs to U. This set is contained in the existential truth set, which therefore belongs to U by upward closure. Together with step 2.1 this completes the formula induction. For constant parameters the coordinate truth set is I or empty according to the ambient formula's truth; properness gives preservation and reflection by the constant map. Apply the proved schema to the single axiom of Extensionality, true in V: its coordinate truth set is I, so the Scott structure is extensional. No simultaneous truth definition over all formulas was used.

F1step 2.1

Depends on

Used by

Dependency tree · two levels

9 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