Additive category

Template:Short description Template:For In mathematics, specifically in category theory, an additive category is a preadditive category C admitting all finitary biproducts.

Definition

There are two equivalent definitions of an additive category: One as a category equipped with additional structure, and another as a category equipped with no extra structure but whose objects and morphisms satisfy certain equations.

Via preadditive categories

A category C is preadditive if all its hom-sets are abelian groups and composition of morphisms is bilinear; in other words, C is enriched over the monoidal category of abelian groups.

In a preadditive category, every finitary product is necessarily a coproduct, and hence a biproduct, and conversely every finitary coproduct is necessarily a product (this is a consequence of the definition, not a part of it). The empty product, is a final object and the empty product in the case of an empty diagram, an initial object. Both being limits, they are not finite products nor coproducts.

Thus an additive category is equivalently described as a preadditive category admitting all finitary products and with the null object or a preadditive category admitting all finitary coproducts and with the null object

Via semiadditive categories

We give an alternative definition.

Define a semiadditive category to be a category (note: not a preadditive category) which admits a zero object and all binary biproducts. It is then a remarkable theorem that the Hom sets naturally admit an abelian monoid structure. A proof of this fact is given below.

An additive category may then be defined as a semiadditive category in which every morphism has an additive inverse. This then gives the Hom sets an abelian group structure instead of merely an abelian monoid structure.

Generalization

More generally, one also considers additive [[Preadditive category#R-linear categories|Template:Mvar-linear categories]] for a commutative ring Template:Mvar. These are categories enriched over the monoidal category of Template:Mvar-modules and admitting all finitary biproducts.

Examples

The original example of an additive category is the category of abelian groups Ab. The zero object is the trivial group, the addition of morphisms is given pointwise, and biproducts are given by direct sums.

More generally, every module category over a ring Template:Mvar is additive, and so in particular, the category of vector spaces over a field Template:Mvar is additive.

The algebra of matrices over a ring, thought of as a category as described below, is also additive.

Internal characterisation of the addition law

Let C be a semiadditive category, so a category having all finitary biproducts. Then every hom-set has an addition, endowing it with the structure of an abelian monoid, and such that the composition of morphisms is bilinear.

Moreover, if C is additive, then the two additions on hom-sets must agree. In particular, a semiadditive category is additive if and only if every morphism has an additive inverse.

This shows that the addition law for an additive category is internal to that category.<ref>Template:Citation Sections 18 and 19 deal with the addition law in semiadditive categories.</ref>

To define the addition law, we will use the convention that for a biproduct, p_k will denote the projection morphisms, and i_k will denote the injection morphisms.

The diagonal morphism is the canonical morphism Template:Math, induced by the universal property of products, such that Template:Math for Template:Math. Dually, the codiagonal morphism is the canonical morphism Template:Math, induced by the universal property of coproducts, such that Template:Math for Template:Math.

For each object Template:Mvar, we define:

• the addition of the injections Template:Math to be the diagonal morphism, that is Template:Math;
• the addition of the projections Template:Math to be the codiagonal morphism, that is Template:Math.

Next, given two morphisms Template:Math, there exists a unique morphism Template:Math such that Template:Math equals Template:Math if Template:Math, and 0 otherwise.

We can therefore define Template:Math.

This addition is both commutative and associative. The associativity can be seen by considering the composition

<math>A\ \xrightarrow{\quad\Delta\quad}\ A \oplus A \oplus A\ \xrightarrow{\alpha_1\,\oplus\,\alpha_2\,\oplus\,\alpha_3}\ B \oplus B \oplus B\ \xrightarrow{\quad\nabla\quad}\ B</math>

We have Template:Math, using that Template:Math.

It is also bilinear, using for example that Template:Math and that Template:Math.

We remark that for a biproduct Template:Math we have Template:Math. Using this, we can represent any morphism Template:Math as a matrix.

Matrix representation of morphisms

Given objects Template:Math and Template:Math in an additive category, we can represent morphisms Template:Math as Template:Mvar-by-Template:Mvar matrices

<math>\begin{pmatrix} f_{11} & f_{12} & \cdots & f_{1n} \\

f_{21} & f_{22} & \cdots & f_{2n} \\ \vdots & \vdots & \cdots & \vdots \\ f_{m1} & f_{m2} & \cdots & f_{mn} \end{pmatrix} </math> where <math>f_{kl} := p_k \circ f \circ i_l\colon A_l \to B_k.</math>

Using that Template:Math, it follows that addition and composition of matrices obey the usual rules for matrix addition and multiplication.

Thus additive categories can be seen as the most general context in which the algebra of matrices makes sense.

Recall that the morphisms from a single object Template:Mvar to itself form the endomorphism ring Template:Math. If we denote the Template:Mvar-fold product of Template:Mvar with itself by Template:Math, then morphisms from Template:Math to Template:Math are m-by-n matrices with entries from the ring Template:Math.

Conversely, given any ring Template:Mvar, we can form a category Template:Math by taking objects A_n indexed by the set of natural numbers (including 0) and letting the hom-set of morphisms from Template:Math to Template:Math be the set of Template:Mvar-by-Template:Mvar matrices over Template:Mvar, and where composition is given by matrix multiplication.<ref>H.D. Macedo, J.N. Oliveira, Typing linear algebra: A biproduct-oriented approach, Science of Computer Programming, Volume 78, Issue 11, 1 November 2013, Pages 2160-2191, Template:Issn, {{#invoke:doi|main}}.</ref> Then Template:Math is an additive category, and Template:Math equals the Template:Mvar-fold power Template:Math.

This construction should be compared with the result that a ring is a preadditive category with just one object, shown here.

If we interpret the object Template:Math as the left module Template:Math, then this matrix category becomes a subcategory of the category of left modules over Template:Mvar.

This may be confusing in the special case where Template:Mvar or Template:Mvar is zero, because we usually don't think of matrices with 0 rows or 0 columns. This concept makes sense, however: such matrices have no entries and so are completely determined by their size. While these matrices are rather degenerate, they do need to be included to get an additive category, since an additive category must have a zero object.

Thinking about such matrices can be useful in one way, though: they highlight the fact that given any objects Template:Mvar and Template:Mvar in an additive category, there is exactly one morphism from Template:Mvar to 0 (just as there is exactly one 0-by-1 matrix with entries in Template:Math) and exactly one morphism from 0 to Template:Mvar (just as there is exactly one 1-by-0 matrix with entries in Template:Math) – this is just what it means to say that 0 is a zero object. Furthermore, the zero morphism from Template:Mvar to Template:Mvar is the composition of these morphisms, as can be calculated by multiplying the degenerate matrices.

Additive functors

A functor Template:Math between preadditive categories is additive if it is an abelian group homomorphism on each hom-set in C. If the categories are additive, then a functor is additive if and only if it preserves all biproduct diagrams.

That is, if Template:Mvar is a biproduct of Template:Math in C with projection morphisms Template:Math and injection morphisms Template:Math, then Template:Math should be a biproduct of Template:Math in D with projection morphisms Template:Math and injection morphisms Template:Math.

Almost all functors studied between additive categories are additive. In fact, it is a theorem that all adjoint functors between additive categories must be additive functors (see here). Most of the interesting functors studied in category theory are adjoints.

Generalization

When considering functors between Template:Mvar-linear additive categories, one usually restricts to Template:Mvar-linear functors, so those functors giving an Template:Mvar-module homomorphism on each hom-set.

Special cases

• A pre-abelian category is an additive category in which every morphism has a kernel and a cokernel.
• An abelian category is a pre-abelian category such that every monomorphism and epimorphism is normal.

Many commonly studied additive categories are in fact abelian categories; for example, Ab is an abelian category. The free abelian groups provide an example of a category that is additive but not abelian.<ref>Template:Citation.</ref>

References

• Nicolae Popescu; 1973; Abelian Categories with Applications to Rings and Modules; Academic Press, Inc. (out of print) goes over all of this very slowly