Theorem 20.2.10 (Additivization of \(\infty \)-operads, [Nikolaus (2016), Theorem 5.7]). Let \(\Oo \) be an \(\infty \)-operad with an operadic terminal object, and assume finite operadic products for the monoid and group constructions. The \(\infty \)-categories of pointed objects, commutative monoids, and commutative groups in \(U(\Oo )\) admit natural operad structures \(\Oo _*\), \(\oCMon (\Oo )\), and \(\oCGrp (\Oo )\), respectively. The resulting functors \[ (-)_*\colon \Op _{\infty }^* \to \Op _{\infty }^{\pt }, \qquad \oCMon \colon \Op _{\infty }^{\mathrm {prod}} \to \Op _{\infty }^{\sadd } \qquadtext { and } \oCGrp \colon \Op _{\infty }^{\mathrm {prod}} \to \Op _{\infty }^{\add } \] are right adjoint to the respective inclusion functors.

Proof of Theorem 20.2.10. We first prove the pointed case. Put \(E:=\Env (\Oo )\). The multiplicative Yoneda embedding and Lemma 19.6.1 give a fully faithful map \[ \Oo _* \hookrightarrow (\Mm _{\PSh (E)})_*. \] By Lemma 20.4.2, the target is the multimorphism operad of the pointed presheaf category and is therefore pointed by Example 20.1.8. The suboperad \(\Oo _*\) contains its zero object, since the multiplicative Yoneda embedding preserves the operadic terminal object of \(\Oo \). It follows from Lemma 20.1.9(1) that \(\Oo _*\) is pointed.

Evaluation at the target gives a natural operad map \(\Oo _*\to \Oo \). If \(\Oo \) is pointed, this map is an equivalence by Lemma 20.4.3. Applying the pointed-object construction a second time gives the same conclusion because \(\Oo _*\) is pointed. Interchanging the two coordinates of \([1]\times [1]\) exchanges the two ways of evaluating a doubly pointed object at \(1\), so both whiskerings of the evaluation transformation are equivalences. The dual of Proposition 22.7.9, applied in \((\Op _{\infty }^*)\catop \), therefore identifies \((-)_*\) as right adjoint to the inclusion of pointed \(\infty \)-operads.

For commutative monoids and groups, apply the same embedding into \(\Mm _{\PSh (E)}\). Proposition 16.4.1 constructs their Day convolution monoidal structures in \(\PSh (E)\). Their underlying categories are semiadditive and additive by Proposition 5.3.20, and their tensor products preserve colimits separately in both variables. Hence their finite biproducts are operadic. These biproducts are computed pointwise. Since the multiplicative Yoneda image is closed under finite products, the full suboperads consisting of objects valued in that image are closed under these biproducts. They are \(\oCMon (\Oo )\) and \(\oCGrp (\Oo )\), so Lemma 20.1.9(2) shows that the former is semiadditive and the latter additive.

Suppose now that \(\Oo \) is semiadditive. Evaluation at \(1\) gives an equivalence on underlying categories by Proposition 5.3.17. By Theorem 19.6.3, its map on multimorphism animae is the projection \[ \int _{\{K_i\}\in \Span (\Fin )^I} \Oo (\{F_i(K_i)\}_{i\in I};G(\prod _{i\in I}K_i)) \longrightarrow \Oo (\{F_i(1)\}_{i\in I};G(1)). \] We apply Lemma 20.4.4 one variable at a time, as in the proof of Proposition 20.2.5. Each \(F_i\) preserves finite coproducts: a finite-product-preserving functor between semiadditive \(\infty \)-categories preserves zero morphisms and hence the biproduct injections. Since these coproducts in \(\Oo \) are operadic, the contravariant variable sends them to products. For the covariant variable, \((-)\times R\) preserves disjoint unions in \(\Span (\Fin )\) for every finite set \(R\), hence preserves its finite products. Applying \(G\) and using operadic products gives the other hypothesis of the lemma. Taking ends preserves these products. The same arguments allow additional fixed inputs, so induction identifies the displayed projection with an equivalence. For \(I=\emptyset \), it is already the identity of \(\Oo (;G(1))\). Thus \(\oCMon (\Oo )\to \Oo \) is an equivalence of \(\infty \)-operads.

If \(\Oo \) is additive, every commutative monoid in \(U(\Oo )\) is grouplike by Proposition 5.3.17, so the same conclusion holds for \(\oCGrp (\Oo )\to \Oo \).

Finally, postcomposition with maps preserving finite operadic products preserves commutative monoids and groups, and their finite products are computed pointwise. Thus both constructions and their evaluation maps belong to \(\Op _\infty ^{\mathrm {prod}}\). Applying either construction twice gives functors on \(\Span (\Fin )\times \Span (\Fin )\) satisfying the respective monoid or group conditions in each variable. Interchanging the variables exchanges the two evaluation maps. Since the once-constructed \(\infty \)-operads are semiadditive or additive, the preceding paragraph shows that both whiskerings of evaluation are equivalences. The dual of Proposition 22.7.9 therefore gives the two remaining right adjoints. □