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 0→A∗iB∗jC∗→0 be a short exact sequence of chain complexes of abelian groups. That is, for each n, the sequence 0→AninBnjnCn→0 is exact, and i, j commute with the boundary maps.
The Long Exact Sequence
Proof
Theorem: The short exact sequence 0→A∗iB∗jC∗→0 induces a long exact sequence
⋯→Hn(A)i∗Hn(B)j∗Hn(C)∂∗Hn−1(A)→⋯
Construction of ∂∗:
Let [c]∈Hn(C) be represented by a cycle c∈Cn with ∂Cc=0. Since jn is surjective, choose b∈Bn with jn(b)=c. Then
jn−1(∂Bb)=∂C(jn(b))=∂Cc=0
so ∂Bb∈kerjn−1=imin−1. Since in−1 is injective, there exists a unique a∈An−1 with in−1(a)=∂Bb.
We claim a is a cycle: in−2(∂Aa)=∂B(in−1(a))=∂B(∂Bb)=0, and injectivity of in−2 gives ∂Aa=0.
Define ∂∗[c]=[a]∈Hn−1(A).
Well-definedness of ∂∗:
Suppose b′∈Bn also satisfies jn(b′)=c. Then jn(b−b′)=0, so b−b′=in(a0) for some a0∈An. Then the corresponding elements differ by ∂B(b−b′)=in−1(∂Aa0), so the two choices of a differ by the boundary ∂Aa0, giving the same homology class.
If c=∂Cc′ for some c′∈Cn+1, choose b′∈Bn+1 with jn+1(b′)=c′. Then jn(∂Bb′)=c, so we may take b=∂Bb′, giving ∂Bb=0 and hence a=0. Thus ∂∗ vanishes on boundaries.
Exactness at Hn(B) (i.e., kerj∗=imi∗):
If [b]=i∗[a], then b=i(a)+∂Bb′, so jn(b)=jn(∂Bb′)=∂C(j(b′)), giving j∗[b]=0. Conversely, if j∗[b]=0, then j(b)=∂Cc′ for some c′. Lift c′ to b′∈Bn+1 and note j(b−∂Bb′)=0, so b−∂Bb′=i(a) for some cycle a, giving [b]=i∗[a].
Exactness at Hn(C) (i.e., ker∂∗=imj∗):
If [c]=j∗[b] with ∂Bb=0, then ∂∗[c]=0 since we can choose the lift b with ∂Bb=0, giving a=0. Conversely, if ∂∗[c]=0, then a=∂Aa′, so ∂Bb=i(∂Aa′)=∂B(i(a′)). Then b−i(a′) is a cycle in Bn mapping to c, giving [c]=j∗[b−i(a′)].
Exactness at Hn−1(A) (i.e., keri∗=im∂∗):
Given ∂∗[c]=[a], we have i(a)=∂Bb, so i∗[a]=0. Conversely, if i∗[a]=0, then i(a)=∂Bb for some b∈Bn. Set c=j(b); then ∂Cc=j(∂Bb)=j(i(a))=0 and ∂∗[c]=[a].
This completes the proof of exactness at every node. □
■
RemarkNaturality
The connecting homomorphism ∂∗ 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 ∂∗.