Nine lemma (3×3 lemma)
Let be an abelian category . Consider a commutative diagram
whose columns and first two rows are exact (equivalently, short exact in each line).
Nine lemma (one common form). If the three columns and the first two rows are exact, then the third row
is exact as well. Dually, if the three rows and the first two columns are exact, then the third column is exact.
This lemma is often proved by diagram chase using the snake lemma (or via a systematic kernel/cokernel argument in an abelian category). It is a basic tool for proving exactness statements about constructions built from short exact sequences.
Examples
Example 1 (modules: quotienting a short exact sequence)
Let be a ring and an -module. Fix submodules and a further submodule . Consider the diagram with rows/columns induced by inclusions and quotient maps:
The first two rows and all columns are exact by standard submodule/quotient arguments (see exact sequences of modules ). The nine lemma then gives exactness of the third row, i.e. a canonical short exact sequence describing the quotient in terms of intersections with .
Example 2 (abelian groups: a concrete 3×3 diagram)
Take . Consider
and build the middle row as , with vertical maps the evident multiplications making the squares commute. With the columns chosen as the evident short exact sequences, the nine lemma forces exactness of the bottom row once the other eight sequences are checked.
Example 3 (recognizing exactness via kernels/cokernels)
In any abelian category, if you know eight out of the nine sequences are exact, the ninth often follows immediately. For instance, if you have computed kernels and cokernels in the first two rows/columns and verified the commutativity, nine lemma saves a separate check that and that is an epimorphism.