The Mayer–Vietoris sequence for singular homology
ProvedHatcher.Singular.mayerVietorisalgebraic-topologyhatchersingular-homology
Let be a ring, a topological space and subsets whose interiors cover . Write , , , for the inclusions, and for singular homology with coefficients in .
Then there are homomorphisms such that the long sequence
is exact, that is, for every :
- the kernel of on is the image of ;
- the kernel of is the image of ;
- the kernel of on is the image of .
The Mayer–Vietoris sequence is the main tool for computing homology by cutting a space into simpler pieces; it gives, for instance, the homology of spheres and of complex projective spaces.
Formalization Note The boundary maps are only asserted to exist. is the product module, the maps are the underlying -linear maps of the induced homomorphisms, and exactness is Mathlib's Function.Exact. The sequence ends with , which is not part of the statement.
Preamble
import Mathlib import Definitions.Def_Hatcher_SingularHomology open CategoryTheory
Formal statement
theorem Hatcher.Singular.mayerVietoris (R : Type) [Ring R] (X : Type) [TopologicalSpace X] (A B : Set X)
(hAB : interior A ∪ interior B = Set.univ) :
∃ δ : ∀ n : ℕ, H R (n + 1) X ⟶ H R n ↥(A ∩ B), ∀ n : ℕ,
Function.Exact
(LinearMap.prod
(map R n (⟨Set.inclusion Set.inter_subset_left, continuous_inclusion _⟩ :
C(↥(A ∩ B), A))).hom
(-(map R n (⟨Set.inclusion Set.inter_subset_right, continuous_inclusion _⟩ :
C(↥(A ∩ B), B))).hom))
(LinearMap.coprod (map R n (incl A)).hom (map R n (incl B)).hom) ∧
Function.Exact
(LinearMap.coprod (map R (n + 1) (incl A)).hom (map R (n + 1) (incl B)).hom)
(δ n).hom ∧
Function.Exact (δ n).hom
(LinearMap.prod
(map R n (⟨Set.inclusion Set.inter_subset_left, continuous_inclusion _⟩ :
C(↥(A ∩ B), A))).hom
(-(map R n (⟨Set.inclusion Set.inter_subset_right, continuous_inclusion _⟩ :
C(↥(A ∩ B), B))).hom)) := by sorrySource
A. Hatcher, *Algebraic Topology*, Cambridge University Press, 2002 (online edition: https://pi.math.cornell.edu/~hatcher/AT/AT.pdf), §2.2, “Mayer–Vietoris Sequences” (pp. 149–150; the maps and are on p. 150), with coefficients as on p. 153. Lean: original formalization for this project (Lean v4.33.1, Mathlib 0df444a), file `Bridge/Singular/MayerVietoris.lean`.