As we noted, an -category is sometimes also called a preadditive category, suggesting that there is something called an additive category. Indeed:
Definition of an additive category
An additive category is an -category which has a null object and a biproduct for each pair of objects.
But what is a null object and what are biproducts?
Null objects
Recall that in a fixed category , a object is initial if for every object there exists a unique morphism . Dually, an object is terminal if for every object there exists a unique morphism . An object that is both initial and terminal is called a null object (or a zero object).
As usual, there are various equivalent interpretations of these properties:
In terms of universal properties, if we let be the functor that assigns to every object the singleton set , and to every morphism the identity set map , then an initial object is characterized by a natural bijection
while a terminal object is characterized by a natural bijection
In terms of limits and colimits, an initial object of is a limit of the empty diagram in , while a terminal object is a colimit of the empty diagram in .
In terms of adjoints, we have the following:
If is the unique functor to the category with one object, then a left adjoint is the functor that selects the initial object of (assuming it exists), while a right adjoint is the functor that selects the terminal object of (assuming it exists).
In any case, when they exist, initial and terminal objects are unique up to unique isomorphism. The same goes for null objects.
Examples
In , the empty set is an initial object and any singleton set is a terminal object. For each set , the unique set map is the empty map, while the unique set map is the map . There is no null object.
In , the trivial group is a null object. For each abelian group , the unique group morphism is the map , while the unique group morphism is the trivial map .
In , the trivial group is a null object. For each group , the unique group morphism is the map , while the unique group morphism is the trivial map .
In , the ring of integers is an initial object. For each ring (with unity), the unique ring morphism is determined entirely by . If we allow rings with , then the zero ring is a terminal object. (There are no ring morphisms from the zero ring to any other ring!)
In , there is neither an initial nor a terminal object. In the category of fields of characteristic , the field of rational numbers is an initial object (but there is no terminal object). In the category of fields of fixed characteristic , the field is initial (but there is no terminal object).
In , the empty category is initial and the category is terminal.
A limit of a diagram is a terminal object in the category of cones to . A colimit of is an initial object in the category of cones from .
Zero morphisms
If a category has a null object , then for every pair of objects and in there is a unique morphism that factors through the unique morphisms to and from :
This morphism is called the zero morphism between and and is denoted . Any composite with a zero morphism is another zero morphism.
In , the zero morphism between two abelian groups is the trivial map . More generally, when is an additive category the zero morphism is the additive identity of the abelian group . In , the zero morphism between two groups is the trivial map .
One can show (are you the one?) that in an additive category, each zero morphism is (as hoped!) the additive identity of the abelian group .
Biproducts
Our main example categories, namely and , have additional properties beyond the group structure on the hom-sets. One of those properties is that products and coproducts always exist for every pair of objects, and they're always isomorphic. In other words, the product functor and coproduct functor are naturally isomorphic. Because of this, there is usually some confusion as to which type of product to use, and you often see textbooks using coproduct (usually called the direct sum and denoted ) as if it's a product; e.g., by referring to projection maps and .
This situation can happen more generally in any -category. We first introduce a new type of product:
Biproducts
In an -category , a biproduct diagram for a pair of objects is a diagram
with arrows that satisfy the identities
Note that this definition is entirely "internal" in that it refers only to morphisms between the objects and , as opposed to the usual product or coproduct , which are defined as limits and colimits and hence involve morphisms to and from every object in the category.
In other words, to verify you have a biproduct diagram, you just need to directly verify the three identity relations above. On the other hand, to verify is a product you need to verify it satisfies the appropriate universal property, which involves comparing (with its projections) to every other object (that also has projections to and ).
Fortunately, we have the following result:
Products, coproducts, and biproducts
Two objects and in an -category have a product in if and only if they have a biproduct in . In the biproduct diagram above, the object with the morphisms and is a product of and , while the object with the morphisms and is a coproduct of and .
In particular, two objects and have a product in exactly when they have a coproduct in .
In the categories and , the biproduct is usually called the direct sum of the given objects. Because of this, if the biproduct diagram exists for all in a given -category, , the object is usually written . This defines a functor , with defined for morphisms and either by the equations
(i.e., as defined for the product functor ), or by the equations
(i.e., as defined for the coproduct functor ). By the properties of the biproduct diagram, either choice implies the other.
In other words, the identification of the product functor with the coproduct functor is a natural isomorphism.
Generalizing biproducts
We can iterate this process. Given we can form a product characterized (up to isomorphism) by the diagram
and the equations
where if and .
Moreover, for given objects with and there is an isomorphism of abelian groups
This implies that each morphism is determined by the matrix of its components. Composition of morphisms is then given by the usual matrix product of the matrices of components.