Exact sequence, short five lemma, snake lemma
Anchor (Master): Cartan-Eilenberg 1956 Homological Algebra Ch. I-III; Eilenberg-Steenrod 1952; Weibel 1994 An Introduction to Homological Algebra
Intuition [Beginner]
A homomorphism between groups has a kernel (the elements crushed to the identity) and an image (the elements it produces). An exact sequence is a chain of groups connected by homomorphisms where each map's image matches the next map's kernel perfectly. At every link in the chain, the outputs that arrive are precisely the inputs that vanish.
Think of it as a relay race. Runner A hands the baton to Runner B, who hands it to Runner C. Exactness means that Runner B receives exactly the baton that Runner A produced — nothing extra arrives, and nothing is lost.
Why does this concept exist? Exact sequences encode how a group is assembled from simpler pieces, and they provide the language for connecting kernels and cokernels across diagrams of homomorphisms.
Visual [Beginner]
A row of three circles connected by arrows. The left circle is labelled , the middle , the right . The arrow from to and the arrow from to overlap at : the image of the first arrow fills precisely the kernel of the second.
The overlap region represents exactness at : what comes in equals what goes to zero on the way out.
Worked example [Beginner]
Consider the integers under addition, written , and the integers modulo , written .
Step 1. Define the inclusion map from to that sends to . The image of is the set .
Step 2. Define the quotient map from to that sends each integer to its remainder modulo . The kernel of is the set .
Step 3. The image of equals the kernel of . The sequence is exact at the middle group .
What this tells us: the group is assembled from the subgroup and the quotient , with exactness recording how they fit together.
Check your understanding [Beginner]
Formal definition [Intermediate+]
Let , , be groups (in this section, abelian groups written additively) and let , be group homomorphisms.
Definition (Exact at one point). The pair is exact at if .
Definition (Exact sequence). A sequence of groups and homomorphisms $$ \cdots \xrightarrow{f_{n-2}} A_{n-1} \xrightarrow{f_{n-1}} A_n \xrightarrow{f_n} A_{n+1} \xrightarrow{f_{n+1}} \cdots $$ is exact if it is exact at every group in the sequence: for all .
Definition (Short exact sequence). A sequence is short exact if:
- , which forces (so is injective);
- (exactness at );
- (so is surjective).
In this case (identifying with its image in ) [Rotman §2.1].
Counterexamples to common slips [Intermediate+]
- Injective plus surjective does not suffice. The sequence is not short exact: the image of multiplication by is , but the kernel of reduction mod is all even integers, so exactness at the middle holds, but the issue is that the map to must have kernel exactly . In this case it does, so this is actually short exact. A genuine failure: is not short exact because .
- Exactness at one point does not imply exactness everywhere. A map is exact at (since ), but the sequence is not exact at or unless and .
- The middle group need not be the direct sum. For a short exact sequence , the group need not be isomorphic to . The sequence is short exact but .
Key theorem with proof [Intermediate+]
Theorem (Snake Lemma). Consider a commutative diagram of abelian groups with exact rows: $$ \begin{CD} 0 @>>> A @>{f}>> B @>{g}>> C @>>> 0 \ @. @V{\alpha}VV @V{\beta}VV @V{\gamma}VV @. \ 0 @>>> A' @>{f'}>> B' @>{g'}>> C' @>>> 0 \end{CD} $$ There is a long exact sequence $$ 0 \to \ker \alpha \xrightarrow{f_*} \ker \beta \xrightarrow{g_*} \ker \gamma \xrightarrow{\delta} \operatorname{coker} \alpha \xrightarrow{f'*} \operatorname{coker} \beta \xrightarrow{g'} \operatorname{coker} \gamma \to 0 $$ where $f_g_*fgf'*g'*\delta$ is the connecting homomorphism.
Proof. The proof proceeds by a diagram chase. Write , , for the inclusions, and , , for the projections.
Definition of . Let . Since is surjective, choose with . Then , so . By exactness of the bottom row, , so there exists with . Define .
is well-defined. Suppose both satisfy . Then , so by exactness of the top row. Write for some . The corresponding satisfy and , so . Since is injective, , hence in .
is a homomorphism. For , choose lifts . Then lifts , so .
Exactness at . The map sends to : for , . For exactness, : by exactness of the top row. For : if with , then , say . Then , and injectivity of gives , so .
Exactness at . For , is constructed using itself as the lift. Since , the satisfying is , so . Conversely, if , write , meaning for some . The lift of satisfies , so , giving . Thus and , so .
Exactness at . The map sends to . For , where , so in , giving . Conversely, if then , say . Then , so , meaning . Now by construction.
Exactness at . The map sends to . For , . Conversely, if , then , say . Choose with . Then , so for some by exactness of the bottom row. Hence .
Exactness at . Since is surjective, is surjective on cokernels.
Bridge. The snake lemma builds toward the long exact sequence in homology 01.02.12, where each connecting homomorphism in a long exact sequence is constructed by the same diagram-chase mechanism. This result appears again in 01.02.10 (tensor product of modules), where the snake lemma yields the long exact Tor sequence. The foundational reason is that exactness is a local condition (checked at one group) that propagates globally across a diagram, and this is exactly the mechanism that makes homological algebra work: the central insight is that kernels and cokernels are connected by a systematic homomorphism, the bridge is between the zero-dimensional data (kernels) and the quotient data (cokernels), and the pattern generalises to any abelian category.
Exercises [Intermediate+]
Advanced results [Master]
Theorem 1 (Five Lemma). Consider a commutative diagram of abelian groups with exact rows: $$ \begin{CD} A_1 @>>> A_2 @>>> A_3 @>>> A_4 @>>> A_5 \ @V{\alpha_1}VV @V{\alpha_2}VV @V{\alpha_3}VV @V{\alpha_4}VV @V{\alpha_5}VV \ B_1 @>>> B_2 @>>> B_3 @>>> B_4 @>>> B_5 \end{CD} $$ If is surjective, is injective, and are isomorphisms, then is an isomorphism.
The proof is a diagram chase in two directions: injectivity uses and , surjectivity uses and [Weibel §1.3]. The Short Five Lemma is the special case where the outer groups are all zero.
Theorem 2 (Splitting Lemma, full version). For a short exact sequence of abelian groups, the following are equivalent:
- There exists with (a retraction).
- There exists with (a section).
- with the inclusion into the first factor and the projection onto the second.
When any (hence all) of these hold, the sequence is called split [Rotman §2.1].
Theorem 3 (3x3 Lemma / Nine Lemma). Given a commutative diagram of three rows and three columns of abelian groups, if all three columns and the top two rows are short exact, then the bottom row is also short exact. Equivalently, if all three columns and the bottom two rows are short exact, then the top row is short exact.
This follows from repeated applications of the snake lemma to pairs of adjacent rows [Weibel §1.3].
Theorem 4 (Long exact sequence from short exact sequences of complexes). If is a short exact sequence of chain complexes, there is a long exact sequence in homology: $$ \cdots \to H_n(A) \to H_n(B) \to H_n(C) \xrightarrow{\delta} H_{n-1}(A) \to H_{n-1}(B) \to \cdots $$ The connecting homomorphism is constructed by the same diagram chase as in the snake lemma. In fact, the snake lemma is the special case where each complex has at most two nonzero terms [Weibel §1.3].
Theorem 5 (Horseshoe Lemma). Given a short exact sequence of modules and projective resolutions and , there exists a projective resolution with exact for all , fitting the original resolutions into a short exact sequence of complexes.
This identifies projective resolutions as behaving well under extensions, which is the foundational input for constructing derived functors [Weibel §2.2].
Theorem 6 (Yoneda Ext and exact sequences). The set of equivalence classes of extensions is in bijection with the derived functor . A short exact sequence splits if and only if the corresponding extension class in is zero.
This is the bridge between the concrete classification of extensions and the abstract homological machinery. The group law on corresponds to the Baer sum of extensions [Weibel §3.4].
Synthesis. Exact sequences are the foundational reason that homological algebra unifies computation across modules, chain complexes, and abelian categories. The central insight is that a short exact sequence encodes an extension problem — how is assembled from and — and the snake lemma transforms that local extension data into global connectivity between kernels and cokernels. Putting these together with the Five Lemma and the Nine Lemma, the bridge is between local exactness at individual groups and global exactness of the entire diagram, and this is exactly the machinery that makes derived functors computable. The pattern generalises from abelian groups to modules over any ring, to sheaves on a topological space, and to objects in any abelian category, identifying the homological invariants of a mathematical object with the algebraic data of its exact sequences.
Full proof set [Master]
Proposition 1 (Five Lemma). In the five-by-five diagram of Theorem 1, if is surjective, and are isomorphisms, and is injective, then is an isomorphism.
Proof. Label the horizontal maps in the top row as and in the bottom row as .
Injectivity of . Let . Then , so by commutativity. Since is injective, . By exactness, for some . Now gives , so . Write for some . Since is surjective, for some . Then , and injectivity of gives . Hence by exactness at .
Surjectivity of . Let . Then . Since is surjective, for some . Then . Since is injective, . By exactness, for some . Now , so . By exactness, for some . Since is surjective, for some . Hence .
Proposition 2 (Long exact sequence from short exact sequence of complexes). Given a short exact sequence of chain complexes , there is a long exact sequence $$ \cdots \to H_n(A) \xrightarrow{f_*} H_n(B) \xrightarrow{g_*} H_n(C) \xrightarrow{\delta} H_{n-1}(A) \to \cdots $$
Proof. The connecting homomorphism is constructed by a diagram chase. Let , so with . Since is surjective, choose with . Then , so . Write for some . Define .
Well-defined: because and is injective. A different lift gives for some , and then , so in homology. Changing by a boundary similarly changes by a boundary.
Exactness at : if , then the lift of can be chosen as itself, giving , so is a boundary in , hence . Conversely, if , then for some , so , giving , and , so .
Exactness at and follow by similar diagram chases.
Proposition 3 (Snake Lemma implies the Short Five Lemma). Given the diagram of the Short Five Lemma with and isomorphisms, is an isomorphism.
Proof. Apply the snake lemma to the diagram. The kernel-cokernel sequence is $$ 0 \to \ker\alpha \to \ker\beta \to \ker\gamma \xrightarrow{\delta} \operatorname{coker}\alpha \to \operatorname{coker}\beta \to \operatorname{coker}\gamma \to 0. $$ Since is an isomorphism, and . Since is an isomorphism, and . The sequence collapses to and , giving and , so is an isomorphism.
Connections [Master]
Subgroup, coset, quotient group, isomorphism theorems
01.02.02. The First Isomorphism Theorem is the prototypical exact sequence: . The three isomorphism theorems developed in the subgroup-coset unit are the group-theoretic precursors of the exactness conditions formalised here. The foundational reason that kernels and images encode structural information appears in both units.Tensor product of modules
01.02.10. The snake lemma applied to the functor produces the long exact Tor sequence whenever is exact and is flat. The exactness properties of the tensor product are measured by the vanishing of Tor groups, and this is exactly the bridge between the homological machinery of the present unit and the module constructions of the tensor product unit.Group action, orbit-stabiliser, class equation
01.02.03. The orbit-stabiliser exact sequence for a transitive group action (in the category of sets, not groups) previews the exact-sequence viewpoint on group actions. The stabiliser as kernel of the action map and the orbit as image build toward the exact-sequence formalism. The class equation decomposes a group into conjugacy classes whose sizes are indices of centralisers, and these indices are the orders of cokernels in the action maps.
Historical & philosophical context [Master]
Exact sequences originated in the algebraic topology of the 1940s. Eilenberg and Steenrod introduced the exactness axioms for homology theories in their 1952 Foundations of Algebraic Topology [Eilenberg-Steenrod 1952], establishing the long exact sequence of a pair as a fundamental axiom. The snake lemma in its general form appeared in Cartan and Eilenberg's 1956 Homological Algebra [Cartan-Eilenberg 1956], which systematised the diagram-chase techniques that had been circulating informally in the work of Kelley and Pitcher (1948) and in Eilenberg's earlier papers on spectral sequences.
The five lemma is sometimes attributed to Jans (1964 Mem. AMS 4), though the result was used implicitly throughout Cartan-Eilenberg 1956 and in Grothendieck's 1957 Tôhoku paper. Grothendieck's Tôhoku memoir reoriented homological algebra around abelian categories and derived functors, making the snake lemma and the five lemma into formal consequences of the abelian-category axioms [Weibel §1.3]. Weibel's 1994 An Introduction to Homological Algebra remains the canonical modern exposition of these results and their generalisations.
Bibliography [Master]
@book{CartanEilenberg1956,
author = {Cartan, Henri and Eilenberg, Samuel},
title = {Homological Algebra},
publisher = {Princeton University Press},
year = {1956},
}
@book{EilenbergSteenrod1952,
author = {Eilenberg, Samuel and Steenrod, Norman},
title = {Foundations of Algebraic Topology},
publisher = {Princeton University Press},
year = {1952},
}
@book{Weibel1994,
author = {Weibel, Charles A.},
title = {An Introduction to Homological Algebra},
publisher = {Cambridge University Press},
year = {1994},
series = {Cambridge Studies in Advanced Mathematics 38},
}
@book{Rotman2009,
author = {Rotman, Joseph J.},
title = {An Introduction to Homological Algebra},
edition = {2nd},
publisher = {Springer},
year = {2009},
series = {Universitext},
}
@book{DummitFoote2004,
author = {Dummit, David S. and Foote, Richard M.},
title = {Abstract Algebra},
edition = {3rd},
publisher = {Wiley},
year = {2004},
}
@article{Grothendieck1957,
author = {Grothendieck, Alexander},
title = {Sur quelques points d'alg\`ebre homologique},
journal = {T\^ohoku Mathematical Journal},
volume = {9},
year = {1957},
pages = {119--221},
}
@article{Jans1964,
author = {Jans, James P.},
title = {Some remarks on cohomology and homology},
journal = {Memoirs of the American Mathematical Society},
volume = {4},
year = {1964},
}
@article{KelleyPitcher1948,
author = {Kelley, John L. and Pitcher, Everett},
title = {Exact homomorphism sequences in homology theory},
journal = {Annals of Mathematics},
volume = {48},
year = {1948},
pages = {682--709},
}