Abelian categories

#category_theory/abelian_categories

Just as an additive category is a preadditive category with with two additional properties, an abelian category is an additive category with yet another two additional properties. Let's state the definition up front and then fill in the details:

Definition of an abelian category

An abelian category is an additive category satisfying the following conditions:

Every morphism has a kernel and a cokernel.
Every monomorphism is a kernel and every epimorphism is a cokernel.

We will define kernels and cokernels below, but for now we note the following facts:

The existence of kernels (and binary products) implies $A$ has all finite limits, while the existence of cokernels (and binary coproducts) implies the existence of all finite colimits.
The second condition is strong. It implies that any morphism $f$ that is both monomorphism and epimorphism is an isomorphism.

(We should probably prove these two facts at some point.)

Examples of abelian categories

The categories $Ab$ and $R -Mod$ (and many others) are abelian, with the usual kernels and cokernels.

If $A$ is an abelian category, then so is any functor category $A^{J}$ . See page 199 in Mac Lane for the short proof.

Examples of non-abelian additive categories

The category of even-dimensional vector spaces over a field $F$ is additive but not abelian, since linear transformations with odd rank do not have kernels in that category.

The category of finitely-generated modules over a non-Noetherian ring (such as $Q [x_{1}, x_{2}, \dots]$ ) is also additive but not abelian.

Kernels and Cokernels

At some point I will add the motivation for this general definition, but for now I will just slap down the definition:

Definition of kernel

Let $C$ be a category with a null object. A kernel of a morphism $f : a \to b$ is an equalizer of the morphisms $f, 0 : a \to b$ . In other words, it is a morphism $k : s \to a$ such that $f k = 0$ and every $h : c \to a$ with $f h = 0$ factors uniquely through $k$ :

Since $k : s \to a$ is an equalizer, the morphism $k$ is a monomorphism (i.e., left cancellable). It is thus common to think of the kernel $k : s \to a$ as a subobject of $a$ , although technically subobjects of $a$ are equivalence classes of monomorphisms.

Example in $Grp$

In $Grp$ , a kernel of a group morphism $ϕ : G \to H$ is the inclusion $k : \ker (ϕ) \to G$ , where $\ker (ϕ) = {g \in G ∣ ϕ (g) = e_{H}}$ is the usual kernel.

Example in $Ab$ -categories

In any preadditive category, all equalizers are kernels. This is because the hom-sets are abelian group, so for arrows $f, g : b \to c$ and $h : a \to b$ we have $f h = g h$ exactly when $(f - g) h = 0$ . The arrow $h$ can therefore be described either as an equalizer of $f$ and $g$ , or as a kernel of $f - g$ . This is why we usually deal with kernels (and not equalizers) in $R -Mod$ , $Ab$ , etc.

If we dualize the notion of kernel we obtain the notion of cokernel:

Definition of cokernel

Let $C$ be a category with a null object. A cokernel of a morphism $f : a \to b$ is a coequalizer of the morphisms $f, 0 : a \to b$ . In other words, it is a morphism $u : b \to e$ such that $u f = 0$ and every $h : b \to c$ with $h f = 0$ factors uniquely through $u$ :

Example in $Ab$

In $Ab$ , a cokernel of $f : A \to B$ is the projection $π : B \to B / im (f)$ .

Suggested next note

Chain complexes