Lemma 1.7.12. For categories \(C\), \(D\) and \(E\), there is a preferred equivalence \[ \Fun(C,\Fun(D,E)) \iso \Fun(C \times D, E)\, . \]

Proof

We define the preferred functor as the curried functor of the following composite: \[ \Fun(C,\Fun(D,E)) \times C \times D \xrightarrow{\ev \times \id_{D}} \Fun(D,E) \times D \xrightarrow{\ev} E. \] To construct an inverse, it will by currying suffice to construct a functor \(\Fun(C \times D,E) \times C \to \Fun(D,E)\), which we may take to be the curried functor of the following composite \[ \Fun(C \times D,E) \times C \times D \xrightarrow{\ev} E. \] By construction, these two functors are compatible with the chain of equivalences \begin{align*} \Map(T,\Fun(C,\Fun(D,E))) &\simeq \Map(T\times C,\Fun(D,E))\\ &\simeq \Map((T\times C)\times D,E)\\ &\simeq \Map(T\times (C\times D),E)\\ &\simeq \Map(T,\Fun(C\times D,E))\, . \end{align*} This shows that applying \(\Map(T,-)\) to the preferred functor is an equivalence for all \(T\), hence that the preferred functor is an equivalence.

From Section 1.7, Functor categories.