Simplicial complex

Simplicial complex
cflm (talk) · Public domain · source
Name	Simplicial complex
Field	Algebraic topology, Combinatorics, Computational geometry
Introduced	20th century
Contributors	Henri Poincaré, Jules-Henri Poincaré, Emmy Noether, J. H. C. Whitehead, André Weil

Simplicial complex A simplicial complex is a combinatorial and geometric structure built from simplices—vertices, edges, triangles, and their higher-dimensional analogues—assembled by rules that mirror how Henri Poincaré and later J. H. C. Whitehead formalized spaces in Algebraic topology. It provides a bridge between discrete combinatorial data used by Paul Erdős and Pál Erdős-era graph theory and continuous methods exploited by Emmy Noether and André Weil in homological algebra. Simplicial complexes underlie algorithms developed at institutions like MIT, Stanford University, and ETH Zurich for problems in Computational geometry, Topological data analysis, and applications studied at Los Alamos National Laboratory.

Definition

A finite simplicial complex is a collection of finite sets called simplices closed under taking subsets, inspired by the simplices used by Henri Poincaré and axiomatized by J. H. C. Whitehead. Formally, a 0-simplex is a vertex, a 1-simplex is an edge, a 2-simplex is a triangle, etc.; each k-simplex is the convex hull of k+1 affinely independent vertices in constructions used by Élie Cartan and Hermann Weyl. Faces and cofaces correspond to subset relations studied in Bourbaki-style combinatorics. The empty set is typically considered a simplex in treatments influenced by Emmy Noether and Samuel Eilenberg.

Examples

Standard examples include the n-simplex and its boundary studied by J. H. C. Whitehead and Salomon Bochner, skeleta of polytopes examined by Branko Grünbaum, and triangulations of manifolds used by John Milnor and René Thom. Nerve complexes arising from covers appear in the work of Jean Leray and Henri Cartan and are used in the Leray spectral sequence context addressed by Jean-Pierre Serre. Clique complexes of graphs, or flag complexes, are central in combinatorial studies by Paul Erdős and Béla Bollobás and in geometric group theory developed by Mikhail Gromov and Laurent Lafforgue. Simplicial spheres and simplicial polytopes feature in the McMullen conjecture and work of Richard Stanley and Louis Billera.

Algebraic topology and homology

Simplicial homology, cohomology, and chain complexes connect simplicial complexes to the machinery developed by Emmy Noether, Samuel Eilenberg, and Saunders Mac Lane in homological algebra. The simplicial approximation theorem attributed to J. H. C. Whitehead and André Weil links continuous maps studied by Henri Poincaré to simplicial maps, a technique used in proofs by John Milnor and René Thom. Simplicial (co)homology groups compute invariants analogous to singular homology used by Leray and provide computationally tractable invariants exploited by researchers at Princeton University and University of Cambridge. Mayer–Vietoris sequences applied to covers relate to spectral sequence methods developed by Jean-Pierre Serre and Alexander Grothendieck.

Combinatorial and computational aspects

Combinatorial properties include the f-vector and h-vector studied by Richard Stanley and Peter McMullen in the context of the g-theorem and face enumeration, while shellability and Cohen–Macaulay properties were investigated by Reisner and Miroslav Chari. Algorithmic questions—triangulation, mesh generation, and persistent homology—are central to work at Stanford University, ETH Zurich, and industrial labs like Bell Labs. Computational complexity results connect to the theory of P vs NP and reductions considered by Stephen Cook and Richard Karp, with hardness results for decision problems about embeddability linked to contributions by Michael Freedman and Fedor Petrov-style combinatorialists.

Geometric realizations and embeddings

Geometric realization assigns to a simplicial complex a topological space embedded in Euclidean space using affine simplices, as in classical accounts by Hermann Weyl and J. H. C. Whitehead. Embeddability problems—whether a complex can be embedded in R^d—relate to the work of Imre Bárány, Jiří Matoušek, and Péter K. Halmos, and to topological obstructions like van Kampen obstruction studied by Egbert van Kampen and Václav Havel. Triangulations of manifolds studied by John Milnor and R. Thom show how PL-structures and smooth structures interact, issues central to the discoveries by Michael Freedman and Simon Donaldson.

Operations and constructions

Standard operations include subdivisions (notably barycentric subdivision), joins, links, and stellar moves developed in piecewise-linear topology by J. H. C. Whitehead and applied in the work of Marston Morse and Jakob Nielsen. Simplicial collapse and discrete Morse theory were advanced by Robin Forman and used to simplify complexes in computational settings at University of Illinois at Urbana–Champaign and Universität Bonn. The nerve construction and Alexander duality connect to results by James Alexander and Henri Cartan, while theory of flag complexes informs geometric group theory due to Mikhail Gromov.

Applications and generalizations

Applications span Topological data analysis promoted by groups at Princeton University and Stanford University, sensor networks analyzed using coverage theorems by Robert Ghrist, and mesh processing in computer graphics influenced by research at Disney Research and Adobe Systems. Generalizations include simplicial sets employed in homotopical algebra by Daniel Quillen and Boardman–Vogt operad theory, CW complexes foundational in John Milnor's work, and Δ-complexes used in classical texts by Allen Hatcher. Higher-categorical and ∞-categorical analogues appear in the school of Jacob Lurie and Grothendieck's pursuits.

Category:Algebraic topology