1 Introduction to the Five Lemma

1.1 Commutative diagrams and exact sequences

The Five Lemma belongs to the standard toolkit of homological algebra, where one studies how algebraic properties pass through commutative diagrams. Its environment is typically that of exact sequences—strings of morphisms in an abelian category (or more generally an additive category with a suitable exactness notion)—together with vertical maps linking two such sequences. The lemma asserts that, under precise hypotheses on the vertical morphisms and compatibility with exactness, the induced middle morphism must be an isomorphism.

Exact sequences encode “cancellation” information: image and kernel coincide at each stage. When two exact sequences are arranged in parallel and related by a commutative diagram, the exactness constraints force strong compatibility between the vertical maps. The Five Lemma makes this idea quantitative.

1.2 Typical statement and intuition

In its most common form, one considers a commutative diagram with two horizontal exact sequences and three relevant vertical morphisms in the “middle band.” If the vertical maps at the outer positions are isomorphisms, and if appropriate injectivity and surjectivity conditions hold at the adjacent positions, then the middle vertical morphism is forced to be an isomorphism as well.

Intuitively, injectivity on one side prevents nontrivial kernel from surviving, while surjectivity on the other side prevents nontrivial cokernel from surviving. Exactness ensures that any candidate kernel or cokernel would have to map into parts controlled by the outer morphisms, which are already isomorphisms.

The Five Lemma is closely related to the Four Lemma and the Snake Lemma. The Four Lemma provides an isomorphism criterion with fewer objects, while the Snake Lemma analyzes kernels and cokernels arising from a short exact sequence diagram. The Five Lemma can be viewed as a higher-level isomorphism test often applied after assembling long exact sequences (for instance, those coming from derived functors).

Together, these lemmas form a family of diagrammatic arguments: one first reduces the problem to verifying injectivity, surjectivity, or vanishing of kernels/cokernels; then the lemma converts those checks into an isomorphism conclusion.

2 Preliminaries

2.1 Abelian categories and exactness

Most formulations of the Five Lemma are stated in an abelian category, where notions like kernels, cokernels, and exactness behave predictably. In an abelian category, an exact sequence \[ 0 \to A \to B \to C \to 0 \] means that the first map is a monomorphism with kernel equal to the image of the previous map (and similarly on the other end), and more generally for longer sequences.

Exactness is used to identify subobjects such as \(\ker\) and \(\operatorname{im}\). The Five Lemma relies on these identifications to track what happens to elements (or morphisms) under the commuting diagram.

2.2 Morphisms, kernels, and cokernels

Given a morphism \(f: X \to Y\), its kernel \(\ker(f)\) is the universal object mapping to \(X\) such that the composite is zero, and its cokernel \(\operatorname{coker}(f)\) has the corresponding universal property for maps out of \(Y\) annihilating \(f\). In abelian categories, exactness statements are often equivalent to statements about kernels and cokernels.

The Five Lemma proof typically proceeds by showing that a candidate element in the kernel of the middle map must vanish, and similarly that every element in the cokernel of that middle map is trivial. This is done by transporting kernel/cokernel data through the diagram using commutativity and the outer morphism hypotheses.

2.3 Commutativity requirements in diagrammatic arguments

The lemma requires a commutative diagram in the categorical sense: each small square commutes, ensuring that composites along different paths agree. This commutativity is what makes kernel and image computations compatible across the two rows.

Without commutativity, one cannot conclude that a morphism that vanishes after applying one horizontal map also vanishes after translating through the other horizontal map. Hence, the commutative structure is essential for the diagram chase or for the kernel/cokernel argument.

3 The Standard Five Lemma

3.1 Setup: two parallel exact sequences

Consider a commutative diagram in an abelian category of the form \[ \begin{array}{ccccccccc} A_1 & \xrightarrow{f_1} & A_2 & \xrightarrow{f_2} & A_3 & \xrightarrow{f_3} & A_4 & \xrightarrow{f_4} & A_5 \\ \downarrow^{\alpha_1} & & \downarrow^{\alpha_2} & & \downarrow^{\alpha_3} & & \downarrow^{\alpha_4} & & \downarrow^{\alpha_5} \\ B_1 & \xrightarrow{g_1} & B_2 & \xrightarrow{g_2} & B_3 & \xrightarrow{g_3} & B_4 & \xrightarrow{g_4} & B_5, \end{array} \] where both horizontal rows are exact: \[ A_1 \xrightarrow{f_1} A_2 \xrightarrow{f_2} A_3 \xrightarrow{f_3} A_4 \xrightarrow{f_4} A_5, \quad B_1 \xrightarrow{g_1} B_2 \xrightarrow{g_2} B_3 \xrightarrow{g_3} B_4 \xrightarrow{g_4} B_5. \] The vertical maps \(\alpha_i: A_i \to B_i\) make all squares commute.

The “middle vertical morphism” is \(\alpha_3: A_3 \to B_3\). The Five Lemma gives conditions under which \(\alpha_3\) must be an isomorphism.

3.2 Hypotheses on the outer vertical morphisms

A standard version assumes that the outermost vertical morphisms are isomorphisms: \[ \alpha_1 \text{ is an isomorphism}, \qquad \alpha_5 \text{ is an isomorphism}. \] These boundary conditions ensure that the extremes of the diagram match perfectly. Exactness then propagates this rigidity toward the center.

3.3 Hypotheses on the middle vertical morphism

The intermediate hypotheses typically require that the adjacent vertical morphisms satisfy injectivity/surjectivity properties: \[ \alpha_2 \text{ is surjective}, \qquad \alpha_4 \text{ is injective}. \] Together with the isomorphism assumptions on \(\alpha_1\) and \(\alpha_5\), these conditions control both kernel and cokernel behavior of \(\alpha_3\).

A common package of assumptions is therefore:

  • \(\alpha_1\) and \(\alpha_5\) are isomorphisms,
  • \(\alpha_2\) is surjective,
  • \(\alpha_4\) is injective.

Under these hypotheses, one concludes that \(\alpha_3\) is an isomorphism.

3.4 Conclusion: isomorphism criteria

The conclusion is that the middle vertical map \(\alpha_3: A_3 \to B_3\) is an isomorphism. Equivalently, \(\alpha_3\) is both injective and surjective.

The mechanism is that exactness identifies \(\ker(f_3)\) with \(\operatorname{im}(f_2)\) and \(\operatorname{coker}(f_2)\) with \(\ker(f_3)\) in the appropriate way, allowing the outer isomorphisms to eliminate possible obstructions.

4 Variants and Generalizations

4.1 The short five lemma

A “short five lemma” variant applies to shorter exact sequences, often to diagrams involving just three morphisms in each row. The precise formulation depends on how the exactness hypotheses are arranged, but the core idea persists: outer maps are assumed to be isomorphisms while the remaining side maps are constrained by injectivity or surjectivity so that the central map becomes an isomorphism.

This version is useful when long exact sequences can be reduced or when the objects involved form a smaller exact diagram.

4.2 Dual statements (co-kernel/cokernel form)

There is a dual statement obtained by reversing arrows. In abelian categories, “injective/surjective” conditions swap under duality, and “kernel/image” becomes “cokernel/coimage” in the appropriate sense. Concretely, one can formulate a version where the roles of injectivity and surjectivity of adjacent vertical maps are exchanged, while the outer vertical morphisms remain isomorphisms.

This duality reflects that exactness is self-dual in abelian categories: statements about kernels correspond to statements about cokernels under reversal.

4.3 Strengthening/weakened hypothesis versions

Various authors present alternative hypothesis sets that still guarantee the central isomorphism. For example:

  • One may replace surjectivity or injectivity requirements by conditions involving vanishing of certain kernels or cokernels.
  • Under additional structural assumptions (such as splitting exact sequences), weaker conditions may suffice.
  • In some contexts, one can substitute pointwise conditions on induced maps between subquotients.

The general theme is that the Five Lemma is not merely a single statement but a template: exactness plus commutativity plus enough control at the periphery forces the middle map to be an isomorphism.

5 Proof Methods

5.1 Diagram chasing approach

One common proof is a diagram chase. To show injectivity of \(\alpha_3\), suppose an element \(x \in A_3\) satisfies \(\alpha_3(x)=0\) in \(B_3\). Using exactness, one expresses \(x\) through images of adjacent morphisms in the top row, then uses commutativity to show its image under \(\alpha_2\) (or \(\alpha_4\)) satisfies a corresponding vanishing property in the bottom row. The boundary isomorphism hypotheses then force \(x=0\).

A symmetric argument proves surjectivity of \(\alpha_3\): given \(y \in B_3\), exactness decomposes \(y\) into an image from \(B_2\) and/or maps toward \(B_4\). One then lifts the relevant part through \(\alpha_1\), \(\alpha_2\), and \(\alpha_5\), and uses commutativity to ensure the constructed preimage maps correctly to \(y\).

Although the details depend on the exact arrangement of maps, the chase repeatedly uses: 1) exactness to rewrite “zero” or “being in the image,” and 2) commutativity to translate those relations across the vertical maps.

5.2 Kernel and cokernel arguments

An alternative proof works directly with kernels and cokernels. One analyzes \(\ker(\alpha_3)\) by showing it maps to \(\ker(\alpha_4)\) or \(\ker(\alpha_2)\) through natural morphisms induced from the exact rows. Because \(\alpha_4\) is injective and the outer maps are isomorphisms, the relevant kernel must be trivial, implying \(\ker(\alpha_3)=0\).

Similarly, \(\operatorname{coker}(\alpha_3)\) is shown to inject into or surject from cokernels governed by \(\alpha_2\) and \(\alpha_4\). The surjectivity/injectivity assumptions at the adjacent positions plus isomorphism on the outside force \(\operatorname{coker}(\alpha_3)=0\).

This method emphasizes universal properties and avoids element-level reasoning, aligning well with categorical preferences.

5.3 Use of universal properties

In categorical terms, kernels and cokernels are defined by universal mapping properties. The commutative diagram ensures that maps factoring through kernels/cokernels in the top row also factor through the corresponding kernels/cokernels in the bottom row. With the outer morphisms being isomorphisms, one can argue that the middle map must satisfy the universal constraints of both kernel and cokernel objects, leaving no room for nontrivial kernel or cokernel.

This approach often produces cleaner, diagrammatic proofs for audiences comfortable with categorical abstractions, and it generalizes more easily to enriched settings.

6 Applications

6.1 Comparing long exact sequences

A frequent use of the Five Lemma is in comparing long exact sequences arising from derived constructions. Suppose a functor produces a long exact sequence from a short exact sequence, and one has a morphism between the underlying short exact sequences. Applying the functor yields a ladder of long exact sequences connected by natural transformations, producing commutative diagrams where exactness holds at each stage.

In such situations, one may know that most vertical maps are isomorphisms (or have controlled injectivity/surjectivity) by induction on degrees or by previously established results. The Five Lemma then upgrades these partial facts to an isomorphism at a specific degree.

6.2 Showing induced maps are isomorphisms

Another application is to show that a morphism induced by a chain map (or by a natural transformation) yields an isomorphism on certain homological invariants. After passing to homology or cohomology, one typically obtains exact sequences connecting homology groups of related objects. The Five Lemma is then used as a final step once boundary maps are shown to be isomorphisms and adjacent maps satisfy injectivity/surjectivity bounds.

This is especially common when proving equivalences of functors between derived categories or when establishing that a transformation is an isomorphism on homology groups.

6.3 Five lemma in practice: common proof patterns

In practical computations, the Five Lemma is rarely used in isolation. Typical patterns include:

  • establishing isomorphisms on outer terms via prior lemmas,
  • proving injectivity/surjectivity of the adjacent terms using a splitting argument or a separate exactness computation,
  • assembling the relevant portion of a long exact sequence into a five-term diagram,
  • concluding the middle map is an isomorphism.

These patterns show up repeatedly in proofs that compare resolutions, spectral sequences at certain pages, or equivalences induced by homotopies.

7 Examples

7.1 A concrete diagram chase example

Consider two exact sequences of abelian groups: \[ A_1 \to A_2 \to A_3 \to A_4 \to A_5, \qquad B_1 \to B_2 \to B_3 \to B_4 \to B_5, \] linked by vertical maps \(\alpha_i\) forming a commutative diagram. Suppose \(\alpha_1\) and \(\alpha_5\) are isomorphisms, \(\alpha_2\) is surjective, and \(\alpha_4\) is injective. To prove \(\alpha_3\) injective, take \(x \in A_3\) with \(\alpha_3(x)=0\). Because the bottom row is exact, \(x\) corresponds to an element in the image of \(A_2 \to A_3\), and the commutativity forces the corresponding image element in \(B_3\) to lie in the relevant kernel. Exactness in the bottom row then implies that the element in \(B_2\) comes from \(B_1\), and the isomorphism on \(\alpha_1\) lifts this back to the top row, forcing \(x=0\). An analogous chase for surjectivity uses the surjectivity of \(\alpha_2\) and the isomorphism at the right end.

While the specific element computations depend on the maps, the chase follows a consistent structure: translate kernel/cokernel conditions into image/kernel conditions via exactness, then use the outer isomorphisms to conclude.

7.2 Application to a functor-induced diagram

Let \(F\) be an additive functor that takes a commutative diagram of short exact sequences to a commutative diagram. Assume one knows that \(F\) induces isomorphisms on the outer terms of the resulting long exact sequences and that the morphisms in adjacent degrees satisfy the needed injectivity/surjectivity properties (often by induction or by checking low-degree cases directly).

By extracting the relevant portion of the long exact sequence and arranging it into a five-term ladder diagram, the Five Lemma yields that the map induced by \(F\) is an isomorphism on the middle homology/cohomology group. This is a standard way to turn “almost all degrees” information into a full isomorphism statement at a specific degree.

7.3 Handling cases where only injective/surjective are known

In many arguments, one can prove only partial information about vertical maps. For instance, one might know that a map on the left portion is surjective and that a map on the right portion is injective, while outer maps are already known to be isomorphisms. The Five Lemma is designed precisely for these situations: it translates the mixture of surjectivity and injectivity into the missing isomorphism property at the center.

If instead one knows surjectivity on both adjacent maps or injectivity on both, a direct application may fail, but a variant (or a dual version) might apply depending on the direction of arrows and the exactness placement. This flexibility is why the lemma is often used repeatedly with minor adjustments.

8 Notes and Further Reading

8.1 Connections to the snake lemma and four lemma

The Snake Lemma is often used to analyze kernels and cokernels of maps induced by commutative diagrams with exact rows, especially in short exact sequence settings. From the Snake Lemma, one can sometimes derive the Four Lemma, which in turn can lead to the Five Lemma through iterative application.

Conceptually, the Five Lemma can be interpreted as an isomorphism criterion that arises when the Snake Lemma’s kernel/cokernel outputs are forced to vanish by boundary isomorphism assumptions.

8.2 Historical and pedagogical perspectives

The Five Lemma is part of the classical diagram-chasing tradition in homological algebra. It is frequently taught early because it illustrates how exactness and commutativity interplay and because it provides a reusable strategy: reduce a goal about isomorphisms to manageable statements about injective and surjective behavior at adjacent stages.

Pedagogically, it functions as a bridge from concrete element-level diagram chase to more abstract categorical reasoning.

Standard references include textbooks that cover homological algebra and derived functors, where the lemma appears alongside the Snake Lemma, Four Lemma, and standard tools for exact sequences. Readers often encounter multiple presentations—element-based, kernel/cokernel-based, and categorical—reflecting different emphases in exposition.

For further study, it is helpful to consult sections on exact sequences in abelian categories, long exact sequences in homology/cohomology, and standard comparison arguments in derived functor settings.