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

The commutative-monoid enrichment of a category with finite biproducts is unique

Statement

Let a category with finite biproducts carry a commutative-monoid law on each hom-set for which composition is bilinear and the given finite biproducts are biproducts for that enrichment. Then this law is the one defined in A category with finite biproducts is enriched in commutative monoids. In particular, the commutative-monoid enrichment is unique.

Facts & Assumptions

Given: A category with finite biproducts and a second candidate bilinear commutative-monoid law ⊞ on its hom-sets.

[L1]

Finite biproducts define a canonical addition on every hom-set (A category with finite biproducts is enriched in commutative monoids).

Proof

technique · direct
1.1L1algebra

Fix f,g:A→B, and write ∇B:B⊕B→B for the codiagonal and i1,i2:B→B⊕B for the coproduct injections. Because composition is bilinear for ⊞, the morphism i1f⊞i2g:A→B⊕B satisfies p1(i1f⊞i2g)=f and p2(i1f⊞i2g)=g, where p1,p2 are the product projections and the off-diagonal terms vanish by the biproduct zero equations. Thus i1f⊞i2g=⟨f,g⟩ by the product universal property.

2.1L1step 1.1

Applying ∇B and using bilinearity again gives ∇B⟨f,g⟩=∇B(i1f⊞i2g)=∇Bi1f⊞∇Bi2g=f⊞g, since ∇Bi1=∇Bi2=1B. But the left-hand side is exactly the canonical sum f+g from [L1].

3.1step 2.1L1∎

Therefore f⊞g=f+g for every pair of parallel morphisms. So every bilinear commutative-monoid enrichment compatible with the same finite biproducts is forced to equal the canonical one.

Depends on

Used by

Dependency tree · two levels

4 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