Proposition 19.1.6. If \((\Ll , \Rr )\) is a factorization system on \(C\), then \(\Ll = {}^\perp \Rr \) and \(\Rr = \Ll ^\perp \).
Proof. By symmetry, it suffices to prove \(\Rr =\Ll ^\perp \). The inclusion \(\Rr \subseteq \Ll ^\perp \) holds by definition. Given \(r\in \Ll ^\perp \), factor it as \(r'l\) with \(l\in \Ll \) and \(r'\in \Rr \). Since \(r\) and \(r'\) lie in \(\Ll ^\perp \), left cancellation gives \(l\in \Ll ^\perp \). Thus \(l\perp l\), so \(l\) is an isomorphism by Observation 19.1.2. As \(\Rr \) contains all isomorphisms and is closed under composition, we obtain \(r\in \Rr \). □