Lemma 1.3.9. Assume that \(f\colon C \to D\) is a retract of \(f'\colon C' \to D'\). If \(f'\) is an equivalence, then so is \(f\).

Proof

Let \((f')^{-1}\colon D' \to C'\) be an inverse of \(f'\). We claim that the composite \(w := h \circ (f')^{-1} \circ k\colon D \to C\) is inverse to \(f\). Indeed, we have identifications \[ f \circ w = f \circ h \circ (f')^{-1} \circ k = j \circ f' \circ (f')^{-1} \circ k = j \circ k = \id_{D} \] and \[ w \circ f = h \circ (f')^{-1} \circ k \circ f = h \circ (f')^{-1} \circ f' \circ g = h \circ g = \id_{C}. \] This finishes the proof.

From Section 1.3, Equivalences of categories.