Properties of the geometric realization #
In this file, we introduce some API in order to study the geometric realization functor (and its right adjoint the singular simplicial set functor):
SimplexCategory.toTopHomeo: the homeomorphism between the geometric realization ofΔ[n]andstdSimplex ℝ (Fin (n + 1));TopCat.toSSetObj₀Equiv : toSSet.obj X _⦋0⦌ ≃ XforX : TopCat;SSet.stdSimplex.toTopObjIsoI : |Δ[1]| ≅ TopCat.I;SSet.stdSimplex.toSSetObjI : Δ[1] ⟶ TopCat.toSSet.obj TopCat.I: the morphism corresponding totoTopObjIsoI.homby adjunction.
@[instance_reducible]
The homeomorphism between the topological realization of a standard simplex
in SSet and the corresponding topological standard simplex.
Equations
Instances For
theorem SimplexCategory.toTopHomeo_naturality_apply {n m : SimplexCategory} (f : n ⟶ m) (x : ↑(SSet.toTop.obj (SSet.stdSimplex.obj n))) :
theorem SimplexCategory.toTopHomeo_symm_naturality_apply {n m : SimplexCategory} (f : n ⟶ m) (x : Convexity.StdSimplex ℝ (Fin (n.len + 1))) :
@[instance_reducible]
noncomputable instance instUniqueCarrierObjSSetTopCatToTopSimplexCategoryStdSimplexMkOfNatNat :
Unique ↑(SSet.toTop.obj (SSet.stdSimplex.obj { len := 0 }))
Equations
theorem TopCat.toSSetObj₀Equiv_apply {X : TopCat} (a✝ : (toSSet.obj X).obj (Opposite.op { len := 0 })) :
theorem TopCat.toSSetObj₀Equiv_symm_apply {X : TopCat} (a✝ : ↑X) :
toSSetObj₀Equiv.symm a✝ = (X.toSSetObjEquiv (Opposite.op { len := 0 })).symm
{ toFun := fun (x : Convexity.StdSimplex ℝ (Fin (0 + 1))) => a✝, continuous_toFun := ⋯ }
@[simp]
theorem TopCat.toSSetObjEquiv_symm_naturality {X : TopCat} {n m : SimplexCategory} (f : n ⟶ m) (g : C(Convexity.StdSimplex ℝ (Fin (m.len + 1)), ↑X)) :
(CategoryTheory.ConcreteCategory.hom ((toSSet.obj X).map f.op)) ((X.toSSetObjEquiv (Opposite.op m)).symm g) = (X.toSSetObjEquiv (Opposite.op n)).symm
(g.comp { toFun := Convexity.StdSimplex.map ⇑(CategoryTheory.ConcreteCategory.hom f), continuous_toFun := ⋯ })
@[simp]
theorem TopCat.toSSetObjEquiv_naturality_apply {X : TopCat} {n m : SimplexCategory} (f : n ⟶ m) (x : (toSSet.obj X).obj (Opposite.op m)) (z : Convexity.StdSimplex ℝ (Fin (n.len + 1))) :
((X.toSSetObjEquiv (Opposite.op n)) ((CategoryTheory.ConcreteCategory.hom ((toSSet.obj X).map f.op)) x)) z = ((X.toSSetObjEquiv (Opposite.op m)) x) (Convexity.StdSimplex.map (⇑(CategoryTheory.ConcreteCategory.hom f)) z)
@[simp]
theorem TopCat.toSSetObjEquiv_δ_apply {X : TopCat} {n : ℕ} (x : (toSSet.obj X).obj (Opposite.op { len := n + 1 })) (i : Fin (n + 2)) (z : Convexity.StdSimplex ℝ (Fin (n + 1))) :
((X.toSSetObjEquiv (Opposite.op { len := n }))
((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ (toSSet.obj X) i)) x))
z = ((X.toSSetObjEquiv (Opposite.op { len := n + 1 })) x) (Convexity.StdSimplex.map i.succAbove z)
@[simp]
theorem TopCat.toSSetObjEquiv_σ_apply {X : TopCat} {n : ℕ} (x : (toSSet.obj X).obj (Opposite.op { len := n })) (i : Fin (n + 1)) (z : Convexity.StdSimplex ℝ (Fin (n + 2))) :
((X.toSSetObjEquiv (Opposite.op { len := n + 1 }))
((CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.σ (toSSet.obj X) i)) x))
z = ((X.toSSetObjEquiv (Opposite.op { len := n })) x) (Convexity.StdSimplex.map i.predAbove z)
theorem sSetTopAdj_homEquiv_stdSimplex_zero {X : TopCat} (f : SSet.toTop.obj (SSet.stdSimplex.obj { len := 0 }) ⟶ X) :
(sSetTopAdj.homEquiv (SSet.stdSimplex.obj { len := 0 }) X) f = SSet.const (TopCat.toSSetObj₀Equiv.symm ((CategoryTheory.ConcreteCategory.hom f) default))
@[simp]
@[simp]
@[simp]
The canonical morphism Δ[1] ⟶ TopCat.toSSet.obj TopCat.I: by adjunction,
it corresponds to the isomorphism toTopObjIsoI : |Δ[1]| ≅ TopCat.I.
Equations
Instances For
@[simp]
theorem SSet.stdSimplex.toSSetObj_app_const_zero :
(CategoryTheory.ConcreteCategory.hom (toSSetObjI.app (Opposite.op { len := 0 })))
(const 1 0 (Opposite.op { len := 0 })) = TopCat.toSSetObj₀Equiv.symm 0
@[simp]
theorem SSet.stdSimplex.toSSetObj_app_const_one :
(CategoryTheory.ConcreteCategory.hom (toSSetObjI.app (Opposite.op { len := 0 })))
(const 1 1 (Opposite.op { len := 0 })) = TopCat.toSSetObj₀Equiv.symm 1
@[simp]
@[simp]
theorem SSet.stdSimplex.ι₀_whiskerLeft_toSSetObjI_μ_assoc (X : TopCat) {Z : SSet} (h : TopCat.toSSet.obj (CategoryTheory.MonoidalCategoryStruct.tensorObj X TopCat.I) ⟶ Z) :
CategoryTheory.CategoryStruct.comp ι₀
(CategoryTheory.CategoryStruct.comp
(CategoryTheory.MonoidalCategoryStruct.whiskerLeft (TopCat.toSSet.obj X) toSSetObjI)
(CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.LaxMonoidal.μ TopCat.toSSet X TopCat.I) h)) = CategoryTheory.CategoryStruct.comp (TopCat.toSSet.map TopCat.ι₀) h
@[simp]
@[simp]
theorem SSet.stdSimplex.ι₁_whiskerLeft_toSSetObjI_μ_assoc (X : TopCat) {Z : SSet} (h : TopCat.toSSet.obj (CategoryTheory.MonoidalCategoryStruct.tensorObj X TopCat.I) ⟶ Z) :
CategoryTheory.CategoryStruct.comp ι₁
(CategoryTheory.CategoryStruct.comp
(CategoryTheory.MonoidalCategoryStruct.whiskerLeft (TopCat.toSSet.obj X) toSSetObjI)
(CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.LaxMonoidal.μ TopCat.toSSet X TopCat.I) h)) = CategoryTheory.CategoryStruct.comp (TopCat.toSSet.map TopCat.ι₁) h