A combinatorial object consisting of a set of vertices and a collection of finite subsets (simplices) closed under taking nonempty faces: if a simplex is included then every nonempty subset of its vertices is also included.

Principle

Closure under faces and finiteness of simplices are the organizing rules: simplices are sets of vertices representing k-dimensional building blocks, and the family of simplices must be closed under inclusion of subsets corresponding to lower-dimensional faces.

Demonstration

Example: a triangle with vertices {v1,v2,v3} is represented by the simplices {v1},{v2},{v3},{v1,v2},{v2,v3},{v1,v3},{v1,v2,v3}; this combinatorial complex can be realized geometrically as a filled triangular 2-simplex.

Misapplication

Treating an arbitrary hypergraph as a simplicial complex without ensuring closure under faces, or assuming every simplicial complex admits a unique geometric realization or piecewise-linear structure without checking additional conditions.

Consequence

Simplicial complexes admit a standard geometric realization and support homology, cohomology, and combinatorial invariants; they provide finite combinatorial models for topological spaces and are amenable to algorithmic computation.

Reversal

The opposite notion is a collection of sets lacking face-closure (a hypergraph): such collections may encode higher-arity relations but do not guarantee lower-dimensional faces, so many topological constructions fail or require extra data.

Boundary

Simplicial complexes are abstract (combinatorial) or geometric; they need not be finite, pure, or manifold-like. They exclude cell attachments with identifications not expressible by simplices and do not encompass general CW complexes without triangulation.

Semantic Tension

Tension exists between simplicial complexes and related notions such as delta-complexes, CW complexes, and hypergraphs: each encodes combinatorial topology with different flexibility about identifications and face structure, and choices affect invariants and realizations.

Synthesis

A simplicial complex is a combinatorial schema of vertices and simplices closed under faces that serves as a discrete model for topology: its simplicity and closure rule make it a fundamental bridge between combinatorics and topological invariants.