Proposition 19.1.10 (The factorization system on a span category, [Haugseng et al. (2023b), Proposition 4.9]). Let \(\Cc = (C, C_L, C_R)\) be an adequate triple. The pair \((\Ll , \Rr ) = (C_L\catop , C_R)\) forms a factorization system on \(\Span (\Cc )\).
Proof. Any span \(X \xleftarrow {l} U \xrightarrow {r} Y\) can be factored as a backwards map followed by a forwards map: \[ X \xleftarrow {l} U \xrightarrow {\mathrm {id}_U} U \qquad \text {followed by} \qquad U \xleftarrow {\mathrm {id}_U} U \xrightarrow {r} Y. \] For orthogonality, let \(l\colon A\to B\) lie in \(C_L\) and \(r\colon X\to Y\) lie in \(C_R\). Precomposition with the backwards map associated to \(l\) and postcomposition with the forwards map associated to \(r\) give the square
which we must show is a pullback. By Lemma 13.1.13, it identifies with
This is the fiber product, over the constant square \(C^{\simeq }\), of a square with identity horizontal maps and a square with identity vertical maps. Both are pullback squares, so their fiber product is a pullback square as well. □