##  [Simplicial Complex](/simplicial-complex-0) 

 Definition

A combinatorial structure given by a collection K of finite sets (called simplices) on a vertex set V such that every singleton vertex is in K and K is closed under taking nonempty subsets: if σ∈K and τ⊆σ then τ∈K. Simplices are organized by dimension (|σ|−1).

 

 

 

 

 

 





## Principle

Principle

Build topological information from combinatorial building blocks (vertices, edges, triangles, etc.) by requiring closure under faces so that the intersection of simplices is again a simplex (a face).

 

 

 

 

 





## Demonstration

Demonstration

A triangle with its three edges and three vertices is a 2-dimensional simplicial complex. The clique complex of a graph takes every complete subgraph as a simplex; the boundary of a tetrahedron gives a 2-complex homeomorphic to a sphere.

 

 

 

 

## Misapplication

Misapplication

Confusing simplicial complexes with arbitrary hypergraphs (which need not be closed under taking subsets), or assuming a unique geometric embedding; treating any collection of simplices without checking face-closure as a complex.

 

 

 

 

 





## Consequence

Consequence

Simplicial complexes provide discrete models for topological spaces admitting computation of homology, homotopy approximations via subdivisions, Euler characteristic, and combinatorial constructions like nerve and barycentric subdivision.

 

 

 

 

## Reversal

Reversal

Invert to a CW complex or a cell complex where attaching maps need not be simplicial and combinatorial face-closure is replaced by attaching-cell data; or to a hypergraph where subset-closure is dropped.

 

 

 

 

 





## Boundary

Boundary

Applies to finite or locally finite collections of finite simplices closed under faces; excludes arbitrary cell complexes, collections not closed under subsets, and structures that require continuous attaching maps rather than combinatorial faces.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Simplicial complex versus triangulation: a complex is a combinatorial object, a triangulation is a homeomorphism from a complex's geometric realization onto a topological space. Versus hypergraph: hypergraphs lack face-closure.

 

 

 

 

 





## Synthesis

Synthesis

A simplicial complex is the combinatorial packaging of a space into simplices and their faces: finite sets closed under subsets encode topology combinatorially, enabling algebraic invariants and discrete constructions that approximate continuous spaces.