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

v3 · 2026-09-19 · History

Domain-specific #

1846

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomains

Homological Algebra, Exact Sequence Diagram Lemmas → Mathematics

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. 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.

How would you explain it like I'm…

 

No faithful explanation at this level. A child-level picture collapses into 'if the outside pieces match, the middle matches too.' That is the false belief that any four matches force the fifth, and it drops the exact rows, commuting squares and one-sided outer conditions the lemma needs.

The Middle Match Rule

Picture two rows of five boxes, with arrows going along each row and also straight down from each top box to the box beneath it. The rows have a special 'no leftovers, no gaps' property called exactness, and going right-then-down gives the same result as going down-then-right. The Five lemma says that if the two down-arrows next to the middle are perfect matchings, and the two outer down-arrows each meet a specific one-way condition, then the middle down-arrow must be a perfect matching too. The conditions must be exactly the right ones; swapping them breaks the rule.

Five-Term Diagram Isomorphism Lemma

The Five lemma is about a diagram with two rows of five algebraic objects, such as groups, joined by maps. Each row is exact, meaning the image of each map equals the kernel of the next one. Vertical maps connect the rows, and every square commutes. Suppose the second and fourth vertical maps are isomorphisms, the first is onto (an epimorphism), and the fifth is one-to-one (a monomorphism). Then the middle vertical map is an isomorphism. The end conditions are asymmetric, and swapping them breaks the proof. You can't conclude the result from just any four isomorphisms without exactness and commutativity. It is proved by 'diagram chasing': you follow elements around the diagram.

 

The Five lemma: given a commutative diagram with two exact five-term rows and vertical maps f1 through f5, if f2 and f4 are isomorphisms, f1 is an epimorphism, and f5 is a monomorphism, then f3 is an isomorphism. The proof splits into two four-lemma halves. One half shows f3 is injective, using f2, f4 and the monic f5. The other shows f3 is surjective, using f2, f4 and the epic f1. Each step uses exactness to move an element to a neighbouring object, commutativity to transfer it between rows, and the outer hypotheses to close the argument. The lemma fails if exactness is missing somewhere it is used, if a square does not commute, or if the mono and epi conditions are swapped. A proof valid in abelian categories also cannot be exported to weaker settings without a valid variant. Typical uses are comparing homology or cohomology through long exact sequences and showing that natural transformations are isomorphisms.

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.

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

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

1. 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.
2. 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.

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.

Relationships to Other Abstractions

Current abstraction Five lemma Domain-specific

Parents (1) — outgoing typed relations

• Five lemma is a kind of Deductive Reasoning Prime

  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.

Hierarchy path (1) — routes to 1 parentless root

• Five lemma → is a kind of Deductive Reasoning

Neighborhood in Abstraction Space

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

Family — Categorical Constructions & Dualities (33 abstractions)

Nearest neighbors

• Nine lemma — 0.93
• Injective object — 0.91
• Traced monoidal category — 0.90
• Diagram (category theory) — 0.89
• Pseudo-abelian category — 0.89

Computed from structural-signature embeddings · 2026-10-25