Subdivision (simplicial set)

In higher category theory in mathematics, the subdivision of simplicial sets (subdivision functor or Sd functor) is an endofunctor on the category of simplicial sets. It refines the structure of simplicial sets in a purely combinatorical way without changing constructions like the geometric realization. Furthermore, the subdivision of simplicial sets plays an important role in the extension of simplicial sets right adjoint to it.
Definition
[edit | edit source]For a partially ordered set , let be the set of non-empty finite totally ordered subsets, which itself is partially ordered by inclusion. Every partially ordered set can be considered as a category. Postcomposition with the nerve defines the subdivision functor on the simplex category by:
On the full category of simplicial sets, the subdivision functor , similar to the geometric realization, is defined through an extension by colimits. For a simplicial set , one therefore has:[1]
With the maximum , which in partially ordered sets neither has to exist nor has to be unique, which both holds in totally ordered sets, there is a natural transformation by extension. In particular there is a canonical morphism for every simplicial set .
Sd∞ functor
[edit | edit source]For a simplicial set , the canonical morphism indudes an -shaped cocone , whose colimit is denoted:
Since limit and colimit are switched, there is no adjunction with the Ex∞ functor.
The natural transformation induces a natural transformation . In particular, there is a canonical morphism for every simplicial set .
Examples
[edit | edit source]Directly from the definition, one has:[2]
Since , it is fixed under (infinite) subdivision:
Properties
[edit | edit source]- For every simplicial set , the canonical morphism is a weak homotopy equivalence.[3]
- The subdivision functor preserves monomorphisms and weak homotopy equivalences (which follows directly from the preceding property and their 2-of-3 property) as well as anodyne extensions in combination,[4] hence cofibrations and trivial cofibrations of the Kan–Quillen model structure. This makes the adjunction even into a Quillen adjunction .
- For a partially ordered set , one has with the nerve:[5]
- Using with results in the definition again.
- Let be the set of non-empty subsets of , which don't contain the complement of , and let be the set of non-empty proper subsets of , then:[6]
- The subdivision functor preserves the geometric realization. For a simplicial set , one has:[7]
- Since both functors are defined through extension by colimits, it is sufficient to show .[8]
See also
[edit | edit source]Literature
[edit | edit source]- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
References
[edit | edit source]- ^ Goerss & Jardine 1999, S. 183
- ^ Cisinski 2019, 3.8.6.
- ^ Cisinski 2019, Proposition 3.1.19.
- ^ Cisinski 2019, Proposition 3.1.18.
- ^ Cisinski 2019, Lemma 3.1.25.
- ^ Cisinski 2019, Lemma 3.1.26.
- ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- ^ Goerss & Jardine 1999, S. 182
External links
[edit | edit source]- subdivision at the nLab
- The Subdivision of a Simplicial Set at Kerodon