Proposition 6.3.5. If a functor \(f\colon C \to D\) is fully faithful, then it reflects isomorphisms: if \(f(u)\) is invertible, then \(u\) is invertible.

Proof

Consider a morphism \(u\colon x \to y\) in \(C\) whose image \(f(u)\) in \(D\) is invertible. We will show that \(u\) admits a left inverse; the argument for the existence of a right inverse will be analogous. Since \(f(u)\) is invertible in \(D\), it admits a left inverse \(v\colon f(y) \to f(x)\), i.e. we have \(vf(u) = \id_{f(x)}\). Since \(f\) is fully faithful, there exists a morphism \(\tilde{v}\colon y \to x\) in \(C\) satisfying \(f(\tilde{v}) = v\). We claim that the relation \(\tilde{v}u = \id_x\) is satisfied. Since \(f\) is fully faithful, it suffices to show that \(f(\tilde{v}u) = f(\id_x)\). But since \(f\) preserves identities and compositions, this is equivalent to the relation \(f(\tilde{v})f(u) = vf(u) = \id_{f(x)}\), which holds by assumption.

From Section 6.3, The Fundamental Theorem of category theory.