ScalingStacks

0NLZ

Proof. The fully faithful inclusions π’œβŠ‚Indκ⁑(π’œ){\mathcal{A}}\subset\Ind_{\kappa}({\mathcal{A}}) and β„¬βŠ‚Indκ⁑(ℬ){\mathcal{B}}\subset\Ind_{\kappa}({\mathcal{B}}) show that π’œβ†’β„¬{\mathcal{A}}\mathchoice{\longrightarrow}{\rightarrow}{\rightarrow}{\rightarrow}{\mathcal{B}} is fully faithful if and only if Indκ⁑(π’œ)β†’Indκ⁑(ℬ)\Ind_{\kappa}({\mathcal{A}})\mathchoice{\longrightarrow}{\rightarrow}{\rightarrow}{\rightarrow}\Ind_{\kappa}({\mathcal{B}}) is fully faithful (for the reverse direction, this follows from the definition of the mapping spaces in Indκ⁑(βˆ’)\Ind_{\kappa}(-)). Thus it remains to check that ℬ/π’œβ†’π’ž{\mathcal{B}}/{\mathcal{A}}\mathchoice{\longrightarrow}{\rightarrow}{\rightarrow}{\rightarrow}{\mathcal{C}} is an equivalence upon idempotent completion if and only if Indκ⁑(ℬ)/Indκ⁑(π’œ)≃Indκ⁑(ℬ/π’œ)\Ind_{\kappa}({\mathcal{B}})/\Ind_{\kappa}({\mathcal{A}})\simeq\Ind_{\kappa}({\mathcal{B}}/{\mathcal{A}}). Since IndΞΊ\Ind_{\kappa} preserves cofibers, it is enough to check that the equivalence Indκ⁑(ℬ)/Indκ⁑(π’œ)≃Indκ⁑(ℬ/π’œ)\Ind_{\kappa}({\mathcal{B}})/\Ind_{\kappa}({\mathcal{A}})\simeq\Ind_{\kappa}({\mathcal{B}}/{\mathcal{A}}) implies the equivalence ℬ/π’œβ‰ƒπ’ž{\mathcal{B}}/{\mathcal{A}}\simeq{\mathcal{C}} whenever the latter are idempotent complete. Thus, given a ΞΊ\kappa-cocomplete small stable ∞\infty-category π’Ÿ{\mathcal{D}} (which we assume is idempotent complete if ΞΊ=Ο‰\kappa=\omega), we must show that

Funex⁑(ΞΊ)​(π’ž,π’Ÿ)⟢Funex⁑(ΞΊ)​(ℬ,π’Ÿ)⟢Funex⁑(ΞΊ)​(π’œ,π’Ÿ)\mathrm{Fun}^{\ex(\kappa)}({\mathcal{C}},{\mathcal{D}})\mathchoice{\longrightarrow}{\rightarrow}{\rightarrow}{\rightarrow}\mathrm{Fun}^{\ex(\kappa)}({\mathcal{B}},{\mathcal{D}})\mathchoice{\longrightarrow}{\rightarrow}{\rightarrow}{\rightarrow}\mathrm{Fun}^{\ex(\kappa)}({\mathcal{A}},{\mathcal{D}})

is a fiber sequence of ∞\infty-categories. Since π’Ÿβ‰ƒ(Indκ⁑(π’Ÿ))ΞΊ{\mathcal{D}}\simeq(\Ind_{\kappa}({\mathcal{D}}))^{\kappa}, by adjunction this is equivalent to the sequence

FunL​(Indκ⁑(π’ž),Indκ⁑(π’Ÿ))⟢FunL​(Indκ⁑(ℬ),Indκ⁑(π’Ÿ))⟢FunL​(Indκ⁑(π’œ),Indκ⁑(π’Ÿ)),\mathrm{Fun}^{\mathrm{L}}(\Ind_{\kappa}({\mathcal{C}}),\Ind_{\kappa}({\mathcal{D}}))\mathchoice{\longrightarrow}{\rightarrow}{\rightarrow}{\rightarrow}\mathrm{Fun}^{\mathrm{L}}(\Ind_{\kappa}({\mathcal{B}}),\Ind_{\kappa}({\mathcal{D}}))\mathchoice{\longrightarrow}{\rightarrow}{\rightarrow}{\rightarrow}\mathrm{Fun}^{\mathrm{L}}(\Ind_{\kappa}({\mathcal{A}}),\Ind_{\kappa}({\mathcal{D}})),

which is a fiber sequence by assumption. ∎

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

Andrew J. Blumberg, David Gepner, Goncalo Tabuada

Original source: arXiv:1001.2282v4