English
Given a category C and a functor Φ: Fin(n+1) → Fin(m+1), precompose a ComposableArrows C m with Φ to obtain ComposableArrows C n.
Русский
Пусть Φ: Fin(n+1) → Fin(m+1) задаёт перестановку/индексацию; предпомещаем (whisker) к ComposableArrows C m.
LaTeX
$$$$ \\text{whiskerLeft}:\\ ComposableArrows C m \\to \\text{Functor}(Fin(n+1), Fin(m+1)) \\to \\text{ComposableArrows} C n \;.$$
Lean4
/-- The map `ComposableArrows C m → ComposableArrows C n` obtained by precomposition with
a functor `Fin (n + 1) ⥤ Fin (m + 1)`. -/
@[simps!]
def whiskerLeft (F : ComposableArrows C m) (Φ : Fin (n + 1) ⥤ Fin (m + 1)) : ComposableArrows C n :=
Φ ⋙ F