Subdivision is a usually functorial process which takes as input some combinatorial notion of space (for example, a simplicial complex or simplicial set) and produces as output a more finely meshed space. It is related to the notion of classical subdivision.
Subdivision is easiest to define for simplicial complexes. We have a pair of functors
where
The functor sends a simplicial complex to , regarded as a poset ordered by inclusion, and
The functor sends a poset to the simplicial complex whose vertex set is and whose simplices are the underlying sets of flags .
The composite is called the subdivision ; it is an endofunctor of . Note that the vertices of are the simplices of . We also have , where is the usual geometric realization of simplicial complexes.
We can now define the subdivision of a simplicial set as follows. Recall that we can make any simplicial complex into a simplicial set. If we do this for the standard -simplex, which as a simplicial complex is the set for , then we get the standard -simplex simplicial set . We can then define the subdivision of , as a simplicial set, to be the simplicial set corresponding to its simplicial-complex subdivision. Finally, we can make this functorial on maps between standard simplices, and left Kan extend to a cocontinuous endofunctor of .
By construction (or the adjoint functor theorem), the subdivision functor on simplicial sets has a right adjoint, called . An infinity iteration of can be used to construct Kan fibrant replacements in the model structure on simplicial sets.
This functorial subdivision corresponds to the classical barycentric subdivision. Other classical subdivisions that are frequently encountered include the middle edge subdivision. This latter is closely related to the ordinal subdivision? of simplicial sets.