[step:Verify that $\rho$ is a chain map]
We must check that $d_n \circ \rho_n = \rho_{n-1} \circ d_n$. On a generator $\sigma: \Delta^n \to X$, the $i$-th face of the reversed simplex $\sigma|_{[v_n,\ldots,v_0]}$ omits the $i$-th vertex of the reversed list, which is $v_{n-i}$. Therefore
\begin{align*}
d_n\bigl(\sigma|_{[v_n, \ldots, v_0]}\bigr) = \sum_{i=0}^{n} (-1)^i \sigma|_{[v_n, \ldots, \hat{v}_{n-i}, \ldots, v_0]}.
\end{align*}
Re-indexing with $j = n - i$:
\begin{align*}
d_n\bigl(\sigma|_{[v_n, \ldots, v_0]}\bigr) = \sum_{j=0}^{n} (-1)^{n-j} \sigma|_{[v_n, \ldots, \hat{v}_j, \ldots, v_0]}.
\end{align*}
Each term $\sigma|_{[v_n,\ldots,\hat{v}_j,\ldots,v_0]}$ is the reversal of the $j$-th face $\sigma|_{[v_0,\ldots,\hat{v}_j,\ldots,v_n]}$, which has $n-1$ vertices. Therefore
\begin{align*}
d_n(\varepsilon_n \sigma|_{[v_n,\ldots,v_0]}) &= \varepsilon_n \sum_{j=0}^{n} (-1)^{n-j} \sigma|_{[v_n,\ldots,\hat{v}_j,\ldots,v_0]}.
\end{align*}
On the other hand,
\begin{align*}
\rho_{n-1}(d_n(\sigma)) &= \sum_{j=0}^{n} (-1)^j \rho_{n-1}(\sigma|_{[v_0,\ldots,\hat{v}_j,\ldots,v_n]}) = \sum_{j=0}^{n} (-1)^j \varepsilon_{n-1} \sigma|_{[v_n,\ldots,\hat{v}_j,\ldots,v_0]}.
\end{align*}
For these to be equal, we need $\varepsilon_n (-1)^{n-j} = \varepsilon_{n-1} (-1)^j$ for each $j$. This is equivalent to $\varepsilon_n (-1)^n = \varepsilon_{n-1}$, i.e., $(-1)^{n(n+1)/2} \cdot (-1)^n = (-1)^{(n-1)n/2}$. Since $n(n+1)/2 + n = n(n+1)/2 + 2n/2 = n(n+3)/2$ and $(n-1)n/2 = (n^2-n)/2$, we verify: $n(n+3)/2 - (n^2-n)/2 = (n^2+3n-n^2+n)/2 = 2n$, which is even. So $(-1)^{n(n+3)/2} = (-1)^{(n^2-n)/2}$, confirming the identity. Therefore $\rho$ is a chain map.
[/step]