Proposition 1.4.11. For a functor \(f\colon C\to D\), the following are equivalent:
(i) The functor \(f\) is an equivalence.
(ii) For every category \(E\), the functor \(f_*\colon\Map(E,C)\to\Map(E,D)\) is an equivalence.
(iii) For every category \(E\), the functor \(f^*\colon\Map(D,E)\to\Map(C,E)\) is an equivalence.
If \(C\) and \(D\) are animae, it suffices in (ii) or (iii) to let \(E\) range over animae.
Proof
We prove (i) \(\Leftrightarrow\) (ii); the other case is dual. An inverse of \(f\) induces an inverse of every \(f_*\). Conversely, pick an inverse of \(f_*\colon\Map(D,C)\to\Map(D,D)\), and let \(g\colon D \to C\) be the evaluation of this inverse at \(\id_D\). The unit of the equivalence and the beta comparison for postcomposition give an identification \(f\circ g=\id_D\). Now, since \(f_*\colon\Map(C,C)\to\Map(C,D)\) is an equivalence, it induces an equivalence on animae of identifications. It follows that the chain of identifications \[ f \circ (g \circ f) = (f \circ g) \circ f = \id_D \circ f = f = f \circ \id_C \] lifts to an identification \(g\circ f=\id_C\). Here we use Construction 1.4.1 and the beta comparison to identify the action of \(f_*\) on functors with postcomposition by \(f\). If \(C\) and \(D\) are animae, both choices of \(E\) in this argument are animae, showing the final claim.