Snake lemma

Math has many tools.

One tool has a fun name. It is called the snake lemma. It helps us link things together. It builds long lines of ideas.

The name comes from a shape. The lines make a shape like a snake. It looks like an S shape. This shape slithers through the math map. It helps us find new links. This makes the math work well.

It is a very helpful tool.

Math has many special tools. One tool is called the snake lemma.

It is used in a field called homological algebra. This tool helps math experts build long exact sequences. An exact sequence is a long line of connected ideas.

The name comes from how the math looks on paper. When you draw the links, they form an S shape. This shape looks like a slithering snake.

The lemma works in a place called an abelian category. This includes things like groups or vector spaces. The tool uses something called a connecting homomorphism. This is a special link that joins different parts. It connects the kernels and the cokernels of the math maps. A kernel is a set of things that go to zero. A cokernel is what is left over after a map.

This tool is very important for many math problems. It helps show how different parts of a system fit together.

Math has many special tools to solve hard puzzles. One such tool is called the snake lemma.

It is used in a field called homological algebra. This field studies how different parts of a system connect. The lemma helps experts build long exact sequences. An exact sequence is a long chain of connected math ideas. These chains show how one thing leads to another in a perfect way.

To understand how it works, imagine a diagram with rows of math maps. These maps are like paths between different groups of numbers. The lemma works in a place called an abelian category. This includes things like abelian groups or vector spaces. The tool uses a special link called a connecting homomorphism. This link joins the kernels and the cokernels of the maps. A kernel is a set of things that go to zero. A cokernel is what is left over after a map happens.

The name of this tool is very easy to remember. You can see it by looking at a special diagram. When you draw the links between the different parts, they form a shape. This shape looks like a reversed S. It looks just like a slithering snake moving across the page.

This visual pattern makes the name a perfect fit for the math.

Mathematicians use this tool to see how systems fail or succeed. For example, it helps with the tensor product. A tensor product might not be exact on its own. The snake lemma shows exactly why that happens.

It can also be used in algebraic topology. This is a way to study shapes using math. The lemma is a crucial part of these big ideas. It works even when we look at very complex structures.

You might see this math in unexpected places. In the 1980 film It's My Turn, a character teaches the proof. This character is played by Jill Clayburgh.

It shows that even deep math can be part of a story. The lemma is also known as the zig-zag lemma. It is a way to find order in a mess of connections. It helps us see the hidden paths in math.

The snake lemma is a fundamental tool in homological algebra. This branch of mathematics studies the relationships between different algebraic structures. Mathematicians use the lemma to construct long exact sequences. An exact sequence is a chain of objects and maps where the output of one map perfectly matches the input of the next. The lemma is valid in any abelian category. Examples of these categories include the category of abelian groups or the category of vector spaces over a field.

To understand the mechanism, consider a commutative diagram with two rows. Each row is an exact sequence, meaning the maps flow into each other without gaps or overlaps. The diagram also features three vertical maps, often labeled $a$, $b$, and $c$. These vertical maps connect the top row to the bottom row. The lemma focuses on the kernels and cokernels of these three maps. A kernel consists of all elements that a map sends to zero. A cokernel represents the remaining part of a structure after a map has been applied.

The lemma's most important result is the existence of a connecting homomorphism. This map, often called $d$, bridges the gap between the kernel of $c$ and the cokernel of $a$. This connection completes a long exact sequence. The process of finding this map is called a diagram chase. In the case of abelian groups, you pick an element in the kernel of $c$. You then move through the diagram using the horizontal maps. You must find an element that lands in the correct spot in the cokernel. This specific path creates the link between the two ends of the sequence.

There are specific properties regarding the types of maps involved. If the middle vertical map $f$ is a monomorphism, then the map from the kernel of $a$ is also a monomorphism. A monomorphism is a type of map that is injective, meaning it does not collapse different elements into the same one. Similarly, if the map $g$ is an epimorphism, then the map to the cokernel of $c$ is also an epimorphism. An epimorphism is a surjective map, meaning it covers the entire target set. These details ensure the resulting long sequence maintains its mathematical integrity.

Historically and theoretically, the lemma is known for its naturality. This means that the sequence produced by the lemma behaves predictably when you change the maps in a consistent way. If you have a diagram of two different commutative diagrams with exact rows, the snake lemma can be applied to both. This results in two long exact sequences that are related to each other. This relationship is captured in a larger commutative diagram. This property is vital for researchers working in complex fields like algebraic topology.

One notable application involves the tensor product. In the category of vector spaces, the tensor product is a way to combine spaces. When you apply a tensor product to a short exact sequence, the result might not be exact. This is known as the failure of the tensor product to be exact. The snake lemma provides a way to measure this failure. By applying the lemma, mathematicians can construct a sequence that accounts for the missing pieces. This helps explain exactly why the original sequence lost its exactness.

However, the lemma does not work in every mathematical setting. It can fail in the category of groups depending on how you define a cokernel. If you use the standard categorical definition of a cokernel for groups, the resulting sequence might only be a chain complex. A chain complex is a sequence where the compositions of maps are zero, but it is not necessarily exact. For example, using the alternating group $A_5$ can provide a counterexample. In such cases, the sequence fails to be exact because the middle column is not exact. To make it work in groups, one must use right cosets instead of cokernels. This turns the sequence into a sequence of pointed sets rather than groups.