A semi-additive category is a category whose hom-sets are commutative monoids and whose composition is additive in each variable, with finite products and coproducts.
Suppose first that is a binary product in a category, with projections . The zero morphisms and the product property define mapsbyThe two projections of equal those of , soFor and , the mapsatisfies and . If has the same restrictions, thenThus is also the binary coproduct. The dual argument starts from a coproduct and makes it a product. Hence binary products and coproducts coincide canonically as biproducts.
Let be a reflexive pair in an additive category, with . For every object , regard as an arrow from to between objects of . The identity at is .
If , define the composite byIts source and target areThe identities follow fromand associativity follows immediately by expanding both iterated composites and using the matching equations. The inverse of iswhose source is , whose target is , and whose two composites with are the appropriate identity arrows. These formulas are natural in , so the Yoneda lemma identifies them with structure morphisms in . The pair is therefore an internal groupoid, proving that every reflexive pair in an additive category is an internal groupoid.
This fails for semi-additive categories. In the category of commutative monoids, letunder coordinatewise addition. The two projections have the common splitting , so they form a reflexive pair. Its underlying reflexive graph is the usual order category on : there is an arrow exactly when . If it were an internal groupoid, the arrow would have an inverse , but . Therefore this reflexive pair is not an internal groupoid, and “additive” cannot be weakened to “semi-additive.”
Articles by others on the same topic
There are currently no matching articles.