Simplicial Sets - Core Definitions
Simplicial sets form the combinatorial foundation of higher category theory, providing a discrete model for studying homotopy-theoretic phenomena. They generalize the notion of simplicial complexes from topology while maintaining strong categorical properties that make them amenable to algebraic manipulation.
The simplex category has objects the finite ordered sets for , with morphisms being order-preserving maps. The basic generating morphisms are:
- Face maps for , which skip the element
- Degeneracy maps for , which repeat the element
These satisfy the simplicial identities:
A simplicial set is a functor . Equivalently, it consists of:
- A sequence of sets for each (the n-simplices)
- Face maps for
- Degeneracy maps for
satisfying the dual simplicial identities. We denote the category of simplicial sets by .
For each , the standard n-simplex is the representable functor . By the Yoneda lemma, we have a natural bijection:
This means n-simplices in any simplicial set correspond exactly to maps from the standard simplex into .
The geometric realization functor provides a bridge to classical topology. For a simplicial set , we define:
where is the topological standard simplex. This construction is left adjoint to the singular complex functor, establishing a Quillen equivalence between simplicial sets and topological spaces.
The power of simplicial sets lies in their ability to encode higher-dimensional coherence data combinatorially. Each n-simplex represents a potential n-dimensional cell, while face and degeneracy maps encode the boundary and collapse operations. This structure makes simplicial sets the natural setting for defining -categories as "simplicial sets with composition."