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.
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.
Depends on
Used by
Dependency tree · two levels
28 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Charles A. Weibel, An Introduction to Homological Algebra, Exercise 1.3.2 (standard reference, not scraped)
- Saunders Mac Lane, Categories for the Working Mathematician, Exercise VIII.4.5 (standard reference, not scraped)