Proposition 1.5.1. The construction \(C \mapsto C\catop \) is compatible with all constructions of \(\infty \)-categories:
- (1)
-
There are equivalences \(*\catop \simeq *\) and \(\emptyset \catop \simeq \emptyset \).
- (2)
-
For \(\infty \)-categories \(C\) and \(D\) there are equivalences \begin {align*} (C \times D)\catop &\simeq C\catop \times D\catop , \\ C\catop \sqcup D\catop &\simeq (C \sqcup D)\catop , \\ \Fun (C\catop ,D\catop ) &\simeq \Fun (C,D)\catop . \end {align*}
- (3)
-
For functors \(F\colon C \to E\) and \(G\colon D \to E\) there is an equivalence \[ (C \times _E D)\catop \simeq C\catop \times _{E\catop } D\catop . \]
- (4)
-
For an \(\infty \)-category \(C\) there is an equivalence \((C\catop )^{\simeq } \simeq (C^\simeq )\catop \).
Proof. All of these properties follow readily from the universal properties of these constructions. For illustration, let us merely sketch the proof that \((-)\catop \) preserves products: functors \(T \to (C\times D)\catop \) correspond to functors \(T\catop \to C \times D\), which in turn are pairs of functors \((T\catop \to C, T\catop \to D)\), which in turn translate back into pairs of functors \((T \to C\catop , T \to D\catop )\), i.e.Β functors \(T \to C\catop \times D\catop \). β‘