Lemma 1.3.16 (Pairing and precomposition). Let \(f\colon T\to C\), \(g\colon T\to D\), and \(\sigma\colon S\to T\) be functors. Pairing commutes with precomposition: there is an identification \[ (f,g)\circ\sigma=(f\circ\sigma,g\circ\sigma). \] This comparison is compatible with identifications of the input functors, with successive precomposition, and with precomposition by an identity functor, using the associativity and unitality identifications.

Proof

After composition with \(\pr_1\) and \(\pr_2\), both sides identify with \(f\circ\sigma\) and \(g\circ\sigma\), respectively. The product axiom therefore supplies the comparison, with these prescribed projections. Its compatibilities can likewise be checked after applying both projections, where they reduce to the coherence laws for composition and identifications. For compatibility with identity functors, one also uses \begin{equation} \rho_{ab}=(a\star\rho_b)\circ\alpha_{\id,b,a} \tag{1.1}\end{equation} for composable functors \(b,a\). This follows by prewhiskering with the identity, applying the pentagon for \(a,b,\id,\id\) and the triangle identities, and cancelling by Lemma 1.3.10. We leave the remaining checks to the reader.

From Section 1.3, Equivalences of categories.