Description

The snake lemma is a tool from homological algebra, used to calculate the connecting homomorphism in a Long exact sequence.

\[\begin{tikzcd}
	& A & B & C & 0 \\
	0 & {A'} & {B'} & {C'}
	\arrow["f", from=1-2, to=1-3]
	\arrow["a"{description}, from=1-2, to=2-2]
	\arrow["g", from=1-3, to=1-4]
	\arrow["b"{description}, from=1-3, to=2-3]
	\arrow[from=1-4, to=1-5]
	\arrow["c"{description}, from=1-4, to=2-4]
	\arrow[from=2-1, to=2-2]
	\arrow["{f'}", from=2-2, to=2-3]
	\arrow["{g'}", from=2-3, to=2-4]
\end{tikzcd}\]

Definition

Let the above be a commutative diagram of Abelian groups where both lines are exact sequences. Then the snake lemma tells us that there is a Long exact sequence where is the connected homomorphism often encountered in algebraic topology.

Proof: We will only prove the existence of the connecting homomorphism. Let be an element of . Because is surjective, there is a s.t. . Pushing down along gives us an element . Because lies in , by commutativity, we have so by exactness we can find an element representing this element. This will then be mapped down to giving us the cokernel. However, it is not clear whether this is natural. We do the proof, that it is natural. Take a different choice s.t. . Then and therefore . Exactness tells us that there is an with . We push down along and pull back along to get . Due to the injectivity of and the commutativity of the diagram this must be the image of under . It follows that is part of the image of and trivial in the cokernel. In different words, and map to the same element in the cokernel.

The proof of the snake lemma is important. The snake lemma tells us that the connecting map exists and that the construction is natural but we need the proof to actually do the construction.

Properties

Tip

Examples

Example