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:

A′→f′B′→g′C′→0↓α↓β↓γ0→A→fB→gC\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 f′f' and g′g'. 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 g′g'.

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 a∈im α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 c′∈ker⁡γc' \in \ker \gamma, so γ(c′)=0\gamma(c') = 0.

Lift: Since g′g' is surjective, choose b′∈B′b' \in B' with g′(b′)=c′g'(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′)∈ker⁡g=im f\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 a∈Aa \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 b1′b_1' is another lift: g′(b1′)=c′g'(b_1') = c'. Then g′(b′−b1′)=0g'(b' - b_1') = 0, so b′−b1′∈ker⁡g′=im f′b' - b_1' \in \ker g' = \mathrm{im}\, f'. Write b′−b1′=f′(a′)b' - b_1' = f'(a') for some a′∈A′a' \in A'. Then the corresponding elements a,a1∈Aa, a_1 \in A differ by: f(a−a1)=β(b′−b1′)=β(f′(a′))=f(α(a′))f(a - a_1) = \beta(b' - b_1') = \beta(f'(a')) = f(\alpha(a')). Since ff is injective, a−a1=α(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 a′∈ker⁡α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 b′∈ker⁡βb' \in \ker \beta with g′(b′)=0g'(b') = 0. By exactness of the top row at B′B', b′=f′(a′)b' = f'(a') for some a′∈A′a' \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 a′∈ker⁡α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 b′∈ker⁡βb' \in \ker \beta, and set c′=g′(b′)c' = g'(b'). To compute δ(c′)\delta(c'), we can use b′b' 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 c′∈ker⁡γc' \in \ker \gamma with δ(c′)=0\delta(c') = 0. Using a lift b′b' with g′(b′)=c′g'(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 a′a'. Then β(b′)=f(α(a′))=β(f′(a′))\beta(b') = f(\alpha(a')) = \beta(f'(a')), so β(b′−f′(a′))=0\beta(b' - f'(a')) = 0, meaning b′−f′(a′)∈ker⁡βb' - f'(a') \in \ker \beta. And g′(b′−f′(a′))=g′(b′)−g′(f′(a′))=c′−0=c′g'(b' - f'(a')) = g'(b') - g'(f'(a')) = c' - 0 = c'. So c′=g′ˉ(b′−f′(a′))c' = \bar{g'}(b' - f'(a')).

■

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

ProofExactness at coker alpha

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

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

ker⁡fˉ⊆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 b′∈B′b' \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 c′∈ker⁡γ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.