advanced39 min studyLesson 484 in Mathematics

Excision and Mayer–Vietoris

Localize relative homology under valid excision hypotheses and compute a space from an open cover with its overlap maps.

On this page

What you’ll understand

  • State a sufficient excision condition involving closure and interior.
  • Write the signed maps of the Mayer–Vietoris sequence.
  • Use overlap components to compute the circle's first homology.

A space built from manageable pieces can still have global homology that neither piece sees alone. The overlap carries the missing information. Excision explains when relative homology ignores a safely contained region, and Mayer–Vietoris organizes an open cover into a long exact sequence. The hypotheses matter: arbitrary cutting and pasting does not preserve relative groups. We will use a conservative standard excision condition and keep the signs of both overlap inclusions explicit, so the calculation is driven by maps rather than a vague rule to add the holes of the pieces.

Excision removes a region inside the relative subspace

For a pair (X,A)(X,A), suppose U⊆AU\subseteq A and its closure in X lies inside the interior of A in X. Then inclusion (X∖U,A∖U)→(X,A)(X\setminus U,A\setminus U)\to(X,A) induces isomorphisms in singular homology with fixed coefficients. This is a standard sufficient excision hypothesis. The region removed is already contained well inside the part being treated relatively. The theorem does not assert that arbitrary points can be deleted from X without changing ordinary homology.

A proof subdivides singular simplices until each small piece lies in a suitable member of the relevant cover, then compares the small-chain complex with the full singular complex using chain homotopies. Compactness of each individual standard simplex supports the finite subdivision argument; the entire space need not be compact. Excision is therefore local in a carefully controlled algebraic sense. The boundary operation must remain compatible with subdivision, which is why simply discarding every simplex crossing a cut would not supply a valid proof.

U‾⊆int⁡X(A)⟹Hn(X∖U,A∖U;R)≅Hn(X,A;R)\overline U\subseteq\operatorname{int}_X(A)\quad\Longrightarrow\quad H_n(X\setminus U,A\setminus U;R)\cong H_n(X,A;R)
The closure and interior are taken in X. This is a sufficient condition, not permission for arbitrary deletion.↔ Scroll wide equations horizontally.

An open cover produces a signed exact sequence

Let X=U∪VX=U\cup V with U and V open. The Mayer–Vietoris sequence relates the homology of the overlap, the direct sum of the two pieces, and the union. Use the map (i∗,−j∗)(i_*,-j_*) from the overlap and the sum of the two inclusion maps into X. The composite is zero because the two ways to include the overlap in X agree. A connecting map then detects cycles in X assembled from chains in the two pieces whose boundaries cancel on the overlap.

The open-cover assumption guarantees that subdivision can reduce chains to pieces supported within the cover. CW subcomplex versions also exist under suitable excisive conditions, but no arbitrary closed cover is being asserted here. Exactness supplies kernels and cokernels of specific inclusion maps; the groups of the overlap alone are not enough. In low degree, the number and arrangement of overlap components can create a loop in the union even when both open pieces are individually contractible.

⋯→Hn(U∩V;R)→(i∗,−j∗)Hn(U;R)⊕Hn(V;R)→Hn(X;R)→Hn−1(U∩V;R)→⋯\cdots\to H_n(U\cap V;R)\xrightarrow{(i_*,-j_*)}H_n(U;R)\oplus H_n(V;R)\to H_n(X;R)\to H_{n-1}(U\cap V;R)\to\cdots
U and V form an open cover of X; the signed overlap map makes the following composite vanish.↔ Scroll wide equations horizontally.

Geometry tells you the inclusion homomorphisms

For connected contractible pieces, each overlap component maps to the single degree-zero generator of each piece. Under the sign convention above, its image is the same ordered pair with opposite signs. Differences between overlap-component generators then lie in the kernel, and exactness can identify these differences with first-homology classes of the union. This calculation uses ordinary H₀; reduced versions package the same information differently, but switching conventions halfway would remove the kernel one is trying to compute.

For a sphere covered by slightly enlarged hemispheres, the overlap deformation retracts to an equator while each piece is contractible. The reduced sequence shifts positive homology by one, allowing sphere groups to be calculated inductively. A cover by disjoint hemispheres would miss the equator and would not cover the connected sphere. The example illustrates the general habit: establish an actual cover and overlap homotopy types first, then determine the maps, and only then read exactness to infer the unknown groups.

Two arcs create a circle

Cover S1 by two open arcs U and V, each obtained by removing a different point. Their intersection has two contractible components. Compute H1(S1;Z) using the ordinary degree-zero Mayer–Vietoris map.

  1. The arcs have H1=0 and H0=Z. The overlap has H0=Z² with generators e1 and e2 for its two components, and no positive-degree homology.

  2. Both overlap components include into the single component of either arc. Thus (i*,−j*) sends each generator to (1,−1), so its matrix is [[1,1],[−1,−1]]. Its kernel consists of multiples of e1−e2.

  3. The exact segment 0→H1(S1)→Z²→Z² identifies H1(S1) with that kernel, giving Z. The next cokernel is also Z, consistent with the circle being connected and H0(S1)=Z.

The result

The loop arises from a difference of overlap components, even though neither open arc contains a loop.

Explore the model

Interactive lab

Interactive lab · vectors

Compare the signed overlap directions

Pause and Reset, then set both controls to angle −45° and magnitude 1. Its components are (1/√2,−1/√2), the normalized direction of each overlap image (1,−1). Reset and set angle 135° and magnitude 1; predict its negative. Adding one image and subtracting the identical image cancels. The scene shows one vector at a time, illustrating the two-column kernel calculation rather than constructing a topological cover.

Compare the signed overlap directionsPlayback traces a fixed vector and its projections. Angle and magnitude set the geometry; the moving marker does not change them. Current readings: x component: 1.393; y component: 0.975; Magnitude: 1.7. All parameters are adjustable with the labeled controls below.−7.46−3.7303.737.46−3.5−1.7501.753.5xyvvₓ = 1.39
Vectorx / y projectionsTrace marker
x component
1.393
y component
0.975
Magnitude
1.7
t = 0 s

Playback traces a fixed vector and its projections. Angle and magnitude set the geometry; the moving marker does not change them. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forThe signed inclusion map and repeated component images determine the kernel that produces the loop.

Check your understanding

Which deletion satisfies the standard sufficient excision hypothesis for (X,A)?

Try it yourself

Cover S2 by two enlarged open hemispheres, each contractible, with overlap homotopy equivalent to S1. Use reduced Mayer–Vietoris to find reduced H2 and reduced H1 over the integers.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

The reduced homology of each cover piece vanishes. Relate the sphere groups to the overlap one degree lower.

Compare with the solution

In the reduced exact sequence, the zero groups from the two contractible pieces give an isomorphism from reduced H2(S2) to reduced H1(S1)=Z. They also give an isomorphism from reduced H1(S2) to reduced H0(S1)=0 because the overlap circle is connected. Thus reduced H2(S2)=Z and reduced H1(S2)=0. Ordinary H0(S2) is still Z. The open enlargement ensures a genuine cover with an equatorial band as overlap, rather than two disconnected pieces.

Take it with you

  • Excision needs geometric containment hypotheses.
  • Mayer–Vietoris uses signed inclusion maps from a genuine overlap.
  • Low-degree overlap components can encode loops invisible inside each piece.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.