Abelian Categories and Exact Sequences

⚡ Key Takeaways

An abelian category is a category that behaves like the category of modules over a ring: it has a zero object, all finite products and coproducts, and — crucially — every morphism has a kernel and cokernel such that monomorphisms are kernels and epimorphisms are cokernels. Exact sequences are the central computational and structural tool: chains of objects and morphisms where the image of each map equals the kernel of the next. Together they form the categorical foundation of homological algebra, applicable across algebra, topology, algebraic geometry, and representation theory. Introduced by Buchsbaum (1955) and Grothendieck (1957) in his Tôhoku paper.

💡 The Core Insight

In an abelian category, every morphism factors canonically as an epimorphism followed by a monomorphism, f=(mono)∘(epi)f = (\text{mono}) \circ (\text{epi}), with the middle object being the image — and this factorization is unique up to unique isomorphism. This single fact is what makes the notion of an exact sequence well-defined and what allows the entire machinery of homology (the failure of exactness, measured as ker⁡/im⁡\ker / \operatorname{im}) to be formulated purely categorically.

Formal Statement

We build up the definition in layers: Ab-category → additive category → preabelian → abelian.

DefinitionAb-category (preadditive category)

A category A\mathcal{A} is an Ab-category if every hom-set Hom⁡A(X,Y)\operatorname{Hom}_{\mathcal{A}}(X,Y) carries the structure of an abelian group, and composition is bilinear:

1
(f+f′)∘g=f∘g+f′∘g,h∘(f+f′)=h∘f+h∘f′.\quad (f+f')\circ g = f\circ g + f'\circ g, \qquad h\circ(f+f') = h\circ f + h\circ f'.

Derivation hint: This is the requirement that composition ∘:Hom⁡(Y,Z)×Hom⁡(X,Y)→Hom⁡(X,Z)\circ:\operatorname{Hom}(Y,Z)\times\operatorname{Hom}(X,Y)\to\operatorname{Hom}(X,Z) be Z\mathbb{Z}-bilinear, i.e., a group homomorphism in each variable. Here f,f′∈Hom⁡(X,Y)f,f'\in\operatorname{Hom}(X,Y), g∈Hom⁡(W,X)g\in\operatorname{Hom}(W,X), h∈Hom⁡(Y,Z)h\in\operatorname{Hom}(Y,Z). The additive identity is the zero morphism 0XY0_{XY}.

DefinitionAdditive category

An Ab-category A\mathcal{A} is additive if it has a zero object 00 (an object that is both initial and terminal) and all finite biproducts. The biproduct X⊕YX\oplus Y comes with injections iX,iYi_X, i_Y and projections pX,pYp_X, p_Y satisfying:

2
pXiX=1X,pYiY=1Y,pXiY=0,pYiX=0,iXpX+iYpY=1X⊕Y.\quad p_X i_X = 1_X,\quad p_Y i_Y = 1_Y,\quad p_X i_Y = 0,\quad p_Y i_X = 0,\quad i_X p_X + i_Y p_Y = 1_{X\oplus Y}.

Derivation hint: The first four equations characterize X⊕YX\oplus Y as both product and coproduct; the last (completeness relation) forces the product and coproduct to coincide, which is automatic in an Ab-category.

DefinitionPreabelian and abelian categories

A preabelian category is an additive category in which every morphism f:X→Yf:X\to Y has a kernel ker⁡f→kX\ker f \xrightarrow{k} X and a cokernel Y→ccoker⁡fY \xrightarrow{c} \operatorname{coker} f, characterized by the universal properties:

3
f∘k=0, and ∀ u (fu=0⇒∃! uˉ: kuˉ=u);c∘f=0, and ∀ v (vf=0⇒∃! vˉ: vˉc=v).\quad f\circ k = 0,\ \text{and } \forall\, u\ (f u=0 \Rightarrow \exists!\, \bar u:\, k\bar u = u);\quad c\circ f = 0,\ \text{and } \forall\, v\ (vf=0 \Rightarrow \exists!\, \bar v:\, \bar v c = v).

Derivation hint: A kernel is the equalizer of (f,0)(f,0); a cokernel is the coequalizer of (f,0)(f,0). Universal property = unique factorization through any competing map killing ff (resp. killed by ff). An additive category A\mathcal{A} is abelian if it is preabelian and, in addition, every monomorphism is a kernel (of its cokernel) and every epimorphism is a cokernel (of its kernel):

4
m mono  ⟹  m=ker⁡(coker⁡m),e epi  ⟹  e=coker⁡(ker⁡e).\quad m \text{ mono} \implies m = \ker(\operatorname{coker} m), \qquad e \text{ epi} \implies e = \operatorname{coker}(\ker e).

Derivation hint: These "normality" conditions are exactly what fail in non-abelian additive categories (e.g. filtered abelian groups, or torsion-free abelian groups); they guarantee the image–coimage comparison map is an isomorphism.

TheoremCanonical image factorization

In an abelian category, every morphism f:X→Yf:X\to Y admits a factorization

5
X→  e  im⁡f→  m  Y,f=m∘e,\quad X \xrightarrow{\;e\;} \operatorname{im} f \xrightarrow{\;m\;} Y, \qquad f = m\circ e,

where ee is an epimorphism and mm is a monomorphism, and im⁡f:=ker⁡(coker⁡f)\operatorname{im} f := \ker(\operatorname{coker} f). The coimage coim⁡f:=coker⁡(ker⁡f)\operatorname{coim} f := \operatorname{coker}(\ker f), and the canonical comparison map

6
θ: coim⁡f→ ∼ im⁡f\quad \theta:\ \operatorname{coim} f \xrightarrow{\ \sim\ } \operatorname{im} f

Derivation hint: θ\theta exists in any preabelian category by universal properties; abelianness ([4][4]) is precisely the requirement that θ\theta be an isomorphism for all ff. is an isomorphism. This factorization is unique up to unique isomorphism.

DefinitionExact sequence

A pair of composable morphisms X→fY→gZX \xrightarrow{f} Y \xrightarrow{g} Z with gf=0gf=0 is exact at YY if the canonical monomorphism im⁡f↪Y\operatorname{im} f \hookrightarrow Y equals ker⁡g\ker g as subobjects of YY:

7
im⁡f=ker⁡g(as subobjects of Y).\quad \operatorname{im} f = \ker g \quad\text{(as subobjects of } Y\text{)}.

Derivation hint: gf=0gf=0 already gives im⁡f⊆ker⁡g\operatorname{im} f\subseteq\ker g; exactness is the reverse inclusion. The "homology object" H=ker⁡g/im⁡f:=coker⁡(im⁡f→ker⁡g)H = \ker g / \operatorname{im} f := \operatorname{coker}(\operatorname{im} f \to \ker g) measures the failure of exactness. A short exact sequence is an exact sequence

8
0→A→fB→gC→0,\quad 0 \to A \xrightarrow{f} B \xrightarrow{g} C \to 0,

Derivation hint: Exactness at AA means ff is mono; at CC means gg is epi; at BB means im⁡f=ker⁡g\operatorname{im} f=\ker g. Equivalently A=ker⁡gA=\ker g and C=coker⁡fC=\operatorname{coker} f. equivalently: ff is a monomorphism, gg is an epimorphism, and f=ker⁡gf = \ker g (hence g=coker⁡fg = \operatorname{coker} f).

Figure
Canonical epi–mono factorization and the comparison map θ\theta

```svg

X coim f im f Y f coker(ker f) e (epi) m (mono) θ ≅ Abelian ⟺ θ : coim f → im f is an isomorphism for every morphism f.

```

Why It Holds / Derivation

ProofExistence and uniqueness of the image factorization

Step 1 (Construct the cokernel and its kernel). Given f:X→Yf:X\to Y, form c=coker⁡f:Y→Qc=\operatorname{coker} f:Y\to Q. Since A\mathcal{A} is preabelian, cc has a kernel m:K→Ym:K\to Y. Define im⁡f:=K\operatorname{im} f := K and the monomorphism is mm.

Step 2 (ff factors through mm). We have cf=0cf = 0 by definition of cokernel. By the universal property of k=ker⁡ck=\ker c ([3][3]), there is a unique e:X→Ke:X\to K with me=fm e = f. This gives f=m∘ef = m\circ e.

Step 3 (mm is monic). Kernels are always monomorphisms: if mu=mu′m u = m u' then m(u−u′)=0m(u-u')=0, and since mm equalizes nothing but 00 into YY killed by cc... more directly, m=ker⁡cm=\ker c is by construction the equalizer of (c,0)(c,0), and equalizers are monic.

Step 4 (ee is epic) — this is where abelianness enters. In a general preabelian category ee need not be epi. By axiom [4][4], the dual construction gives coim⁡f=coker⁡(ker⁡f)\operatorname{coim} f = \operatorname{coker}(\ker f) with the universal epimorphism e′:X→coim⁡fe':X\to\operatorname{coim} f, and a unique monomorphism coim⁡f→Y\operatorname{coim} f \to Y factoring ff. The comparison map θ:coim⁡f→im⁡f\theta:\operatorname{coim} f\to\operatorname{im} f satisfies θe′=e\theta e' = e (after identifications). Abelianness forces θ\theta to be an isomorphism (this is the content of every mono being a kernel and every epi a cokernel), hence e=θe′e = \theta e' is epi because e′e' is.

Step 5 (Uniqueness). Suppose f=m′′e′′f = m''e'' with m′′m'' mono, e′′e'' epi. Since m′′m'' is mono it equals ker⁡(coker⁡m′′)\ker(\operatorname{coker} m''); one shows coker⁡f=coker⁡m′′\operatorname{coker} f = \operatorname{coker} m'', hence m′′m'' and mm have the same image, giving a unique iso im⁡f≅im⁡′′f\operatorname{im} f \cong \operatorname{im}'' f commuting with everything. ■\blacksquare

∎
ProofThe Snake Lemma (statement and key steps)

Given a commutative diagram with exact rows in an abelian category

9
A→B→C→0↓a↓b↓c0→A′→B′→C′\quad \begin{array}{ccccccccc} & & A & \xrightarrow{} & B & \xrightarrow{} & C & \to & 0\\ & & \downarrow a & & \downarrow b & & \downarrow c & & \\ 0 & \to & A' & \xrightarrow{} & B' & \xrightarrow{} & C' & & \end{array}

Derivation hint: Rows exact means top is exact at A,BA,B and bottom at B′,C′B',C'; columns are the three vertical maps a,b,ca,b,c. there is a natural connecting homomorphism δ:ker⁡c→coker⁡a\delta:\ker c \to \operatorname{coker} a and a long exact sequence

10
ker⁡a→ker⁡b→ker⁡c→  δ  coker⁡a→coker⁡b→coker⁡c.\quad \ker a \to \ker b \to \ker c \xrightarrow{\;\delta\;} \operatorname{coker} a \to \operatorname{coker} b \to \operatorname{coker} c.

Derivation hint: δ\delta is built by "lifting": take x∈ker⁡cx\in\ker c, pull back to BB, push down by bb into B′B', then it lands in im⁡(A′→B′)≅A′\operatorname{im}(A'\to B')\cong A', project to coker⁡a\operatorname{coker} a. Each choice is well-defined modulo the image of aa.

Construction of δ\delta (element-style, justified by Freyd–Mitchell): Let x∈ker⁡c⊆Cx\in\ker c\subseteq C. Choose x~∈B\tilde x\in B with g(x~)=xg(\tilde x)=x (possible as gg epi). Then g′(bx~)=c(gx~)=c(x)=0g'(b\tilde x)=c(g\tilde x)=c(x)=0, so bx~∈ker⁡g′=im⁡f′b\tilde x\in\ker g'=\operatorname{im} f'; write bx~=f′(y)b\tilde x = f'(y) for unique y∈A′y\in A'. Set δ(x):=[y]∈coker⁡a\delta(x):=[y]\in\operatorname{coker} a. Independence of the choice of x~\tilde x follows because two lifts differ by an element of im⁡f=ker⁡g\operatorname{im} f = \ker g, whose image under bb lands in f′(im⁡a)f'(\operatorname{im} a). Exactness at each spot is verified by chasing. ■\blacksquare

∎
mathematician · Alexander Grothendieck | 1928–2014

In the 1957 Tôhoku paper "Sur quelques points d'algèbre homologique," Grothendieck recast homological algebra around abelian categories, introducing the axioms AB1–AB6 and AB3\–AB5\</strong> governing existence and exactness of limits and colimits. His key innovations were the recognition that injective objects suffice for derived functors (the AB5 + a generator conditions ensuring enough injectives — the Grothendieck category concept) and the systematic use of these structures to compute sheaf cohomology. This abstraction was driven by the needs of algebraic geometry, where sheaves of modules form an abelian category that is not a module category, yet must support all homological machinery. Grothendieck's framework became the language of EGA/SGA and of essentially all modern cohomology theories.

Building Intuition

🧠 Intuition

Think of an abelian category as "R-ModR\text{-}\mathbf{Mod} stripped to its skeleton." Everything you do with modules — kernels, images, quotients, direct sums, short exact sequences, diagram chases — survives, but you forget what the elements are. The two normality axioms ([4][4]) are doing all the work: they say subobjects and quotient objects are dual and complete. In a generic additive category you can have a mono that is not the kernel of anything (e.g. Z→2Z\mathbb{Z}\xrightarrow{2}\mathbb{Z} inside torsion-free groups behaves fine, but consider the inclusion of a non-closed subspace), and then "the quotient" loses information about how the subobject sits inside. Abelianness restores the perfect lattice-theoretic duality: the poset of subobjects of XX is anti-isomorphic to the poset of quotient objects of XX, via S↦X/SS\mapsto X/S. Exactness is then simply the statement "what dies next is exactly what was born here," and homology is the bookkeeping of the discrepancy.

Worked Examples

ExampleComputing homology of a complex of abelian groups

Given: the complex of Z\mathbb{Z}-modules

Z→  d2=(20)  Z2→  d1=(0  3)  Z.\mathbb{Z} \xrightarrow{\;d_2=\binom{2}{0}\;} \mathbb{Z}^2 \xrightarrow{\;d_1=(0\ \ 3)\;} \mathbb{Z}.

First check d1d2=(0  3)(20)=0d_1 d_2 = (0\ \ 3)\binom{2}{0} = 0. ✓ It is a complex.

Step 1 — compute at Z2\mathbb{Z}^2. ker⁡d1={(a,b):3b=0}={(a,0)}≅Z\ker d_1 = \{(a,b): 3b=0\} = \{(a,0)\} \cong \mathbb{Z} (the first factor). im⁡d2={(2k,0):k∈Z}=2Z⊕0\operatorname{im} d_2 = \{(2k,0): k\in\mathbb{Z}\} = 2\mathbb{Z}\oplus 0.

Step 2 — homology.

H1=ker⁡d1/im⁡d2≅Z/2Z.H_1 = \ker d_1 / \operatorname{im} d_2 \cong \mathbb{Z}/2\mathbb{Z}.

Step 3 — at the right Z\mathbb{Z}. ker⁡(0)=Z\ker(0) = \mathbb{Z}, im⁡d1=3Z\operatorname{im} d_1 = 3\mathbb{Z}, so H0=Z/3ZH_0 = \mathbb{Z}/3\mathbb{Z}.

Boxed answer:

H1≅Z/2Z,H0≅Z/3Z,H2=ker⁡d2=0.\boxed{H_1 \cong \mathbb{Z}/2\mathbb{Z}, \qquad H_0 \cong \mathbb{Z}/3\mathbb{Z}, \qquad H_2 = \ker d_2 = 0.}

The nonzero homology measures the failure of exactness exactly at the two spots.

ExampleThe connecting map and a Tor computation via the snake lemma

Given: the short exact sequence of Z\mathbb{Z}-modules 0→Z→nZ→Z/n→00\to\mathbb{Z}\xrightarrow{n}\mathbb{Z}\to\mathbb{Z}/n\to 0. Apply −⊗ZM-\otimes_{\mathbb{Z}} M for M=Z/mM=\mathbb{Z}/m, with d=gcd⁡(m,n)d=\gcd(m,n).

Step 1 — tensor (right exact). We get

Z/m→  ⋅n  Z/m→Z/n⊗Z/m→0.\mathbb{Z}/m \xrightarrow{\;\cdot n\;} \mathbb{Z}/m \to \mathbb{Z}/n\otimes\mathbb{Z}/m \to 0.

Step 2 — identify coker⁡\operatorname{coker}. Multiplication by nn on Z/m\mathbb{Z}/m has image n(Z/m)=d(Z/m)n(\mathbb{Z}/m) = d(\mathbb{Z}/m), so

Z/n⊗Z/m≅(Z/m)/(dZ/m)≅Z/d.\mathbb{Z}/n\otimes\mathbb{Z}/m \cong (\mathbb{Z}/m)/(d\mathbb{Z}/m) \cong \mathbb{Z}/d.

Step 3 — kernel gives Tor. ker⁡(⋅n:Z/m→Z/m)={x:nx≡0(modm)}\ker(\cdot n:\mathbb{Z}/m\to\mathbb{Z}/m) = \{x : nx\equiv 0 \pmod m\} has order dd, so

Tor⁡1Z(Z/n,Z/m)≅Z/d.\operatorname{Tor}_1^{\mathbb{Z}}(\mathbb{Z}/n,\mathbb{Z}/m)\cong\mathbb{Z}/d.

Boxed answer (take m=6,n=4m=6,n=4, d=2d=2):

Z/4⊗Z/6≅Z/2,Tor⁡1Z(Z/4,Z/6)≅Z/2.\boxed{\mathbb{Z}/4\otimes\mathbb{Z}/6 \cong \mathbb{Z}/2, \qquad \operatorname{Tor}_1^{\mathbb{Z}}(\mathbb{Z}/4,\mathbb{Z}/6)\cong\mathbb{Z}/2.}

This is the long exact sequence of Tor⁡\operatorname{Tor} in action — the failure of −⊗M-\otimes M to be left exact is captured categorically.

Common Misconceptions

⚠️ Common mistake

"Mono + epi = iso." In an arbitrary category this is false, and even in many additive categories it fails. In an abelian category it is true: a morphism that is both monic and epic is an isomorphism (because ff mono ⇒ker⁡f=0⇒coim⁡f=X\Rightarrow \ker f=0 \Rightarrow \operatorname{coim} f = X; ff epi ⇒coker⁡f=0⇒im⁡f=Y\Rightarrow \operatorname{coker} f=0 \Rightarrow \operatorname{im} f = Y; the comparison iso θ\theta then makes ff an iso). But beware: this relies critically on abelianness. In Top\mathbf{Top} or Ring\mathbf{Ring} a bimorphism need not be an iso (e.g. Z↪Q\mathbb{Z}\hookrightarrow\mathbb{Q} is mono and epi in Ring\mathbf{Ring} but not surjective).

⚠️ Common mistake

Exact does not mean split. A short exact sequence 0→A→B→C→00\to A\to B\to C\to 0 being exact only says BB is an extension of CC by AA; it need not split, i.e. B≇A⊕CB\not\cong A\oplus C in general. The sequence 0→Z→2Z→Z/2→00\to\mathbb{Z}\xrightarrow{2}\mathbb{Z}\to\mathbb{Z}/2\to 0 does not split. Splitting is governed by Ext⁡1(C,A)\operatorname{Ext}^1(C,A); the sequence splits iff its class in Ext⁡1\operatorname{Ext}^1 is zero.

CounterexampleAn additive category that is NOT abelian

Consider A=\mathcal{A} = the category of finitely generated free abelian groups (equivalently, finite-rank lattices) with group homomorphisms. It is additive: it has 00, biproducts Zm⊕Zn=Zm+n\mathbb{Z}^m\oplus\mathbb{Z}^n=\mathbb{Z}^{m+n}, and additive hom-sets. But it is not abelian. The morphism ⋅2:Z→Z\cdot 2:\mathbb{Z}\to\mathbb{Z} is a monomorphism whose cokernel Z/2\mathbb{Z}/2 does not exist in A\mathcal{A} (it's not free) — so kernels/cokernels fail to exist, violating even the preabelian requirement. Even fixing existence, the category of torsion-free abelian groups is preabelian but not abelian: there the mono ⋅2:Z→Z\cdot 2:\mathbb{Z}\to\mathbb{Z} has cokernel 00 (since Z/2\mathbb{Z}/2 is killed by the torsion-free reflection), so ker⁡(coker⁡(⋅2))=ker⁡(0-map)=Z≠im⁡(⋅2)=2Z\ker(\operatorname{coker}(\cdot 2)) = \ker(0\text{-map}) = \mathbb{Z} \ne \operatorname{im}(\cdot2)=2\mathbb{Z}. The comparison map θ\theta is the mono 2Z↪Z2\mathbb{Z}\hookrightarrow\mathbb{Z}, not an iso — axiom [4][4] fails.

Connections

connection

Abelian categories sit at the crossroads of nearly all homological mathematics. The <span class="wiki-link-missing">Freyd–Mitchell Embedding Theorem</span> legitimizes element-wise diagram chasing by embedding any small abelian category into R-ModR\text{-}\mathbf{Mod}. The notion of exactness powers <span class="wiki-link-missing">Derived Functors</span> (Ext⁡\operatorname{Ext}, Tor⁡\operatorname{Tor}, sheaf cohomology) and the formalism of <span class="wiki-link-missing">Chain Complexes and Homology</span>. Refining the structure leads to <span class="wiki-link-missing">Triangulated Categories</span> and <span class="wiki-link-missing">Derived Categories</span>, which are obtained by localizing complexes over an abelian category at quasi-isomorphisms. The <span class="wiki-link-missing">Yoneda Ext Groups</span> interpret Ext⁡n\operatorname{Ext}^n as equivalence classes of nn-fold extensions, a purely abelian-categorical construction. Finally, <span class="wiki-link-missing">Grothendieck Categories</span> (AB5 + a generator) are exactly the abelian categories with enough injectives where Grothendieck's derived-functor cohomology lives, and <span class="wiki-link-missing">Serre Subcategories and Quotient Categories</span> generalize localization of rings to this setting.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- 1942–45 — Eilenberg and Mac Lane introduce category theory and natural transformations, originally to formalize naturality in homology/cohomology of topological spaces.
- 1945 — Eilenberg–Steenrod axiomatize homology theory, foregrounding exact sequences as the central structural device.
- 1952 — Eilenberg–Steenrod's Foundations of Algebraic Topology and Cartan–Eilenberg's developing work crystallize "homological algebra" as a subject over module categories.
- 1955 — David Buchsbaum, in his thesis and the appendix to Cartan–Eilenberg, gives the first axioms for "exact categories," essentially the abelian category concept.
- 1956 — Cartan–Eilenberg's Homological Algebra published, the definitive treatment over rings, exposing the need for a categorical generalization for sheaves.
- 1957 — Grothendieck's Tôhoku paper defines abelian categories with axioms AB1–AB6, introduces Grothendieck categories, enough injectives, and recasts sheaf cohomology as derived functors — the watershed.
- 1960s — Grothendieck's EGA/SGA deploy abelian categories pervasively; the derived category is introduced by Verdier (Grothendieck's student) in his thesis.
- 1964 — Peter Freyd (Abelian Categories) and Barry Mitchell (1965, Theory of Categories) prove the full embedding theorem, justifying element-wise reasoning.
- 1973–82 — Beilinson–Bernstein–Deligne–Gabber develop t-structures and perverse sheaves, identifying new abelian categories as hearts inside triangulated/derived categories.

Subtleties & Limits

open-problem

Where the abelian framework strains. (i) The derived category of an abelian category is not itself abelian — it is only triangulated; the desire for a single homotopy-coherent enhancement led to stable ∞\infty-categories and dg-categories, where the precise comparison and the existence of "enhancements" (Bondal–Larsen–Lunts, Lunts–Orlov) involve deep, still-active questions. (ii) Non-additive and "exact"-but-not-abelian settings: many categories (vector bundles, filtered modules, Banach spaces) are naturally quasi-abelian or merely exact categories (Quillen), where short exact sequences are specified extra data; classifying and relating these to abelian categories (the derived category of a quasi-abelian category, Schneiders) remains subtle. (iii) The Freyd–Mitchell theorem requires smallness; for large abelian categories (e.g. all modules over a proper class of rings) a clean concrete embedding is delicate. (iv) Tannakian reconstruction: precisely which abelian (tensor) categories arise as representation categories of (pro)algebraic groups is governed by deep criteria (Deligne's tensor-category theorems), and the non-neutral and characteristic-pp cases retain open structural questions.

See Also

Freyd–Mitchell Embedding Theorem · Derived Functors · Snake Lemma · Five Lemma · Grothendieck Categories · Yoneda Ext Groups · Triangulated Categories · Serre Subcategories and Quotient Categories · Chain Complexes and Homology · Tannakian Categories