fbpx
Wikipedia

Snake lemma

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.

Statement edit

In an abelian category (such as the category of abelian groups or the category of vector spaces over a given field), consider a commutative diagram:

 

where the rows are exact sequences and 0 is the zero object.

Then there is an exact sequence relating the kernels and cokernels of a, b, and c:

 

where d is a homomorphism, known as the connecting homomorphism.

Furthermore, if the morphism f is a monomorphism, then so is the morphism  , and if g' is an epimorphism, then so is  .

The cokernels here are:  ,  ,  .

Explanation of the name edit

To see where the snake lemma gets its name, expand the diagram above as follows:

 

and then the exact sequence that is the conclusion of the lemma can be drawn on this expanded diagram in the reversed "S" shape of a slithering snake.

Construction of the maps edit

 
An animation of the construction of the map d

The maps between the kernels and the maps between the cokernels are induced in a natural manner by the given (horizontal) maps because of the diagram's commutativity. The exactness of the two induced sequences follows in a straightforward way from the exactness of the rows of the original diagram. The important statement of the lemma is that a connecting homomorphism d exists which completes the exact sequence.

In the case of abelian groups or modules over some ring, the map d can be constructed as follows:

Pick an element x in ker c and view it as an element of C; since g is surjective, there exists y in B with g(y) = x. Because of the 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). z is unique by injectivity of f '. We then define d(x) = z + 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 [1]).

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.

Naturality edit

In the applications, one often needs to show that long exact sequences are "natural" (in the sense of natural transformations). This follows from the naturality of the sequence produced by the snake lemma.

If

 

is a commutative diagram with exact rows, then the snake lemma can be applied twice, to the "front" and to the "back", yielding two long exact sequences; these are related by a commutative diagram of the form

 

Example edit

Let   be field,   be a  -vector space.   is  -module by   being a  -linear transformation, so we can tensor   and   over  .

 

Given a short exact sequence of  -vector spaces  , we can induce an exact sequence   by right exactness of tensor product. But the sequence   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   by applying the snake lemma. Thus, the snake lemma reflects the tensor product's failure to be exact.

In the category of groups edit

While many results of homological algebra, such as the five lemma or the nine lemma, hold for abelian categories as well as in the category of groups, the snake lemma does not. Indeed, arbitrary cokernels do not exist. However, one can replace cokernels by (left) cosets  ,  , and  . Then the connecting homomorphism can still be defined, and one can write down a sequence as in the statement of the snake lemma. This will always be a chain complex, but it may fail to be exact. Exactness can be asserted, however, when the vertical sequences in the diagram are exact, that is, when the images of a, b, and c are normal subgroups.[citation needed]

Counterexample edit

Consider the alternating group  : this contains a subgroup isomorphic to the symmetric group  , which in turn can be written as a semidirect product of cyclic groups:  .[2] This gives rise to the following diagram with exact rows:

 

Note that the middle column is not exact:   is not a normal subgroup in the semidirect product.

Since   is simple, the right vertical arrow has trivial cokernel. Meanwhile the quotient group   is isomorphic to  . The sequence in the statement of the snake lemma is therefore

 ,

which indeed fails to be exact.

In popular culture edit

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.[3]

See also edit

References edit

  1. ^ Lang 2002, p. 159
  2. ^ "Extensions of C2 by C3". GroupNames. Retrieved 2021-11-06.
  3. ^ Schochet, C. L. (1999). "The Topological Snake Lemma and Corona Algebras" (PDF). New York Journal of Mathematics. 5: 131–7. CiteSeerX 10.1.1.73.1568. Archived (PDF) from the original on 2022-10-09.

External links edit

snake, lemma, snake, lemma, tool, used, mathematics, particularly, homological, algebra, construct, long, exact, sequences, snake, lemma, valid, every, abelian, category, crucial, tool, homological, algebra, applications, instance, algebraic, topology, homomor. 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 Contents 1 Statement 2 Explanation of the name 3 Construction of the maps 4 Naturality 5 Example 6 In the category of groups 6 1 Counterexample 7 In popular culture 8 See also 9 References 10 External linksStatement editIn an abelian category such as the category of abelian groups or the category of vector spaces over a given field consider a commutative diagram nbsp where the rows are exact sequences and 0 is the zero object Then there is an exact sequence relating the kernels and cokernels of a b and c ker a ker b ker c d coker a coker b coker c displaystyle 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 nbsp 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 ker b displaystyle ker a color Gray longrightarrow ker b nbsp and if g is an epimorphism then so is coker b coker c displaystyle operatorname coker b color Gray longrightarrow operatorname coker c nbsp The cokernels here are coker a A im a displaystyle operatorname coker a A operatorname im a nbsp coker b B im b displaystyle operatorname coker b B operatorname im b nbsp coker c C im c displaystyle operatorname coker c C operatorname im c nbsp Explanation of the name editTo see where the snake lemma gets its name expand the diagram above as follows nbsp and then the exact sequence that is the conclusion of the lemma can be drawn on this expanded diagram in the reversed S shape of a slithering snake Construction of the maps edit nbsp An animation of the construction of the map d The maps between the kernels and the maps between the cokernels are induced in a natural manner by the given horizontal maps because of the diagram s commutativity The exactness of the two induced sequences follows in a straightforward way from the exactness of the rows of the original diagram The important statement of the lemma is that a connecting homomorphism d exists which completes the exact sequence In the case of abelian groups or modules over some ring the map d can be constructed as follows Pick an element x in ker c and view it as an element of C since g is surjective there exists y in B with g y x Because of the 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 z is unique by injectivity of f We then define d x z 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 1 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 Naturality editIn the applications one often needs to show that long exact sequences are natural in the sense of natural transformations This follows from the naturality of the sequence produced by the snake lemma If nbsp is a commutative diagram with exact rows then the snake lemma can be applied twice to the front and to the back yielding two long exact sequences these are related by a commutative diagram of the form nbsp Example editLet k displaystyle k nbsp be field V displaystyle V nbsp be a k displaystyle k nbsp vector space V displaystyle V nbsp is k t displaystyle k t nbsp module by t V V displaystyle t V to V nbsp being a k displaystyle k nbsp linear transformation so we can tensor V displaystyle V nbsp and k displaystyle k nbsp over k t displaystyle k t nbsp V k t k V k t k t t V t V coker t displaystyle V otimes k t k V otimes k t k t t V tV operatorname coker t nbsp Given a short exact sequence of k displaystyle k nbsp vector spaces 0 M N P 0 displaystyle 0 to M to N to P to 0 nbsp we can induce an exact sequence M k t k N k t k P k t k 0 displaystyle M otimes k t k to N otimes k t k to P otimes k t k to 0 nbsp by right exactness of tensor product But the sequence 0 M k t k N k t k P k t k 0 displaystyle 0 to M otimes k t k to N otimes k t k to P otimes k t k to 0 nbsp is not exact in general Hence a natural question arises Why is this sequence not exact nbsp According to the diagram above we can induce an exact sequence ker t M ker t N ker t P M k t k N k t k P k t k 0 displaystyle 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 nbsp by applying the snake lemma Thus the snake lemma reflects the tensor product s failure to be exact In the category of groups editWhile many results of homological algebra such as the five lemma or the nine lemma hold for abelian categories as well as in the category of groups the snake lemma does not Indeed arbitrary cokernels do not exist However one can replace cokernels by left cosets A im a displaystyle A operatorname im a nbsp B im b displaystyle B operatorname im b nbsp and C im c displaystyle C operatorname im c nbsp Then the connecting homomorphism can still be defined and one can write down a sequence as in the statement of the snake lemma This will always be a chain complex but it may fail to be exact Exactness can be asserted however when the vertical sequences in the diagram are exact that is when the images of a b and c are normal subgroups citation needed Counterexample edit Consider the alternating group A 5 displaystyle A 5 nbsp this contains a subgroup isomorphic to the symmetric group S 3 displaystyle S 3 nbsp which in turn can be written as a semidirect product of cyclic groups S 3 C 3 C 2 displaystyle S 3 simeq C 3 rtimes C 2 nbsp 2 This gives rise to the following diagram with exact rows 1 C 3 C 3 1 1 1 S 3 A 5 displaystyle begin matrix amp 1 amp to amp C 3 amp to amp C 3 amp to 1 amp downarrow amp amp downarrow amp amp downarrow 1 to amp 1 amp to amp S 3 amp to amp A 5 end matrix nbsp Note that the middle column is not exact C 2 displaystyle C 2 nbsp is not a normal subgroup in the semidirect product Since A 5 displaystyle A 5 nbsp is simple the right vertical arrow has trivial cokernel Meanwhile the quotient group S 3 C 3 displaystyle S 3 C 3 nbsp is isomorphic to C 2 displaystyle C 2 nbsp The sequence in the statement of the snake lemma is therefore 1 1 1 1 C 2 1 displaystyle 1 longrightarrow 1 longrightarrow 1 longrightarrow 1 longrightarrow C 2 longrightarrow 1 nbsp which indeed fails to be exact In popular culture editThe proof of the snake lemma is taught by Jill Clayburgh s character at the very beginning of the 1980 film It s My Turn 3 See also editZig zag lemmaReferences edit Lang 2002 p 159 Extensions of C2 by C3 GroupNames Retrieved 2021 11 06 Schochet C L 1999 The Topological Snake Lemma and Corona Algebras PDF New York Journal of Mathematics 5 131 7 CiteSeerX 10 1 1 73 1568 Archived PDF from the original on 2022 10 09 Lang Serge 2002 III 9 The Snake Lemma Algebra 3rd ed Springer pp 157 9 ISBN 978 0 387 95385 4 Atiyah M F Macdonald I G 1969 Introduction to Commutative Algebra Addison Wesley ISBN 0 201 00361 9 Hilton P Stammbach U 1997 A course in homological algebra Graduate Texts in Mathematics Springer p 99 ISBN 0 387 94823 6 External links editWeisstein Eric W Snake Lemma MathWorld Snake Lemma at PlanetMath Proof of the Snake Lemma in the film It s My Turn Retrieved from https en wikipedia org w index php title Snake lemma amp oldid 1143840788, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.