ProofComplete

Proof of the Snake Lemma

We give a complete proof of the Snake Lemma by diagram chasing in R-ModR\text{-}\mathbf{Mod}. By the Freyd-Mitchell Embedding Theorem, this suffices for any abelian category.


Setup

We have a commutative diagram with exact rows:

AfBgC0αβγ0AfBgC\begin{array}{ccccccccc} & & A' & \xrightarrow{f'} & B' & \xrightarrow{g'} & C' & \to & 0 \\ & & \downarrow\scriptstyle{\alpha} & & \downarrow\scriptstyle{\beta} & & \downarrow\scriptstyle{\gamma} & & \\ 0 & \to & A & \xrightarrow{f} & B & \xrightarrow{g} & C & & \end{array}

Step 1: Induced Maps on Kernels and Cokernels

ProofInduced maps exist

The maps fˉ:kerαkerβ\bar{f'} : \ker \alpha \to \ker \beta and gˉ:kerβkerγ\bar{g'} : \ker \beta \to \ker \gamma are induced by restricting ff' and gg'. If α(a)=0\alpha(a') = 0, then β(f(a))=f(α(a))=0\beta(f'(a')) = f(\alpha(a')) = 0, so f(a)kerβf'(a') \in \ker \beta. Similarly for gg'.

The maps fˉ:cokerαcokerβ\bar{f} : \mathrm{coker}\, \alpha \to \mathrm{coker}\, \beta and gˉ:cokerβcokerγ\bar{g} : \mathrm{coker}\, \beta \to \mathrm{coker}\, \gamma are induced by ff and gg. If aimαa \in \mathrm{im}\, \alpha, say a=α(a)a = \alpha(a'), then f(a)=f(α(a))=β(f(a))imβf(a) = f(\alpha(a')) = \beta(f'(a')) \in \mathrm{im}\, \beta. So ff descends to fˉ:A/imαB/imβ\bar{f} : A/\mathrm{im}\, \alpha \to B/\mathrm{im}\, \beta.


Step 2: Construction of the Connecting Homomorphism

ProofConstruction of delta

We define δ:kerγcokerα\delta : \ker \gamma \to \mathrm{coker}\, \alpha.

Let ckerγc' \in \ker \gamma, so γ(c)=0\gamma(c') = 0.

Lift: Since gg' is surjective, choose bBb' \in B' with g(b)=cg'(b') = c'.

Map down: Compute β(b)B\beta(b') \in B. We have g(β(b))=γ(g(b))=γ(c)=0g(\beta(b')) = \gamma(g'(b')) = \gamma(c') = 0. So β(b)kerg=imf\beta(b') \in \ker g = \mathrm{im}\, f (by exactness of the bottom row at BB).

Lift to AA: Since ff is injective (bottom row is exact at AA), there is a unique aAa \in A with f(a)=β(b)f(a) = \beta(b').

Project: Define δ(c)=[a]cokerα=A/imα\delta(c') = [a] \in \mathrm{coker}\, \alpha = A / \mathrm{im}\, \alpha.

Well-definedness: Suppose b1b_1' is another lift: g(b1)=cg'(b_1') = c'. Then g(bb1)=0g'(b' - b_1') = 0, so bb1kerg=imfb' - b_1' \in \ker g' = \mathrm{im}\, f'. Write bb1=f(a)b' - b_1' = f'(a') for some aAa' \in A'. Then the corresponding elements a,a1Aa, a_1 \in A differ by: f(aa1)=β(bb1)=β(f(a))=f(α(a))f(a - a_1) = \beta(b' - b_1') = \beta(f'(a')) = f(\alpha(a')). Since ff is injective, aa1=α(a)imαa - a_1 = \alpha(a') \in \mathrm{im}\, \alpha. So [a]=[a1][a] = [a_1] in cokerα\mathrm{coker}\, \alpha.

Homomorphism: δ\delta is additive since each step (lift, map down, lift, project) is additive (using the uniqueness of the lift through ff).


Step 3: Exactness at kerβ\ker \beta

ProofExactness at ker beta

We show im(fˉ)=ker(gˉ)\mathrm{im}(\bar{f'}) = \ker(\bar{g'}).

im(fˉ)ker(gˉ)\mathrm{im}(\bar{f'}) \subseteq \ker(\bar{g'}): For akerαa' \in \ker \alpha, gˉ(fˉ(a))=g(f(a))=0\bar{g'}(\bar{f'}(a')) = g'(f'(a')) = 0 by exactness of the top row.

ker(gˉ)im(fˉ)\ker(\bar{g'}) \subseteq \mathrm{im}(\bar{f'}): Let bkerβb' \in \ker \beta with g(b)=0g'(b') = 0. By exactness of the top row at BB', b=f(a)b' = f'(a') for some aAa' \in A'. Then f(α(a))=β(f(a))=β(b)=0f(\alpha(a')) = \beta(f'(a')) = \beta(b') = 0. Since ff is injective, α(a)=0\alpha(a') = 0, so akerαa' \in \ker \alpha and b=fˉ(a)b' = \bar{f'}(a').


Step 4: Exactness at kerγ\ker \gamma

ProofExactness at ker gamma

We show im(gˉ)=kerδ\mathrm{im}(\bar{g'}) = \ker \delta.

im(gˉ)kerδ\mathrm{im}(\bar{g'}) \subseteq \ker \delta: Let bkerβb' \in \ker \beta, and set c=g(b)c' = g'(b'). To compute δ(c)\delta(c'), we can use bb' itself as a lift. Then β(b)=0\beta(b') = 0, so a=0a = 0 and δ(c)=[0]=0\delta(c') = [0] = 0.

kerδim(gˉ)\ker \delta \subseteq \mathrm{im}(\bar{g'}): Let ckerγc' \in \ker \gamma with δ(c)=0\delta(c') = 0. Using a lift bb' with g(b)=cg'(b') = c', we have β(b)=f(a)\beta(b') = f(a) and [a]=0[a] = 0 in cokerα\mathrm{coker}\, \alpha, so a=α(a)a = \alpha(a') for some aa'. Then β(b)=f(α(a))=β(f(a))\beta(b') = f(\alpha(a')) = \beta(f'(a')), so β(bf(a))=0\beta(b' - f'(a')) = 0, meaning bf(a)kerβb' - f'(a') \in \ker \beta. And g(bf(a))=g(b)g(f(a))=c0=cg'(b' - f'(a')) = g'(b') - g'(f'(a')) = c' - 0 = c'. So c=gˉ(bf(a))c' = \bar{g'}(b' - f'(a')).


Step 5: Exactness at cokerα\mathrm{coker}\, \alpha

ProofExactness at coker alpha

We show imδ=kerfˉ\mathrm{im}\, \delta = \ker \bar{f}.

imδkerfˉ\mathrm{im}\, \delta \subseteq \ker \bar{f}: Let ckerγc' \in \ker \gamma with δ(c)=[a]\delta(c') = [a], where f(a)=β(b)f(a) = \beta(b') for a lift bb' of cc'. Then fˉ([a])=[f(a)]=[β(b)]=0\bar{f}([a]) = [f(a)] = [\beta(b')] = 0 in cokerβ\mathrm{coker}\, \beta.

kerfˉimδ\ker \bar{f} \subseteq \mathrm{im}\, \delta: Let [a]cokerα[a] \in \mathrm{coker}\, \alpha with fˉ([a])=0\bar{f}([a]) = 0, i.e., f(a)imβf(a) \in \mathrm{im}\, \beta. Write f(a)=β(b)f(a) = \beta(b') for some bBb' \in B'. Set c=g(b)c' = g'(b'). Then γ(c)=γ(g(b))=g(β(b))=g(f(a))=0\gamma(c') = \gamma(g'(b')) = g(\beta(b')) = g(f(a)) = 0, so ckerγc' \in \ker \gamma. By construction, δ(c)=[a]\delta(c') = [a].


Step 6: Exactness at cokerβ\mathrm{coker}\, \beta

ProofExactness at coker beta

Similar to Step 3, using the dual argument. We omit the details. \square


Summary

RemarkThe snake

The connecting homomorphism δ\delta "snakes" through the diagram: it starts at kerγ\ker \gamma (upper right), goes left via lifting, goes down via β\beta, goes left again via lifting through ff, and ends at cokerα\mathrm{coker}\, \alpha (lower left). This snake-like path through the diagram gives the lemma its name.

RemarkApplications

The Snake Lemma is used to construct:

  1. The long exact sequence in cohomology from a SES of complexes.
  2. Long exact sequences for derived functors (Ext\mathrm{Ext}, Tor\mathrm{Tor}, sheaf cohomology).
  3. The connecting homomorphism in the Mayer-Vietoris sequence.