We now return to the task of constructing the Mayer-Vietoris sequence. There are two key ingredients: the Snake Lemma (in this section) and subdivision (in the next section). The videos cover this material in a slightly different order than the notes: the first video is attached to Definition 17.3 below.
The basic input for the Snake Lemma is as follows: we have chain complexes , and and chain maps
which form a short exact sequence. One might hope that the resulting sequence
would also be a short exact sequence, but that is not quite right. We will show that the above sequence is exact (in the sense that ), but need not be injective, and need not be surjective. In other words, need not be zero, and need not be all of . We can still obtain a great deal of information about and , but that will require some preparation. For the moment we will just prove the easier statement mentioned above.
Let be a short exact sequence of chain maps between chain complexes. Then in the resulting sequence we have .
First, as the sequence is exact we have . It follows that , so .
Conversely, suppose we are given an element ; must show that it lies in . If then we have for some with . We are assuming that , which means that is zero in the quotient group , which means that , which means that for some . Also, we are assuming that the sequence is short exact, which means in particular that is surjective. We can therefore choose with . We now have
so . We also have by our exactness assumption, so we can find with . From our initial assumptions we have , and also so , so . As is a chain map this gives , and is injective so . This means we have an element . This satisfies but so is the same as , which is . We conclude that , so as claimed.
We can display the relevant groups and elements as follows:
The two dotted arrows are supposed to indicate the relation . ∎
For as above, there is a natural map such that the sequence
is exact for all .
The proof will be broken into a number of steps. The map will be defined in Definition 17.6, and Propositions 17.1, 17.10 and 17.11 will show that the resulting long sequence is exact.
A snake for the above sequence is a system such that
;
is a cycle such that ;
is an element with ;
is a cycle with ;
.
More specifically, we say that a system as above is a snake from to .
For any , there is a snake starting with .
Consider an element . As by definition, we can certainly choose such that . As the sequence is short exact, we know that is surjective, so we can choose with . As is a chain map we have (the last equation because ). This means that , but because the sequence is exact, so we have with . Note also that (because is a chain map and ). On the other hand, exactness means that is injective, so the relation implies that . This shows that , so we can put . We now have a snake starting with as required. ∎
Suppose we have two snakes that have the same starting point; then they also have the same endpoint.
Suppose we have two snakes that start with . We can then subtract them to get a snake starting with . It will be enough to show that this ends with as well, or equivalently that . The first snake condition says that , which means that for some . Because is surjective we can also choose with , and this gives . The next snake condition says that . We can combine these facts to see that , so . We can therefore find with . We can apply to this using and to get . On the other hand, the third snake condition tells us that . Subtracting these gives , but is injective, so , so . The final snake condition now says that , but so . ∎
For any , we define to be the endpoint of any snake that starts with . (This is well-defined by the last two lemmas.)
It is easy to see that the sum of two snakes is a snake, and from that we can deduce that is a homomorphism.
The slogan behind the definition is that . In more detail, suppose we have . To calculate , we must find a snake of the form , then . The slogan glosses over the distinction between and , and the distinction between and . The condition means that is a choice of , and the condition means that is essentially . The point of the above definitions and lemmas is to make this slogan precise.
The Snake Lemma (in a slightly different incarnation) is probably the most advanced piece of mathematics ever to appear in a mainstream movie:
The sequence is exact (or equivalently, ).
First, suppose that , so for some with . We find that is a snake starting with , so . From this we get and .
Conversely, consider an element . As , there must exists a snake of the form . The last snake condition says that , so we must have for some . Another snake condition says that , so we have . This means that is a cycle, so we have a homology class . This satisfies , but and so this simplifies to , so . ∎
The sequence is exact (or equivalently, ).
First suppose we have an element . Choose a snake starting with , so . We then have , but one of the snake conditions says that , so , so . This proves that and so .
Conversely, suppose that . We can choose such that . Now , so , so there exists with . Put . We then have , and this is zero because . This means that , so we can define . We now see that is a snake, so , so . ∎