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 Snake Lemma for modules
Statement
Given a commutative diagram of short exact sequences
there is a connecting homomorphism for which is exact. The unnamed maps are the restrictions and quotient maps induced by .
Facts & Assumptions
Given: The commutative diagram in the statement, with both rows short exact.
Diagram: , , , , , , .
(given).
(given).
Short exactness says are injective, are surjective, , and (Exact sequences and short exact sequences of modules, The endpoints of a short exact sequence encode injectivity and surjectivity).
is the quotient of the codomain by (Module homomorphism and isomorphism, kernel, image and cokernel).
A homomorphism that vanishes on a submodule factors uniquely through the quotient by that submodule (A module homomorphism vanishing on factors uniquely through ).
Proof
The restrictions and are induced by and using [C1] and [C2]. The formulas and define maps and : [C1] and [C2] make the relevant images vanish in the target quotients, so [L1] applies.
For , choose with . Then [C2] gives , so [F1] gives a unique with . Define .
If is another lift of , then for some by [F1]. If , then [C1] and injectivity of give , so in . Thus is well defined.
Exactness at holds because its map is the restriction of the injective map . At , the composite induced by is zero; if maps to zero in , then , so by [F1], and [C1] with injectivity of gives , hence .
If , the construction of step 1.2 applied to has , so . Conversely, if has , choose as in step 1.2; then for some , so [C1] gives and . Thus exactness holds at .
The map kills because . Conversely, if maps to zero, write ; then [C2] gives , and the construction with lift gives . Thus exactness holds at .
The next composite is zero because . If maps to zero in , write , choose with , and use [C2] to obtain . Hence comes from , proving exactness at .
The map is surjective: for a class , choose with using [F1], and maps to .
For and , the choices and in step 1.2 lead to and ; uniqueness through the injective map then gives and .
Steps 2.2 through 2.6 establish exactness at every displayed term. Steps 1.2, 2.1, and 3.1 construct a well-defined linear connecting homomorphism.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 26 results over 9 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- A. Kleshchev, Lectures on Abstract Algebra for Graduate Students, sections 3.6, 3.14, and 3.15 (standard reference, not scraped)
- The Stacks Project, Algebra (standard reference, not scraped)
- P. Hekmati, Homological Algebra, section 3.1 (standard reference, not scraped)