Math 2.0

Category theory; homological algebra Homological algebra: complexes and exact sequences Lemma

Four lemma

Builds on Abelian categoryExact sequenceCommutative diagramMonomorphismEpimorphismFreyd–Mitchell embedding theoremPseudo-element

Statement

Let 𝒜\mathcal{A} be an abelian category, such as the category of modules over a ring. Consider a commutative diagram A→B→C→D↓α↓β↓γ↓δA′→B′→C′→D′\begin{array}{ccccccc} A & \to & B & \to & C & \to & D \\ \downarrow{\scriptstyle \alpha} & & \downarrow{\scriptstyle \beta} & & \downarrow{\scriptstyle \gamma} & & \downarrow{\scriptstyle \delta} \\ A' & \to & B' & \to & C' & \to & D' \end{array} in 𝒜\mathcal{A} whose two rows are exact.

  1. If α\alpha is an epimorphism and β\beta and δ\delta are monomorphisms, then γ\gamma is a monomorphism.
  2. If δ\delta is a monomorphism and α\alpha and γ\gamma are epimorphisms, then β\beta is an epimorphism.

Remarks

Part 1 is a diagram chase. Let the row maps be r ⁣:A→Br \colon A \to B, s ⁣:B→Cs \colon B \to C, t ⁣:C→Dt \colon C \to D and r′,s′,t′r', s', t' below. If γ(x)=0\gamma(x) = 0 for x∈Cx \in C, then δ(t(x))=t′(γ(x))=0\delta(t(x)) = t'(\gamma(x)) = 0, so t(x)=0t(x) = 0 and x=s(y)x = s(y) for some y∈By \in B. Then s′(β(y))=0s'(\beta(y)) = 0, so β(y)=r′(u′)\beta(y) = r'(u') with u′=α(u)u' = \alpha(u) for some u∈Au \in A; now β(y−r(u))=0\beta(y - r(u)) = 0, so y=r(u)y = r(u) and x=s(r(u))=0x = s(r(u)) = 0. Part 2 is the dual statement, obtained by reversing all arrows. Example: take A=A′=0A = A' = 0, so that the rows are exact sequences 0→B→C→D0 \to B \to C \to D and 0→B′→C′→D′0 \to B' \to C' \to D'. If β\beta and δ\delta are monomorphisms, part 1 shows that γ\gamma is a monomorphism.

Going deeper

For a student

The two parts are proved by element chasing in modules, and hold in every abelian category by the Freyd–Mitchell embedding theorem or by pseudo-elements. Applying part 1 to the left four columns and part 2 to the right four columns of a five-column ladder gives the five lemma. The four lemma is useful when only one of injectivity or surjectivity is needed, so fewer hypotheses have to be checked.

Reading path

To understand this page from the ground up, read these 20 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Abelian category concept
  2. Adjoint functors concept
  3. Commutative diagram concept
  4. Epimorphism concept
  5. Exact functor concept
  6. Exact sequence concept
  7. Full and faithful functors concept
  8. Functor concept
  9. Generator concept
  10. Grothendieck category concept
  11. Hom functor concept
  12. Module over a ring concept
  13. Monomorphism concept
  14. Pseudo-element concept
  15. Ring concept
  16. Serre subcategory concept
  17. Category of modules example
  18. Gabriel–Popescu theorem statement
  19. Freyd–Mitchell embedding theorem statement
  20. Four lemma statement

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Five_lemma
About this page
TagJMCKACGCQ0
URIm2://JMCKACGCQ0
Kindstatement, lemma
WritingW0 stub
MSC18G35, 18E10
StatusThis copy of the site has no build data. Run m2 status JMCKACGCQ0.
AboutExact sequence
UsesAbelian category, Exact sequence, Commutative diagram, Monomorphism, Epimorphism, Freyd–Mitchell embedding theorem, Pseudo-element
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by