Alphabeta Math
LemmaStatement: 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.

The ultraproduct is a well-defined nonempty structure

Statement

In ZFC the set ultraproduct has a nonempty set carrier; its equivalence relation, function and relation symbols are well-defined, independent of representatives. In a constant family the diagonal map is well-defined and injective.

Facts & Assumptions

Given: ZFC. Proved equivalence, set quotient and nonemptiness, then used a finite U-large equality intersection to verify each interpreted symbol and both directions of relation independence.

[F1]

Set ultraproducts and constant-map ultrapowers: The carrier, equivalence relation and symbol interpretations are prescribed coordinatewise.

[F2]

Characterisation of ultrafilters: every set or its complement: U is proper, closed under finite intersections and upward inclusion, and decides complementary sets.

[F3]

The Axiom of Choice: AC supplies a product function from the nonempty carriers.

Proof

1.1

Equality sets show reflexivity because I is in U, symmetry directly, and transitivity because the intersection of the f=g and g=h sets is contained in the f=h set. The product is a set and is nonempty by F3; its equivalence classes and their quotient form sets by Separation and Replacement.

F1F2F3
2.1

If each f_j is replaced by an equivalent g_j, intersect their finitely many equality sets to get E in U. On E, all function values and relation truth values agree. The function outputs are therefore equivalent by upward closure. For any two truth sets A,B agreeing on E, A in U implies AEB and hence B in U; the converse is symmetric. Thus relations are independent as well. Empty arity gives E=I. Constant-symbol functions are uniquely specified. For the diagonal map, equality of [c_a] and [c_b] is equivalent to I in U when a=b and empty in U when a differs from b, proving injectivity.

F1F2step 1.1

Depends on

Used by

Cited to discharge well-definedness by Set ultraproducts and constant-map ultrapowers.

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