Lemma 1.3.3. A functor \(f\colon C \to D\) is an equivalence if and only if it admits both a section \(s\) and a retraction \(r\). In this case there exists an identification \(s = r\) and \(s\) is an inverse of \(f\).
Proof
If \(f\) is an equivalence with inverse \(g\colon D \to C\), then clearly \(g\) is both a section and a retraction of \(f\). Conversely, given a section \(s\colon D \to C\), \(fs = \id_D\) and a retraction \(r\colon D \to C\), \(\id_C = rf\), we obtain an identification \(s = r\) by composing the following chain of identifications: \[ s = \id_C \circ s = (r \circ f) \circ s = r \circ (f \circ s) = r \circ \id_D = r. \] It follows that \(f\) is an equivalence with inverse \(s\), since there are identifications \(fs = \id_{D}\) and \(sf = rf = \id_{C}\).