Five lemma¶

Infer that the middle vertical morphism in a commutative five-object diagram with exact rows is an isomorphism when the two neighboring outer maps meet the required isomorphism, epimorphism, and monomorphism conditions.

Version: v2 · 2026-08-30 · History
Domain-specific #: 1846
Origin domain: homological algebra
Subdomain: exact sequence diagram lemmas

Core Idea¶

The five lemma states, in its standard form, that in a commutative diagram of exact five-term rows, if the second and fourth vertical maps are isomorphisms, the first is an epimorphism, and the fifth is a monomorphism, then the middle vertical map is an isomorphism.^[1] The two four-lemma directions or an element chase use exactness to move a target or kernel element through neighboring objects, commutativity to transfer it between rows, and the outer mono, epi, and isomorphism hypotheses to establish surjectivity and injectivity of the middle map.

Its autonomous residual is the exact five-position commutative-diagram implication with its asymmetric outer mono and epi conditions, not every diagram chase, all comparison theorems, or a conclusion from four arbitrary isomorphisms. The identity fails when row exactness is missing, a square fails to commute, the outer mono and epi are reversed, the central conclusion is assumed in a circular argument, or an abelian-category proof is exported to a weaker category without a valid variant.

Recognition requires an analyst to draw and label all ten objects and arrows, verify exactness at each used position, verify commutativity square by square, type mono and epi categorically, check the two neighboring isomorphisms, and prove the central map both monic and epic or directly invertible in the stated category. Once established, it supports transporting isomorphisms through long exact sequences, comparing homology and cohomology groups, proving natural transformations are isomorphisms, organizing diagram chases, and locating precisely which outer hypothesis a comparison argument needs without turning those uses into the definition.

Structural Signature¶

Carrier: a commutative diagram of two exact rows with five objects and five aligned vertical morphisms in an abelian category or another setting where the stated variant is valid
Inputs or antecedent state: two five-term exact sequences, commutative squares, vertical maps, the two adjacent isomorphisms, one outer epimorphism, one outer monomorphism, and a typed categorical setting
Constitutive operation: The two four-lemma directions or an element chase use exactness to move a target or kernel element through neighboring objects, commutativity to transfer it between rows, and the outer mono, epi, and isomorphism hypotheses to establish surjectivity and injectivity of the middle map
Invariant: the rows are exact at the needed objects, every square commutes, the vertical hypotheses occur in their correct positions and directions, and the conclusion concerns the central map
Recognition test: draw and label all ten objects and arrows, verify exactness at each used position, verify commutativity square by square, type mono and epi categorically, check the two neighboring isomorphisms, and prove the central map both monic and epic or directly invertible in the stated category
Output or consequence: transporting isomorphisms through long exact sequences, comparing homology and cohomology groups, proving natural transformations are isomorphisms, organizing diagram chases, and locating precisely which outer hypothesis a comparison argument needs
Failure boundary: row exactness is missing, a square fails to commute, the outer mono and epi are reversed, the central conclusion is assumed in a circular argument, or an abelian-category proof is exported to a weaker category without a valid variant

What It Is Not¶

It is not the whole field of homological algebra; many objects in that field do not satisfy its constitutive rule.
It is not its canonical example. Apply the standard five lemma to two exact rows \(A\to B\to C\to D\to E\) and \(A'\to B'\to C'\to D'\to E'\): outer epimorphism, adjacent isomorphisms, and outer monomorphism force \(C\to C'\) to be an isomorphism. That is an instance, not a definition.
It is not Knaster–Kuratowski–Mazurkiewicz lemma. The KKM lemma is a covering result in topology and convexity. The Five Lemma is an exact-sequence comparison theorem in homological algebra; sharing the word lemma carries no structural overlap.
It is not an unrestricted metaphor. In abelian categories mono plus epi implies isomorphism, while in the category of groups the classical element argument also works; arbitrary nonabelian or merely preadditive categories require separate hypotheses

Scope of Application¶

Five lemma applies when the analyst can specify a commutative diagram of two exact rows with five objects and five aligned vertical morphisms in an abelian category or another setting where the stated variant is valid and establish that the rows are exact at the needed objects, every square commutes, the vertical hypotheses occur in their correct positions and directions, and the conclusion concerns the central map. The entry states the classical comparison lemma and carefully qualified variants; it does not treat every categorical diagram as elementwise or every balanced conclusion as automatic.^[2]

Recognition. draw and label all ten objects and arrows, verify exactness at each used position, verify commutativity square by square, type mono and epi categorically, check the two neighboring isomorphisms, and prove the central map both monic and epic or directly invertible in the stated category
Comparison. Compare legitimate instances through category, exactness positions, square commutativity, mono and epi convention, vertical-map placement, element or categorical proof, long-exact-sequence segment, and naturality.
Boundary. In abelian categories mono plus epi implies isomorphism, while in the category of groups the classical element argument also works; arbitrary nonabelian or merely preadditive categories require separate hypotheses
Use. Preserve every assumption when using the identity for transporting isomorphisms through long exact sequences, comparing homology and cohomology groups, proving natural transformations are isomorphisms, organizing diagram chases, and locating precisely which outer hypothesis a comparison argument needs.

Clarity¶

A clear claim names the carrier, governing rule, assumptions, and recognition test. This matters because the name five lemma can obscure that there are ten objects, five vertical maps, exact rows, and asymmetric outer hypotheses rather than five interchangeable assumptions. The disciplined statement is that the object counts as Five lemma exactly when the rows are exact at the needed objects, every square commutes, the vertical hypotheses occur in their correct positions and directions, and the conclusion concerns the central map

Identity and measurement remain separate. Validity is proof-theoretic: diagrams generated by software still require verified typing, exactness, commutativity, and categorical hypotheses. Approximation or noisy evidence may weaken a classification without changing its definition.

Manages Complexity¶

The abstraction compresses standard five lemma, short five lemma, dual four-lemma derivation, module and group formulations, exact-category variants, and long-exact-sequence applications into a stable carrier, rule, invariant, and failure boundary. It makes comparison tractable while retaining the variables that control validity.

Compression can hide assumptions. A responsible use therefore declares category, exactness positions, square commutativity, mono and epi convention, vertical-map placement, element or categorical proof, long-exact-sequence segment, and naturality and returns to the full diagnostic whenever a convention or boundary case changes.

Abstract Reasoning¶

Type the carrier. Establish a commutative diagram of two exact rows with five objects and five aligned vertical morphisms in an abelian category or another setting where the stated variant is valid and reject examples from a different problem.
Lock the rule. Express that the rows are exact at the needed objects, every square commutes, the vertical hypotheses occur in their correct positions and directions, and the conclusion concerns the central map independently of one notation or implementation.
Derive carefully. Infer transporting isomorphisms through long exact sequences, comparing homology and cohomology groups, proving natural transformations are isomorphisms, organizing diagram chases, and locating precisely which outer hypothesis a comparison argument needs only under the stated assumptions.
Stress-test. Contrast the legitimate boundary case—In abelian categories mono plus epi implies isomorphism, while in the category of groups the classical element argument also works; arbitrary nonabelian or merely preadditive categories require separate hypotheses—with this counterexample: a commutative diagram with four vertical isomorphisms but nonexact rows does not satisfy the five lemma and can have a nonisomorphic middle map.

Knowledge Transfer¶

Transfer within homological algebra is strong when new cases preserve the same carrier, mechanism, and diagnostic. The move from Apply the standard five lemma to two exact rows \(A\to B\to C\to D\to E\) and \(A'\to B'\to C'\to D'\to E'\): outer epimorphism, adjacent isomorphisms, and outer monomorphism force \(C\to C'\) to be an isomorphism. to A morphism between short exact sequences induces a morphism between associated long exact homology sequences, and known isomorphisms in neighboring degrees can force the remaining comparison map to be an isomorphism. demonstrates that continuity.^[3]

Outside the domain, only the skeleton—use constrained neighboring correspondences and conservation across two aligned sequences to force the unknown central correspondence—travels automatically. The terms exact sequence, commutative diagram, monomorphism, epimorphism, isomorphism, kernel, image, diagram chase, abelian category, and natural transformation retain domain-specific meanings, so every role and inference must be revalidated.

Examples¶

Canonical¶

Apply the standard five lemma to two exact rows \(A\to B\to C\to D\to E\) and \(A'\to B'\to C'\to D'\to E'\): outer epimorphism, adjacent isomorphisms, and outer monomorphism force \(C\to C'\) to be an isomorphism. The positional hypotheses are load-bearing; merely knowing that four vertical maps have favorable properties without their directions and exactness does not yield the result. It is canonical because the carrier, rule, invariant, and consequence are all inspectable.^[1]

Mapped back: a commutative diagram of two exact rows with five objects and five aligned vertical morphisms in an abelian category or another setting where the stated variant is valid → The two four-lemma directions or an element chase use exactness to move a target or kernel element through neighboring objects, commutativity to transfer it between rows, and the outer mono, epi, and isomorphism hypotheses to establish surjectivity and injectivity of the middle map → the rows are exact at the needed objects, every square commutes, the vertical hypotheses occur in their correct positions and directions, and the conclusion concerns the central map → transporting isomorphisms through long exact sequences, comparing homology and cohomology groups, proving natural transformations are isomorphisms, organizing diagram chases, and locating precisely which outer hypothesis a comparison argument needs

Applied / In Practice¶

A morphism between short exact sequences induces a morphism between associated long exact homology sequences, and known isomorphisms in neighboring degrees can force the remaining comparison map to be an isomorphism. The application must isolate an actual five-term segment and verify boundary-map naturality before invoking the lemma. It qualifies only after the same diagnostic and failure boundary are checked.^[2]

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Exact identity vs. practical recognition. The constitutive condition may be exact while evidence is indirect. Diagnostic: Can the reviewer state both the condition and the warrant?
T2: Canonical form vs. variants. standard five lemma, short five lemma, dual four-lemma derivation, module and group formulations, exact-category variants, and long-exact-sequence applications can preserve or change the identity. Diagnostic: Which named role is invariant across the variants?
T3: Compression vs. hidden assumptions. The label is useful only while prerequisites remain visible. Diagnostic: Can each downstream inference be traced to a declared assumption?
T4: Autonomy vs. reduction. The candidate uses broader structures but claims the exact five-position commutative-diagram implication with its asymmetric outer mono and epi conditions, not every diagram chase, all comparison theorems, or a conclusion from four arbitrary isomorphisms. Diagnostic: Does that residual still support independent recognition after the parent and neighbors are subtracted?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is use constrained neighboring correspondences and conservation across two aligned sequences to force the unknown central correspondence; its identity-bearing terms are exact sequence, commutative diagram, monomorphism, epimorphism, isomorphism, kernel, image, diagram chase, abelian category, and natural transformation. Those terms determine admissible objects, evidence, and consequences inside homological algebra.

Structural Core vs. Domain Accent¶

The structural core is a carrier governed by The two four-lemma directions or an element chase use exactness to move a target or kernel element through neighboring objects, commutativity to transfer it between rows, and the outer mono, epi, and isomorphism hypotheses to establish surjectivity and injectivity of the middle map and tested by draw and label all ten objects and arrows, verify exactness at each used position, verify commutativity square by square, type mono and epi categorically, check the two neighboring isomorphisms, and prove the central map both monic and epic or directly invertible in the stated category. The domain accent is constitutive rather than decorative, so an analogy that preserves only the skeleton is not another instance of Five lemma.

The proposed strict upward parent is prime:deductive_reasoning. The Five Lemma is a reusable truth-preserving inference schema from explicit exactness, commutativity, mono, epi, and isomorphism premises to a necessary central-isomorphism conclusion. The edge is proposal-only and points to a frozen prior-baseline Prime.

The entry does not collapse into the parent because the exact five-position commutative-diagram implication with its asymmetric outer mono and epi conditions, not every diagram chase, all comparison theorems, or a conclusion from four arbitrary isomorphisms A thematic neighbor is declined whenever it does not literally subsume that rule.

The prospective workspace queue contains one strict upward edge to prime:deductive_reasoning. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Five lemma Domain-specific

Parents (1) — more general patterns this builds on

Five lemma is a kind of Deductive Reasoning Prime

The proposed strict upward parent is prime:deductive_reasoning.

Hierarchy path (1) — routes to 1 parentless root

Five lemma → Deductive Reasoning

Neighborhood in Abstraction Space¶

Five lemma sits in a crowded region of the domain-specific corpus (34^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Category-Theoretic Structures (79 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Short five lemma. A three-object short-exact-sequence variant with different packaging of hypotheses.
Four lemmas. Dual injectivity and surjectivity results whose combination proves the standard five lemma.
Snake lemma. Constructs a connecting morphism and an exact kernel-cokernel sequence from a different diagram.
Nine lemma. A three-by-three exactness result with a different diagram and conclusion.

References¶

[1] Charles A. Weibel, An Introduction to Homological Algebra, Cambridge University Press, 1994, DOI 10.1017/CBO9781139644136. registry ↩a ↩b

[2] Joseph J. Rotman, An Introduction to Homological Algebra, 2^nd ed., Springer, 2009, DOI 10.1007/b98977. registry ↩a ↩b

[3] Saunders Mac Lane, Homology, Springer, 1963, reprint DOI 10.1007/978-3-642-62029-4. registry ↩