Uniqueness of preadditive structures
Claim
Let C be a preadditive category (or more generally, a category enriched in commutative monoids) with finite products and finite coproducts. 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
The morphism α:X⊕Y→X×Y is defined by the equations
p1∘α∘i1=idX,p2∘α∘i2=idY
p2∘α∘i1=0,p1∘α∘i2=0.
It does not depend on the choice of preadditive structure since zero morphisms are unique. It is an isomorphism: Define
β:=i1∘p1+i2∘p2:X×Y→X⊕Y.
Then α∘β=idX×Y because
p1∘α∘β=p1∘α∘i1∘p1+p1∘α∘i2∘p2=id1∘p1+0∘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
∇∘β∘(f,g)=∇∘(i1∘p1+i2∘p2)∘(f,g)=∇∘i1∘p1∘(f,g)+∇∘i2∘p2∘(f,g)=p1∘(f,g)+p2∘(f,g)=f+g. Usage
This lemma is referenced in the following categories: