Documentation

TauCeti.AlgebraicTopology.SimplicialSet.Slice

Slices of simplicial sets #

For a simplicial set C and a diagram p : K ⟶ C, the slice C_{/p} is the simplicial set whose n-simplices are the maps Δ[n] ⋆ K ⟶ C from the join that restrict to p on K. Its vertices are the cones over p, with cone point the image of Δ[0], and its edges are morphisms of cones. A limit of p in a quasicategory is a final object of C_{/p}, so this is the construction through which limits are defined; colimits are dually the initial objects of the coslice C_{p/}, built from the joins K ⋆ Δ[n].

The slice is characterized by its universal property (SSet.slice.homEquiv): maps of simplicial sets X ⟶ C_{/p} correspond to maps X ⋆ K ⟶ C extending p, naturally in X. In other words, C_{/p} represents the presheaf SSet.slice.functor p of such maps (SSet.slice.representableBy), and the definition of C_{/p} is the restriction of this presheaf to standard simplices.

Main definitions #

Main results #

Implementation notes #

Given F : X ⟶ C_{/p}, the map X ⋆ K ⟶ C is defined simplexwise. A simplex of X ⋆ K either lies in K, where it is sent through p, or meets X; in the second case it is the image of a simplex of Δ[m] ⋆ K under g ⋆ K for a simplex g : Δ[m] ⟶ X extending its part in X (SSet.join.exists_eq_comp_inr_or_exists_eq_comp_map), and it is sent to the value of F g on that simplex. The extension g is chosen along the retraction SSet.joinFiberZeroRetraction of Δ[m] onto its part over the vertex 0 of Δ[1], and the value is independent of the choice of factorization because F is compatible with the faces and degeneracies of X.

References #

The maps X ⋆ K ⟶ C extending p : K ⟶ C along the inclusion K ⟶ X ⋆ K, as a presheaf on simplicial sets, acting by precomposition with g ⋆ K.

Instances For
    def SSet.slice {K C : SSet} (p : K ⟶ C) :

    The slice C_{/p} of a simplicial set C over a diagram p : K ⟶ C. Its n-simplices are the maps Δ[n] ⋆ K ⟶ C extending p along the inclusion of K; in particular its vertices are the cones Δ[0] ⋆ K ⟶ C over p.

    Instances For

      The n-simplices of the slice C_{/p} are the maps Δ[n] ⋆ K ⟶ C extending p.

      Instances For
        def SSet.slice.π {K C : SSet} (p : K ⟶ C) :

        The projection C_{/p} ⟶ C, restricting a simplex Δ[n] ⋆ K ⟶ C of the slice to Δ[n].

        Instances For
          noncomputable def SSet.slice.homEquiv {X K C : SSet} {p : K ⟶ C} :

          The universal property of the slice: maps X ⟶ C_{/p} correspond to maps X ⋆ K ⟶ C extending p. A map τ : X ⋆ K ⟶ C corresponds to the map sending a simplex x : Δ[n] ⟶ X to the simplex (x ⋆ K) ≫ τ of the slice (SSet.slice.homEquiv_symm_app_coe).

          Instances For
            @[simp]

            The map to the slice given by τ : X ⋆ K ⟶ C sends a simplex x of X to the simplex (x ⋆ K) ≫ τ.

            @[simp]

            The universal property of the slice is natural in X: precomposing with f : Y ⟶ X corresponds to precomposing with f ⋆ K.

            noncomputable def SSet.slice.representableBy {K C : SSet} (p : K ⟶ C) :

            The slice C_{/p} represents the presheaf of maps X ⋆ K ⟶ C extending p.

            Instances For

              The simplex of the slice that a map F : X ⟶ C_{/p} assigns to a simplex x of X is the restriction along x ⋆ K of the map X ⋆ K ⟶ C corresponding to F.

              theorem SSet.slice.hom_ext {X K C : SSet} {p : K ⟶ C} {F G : X ⟶ slice p} (h : ↑(homEquiv F) = ↑(homEquiv G)) :
              F = G

              Maps to the slice are equal when the corresponding maps X ⋆ K ⟶ C are equal.

              @[simp]

              The projection of the slice to C corresponds, under the universal property, to restricting along the inclusion X ⟶ X ⋆ K.

              @[simp]

              The projection of the slice to C corresponds, under the universal property, to restricting along the inclusion X ⟶ X ⋆ K.

              theorem SSet.slice.isIso_π {K C : SSet} (p : K ⟶ C) (hK : ¬K.Nonempty) :

              The slice over the empty diagram is the whole simplicial set: when K is empty, the projection C_{/p} ⟶ C is an isomorphism.

              noncomputable def SSet.slice.map {K C : SSet} {p : K ⟶ C} {L D : SSet} {q : L ⟶ D} (i : L ⟶ K) (g : C ⟶ D) (h : CategoryTheory.CategoryStruct.comp i (CategoryTheory.CategoryStruct.comp p g) = q) :

              The map of slices C_{/p} ⟶ D_{/q} induced by maps i : L ⟶ K and g : C ⟶ D with i ≫ p ≫ g = q: it sends a simplex σ : Δ[n] ⋆ K ⟶ C of C_{/p} to (Δ[n] ⋆ i) ≫ σ ≫ g (SSet.slice.objEquiv_map_app_coe). Restricting a cone along i and pushing it forward along g are the special cases g = 𝟙 C and i = 𝟙 K.

              Instances For
                @[simp]

                Under the universal property of the slice, composing with SSet.slice.map i g h corresponds to precomposing with X ⋆ i and postcomposing with g.

                @[simp]

                Under the universal property of the slice, SSet.slice.map i g h corresponds to the universal map C_{/p} ⋆ K ⟶ C precomposed with C_{/p} ⋆ i and postcomposed with g.

                @[simp]

                The map of slices sends a simplex σ : Δ[n] ⋆ K ⟶ C to (Δ[n] ⋆ i) ≫ σ ≫ g.

                The map of slices is compatible with the projections to C and D.

                The map of slices is compatible with the projections to C and D.

                @[simp]
                theorem SSet.slice.map_comp {K C : SSet} {p : K ⟶ C} {L D : SSet} {q : L ⟶ D} {L' D' : SSet} {q' : L' ⟶ D'} (i : L ⟶ K) (g : C ⟶ D) (h : CategoryTheory.CategoryStruct.comp i (CategoryTheory.CategoryStruct.comp p g) = q) (i' : L' ⟶ L) (g' : D ⟶ D') (h' : CategoryTheory.CategoryStruct.comp i' (CategoryTheory.CategoryStruct.comp q g') = q') :

                Maps of slices compose: restrictions compose contravariantly and pushforwards covariantly.

                @[simp]

                Maps of slices compose: restrictions compose contravariantly and pushforwards covariantly.

                Pushing cones forward along an isomorphism is an isomorphism of slices.

                Slices preserve pullbacks: for a pullback square of simplicial sets with top-left corner C', the slices over a diagram p' : K ⟶ C' and over its images in the other corners form a pullback square.

                noncomputable def SSet.slice.restrictionMap {K L X S : SSet} (i : L ⟶ K) (p : X ⟶ S) (σ : K ⟶ X) :

                For maps i : L ⟶ K, p : X ⟶ S and a diagram σ : K ⟶ X, the map X_{/σ} ⟶ X_{/i ≫ σ} ×_{S_{/i ≫ σ ≫ p}} S_{/σ ≫ p} which restricts a cone over σ along i and pushes it forward along p. For i the inclusion of the target vertex of an edge σ, this is the map whose being a trivial fibration makes σ a p-Cartesian edge.

                Instances For
                  instance SSet.slice.isIso_restrictionMap {K L X S : SSet} (i : L ⟶ K) (p : X ⟶ S) [CategoryTheory.IsIso p] (σ : K ⟶ X) :

                  For an isomorphism p, the map SSet.slice.restrictionMap i p σ is an isomorphism.

                  Restriction maps are stable under base change: for a pullback square of simplicial sets with sides t : X' ⟶ X, p' : X' ⟶ S', p : X ⟶ S and b : S' ⟶ S, and a diagram σ : K ⟶ X', the restriction map for p' and σ is the base change of the restriction map for p and σ ≫ t.

                  For maps p : X ⟶ S and r : S ⟶ Z, the map X_{/i ≫ σ} ×_{S_{/i ≫ σ ≫ p}} S_{/σ ≫ p} ⟶ X_{/i ≫ σ} ×_{Z_{/i ≫ σ ≫ p ≫ r}} Z_{/σ ≫ p ≫ r} pushing the second component forward along r. Composed with the restriction map for p, it is the restriction map for p ≫ r (SSet.slice.restrictionMap_comp), and it is a base change of the restriction map for r and σ ≫ p (SSet.slice.isPullback_restrictionMapComp).

                  Instances For

                    The restriction map for a composite p ≫ r factors through the restriction map for p.