Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-08-06 (claude-opus-5)
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 ordered triple (a,b,c):=((a,b),c) and the iterated products A×B×C:=(A×B)×C

Definition

For sets a, b, c the ordered triple is

(a,b,c):=((a,b),c),

an ordered pair (The Kuratowski ordered pair (a,b):={{a},{a,b}}) whose first coordinate is itself an ordered pair, and for sets A, B, C the iterated product is

A×B×C:=(A×B)×C,

a Cartesian product (The Cartesian product A×B:={ z∈P(P(A∪B)):∃a∈A ∃b∈B z=(a,b) }) of the same shape. Both conventions associate to the left, and the elements of A×B×C are exactly the triples (a,b,c) with a∈A, b∈B and c∈C.

Applying (a,b)=(c,d) if and only if a=c and b=d twice gives the characterising property of triples: (a,b,c)=(a′,b′,c′) holds if and only if a=a′, b=b′ and c=c′.

Remarks

  • The bracketing convention is not a formality. (A×B)×C and A×(B×C) are in general different sets, so a convention has to be fixed and adhered to; the left-associated one is fixed here.

  • No n-tuples. A general n-tuple is a function on a natural number, and the natural numbers are not available at this point in the reading order, so only triples and finitely iterated binary products are introduced here. The general construction is the product of an indexed family, once functions and index sets are available.

Depends on

Used by

Dependency tree · two levels

10 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