Subdivision (simplicial Set)
   HOME

TheInfoList



OR:

In
higher category theory In mathematics, higher category theory is the part of category theory at a ''higher order'', which means that some equalities are replaced by explicit morphism, arrows in order to be able to explicitly study the structure behind those equalities. H ...
in
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, 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

For a partially ordered set I, let s(I) 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 N\colon \mathbf\rightarrow\mathbf defines the subdivision functor \operatorname\colon \Delta\rightarrow\mathbf on the simplex category by: : \operatorname(\Delta^n) :=N(s( ). On the full category of simplicial sets, the subdivision functor \operatorname\colon \mathbf\rightarrow\mathbf, similar to the geometric realization, is defined through an extension by colimits. For a simplicial set X, one therefore has: : \operatorname(X) :=\varinjlim_\operatorname(\Delta^n). With the maximum \max\colon s(I)\rightarrow I, 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 a\colon \operatorname\Rightarrow\operatorname by extension. In particular there is a canonical morphism a_X\colon \operatorname(X)\rightarrow X for every simplicial set X.


Sd∞ functor

For a simplicial set X, the canonical morphism a_X\colon \operatorname(X) \rightarrow X indudes an \mathbb-shaped cocone \ldots\rightarrow\operatorname^3(X)\rightarrow\operatorname^2(X)\rightarrow\operatorname(X)\rightarrow X, whose colimit is denoted: : \operatorname^\infty(X) :=\varprojlim_\operatorname^n(X). Since limit and colimit are switched, there is no adjunction \operatorname^\infty\dashv\operatorname^\infty with the Ex∞ functor. The natural transformation a\colon\operatorname\Rightarrow\operatorname induces a natural transformation \alpha\colon \operatorname^\infty\Rightarrow\operatorname. In particular, there is a canonical morphism \alpha_X\colon \operatorname^\infty(X)\rightarrow X for every simplicial set X.


Examples

Directly from the definition, one has: : \operatorname(\Delta^0) =\Delta^0, : \operatorname(\Delta^1) =\Lambda_2^2. Since \partial\Delta^1 \cong\Delta^0+\Delta^0 , it is fixed under (infinite) subdivision: : \operatorname(\partial\Delta^1) =\partial\Delta^1, : \operatorname^\infty(\partial\Delta^1) =\partial\Delta^1.


Properties

* For every simplicial set X, the canonical morphism a_X\colon \operatorname(X)\rightarrow X is a weak homotopy equivalence. * The subdivision functor \operatorname 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, hence cofibrations and trivial cofibrations of the Kan–Quillen model structure. This makes the adjunction \operatorname\dashv\operatorname even into a Quillen adjunction \operatorname\colon \mathbf_\mathrm\rightleftarrows\mathbf_\mathrm\colon \operatorname. * For a partially ordered set I, one has with the nerve: *: \operatorname(N(I)) \cong N(s(I)). : Using I= /math> with \Delta^n=N( results in the definition again. * Let \Phi_k^n be the set of non-empty subsets of /math>, which don't contain the complement of \, and let \partial\Phi^n be the set of non-empty proper subsets of /math>, then: *: \operatorname(\Lambda_k^n) \cong N(\Phi_k^n), *: \operatorname(\partial\Delta^n) \cong N(\partial\Phi^n). * The subdivision functor preserves the geometric realization. For a simplicial set X, one has: *: , \operatorname(X), \cong, X, . : Since both functors are defined through extension by colimits, it is sufficient to show , \operatorname(\Delta^n), =, \Delta^n, .Goerss & Jardine 1999, S. 182


See also

*
Subdivision (simplicial complex) A subdivision (also called refinement) of a simplicial complex is another simplicial complex in which, intuitively, one or more simplices of the original complex have been partitioned into smaller simplices. The most commonly used subdivision is th ...


Literature

* * {{cite book , last=Cisinski , first=Denis-Charles , author-link=Denis-Charles Cisinski , url=https://cisinski.app.uni-regensburg.de/CatLR.pdf , title=Higher Categories and Homotopical Algebra , date=2019-06-30 , publisher=
Cambridge University Press Cambridge University Press was the university press of the University of Cambridge. Granted a letters patent by King Henry VIII in 1534, it was the oldest university press in the world. Cambridge University Press merged with Cambridge Assessme ...
, isbn=978-1108473200 , location= , language=en , authorlink=


References


External links

* subdivision at the ''n''Lab
The Subdivision of a Simplicial Set
at Kerodon Higher category theory