Definition
A long exact sequence in homology (or cohomology) that relates the homology groups of a topological space decomposed as the union of two subspaces U and V to the homology of U, V, and their intersection U∩V via connecting homomorphisms.
Principle
Principle
Decomposing a space into two overlapping pieces yields Mayer-Vietoris exactness: the failure of cycles in the union to be separate is measured by maps from the intersection, and connecting homomorphisms link these measurements across degrees to produce a long exact sequence.
Demonstration
Demonstration
Compute the homology of the n-sphere S^n by writing S^n as the union of two hemispheres U and V, each contractible, with intersection homotopy equivalent to S^{n-1}. The Mayer-Vietoris sequence then yields H_k(S^n) from the known homology of U, V and U∩V, recovering the classical result that H_n(S^n)≅Z and other reduced homology vanishes.
Misapplication
Misapplication
Using Mayer-Vietoris for arbitrary coverings without verifying excision-type hypotheses or applying it to non-pairwise decompositions without adjusting signs and indices can lead to incorrect gluing; likewise ignoring reduced vs. unreduced homology conventions causes sign or index errors.
Consequence
Consequence
Provides an inductive and computational tool to calculate homology/cohomology of complex spaces from simpler pieces, and to detect nontrivial cycles supported across the overlap.
Reversal
Reversal
If the maps from U and V into the union are isomorphisms in a range of degrees, the Mayer-Vietoris sequence collapses and yields isomorphisms between the homologies of the pieces and of the union; conversely, nontrivial connecting homomorphisms indicate classes that cannot be localized to a single piece.
Boundary
Boundary
Applies when U and V form an appropriate open (or excisive) cover, or more generally when inclusion maps satisfy excision hypotheses; it is not a black-box tool for arbitrary infinite covers or decompositions lacking the required topological hypotheses.
Semantic Tension
Semantic Tension
Competes conceptually with spectral-sequence techniques and Čech (co)homology; Mayer-Vietoris is elementary and hands-on for two-piece decompositions, while spectral sequences handle multi-stage filtrations but with heavier formalism.
Synthesis
Synthesis
Mayer-Vietoris packages how homological information on two overlapping subspaces and their intersection assembles into the homology of the whole via a long exact sequence of maps and connecting homomorphisms, enabling calculation and detection of global classes from local data.