Subdivision (simplicial set)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Process of subdivision of the standard 2-simplex Δ2: The partially ordered set [2]={0,1,2} with 01, 12 and 02 forms a triangle, while the partially ordered set s([2])={{0},{1},{2},{0,1},{1,2},{0,2},{0,1,2}} forms its subdivision with {0}, {1} and {2} being the original triangle, {0,1}, {1,2} and {0,2} subdividing the edges and {0,1,2} subdividing the face.

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 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:𝐂𝐚𝐭𝐬𝐒𝐞𝐭 defines the subdivision functor Sd:Δ𝐬𝐒𝐞𝐭 on the simplex category by:

Sd(Δn):=N(s([n])).

On the full category of simplicial sets, the subdivision functor Sd:𝐬𝐒𝐞𝐭𝐬𝐒𝐞𝐭, similar to the geometric realization, is defined through an extension by colimits. For a simplicial set X, one therefore has:[1]

Sd(X):=limΔnXSd(Δn).

With the maximum max:s(I)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:SdId by extension. In particular there is a canonical morphism aX:Sd(X)X for every simplicial set X.

Sd∞ functor

[edit | edit source]

For a simplicial set X, the canonical morphism aX:Sd(X)X indudes an -shaped cocone Sd3(X)Sd2(X)Sd(X)X, whose colimit is denoted:

Sd(X):=limnSdn(X).

Since limit and colimit are switched, there is no adjunction SdEx with the Ex∞ functor.

The natural transformation a:SdId induces a natural transformation α:SdId. In particular, there is a canonical morphism αX:Sd(X)X for every simplicial set X.

Examples

[edit | edit source]

Directly from the definition, one has:[2]

Sd(Δ0)=Δ0,
Sd(Δ1)=Λ22.

Since Δ1Δ0+Δ0, it is fixed under (infinite) subdivision:

Sd(Δ1)=Δ1,
Sd(Δ1)=Δ1.

Properties

[edit | edit source]
  • For every simplicial set X, the canonical morphism aX:Sd(X)X is a weak homotopy equivalence.[3]
  • The subdivision functor Sd 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 SdEx even into a Quillen adjunction Sd:𝐬𝐒𝐞𝐭KQ𝐬𝐒𝐞𝐭KQ:Ex.
  • For a partially ordered set I, one has with the nerve:[5]
    Sd(N(I))N(s(I)).
Using I=[n] with Δn=N([n]) results in the definition again.
  • Let Φkn be the set of non-empty subsets of [n], which don't contain the complement of {k}, and let Φn be the set of non-empty proper subsets of [n], then:[6]
    Sd(Λkn)N(Φkn),
    Sd(Δn)N(Φn).
  • The subdivision functor preserves the geometric realization. For a simplicial set X, one has:[7]
    |Sd(X)||X|.
Since both functors are defined through extension by colimits, it is sufficient to show |Sd(Δn)|=|Δn|.[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]
  1. ^ Goerss & Jardine 1999, S. 183
  2. ^ Cisinski 2019, 3.8.6.
  3. ^ Cisinski 2019, Proposition 3.1.19.
  4. ^ Cisinski 2019, Proposition 3.1.18.
  5. ^ Cisinski 2019, Lemma 3.1.25.
  6. ^ Cisinski 2019, Lemma 3.1.26.
  7. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  8. ^ Goerss & Jardine 1999, S. 182
[edit | edit source]