Mayer-Vietoris Sequence

The Mayer–Vietoris sequence is a long exact sequence relating the (co)homology of a space to the (co)homology of two subspaces whose interiors cover and of their intersection . In words: if you can cut a space into two overlapping pieces, you can compute its homology from the homology of the pieces and their overlap, with a connecting map measuring the "twisting" along the overlap. It applies in singular, simplicial, cellular, sheaf, de Rham, and generalized (co)homology theories. Named after Walther Mayer and Leopold Vietoris, who developed it around 1929–1930.

Given a topological space where and are subspaces whose interiors cover , the Mayer–Vietoris sequence is the long exact sequence

It is one of the two principal computational engines of algebraic topology (the other being the long exact sequence of a pair), and it is the homological analogue of the Seifert–van Kampen theorem for the fundamental group. Its power lies in divide and conquer: complicated spaces are assembled from simple, well-understood pieces glued along their intersection. A surprising feature is the connecting homomorphism , which raises (in cohomology, lowers) degree by one and encodes genuinely global gluing information — it is why the homology of depends nontrivially on even though the pieces (contractible hemispheres) carry none.

The Core Insight

A cycle on can be subdivided so that each piece lies in or in . The obstruction to writing a cycle on as the sum of a cycle on and a cycle on is recorded in : when you split a chain , even if the individual pieces satisfy , a cycle living in . The connecting map sends to this overlap cycle. Exactness packages this single observation into a machine that recovers the global from the local.

Formal Statement

Excisive couple / Mayer–Vietoris triad

Let be a topological space and let . The pair is called an excisive couple (and a Mayer–Vietoris triad) if

1
i.e. the interiors of and cover .

Here:

  • is the ambient space;
  • are the two covering subspaces;
  • is their intersection;
  • denotes topological interior in .

This condition guarantees that the inclusion is an excision, which is the technical input that makes the sequence exact.

⟳The covering-by-interiors condition is exactly what is needed so that small chains (relative to the open cover ) compute the homology of , via the Small Simplices Theorem / barycentric subdivision.

Mayer–Vietoris, homology

Let be a Mayer–Vietoris triad. Denote the inclusions

Then there is a long exact sequence of homology groups (with coefficients in any abelian group )
2
where the maps are
3
and is the connecting homomorphism. The signs ensure .

⟳ is the diagonal inclusion into the direct sum; is the difference of the two inclusions so that classes coming from cancel. Exactness comes from the snake lemma applied to a short exact sequence of chain complexes.

Reduced and cohomological versions

For the reduced homology , the same sequence holds provided , terminating

4

In cohomology, the arrows reverse and the connecting map raises degree:

5

⟳Dualize the short exact sequence of chain complexes (apply ) and run the snake lemma the other way; equivalently use the short exact sequence of cochain complexes built from the cover.

Why It Holds / Derivation

The short exact sequence of chains

Step 1 — Small chains. Let and let denote the subgroup of generated by singular simplices whose image lies entirely in or entirely in . Concretely
6
⟳A chain is "-small" iff each generating simplex factors through one of the cover elements; the sum of subcomplexes is the span of such simplices.
Step 2 — Small Simplices Theorem. Because , barycentric subdivision shows the inclusion is a chain-homotopy equivalence, hence
7
⟳Iterated barycentric subdivision eventually pushes every simplex into the open cover by the Lebesgue number lemma; the subdivision operator is chain homotopic to the identity.
Step 3 — The short exact sequence. Form the sequence of chain complexes
8
with and .
⟳ is injective (a chain in the intersection mapping to zero in both must vanish); is surjective by definition of ; exactness in the middle is the statement that forces .
Step 4 — Snake lemma. A short exact sequence of chain complexes yields a long exact sequence in homology. Substituting from Step 2 gives [2]. The connecting homomorphism is constructed as follows: given , write with , ; then is a cycle, and
9
⟳This is the standard zig-zag of the snake lemma. Since we get ; that common boundary is a cycle in the intersection, well-defined up to boundaries.

The covering condition [1] is essential and is not satisfied merely by as sets. If and are closed and meet only along a "thin" set whose interiors do not cover, the naive sequence can fail. For CW complexes one typically thickens subcomplexes to open neighborhoods (which deformation retract) so that the interior condition holds; the maps remain those of the subcomplexes up to homotopy equivalence.

Walther Mayer & Leopold Vietoris | 1887–1948 / 1891–2002

Walther Mayer, an Austrian mathematician, served as Albert Einstein's assistant ("Einstein's calculator") at Princeton and worked extensively on combinatorial topology and tensor calculus. Leopold Vietoris, also Austrian, is famous both for his topological contributions — the Vietoris topology, Vietoris–Rips complexes used today in topological data analysis, and the Vietoris homology theory — and for his extraordinary longevity, dying at age 110. Around 1929–1930 Mayer, prompted by lectures and discussions with Vietoris, formulated the exact-sequence relation between the homology of a complex and that of two subcomplexes. Vietoris had developed the relevant homology machinery for general (non-triangulable) spaces. The synthesis of their work into the sequence that bears both names became one of the cornerstones of the homological-algebra revolution of the 1940s–50s.

Building Intuition

Think of as a country, and as two overlapping maps that together cover it, and homology classes as "loops/holes that cannot be filled." If you have a global loop on , you can cut it where the two maps overlap. The pieces on map and map might each be open arcs (boundaries), but where you cut — in the overlap — you create endpoints. The connecting map remembers those endpoints as a cycle in the overlap. Exactness says: a global hole exists precisely when the overlap forces an obstruction that cannot be canceled by holes already present in or . The sphere is the cleanest example: both hemispheres are contractible (no holes), yet their overlap is a homotopy , and transports the -dimensional hole of the equator up to the -dimensional hole of the whole sphere.

Mayer–Vietoris decomposition of the circle $S^1$ into two arcs with two-component overlap

S¹ = A ∪ B, A∩B = two arcs A (upper arc) B (lower arc) p q H₁(S¹)=ℤ ↑ ∂ H̃₀(A∩B)=ℤ (two points → rank 1)

Worked Examples

Homology of the $n$-sphere by induction

Given: for . Cover by and . Steps:
  1. Each of is homeomorphic to , hence contractible: .
  2. deformation retracts onto the equator .
  3. The reduced sequence [4] in degree gives, since the term vanishes,
10
⟳Between two zero groups (the terms vanish in every positive degree), is an isomorphism by exactness.
  1. So is an isomorphism: .
  2. Base case (two points): , all else . Induct.
Boxed answer:

Homology of the torus $T^2 = S^1\times S^1$

Given: Decompose as = a neighborhood of one circle's worth (a "fat" cylinder) and = the complementary cylinder, so , with = two disjoint annuli. Steps:
  1. , , so .
  2. , so .
  3. Write the sequence in low degrees ():
11
⟳ and force ; the rest is the tail of [2].
  1. The map sends each of the two boundary circles to the same generator (both annuli wrap the longitude), so has rank 1; thus and .
  2. Therefore ; counting ranks gives .
Boxed answer:
(Consistent with having one connected component, two independent loops, one enclosed void; Euler characteristic .)

Common Misconceptions

The connecting map is not natural in an obvious "first guess" way. Students often expect to be a forgetful or restriction map. It is neither — it is defined through the splitting of a chain (choices with ) and the snake-lemma diagram chase. It is, however, natural with respect to maps of triads, and this naturality is what allows Mayer–Vietoris to fit into long exact ladders and spectral-sequence comparisons. Direct sum, not direct product, and watch the sign. The middle term is with the map . Dropping the minus sign breaks and destroys exactness. Some texts instead put the sign in ; either convention works, but you must be consistent.

Failure without the interior-cover condition

Take , , . These are closed, , and . Here and , whose union is , so [1] fails at the single point . In this benign case all spaces are contractible and the sequence still works by accident. But replace with a pathological pair where the overlap is not a deformation retract of a neighborhood (e.g. the topologist's sine curve glued to an arc), and the excision step Step 2 collapses: need not be a homotopy equivalence, and the resulting "sequence" need not be exact. The lesson: closedness is not enough — you genuinely need open interiors to cover, or subspaces that admit collared/neighborhood-retract structure.

Connections

Mayer–Vietoris is the abelian, all-degrees shadow of Seifert–van Kampen Theorem, which computes from a two-piece cover (a pushout of groups rather than an exact sequence). Both are instances of descent / gluing. The sequence is the special case of the Spectral Sequence of an open cover (the Mayer–Vietoris / Čech–to–derived-functor spectral sequence) when the cover has only two elements. In sheaf theory it is precisely the long exact sequence associated to the short exact sequence , linking it to Sheaf Cohomology and Čech Cohomology. In differential geometry the de Rham version connects it to de Rham Cohomology via partitions of unity, and the dual statement for compactly supported forms gives Poincaré Duality. It is also a corollary of the Eilenberg–Steenrod Axioms (excision + exactness of pairs), hence holds for any Generalized Homology Theory such as K-theory and cobordism.

Real-World Applications

  1. Topological Data Analysis (TDA). Persistent homology of point clouds is often computed by covering data with overlapping balls (Vietoris–Rips/Čech complexes) and gluing local homology via Mayer–Vietoris, enabling distributed and parallel computation of barcodes.
  2. Sensor network coverage (de Silva–Ghrist). Determining whether a region is fully covered by sensors uses homology of the nerve complex; Mayer–Vietoris glues local coverage data into a global obstruction in .
  3. Computational topology / mesh processing. Cohomology generators for texture mapping and vector-field design on surfaces are computed piecewise on mesh patches and assembled by Mayer–Vietoris.
  4. Quantum field theory & cobordism. Topological field theories assign invariants to manifolds glued along boundaries; gluing formulas (e.g. for Seiberg–Witten and Donaldson invariants) are Mayer–Vietoris-type statements in Floer/instanton (co)homology.
  5. Algebraic geometry / GAGA-type gluing. Cohomology of varieties built from affine charts (e.g. computing ) uses Mayer–Vietoris over a Zariski or analytic cover.
  6. Electromagnetism on complicated domains. Finite-element solvers for Maxwell's equations need the cohomology of the air region (cuts/loops); these are computed by decomposing the domain and applying the de Rham Mayer–Vietoris sequence.
  7. Robotics configuration spaces. Homology of configuration spaces of mechanisms (assembled from local coordinate patches) is computed by Mayer–Vietoris to detect topological obstructions to motion planning.

Historical Development

  • 1895–1904: Henri Poincaré founds combinatorial topology and defines Betti numbers and torsion in Analysis Situs, providing the homological objects that the sequence will later relate.
  • 1925–1926: Emmy Noether reframes homology in terms of groups and homomorphisms rather than numbers, making exact-sequence reasoning conceivable.
  • 1929: Leopold Vietoris develops a homology theory for general metric (non-triangulable) spaces, introducing the limit/nerve techniques that underlie the gluing philosophy.
  • 1929–1930: Walther Mayer, in correspondence and lectures with Vietoris in Vienna, formulates the exact relationship between the homology of a complex and of two subcomplexes — the prototype of the sequence.
  • 1930s: The relation is used in special cases (spheres, projective spaces) but stated in cumbersome combinatorial language, without the modern notion of "exact sequence."
  • 1941–1942: Witold Hurewicz, and independently others, sharpen the language of exact sequences; the term exact sequence enters usage.
  • 1945: Samuel Eilenberg and Norman Steenrod axiomatize homology theory (Eilenberg–Steenrod axioms), from which Mayer–Vietoris follows formally from excision and the exact sequence of a pair.
  • 1952: Eilenberg–Steenrod's Foundations of Algebraic Topology presents Mayer–Vietoris in its now-standard categorical form, valid for any homology theory.
  • 1990s–2000s: Carlsson, Ghrist, de Silva, Edelsbrunner and others revive Vietoris's gluing ideas in persistent homology and TDA, returning the sequence to computational practice.

Subtleties & Limits

The two-piece sequence generalizes to arbitrary open covers via the Mayer–Vietoris (Čech) spectral sequence, but extracting closed-form homology from many overlapping pieces is genuinely hard: the spectral sequence may have nonzero higher differentials and nontrivial extension problems, both of which can obstruct mechanical computation. In persistent (co)homology, a fully functorial, stable Mayer–Vietoris formalism for persistence modules — controlling how barcodes glue with interleaving/stability guarantees — is an active research area; the relevant "exactness up to interleaving distance" statements are subtle and not yet a closed theory. For generalized homology theories with products (e.g. complex cobordism, -theory) the multiplicative structure of the connecting map and its interaction with the cup/external product (the Mayer–Vietoris analogue of the cohomology ring's behavior under gluing) requires care; clean gluing formulas for ring structures are theory-dependent. Finally, the non-excisive case — pairs not satisfying [1], common in singular or stratified spaces — generally requires intersection homology or homotopy-coherent descent rather than the naive sequence.

See Also

Excision Theorem · Long Exact Sequence of a Pair · Seifert–van Kampen Theorem · Eilenberg–Steenrod Axioms · Čech Cohomology · de Rham Cohomology · Poincaré Duality · Spectral Sequence · Generalized Homology Theory

Before this

  • Singular Homology — provides the chain complexes $C_\bullet(X)$ that the sequence is built from.
  • Exact Sequences — the snake lemma turning a short exact sequence of complexes into the long exact sequence.
  • Excision Theorem — the technical heart guaranteeing $H_*(C^{\mathcal U})\cong H_*(X)$.
  • Chain Complexes and Chain Homotopy — barycentric subdivision is a chain homotopy used in the small-simplices theorem.
  • CW Complexes — the standard setting where subspace thickenings make the interior-cover condition routine.

Where this leads

  • Seifert–van Kampen Theorem — the $\pi_1$ analogue: gluing fundamental groups along a cover.
  • Spectral Sequence — the multi-piece generalization (Mayer–Vietoris / Čech spectral sequence).
  • de Rham Cohomology — the smooth version via partitions of unity, key to computing cohomology of manifolds.
  • Sheaf Cohomology — abstracts Mayer–Vietoris as the long exact sequence of a short exact sequence of sheaves.
  • Persistent Homology — modern computational descendant gluing local data on data clouds.