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.

Infinitary Los theorem

Statement

In ZFC let kappa be regular uncountable and U a kappa-complete proper ultrafilter on I. For nonempty set structures M_i in a fixed finite-arity signature, their set ultraproduct satisfies Łoś's equivalence for every Lκ,κ formula, with parameter tuples of any length less than kappa. In particular the truth value is independent of representatives.

Facts & Assumptions

Given: ZFC. Extended formula induction by kappa-complete Boolean operations and proved both block-quantifier directions using AC only on sets, including representative invariance for long parameter tuples.

[F1]

Infinitary syntax and compactness conventions: Infinitary truth is well-founded recursion on set syntax trees, with set tuple quantifiers.

[F2]

Los theorem for set ultraproducts: Atomic and finite Boolean Łoś clauses hold in the set quotient.

[F3]

Complete ultrafilters and measurable cardinals: Kappa-completeness closes intersections indexed by ordinals below kappa.

[F4]

The Axiom of Choice: AC selects coordinate witness tuples, default elements and representatives for a witnessing tuple of quotient elements.

Proof

1.1

Induct on the well-founded syntax tree in F1. The atomic cases are F2, and negation uses the ultrafilter decision between a set and its complement. For fewer than kappa component truth sets A_xi, their intersection belongs to U if all A_xi do, by F3; the converse follows by upward closure. Their union belongs to U if some A_xi does; if none does, F3 puts the intersection of their complements in U, excluding the union. These are precisely the conjunction and disjunction clauses, including empty operations.

F1F2F3
2.1

Consider an existential block of eta<kappa variables. If its coordinate truth set A belongs to U, then for each i in A the witnessing tuples form a nonempty subset of the set Miη. By F4 choose one tuple at each such coordinate, and choose a default element of M_i outside A. Extend with the constant default tuple there. Each of the eta columns is a product representative; their matrix truth set contains A. The induction hypothesis gives a true matrix in the quotient, hence a quotient witness tuple. Conversely a witnessing quotient tuple has eta entries; F4 chooses product representatives for these entries from their nonempty set equivalence classes. The matrix induction hypothesis gives a U-large coordinate matrix truth set, contained in the coordinate existential set. Thus the latter is U-large. Eta=0 reduces exactly to the matrix, with the unique empty tuple. Universal blocks follow by negating an existential block of the negated matrix.

F1F3F4step 1.1
3.1

Finally replace any tuple of fewer than kappa parameter representatives by equivalent ones. Intersect their coordinate equality sets using F3. On this U-large intersection all parameter values agree, so set satisfaction of the fixed formula has the same truth value for both tuples. Intersecting a U-large truth set with this agreement set and using upward closure proves that either truth set belongs to U exactly when the other does. The induction already proved quotient truth equivalent to coordinate truth-set membership, so this also verifies the asserted representative invariance for infinitary parameters.

F1F3step 2.1

Depends on

Used by

Dependency tree · two levels

12 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