How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The Diagram Lemmas in an Abelian Category
1 · Prerequisites
- Abelian Categories
- Adjunctions Units and Counits
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Exactness and the Member Calculus
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Homomorphisms and the Isomorphism Theorems
- Limits and Colimits
- Modules over a Principal Ideal Domain and the Canonical Forms
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Preadditive and Additive Categories and Biproducts
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
This page packages the standard diagram lemmas in the order that actually drives later proofs: first the short five lemma, then the snake lemma and its connecting morphism, and only afterwards the four, five, and nine lemmas that are built on top of that exact-sequence machinery.
Two proof routes are kept visible on purpose. The opening short five lemma is proved once with the member calculus and once without it, while the connecting morphism itself is constructed arrow-theoretically from pullbacks, pushouts, and universal properties. That is the point of the page: members are useful, but the underlying arguments live entirely inside an arbitrary abelian category.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Short five lemma in an abelian category
Statement
Consider a morphism of short exact sequences in an abelian category
Then:
- if and are monic, then is monic;
- if and are epic, then is epic;
- if and are isomorphisms, then is an isomorphism.
Facts & Assumptions
Given: The commutative diagram in the statement, with both rows short exact.
Monicity is equivalent to cancellation on members (Monicity by member cancellation).
Exactness at a node is equivalent to the member-lifting condition (Exactness is detected by members).
Equivalent members admit representatives on a common epic domain. The pullback refinement used for transitivity puts any finite family of such witnesses on one common epic domain, where hom-sets are abelian groups (Equivalence of members, Member equivalence is transitive, Abelian category).
The opposite of an abelian category is abelian, and an abelian category is balanced (The opposite of an abelian category is abelian, An abelian category is balanced).
Proof
Assume that and are monic. Let and be members with . By [L4], choose epimorphisms and such that , and define the member . Then . Since and is monic, [L1] gives . Exactness of the top row at now gives a member of with by [L3].
Since the bottom row is short exact, is monic. From and the monicity of and , [L1] gives , hence . By [L4], after an epic refinement of the equality is literal, so the resulting common epic representatives witness . Thus [L1] makes monic.
If and are epic in the original diagram, then and are monic in the opposite abelian category. Applying steps 1.1 and 2.1 to the opposite morphism of short exact sequences makes monic, so is epic.
If and are isomorphisms, they are in particular monic and epic. Steps 2.1 and 3.1 make both monic and epic, so [L5] makes an isomorphism.
A morphism of short exact sequences with invertible outer maps is invertible
Statement
In a morphism of short exact sequences in an abelian category, if the left and right vertical maps are isomorphisms, then the middle vertical map is an isomorphism.
Facts & Assumptions
Given: A morphism of short exact sequences whose outer vertical maps are isomorphisms.
The short five lemma makes the middle map both monic and epic (Short five lemma in an abelian category).
Every morphism that is both monic and epic in an abelian category is an isomorphism (An abelian category is balanced).
Proof
Because the outer maps are isomorphisms, they are monic and epic. Therefore [L1] shows that the middle map is monic and epic.
Applying [L2] to that middle map shows that it is an isomorphism.
Hence a morphism of short exact sequences with invertible outer maps has invertible middle map as well.
Short five lemma by pullback without members
Statement
For a morphism of short exact sequences in an abelian category, the three conclusions of the short five lemma hold without using members: monic outer maps force the middle map to be monic, epic outer maps force it to be epic, and isomorphic outer maps force it to be an isomorphism.
Facts & Assumptions
Given: A morphism of short exact sequences with vertical maps .
In a short exact sequence, the left map is a kernel and the right map is a cokernel (A short exact sequence is a kernel-cokernel pair).
The pullback square of an epimorphism is again a pullback square with epic left projection, and its induced map on kernels is an isomorphism (In a pullback square, the induced map on the kernels of the two parallel arrows is an isomorphism).
A cartesian square over an epimorphism is also cocartesian (A cartesian square over an epimorphism is also cocartesian).
In an abelian category, monic-plus-epic implies isomorphism (An abelian category is balanced).
Pullback diagram
The proof uses the following pullback of along :
Proof
Form the pullback of along shown above. Because , there is a unique comparison map with and . Since is the cokernel of by [L1], it is epic, so [L3] makes the square also cocartesian, and [L2] identifies with .
Assume and are monic. Then , so step 1.1 makes monic. If , then Because by [L1], there is with . Now The map is monic by [L1], and is monic by hypothesis, so and hence . Thus is monic, and therefore is monic.
Still with the pullback square of step 1.1, let be a kernel of ; by [L2] this exists and agrees with the induced map from to . Assume now that and are epic. To show that is epic, let satisfy . Then Since is epic, . Because , there is with . But then and is epic by [L1], so and hence . Therefore is epic.
To show that is epic under the same hypotheses, let satisfy . Since the square of step 1.1 is cocartesian by [L3], the compatible pair of maps and induces a unique with and . Because is epic, , so . Thus is epic, and therefore is epic.
If and are isomorphisms, steps 2.1 and 3.1 show that is both monic and epic. Therefore [L4] makes an isomorphism.
This gives the short five lemma again, now by a pullback-and-pushout argument and without any use of members.
Snake data
Definition
A piece of snake data in an abelian category means one of the following commutative diagrams.
The Mac Lane shape is a morphism of short exact sequences
The weaker Stacks shape is a commutative diagram
whose top and bottom rows are exact.
This page uses the name only for the data of the diagram and its exact rows. The connecting morphism and the snake sequence attached to such data are constructed later.
The connecting morphism exists and is unique
Statement
Let
be snake data in the Mac Lane shape. Let be a kernel of and a cokernel of .
Form the pullback with projections and the pushout of and with coprojections
Then there exists a unique morphism such that
Facts & Assumptions
Given: The snake-data diagram in the statement, together with and .
In a short exact sequence, the left map is a kernel and the right map is a cokernel (A short exact sequence is a kernel-cokernel pair).
Pullbacks and pushouts exist, pullbacks of epimorphisms are epimorphisms, and the induced map on kernels in a pullback square is an isomorphism (Pullbacks and pushouts as limits and colimits of cospans and spans, The pullback of an epimorphism is an epimorphism, In a pullback square, the induced map on the kernels of the two parallel arrows is an isomorphism).
A pushout of a monomorphism is again a monomorphism (The pushout of a monomorphism is a monomorphism).
A complex is short exact exactly when is a kernel of and is epic (Degenerate exactness criteria).
Kernels and cokernels are characterized by their universal properties (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).
Proof
Because the top row is short exact, [L1] says that is epic and . Form the pullback of along :
tikzcd P \arrow[r, "\pi'"] \arrow[d, "\pi"'] & B \arrow[d, "p"] \\ K \arrow[r, "k_h"'] & C.
By [L2], the map is epic. The induced map on kernels identifies with , so after transporting along we obtain a kernel of satisfying . [L1, L2, construct]
Form the pushout of and :
tikzcd A' \arrow[r, "i'"] \arrow[d, "q_f"'] & B' \arrow[d, "\iota'"] \\ Q \arrow[r, "\iota"'] & R.
Since is monic by [L1], [L3] makes monic. [L1, L3, construct]
Step 1.1 gives and makes epic. By [L4], the sequence is therefore short exact. Applying [L1] to this new short exact sequence shows that is also a cokernel of .
The pullback relation gives so the snake-data square yields Because by [L1], [L5] gives a unique map with
Since and the left square commutes, we have The map is monic, so . Therefore Because is a cokernel of by step 2.1, [L5] yields a unique morphism with
Composing with the pushout coprojection gives which is the required relation. If and both satisfy that relation, then Since is epic by step 1.1 and is monic by step 1.2, this forces .
Hence the connecting morphism exists and is unique.
The connecting morphism depends on no choices
Remark
The arrow-theoretic construction of The connecting morphism exists and is unique produces the connecting morphism by a universal property and proves uniqueness at the same time. Once the pullback and pushout are fixed, there is no remaining zig-zag choice whose independence must be checked later.
That is exactly what the universal-property route buys. In an elementwise construction one has to prove that different representatives and different choices of lift lead to the same class. Here the final morphism is already the unique map that makes one displayed square commute.
Snake lemma in an abelian category
Statement
For snake data
there is an exact sequence where is the connecting morphism of The connecting morphism exists and is unique.
Facts & Assumptions
Given: The snake-data diagram in the statement.
The connecting morphism exists and is unique (The connecting morphism exists and is unique).
The kernel row is exact at its first two nodes, and the cokernel row is exact at its last two nodes (The kernel row and cokernel row of a morphism of short exact sequences are exact at two nodes each).
The subtraction surrogate produces a member mapping to zero from two members with the same image (The subtraction surrogate).
Exactness at a node is equivalent to the member-lifting condition (Exactness is detected by members).
The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).
Proof
By [L2], the induced kernel row is exact at and at , while the induced cokernel row is exact at and at . Thus only exactness at and at remains.
Let be a kernel of , let be a cokernel of , and use [L1] to form the pullback object , the map , the map , and the connecting morphism with The proof of [L1] gives that is epic.
First, kills the image of . Indeed, a member of factors through the pullback , and the defining identity of step 2.1 then gives . Since is monic in the pushout square used to define , this implies .
Conversely, let be a member of with . Because is epic, lift to a member of with . Writing for the map from the proof of [L1], we have Exactness of at gives a member of with by [L4]. The equality from the construction of therefore gives Applying the subtraction surrogate [L3] to and , we obtain a member of with and Exactness of the top row at gives a member of mapping to , and then exactness at follows because is monic. Hence every member in lies in the image of .
By [L5], the opposite of an abelian category is abelian. Applying step 3.2 there to the opposite snake diagram proves exactness at in the original category.
Therefore the full six-term sequence displayed in the statement is exact.
Snake lemma under the weaker Stacks hypotheses
Statement
For snake data in the weaker Stacks shape
there is an exact sequence
If is monic, then is monic. If is epic, then is epic.
Facts & Assumptions
Given: The weaker snake-data diagram in the statement.
In an exact sequence ending in , the last map is epic; in an exact sequence beginning at , the first map is monic (Degenerate exactness criteria).
Kernels and cokernels are characterized by their universal properties (Kernels and cokernels in a category with zero morphisms as equalizers and coequalizers).
Pullbacks of epimorphisms are epimorphisms, and in a pullback square the induced map on kernels is an isomorphism (The pullback of an epimorphism is an epimorphism, In a pullback square, the induced map on the kernels of the two parallel arrows is an isomorphism).
Under the endpoint hypotheses, the induced kernel and cokernel sequences are exact (Exactness of kernel and cokernel sequences under endpoint hypotheses).
Epicity is equivalent to the member-lifting property (Epimorphy is detected by members).
The subtraction surrogate produces a member mapping to zero from two members with the same image (The subtraction surrogate).
Exactness is self-dual (Exactness is self-dual).
Proof
Because the top row is exact and ends in , the map is epic by [L1]. Because the bottom row is exact and begins at , the map is monic by [L1]. Choose a kernel of and a cokernel of . Form the pullback tikzcd P \arrow[r, "\pi'"] \arrow[d, "\pi"'] & Y \arrow[d, "b"] \\ K \arrow[r, "k_\gamma"'] & Z. By [L3], is epic. Since the kernel property of gives a unique map such that
Let be a kernel of . By [L3], the induced map is an isomorphism. Exactness of the top row at says that is the image of , so there is an epimorphism with Then and monicity of gives . Therefore Because is epic, . Since is epic, it is the cokernel of its kernel , so there is a unique morphism with
Applying [L4] to the given diagram gives exactness of and of If is monic, then the sequence is exact, so the same theorem gives that is monic. Dually, if is epic, then is epic. Thus only exactness at and at remains.
Let be a kernel of , and let be the induced map with . Because , the pair factors through the pullback, giving with Then so monicity of gives . Therefore which proves that kills the image of .
Conversely, let be a member of with . Because is epic, [L5] gives a member of with . Then so the cokernel property of gives a member of with . Hence Applying [L6] to and with respect to , obtain a member of with and Since , the member factors through and maps to in . Thus every member of lies in the image of , so the sequence is exact at .
The exactness at is the formal dual of step 3.3 in the opposite abelian category. By [L7], that dual exactness transports back to the statement that
Hence the displayed six-term sequence is exact under the weaker Stacks hypotheses, with the additional endpoint monic and epic clauses already proved in step 3.1.
The arrow category of an abelian category
Definition
Let denote the category with two objects and one nonidentity arrow. For an abelian category , the arrow category is the functor category .
Thus an object of is a morphism in , and a morphism in is a commutative square between such arrows.
Because is small, this is an honest functor category by Functor category and If is small and is locally small then is locally small; if both are small it is small. Because limits and colimits in a functor category are computed pointwise, an abelian category gives an abelian arrow category as well.
Naturality of the connecting morphism
Statement
Given a morphism between two pieces of snake data in the Mac Lane shape in an abelian category, the induced square between their connecting morphisms commutes.
Facts & Assumptions
Given: A commutative ladder between two Mac Lane snake diagrams.
The arrow category of an abelian category is again abelian (The arrow category of an abelian category).
The connecting morphism exists and is unique for Mac Lane snake diagrams (The connecting morphism exists and is unique).
Proof
Regard each vertical arrow of the given ladder as an object of the arrow category . Because kernels, cokernels, pullbacks, and pushouts in are computed componentwise, the entire ladder is again a Mac Lane snake diagram in .
Applying [L2] in produces a connecting morphism between the arrow objects Read componentwise in , that morphism is exactly the pair consisting of the two ordinary connecting morphisms together with the comparison square between them.
The defining square for the arrow-category connecting morphism commutes by construction, and uniqueness in [L2] forces that componentwise square to be the naturality square for the two ordinary connecting morphisms. Therefore the connecting morphism is natural.
The kernel-cokernel sequence of a composite is a snake
Statement
For composable morphisms in an abelian category, the exact sequence of The kernel-cokernel sequence of a composite is an instance of the snake sequence.
Facts & Assumptions
Given: Composable morphisms .
The snake lemma gives an exact kernel-cokernel sequence for a morphism of short exact sequences (Snake lemma in an abelian category).
The composite already has a kernel-cokernel exact sequence (The kernel-cokernel sequence of a composite).
An abelian category is additive and has finite biproducts (Abelian category).
Proof
Consider the morphism between the canonical split short exact sequences tikzcd 0 \arrow[r] & A \arrow[r, "j_A"] \arrow[d, "f"'] & A\oplus B \arrow[r, "\pi_B"] \arrow[d, "m"'] & B \arrow[r] \arrow[d, "g"'] & 0 \\ 0 \arrow[r] & B \arrow[r, "j_B"'] & B\oplus C \arrow[r, "\pi_C"'] & C \arrow[r] & 0 where, in biproduct matrix notation, The two squares commute, so [L1] applies.
The map identifies with : the equations are exactly and . Dually, the map identifies with . Under these identifications, the snake sequence of step 1.1 is exactly
The maps in step 2.1 are the canonical comparison maps of [L2], so the kernel-cokernel sequence of a composite is a special case of the snake lemma.
Four lemma in an abelian category
Statement
Consider a commutative diagram in an abelian category with exact rows
Then:
- if and are epic and is monic, then is epic;
- if and are monic and is epic, then is monic.
Facts & Assumptions
Given: The commutative exact-row diagram in the statement.
Monicity is equivalent to cancellation on members (Monicity by member cancellation).
Epicity is equivalent to the member-lifting property (Epimorphy is detected by members).
Exactness at a node is equivalent to the member-lifting condition (Exactness is detected by members).
The common-refinement construction for member equivalence puts finitely many witness equalities on one epic domain, where hom-set subtraction is defined (Equivalence of members, Member equivalence is transitive, Abelian category).
Proof
Write the top row as and the bottom row as . Assume that and are epic and that is monic. To prove that is epic, let be a member of . Since is epic, [L2] gives a member of with . Then Because is monic, [L1] gives . Exactness of the top row at now gives a member of with by [L3].
Assume instead that and are monic and that is epic. To prove that is monic, let and be members of with . Then so [L1] gives . By [L4], replace and by representatives on one common epic refinement of the witnesses for both equalities and define . Then and on that domain. Exactness of the top row at gives a member of with by [L3].
From step 1.1 we get By [L4], replace and by representatives on a common epic domain and define . Then and on that domain. Exactness of the bottom row at gives a member of with by [L3], and epicity of gives a member of with by [L2]. Therefore So every member of lifts along , and [L2] makes epic.
From step 1.2 we get Exactness of the bottom row at therefore gives a member of with by [L3]. Because is epic, [L2] gives a member of with . Then Since is monic, [L1] yields . Therefore because the top row is a complex. So , and [L1] makes monic.
Therefore the four lemma holds in both the epic and the monic form stated above.
Weak four lemma with the exactness hypotheses named
Statement
In the four-term commutative diagram of the four lemma, the two conclusions already follow from exactness at the four middle nodes that are actually used:
- exactness at , , , and , together with epic and monic, implies epic;
- exactness at , , , and , together with monic and epic, implies monic.
Facts & Assumptions
Given: The four-term commutative diagram underlying the four lemma.
Monicity is equivalent to cancellation on members (Monicity by member cancellation).
Epicity is equivalent to the member-lifting property (Epimorphy is detected by members).
Exactness at a node is equivalent to the member-lifting condition (Exactness is detected by members).
The common-refinement construction for member equivalence puts finitely many witness equalities on one epic domain, where hom-set subtraction is defined (Equivalence of members, Member equivalence is transitive, Abelian category).
Proof
Write the top row as and the bottom row as . Assume that exactness holds at , , , and , and that and are epic while is monic. Let be a member of . By epicity of and [L2], choose a member of with . Then so monicity of and [L1] give . Exactness at gives a member of with by [L3].
Assume instead that exactness holds at , , , and , that and are monic, and that is epic. Let and be members of with . Then so [L1] gives . By [L4], replace and by representatives on one common epic refinement of the witnesses for both equalities and define . Then and on that domain. Exactness at gives a member of with by [L3].
Now By [L4], replace and by representatives on a common epic domain and define . Then and on that domain. Exactness at gives a member of with by [L3], and epicity of gives a member of with by [L2]. Therefore So [L2] makes epic.
From step 1.2 we get Exactness at gives a member of with by [L3]. Since is epic, choose in with by [L2]. Then Because is monic, [L1] yields , and therefore So , and [L1] makes monic.
Hence the weak four lemma follows from the named middle-node exactness hypotheses alone.
The two halves of the four lemma are mutually dual
Remark
The monic half and the epic half of Four lemma in an abelian category are not the same argument with words changed; they are opposite-category translations of each other. The point of recording that explicitly is bookkeeping: later items cite one half or the other, and duality explains why both need not be reproved from scratch.
Sharp five lemma in an abelian category
Statement
In a commutative diagram with exact rows
the following hold:
- if is epic and are monic, then is monic;
- if are epic and is monic, then is epic.
Facts & Assumptions
Given: The commutative exact-row diagram in the statement.
The four lemma gives the monic and epic conclusions on any four-column window with exact rows (Four lemma in an abelian category).
Proof
For the monic clause, apply [L1] to the left four columns The hypotheses there are exactly that is epic and that and are monic, so the four lemma gives that is monic.
For the epic clause, apply [L1] to the right four columns The hypotheses there are exactly that and are epic and that is monic, so the four lemma gives that is epic.
Therefore the sharp five lemma holds in both halves.
Five lemma in an abelian category
Statement
In a commutative diagram with exact rows
if are isomorphisms, then is an isomorphism.
Facts & Assumptions
Given: The commutative exact-row diagram in the statement.
The sharp five lemma makes the middle map monic under one set of hypotheses and epic under the complementary one (Sharp five lemma in an abelian category).
In an abelian category, a morphism that is both monic and epic is an isomorphism (An abelian category is balanced).
Proof
Because are isomorphisms, they are in particular monic and epic. The first half of [L1] therefore makes monic, and the second half of [L1] makes epic.
Applying [L2] to now shows that is an isomorphism.
Hence the five lemma holds in every abelian category.
Why the five lemma asks for isomorphisms in the middle
Remark
Sharp five lemma in an abelian category explains the bookkeeping behind the classical hypothesis. The middle comparison map is proved monic by one application of the four lemma and epic by a different application to a different four-column window. So the two adjacent vertical maps are each used twice: once in a monic role and once in an epic role.
That is why the ordinary five lemma assumes those two maps are isomorphisms. The condition is not a lazy strengthening; it is exactly what makes both four lemma applications available at once.
Half nine lemma
Statement
Consider a commutative diagram in an abelian category whose three columns are short exact:
If the bottom two rows are short exact, then the top row is exact at and at .
Facts & Assumptions
Given: The commutative diagram in the statement.
In a short exact sequence, the left map is monic and the middle node is exact (Degenerate exactness criteria).
Monicity is equivalent to cancellation on members (Monicity by member cancellation).
Exactness at a node is equivalent to the member-lifting condition (Exactness is detected by members).
Proof
Let and be members of with the same image in . Commutativity gives the same image of and in . Because the second row is short exact, its left map is monic by [L1], so [L2] gives . The first column is also short exact, so its left map is monic; applying [L2] again yields . Hence the top-row map is monic, so the top row is exact at .
Let be a member of with image in . Commutativity gives that maps to in . Exactness of the second row at therefore yields a member of with by [L3]. Applying the right map of the first column gives Because the bottom row is short exact, its left map is monic by [L1], so [L2] shows . Exactness of the first column at now gives a member of with by [L3]. Then Since the second column is short exact, is monic, so [L2] gives . Thus every member of killed by lifts from , and the top row is exact at by [L3].
Therefore the top row is left exact whenever the bottom two rows and all three columns are short exact.
Nine lemma in an abelian category
Statement
In a commutative diagram in an abelian category, assume all three columns and the middle row are short exact:
Then the top row is short exact if and only if the bottom row is short exact.
Facts & Assumptions
Given: The diagram in the statement.
If the bottom two rows are short exact, then the top row is exact at its first two nodes (Half nine lemma).
The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).
Short exactness, monicity, epicity, and exactness are detected by the standard member rules (Degenerate exactness criteria, Monicity by member cancellation, Epimorphy is detected by members, Exactness is detected by members).
The common-refinement construction for member equivalence puts finitely many witness equalities on one epic domain, where hom-set subtraction is defined (Equivalence of members, Member equivalence is transitive, Abelian category).
Proof
Assume the bottom row is short exact. Applying [L1] to the given diagram shows that the top row is exact at its first two nodes.
Write the horizontal maps as , , and , and the vertical maps as and then . It remains after step 1.1 to prove that is epic. Let be a member of . Lift along the epic map to a member of . Exactness of the bottom row gives a member of with , and epicity of gives a member of with . Then By [L4], pass to one common epic refinement of all the preceding equivalences and put . Then , , and there. Exactness of the second column gives a member of with . Consequently Since is monic, . Thus is epic by [L3], and the top row is short exact.
For the converse, pass to the opposite category. After drawing its vertical arrows downward, the original top row is the bottom row and the original bottom row is the top row. Thus the implication proved in steps 1.1 and 2.1, applied in the abelian category from [L2], carries short exactness of the original top row to short exactness of the original bottom row.
Hence, under the standing short-exactness of the middle row and all three columns, the top row is short exact if and only if the bottom row is short exact.
Nine lemma variants by which rows are assumed exact
Statement
In the short-exact-column diagram of the nine lemma:
- if the bottom two rows are short exact, then the top row is short exact;
- if the top two rows are short exact, then the bottom row is short exact;
- if the top and bottom rows are short exact and the middle row is a complex, then the middle row is short exact.
Facts & Assumptions
Given: A commutative diagram whose three columns are short exact.
The nine lemma exchanges short exactness of the top and bottom rows when the middle row is short exact (Nine lemma in an abelian category).
In a short exact sequence, the left map is monic, the right map is epic, and the middle node is exact (Degenerate exactness criteria).
Monicity, epicity, and exactness can be checked by member cancellation and member lifting. Equivalent members have representatives on a common epic domain, where hom-set subtraction is defined (Monicity by member cancellation, Epimorphy is detected by members, Exactness is detected by members, Equivalence of members, Member equivalence is transitive, Abelian category).
Proof
If the bottom two rows are short exact, then the standing hypotheses of [L1] are met, so the top row is short exact.
If the top two rows are short exact, the same theorem [L1] applied after swapping the top and bottom rows shows that the bottom row is short exact.
Assume the top and bottom rows are short exact and that the middle row is a complex. To prove exactness at , let be a member of with image in . Applying the right map of the first column gives Since the bottom row is short exact, its left map is monic by [L2], so [L3] gives . Exactness of the first column at gives a member of with . Then Because the second column is short exact, its left map is monic, so [L3] gives . The top row is short exact, hence its left map is monic by [L2]; another use of [L3] gives , and therefore . Thus the middle-row map is monic.
Still under the same hypotheses, let be a member of with image in . Because the bottom row is exact at , there is a member of with by [L3]. Since the first column is short exact, its right map is epic by [L2], so [L3] yields a member of with . Then By [L3], pass to one common epic refinement of these equalities and the hypothesis , and define . Then , , and on that domain. Exactness of the second column at gives a member of with by [L3]. The middle row is a complex, so Because the third column is short exact, is monic; [L3] gives . Exactness of the top row at therefore gives a member of with by [L3]. Hence so This proves exactness of the middle row at by [L3].
Let be a member of . Since the bottom row is short exact, its right map is epic by [L2], so [L3] gives a member of with . Since the second column is short exact, its right map is epic as well, choose a member of with . Then By [L3], pass to one common epic refinement of these equalities and define . Then and on that domain. Exactness of the third column at gives a member of with by [L3]. Because the top row is short exact, its right map is epic by [L2], so [L3] gives a member of with . Therefore and hence By [L3], the map is epic.
Steps 1.3, 1.4, and 1.5 prove that the middle row is short exact.
These are exactly the three standard variants of the nine lemma distinguished by which rows are assumed exact.
Why the middle nine lemma needs a zero composite
Remark
In the middle-row variant, exactness is not even a meaningful target until the middle row is first known to be a complex. That is the role of the zero-composite hypothesis in Nine lemma variants by which rows are assumed exact: it is not a technical afterthought, but the condition that allows the phrase "the middle row is short exact" to make literal sense.
Sharp nine lemma
Statement
In a commutative diagram, assume the three columns and the last two rows are exact at their first two nodes. Then the first row is exact at its first two nodes.
If, in addition, the first column and the middle row are short exact, then the first row is short exact.
Facts & Assumptions
Given: The commutative diagram in the statement.
In a short exact sequence, the left map is monic, the right map is epic, and the middle node is exact (Degenerate exactness criteria).
Monicity and epicity are equivalent to member cancellation and member lifting (Monicity by member cancellation, Epimorphy is detected by members).
Exactness at a node is equivalent to the member-lifting condition (Exactness is detected by members).
The common-refinement construction for member equivalence puts finitely many witness equalities on one epic domain, where hom-set subtraction is defined (Equivalence of members, Member equivalence is transitive, Abelian category).
Proof
Write the horizontal maps of the three rows as , , and , and the vertical maps of the three columns as from top to middle and from middle to bottom. Assume the three columns and the last two rows are exact at their first two nodes. Let and be members of with the same image in . Commutativity gives the same image of and in . Because the middle row is exact at its first node, is monic by [L1], so [L2] gives . Because the first column is exact at its first node, is monic, and another use of [L2] yields . Thus the top row is exact at .
Let be a member of with image in . Commutativity gives that maps to in . Exactness of the middle row at therefore yields a member of with by [L3]. Applying the right map of the first column gives Because the bottom row is exact at its first node, is monic by [L1], so [L2] shows . Exactness of the first column at now gives a member of with by [L3]. Then Since the second column is exact at its first node, is monic, so [L2] gives . Thus the top row is exact at .
Assume in addition that the first column and the middle row are short exact. By steps 1.1 and 1.2, the top row is already exact at its first two nodes, so only epicity of remains. Let be a member of . Because the middle row is short exact, is epic by [L1], so [L2] gives a member of with . Then so exactness of the bottom row at gives a member of with by [L3]. Since the first column is short exact, is epic by [L1], so [L2] gives a member of with . Now By [L4], pass to one common epic refinement of all the preceding equivalences and define . Then , , and on that domain. Exactness of the second column at gives a member of with by [L3]. Therefore Because the third column is exact at its first node, is monic, so [L2] gives . Hence is epic, and the top row is short exact.
Hence the sharp nine lemma is the left-exact half together with the precise extra hypotheses needed to upgrade it to a short exact row.
Symmetric nine lemma
Statement
In a commutative diagram, suppose the middle row and middle column are short exact. If any three of the remaining four rows and columns are short exact, then the fourth is short exact.
Facts & Assumptions
Given: The commutative diagram in the statement.
The sharp nine lemma recovers a missing outer row from the two rows below it and the three columns (Sharp nine lemma).
Passing to the opposite category preserves abelianity and reverses exact sequences (The opposite of an abelian category is abelian).
Transposing the indexing of a commutative diagram exchanges rows with columns while preserving commutativity and exactness.
Proof
If the missing exact line is the top row, [L1] applies directly. If it is the bottom row, apply [L1] in the opposite category and redraw the reversed exact sequences from top to bottom; [L2] then transports the result back.
If the missing exact line is the left or right column, transpose the diagram using [L3]. The missing column becomes an outer row, so step 1.1 applies to the transposed diagram and transports back.
Thus any one of the four outer rows and columns is forced by the other three together with the short exact middle row and middle column.
The nine lemma follows from the snake lemma
Statement
The nine lemma can be proved by applying the snake lemma to the standard quotient diagram attached to a commutative diagram with short exact columns.
Facts & Assumptions
Given: A commutative diagram with short exact columns and middle row short exact.
The snake lemma supplies the exact six-term sequence for a morphism of short exact sequences (Snake lemma in an abelian category).
Proof
Collapse the first two rows of the diagram to their quotient row. The short exact columns identify the needed kernels and cokernels of that quotient diagram with the two outer rows of the original picture.
Applying [L1] to that quotient diagram yields a snake sequence whose endpoint exactness is exactly the missing exactness of the remaining outer row. Running the same argument in the opposite direction gives the converse implication.
Therefore the nine lemma is a direct consequence of the snake lemma.
The splitting lemma follows from the nine lemma
Statement
If a short exact sequence in an abelian category admits a section or a retraction, then the splitting conclusion can be recovered by applying the nine lemma to the induced diagram.
Facts & Assumptions
Given: A short exact sequence together with either a section of its right-hand map or a retraction of its left-hand map.
The nine lemma forces the missing row in the standard diagram built from a section or retraction (Nine lemma in an abelian category).
The actual splitting conclusion is already recorded as the splitting lemma (Splitting lemma in an abelian category).
Proof
A section or retraction inserts the given short exact sequence into the usual diagram whose other two rows are visibly split exact. Applying [L1] makes the remaining row short exact as well.
The data in that recovered short exact row are exactly the biproduct data named in [L2]. So the nine-lemma route reproduces the splitting lemma statement.
Hence the splitting lemma follows from the nine lemma.
Noether isomorphism theorems recovered from the nine lemma
Statement
The first and third isomorphism theorems in an abelian category can be recovered by placing the standard quotient diagrams into a short-exact-column diagram and applying the nine lemma.
Facts & Assumptions
Given: The standard quotient diagrams attached to a subobject and to a chain of subobjects.
The nine lemma reconstructs a missing short exact row from the surrounding short exact rows and columns (Nine lemma in an abelian category).
The quotient objects and the first and third isomorphism theorems are already established in the abelian-category development (The quotient of an object by a subobject, First isomorphism theorem in an abelian category, Third isomorphism theorem in an abelian category, The quotient by the kernel followed by the image inclusion is the canonical epi-mono factorization).
Proof
For the first isomorphism theorem, insert the kernel, image, and cokernel factorization of a morphism into the standard quotient diagram. The surrounding rows and columns are short exact by [L2], so [L1] forces the missing quotient row. That row is precisely the statement that the coimage and image quotients coincide.
For the third isomorphism theorem, do the same with a chain of subobjects . The canonical quotient maps provide the surrounding short exact rows and columns, and [L1] forces the remaining quotient row. By [L2], that row is exactly the third isomorphism theorem.
Therefore the standard Noether isomorphism theorems are recoverable from the nine lemma.
The pullback and pushout theorems
Statement
In an abelian category:
- pullbacks of epimorphisms are epimorphisms;
- pushouts of monomorphisms are monomorphisms;
- in a pullback square, the induced map on kernels of the parallel arrows is an isomorphism;
- a commuting square is cartesian exactly when the associated short sequence is exact;
- a cartesian square over an epimorphism is also cocartesian.
Facts & Assumptions
Given: The named pullback and pushout situations in the statement.
Each of the five claims has already been proved under the displayed names (The pullback of an epimorphism is an epimorphism, The pushout of a monomorphism is a monomorphism, In a pullback square, the induced map on the kernels of the two parallel arrows is an isomorphism, A square is cartesian exactly when a short sequence is exact, A cartesian square over an epimorphism is also cocartesian).
Proof
The first claim is [L1]'s pullback-of-epimorphism theorem. The second claim is its pushout-of-monomorphism dual. The third claim is its kernel-comparison theorem.
The fourth claim is [L1]'s exact-square criterion, and the fifth claim is the cartesian-implies-cocartesian theorem over an epimorphism.
Hence the pullback and pushout results actually used by the diagram-lemma proofs are exactly the previously published theorems listed above.
The diagram lemmas hold in the opposite category
Statement
If is abelian, then every diagram lemma proved on this page remains valid in , and each dual statement is one of the named lemmas on the same page.
Facts & Assumptions
Given: An abelian category .
The opposite of an abelian category is abelian (The opposite of an abelian category is abelian).
The snake, four, sharp five, nine, and sharp nine lemmas have already been proved in an arbitrary abelian category (Snake lemma in an abelian category, Four lemma in an abelian category, Sharp five lemma in an abelian category, Nine lemma in an abelian category, Sharp nine lemma).
Proof
By [L1], the opposite category is abelian, so each theorem listed in [L2] applies there as stated.
Interpreting those statements back in swaps kernels with cokernels, monic with epic, pullbacks with pushouts, and top-row exactness with bottom-row exactness. Those are exactly the dual formulations already named on this page.
Therefore every diagram lemma on this page is closed under passage to the opposite category.
An exact functor transports every diagram lemma
Statement
Let be an exact functor between abelian categories. Then carries every instance of the short five lemma, snake lemma, four lemma, sharp five lemma, and nine lemma in to the corresponding valid instance in . For the snake lemma, the connecting morphism is carried to the connecting morphism under the canonical kernel and cokernel comparison isomorphisms.
Facts & Assumptions
Given: An exact functor .
Exactness is equivalent to preserving kernels and cokernels, and one-sided exactness preserves monomorphisms and epimorphisms (An additive functor is exact exactly when it preserves kernels and cokernels, A left exact functor preserves monomorphisms and a right exact functor preserves epimorphisms).
The connecting morphism is characterized uniquely by a pullback-pushout square, and the named diagram lemmas have already been proved in any abelian category (The connecting morphism exists and is unique, Snake lemma in an abelian category, Four lemma in an abelian category, Sharp five lemma in an abelian category, Nine lemma in an abelian category, The diagram lemmas hold in the opposite category).
Proof
By [L1], the functor preserves short exact sequences, kernels, cokernels, monomorphisms, and epimorphisms. Therefore applying to any diagram that satisfies the hypotheses of one of the listed lemmas again produces a diagram satisfying the same type of hypotheses in .
For the short five, four, sharp five, and nine lemmas, the conclusions are therefore immediate from the corresponding theorem in , namely [L2].
For the snake lemma, preserves the pullback, pushout, kernel, and cokernel data used in the construction of . The resulting morphism in satisfies the same universal-property square, so uniqueness in [L2] identifies it with the connecting morphism of the image diagram.
Hence every diagram lemma on this page is transported by an exact functor, with the connecting morphism respected under the canonical comparisons.
Five lemma for a morphism of long exact sequences
Statement
Let and be long exact sequences in an abelian category, together with a morphism of these sequences. If the four comparison maps at are isomorphisms, then the comparison map is an isomorphism.
Facts & Assumptions
Given: The morphism of long exact sequences in the statement.
Every five-term exact window satisfies the sharp five lemma (Sharp five lemma in an abelian category).
In an abelian category, a morphism that is both monic and epic is an isomorphism (An abelian category is balanced).
Proof
Extract the five-term window and the corresponding window in the -sequence. Exactness of the long sequences makes both rows exact.
Because the four surrounding comparison maps are isomorphisms, they satisfy both halves of the hypotheses of [L1]. Hence the middle comparison map is both monic and epic.
Therefore that middle comparison map is an isomorphism by [L2].
5 · Examples, counterexamples and false statements
FALSE: the connecting morphism depends on the choices made in its construction
Statement
The connecting morphism in the snake lemma depends on the choices made during its construction.
Facts & Assumptions
Given: The arrow-theoretic construction of the connecting morphism.
The connecting morphism exists and is unique (The connecting morphism exists and is unique).
Consequently, no choice-independence argument remains to be proved (The connecting morphism depends on no choices).
Refutation
The statement of [L1] already says that the connecting morphism is the unique map making one displayed square commute.
By [L2], uniqueness is exactly what rules out any dependence on auxiliary choices. Therefore the statement is false.
FALSE: the five lemma needs only that the two middle maps are monic
Statement
To prove the five lemma, it is enough to assume that the two maps adjacent to the middle one are monomorphisms.
Facts & Assumptions
Given: The five-term exact diagram.
The sharp five lemma splits the proof into one monic half and one epic half (Sharp five lemma in an abelian category).
The two adjacent comparison maps are used once as monomorphisms and once as epimorphisms (Why the five lemma asks for isomorphisms in the middle).
Refutation
The monic half of [L1] does use monicity of the adjacent comparison maps, but the epic half requires them to be epic.
By [L2], the classical five lemma needs both halves at once. Monicity alone therefore does not support the full isomorphism conclusion.
FALSE: the middle nine lemma holds without assuming the composite is zero
Statement
The middle-row form of the nine lemma remains true even if no hypothesis is made that the middle row is a complex.
Facts & Assumptions
Given: The middle-row variant of the nine lemma.
The middle-row conclusion is stated only after assuming the middle row is a complex (Nine lemma variants by which rows are assumed exact).
That zero-composite hypothesis is load-bearing (Why the middle nine lemma needs a zero composite).
Refutation
By [L1], the theorem itself does not claim exactness of the middle row without first requiring that its composite vanish.
By [L2], without that hypothesis the middle row need not even be a complex, so the purported strengthening is false.
FALSE: the snake lemma is just a pair of short exact kernel and cokernel rows
Statement
The snake lemma says nothing beyond the separate kernel-row and cokernel-row statements for a morphism of short exact sequences.
Facts & Assumptions
Given: A morphism of short exact sequences.
The kernel and cokernel rows are only partially exact on their own (The kernel row and cokernel row of a morphism of short exact sequences are exact at two nodes each).
The kernel row need not be short exact (The kernel row of a morphism of short exact sequences need not be short exact).
The snake lemma adds the connecting morphism and the missing middle exactness (Snake lemma in an abelian category).
Refutation
The theorem [L1] only gives two-node exactness for the kernel row and two-node exactness for the cokernel row, and [L2] shows that nothing stronger is automatic.
By contrast, [L3] produces the connecting morphism and the exactness through it. So the snake lemma contains strictly more information than the separate kernel-row and cokernel-row statements.
FALSE: the diagram lemmas in an abelian category follow from the module case by the embedding theorem
Statement
The diagram lemmas for an arbitrary abelian category can be proved on this page simply by reducing to the already-published module case via Freyd-Mitchell.
Facts & Assumptions
Given: The embedding-theorem route just described.
The connecting morphism is constructed intrinsically on this page (The connecting morphism exists and is unique).
Refutation
The proposed reduction already fails at scope: Freyd-Mitchell gives a fully faithful exact functor from every small abelian category to a module category ‡ records the smallness condition on Freyd-Mitchell, so the route is not a theorem about arbitrary abelian categories.
Even inside that smaller scope, The library does not use Freyd-Mitchell to prove the diagram lemmas records that this library does not take the embedding-theorem route, and [L1] supplies the intrinsic construction it uses instead. Therefore the statement is false as a description of the page's proof method.
Sources
- Saunders Mac Lane, Categories for the Working Mathematician, Lemma VIII.4.1
- The Stacks Project, Section 12.5, Lemma 12.5.2
- David Mehrle, Category Theory, Part III, Lemma 7.23
- The Stacks Project, Section 12.5, Lemmas 12.5.12 and 12.5.13
- Saunders Mac Lane, Categories for the Working Mathematician, Lemma VIII.4.5
- The Stacks Project, Section 12.5, Lemma 12.5.17
- The Stacks Project, Section 12.5, Lemma 12.5.17(1)
- The Stacks Project, Section 12.5, Lemma 12.5.17(2)
- David Mehrle, Category Theory, Part III, Lemma 7.24
- The Stacks Project, Section 12.5, Lemma 12.5.18
- Saunders Mac Lane, Categories for the Working Mathematician, Exercise VIII.4.4
- Charles A. Weibel, An Introduction to Homological Algebra, Proposition 1.3.4
- Saunders Mac Lane, Categories for the Working Mathematician, Exercise VIII.4.6
- The Stacks Project, Section 12.5, Lemma 12.5.19
- Charles A. Weibel, An Introduction to Homological Algebra, Exercise 1.3.3
- Saunders Mac Lane, Homology, Chapter XII, Section 3
- The Stacks Project, Section 12.5, Lemma 12.5.20
- Saunders Mac Lane, Categories for the Working Mathematician, Lemma VIII.4.4
- The Stacks Project, Section 12.5, Lemmas 12.5.19 and 12.5.20
- Peter Freyd, Abelian Categories, Section 2.6
- Peter Freyd, Abelian Categories, Lemma 2.65
- Charles A. Weibel, An Introduction to Homological Algebra, Exercise 1.3.2
- Saunders Mac Lane, Categories for the Working Mathematician, Exercise VIII.4.5
- Saunders Mac Lane, Categories for the Working Mathematician, Exercise VIII.4.5(b)
- Peter Freyd, Abelian Categories, Lemma 2.68
- Peter Freyd, Abelian Categories, Lemma 2.66
- Peter Freyd, Abelian Categories, Sections 2.5 and 2.6
- The Stacks Project, Section 12.5, Lemmas 12.5.11 to 12.5.13
- The Stacks Project, Section 12.5
- Saunders Mac Lane, Categories for the Working Mathematician, VIII.4
- Charles A. Weibel, An Introduction to Homological Algebra, Section 1.3
- Peter Freyd, Abelian Categories