ScalingStacks

[05Z3]

Lemma 4.4.4. Let 𝒫\mathcal{P} be a reduced ∞\infty-operad and let 𝒞\mathcal{C} be a presentably symmetric monoidal ∞\infty-category. The free-forgetful adjunction

F:𝒞⇆Alg𝒫⁡(𝒞):UF\colon\mathcal{C}\leftrightarrows\operatorname{Alg}_{\mathcal{P}}\left(\mathcal{C}\right)\penalty\mskip 6.0mu plus 1.0mu\mathpunct{}\nonscript\mkern-3.0mu{:}\mskip 2.0muU

is monadic and the associated monad T=U∘FT=U\circ F preserves nn-connected morphisms.

[05Z4]

Proof. By A.4.7.3.11, the adjunction F⊣UF\dashv U is monadic. Hence, given a morphism A→BA\to B in 𝒞\mathcal{C}, by 2.4.6 the morphism T⁡(A)→T⁡(B)T\left(A\right)\to T\left(B\right) can be expressed as

∐n≥0(P⁡(n)⊗A⊗n)h​Σn→∐n≥0(P⁡(n)⊗B⊗n)h​Σn.\coprod_{n\geq 0}\left(P\left(n\right)\otimes A^{\otimes n}\right)_{h\Sigma_{n}}\to\coprod_{n\geq 0}\left(P\left(n\right)\otimes B^{\otimes n}\right)_{h\Sigma_{n}}.

By 4.4.2, nn-connected morphisms are closed under ⊗\otimes and, by T.5.2.8.6, they are closed under colimits. Hence, we obtain that T⁡(A)→T⁡(B)T\left(A\right)\to T\left(B\right) is nn-connected as well. ∎

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.

Tomer Schlank, Lior Yanovski

Original source: arXiv:1808.06006v3

Original source page 34

Original source · 1808.06006v3