Proof of the Mayer-Vietoris Exact Sequence
The Mayer-Vietoris sequence is the primary computational tool in de Rham cohomology. Its proof is a careful application of the short exact sequence of differential form complexes together with the snake lemma.
Statement
Let with open. There is a long exact sequence
Proof
Step 1: Short exact sequence of complexes. Define the sequence of cochain complexes
where and .
Injectivity of : If and , then on .
: means , so and patch to a global form with .
Surjectivity of : Let and be a partition of unity subordinate to . Set (extended by zero outside , smooth on ) and (smooth on ). Then .
Step 2: Long exact sequence. The short exact sequence of cochain complexes induces a long exact sequence in cohomology by the snake lemma (zig-zag lemma). This gives the Mayer-Vietoris sequence.
Step 3: Connecting homomorphism. We describe explicitly. Given a closed -form on , lift it: set on and on . Then on and on agree on :
(since ). So and patch to a global closed -form on , and .
Step 4: Exactness verification. The exactness at each position follows from standard homological algebra (snake lemma). We verify:
- At : (immediate), and follows from patching.
- At : because if with , then the lift can be chosen with .
- At : because which is exact.
Applications
To compute via Mayer-Vietoris: choose so that , , and are known (or simpler). Then the long exact sequence, combined with knowledge of the maps, determines . The key difficulty is usually computing the connecting homomorphism .
Cover by two overlapping arcs , with . The sequence gives . The map sends , which has rank 1. So and .