Nonsingular simplicial sets #
In this file, we introduce a typeclass SSet.Nonsingular for a
simplicial set X : SSet: it says that for any non-degenerate simplex
x : X _⦋n⦌, the corresponding morphism Δ[n] ⟶ X is a monomorphism.
This notion is useful in the context of the study of the subdivision
functor (TODO @joelriou).
The condition SSet.Nonsingular is a weaker condition compared
to the notion of "polyhedral complex" which appears in the article
Simplicial approximation by Jardine, and which says that there
exists a monomorphism X ⟶ nerve T where T is a partially ordered type.
References #
A simplicial set X is nonsingular if for any
nondegenerate simplex x (of dimension n), the corresponding
morphism Δ[n] ⟶ X is a monomorphism.
Instances
theorem
SSet.Nonsingular.mono'
{X : SSet}
[X.Nonsingular]
{n : ℕ}
(x : X.obj (Opposite.op { len := n }))
(hx : x ∈ X.nonDegenerate n)
:
instance
SSet.instNonsingularObjSimplexCategoryStdSimplex
(n : SimplexCategory)
:
(stdSimplex.obj n).Nonsingular
theorem
SSet.nonDegenerate_δ
{X : SSet}
[X.Nonsingular]
{n : ℕ}
{x : X.obj (Opposite.op { len := n + 1 })}
(hx : x ∈ X.nonDegenerate (n + 1))
(i : Fin (n + 2))
:
theorem
SSet.Nonsingular.δ_injective
{X : SSet}
[X.Nonsingular]
{n : ℕ}
(x : X.obj (Opposite.op { len := n + 1 }))
(hx : x ∈ X.nonDegenerate (n + 1))
(i j : Fin (n + 2))
(hij :
(CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X i)) x = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.SimplicialObject.δ X j)) x)
: