Simplices in Δ[1] #
We define a bijection SSet.stdSimplex.objMk₁ between Fin (n + 2) and Δ[1] _⦋n⦌
for any n : ℕ.
def
SSet.stdSimplex.objMk₁
{n : ℕ}
(i : Fin (n + 2))
:
(stdSimplex.obj (SimplexCategory.mk 1)).obj (Opposite.op (SimplexCategory.mk n))
Given i : Fin (n + 2), this is the n-simplex of Δ[1] which corresponds
to the monotone map Fin (n + 1) → Fin 2 which takes i times the value 0.
Equations
- One or more equations did not get rendered due to their size.
Instances For
theorem
SSet.stdSimplex.δ_objMk₁_of_le
{n : ℕ}
(i : Fin (n + 3))
(j : Fin (n + 2))
(h : i ≤ j.castSucc)
:
CategoryTheory.SimplicialObject.δ (stdSimplex.obj (SimplexCategory.mk 1)) j (objMk₁ i) = objMk₁ (i.castPred ⋯)
theorem
SSet.stdSimplex.δ_objMk₁_of_lt
{n : ℕ}
(i : Fin (n + 3))
(j : Fin (n + 2))
(h : j.castSucc < i)
:
CategoryTheory.SimplicialObject.δ (stdSimplex.obj (SimplexCategory.mk 1)) j (objMk₁ i) = objMk₁ (i.pred ⋯)
theorem
SSet.stdSimplex.σ_objMk₁_of_lt
{n : ℕ}
(i : Fin (n + 2))
(j : Fin (n + 1))
(h : j.castSucc < i)
:
CategoryTheory.SimplicialObject.σ (stdSimplex.obj (SimplexCategory.mk 1)) j (objMk₁ i) = objMk₁ i.succ