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

A category with finite biproducts is enriched in commutative monoids

Statement

If a category has finite biproducts, then each hom-set carries a canonical commutative monoid structure for which composition is bilinear.

Facts & Assumptions

Given: A category C with finite biproducts and objects A,B,C.

[L1]

Biproducts can be recognized from products, coproducts, and the zero equations without using any pre-existing addition (Biproduct data characterisation without addition).

[L2]

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

[L3]

Finite biproducts are associative, commutative, and unital up to canonical isomorphism (Biproducts are associative, commutative, and unital up to canonical isomorphism).

Proof

technique · direct
1.1L1L2construct

Let ∇B:B⊕B→B be the copairing [1B,1B], and for f,g:A→B define f+g:=∇B⟨f,g⟩. Let 0A,B be the zero morphism through the zero object supplied by [L2]. These constructions are available because B⊕B is simultaneously a product and a coproduct by [L1].

2.1L2L3step 1.1

Commutativity follows from the symmetry isomorphism τ:B⊕B→B⊕B in [L3]: one has τ⟨f,g⟩=⟨g,f⟩ and ∇Bτ=∇B, so f+g=∇B⟨f,g⟩=∇B⟨g,f⟩=g+f. The unit law follows from the canonical identifications B⊕0≅B≅0⊕B in [L3], which turn ⟨f,0A,B⟩ and ⟨0A,B,f⟩ into the evident copies of f.

2.2L3step 1.1

Under the canonical associativity isomorphism of [L3], both (f+g)+h and f+(g+h) are the composite of the triple pairing ⟨f,g,h⟩:A→B⊕B⊕B with the triple codiagonal [1B,1B,1B]:B⊕B⊕B→B. Hence the addition is associative.

2.3L1step 1.1algebra

If k:B→C, then k(f+g)=k∇B⟨f,g⟩=∇C⟨kf,kg⟩=kf+kg, because postcomposing a coproduct copairing with k gives the copairing of the postcomposites. Dually, (f+g)h=fh+gh for every h:X→A, because precomposing a product pairing with h gives the pairing of the precomposites. Thus composition is bilinear.

3.1step 2.1step 2.2step 2.3∎

Steps 2.1, 2.2, and 2.3 show that each hom-set is a commutative monoid with bilinear composition. So the category is enriched in commutative monoids.

Depends on

Used by

Dependency tree · two levels

7 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