Five lemma
The five lemma is a standard diagram-chase tool in -modules and, more generally, in any abelian category . It strengthens the injectivity/surjectivity conclusions of the four lemma and is often used alongside the snake lemma .
Theorem (Five lemma)
Consider a commutative diagram with exact rows
Assume:
- are isomorphisms,
- is an epimorphism and is a monomorphism (in module terms: is surjective and is injective).
Then is an isomorphism.
(There are common variants with slightly different hypotheses; a frequent special case is when the sequences begin and end with , so surjectivity/injectivity assumptions are automatic.)
See also five lemma corollary for standard “short exact sequence” consequences.
Examples
Two-out-of-three for quasi-isomorphisms in a short exact sequence of complexes.
Supposeare short exact sequences of chain complexes , and we have a morphism between them inducing a commutative diagram of long exact sequences in homology .
If the induced maps and are isomorphisms for all , then the induced maps are isomorphisms for all , by applying the five lemma degree-by-degree to the long exact homology sequences.Comparing Tor groups via a map of short exact sequences.
Given a morphism between short exact sequencesand a fixed module , naturality of the long exact Tor sequence gives a morphism of long exact sequences
If the induced maps and are isomorphisms for all relevant neighboring terms (for instance, if and are isomorphisms), then the five lemma implies is an isomorphism as well.
Comparing Ext groups (same pattern).
With the same setup, applying the long exact Ext sequence and using the five lemma shows that if the induced maps on the surrounding and terms are isomorphisms, then the middle -map is an isomorphism. This is a standard way to propagate isomorphisms through long exact sequences.