Connecting homomorphism (boundary map) lemma
Connecting homomorphisms are the maps that “link” adjacent degrees in a long exact sequence, and they are the key output of diagram chasing (compare snake lemma ).
Connecting map for a short exact sequence of chain complexes
Let
be a short exact sequence of chain complexes in an abelian category (in particular, this holds for -modules). Then there is a natural long exact sequence in homology :
where is the connecting homomorphism.
Explicit construction of
Given a class , choose a cycle representative .
- Pick with (possible since is degreewise surjective).
- Since is a cycle, , so .
- Choose with .
- One checks is a cycle and that its homology class is independent of all choices.
Define .
This is the mechanism behind the connecting maps in long exact sequences from derived functors , such as Tor and Ext long exact sequences.
Examples
Example 1 (Tor: identifying the connecting map with a kernel)
In , start with
and tensor with . Because tensor is right exact , you get an exact sequence
Exactness forces
so identifies with the -torsion in , which is cyclic of order .
Example 2 (Ext: boundary map from a short exact sequence in the second variable)
Given a short exact sequence , applying the left exact functor \(\operatorname{Hom}_R(M,-)\) produces a connecting map
appearing in the long exact Ext sequence . Concretely, a map defines a pullback extension of by , and is precisely its class in (compare Ext\(^1\) classifies extensions ).
Example 3 (homology of a mapping cone short exact sequence)
Given a chain map , there is a short exact sequence of complexes
The connecting homomorphism in the associated long exact sequence recovers the map on homology induced by . This is a standard way to package “” as a boundary map.