nLab abelian category

Context

Enriched category theory

Additive and abelian categories

Homological algebra

homological algebra

(also nonabelian homological algebra)

Introduction

Context

Basic definitions

Stable homotopy theory notions

Constructions

Lemmas

diagram chasing

Schanuel's lemma

Homology theories

Theorems

\tableofcontents

Idea

The notion of abelian category is an abstraction of basic properties of the category Ab of abelian groups, more generally of the category RRMod of modules over some ring, and still more generally of categories of sheaves of abelian groups and of modules. It is such that much of the homological algebra of chain complexes can be developed inside every abelian category.

The concept of abelian categories is one in a sequence of notions of additive and abelian categories.

While additive categories differ significantly from toposes, there is an intimate relation between abelian categories and toposes. See AT category for more on that.

Definition

Recall the following fact about pre-abelian categories from this proposition, discussed there:

Proposition

Every morphism f:A→Bf \colon A\to B in a pre-abelian category has a canonical de-composition

(1)A↠pcoker(kerf)→f¯ker(cokerf)↪iB A \overset{\; p \;}{\twoheadrightarrow} \coker\big(\ker f\big) \xrightarrow{\; \overline{f} \;} \ker\big(\coker f\big) \xhookrightarrow{\; i \;} B

where:

Definition

An abelian category is a pre-abelian category satisfying the following equivalent conditions.

  1. For every morphism ff, the canonical morphism f¯:coker(ker(f))→ker(coker(f))\bar{f} \colon coker(ker(f)) \to ker(coker(f)) (1) from prop. 1 is an isomorphism (hence providing an image factorization A↠im(f)↪BA \twoheadrightarrow im(f) \hookrightarrow B).

  2. Every monomorphism is a kernel and every epimorphism is a cokernel.

Proposition

These two conditions are indeed equivalent.

Proof

The first condition implies that if ff is a monomorphism then f≅ker(coker(f))f \cong \ker(\coker(f)) (in the category of objects over BB) so ff is a kernel. Dually if ff is an epimorphism it follows that f≅coker(ker(f))f \cong coker(ker(f)). So (1) implies (2).

The converse can be found in, among other places, Chapter VIII of (MacLane).

Properties

General

Remark

The notion of abelian category is self-dual: opposite of any abelian category is abelian.

Remark

By the second formulation of the definition 1, in an abelian category

It follows that every abelian category is a balanced category.

\begin{prop}\label{PullbackPreservesEpimorphisms} In an abelian category, pullback preserves epimorphisms and pushout preserves monomorphisms. \end{prop} Because every abelian category is a regular category. For an explicit proof see, e.g., Selick, Prop. 1.3.13.

Factorization of morphisms

Proposition

In an abelian category every morphism decomposes uniquely up to a unique isomorphism into the composition of an epimorphism and a monomorphism, via prop 1 combined with def. 1.

Since by remark 2 every monic is regular, hence strong, it follows that (epi,mono)(epi, mono) is an orthogonal factorization system in an abelian category; see at (epi, mono) factorization system.

Remark

Some references claim that this property characterizes abelian categories among pre-abelian ones, but it is not clear to the authors of this page why this should be so, although we do not currently have a counterexample; see this discussion.

Canonical AbAb-enrichment

The Ab-enrichment of an abelian category need not be specified a priori, this is Prop. \ref{UniquenessOfAbEnrichment} below.

However, in most examples, the AbAb-enrichment is evident from the start and does not need to be constructed in this way. A similar statement is true for additive categories, although the most natural result in that case gives only enrichment over commutative monoids., cf. at semiadditive category.

The last point is of relevance in particular for higher categorical generalizations of additive categories. See for instance remark 2.14, p. 5 of Jacob Lurie’s Stable Infinity-Categories.

\begin{proposition} \label{UniquenessOfAbEnrichment} If a (not necessarily pre-additive) category CC has

  1. a zero object,

  2. binary products or binary coproducts,

  3. all kernels and cokernels,

  4. the property that every monomorphism is a kernel and every epimorphism is a cokernel

    (so that all monos and epis are normal),

then there is a unique Ab-enrichment of CC and with it CC is abelian.

\end{proposition} (cf. Freyd & Scedrov 1990 §1.598, and Lean formalization in Mathlib.CategoryTheory.Abelian.NonPreadditive) \begin{proof} We give a streamlined version of the argument in Freyd & Scedrov 1990 §1.597-§1.598, which proceeds via the notion of exact categories (where the analog of Step 3 (iii) is immediate). The construction of the subtraction morphism σ B\sigma_B (Step 4) and of the addition from it (Step 6) is that of loc. cit. §1.597 (beware of misprints in the proof on p. 93 there: “x:C→Cok(θ)x \colon C \to \mathrm{Cok}(\theta)” should be “z:⋯z \colon \cdots”, “yy is monic” should be “yy is epic”, and “forces yy to be an isomorphism” should be “forces θ\theta to be an isomorphism”).

We write 00 also for the zero morphisms A→0→BA \to 0 \to B; these form a two-sided ideal under composition. For binary products we write p 1,p 2p_1, p_2 for the projections, ⟨f,g⟩\langle f, g \rangle for the pairing of morphisms, Δ B≔⟨id B,id B⟩:B→B×B\Delta_B \coloneqq \langle \mathrm{id}_B, \mathrm{id}_B \rangle \colon B \to B \times B for the diagonal morphism, and

ι 1≔⟨id A,0⟩:A⟶A×B,ι 2≔⟨0,id B⟩:B⟶A×B. \iota_1 \coloneqq \langle \mathrm{id}_A, 0 \rangle \colon A \longrightarrow A \times B \,, \;\;\;\;\;\; \iota_2 \coloneqq \langle 0, \mathrm{id}_B \rangle \colon B \longrightarrow A \times B \,.

Step 0 (reduction to binary products). All hypotheses except the second are invariant under passage to the opposite category, while the second turns binary products into binary coproducts and vice versa. The conclusion is invariant as well: AbAb-enrichments of CC are the same as those of C opC^{op}, and CC is abelian iff C opC^{op} is (see below). Hence it suffices to consider the case that CC has binary products, which we assume from now on.

Step 1 (normal monos and epis).

(i) If mm is the kernel of some morphism gg, then mm is the kernel of its own cokernel c≔coker(m)c \coloneqq \mathrm{coker}(m): Since g∘m=0g \circ m = 0, we have g=g′∘cg = g' \circ c for some g′g', so that c∘z=0c \circ z = 0 implies g∘z=0g \circ z = 0, whence zz factors uniquely through mm. Dually, every epimorphism, being a cokernel by assumption, is the cokernel of its kernel.

(ii) Every split monomorphism is a monomorphism, hence by assumption a kernel, hence by (i) the kernel of its cokernel. Dually for split epimorphisms. This applies in particular to Δ B\Delta_B and ι 1\iota_1 (split by p 1p_1), to ι 2\iota_2 (split by p 2p_2), and to p 1p_1, p 2p_2 (split by ι 1\iota_1, ι 2\iota_2, respectively).

Step 2. The morphism ι 1:A→A×B\iota_1 \colon A \to A \times B is a kernel of p 2p_2, and p 2p_2 is a cokernel of ι 1\iota_1: First, p 2∘ι 1=0p_2 \circ \iota_1 = 0, and if p 2∘z=0p_2 \circ z = 0 then z=⟨p 1∘z,0⟩=ι 1∘p 1∘zz = \langle p_1 \circ z, 0 \rangle = \iota_1 \circ p_1 \circ z, uniquely so since ι 1\iota_1 is mono. Hence ι 1=ker(p 2)\iota_1 = \mathrm{ker}(p_2), and so p 2=coker(ι 1)p_2 = \mathrm{coker}(\iota_1) by Step 1. Symmetrically, ι 2=ker(p 1)\iota_2 = \mathrm{ker}(p_1) and p 1=coker(ι 2)p_1 = \mathrm{coker}(\iota_2).

Step 3 (equalizers, and a criterion for isomorphisms).

(i) CC has equalizers: For f,g:A→Bf, g \colon A \to B let e≔ker(coker(Δ B)∘⟨f,g⟩)e \coloneqq \mathrm{ker}\big( \mathrm{coker}(\Delta_B) \circ \langle f, g \rangle \big). Since Δ B=ker(coker(Δ B))\Delta_B = \mathrm{ker}\big(\mathrm{coker}(\Delta_B)\big) by Step 1, a morphism zz into AA factors (necessarily uniquely) through ee iff ⟨f∘z,g∘z⟩\langle f \circ z, g \circ z \rangle factors through Δ B\Delta_B, hence iff f∘z=g∘zf \circ z = g \circ z. So ee is an equalizer of ff and gg.

(ii) If f:A→Bf \colon A \to B has vanishing kernel, in that f∘z=0f \circ z = 0 implies z=0z = 0, then ff is a monomorphism: Let k:P→A×Ak \colon P \to A \times A be the equalizer of f∘p 1f \circ p_1 and f∘p 2f \circ p_2 (the kernel pair of ff), and write q i≔p i∘kq_i \coloneqq p_i \circ k. Since f∘p 1∘Δ A=f∘p 2∘Δ Af \circ p_1 \circ \Delta_A = f \circ p_2 \circ \Delta_A, there is s:A→Ps \colon A \to P with k∘s=Δ Ak \circ s = \Delta_A, hence with q 1∘s=id A=q 2∘sq_1 \circ s = \mathrm{id}_A = q_2 \circ s. Now if q 1∘z=0q_1 \circ z = 0, then f∘q 2∘z=f∘q 1∘z=0f \circ q_2 \circ z = f \circ q_1 \circ z = 0, hence q 2∘z=0q_2 \circ z = 0, hence k∘z=⟨q 1∘z,q 2∘z⟩=0k \circ z = \langle q_1 \circ z, q_2 \circ z \rangle = 0, hence z=0z = 0, since kk is mono. Thus the kernel of the split epimorphism q 1q_1 is 0→P0 \to P, so that, by Step 1, q 1q_1 is a cokernel of 0→P0 \to P, hence an isomorphism, with inverse ss. Therefore q 2=q 2∘s∘q 1=q 1q_2 = q_2 \circ s \circ q_1 = q_1. Finally, if f∘x=f∘yf \circ x = f \circ y then ⟨x,y⟩=k∘u\langle x, y \rangle = k \circ u for some uu, and so x=q 1∘u=q 2∘u=yx = q_1 \circ u = q_2 \circ u = y.

(iii) If f:A→Bf \colon A \to B has vanishing kernel and vanishing cokernel (in that also t∘f=0t \circ f = 0 implies t=0t = 0), then ff is an isomorphism: By (ii), ff is mono, hence by Step 1 a kernel of coker(f)\mathrm{coker}(f). But coker(f)=0\mathrm{coker}(f) = 0, and the kernel of a zero morphism out of BB is id B\mathrm{id}_B. Since kernels are unique up to unique isomorphism, ff is an isomorphism.

Step 4 (the subtraction morphism). For any object BB, let q:B×B→Qq \colon B \times B \to Q be a cokernel of Δ B\Delta_B, and consider

r≔q∘ι 1:B⟶Q. r \coloneqq q \circ \iota_1 \;\colon\; B \longrightarrow Q \,.

By Step 3 (iii), rr is an isomorphism, and we set

σ B≔r −1∘q:B×B⟶B. \sigma_B \;\coloneqq\; r^{-1} \circ q \;\colon\; B \times B \longrightarrow B \,.

This is a cokernel of Δ B\Delta_B which satisfies

σ B∘Δ B=0,σ B∘ι 1=id B. \sigma_B \circ \Delta_B = 0 \,, \;\;\;\;\;\; \sigma_B \circ \iota_1 = \mathrm{id}_B \,.

(For C=C = Ab this is the map (b 1,b 2)↦b 1−b 2(b_1, b_2) \mapsto b_1 - b_2.) Moreover, σ\sigma is natural: For f:A→Bf \colon A \to B we have σ B∘(f×f)=f∘σ A\sigma_B \circ (f \times f) = f \circ \sigma_A. Namely, σ B∘(f×f)∘Δ A=σ B∘Δ B∘f=0\sigma_B \circ (f \times f) \circ \Delta_A = \sigma_B \circ \Delta_B \circ f = 0, so that σ B∘(f×f)=f′∘σ A\sigma_B \circ (f \times f) = f' \circ \sigma_A for some f′f', and then

f′=f′∘σ A∘ι 1=σ B∘(f×f)∘ι 1=σ B∘ι 1∘f=f. f' = f' \circ \sigma_A \circ \iota_1 = \sigma_B \circ (f \times f) \circ \iota_1 = \sigma_B \circ \iota_1 \circ f = f \,.

Step 5 (properties of subtraction). For x,y:A→Bx, y \colon A \to B define

x−y≔σ B∘⟨x,y⟩:A⟶B x - y \;\coloneqq\; \sigma_B \circ \langle x, y \rangle \;\colon\; A \longrightarrow B

(the notation is justified by Step 6). Then, for all composable morphisms x,y,z,wx, y, z, w:

  1. x−0=xx - 0 = x, since ⟨x,0⟩=ι 1∘x\langle x, 0 \rangle = \iota_1 \circ x;

  2. x−x=0x - x = 0, since ⟨x,x⟩=Δ B∘x\langle x, x \rangle = \Delta_B \circ x;

  3. z∘(x−y)=z∘x−z∘yz \circ (x - y) = z \circ x - z \circ y, by naturality of σ\sigma (Step 4) and since (z×z)∘⟨x,y⟩=⟨z∘x,z∘y⟩(z \times z) \circ \langle x, y \rangle = \langle z \circ x, z \circ y \rangle;

  4. (x−y)∘w=x∘w−y∘w(x - y) \circ w = x \circ w - y \circ w, since ⟨x,y⟩∘w=⟨x∘w,y∘w⟩\langle x, y \rangle \circ w = \langle x \circ w, y \circ w \rangle.

From this follows the middle-two interchange law: For u,v,x,y:A→Bu, v, x, y \colon A \to B we have

(u−v)−(x−y)=(u−x)−(v−y). (u - v) - (x - y) \;=\; (u - x) - (v - y) \,.

To see this, observe first that for a,b:A→Da, b \colon A \to D and c,d:D→Bc, d \colon D \to B, items 3 and 4 give

(c∘a−d∘a)−(c∘b−d∘b) =(c−d)∘a−(c−d)∘b =(c−d)∘(a−b) =c∘(a−b)−d∘(a−b) =(c∘a−c∘b)−(d∘a−d∘b), \begin{aligned} (c \circ a - d \circ a) - (c \circ b - d \circ b) & = (c - d) \circ a - (c - d) \circ b \\ & = (c - d) \circ (a - b) \\ & = c \circ (a - b) - d \circ (a - b) \\ & = (c \circ a - c \circ b) - (d \circ a - d \circ b) \,, \end{aligned}

and then specialize to D=B×BD = B \times B, a=⟨u,v⟩a = \langle u, v \rangle, b=⟨x,y⟩b = \langle x, y \rangle, c=p 1c = p_1, d=p 2d = p_2.

Step 6 (the abelian group structure). Define

x+y≔x−(0−y). x + y \;\coloneqq\; x - (0 - y) \,.

Then x+0=x−0=xx + 0 = x - 0 = x, by items 2 and 1 of Step 5, and

0+x=0−(0−x)=(x−x)−(0−x)=(x−0)−(x−x)=x−0=x, 0 + x \;=\; 0 - (0 - x) \;=\; (x - x) - (0 - x) \;=\; (x - 0) - (x - x) \;=\; x - 0 \;=\; x \,,

by items 1, 2 and the interchange law. Applying the interchange law three times gives

(u+v)+(x+y) =(u−(0−v))−(0−(x−(0−y))) =(u−0)−((0−v)−(x−(0−y))) =(u−0)−((0−x)−(v−(0−y))) =(u−(0−x))−(0−(v−(0−y))) =(u+x)+(v+y). \begin{aligned} (u + v) + (x + y) & = \big( u - (0 - v) \big) - \Big( 0 - \big( x - (0 - y) \big) \Big) \\ & = (u - 0) - \Big( (0 - v) - \big( x - (0 - y) \big) \Big) \\ & = (u - 0) - \Big( (0 - x) - \big( v - (0 - y) \big) \Big) \\ & = \big( u - (0 - x) \big) - \Big( 0 - \big( v - (0 - y) \big) \Big) \\ & = (u + x) + (v + y) \,. \end{aligned}

Setting here u=y=0u = y = 0 shows that ++ is commutative, and setting v=0v = 0 shows that it is associative (this is the Eckmann-Hilton argument). Moreover, (0−x)+x=(0−x)−(0−x)=0(0 - x) + x = (0 - x) - (0 - x) = 0, so that every xx has the inverse −x≔0−x-x \coloneqq 0 - x (and x+(−y)=x−yx + (-y) = x - y, by the formula for 0+x0 + x above). Hence each hom-set C(A,B)C(A,B) is an abelian group, whose neutral element is the zero morphism. Finally, composition is bilinear, since by items 3 and 4 of Step 5

z∘(x+y)=z∘x−(z∘0−z∘y)=z∘x−(0−z∘y)=z∘x+z∘y, z \circ (x + y) \;=\; z \circ x - \big( z \circ 0 - z \circ y \big) \;=\; z \circ x - \big( 0 - z \circ y \big) \;=\; z \circ x + z \circ y \,,

and similarly (x+y)∘w=x∘w+y∘w(x + y) \circ w = x \circ w + y \circ w. This is an AbAb-enrichment of CC.

Step 7 (abelianness). With respect to this enrichment, ι 1∘p 1+ι 2∘p 2=id A×B\iota_1 \circ p_1 + \iota_2 \circ p_2 = \mathrm{id}_{A \times B}, as seen by composing with p 1p_1 and with p 2p_2. Together with p 1∘ι 1=id Ap_1 \circ \iota_1 = \mathrm{id}_A, p 2∘ι 2=id Bp_2 \circ \iota_2 = \mathrm{id}_B and p 2∘ι 1=0p_2 \circ \iota_1 = 0, p 1∘ι 2=0p_1 \circ \iota_2 = 0, this means that binary products are biproducts, so that CC is an additive category, hence (having kernels and cokernels) a pre-abelian category in which, by assumption, every monomorphism is a kernel and every epimorphism is a cokernel. Therefore CC is abelian, by the second condition in the definition above.

Step 8 (uniqueness). Let +′+' be any AbAb-enrichment of CC. Its neutral elements are the zero morphisms, because C(A,0)C(A,0) is a singleton, so that A→0A \to 0 is neutral, and composition is bilinear. Consider

∇≔p 1+p 2,∇′≔p 1+′p 2:B×B⟶B. \nabla \coloneqq p_1 + p_2 \,, \;\;\;\;\;\; \nabla' \coloneqq p_1 +' p_2 \;\;\; \colon \; B \times B \longrightarrow B \,.

By bilinearity of composition we have, for x,y:A→Bx, y \colon A \to B,

x+y=∇∘⟨x,y⟩,x+′y=∇′∘⟨x,y⟩, x + y = \nabla \circ \langle x, y \rangle \,, \;\;\;\;\;\; x +' y = \nabla' \circ \langle x, y \rangle \,,

as well as ∇′∘ι 1=id B+′0=id B\nabla' \circ \iota_1 = \mathrm{id}_B +' 0 = \mathrm{id}_B and similarly ∇′∘ι 2=id B\nabla' \circ \iota_2 = \mathrm{id}_B. Hence, using Step 7,

∇′=∇′∘(ι 1∘p 1+ι 2∘p 2)=∇′∘ι 1∘p 1+∇′∘ι 2∘p 2=p 1+p 2=∇, \nabla' \;=\; \nabla' \circ \big( \iota_1 \circ p_1 + \iota_2 \circ p_2 \big) \;=\; \nabla' \circ \iota_1 \circ p_1 + \nabla' \circ \iota_2 \circ p_2 \;=\; p_1 + p_2 \;=\; \nabla \,,

and therefore x+′y=x+yx +' y = x + y. \end{proof}

Relation to exactness properties of toposes

The exactness properties of abelian categories have many features in common with exactness properties of toposes or of pretoposes.

Freyd (1999) gave a sharp description of the properties shared by these categories, introducing a new concept called AT categories (for “abelian-topos”), and showing convincingly that the difference between the A and the T can be concentrated precisely in the difference of the behavior of the initial object.

Embedding theorems

Not every abelian category is a concrete category such as Ab or RRMod. But for many proofs in homological algebra it is very convenient to have a concrete abelian category, for that allows one to check the behaviour of morphisms on actual elements of the sets underlying the objects.

The following embedding theorems, however, show that under good conditions an abelian category can be embedded into Ab as a full subcategory by an exact functor, and generally can be embedded this way into RModR Mod, for some ring RR. This is the celebrated Freyd-Mitchell embedding theorem discussed below.

This implies for instance that proofs about exactness of sequences in an abelian category can always be obtained by a naive argument on elements – called a “diagram chase” – because that does hold true after such an embedding, and the exactness of the embedding means that the notion of exact sequences is preserved by it.

Alternatively, one can reason with generalized elements in an abelian category, without explicitly embedding it into a larger concrete category, see at element in an abelian category. But under suitable conditions this comes down to working subject to an embedding into AbAb, see the discussion at Embedding into Ab below.

Counterexamples

First of all, it’s easy to see that not every abelian category is equivalent to RRMod for some ring RR. The reason is that RModR Mod has all small category limits and colimits. For a Noetherian ring RR the category of finitely generated RR-modules is an abelian category that lacks these properties.

Embedding into AbAb

(…)

(Bergman 1974)

(…)

Freyd-Mitchell embedding into RModR Mod

Mitchell’s Embedding Theorem

Every small abelian category admits a full, faithful and exact functor to the category RModR Mod for some ring RR.

Proof

This result can be found as Theorem 7.34 on page 150 of Peter Freyd’s book Abelian Categories. His terminology is a bit outdated, in that he calls an abelian category “fully abelian” if admits a full and faithful exact functor to a category of RR-modules. See also the Wikipedia article for the idea of the proof.

For more see at Freyd-Mitchell embedding theorem.

We can also characterize which abelian categories are equivalent to a category of RR-modules:

Theorem

Let CC be an abelian category. If CC has all small coproducts and has a compact projective generator, then C≃RModC \simeq R Mod for some ring RR. In fact, in this situation we can take R=C(x,x) opR = C(x,x)^{op} where xx is any compact projective generator. Conversely, if C≃RModC \simeq R Mod, then CC has all small coproducts and x=Rx = R is a compact projective generator.

Proof

This theorem, minus the explicit description of RR, can be found as Exercise F on page 103 of Peter Freyd’s book Abelian Categories. The first part of this theorem can also be found as Prop. 2.1.7. of Victor Ginzburg’s Lectures on noncommutative geometry. Conversely, it is easy to see that RR is a compact projective generator of RModR Mod.

One can characterize functors between categories of RR-modules that are either (isomorphic) to functors of the form B⊗ R−B \otimes_R - where BB is a bimodule or those which look as Hom-modules. For the characterization of the tensoring functors see Eilenberg-Watts theorem.

Going still further one should be able to obtain a nice theorem describing the image of the embedding of the weak 2-category of

into the strict 2-category of

For more discussion see the nn-Cafe.

Examples

Counter-examples:

References

Possibly the first reference on abelian categories, then still called exact categories:

Further foundations of the theory were then laid in

Other classic references:

Textbook accounts:

Further review:

On diagram chasing and elements in an abelian category:

For more discussion of the Freyd-Mitchell embedding theorem see there.

A proof that RModR Mod is an abelian category:

A 2-monadic characterization of abelian categories:

A discussion about to which extent abelian categories are a general context for homological algebra is archived at nForum here.

See also the catlist 1999 discussion on comparison between abelian categories and topoi (AT categories).

Formalization of abelian categories as univalent categories in univalent foundations of mathematics (homotopy type theory):

Generalization of abelian categories to (n,1)-categories: