ProofComplete

Proof of the Long Exact Sequence in Homology

We prove that a short exact sequence of chain complexes gives rise to a long exact sequence in homology. This is the fundamental algebraic engine behind the long exact sequence of a pair.


Setup

Let 0AiBjC00 \to A_* \xrightarrow{i} B_* \xrightarrow{j} C_* \to 0 be a short exact sequence of chain complexes of abelian groups. That is, for each nn, the sequence 0AninBnjnCn00 \to A_n \xrightarrow{i_n} B_n \xrightarrow{j_n} C_n \to 0 is exact, and ii, jj commute with the boundary maps.


The Long Exact Sequence

Proof

Theorem: The short exact sequence 0AiBjC00 \to A_* \xrightarrow{i} B_* \xrightarrow{j} C_* \to 0 induces a long exact sequence Hn(A)iHn(B)jHn(C)Hn1(A)\cdots \to H_n(A) \xrightarrow{i_*} H_n(B) \xrightarrow{j_*} H_n(C) \xrightarrow{\partial_*} H_{n-1}(A) \to \cdots

Construction of \partial_*:

Let [c]Hn(C)[c] \in H_n(C) be represented by a cycle cCnc \in C_n with Cc=0\partial^C c = 0. Since jnj_n is surjective, choose bBnb \in B_n with jn(b)=cj_n(b) = c. Then jn1(Bb)=C(jn(b))=Cc=0j_{n-1}(\partial^B b) = \partial^C (j_n(b)) = \partial^C c = 0 so Bbkerjn1=imin1\partial^B b \in \ker j_{n-1} = \operatorname{im}\, i_{n-1}. Since in1i_{n-1} is injective, there exists a unique aAn1a \in A_{n-1} with in1(a)=Bbi_{n-1}(a) = \partial^B b.

We claim aa is a cycle: in2(Aa)=B(in1(a))=B(Bb)=0i_{n-2}(\partial^A a) = \partial^B(i_{n-1}(a)) = \partial^B(\partial^B b) = 0, and injectivity of in2i_{n-2} gives Aa=0\partial^A a = 0.

Define [c]=[a]Hn1(A)\partial_*[c] = [a] \in H_{n-1}(A).

Well-definedness of \partial_*:

Suppose bBnb' \in B_n also satisfies jn(b)=cj_n(b') = c. Then jn(bb)=0j_n(b - b') = 0, so bb=in(a0)b - b' = i_n(a_0) for some a0Ana_0 \in A_n. Then the corresponding elements differ by B(bb)=in1(Aa0)\partial^B(b - b') = i_{n-1}(\partial^A a_0), so the two choices of aa differ by the boundary Aa0\partial^A a_0, giving the same homology class.

If c=Ccc = \partial^C c' for some cCn+1c' \in C_{n+1}, choose bBn+1b' \in B_{n+1} with jn+1(b)=cj_{n+1}(b') = c'. Then jn(Bb)=cj_n(\partial^B b') = c, so we may take b=Bbb = \partial^B b', giving Bb=0\partial^B b = 0 and hence a=0a = 0. Thus \partial_* vanishes on boundaries.

Exactness at Hn(B)H_n(B) (i.e., kerj=imi\ker j_* = \operatorname{im}\, i_*):

If [b]=i[a][b] = i_*[a], then b=i(a)+Bbb = i(a) + \partial^B b', so jn(b)=jn(Bb)=C(j(b))j_n(b) = j_n(\partial^B b') = \partial^C(j(b')), giving j[b]=0j_*[b] = 0. Conversely, if j[b]=0j_*[b] = 0, then j(b)=Ccj(b) = \partial^C c' for some cc'. Lift cc' to bBn+1b' \in B_{n+1} and note j(bBb)=0j(b - \partial^B b') = 0, so bBb=i(a)b - \partial^B b' = i(a) for some cycle aa, giving [b]=i[a][b] = i_*[a].

Exactness at Hn(C)H_n(C) (i.e., ker=imj\ker \partial_* = \operatorname{im}\, j_*):

If [c]=j[b][c] = j_*[b] with Bb=0\partial^B b = 0, then [c]=0\partial_*[c] = 0 since we can choose the lift bb with Bb=0\partial^B b = 0, giving a=0a = 0. Conversely, if [c]=0\partial_*[c] = 0, then a=Aaa = \partial^A a', so Bb=i(Aa)=B(i(a))\partial^B b = i(\partial^A a') = \partial^B(i(a')). Then bi(a)b - i(a') is a cycle in BnB_n mapping to cc, giving [c]=j[bi(a)][c] = j_*[b - i(a')].

Exactness at Hn1(A)H_{n-1}(A) (i.e., keri=im\ker i_* = \operatorname{im}\, \partial_*):

Given [c]=[a]\partial_*[c] = [a], we have i(a)=Bbi(a) = \partial^B b, so i[a]=0i_*[a] = 0. Conversely, if i[a]=0i_*[a] = 0, then i(a)=Bbi(a) = \partial^B b for some bBnb \in B_n. Set c=j(b)c = j(b); then Cc=j(Bb)=j(i(a))=0\partial^C c = j(\partial^B b) = j(i(a)) = 0 and [c]=[a]\partial_*[c] = [a].

This completes the proof of exactness at every node. \square


RemarkNaturality

The connecting homomorphism \partial_* is natural: given a morphism of short exact sequences, the induced ladder of long exact sequences commutes. This follows from the uniqueness in the construction of \partial_*.