Detecting holes algebraically — cycles modulo boundaries
A loop that closes up but fills nothing marks a hole. Homology turns that idea into algebra and counts the holes of a space in every dimension.
Click edges on the torus (a square with opposite edges glued) to build a chain, or try the presets. Draw a horizontal loop, a vertical loop, and the outline of one triangle, and see which ones count as holes.
Homology assigns to each topological space a sequence of abelian groups H₀, H₁, H₂, … that count its “holes” in each dimension. The idea is beautifully simple: a cycle is a chain with zero boundary (a loop that closes up), and a boundary is a cycle that bounds something (a loop that can be filled in). Homology is the quotient — cycles modulo boundaries.
If a cycle is not a boundary, it detects a genuine hole in the space. The rank of Hₖ counts the number of independent n-dimensional holes: H₀ counts connected components, H₁ counts loops, H₂ counts enclosed voids, and so on. These invariants are computable, powerful, and form the backbone of algebraic topology.
Key insight: The torus has two independent nontrivial cycles — the horizontal a-cycle and the vertical b-cycle. These generate H₁(T²) ≅ ℤ ⊕ ℤ. The boundary of any triangle is a cycle, but it bounds the triangle itself, so it represents zero in homology.
Step through the spaces and compare their homology groups. Glowing loops mark H₁ generators and shaded regions mark H₂; look at how the torus and the Klein bottle differ.
H₁ generated by the fundamental cycle going once around.
Key insight: Homology is a topological invariant — if two spaces have different homology groups, they cannot be homeomorphic. For example, the torus (H₁ ≅ ℤ²) and the Klein bottle (H₁ ≅ ℤ ⊕ ℤ/2ℤ) are distinguished by torsion in H₁, reflecting the Klein bottle's non-orientability.
Pick a space split into two overlapping pieces, then step through the exact sequence and watch each map pin down the next group until the answer drops out.
The Mayer-Vietoris sequence is the workhorse for computing homology. If a space X = U ∪ V, the sequence relates the homology of X to the homology of U, V, and their intersection.
Key insight: Exactness means that at each position in the sequence, the image of the incoming map equals the kernel of the outgoing map. This powerful constraint lets you deduce unknown groups from known ones — like solving a system of algebraic equations. The connecting homomorphism ∂ is the key map that links different dimensions.
Spot a mistake or have an idea?