Let \(C\) be a symmetric monoidal \(\infty \)-category and \(\Oo \) an \(\infty \)-operad. We construct a Day convolution operad whose underlying \(\infty \)-category is \(\Fun (C,U(\Oo ))\), as in Lemma 16.1.3. To do so, we embed \(\Oo \) into the multimorphism operad of its envelope and restrict Day convolution to the \(\Oo \)-valued functors. We then describe its multimorphisms as coherently natural families of operations in \(\Oo \).
Lemma 19.6.1. Let \(\Oo \subseteq \Qq \) be a full suboperad, let \(C\) be a symmetric monoidal \(\infty \)-category, and assume that \(\oDay (\Mm _C,\Qq )\) exists. Then \(\oDay (\Mm _C,\Oo )\) is the full suboperad of \(\oDay (\Mm _C,\Qq )\) spanned by the functors \(C\to U(\Qq )\) valued in \(U(\Oo )\).
Proof. The total category of a full suboperad is the full subcategory on tuples of its colors (Construction 14.1.7). Thus maps into a full suboperad form a full subcategory of the operad functor category, consisting of those maps whose colors lie in that suboperad.
For every \(\infty \)-operad \(\Rr \), the equivalence \[ \Fun _{\Op _{\infty }}(\Rr ,\oDay (\Mm _C,\Qq )) \simeq \Fun _{\Op _{\infty }}(\Rr \times \Mm _C,\Qq ) \] restricts to the full subcategories where, respectively, all color functors are \(\Oo \)-valued and all colors lie in \(\Oo \). These conditions correspond because evaluation sends \((F,c)\) to \(F(c)\). The restricted evaluation map therefore gives the stated full suboperad the universal property of \(\oDay (\Mm _C,\Oo )\). β‘
Theorem 19.6.2. Let \(C\) be a symmetric monoidal \(\infty \)-category. For every \(\infty \)-operad \(\Oo \), the Day convolution operad \(\oDay (\Mm _C,\Oo )\) exists.
Proof. Put \(E := \Env (\Oo )\). By Lemma 19.3.14, the unit identifies \(\Oo \) with the full suboperad of \(\Mm _E\) on singleton tuples. Since \(\oDay (\Mm _C,\Mm _E)\) exists by Theorem 16.1.8, the result follows from Lemma 19.6.1. β‘
Theorem 19.6.3 (Multimorphism formula for Day convolution). Let \(C\) be a small symmetric monoidal \(\infty \)-category and let \(\Oo \) be an \(\infty \)-operad. For every finite set \(I\) and functors \(F_i,G\colon C \to U(\Oo )\), there is a natural equivalence \[ \oDay (\Mm _C,\Oo )(\{F_i\}_{i \in I};G) \simeq \int _{\{c_i\}_{i \in I}\in C^I} \Oo (\{F_i(c_i)\}_{i \in I};G(\bigotimes \nolimits ^I_C c_i)). \] Here the end is taken over the bifunctor on \((C^I)\catop \times C^I\) sending \((\{c_i\},\{d_i\})\) to \(\Oo (\{F_i(c_i)\};G(\bigotimes _i d_i))\).
Proof. Put \(E:=\Env (\Oo )\). By Lemma 19.6.1, we may compute the multimorphism anima in \(\oDay (\Mm _C,\Mm _E)\). The Day convolution formula of Proposition 16.1.10 and the end formula for natural transformations (Proposition 24.6.6) give \begin {align*} \oDay (\Mm _C,\Oo )(\{F_i\}_{i\in I};G) &\simeq \Nat \left (\bigotimes \nolimits _E^I\circ \prod _{i\in I}F_i,G\circ \bigotimes \nolimits _C^I\right )\\ &\simeq \int _{\{c_i\}\in C^I} \Hom _E\left (\bigotimes _{i\in I}F_i(c_i),G(\bigotimes _{i\in I}c_i)\right ). \end {align*}
By Lemma 19.3.14, the integrand is naturally isomorphic to \(\Oo (\{F_i(c_i)\}_{i\in I};G(\bigotimes _{i\in I}c_i))\), as required. β‘
Thus a multimorphism is a coherently natural family of operations \(\{F_i(c_i)\}_{i\in I}\to G(\bigotimes _i c_i)\). Substitution evaluates the outer family on the tensor products of the objects in each inner family and composes the resulting operations in \(\Oo \), as in the ambient Day convolution operad. For \(I=\emptyset \), the formula gives \(\Oo (;G(\unit _C))\).
Evaluation at the monoidal unit defines a morphism of \(\infty \)-operads \[ \ev _{\unit _C}\colon \oDay (\Mm _C,\Oo )\longrightarrow \Oo ,\qquad F\longmapsto F(\unit _C). \] On multimorphisms, it evaluates a natural family at \(c_i=\unit _C\) for every \(i\in I\), using \(\bigotimes _{i\in I}\unit _C\simeq \unit _C\). Its map on multimorphism animae is therefore the projection from the end to this tuple. Indeed, the symmetric monoidal functor \(*\to C\) selecting \(\unit _C\) induces \(\Comm \to \Mm _C\). Precomposition then gives the required map by Remark 16.1.2, since \(\oDay (\Comm ,\Oo )\simeq \Oo \).
Remark 19.6.4. If \(f\colon \Oo '\to \Pp \) is a cocartesian fibration of \(\infty \)-operads, then the product functor \(\Oo '\times _{\Pp }-\colon (\Op _{\infty })_{/\Pp }\to (\Op _{\infty })_{/\Pp }\) admits a right adjoint \[ \oDay _{/\Pp }(\Oo ',-)\colon (\Op _{\infty })_{/\Pp }\to (\Op _{\infty })_{/\Pp }, \] by Lurie (2017), Theorem 2.2.6.2 and Construction 2.2.6.7. For \(\Pp =\Comm \) and \(\Oo '=\Mm _C\), this specializes to Theorem 19.6.2.
Exercises
Exercise 19.1 (Basic factorization systems).
- (1)
-
Let \(C\) be an \(\infty \)-category. Show that the pairs \((C,C^{\simeq })\) and \((C^{\simeq },C)\) are factorization systems on \(C\).
- (2)
-
In \(\An \), show that the essentially surjective morphisms and the monomorphisms form a factorization system.
- (3)
-
In \(\Cat _{\infty }\), show that the essentially surjective functors and the fully faithful functors form a factorization system.
Exercise 19.2 (Free cocartesian lifts and Yoneda). Let \(c\) be an object of an \(\infty \)-category \(C\). Identify the free cocartesian completion of \(c\colon *\to C\) from Construction 19.2.2, with \(\Rr =C\), with \(C_{c/}\to C\). Deduce that, for every cocartesian fibration \(D\to C\), evaluation at \(\id _c\) induces an equivalence \[ \ev _{\id _c}\colon \Fun _{/C}^{\cocart }(C_{c/},D)\iso D_c, \] and describe its inverse.
Exercise 19.3. Show that initial functors and left fibrations form a factorization system on \(\Cat _{\infty }\). Deduce the dual factorization system consisting of final functors and right fibrations. Hint: In the first case, obtain a factorization by freely adjoining cocartesian lifts and geometrically realizing the fibers, and use the description of limits as sections to prove orthogonality.
Exercise 19.4 (The envelope of a trivial operad). Let \(C\) be an \(\infty \)-category and consider its trivial operad \(\Triv _C\). Show that objects of \(\Env (\Triv _C)\) are finite tuples of objects of \(C\), with hom animae \[ \Hom _{\Env (\Triv _C)}(\{x_i\}_{i\in I},\{y_j\}_{j\in J}) \simeq \coprod _{\sigma \colon I\iso J}\prod _{i\in I}\Hom _C(x_i,y_{\sigma (i)}). \] Deduce that \(\Env (\Triv _C)\) is the free symmetric monoidal \(\infty \)-category generated by \(C\): restriction to singleton tuples induces an equivalence \(\Fun ^{\otimes }(\Env (\Triv _C),D)\simeq \Fun (C,D)\) for every symmetric monoidal \(\infty \)-category \(D\).
Exercise 19.5 (The envelope of \(\Ee _0\)). Identify the morphisms in \(\Env (\Ee _0)\) with injections between the indexing sets and construct a symmetric monoidal equivalence \[ \Env (\Ee _0)\simeq (\Fin _{\inj },\amalg ). \] Deduce that \((\Fin _{\inj },\amalg )\) is the free symmetric monoidal \(\infty \)-category generated by an object equipped with a map from the unit.
Exercise 19.6 (Day convolution on arrows). Equip \([1]\) with the symmetric monoidal structure given by the maximum. Let \(\Oo \) be an \(\infty \)-operad, let \(I\) be a finite set, and let \(F_i=(x_i\to y_i)\) and \(G=(z\to w)\) be arrows in \(U(\Oo )\). Show that \[ \oDay (\Mm _{([1],\max )},\Oo )(\{F_i\}_{i\in I};G) \simeq \Oo (\{x_i\}_{i\in I};z) \times _{\Oo (\{x_i\}_{i\in I};w)}\Oo (\{y_i\}_{i\in I};w), \] where the maps to the middle anima are postcomposition with \(z\to w\) and precomposition with the \(x_i\to y_i\). For \(\Oo =\Mm _D\), deduce that this Day convolution operad is the multimorphism operad of \(\Ar (D)\) with its pointwise monoidal structure. No colimit hypotheses on \(D\) are needed.