Proposition 1.3.23 (Internal universal properties). Let \(T\) be an \(\infty \)-category and let \(\{C_i\}_{i \in I}\) be a set-indexed collection of \(\infty \)-categories. The canonical functors below are equivalences: \begin {align*} \Fun (T,*) &\iso *, & \Fun (\emptyset ,T) &\iso *, & \Fun (*,T) &\iso T, \\ \Fun \left (T,\prod _{i \in I}C_i\right ) &\iso \prod _{i \in I}\Fun (T,C_i), &&& \Fun \left (\bigsqcup _{i \in I}C_i,T\right ) &\iso \prod _{i \in I}\Fun (C_i,T). \end {align*}

Moreover, for functors \(f\colon C \to E\) and \(g\colon D \to E\) there is an equivalence \[ \Fun (T,C \times _E D) \iso \Fun (T,C) \times _{\Fun (T,E)} \Fun (T,D), \] and for \(\infty \)-categories \(C\) and \(D\) there is an equivalence \[ \Fun (T,\Fun (C,D)) \iso \Fun (T \times C,D). \]

Proof sketch.

These properties are developed in Section 1.7.1 of [Cisinski et al. (2026)]; the proof for binary (co)products treated there adapts to one for arbitrary (co)products.

The functor \(\Fun (*,T) \to T\) is the evaluation map. In each other case, the displayed functor is constructed using the universal property of its target. For the inverse, we may map into the relevant functor category by first uncurrying and then using the universal property of the target. In the coproduct case, we use universality of coproducts to distribute the product with the parameter \(\infty \)-category over \(\bigsqcup _iC_i\). In the pullback case, we must show that the projection identifications agree over the base; this may be done after uncurrying, where the equivalence of identification animae in Axiom C.5 allows us to use the pullback constructor. โ–ก