Simplicial and -complex homology
Anchor (Master): Hatcher §2.1; Eilenberg-Steenrod *Foundations of Algebraic Topology* §I (axioms, comparison, excision); May *A Concise Course in Algebraic Topology* Ch. 13
Intuition [Beginner]
A space built by gluing triangles, tetrahedra, and their higher-dimensional cousins is called a -complex. The pieces are standard simplices: a 0-simplex is a point, a 1-simplex is a line segment with two labelled endpoints, a 2-simplex is a triangle with three labelled vertices, a 3-simplex is a solid tetrahedron. You glue them together by identifying entire faces, and you are allowed to identify two faces of the same simplex (so a single 2-simplex can become a torus by gluing each pair of opposite edges).
Once a space is presented this way, you can count things. Each simplex contributes a generator to a chain group; the boundary of an -simplex is the alternating sum of its -dimensional faces. Simplicial homology counts the cycles modulo boundaries: how many independent loops, how many independent surfaces, how many independent solid regions, and so on.
The point is that this counting is finite and combinatorial. A torus, a Klein bottle, a genus- surface, a real projective space all become matrices of integers. You compute by row-reducing.
Visual [Beginner]
A schematic showing the standard simplices side by side, then a 2-simplex with its three oriented edges and the formula reminding the reader that the boundary of the triangle is "edge 1 minus edge 2 plus edge 3", and finally a -complex picture of the torus as a single square (two triangles) with opposite edges identified.
The two triangles share a diagonal. Opposite edges of the square get identified to form the torus. The combinatorial data is: one vertex, three edges, two triangles.
Worked example [Beginner]
Compute the simplicial homology of the circle presented as one vertex and one edge with both endpoints attached to .
Step 1. List the simplices. There is one 0-simplex and one 1-simplex . So and . All higher chain groups are zero.
Step 2. Compute the boundary of . The two endpoints of both go to . The boundary is "endpoint 2 minus endpoint 1", which is .
Step 3. Read off homology. Since the boundary of is zero, every chain in is a cycle and there are no boundaries (no 2-simplices to take boundaries of), so . In dimension 0, the cycles are all of and again there are no boundaries from above, so . In all other dimensions the homology is 0.
What this tells us: the circle has one connected component (recorded by ) and one independent loop (recorded by ). Two cells, one matrix calculation, the entire homology of the circle.
Check your understanding [Beginner]
Formal definition [Intermediate+]
A -complex structure on a topological space is a collection of continuous maps , indexed by in some set , where is the standard -simplex, such that:
- The restriction to the open simplex is injective, and every point of lies in the image of exactly one such open simplex.
- Each restriction of to a codimension-1 face equals some (where ranges over the indices of -simplices). The face inclusions are the standard ones .
- A subset is open iff is open in for every .
The maps are the characteristic maps of the -structure. A classical simplicial complex is the special case in which each characteristic map is also injective on the closed simplex and any two simplices intersect in a common face.
Given a -complex structure, the simplicial chain complex is
the free abelian group on the -simplices of the structure. The boundary is defined on a generator (with ) as the alternating sum of face restrictions:
By condition (2), each face restriction is itself one of the indexed -simplices, so the right-hand side lives in . A direct computation, identical to the singular case, gives . The simplicial homology of is
The singular chain complex is the free abelian group on all continuous maps , with the same alternating-face boundary. Each simplicial generator is in particular a singular simplex, so there is an inclusion of chain complexes
This commutes with boundaries because the simplicial boundary is the singular boundary applied to a simplicial generator, and by definition each face is again a simplicial generator. Hence induces a homomorphism on homology,
Counterexamples to common slips
- The boundary formula depends on the vertex order. A -structure is the data needed to make this choice canonical: each has its vertices labelled by , and reversing the order changes signs.
- A subset of that is a union of open simplices is not automatically a -subcomplex: it must be closed under taking faces. Closure under faces is what makes the chain complex of the subspace sit inside the chain complex of the whole space.
- The simplicial chain group is countable (or finite, for finite -complexes); the singular chain group is uncountable. The comparison map injects a countable subgroup into an uncountable one.
Key theorem with proof [Intermediate+]
Theorem (simplicial homology equals singular homology). Let be a -complex and let be a -subcomplex. Then the inclusion $\iota_ : C_*^\Delta(X, A) \to C_*(X, A)$ of chain complexes induces an isomorphism on homology in every degree:*
(Hatcher Theorem 2.27.)
Proof. Reduce to the absolute case by a five-lemma argument applied to the long exact sequences of the pairs (the simplicial and singular long exact sequences are natural in the inclusion of chain complexes), so it suffices to prove the absolute statement.
Filter by its skeleta , and prove the result by induction on for the relative pair , then pass to the colimit over .
Step 1 (relative simplicial homology of the pair ). The simplicial chain complex has in degree (one generator per -simplex) and is zero in all other degrees, because every -simplex of dimension less than already lies in and every -simplex of dimension greater than is absent at this stage. So
Step 2 (relative singular homology of the same pair). The pair is good in the sense that is a deformation retract of a neighbourhood in (slightly thicken each closed simplex to a collar of its boundary). Excision combined with the long exact sequence of a good pair gives
and is homeomorphic to a wedge , one -sphere for each -simplex (each closed -simplex with its boundary collapsed is an ). The reduced homology of a wedge of -spheres is in degree and elsewhere. So
The map on the only non-zero degree sends each simplicial generator to the class of the same singular simplex, which under the identification with is the class of the corresponding wedge factor. Both sides are free abelian on the same indexing set , so is an isomorphism on .
Step 3 (inductive step on absolute homology). Compare the long exact sequences of the pair in simplicial and singular homology:
The relative comparison maps are isomorphisms by Step 2. By the inductive hypothesis applied to , the absolute comparison maps for are isomorphisms in all degrees. Apply the five lemma to conclude that is an isomorphism. The base case is a discrete set of points, where both theories return in degree 0 and zero elsewhere, and is the identity.
Step 4 (pass to the colimit). If is finite-dimensional, for some and the result follows from Step 3. For infinite-dimensional , both and are filtered colimits of chain complexes (every chain has compact support, hence lives in some finite skeleton). Filtered colimits of abelian groups commute with homology, so
a colimit of isomorphisms, hence an isomorphism.
Bridge. This builds toward the cellular homology theory of the next unit 03.12.13 and the full Eilenberg-Steenrod axiomatic framework: the comparison theorem is the prototype of every uniqueness statement for ordinary homology, and the same skeleton-by-skeleton five-lemma argument appears again in 03.12.13 to identify cellular homology with singular homology. The foundational reason simplicial and singular homology agree is exactly the wedge-of-spheres computation in Step 2: the relative homology of one skeleton modulo the next is concentrated in a single degree, so the long exact sequence collapses to a chain complex whose -th group is precisely the simplicial chain group. This pattern recurs: the same trick shows that any cell-filtration of a space produces a chain complex computing its singular homology. Putting these together, the bridge is the recognition that simplicial homology is not a separate theory but a finite presentation of singular homology, generalises directly to the cellular case, and is dual to the simplicial cohomology / cup-product computations introduced later in 03.04.13.
Exercises [Intermediate+]
Lean formalization [Intermediate+]
Mathlib does not yet ship a -complex API tied to a topological space. The closest existing infrastructure is the simplicial-object machinery in Mathlib.AlgebraicTopology.SimplicialObject and the alternating-face-map chain complex in Mathlib.AlgebraicTopology.AlternatingFaceMapComplex, plus the singular complex in Mathlib.AlgebraicTopology.SingularSet. The intended definition of the -complex chain complex would read schematically:
The Hatcher-2.27 statement is the formalisation target. The current Mathlib treatment of the Dold-Kan correspondence supplies the abstract algebraic skeleton, but the geometric input — that the realisation map is compatible with the topology on and that the comparison induces an isomorphism on singular homology — is not yet formalised. See lean_mathlib_gap in the frontmatter for the concrete Mathlib roadmap.
Advanced results [Master]
Theorem (relative simplicial homology of skeleta). For a -complex with -skeleton , the relative simplicial chain complex $C_^\Delta(X^k, X^{k-1})kJ_kkH_n^\Delta(X^k, X^{k-1}) = \mathbb{Z}^{|J_k|}n = k0$ otherwise.*
This is the input to the Hatcher 2.27 comparison theorem and to the cellular-homology theory of 03.12.13. The same statement, applied with the skeleton filtration of a CW complex, is what defines the cellular chain complex.
Theorem (Eilenberg-Steenrod uniqueness on -complexes). Let $h_\Delta\Deltah_*$ is naturally isomorphic to simplicial homology.*
The proof is the standard induction on skeleta combined with the comparison theorem. The dimension axiom in degree 0 fixes the homology of a point; the wedge-of-spheres computation in Step 2 of the comparison proof transports through any such ; and the long-exact-sequence comparison via the five lemma propagates the isomorphism through all skeleta. This is the sense in which "ordinary homology with integer coefficients" is unique on -complexes.
Theorem (additivity and naturality). The simplicial homology functor $H_^\Delta\DeltaX = \bigsqcup X_i\DeltaH_n^\Delta(X) = \bigoplus_i H_n^\Delta(X_i)\iota_*$ to singular homology is a natural transformation between these functors.*
Naturality and additivity are immediate from the chain-level definitions; the substantive content is that arbitrary continuous maps between -complexes need not be -maps, but they are homotopic to -maps under simplicial approximation (see Munkres §16). Combined with homotopy invariance of singular homology, this establishes that simplicial homology is a homotopy invariant of the underlying topological space, independent of the chosen -structure.
Theorem (compactness and finite generation). If is a finite -complex (finitely many simplices in finitely many dimensions), then each is a finitely generated abelian group, and only finitely many are nonzero. The Smith normal form of the boundary matrices computes the homology by row-and-column reduction over .
The computational content is that simplicial homology is algorithmic: input a finite -complex, output the homology groups. This is why simplicial homology is the model of ordinary homology used in practice for explicit calculations and for computer verification.
Computational examples.
Spheres. admits a -structure with two -simplices in each dimension (the upper and lower hemispheres of each sub-sphere). The boundary alternates: in even degrees the difference of the two simplices is a cycle, and in odd degrees one half maps to the other. The result is for and otherwise.
Real projective space. has a -structure with one cell in each dimension. The boundary of the -cell is times the -cell, by direct computation of the antipodal-quotient face map. So odd-degree boundaries vanish and even-degree boundaries are multiplication by . The resulting homology is the famous table: , for odd with , for even with (except if is odd). The in odd degrees is the prototype of torsion in homology.
Complex projective space. has a -structure with one cell in each even dimension (the cells of the standard CW structure subdivided). All boundary maps are zero because the cells are in non-adjacent degrees. So for and otherwise.
Genus- surface. has a one-vertex, -edge, one-2-cell -structure with boundary word . All boundary maps vanish, giving , , .
Lens spaces. has a -structure with cells in each dimension ; the resulting homology is , , , .
Synthesis. Simplicial homology is the original combinatorial incarnation of homology, dating to Poincaré 1895, and the comparison theorem identifies it with the topologically-canonical singular theory introduced by Eilenberg in 1944. The bridge is the wedge-of-spheres calculation: every relative pair has its homology concentrated in a single degree, and that degree is exactly the simplicial chain group. This is the foundational reason any cell-filtration argument works in algebraic topology, and the same pattern appears again in the cellular homology of CW complexes 03.12.13, in the spectral-sequence calculation of homology from a filtration, and in the Eilenberg-MacLane construction 03.12.05 where the cell-by-cell killing of homotopy groups uses exactly this skeleton arithmetic. Putting these together, the bridge is the recognition that simplicial homology, cellular homology, and singular homology are three reformulations of one functor, distinguished only by which combinatorial input is used to compute it: a -structure, a CW structure, or no structure at all. Each generalises the previous in flexibility and specialises it in computability. The comparison theorem identifies them as natural-isomorphism-equivalent functors on the appropriate categories, and this identification underlies every classical computation in homology and recurs in the dual cohomology theory developed in 03.04.13. The Eilenberg-Steenrod uniqueness theorem makes the identification axiomatic: any homology theory satisfying the standard axioms agrees with simplicial homology on -complexes.
Full proof set [Master]
Theorem (Hatcher 2.27, simplicial = singular), full proof. Given in the Intermediate-tier Key theorem section above. The four steps — reduction to the absolute case, skeleton-by-skeleton five-lemma argument, wedge-of-spheres computation of the relative singular homology, and colimit over skeleta — together prove that is an isomorphism on every -complex pair.
Theorem (relative simplicial homology of skeleta), proof. The simplicial chain complex of the pair has chain group . By construction, every -simplex of dimension lies in , every -simplex of dimension is absent in , and the -simplices of that are not in are precisely the -simplices indexed by . Hence the relative chain complex has in degree and zero elsewhere. The boundary vanishes (its image lies in ), so the homology equals the chain group itself in degree .
Theorem (Eilenberg-Steenrod uniqueness), proof sketch. Let be a homology theory on -complexes satisfying the axioms. The dimension axiom and additivity give for and zero otherwise, hence for the discrete 0-skeleton. By induction on : assume naturally. The pair is excisive by axiom; the relative homology of a wedge of -spheres is in degree by the suspension-isomorphism consequence of the axioms (suspension shifts degree by one and reduces to the case via dimension). Comparing the long exact sequences of the pair in and in via the natural transformation extended formally, the five lemma propagates the isomorphism to . Pass to colimits as in the Hatcher 2.27 proof.
Theorem (additivity and naturality), proof. Naturality: a -map sends each generator to a singular simplex which is a -simplex of by hypothesis, hence to a generator of ; the induced chain map commutes with because face restrictions are preserved by ; and applied homology gives . The comparison map is natural because a -map is in particular a continuous map. Additivity: the chain complex of a disjoint union splits as a direct sum of the chain complexes of the summands, so homology splits accordingly.
Theorem (compactness and finite generation), proof. A finite -complex has finitely many simplices in each degree and zero in all but finitely many degrees, so each is a finitely generated free -module and only finitely many are nonzero. The boundary is a -linear map between finitely generated free -modules. Smith normal form (the structure theorem for finitely generated modules over a PID applied to the boundary matrix) gives with unimodular and diagonal with positive integer diagonal entries. Reading off and from produces as a finitely generated abelian group, of the form where the are the elementary divisors.
Stated without proof — see Hatcher §2.1 [Hatcher §2.1] and Munkres §13 [Munkres §13]. The simplicial approximation theorem (any continuous map between simplicial complexes is homotopic to a simplicial map after sufficient barycentric subdivision of ), used implicitly in the homotopy invariance of simplicial homology; the Hauptvermutung in dimensions (any two triangulations of a topological 3-manifold have a common subdivision); the failure of the Hauptvermutung in dimension (Milnor 1961 counterexample); the existence of non-triangulable topological 4-manifolds (Casson 1985; Freedman's -manifold).
Connections [Master]
CW complex
03.12.10. Every CW complex with characteristic maps that respect a cell-by-cell ordering carries a canonical -structure on a subdivision; conversely, every -complex is a CW complex with the obvious cell decomposition. The skeletal filtration argument used in the comparison theorem is the prototype for the cellular-homology argument that identifies cellular homology of a CW complex with its singular homology.Cellular homology
03.12.13(planned, parallel batch). The next unit upgrades the simplicial-homology theory to the more flexible cellular-homology theory: cells replace simplices, and the cellular boundary is computed via degrees of attaching maps rather than face restrictions. The same skeleton-by-skeleton five-lemma argument identifies cellular homology with singular homology, and the Hatcher 2.27 comparison is the prototype of that identification.Singular cohomology
03.04.13. Dualising the simplicial chain complex of a -complex produces the simplicial cochain complex; its cohomology is simplicial cohomology, and the same comparison theorem gives an isomorphism with singular cohomology. The cup-product on simplicial cohomology is the Alexander-Whitney coproduct dualised, and the cohomology ring of a finite -complex is computable from a finite combinatorial recipe.Eilenberg-MacLane spaces
03.12.05. The construction of proceeds by attaching cells to kill homotopy groups; the homology of each stage is computed via the cellular / simplicial chain complex of the -or-CW structure built so far. Hatcher 2.27 ensures that this combinatorial computation matches the topologically-canonical singular homology used to detect the killed classes.Mayer-Vietoris and excision (planned units). The excision axiom for singular homology is what justifies the wedge-of-spheres computation in Step 2 of the comparison proof; conversely, simplicial homology gives an explicit model in which excision can be verified by direct chain-level inspection, and the agreement of the two theories transports excision back to the singular side.
Riemann-Roch and intersection theory (downstream applications). On a triangulated Riemann surface, the simplicial homology of the underlying real surface () is the home of the symplectic intersection pairing; on a triangulated complex algebraic variety, the simplicial homology of the underlying real variety carries the cycle classes of subvarieties. Both are central to the Riemann-Roch theorem.
Historical & philosophical context [Master]
Henri Poincaré introduced the simplicial chain complex in Analysis Situs (Journal de l'École Polytechnique, 1895) and its five subsequent supplements (1899-1904) [Poincaré Analysis Situs]. His original definition triangulated each manifold into a finite collection of simplices, took the formal -linear combinations as chains, and defined the boundary as the alternating sum of faces. The resulting "Betti numbers" — the ranks of the homology groups — were shown to be topological invariants in his second supplement, and the existence of torsion in for odd was identified in the fifth supplement. The dependence of the construction on the choice of triangulation was a known difficulty that Poincaré addressed via the Hauptvermutung (the conjecture that any two triangulations admit a common subdivision); the proof of independence from triangulation was given for low dimensions during the early twentieth century.
The modern -complex framing — semi-simplicial sets allowing identification of faces — is the framework of Eilenberg-Zilber 1950 ("Semi-simplicial complexes and singular homology", Annals of Mathematics 51, 499-513) and Eilenberg-Steenrod 1952 (Foundations of Algebraic Topology, Princeton) [Eilenberg-Steenrod 1952]. Eilenberg-Steenrod axiomatised the homology functor (homotopy, exactness, excision, dimension, additivity) and proved that any theory satisfying the axioms agrees with simplicial homology on the category of -complex pairs. Eilenberg had earlier (1944) introduced the singular chain complex, defined for arbitrary topological spaces, which removed the dependence on triangulation entirely; the comparison theorem identifying simplicial with singular homology on -complexes is what justified the use of the older combinatorial theory for computation while granting the newer theory its topological canonicity.
The category of -complexes was later subsumed into the more general category of simplicial sets (Kan 1957, Quillen 1967) where the same comparison theorem is the geometric-realisation / total-singular-complex adjunction's statement that geometric realisation preserves homology. The Dold-Kan correspondence (Dold 1958, Kan 1958) gave the algebraic incarnation, identifying simplicial abelian groups with non-negatively-graded chain complexes via the alternating-face-map functor, and this is the modern home of the simplicial chain complex in homological algebra.