Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27
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.

Biproducts are associative, commutative, and unital up to canonical isomorphism

Statement

Whenever the displayed biproducts exist, there are canonical isomorphisms

A⊕(B⊕C)≅(A⊕B)⊕C,A⊕B≅B⊕A,A⊕0≅A≅0⊕A,

where 0 denotes the empty biproduct.

Facts & Assumptions

Given: Objects A,B,C in a category with the indicated finite biproducts.

[L1]

A biproduct is in particular a product and a coproduct (Biproduct).

[L2]

The empty biproduct is a zero object (The empty biproduct is a zero object).

Proof

technique · direct
1.1L1L3

By [L1], both A⊕(B⊕C) and (A⊕B)⊕C are products of the ordered triple (A,B,C). Let α:A⊕(B⊕C)→(A⊕B)⊕C be the unique morphism whose three composites with the target projections are the three source projections, and define β in the reverse direction the same way. Then βα and 1A⊕(B⊕C) have the same three composites with the source projections, while αβ and 1(A⊕B)⊕C have the same three composites with the target projections. By the product universal property in [L3], α and β are inverse isomorphisms. This is the canonical associativity isomorphism.

1.2L1L3

Likewise, A⊕B and B⊕A are products of the same ordered pair after swapping the labels. The unique maps exchanging the two projections are inverse by the same product-uniqueness argument, giving the canonical symmetry isomorphism A⊕B≅B⊕A.

1.3L1L2L3

By [L2], the object 0 is both initial and terminal. Let pA:A⊕0→A and p0:A⊕0→0 be the product projections from [L1], and let λ:A→A⊕0 be the unique map with pAλ=1A and p0λ equal to the unique map A→0. Then pA and λ are inverse, because pAλ=1A and λpA has the same composites with pA and p0 as 1A⊕0. So A⊕0≅A. The same argument with the product projections of 0⊕A gives 0⊕A≅A.

2.1step 1.1step 1.2step 1.3∎

The three displayed isomorphisms are therefore forced by the universal properties alone, which is exactly the asserted associativity, commutativity, and unitality up to canonical isomorphism.

Depends on

Dependency tree · 2 levels

Sources