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 with finite biproducts and objects .
Biproducts can be recognized from products, coproducts, and the zero equations without using any pre-existing addition (Biproduct data characterisation without addition).
The empty biproduct is a zero object (The empty biproduct is a zero object).
Finite biproducts are associative, commutative, and unital up to canonical isomorphism (Biproducts are associative, commutative, and unital up to canonical isomorphism).
Proof
Let be the copairing , and for define . Let be the zero morphism through the zero object supplied by [L2]. These constructions are available because is simultaneously a product and a coproduct by [L1].
Commutativity follows from the symmetry isomorphism in [L3]: one has and , so . The unit law follows from the canonical identifications in [L3], which turn and into the evident copies of .
Under the canonical associativity isomorphism of [L3], both and are the composite of the triple pairing with the triple codiagonal . Hence the addition is associative.
If , then , because postcomposing a coproduct copairing with gives the copairing of the postcomposites. Dually, for every , because precomposing a product pairing with gives the pairing of the precomposites. Thus composition is bilinear.
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
- Saunders Mac Lane, Categories for the Working Mathematician, VIII.2, Proposition 3 and Exercise 2.4(a) (standard reference, not scraped)
- Merlin Christ, Tobias Dyckerhoff, and Tashi Walde, Lax Additivity, Section 2 (standard reference, not scraped)