Corollary 20.2.9. Let \(C\) be a symmetric monoidal \(\infty \)-category with finite limits whose operadic stabilization \(\oSp (\Mm _C)\) is represented by a symmetric monoidal structure on \(\Sp (C)\). For every stably symmetric monoidal \(\infty \)-category \(D\), evaluation induces an equivalence \[ \Omega ^{\infty }\circ -\colon \Fun ^{\otimes \dlax ,\lex }(D,\Sp (C))\iso \Fun ^{\otimes \dlax ,\lex }(D,C), \] where \(\lex \) means that the underlying functor preserves finite limits.
Proof. Since \(\Mm _D\) is stable, Theorem 20.2.6 shows that postcomposition with the counit \(\Omega ^\infty \) induces an equivalence on groupoid cores. To include the monoidal natural transformations, we apply the same argument with \(\Fun (E,C)\) in place of \(C\), for any small \(\infty \)-category \(E\).
A spectrum object in \(\Fun (E,C)\) is an \(E\)-diagram of spectrum objects in \(C\), since reducedness and excisiveness are checked pointwise in \(E\). Under this identification, the pointwise tensor product on \(\Fun (E,\Sp (C))\) represents \(\oSp (\Mm _{\Fun (E,C)})\). Indeed, the Day formula of Theorem 19.6.3 computes the \(I\)-ary multimorphisms on the two sides by taking the ends over \(E\) and \((\An _*^{\fin })^I\) in opposite orders. Interchanging these ends respects substitution, since the operations compose pointwise in \(E\). Evaluation at \(S^0\) likewise applies \(\Omega ^\infty \) to each object of the diagram.
By Lemma 14.4.13, a lax symmetric monoidal functor \(D\to \Fun (E,C)\) is an \(E\)-diagram of lax symmetric monoidal functors \(D\to C\), and preservation of finite limits is again checked pointwise. Thus postcomposition with \(\Omega ^\infty \) induces an equivalence between the groupoid cores of the two categories of \(E\)-diagrams. As this holds for every \(E\), the result follows from the Yoneda lemma. For the case \(C=\An \), see also [Nikolaus (2016), Corollary 4.13]. □