By linearity it suffices to evaluate both sides on a generator
\(\sigma\colon\Delta^n\to X\text{.}\) Let
\(H:=h\circ(\sigma\times\mathrm{id})\colon\Delta^n\times[0,1]\to Y\text{.}\) We compute
\(\partial_{n+1}P_n(\sigma)\) using the definition of the boundary on each
\(\tau_i\text{.}\) The face of
\(\tau_i\) obtained by omitting the vertex with label
\(j\) falls into one of three classes:
(a) The faces
internal to the prism (omitting
\(v_i^-\) from
\(\tau_i\) yields the same face as omitting
\(v_i^+\) from
\(\tau_{i-1}\text{,}\) with opposite sign). All such internal faces cancel pairwise.
(b) The
top face (omitting all "minus" vertices from
\(\tau_n\text{,}\) i.e.,
\(j=0\) in
\(\tau_n\)) gives
\(g\circ\sigma\text{.}\)
(c) The
bottom face (omitting all "plus" vertices from
\(\tau_0\text{,}\) i.e.,
\(j=n+1\) in
\(\tau_0\)) gives
\(-(-1)^0 f\circ\sigma\cdot(-1)^{n+1}\cdot(-1)^{n+1} = -f\circ\sigma\text{;}\) tracking the alternating signs carefully yields exactly
\(-f_\sharp\sigma\text{.}\)
(d) The
side faces (omitting
\(v_j^-\) with
\(j<i\text{,}\) or
\(v_j^+\) with
\(j>i\)) reassemble to
\(-P_{n-1}(\partial_n\sigma)\text{.}\) Indeed, the faces involving
\(\sigma\circ d_j\) are precisely the prism over the
\(j\)-th face of
\(\sigma\text{,}\) with the correct signs.
Combining (a)–(d) gives
\(\partial_{n+1}P_n(\sigma) = g_\sharp\sigma - f_\sharp\sigma - P_{n-1}(\partial_n\sigma)\text{,}\) which is the desired identity. The detailed sign verification, while tedious, reduces to the simplicial identities for the face maps
\(d_i\text{;}\) see Hatcher, Theorem 2.10 for a fully explicit accounting.