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 { len := 1 }).obj (Opposite.op { len := 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
- SSet.stdSimplex.objMk₁ i = SSet.stdSimplex.objMk { toFun := fun (j : Fin ((Opposite.unop (Opposite.op { len := n })).len + 1)) => if j.castSucc < i then 0 else 1, monotone' := ⋯ }