Join (simplicial sets)

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Other usesIn higher category theory in mathematics, the join of simplicial sets is an operation making the category of simplicial sets into a monoidal category. In particular, it takes two simplicial sets to construct another simplicial set. It is closely related to the diamond operation and used in the construction of the twisted diagonal. Under the nerve construction, it corresponds to the join of categories and under the geometric realization, it corresponds to the join of topological spaces.

Definition

Visualization of the join X∗Y with the blue part representing X and the green part representing Y.

For natural numbers m,p,q∈ℕ, one has the identity:[1]

Hom⁡([m],[p+q+1])=∏i+j+1=nHom⁡([i],[p])×Hom⁡([j],[q]),

which can be extended by colimits to a functor −∗−:𝐬𝐒𝐞𝐭×𝐬𝐒𝐞𝐭→𝐬𝐒𝐞𝐭, which together with the empty simplicial set as unit element makes the category of simplicial sets 𝐬𝐒𝐞𝐭 into a monoidal category. For simplicial set X and Y, their join X∗Y is the simplicial set:[2][3][1]

(X∗Y)n=∏i+j+1=nXi×Yj.

A n-simplex σ:Δn→X∗Y therefore either factors over X or Y or splits into a p-simplex σ−:Δp→X and a q-simplex σ+:Δq→Y with n=p+q+1 and σ=σ−∗σ+.[4]

One has canonical morphisms X,Y→X∗Y, which combine into a canonical morphism X+Y→X∗Y through the universal property of the coproduct. One also has a canonical morphism X∗Y→Δ0∗Δ0≅Δ1 of terminal maps, for which the fiber of 0 is X and the fiber of 1 is Y.

For a simplicial set X, one further defines its left cone and right cone as:

X◃:=Δ0∗X,
X▹:=X∗Δ0.

Right adjoint

Let Y be a simplicial set. The functor Y∗−:𝐬𝐒𝐞𝐭→Y∖𝐬𝐒𝐞𝐭,X↦(Y↦Y∗X) has a right adjoint Y∖𝐬𝐒𝐞𝐭→𝐬𝐒𝐞𝐭,(t:Y→W)↦t∖W (alternatively denoted Y∖W) and the functor −∗Y:𝐬𝐒𝐞𝐭→Y∖𝐬𝐒𝐞𝐭,X↦(Y↦X∗Y) also has a right adjoint Y∖𝐬𝐒𝐞𝐭→𝐬𝐒𝐞𝐭,(t:Y→W)↦W/t (alternatively denoted W/Y).[5][6][7] A special case is Y=Δ0 the terminal simplicial set, since 𝐬𝐒𝐞𝐭∗=Δ0∖𝐬𝐒𝐞𝐭 is the category of pointed simplicial sets.

Let 𝒞 be a category and X∈Ob⁡𝒞 be an object. Let [0] be the terminal category (with the notation taken from the terminal object of the simplex category), then there is an associated functor t:[0]→𝒞,0↦X, which with the nerve induces a morphism Nt:Δ0→N𝒞. For every simplicial set A, one has by additionally using the adjunction between the join of categories and slice categories:[8]

𝐬𝐒𝐞𝐭(A,N𝒞/Nt)≅𝐬𝐒𝐞𝐭∗(Δ0→A∗Δ0,Nt)≅𝐂𝐚𝐭∗([0]→τ(A)⋆[0],t)≅𝐂𝐚𝐭(τ(A),𝒞/X)≅𝐬𝐒𝐞𝐭(A,N(𝒞/X)).

Hence according to the Yoneda lemma, one has (with the alternative notation, which here better underlines the result):[9][7]

N𝒞/NX≅N(𝒞/X).

Examples

One has:[10]

∂Δm∗Δn∪Δm∗∂Δn≅∂Δm+n+1,
Λkm∗Δn∪Δm∗∂Δn≅Λkm+n+1,
∂Δm∗Δn∪Δm∗Λkn≅Λm+k+1m+n+1.

Properties

  • For simplicial sets X and Y, there is a unique morphism γX,Y:X⋄Y→X∗Y into the diamond operation compatible with the maps X+Y→X∗Y,X⋄Y and X∗Y,X⋄Y→Δ1.[11] It is a weak categorical equivalence, hence a weak equivalence of the Joyal model structure.[12][13]
  • For a simplicial set X, the functors X∗−,−∗X:𝐬𝐒𝐞𝐭→𝐬𝐒𝐞𝐭 preserve weak categorical equivalences.[14]
  • For ∞-categories X and Y, the simplicial set X∗Y is also an ∞-category.[15][16]
  • The join is associative. For simplicial sets X, Y and Z, one has:
    (X∗Y)∗Z≅X∗(Y∗Z).
  • The join reverses under the opposite simplicial set. For simplicial sets X and Y, one has:[17][18]
    (X∗Y)op≅Yop∗Xop.
  • For a morphism t:Y→W, one has (as adjoint of the previous result):[18]
    (W/t)op≅top∖Wop.
  • For a morphism z:Y∗X→W, its precomposition with the canonical inclusion x:X→Y∗X→W and y:Y→W/x corresponding to z under the adjunction 𝐬𝐒𝐞𝐭(Y,W/x)≅X∖𝐬𝐒𝐞𝐭(X→Y∗X,x), one has W/z≅(W/x)/y or in alternative notation:[18]
W/(Y∗X)≅(W/X)/Y.
Proof: For every simplicial set A, one has:
𝐬𝐒𝐞𝐭(A,W/z)≅(Y∗X)∖𝐬𝐒𝐞𝐭((Y∗X)→A∗(Y∗X),z)≅X∖𝐬𝐒𝐞𝐭(X→(A∗Y)∗X,x)≅𝐬𝐒𝐞𝐭(A∗Y,W/x)≅Y∖𝐬𝐒𝐞𝐭(Y→A∗Y,y)≅𝐬𝐒𝐞𝐭(A,(W/x)/y),
so the claim follows from the Yoneda lemma.
  • Under the nerve, the join of categories becomes the join of simplicial sets. For small categories 𝒞 and 𝒟, one has:[19][20]
    N(𝒞⋆𝒟)≅N𝒞∗N𝒟.

Literature

References

  1. ↑ 1.0 1.1 Cisinski 2019, 3.4.12.
  2. ↑ Joyal 2008, Proposition 3.1.
  3. ↑ Lurie 2009, Definition 1.2.8.1.
  4. ↑ Kerodon, Remark 4.3.3.17.
  5. ↑ Joyal 2008, Proposition 3.12.
  6. ↑ Lurie 2009, Proposition 1.2.9.2
  7. ↑ 7.0 7.1 Cisinski 2019, 3.4.14.
  8. ↑ Lurie 2009, 1.2.9 Overcategories and Undercategories
  9. ↑ Joyal 2008, Proposition 3.13.
  10. ↑ Cisinski 2019, Proposition 3.4.17.
  11. ↑ Cisinski 2019, Proposition 4.2.2.
  12. ↑ Lurie 2009, Proposition 4.2.1.2.
  13. ↑ Cisinksi 2019, Proposition 4.2.3.
  14. ↑ Cisinski 2019, Corollary 4.2.5.
  15. ↑ Joyal 2008, Corollary 3.23.
  16. ↑ Lurie 2009, Proposition 1.2.8.3
  17. ↑ Joyal 2008, p. 244
  18. ↑ 18.0 18.1 18.2 Cisinski 2019, Remark 3.4.15.
  19. ↑ Joyal 2008, Corollary 3.3.
  20. ↑ Kerodon, Example 4.3.3.14.