\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}

%----Macros----------
%
% Unresolved issues:
%
%  \righttoleftarrow
%  \lefttorightarrow
%
%  \color{} with HTML colorspec
%  \bgcolor
%  \array with options (without options, it's equivalent to the matrix environment)

% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}

% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.

% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother

% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
  \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
  \else \append@sup#2 \@suptrue \fi%
  \expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
  \reset@sup\mk@scripts#3_/}
\makeatother

% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
  \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
  \copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother

% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
%   http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}

% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}

% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}

% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}

% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
    <-6>  MnSymbolE5
   <6-7>  MnSymbolE6
   <7-8>  MnSymbolE7
   <8-9>  MnSymbolE8
   <9-10> MnSymbolE9
  <10-12> MnSymbolE10
  <12->   MnSymbolE12}{}

% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
    \let#1=\undefined
    \DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother

% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
  \if\relax\noexpand#1%
    \let#1\undefined
  \fi
  \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother

% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
    \setbox\z@\hbox{\m@th$#1#2$}%
    \setbox\tw@\hbox{\m@th$#1%
       \widehat{%
          \vrule\@width\z@\@height\ht\z@
          \vrule\@height\z@\@width\wd\z@}$}%
    \dp\tw@-\ht\z@
    \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
    \setbox\tw@\hbox{%
       \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
    {\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother

% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter

% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother

%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}

%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}

% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}

%-------------------------------------------------------------------

\begin{document}

%-------------------------------------------------------------------


\section*{simplicial homotopy}

\hypertarget{context}{}\subsubsection*{{Context}}\label{context}

\hypertarget{model_category_theory}{}\paragraph*{{Model category theory}}\label{model_category_theory}

[[!include model category theory - contents]]

\hypertarget{homotopy_theory}{}\paragraph*{{Homotopy theory}}\label{homotopy_theory}

[[!include homotopy - contents]]

\hypertarget{contents}{}\section*{{Contents}}\label{contents}

\noindent\hyperlink{idea}{Idea}\dotfill \pageref*{idea} \linebreak
\noindent\hyperlink{definition_via_cylinders}{Definition via cylinders}\dotfill \pageref*{definition_via_cylinders} \linebreak
\noindent\hyperlink{combinatorial_definition}{Combinatorial definition}\dotfill \pageref*{combinatorial_definition} \linebreak
\noindent\hyperlink{remark__warning_on_conventions}{Remark / warning on conventions}\dotfill \pageref*{remark__warning_on_conventions} \linebreak
\noindent\hyperlink{commentary}{Commentary}\dotfill \pageref*{commentary} \linebreak
\noindent\hyperlink{properties}{Properties}\dotfill \pageref*{properties} \linebreak
\noindent\hyperlink{references}{References}\dotfill \pageref*{references} \linebreak


\hypertarget{idea}{}\subsection*{{Idea}}\label{idea}

A \textbf{simplicial homotopy} is a [[homotopy]] in the classical [[model structure on simplicial sets]]. It can also be defined combinatorially; in that form one can define a homotopy 2-cell between morphisms of simplicial objects in any category $C$.

\hypertarget{definition_via_cylinders}{}\subsection*{{Definition via cylinders}}\label{definition_via_cylinders}

[[SSet]] has a [[cylinder functor]] given by [[cartesian monoidal category|cartesian]] product with the standard 1-[[simplex]], $I := \Delta[1]$. (In fact, one can define simplicial cylinders, $\Delta[1]\odot X$, more generally, for example for $X$ being a simplicial object in an [[cocomplete category]] $C$,(see below).)

Therefore for $f,g : X \to Y$ two morphisms of [[simplicial set]]s, a [[homotopy]] $\eta : f \Rightarrow g$ is a morphism $\eta : X \times \Delta[1] \to Y$ such that the diagram

\begin{displaymath}
\itexarray{
    X \simeq X\times \Delta[0] &\stackrel{Id \times \delta^1}{\to}& X \times \Delta[1] 
   &
   \stackrel{Id \times \delta^0}{\leftarrow}&
   X \times \Delta[0]
   \simeq X
   \\
   &
    {}_f\searrow &\downarrow^\eta& \swarrow_{g}
   \\
   &&
   Y
  }
\end{displaymath}
commutes.

Remark: Since in the standard [[model structure on simplicial sets]] every simplicial set is cofibrant, this indeed defines left homotopies.

\hypertarget{combinatorial_definition}{}\subsection*{{Combinatorial definition}}\label{combinatorial_definition}

Given morphisms $f,g,:X\to Y$ of simplicial objects in any category $C$, a \textbf{simplicial homotopy} is a family of morphisms, $h_i:X_n\to Y_{n+1}$, $i= 0,\ldots,n$ of $C$, such that $d_0 h_0 = f_n$, $d_{n+1} h_n = g_n$ and

\begin{displaymath}
d_i h_j = \left\lbrace\itexarray{
h_{j-1}d_i, & i\lt j \\
d_i h_{i-1}, &i=j\neq 0\\
h_j d_{i-1}, & i\gt j+1.
}\right.
\end{displaymath}
\begin{displaymath}
s_i h_j = \left\lbrace\itexarray{
h_{j+1} s_i, & i\le j\\
h_j s_{i-1}, & i\gt j.
}\right.
\end{displaymath}
Note that we did not explicitly say what $d_i h_j$ should be when $i = j + 1$, but if we look at the rule for $d_{j + 1} h_{j + 1}$, we see this requires $d_{j + 1} h_{j + 1} = d_{j + 1} h_j$, which is the relevant compatibility condition.

\hypertarget{remark__warning_on_conventions}{}\subsection*{{Remark / warning on conventions}}\label{remark__warning_on_conventions}

The above formulae give one of the, at least, two forms of the combinatorial specfication of a homotopy between $f$ and $g$. (When trying to construct a specific homotopy using a combinatorial form, check which convention is being used!) The two forms correspond to different conventions such as saying that this is a homotopy from $g$ to $f$, or reversing the labelling of the $h_i$.

\hypertarget{commentary}{}\subsection*{{Commentary}}\label{commentary}

It is fairly easy to prove that the combinatorial definition of homotopy agrees with the one via the cylinder both for simplicial sets and for simplicial objects in any [[finitely cocomplete category]], $C$. This uses the fact that the category of simplicial objects in a cocomplete category, $C$, has [[copower|copowers]] with finite simplicial sets and hence in particular with $\Delta[1]$. (As there are explicit formulae for the construction of [[copower|copowers]] \ldots{})

[[Tim Porter|Tim]]: With only my own resources available, I was unable to find them so was hoping someone kind would come up with them. They derive from the coend formulae/Kan extension formulae using some combinatorics to discuss the indexing sets. I think Quillen gave some form of them, but have not got a copy of HA. I needed them recently and could not find them in any of the usual sources, and did not manage to work them out using the Kan extension idea either (Help please anyone). We could do with those formulae or with a reference to them at least.

In the case of the category of (not necessarily abelian) groups, the combinatorial definition equals the one via cylinder only if the role of ``cylinder'' for a group $G$ is played by a simplicial object in the category of groups which in degree $n$ equals the free product of $(n+2)$ copies of $G$, indexed by the set $\Delta[1]_n$ (noted by Swan and quoted in exercise 8.3.5 of Weibel: \emph{Homological algebra}).

[[Tim Porter]]: Perhaps we need an explicit description of [[copower|copowers]] in simplicial objects also. I pointed out in an edit above that the combinatorial description is much more general than just for simplicial objects in an abelian category.

Can specific references to Swan be given, anyone?

[[Zoran Škoda]]: I agree that one should talk about copowers etc.

Anonymous Coward: With exercise 8.3.5 of Weibel in mind, what is the notion of ``cylinder'' meant in the assertion ``the combinatorial definition of homotopy agrees with the one via the cylinder both for simplicial sets and for simplicial objects in any finitely cocomplete category'' for a general finitely cocomplete category?

[[Tim Porter]]: I have transferred this question to the \href{https://nforum.ncatlab.org/discussion/5627/simplicial-homotopy/#Comment_69108}{nForum} where it will be easier for others to reply. In the meantime some indication is given in Kamps and Porter as referenced below. I myself do not quite understand your question as it is presently stated, but this may be that I am too near to the subject matter to see the difficulty.

\hypertarget{properties}{}\subsection*{{Properties}}\label{properties}

\begin{ulemma}
Precisely when $Y$ is a [[Kan complex]], the relation

\begin{displaymath}
(f \sim g) \Leftrightarrow 
  (\exists simplicial homotopy f \Rightarrow g : X \to Y )
\end{displaymath}
is an [[equivalence relation]].

\end{ulemma}
\begin{proof}
Since [[Kan complex]]es are precisely the fibrant objects with respect to the standard [[model structure on simplicial sets]] this follows from general statements about [[homotopy]] in model categories.

The following is a direct proof.

We first show that the homotopy between points $x,y : \Delta[0] \to Y$ is an equivalence relation when $Y$ is a [[Kan complex]].

We identify in the following $x$ and $y$ with vertices in the image of these maps.

\begin{itemize}%
\item -\textbf{reflexivity}- For every vertex $x \in Y_0$, the degenerate 1-simplex $s_0 x \in S_1$ has, by the [[simplicial identities]], 0-faces $d_0 s_0 x = x$ and $d_1 s_0 x = x$.

\begin{displaymath}
(d_1 s_0 x) \stackrel{s_0 x}{\to} (d_0 s_0 x)
\end{displaymath}
Therefore the morphism $\eta : \Delta[0] \times \Delta[1] \to Y$ that takes the unique non-degenerate 1-simplex in $\Delta[1]$ to $s_0 x$ constitutes a homotopy from $x$ to itself.


\item -\textbf{transitivity}- let $v_2 : x \to y$ and $v_0 : y \to z$ in $Y_1$ be 1-cells. Together they determine a map from the [[horn]] $\Lambda^2_1$ to $Y$,

\begin{displaymath}
(v_2, v_2) : \Lambda^2_1 \to Y
  \,.
\end{displaymath}
By the [[Kan complex]] property there is an extension $\theta$ of this morphism through the 2-[[simplex]] $Delta^2$

\begin{displaymath}
\itexarray{
    \Lambda^2_1 &\stackrel{(v_0,v_2)}{\to}& Y
    \\
    \downarrow & \nearrow_{\theta}
    \\
    \Delta[2]
  }   
  \,.
\end{displaymath}
If we again identify $\theta$ with its image (the image of its unique non-degenerate 2-cell) in $Y_2$, then using the [[simplicial identities]] we find

\begin{displaymath}
\itexarray{
     && (d_0 d_2 \theta) = (d_1 d_0 \theta)
     \\
     & {}^{d_2 \theta }\nearrow &
     \Downarrow \theta & \searrow^{d_0 \theta}
     \\
     (d_1 d_2 \theta) = (d_1 d_1 \theta) && \stackrel{d_1 \theta}{\to}  &&
     (d_0 d_1 \theta)
     =
     (d_0 d_1 \theta)
  }
\end{displaymath}
that the 1-cell boundary bit $d_1 \theta$ in turn has 0-cell boundaries

\begin{displaymath}
d_0 d_1 \theta = d_0 d_0 \theta = z
\end{displaymath}
and

\begin{displaymath}
d_1 d_1 \theta = d_1 d_2 \theta = x
  \,.
\end{displaymath}
This means that $d_1 \theta$ is a homotopy $x \to z$.


\item -\textbf{symmetry}- In a similar manner, suppose that $v_2 : x \to y$ is a 1-cell in $Y_1$ that constitutes a homotopy from $x$ to $y$. Let $v_1 := s_0 x$ be the degenerate 1-cell on $x$. Since $d_1 v_1 = d_1 v_2$ together they define a map $\Lambda^2_0 \stackrel{v_1, v_2}{\to} Y$ which by the Kan property of $Y$ we may extend to a map $\theta'$

\begin{displaymath}
\itexarray{
  \Lambda^2_0 &\stackrel{v_1, v_2}{\to}& Y
  \\
  \downarrow & \nearrow_{\theta'}
  \\
  \Delta[2]
 }
\end{displaymath}
on the full 2-simplex.

Now the 1-cell boundary $d_0 \theta'$ has, using the [[simplicial identities]], 0-cell boundaries

\begin{displaymath}
d_0 d_0 \theta' = d_0 d_1 \theta' = x
\end{displaymath}
and

\begin{displaymath}
d_1 d_0 \theta' = d_0 d_2 \theta' = y
\end{displaymath}
and hence yields a homotopy $y \to x$. So being homotopic is a symmetric relation on vertices in a Kan complex.



\end{itemize}
Finally we use the fact that [[SSet]] is a [[cartesian closed category]] to deduce from this statements about vertices the corresponding statement for all map:

a morphism $f : X \to Y$ is the Hom-[[adjunct]] of a morphism $\bar f : \Delta[0] \to [X,Y]$, and a homotopy $\eta : X \times \Delta[1] \to Y$ is the [[adjunct]] of a morphism $\bar \eta : \Delta[1] \to [X,Y]$. Therefore homotopies $\eta : f \Rightarrow g$ are in bijection with homotopies $\bar \eta : \bar f \to \bar g$.

\end{proof}
\begin{uproposition}
Let $A$ be an abelian category and $f,g : X\to Y$ homotopic morphisms of simplicial objects in $A$. Then the induced maps $f_*, g_* : N(X)\to N(Y)$ of their normalized chain complexes are chain homotopic.

\end{uproposition}
\begin{uproposition}
Let $A$ be an abelian category. The morphisms of simplicial objects (variant: of unbounded chain complexes) in $A$, which are homotopic to zero, form an ideal. More precisely

\begin{itemize}%
\item being homotopic is an equivalence relation on the class of morphism,


\item $f_1\sim 0$ and $f_2\sim 0$ implies $f_1+f_2 \sim 0$,


\item if $f\circ h$ (resp. $h\circ f$) exists and if $f\sim 0$ then $f\circ h\sim 0$ (resp. $h\circ f\sim 0$).



\end{itemize}
\end{uproposition}
\hypertarget{references}{}\subsection*{{References}}\label{references}

\begin{itemize}%
\item Goerss, Jardine, \emph{Simplicial homotopy theory} (\href{http://dodo.pdmi.ras.ru/~topology/books/goerss-jardine.pdf}{pdf})

\end{itemize}
Cylinder based homotopy is also discussed extensively in

\begin{itemize}%
\item K. H. Kamps and T. Porter, \emph{Abstract Homotopy and Simple Homotopy Theory}, World Scientific Publishing Co. Inc., River Edge, NJ.

\end{itemize}


\end{document}