ConceptComplete

Simplicial Set

A simplicial set is a combinatorial model for topological spaces. It consists of sets of simplices in each dimension, connected by face and degeneracy maps satisfying the simplicial identities. Simplicial sets form the foundation for higher category theory: nerves of categories, Kan complexes (modeling spaces), and quasi-categories (modeling \infty-categories) are all special types of simplicial sets.


The Simplex Category

Definition1.1Simplex category

The simplex category Δ\Delta is the category whose objects are the finite nonempty totally ordered sets

[n]={0<1<<n},n0[n] = \{0 < 1 < \cdots < n\}, \quad n \geq 0

and whose morphisms are the order-preserving (weakly monotone) maps φ:[m][n]\varphi: [m] \to [n].

Definition1.2Coface and codegeneracy maps

The morphisms of Δ\Delta are generated by two families of maps:

Coface maps δi:[n1][n]\delta^i: [n-1] \to [n] for 0in0 \leq i \leq n: the unique injective order-preserving map whose image misses ii.

Codegeneracy maps σj:[n+1][n]\sigma^j: [n+1] \to [n] for 0jn0 \leq j \leq n: the unique surjective order-preserving map that hits jj twice.

These satisfy the cosimplicial identities:

δjδi=δiδj1(i<j)\delta^j \delta^i = \delta^i \delta^{j-1} \quad (i < j) σjσi=σiσj+1(ij)\sigma^j \sigma^i = \sigma^i \sigma^{j+1} \quad (i \leq j) σjδi=δiσj1(i<j)\sigma^j \delta^i = \delta^i \sigma^{j-1} \quad (i < j) σjδj=σjδj+1=id\sigma^j \delta^j = \sigma^j \delta^{j+1} = \mathrm{id} σjδi=δi1σj(i>j+1)\sigma^j \delta^i = \delta^{i-1} \sigma^j \quad (i > j + 1)

ExampleLow-dimensional morphisms in Delta

In small dimensions:

  • δ0,δ1:[0][1]\delta^0, \delta^1: [0] \to [1] are the two inclusions: δ0(0)=1\delta^0(0) = 1 and δ1(0)=0\delta^1(0) = 0.
  • σ0:[1][0]\sigma^0: [1] \to [0] is the unique map.
  • δ0,δ1,δ2:[1][2]\delta^0, \delta^1, \delta^2: [1] \to [2]: for instance, δ1\delta^1 maps 00,120 \mapsto 0, 1 \mapsto 2, skipping 11.
  • There are (m+nn)\binom{m+n}{n} morphisms [m][n][m] \to [n] in total: these correspond to choosing which elements of [n][n] lie in the image (with multiplicities).

The number of morphisms [m][n][m] \to [n] equals (m+nn)\binom{m+n}{n} because each order-preserving map [m][n][m] \to [n] is determined by a weakly increasing sequence of m+1m+1 elements from [n][n].


Simplicial Sets

Definition1.3Simplicial set

A simplicial set is a functor X:ΔopSetX: \Delta^{\mathrm{op}} \to \mathbf{Set}. Equivalently, it is a presheaf on Δ\Delta. The category of simplicial sets is denoted sSet=Fun(Δop,Set)\mathbf{sSet} = \mathbf{Fun}(\Delta^{\mathrm{op}}, \mathbf{Set}).

Concretely, a simplicial set XX consists of:

  • A set XnX_n (called the set of nn-simplices) for each n0n \geq 0;
  • Face maps di:XnXn1d_i: X_n \to X_{n-1} for 0in0 \leq i \leq n, induced by δi\delta^i;
  • Degeneracy maps sj:XnXn+1s_j: X_n \to X_{n+1} for 0jn0 \leq j \leq n, induced by σj\sigma^j;

satisfying the simplicial identities:

didj=dj1di(i<j)d_i d_j = d_{j-1} d_i \quad (i < j) sisj=sj+1si(ij)s_i s_j = s_{j+1} s_i \quad (i \leq j) disj=sj1di(i<j)d_i s_j = s_{j-1} d_i \quad (i < j) djsj=dj+1sj=idd_j s_j = d_{j+1} s_j = \mathrm{id} disj=di1sj(i>j+1)d_i s_j = d_{i-1} s_j \quad (i > j+1)

ExampleStandard simplex Delta[n]

The standard nn-simplex is the representable presheaf

Δ[n]=HomΔ(,[n]):ΔopSet.\Delta[n] = \operatorname{Hom}_\Delta(-, [n]): \Delta^{\mathrm{op}} \to \mathbf{Set}.

Its mm-simplices are Δ[n]m=HomΔ([m],[n])\Delta[n]_m = \operatorname{Hom}_\Delta([m], [n]), the set of order-preserving maps [m][n][m] \to [n]. By Yoneda, morphisms Δ[n]X\Delta[n] \to X in sSet\mathbf{sSet} correspond bijectively to nn-simplices of XX.

For n=0n = 0: Δ[0]\Delta[0] is a single point. For n=1n = 1: Δ[1]\Delta[1] has two 00-simplices (vertices), one non-degenerate 11-simplex (the edge), and all higher simplices are degenerate. For n=2n = 2: Δ[2]\Delta[2] is a "filled triangle" with three vertices, three edges, and one non-degenerate 22-simplex.

ExampleBoundary of the standard simplex

The boundary Δ[n]\partial\Delta[n] is the simplicial subset of Δ[n]\Delta[n] consisting of all non-surjective maps [m][n][m] \to [n]. In other words, it contains all simplices of Δ[n]\Delta[n] except the unique non-degenerate nn-simplex id:[n][n]\mathrm{id}: [n] \to [n] and its degeneracies that require this top simplex.

For n=1n = 1: Δ[1]\partial\Delta[1] consists of just the two vertices, with no edge connecting them. For n=2n = 2: Δ[2]\partial\Delta[2] is the boundary of a triangle (three edges and three vertices, but no interior face).

The inclusion Δ[n]Δ[n]\partial\Delta[n] \hookrightarrow \Delta[n] is a fundamental cofibration in the theory of simplicial sets.

ExampleThe simplicial circle

The simplicial circle S1S^1 can be modeled as the quotient Δ[1]/Δ[1]\Delta[1]/\partial\Delta[1], identifying the two vertices of the interval. Explicitly, S1S^1 has one 00-simplex vv, one non-degenerate 11-simplex σ\sigma with d0(σ)=d1(σ)=vd_0(\sigma) = d_1(\sigma) = v, and all higher simplices are degenerate.

The geometric realization S1|S^1| is homeomorphic to the topological circle.


Degenerate and Non-degenerate Simplices

Definition1.4Degenerate simplex

An nn-simplex xXnx \in X_n is degenerate if x=sj(y)x = s_j(y) for some yXn1y \in X_{n-1} and some 0jn10 \leq j \leq n-1. An nn-simplex is non-degenerate if it is not degenerate.

Every simplex xXnx \in X_n can be written uniquely as x=sjksj1(y)x = s_{j_k} \cdots s_{j_1}(y) where yy is non-degenerate and j1<j2<<jkj_1 < j_2 < \cdots < j_k. This is the Eilenberg--Zilber decomposition.

ExampleDegenerate simplices in Delta[2]

Consider Δ[2]\Delta[2]. Its non-degenerate simplices are:

  • Three 00-simplices: e0,e1,e2e_0, e_1, e_2 (the constant maps to 0,1,20, 1, 2)
  • Three 11-simplices: d01,d02,d12d^{01}, d^{02}, d^{12} (the three edge inclusions)
  • One 22-simplex: id[2]\mathrm{id}_{[2]}

All other simplices are degenerate. For instance, s0(e0)Δ[2]1s_0(e_0) \in \Delta[2]_1 is the degenerate edge at vertex 00.

The total number of mm-simplices in Δ[n]\Delta[n] is (m+nn)\binom{m+n}{n}, but only (n+1m+1)\binom{n+1}{m+1} of these are non-degenerate (for mnm \leq n).


Basic Constructions

ExampleDiscrete simplicial sets

For any set SS, the discrete (or constant) simplicial set has Xn=SX_n = S for all nn, with all face and degeneracy maps being the identity. This defines a fully faithful functor SetsSet\mathbf{Set} \hookrightarrow \mathbf{sSet}.

Geometrically, a discrete simplicial set is a collection of points with no higher-dimensional simplices.

ExampleProducts of simplicial sets

The product X×YX \times Y of simplicial sets is defined levelwise:

(X×Y)n=Xn×Yn(X \times Y)_n = X_n \times Y_n

with face and degeneracy maps applied componentwise: di(x,y)=(dix,diy)d_i(x, y) = (d_i x, d_i y), sj(x,y)=(sjx,sjy)s_j(x, y) = (s_j x, s_j y).

The product Δ[1]×Δ[1]\Delta[1] \times \Delta[1] models a square. It has four 00-simplices, and its geometric realization is a square (divided into triangles).

ExampleCoproducts (disjoint unions)

The coproduct (disjoint union) is also levelwise: (XY)n=XnYn(X \sqcup Y)_n = X_n \sqcup Y_n.

Thus Δ[0]Δ[0]\Delta[0] \sqcup \Delta[0] is a simplicial set with two 00-simplices and no non-degenerate higher simplices: geometrically, two disjoint points.

ExampleSimplicial spheres

The simplicial nn-sphere can be defined as Sn=Δ[n]/Δ[n]S^n = \Delta[n]/\partial\Delta[n] (the quotient collapsing the boundary to a point).

For n=0n = 0: S0=Δ[0]Δ[0]S^0 = \Delta[0] \sqcup \Delta[0] (two points). For n=1n = 1: S1S^1 has one vertex and one non-degenerate 11-simplex (a loop). For n=2n = 2: S2S^2 has one vertex, no non-degenerate edges, and one non-degenerate 22-simplex.

The geometric realization Sn|S^n| is homeomorphic to the topological nn-sphere.


The Yoneda Embedding and Representable Presheaves

RemarkYoneda for simplicial sets

The Yoneda lemma tells us that for any simplicial set XX:

HomsSet(Δ[n],X)Xn.\operatorname{Hom}_{\mathbf{sSet}}(\Delta[n], X) \cong X_n.

This means an nn-simplex of XX is the same thing as a map Δ[n]X\Delta[n] \to X. Face and degeneracy operations correspond to precomposition with the coface and codegeneracy maps.

The category sSet\mathbf{sSet} is a presheaf category, so it is complete, cocomplete, and has internal hom objects (function complexes). This makes it an excellent combinatorial model for homotopy theory.

ExampleEvery simplicial set is a colimit of standard simplices

Every simplicial set XX is canonically the colimit of its simplices:

Xcolim(Δ[n]X)Δ/XΔ[n]X \cong \operatorname{colim}_{(\Delta[n] \to X) \in \Delta/X} \Delta[n]

where Δ/X\Delta/X is the category of simplices of XX (the comma category). This is a formal consequence of being a presheaf: every presheaf is a colimit of representables.

This decomposition is the simplicial analogue of the CW decomposition of a space into cells.


Simplicial Homotopy

Definition1.5Simplicial homotopy

Let f,g:XYf, g: X \to Y be maps of simplicial sets. A simplicial homotopy from ff to gg is a map H:X×Δ[1]YH: X \times \Delta[1] \to Y such that HX×{0}=fH|_{X \times \{0\}} = f and HX×{1}=gH|_{X \times \{1\}} = g.

More precisely, identifying X×{0}XX \times \{0\} \cong X with the map id×d1:X×Δ[0]X×Δ[1]\mathrm{id} \times d^1: X \times \Delta[0] \to X \times \Delta[1] (vertex 00 is the target of δ1\delta^1), we require H(id×d1)=fH \circ (\mathrm{id} \times d^1) = f, and similarly for gg.

ExampleHomotopy to a constant map

Let X=Δ[1]X = \Delta[1] and Y=Δ[1]Y = \Delta[1]. The identity map id:Δ[1]Δ[1]\mathrm{id}: \Delta[1] \to \Delta[1] and the constant map at vertex 00 are related by the simplicial homotopy H:Δ[1]×Δ[1]Δ[1]H: \Delta[1] \times \Delta[1] \to \Delta[1] defined by (s,t)min(s,t)(s, t) \mapsto \min(s, t) (in the order-preserving sense). This witnesses that Δ[1]\Delta[1] is contractible.

More generally, Δ[n]\Delta[n] is contractible for all nn: there is a simplicial homotopy from idΔ[n]\mathrm{id}_{\Delta[n]} to the constant map at vertex 00, given by (x,t)min(x,tn)(x, t) \mapsto \min(x, t \cdot n) (appropriately formalized via the cone construction).


Skeleton and Coskeleton

Definition1.6Skeleton and coskeleton

The nn-skeleton skn(X)\mathrm{sk}_n(X) of a simplicial set XX is the simplicial set generated by the simplices of dimension n\leq n. Formally, skn\mathrm{sk}_n is the left Kan extension of the restriction XΔnX|_{\Delta_{\leq n}} along the inclusion ΔnΔ\Delta_{\leq n} \hookrightarrow \Delta.

The nn-coskeleton coskn(X)\mathrm{cosk}_n(X) is the right Kan extension. There is an adjunction skncoskn\mathrm{sk}_n \dashv \mathrm{cosk}_n.

A simplicial set XX is nn-skeletal if X=skn(X)X = \mathrm{sk}_n(X), meaning all simplices of dimension >n> n are degenerate. It is nn-coskeletal if X=coskn(X)X = \mathrm{cosk}_n(X), meaning the mm-simplices for m>nm > n are uniquely determined by the simplices of dimension n\leq n.

ExampleNerves are 2-coskeletal

The nerve of a category (discussed in the next section) is a 22-coskeletal simplicial set. This means that a simplicial set is the nerve of a category if and only if its simplices of dimension 2\leq 2 satisfy the appropriate compatibility conditions and all higher simplices are uniquely determined.

Concretely, an nn-simplex of a nerve N(C)N(\mathcal{C}) for n2n \geq 2 is a composable chain of nn morphisms, which is completely determined by its faces (the sub-chains of length n1n-1).


Summary

RemarkKey points

The essential ideas about simplicial sets are:

  1. A simplicial set is a functor ΔopSet\Delta^{\mathrm{op}} \to \mathbf{Set}, specified by sets of simplices and face/degeneracy maps satisfying the simplicial identities.

  2. The standard simplices Δ[n]\Delta[n] are the building blocks; every simplicial set is a colimit of standard simplices.

  3. The category sSet\mathbf{sSet} is a presheaf category, so it has all limits, colimits, and internal homs.

  4. Simplicial sets provide a purely combinatorial foundation for homotopy theory, avoiding point-set topology entirely.

  5. Three key special classes are: nerves of categories (encoding categorical structure), Kan complexes (encoding homotopy types), and quasi-categories (encoding \infty-categorical structure).