Detecting holes algebraically — cycles modulo boundaries
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.
Click edges on a triangulated torus (shown as a square with identified edges) to build a 1-chain. The system classifies your chain in real time: is it a cycle? If so, does it bound a 2-chain, or does it represent a nontrivial homology class? Try the presets to see the three fundamental cases.
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.
Browse through classic topological spaces and see their homology groups computed. Each space is drawn with its generators highlighted — glowing loops for H₁ generators and shaded regions for H₂. Notice how the homology groups distinguish spaces that might otherwise look similar.
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.
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. Step through the exact sequence to see how each map constrains the groups and ultimately determines the answer.
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.