Proposition 21.1.1 (Tensor-stable monoidal localization). Let \(C\) be a symmetric monoidal \(\infty \)-category, and let \(W\) be a class of morphisms in \(C\) such that, for every object \(X\in C\), the functor \(X\otimes -\) sends morphisms in \(W\) to morphisms in \(W\).

(1)

The localization \(C[W^{-1}]\) inherits a unique symmetric monoidal structure turning the localization functor \(\gamma \colon C \to C[W^{-1}]\) into a symmetric monoidal functor.

(2)

For any other symmetric monoidal \(\infty \)-category \(D\), restriction along \(\gamma \) induces a fully faithful functor \[ \Fun ^{\otimes }(C[W^{-1}],D) \hookrightarrow \Fun ^{\otimes }(C,D) \] whose essential image consists of those symmetric monoidal functors \(C \to D\) which invert the morphisms in \(W\).

Proof. We may replace \(W\) by the wide subcategory it generates. This leaves the localization unchanged, and tensoring with any object still preserves \(W\). Let \(\RelCat _\infty \subseteq \Ar (\Cat _\infty )\) be the full subcategory of relative \(\infty \)-categories, that is, inclusions of wide subcategories \(W\hookrightarrow C\). By the universal property of localization, the functor \((C,W)\mapsto C[W^{-1}]\) is left adjoint to \(D\mapsto (D,D^\simeq )\).

Both functors preserve finite products (Exercise 1.5.24), so this adjunction induces an adjunction on commutative monoids. Tensoring one variable at a time shows that the tensor product carries pairs of morphisms in \(W\) to morphisms in \(W\). Thus \((C,W)\) is a commutative monoid in \(\RelCat _\infty \). Applying the left adjoint gives a symmetric monoidal structure on \(C[W^{-1}]\), and the adjunction unit gives the symmetric monoidal functor \(\gamma \).

The adjunction identifies the anima of symmetric monoidal functors \(C[W^{-1}]\to D\) with the subanima of symmetric monoidal functors \(C\to D\) inverting \(W\). Apply this also to \(\Fun ([n],D)\) with its pointwise tensor product. A functor \(C\to \Fun ([n],D)\) inverts \(W\) precisely when its evaluation at every vertex does. We thus obtain the same identification on \([n]\)-diagrams for every \(n\), proving (2) at the level of functor categories (Definition 14.4.3). The universal property gives uniqueness in (1). □