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 — Examples
1 · Prerequisites
- Abelian Categories
- 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
- Free Modules, Exact Sequences, Projective and Injective Modules
- 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 Diagram Lemmas in an Abelian Category
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
These examples keep the categorical statements anchored to concrete diagrams in abelian groups and to the already-published module versions. They are not new proof devices for the A page; they are literal instances and computations that show what the abstract six-term and five-term conclusions look like in practice.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The published module five lemma as an instance
Example
Take the ambient abelian category to be . Then the categorical five lemma is the isomorphism clause of the already-published module five lemma.
Facts & Assumptions
Given: A commutative five-term diagram with exact rows in .
The categorical five lemma holds in any abelian category (Five lemma in an abelian category).
The module case is already published under the expected name (The Five Lemma for modules).
Verification
The hypotheses of [L1] specialize verbatim to a commutative exact-row diagram of modules.
The conclusion of [L1] is exactly the final, isomorphism clause of [L2]. The separate injective and surjective clauses of [L2] are sharper module statements, while its final clause is the module-valued instance of the categorical five lemma.
The published module snake lemma as an instance
Example
Inside , the categorical snake lemma becomes the published module snake lemma.
Facts & Assumptions
Given: Snake data in the category of modules.
The categorical snake lemma holds in every abelian category (Snake lemma in an abelian category).
The module snake lemma is already on disk (The Snake Lemma for modules).
Verification
Module categories are abelian, so the module diagram satisfies the hypotheses of [L1].
The kernel, cokernel, and connecting-map terms in [L1] are exactly the ones named in [L2]. Thus the published module theorem is the specialization of the categorical snake lemma to modules.
The published module four lemma as an instance
Example
When the ambient abelian category is a module category, the categorical four lemma is exactly the published module four lemma.
Facts & Assumptions
Given: A commutative exact-row four-term diagram of modules.
The categorical four lemma applies in any abelian category (Four lemma in an abelian category).
The module four lemma is already published (The injective and surjective Four Lemmas).
Verification
The module diagram is one instance of the abelian-category diagram in [L1].
Both the monic and epic conclusions then coincide with the two halves stated in [L2]. Hence the published module theorem is the module instance of the categorical four lemma.
The connecting morphism computed for a short exact sequence of abelian groups
Example
In , consider
diagram failed to render: 0 \arrow[r] & \mathbb Z \arrow[r, "\times 2"] \arrow[d, "\times 2"'] & \mathbb Z \arrow[r] \arrow[d, "\times 2"'] & \mathbb Z/2 \arrow[r] \arrow[d, "0"'] & 0 \\ 0 \arrow[r] & \mathbb Z \arrow[r, "\times 2"'] & \mathbb Z \arrow[r] & \mathbb Z/2 \arrow[r] & 0.
The connecting morphism is the identity map.
Facts & Assumptions
Given: The diagram above in .
Abelian groups form an abelian category (Abelian groups form an abelian category).
The connecting morphism exists, and the snake sequence is exact (The connecting morphism exists and is unique, Snake lemma in an abelian category).
Verification
By [L1], the displayed diagram is valid snake data. Its kernel and cokernel terms are
The snake sequence from [L2] therefore reduces to Exactness at the source and target of forces to be both injective and surjective, hence the identity automorphism of .
So in this concrete diagram the connecting morphism is the identity on .
The snake lemma applied to multiplication by an integer
Example
Fix and apply multiplication by to the short exact sequence The snake lemma produces so the connecting morphism is an isomorphism, and under the standard identifications it is the identity.
Facts & Assumptions
Given: The multiplication-by- endomorphism of the short exact sequence above.
Abelian groups form an abelian category (Abelian groups form an abelian category).
The snake lemma gives the exact sequence attached to that ladder (Snake lemma in an abelian category).
Verification
Multiplication by on has zero kernel and cokernel , while the induced map on the quotient term is zero. The induced map is multiplication by on , hence is , and the induced map is the identity of .
Substituting those terms into [L2] gives the displayed exact sequence. Exactness at the first copy of forces to be an isomorphism. In the standard snake construction, the class of in lifts to and then maps to the class of in , so under these standard identifications is the identity.
This is the concrete snake sequence for multiplication by an integer.
The nine lemma verified on a diagram of cyclic groups
Example
In , take the commutative diagram whose top row is the zero short exact sequence whose middle and bottom rows are both whose vertical maps from the top row to the middle row are zero, and whose vertical maps from the middle row to the bottom row are identities. Then each column is short exact, and the nine lemma says that the top row is short exact if and only if the bottom row is.
Facts & Assumptions
Given: The cyclic-group diagram just described.
Abelian groups form an abelian category (Abelian groups form an abelian category).
The nine lemma applies to any such diagram (Nine lemma in an abelian category).
Verification
In this diagram the middle and bottom rows are the standard short exact sequence and each column is one of the short exact sequences with or the zero sequence. Hence all three columns and the middle row are short exact in .
The top row is the zero short exact sequence and the bottom row is the standard short exact sequence above, so both outer rows are short exact. This agrees with [L2], which predicts that under the hypotheses verified in step 1.1 the two outer rows stand or fall together.
Thus this cyclic-group diagram is a concrete instance of the nine lemma.
A snake configuration whose kernel row is not short exact
Statement refuted
In every snake configuration, the induced kernel row is already short exact.
Facts & Assumptions
Given: The multiplication-by-two snake configuration from The kernel row of a morphism of short exact sequences need not be short exact.
That published example already shows the kernel row can fail to be short exact (The kernel row of a morphism of short exact sequences need not be short exact).
The snake lemma repairs the failure by adding the connecting morphism (Snake lemma in an abelian category).
Counterexample
By [L1], the chosen diagram is a valid snake configuration in whose kernel row is and that row is not short exact.
Nevertheless [L2] adds the connecting morphism after which the full snake sequence is exact. So the kernel row alone is not the whole story.
The short five lemma chased with members
Example
In , the identity morphism between the short exact sequence and itself is the simplest concrete member chase for the short five lemma.
Facts & Assumptions
Given: The identity ladder on the displayed short exact sequence.
Abelian groups form an abelian category (Abelian groups form an abelian category).
The short five lemma holds in every abelian category (Short five lemma in an abelian category).
Verification
Every member of the source sequence is carried to the identical member in the target sequence, so the outer comparison maps are isomorphisms in .
The proof of [L2] then specializes to the tautological chase that the middle identity map is both monic and epic. This example is trivial on purpose: it shows the member language in the easiest possible concrete case.
Hence the identity ladder on a short exact sequence of abelian groups is a concrete instance of the short five lemma.
Sources
- Saunders Mac Lane, Categories for the Working Mathematician, Lemma VIII.4.4
- Saunders Mac Lane, Categories for the Working Mathematician, Lemma VIII.4.5
- The Stacks Project, Section 12.5, Lemma 12.5.19
- Charles A. Weibel, An Introduction to Homological Algebra, Exercise 1.3.2
- Saunders Mac Lane, Categories for the Working Mathematician, VIII.4
- Saunders Mac Lane, Categories for the Working Mathematician, Lemma VIII.4.1