A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
A simplicial complex is a combinatorial structure built from vertices, edges, triangles, tetrahedra, and their higher-dimensional analogues (simplices), glued together along faces in a compatible way. Simplicial complexes provide a rigid, combinatorial model for topological spaces that makes homology computable: instead of dealing with arbitrary continuous maps, we work with finite collections of simplices governed by purely combinatorial rules.
A simplex is the simplest possible geometric object in each dimension: a point (0-simplex), a line segment (1-simplex), a triangle (2-simplex), a tetrahedron (3-simplex), and so on. The standard n-simplex is the convex hull of the n+1 standard basis vectors in Rn+1: for instance, the standard 2-simplex is the triangle with vertices (1,0,0), (0,1,0), and (0,0,1). A face of a simplex is the sub-simplex obtained by taking a subset of its vertices — every edge and vertex of a triangle is a face of that triangle, and the triangle itself is a face of itself.
A simplicial complex K is a collection of simplices satisfying two conditions: (1) every face of every simplex in K is also in K, and (2) the intersection of any two simplices in K is either empty or a common face of both. These conditions ensure that simplices fit together cleanly — no partial overlaps, no dangling higher-dimensional pieces missing their boundaries. The geometric realization |K| is the topological space obtained by gluing the simplices together according to the combinatorial data. Important examples include the boundary of a tetrahedron (a triangulation of S2), any triangulated surface, and the simplicial approximation of any smooth manifold.
There is an important distinction between geometric and abstract simplicial complexes. A geometric simplicial complex lives in some ambient Euclidean space, with simplices as actual convex subsets. An abstract simplicial complex is purely combinatorial: a collection of finite subsets (called simplices) of a vertex set, closed under taking subsets. Every abstract simplicial complex can be geometrically realized in sufficiently high-dimensional Euclidean space, so the abstract viewpoint loses no generality while gaining flexibility. In practice, algebraic topologists work with the abstract version, since the combinatorial data is all that matters for computing homology.
The dimension of a simplex is one less than its number of vertices, and the dimension of a simplicial complex is the maximum dimension of its simplices. The combinatorial structure of a simplicial complex — which vertices span which simplices — completely determines the topology of its geometric realization and hence all of its algebraic invariants. This is the foundational observation that makes simplicial homology possible: instead of analyzing continuous maps and deformations, we can extract topological information from finite combinatorial data through the machinery of chain complexes and boundary operators.
Simplicial complexes are the historical starting point for homology theory, introduced by Poincare in the late 19th century. While modern algebraic topology has moved toward more flexible frameworks — singular homology for arbitrary spaces, CW complexes for efficient cell structures — simplicial complexes remain essential as the concrete, computable foundation. Many computational topology algorithms (persistent homology, simplicial approximation) work directly with simplicial complexes, and the intuition built from simplicial homology transfers directly to all other homology theories.