Snake lemma
The snake lemma is a tool used in mathematics, particularly homological algebra, to construct long exact sequences.
≈ 4 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
The snake lemma is a tool used in mathematics, particularly homological algebra, to construct long exact sequences. The snake lemma is valid in every abelian category and is a crucial tool in homological algebra and its applications, for instance in algebraic topology. Homomorphisms constructed with its help are generally called connecting homomorphisms.
Then there is an exact sequence relating the kernels and cokernels of a, b, and c: \ker(f) ~{\color{Gray}\longrightarrow}~ \ker a ~{\color{Gray}\longrightarrow}~ \ker b ~{\color{Gray}\longrightarrow}~ \ker c ~\overset{d}{\longrightarrow}~ \operatorname{coker}a ~{\color{Gray}\longrightarrow}~ \operatorname{coker}b ~{\color{Gray}\longrightarrow}~ \operatorname{coker}c ~{\color{Gray}\longrightarrow}~ \operatorname{coker}g' where d is a homomorphism, known as the connecting homomorphism. Furthermore, if the morphism f is a monomorphism, then so is the morphism \ker a ~{\color{Gray}\longrightarrow}~ \ker b , and if g is an epimorphism, then so is \operatorname{coker} b ~{\color{Gray}\longrightarrow}~ \operatorname{coker} c . The cokernels here are: \operatorname{coker}a = A'/\operatorname{im}a , \operatorname{coker}b = B'/\operatorname{im}b , \operatorname{coker}c = C'/\operatorname{im}c . Pick an element x in \operatorname{ker} c and view it as an element of C . Since g is surjective, there exists y in B with g(y)=x . By commutativity of the diagram, we have g'(b(y)) = c(g(y)) = c(x) = 0 (since x is in the kernel of c ), and therefore b(y) is in the kernel of g' . Since the bottom row is exact, we find an element z in A' with f'(z)=b(y) . By injectivity of f' , z is unique.
We then define d(x)=z+\operatorname{im}(a) . Now one has to check that d is well-defined (i.e., d(x) only depends on x and not on the choice of y ), that it is a homomorphism, and that the resulting long sequence is indeed exact. One may routinely verify the exactness by diagram chasing (see the proof of Lemma 9.1 in ).
Once that is done, the theorem is proven for abelian groups or modules over a ring. For the general case, the argument may be rephrased in terms of properties of arrows and cancellation instead of elements. Alternatively, one may invoke Mitchell's embedding theorem.
V \otimes_{k[t]} k = V \otimes_{k[t]} (k[t]/(t)) = V/tV = \operatorname{coker}(t) . Given a short exact sequence of k -vector spaces 0 \to M \to N \to P \to 0 , we can induce an exact sequence M \otimes_{k[t]} k \to N \otimes_{k[t]} k \to P \otimes_{k[t]} k \to 0 by right exactness of tensor product. But the sequence 0 \to M \otimes_{k[t]} k \to N \otimes_{k[t]} k \to P \otimes_{k[t]} k \to 0 is not exact in general.
Hence, a natural question arises. Why is this sequence not exact? According to the diagram above, we can induce an exact sequence \ker(t_M) \to \ker(t_N) \to \ker(t_P) \to M \otimes_{k[t]} k \to N \otimes_{k[t]} k \to P \otimes_{k[t]} k \to 0 by applying the snake lemma.
Thus, the snake lemma reflects the tensor product's failure to be exact. If one simply replaces the cokernels in the statement of the snake lemma with the (right) cosets A' / \operatorname{im} a, B' / \operatorname{im} b, C' / \operatorname{im} c' , the lemma is still valid.
The quotients however are not groups, but pointed sets (a short sequence (X, x) \to (Y, y) \to (Z, z) of pointed sets with maps f: X \to Y and g: Y \to Z is called exact if f(X) = g^{-1}(z) ). \begin{matrix} & 1 & \to & C_3 & \to & C_3 & \to 1\\ & \downarrow && \downarrow && \downarrow \\ 1 \to & 1 & \to & S_3 & \to & A_5 \end{matrix} Note that the middle column is not exact: C_2 is not a normal subgroup in the semidirect product. Since A_5 is simple, the right vertical arrow has trivial cokernel.
Meanwhile the quotient group S_3/C_3 is isomorphic to C_2 . The sequence in the statement of the snake lemma is therefore 1 \longrightarrow 1 \longrightarrow 1 \longrightarrow 1 \longrightarrow C_2 \longrightarrow 1, which indeed fails to be exact.
In popular culture
The proof of the snake lemma is taught by Jill Clayburgh's character at the very beginning of the 1980 film It's My Turn.
See also
Zig-zag lemma
External links
Proof of the Snake Lemma in the film It's My Turn
Text derived from https://en.wikipedia.org/w/index.php?oldid=1375057256 under CC BY-SA 4.0; modifications have been made.