The snake lemma is a fundamental tool of homological algebra which is primarily used in the construction of the homology long exact sequence. It's proof, like many others in homological algebra, is an exercise in diagram chasing. Although simple, the act of diagram chasing does not immediately give insight into why the snake lemma must be true. In this post, we aim to make the snake lemma more apparent and clarify its application to the long exact sequence.
Preliminaries
For simplicity, we will work in the category Ab of abelian groups, although the result holds more generally for any abelian category. Recall that a (finite) chain complex is a sequence
A0⟶ϕ0A1⟶ϕ1⋯⟶ϕn−2An−1⟶ϕn−1An
of abelian groups and morphisms such that the composition of consecutive morphisms is zero. In particular, this implies that the image of one morphism is contained in the kernel of the subsequent morphism. The sequence is called exact if for each k, we have imϕk=kerϕk+1. A short exact sequence is an exact sequence of the form 0→A→B→C→0, the data of which is equivalent to stating that
A is a subobject of B and
C is the corresponding quotient object of B, that is, C≅B/A.
In other words, a short exact sequence is really just a way to "decompose" B into two related pieces. A simple example of this that we will use to build intuition is the sequence 0→Z→R→S1→0, illustrated below.
Throughout this post, we will be making use of "extension and contraction" identities to avoid dealing with chasing individual elements. In particular, let ϕ:G→H be a homomorphism of abelian groups. Then
ϕ(ϕ−1(T))=imϕ∩T for any subgroup T≤H, and
ϕ−1(ϕ(S))=S+kerϕ for any subgroup S≤G.
The Snake Morphism
Let B1 and B2 be abelian groups. For each i∈{1,2}, let Ai≤Bi be a subobject of Bi, and Ci=Bi/Ai be the corresponding quotient object. Suppose that ψ:B1→B2 is a morphism which "respects the decomposition" of each Bi, meaning that ψ maps A1 to A2, so that it also induces a map between C1 and C2. In our example, we may take Bi=R and consider the "multiplication-by-n" map n×:R→R. This gives us a commutative diagram
00Zn×↓⏐ZRn×↓⏐RS1n×↓⏐S100.
A natural question is to ask how these three multiplication maps relate to each other. Note that while the middle map is an isomorphism, the left map is only injective and the right map is only surjective. The deviation from being an isomorphism is can therefore measured by the cokernel coker(n×:Z→Z) and the kernel ker(n×:S1→S1). We may relabel the top sequence, replacing the left multiplication map by an inclusion ι as follows:
00nZι↓⏐ZRRR/nZπ↓⏐R/Z00.
Since Z corresponds to the zero subgroup in R/Z, the kernel of π is what you get if you pull back (since the middle map is the identity, this isn't strictly necessary) the "larger" group Z up into R and then quotient by the "smaller" group nZ. It's clear this does not depend on the ambient group; for example, we obtain the same kernel if we replace R by Z in the above diagram. To summarize, ker(n×:S1→S1)≅coker(n×:Z→Z), which means the deviations of the left and right maps from being isomorphisms are in some sense "the same". One of the assertions of the Snake Lemma is that in such a situation, there is always a connection between the cokernel and kernel, given by a map known as the snake morphism.
To show how this arises, we state a lemma which captures the ideas discussed for the example given earlier.
Lemma. For i∈{1,2}, let Bi be an abelian group, and Ai≤Bi be a subgroup. If ϕ:B1→B2 is a homomorphism which also maps A1 to A2, then ϕ induces a homomorphism B1/A1→B2/A2 such that the diagram
where the notation [⋅]H means the equivalence class of an element in the quotient by a subgroup H. Note that δ is not just the restriction of the induced map on the right, which would take [b]A1→[ϕ(b)]A2. This is just the zero map!
In other words, δ is much like the map induced by ϕ, but in some sense "preserves" as much information as the original map ϕ will allow. For example, if ϕ is an isomorphism, then δ is also an isomorphism, whereas the induced map on the quotients may not be. This notion is formalized by the second assertion of the Snake Lemma, which states that the kernels and cokernels of the maps induced by ϕ join to form an exact sequence.
The Snake Lemma
We now state and prove the complete Snake Lemma.
Theorem. Consider a commutative diagram of abelian groups
If the rows are exact, then the diagram extends to a commutative diagram
where +ι1 and +ι2 are the maps induced by ι, and +π1, and +π2 are the maps induced by π. Moreover, there exists a natural homomorphism δ:kerγ→cokerα such that
We now construct the connecting homomorphism δ. Since π1 is surjective, the image of γ is contained in the image of π2, which means we may as well replace C2 with B2/A2 without disturbing kerγ. Therefore, we may apply the previous lemma to the diagram
which yields kerγ=β−1(A2)/ι1(A1), viewing A2 as a subgroup of B2. Furthermore, the map β−1(A2)→A2 takes ι1(A1) to A2, which yields the connecting homomorphism δ:kerγ→cokerα. We now show that the sequence is exact at kerγ and cokerα.
To show the sequence is exact at kerγ, we use the lemma once more and write
The most well-known application of the snake lemma is in the construction of the homology long exact sequence. We will demonstrate how the long exact sequence arises and give a explicit description of the connecting homomorphism for one such example, the Mayer-Vietoris sequence.
Let 0→A∙→B∙→C∙→0 be a short exact sequence of chain complexes. Taking classes of homologous chains (not just cycles) and considering the boundary operator yields the diagram
Applying the snake lemma yields the desired long exact sequence:
The interpretation of the connecting homomorphism depends on the specific long exact sequence. For example, in the relative homology long exact sequence associated to a pair (X,A)∈Top2, the connecting homomorphism is the normal boundary map, but not viewed "relative" to A (for this would be too "destructive" and result in the zero map).
Example (The Mayer-Vietoris sequence).
Let X be a topological space, and let U and V be subsets whose interiors cover X. Then we obtain a short exact sequence
0⟶S∙(U∩V)⟶S∙(U)⊕S∙(V)→S∙{U,V}(X)⟶0,
where S∙ is the singular chain complex functor and S∙{U,V}(X) are the chains of simplices inhabiting either U or V. Then we may apply the lemma to obtain
Hn{U,V}(X)≅⟨[c]⊕[c]⟩⟨[a]⊕[b]∣∂[a]=∂[b]⟩,
where [⋅] denotes the homology class of a chain (not necessarily a cycle) in Sn(U∩V). In other words, an element of the homology group is represented by a chain in U and a chain in V such that their boundaries agree and reside in the intersection. In particular, this implies that the difference of the two chains is a cycle. The connecting homomorphism is given by
δn:Hn{U,V}(X)→Hn−1(U∩V);[[a]⊕[b]]⟼[∂[a]],
which takes the boundary of either chain, which is a cycle in U∩V.