Lemma 14.33.6. Let $\mathcal{C}$, $Y$, $d$, $s$ be as in Example 14.33.1 satisfying the equations of Lemma 14.33.2. Let $f : \text{id}_\mathcal {C} \to \text{id}_\mathcal {C}$ be an endomorphism of the identity functor. Then $f \star 1_ X, 1_ X \star f : X \to X$ are maps of simplicial objects compatible with $f$ via the augmentation $\epsilon : X \to \text{id}_\mathcal {C}$. Moreover, $f \star 1_ X$ and $1_ X \star f$ are homotopic.
Proof. The map $f \star 1_ X$ is the map with components
For a transformation $a : F \to G$ of endofunctors of $\mathcal{C}$ we have $a \circ (f \star 1_ F) = f \star a = (f \star 1_ G) \circ a$. Thus $f \star 1_ X$ is indeed a morphism of simplicial objects. Similarly for $1_ X \star f$.
To show the morphisms are homotopic we construct morphisms $h_{n, i} : X_ n \to X_ n$ for $n \geq 0$ and $0 \leq i \leq n + 1$ satisfying the relations described in Lemma 14.26.2. See also Remark 14.26.4. It turns out we can take
where $1_ i$ is the identity transformation on $Y \circ \ldots \circ Y$ as in the proof of Lemma 14.33.2. We have $h_{n, 0} = f \star 1_{X_ n}$ and $h_{n, n + 1} = 1_{X_ n} \star f$ which checks the first condition. In checking the other conditions we use the comments made in the proof of Lemma 14.33.5 about the maps $d^ n_ j$ and $s^ n_ j$.
We check condition (2) of Lemma 14.26.2. Let $i > j$. We have to show
Since $i - 1 \geq j$ we can use one of the possible descriptions of $d^ n_ j$ to rewrite the left hand side as
Similarly the right hand side becomes
Thus we obtain the same result and (2) is checked.
The conditions (3), (4), and (5) of Lemma 14.26.2 are checked in exactly the same manner using the strategy of the proof of Lemma 14.33.5. We omit the details1. $\square$
Post a comment
Your email address will not be published. Required fields are marked.
In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$
). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).
All contributions are licensed under the GNU Free Documentation License.
Comments (0)