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 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.
Depends on
Used by
- The nine lemma verified on a diagram of cyclic groups Example
- An exact functor transports every diagram lemma Theorem
- Nine lemma variants by which rows are assumed exact Theorem
- Noether isomorphism theorems recovered from the nine lemma Theorem
- The diagram lemmas hold in the opposite category Theorem
- The splitting lemma follows from the nine lemma Theorem
Dependency tree · two levels
29 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
- Peter Freyd, Abelian Categories, Lemma 2.65 (standard reference, not scraped)
- Charles A. Weibel, An Introduction to Homological Algebra, Exercise 1.3.2 (standard reference, not scraped)