The snake lemma
ProvedFamousTheorems.snake_lemmaThe snake lemma. In an abelian category, consider a commutative diagram with exact rows
Then there is a connecting morphism making the six-term sequence
exact.
The snake lemma is the basic tool of homological algebra. It produces the long exact sequence in homology from a short exact sequence of chain complexes, and it is behind many dimension and index computations.
Formalization note. Mathlib's CategoryTheory.ShortComplex.SnakeInput.snake_lemma. A ShortComplex.SnakeInput C bundles the diagram together with the kernel and cokernel rows. S.composableArrows is the six-term sequence above, including the connecting morphism , and .Exact asserts exactness at every position.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem snake_lemma {C : Type*} [CategoryTheory.Category C] [CategoryTheory.Abelian C] (S : CategoryTheory.ShortComplex.SnakeInput C) :
S.composableArrows.Exact := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `CategoryTheory.ShortComplex.SnakeInput.snake_lemma`. Proof here reduces to that Mathlib result.