Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A principal ultrapower is the original structure

Example

In ZF, let I contain i_0, let U={AI:i0A}, and let M be a nonempty set structure. The constant-family quotient is well-defined without AC, and

[f]Uf(i0)

is an isomorphism from its ultrapower to M, sending [ca]U to a.

Facts & Assumptions

Given: ZF, conditional on the displayed data. Computed equality, every symbol and relation at the principal coordinate, with constant functions proving surjectivity and product nonemptiness without AC.

[F1]

Set ultraproducts and constant-map ultrapowers: Use the stated quotient and coordinate-symbol formulas; their well-definedness and nonemptiness in this constant principal case are proved here in ZF.

Verification

1.1

In the displayed U, a coordinate equality set belongs to U exactly when f(i_0)=g(i_0). This proves directly that the quotient equivalence is equality at i_0 and evaluation is well-defined and injective. Every a in M has the explicitly defined constant function c_a in the product, so evaluation is surjective and sends [c_a] to a. Nonemptiness of M therefore gives a nonempty product and quotient, without any family of choices.

F1
2.1

A constant symbol evaluates at i_0 to its original interpretation. For a function symbol F and representatives f_1,...,f_n, evaluation of its interpreted class is exactly FM(f1(i0),,fn(i0)). This also shows independence of representatives in that interpreted symbol. A relation holds in the quotient exactly when its coordinate truth set contains i_0, that is, when it holds on the evaluated tuple in M. Thus evaluation preserves functions and preserves and reflects relations, including equality by step 1.1; it is an isomorphism. Zero-arity symbols give the same calculation with the empty tuple. This local verification uses the formulas of F1, not the choice-dependent general Los theorem.

F1step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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