Let C be a preadditive category (or more generally, a category enriched in commutative monoids) with finite products. Then finite coproducts exist as well.
Proof. The terminal object 1 is also an initial object, because for all objects A there is the zero morphism ,01,A:1→A, and it is uniquely determined because any morphism f:1→A satisfies
f=f∘id1=f∘01,1=01,A.
It remains to construct binary coproducts. Actually, their underlying objects coincide with binary products. Let A,B be objects. We define the morphism i1:A→A×B by p1∘i1=idA and .p2∘i1=0A,B. Similarly, we define the morphism i2:B→A×B by p1∘i2=0B,A and .p2∘i2=idB. We claim that
Ai1A×Bi2B
is a binary coproduct. First, notice that
i1∘p1+i2∘p2=idA×B
holds in .End(A×B). In fact, if we compose the left-hand side with ,p1, we get
p1∘i1∘p1+p1∘i2∘p2=idA∘p1+0B,A∘p2=p1,
and a similar calculation works for .p2. Now let f:A→T and g:B→T be morphisms. We want to show that there exists a unique h:A×B→T with h∘i1=f and .h∘i2=g. To show uniqueness, notice that
h=h∘(i1∘p1+i2∘p2)=f∘p1+g∘p2.
Conversely, if we define h:A×B→T via ,h:=f∘p1+g∘p2, then
h∘i1=f∘p1∘i1+g∘p2∘i1=f∘idA+g∘0A,B=f,
and similarly .h∘i2=g.□
Lemma 2.
Let C be a preadditive category (or more generally, a category enriched in commutative monoids) with finite products, hence with finite coproducts by Lemma 1. Then for all objects X,Y the canonical morphism α:X⊕Y→X×Y is an isomorphism. Moreover, the preadditive structure is unique: If f,g:A⇉B are morphisms, their sum
f+g:A→B
is the composite of ,(f,g):A→B×B, the inverse ,α−1:B×B→B⊕B, and the codiagonal .∇:B⊕B→B.
Proof. In any category with zero morphisms, the morphism α:X⊕Y→X×Y is defined by the equations
p1∘α∘i1=idX,p2∘α∘i2=idY,p2∘α∘i1=0X,Y,p1∘α∘i2=0Y,X.
It does not depend on the choice of preadditive structure since zero morphisms are unique. We now check that it is an isomorphism. (This is already contained in the proof of Lemma 1, since there we have constructed binary coproducts in such a way that α is even the identity, but we repeat the proof here, since we need the inverse morphism anyway.) Define
β:=i1∘p1+i2∘p2:X×Y→X⊕Y.
Then α∘β=idX×Y because
p1∘α∘β=p1∘α∘i1∘p1+p1∘α∘i2∘p2=idX∘p1+0Y,X∘p2=p1
and likewise .p2∘α∘β=p2. We also have β∘α=idX⊕Y with a very similar calculation that shows β∘α∘i1=i1 and .β∘α∘i2=i2. Therefore, for morphisms f,g:A⇉B the composite A→B in the claim is equal to