Lemma 2.1.12. The maps \(\max\) and \(\min\) satisfy the identifications \begin{align*} \max(x,0) &= x = \max(0,x), & \max(x,1) &= 1 = \max(1,x), \\ \min(x,0) &= 0 = \min(0,x), & \min(x,1) &= x = \min(1,x), \end{align*} in the sense that the following diagrams commute: Commutative diagram; see the PDF for its LaTeX source Commutative diagram; see the PDF for its LaTeX source

Proof

The identifications \(\min(x,0) = 0\), \(\min(x,1) = x\), \(\max(x,0) = x\) and \(\max(x,1) = 1\) are immediate from the two pullback squares stated before the lemma. For the other four relations we use that \(q_0^{-1}\colon [1] \iso [1]_{0/}\) sends \(0\) to \(\id_0\colon 0 \to 0\) and \(1\) to \(\can\colon 0 \to 1\), while \(p_1^{-1}\colon [1] \iso [1]_{/1}\) sends \(0\) to \(\can\colon 0 \to 1\) and \(1\) to \(\id_1\colon 1 \to 1\).

From Section 2.1, Morphisms and diagrams.