Topology
Homology and cohomology
Algebraic invariants built from a chain complex that count holes of every dimension, unifying Euler's formula with the Euler–Poincaré theorem .
IntuitionCounting holes with algebra
A circle has one -dimensional hole, a sphere has one -dimensional hole (a hollow inside) but no -dimensional hole, and a torus has two independent -dimensional loops plus one -dimensional cavity. Homology turns this vague counting into a precise algebraic invariant: for each dimension , a group whose rank (the Betti number) is exactly the number of independent -dimensional holes. The rotating polyhedron below lets you see vertices (-cells), edges (-cells), and faces (-cells) — the raw building blocks that homology will organize into chain groups.
SchoolEuler's formula as a shadow of homology
Definition: Simplicial chain complex
Given a triangulated space (or polyhedron) , let be the free abelian group generated by its oriented -dimensional cells (vertices for , edges for , triangular faces for , …). The boundary map sends an -cell to the signed sum of its -dimensional faces, e.g. an edge maps to .
This sequence of groups linked by boundary maps is the chain complex. Its defining property is : applying the boundary twice always gives . The homology group in dimension measures the gap between cycles (things with no boundary) and boundaries (things that are themselves a boundary):
| Space | ||
|---|---|---|
| Sphere | ||
| Torus | ||
| Circle | ||
| Real projective plane | (over ) |
UndergraduateTwo founding theorems
For the simplicial boundary map, for every .
Why is it true?
This single identity is what makes homology well-defined: it guarantees , so the quotient in the definition of actually makes sense as a group.
Proof
It suffices to check the claim on a single -simplex and extend by linearity. By definition, , where means is deleted.
Applying to each term and deleting a second vertex (with ) from produces the face that is missing exactly the two vertices . Carefully tracking the sign: when the face is deleted at position first (sign ) inside a term already carrying sign , giving total sign ; when , deleting from the -simplex removes the vertex now sitting at position (because was already removed), giving sign .
So . Every face missing exactly two vertices with appears exactly twice in this double sum: once from deleting then (contributing ) and once from deleting then (contributing ), and these two contributions are exact opposites.
Every term cancels in pairs, so for every simplex , hence on all of by linearity.
For a finite chain complex, .
Why is it true?
This says the alternating sum of the number of cells (a combinatorial count, easy to compute by hand) equals the alternating sum of Betti numbers (a topological invariant that only depends on the shape, not the triangulation). It generalizes to every dimension.
Proof
Fix and consider the boundary map as a linear map of finite-dimensional vector spaces (working over for simplicity). By the rank-nullity theorem, , where .
Also, directly from the quotient definition , so .
Substituting, . Now form the alternating sum over all from to the top dimension : .
In the last two sums, the term appears once from the sum (at , with sign ) and once from the sum (at , with sign ); these two signs are opposite, so every cancels exactly (telescoping), except the boundary terms and which contribute nothing anyway.
What remains is , and since the left side is by definition, this is exactly .
AdvancedMayer–Vietoris and de Rham cohomology
Computing directly from a triangulation is tedious; the Mayer–Vietoris sequence lets us split into simpler overlapping pieces and glue their homologies together via a long exact sequence . Cohomology dualizes the picture: cochains with a coboundary satisfying . For a smooth manifold, de Rham cohomology takes to be differential -forms and the exterior derivative; de Rham's theorem says this analytic construction computes exactly the same groups as the combinatorial version, a striking bridge between analysis and combinatorics.
UndergraduateReal-World Applications and Worked Examples
Topological data analysis (TDA) applies homology to noisy point-cloud data: build a nested family of simplicial complexes (a filtration) by connecting nearby points at growing scale , and track which homology classes are born and die as grows — this persistent homology distinguishes real structure (loops, voids that survive a wide range of ) from noise (features that vanish almost immediately). In sensor network coverage, if a set of wireless sensors with communication radius forms a simplicial complex (a simplex for every clique of mutually-connected sensors), a nonzero class in a specific relative-homology sense certifies a genuine coverage hole even when no single sensor can detect it — a purely combinatorial, coordinate-free proof of a geometric fact.
Example: Homology of the torus
A torus is triangulated with a CW structure of vertex, edges (the two generating loops), and face glued via . Compute .
Solution
The chain groups are (one vertex), (edges ), (one face). Since there is only one vertex, (every edge starts and ends at the same vertex, so its boundary is ).
The boundary of the face reads off the gluing word : in homology (abelianized), . So as well.
With both boundary maps zero, , , . So , matching .
Example: Betti numbers from Euler characteristic of an icosahedron
A regular icosahedron has . Given that it is homeomorphic to (so and, being simply connected, ), use the Euler–Poincaré theorem to find .
Solution
First compute the topological Euler characteristic from the cell counts: .
By the Euler–Poincaré theorem, . Substituting the known values gives .
Solving, , matching the fact that has exactly one -dimensional cavity — consistent with the sphere row of the table above.
What is the defining identity of a chain complex's boundary maps?
For the icosahedron (, homeomorphic to ), what is ?
In topological data analysis, what does "persistent homology" track?
Which pair correctly describes the torus ?
References
- Allen Hatcher (2002). Algebraic Topology
- James R. Munkres (1984). Elements of Algebraic Topology
- Gunnar Carlsson (2009). Topology and data