ScalingStacks

0NXR

Proof of Proposition 4.1. We first prove that ModA​(𝒞)⊗𝒞ℳ\mathrm{Mod}_{A}(\mathcal{C})\otimes_{\mathcal{C}}\mathcal{M} is equivalent to ModA​(ℳ)\mathrm{Mod}_{A}(\mathcal{M}) by the natural evaluation functor. Consider the adjunction

𝒞\textstyle{\mathcal{C}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}F\scriptstyle{F}ModA​(𝒞)\textstyle{\mathrm{Mod}_{A}(\mathcal{C})\ignorespaces\ignorespaces\ignorespaces\ignorespaces}G\scriptstyle{G}

where F(−)=A⊗−F(-)=A\otimes- is the induction, and GG is the forgetful functor.

The above adjunction induces an adjunction

ℳ\textstyle{\mathcal{M}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}F⊗id\scriptstyle{F\otimes{\rm id}}ModA​(𝒞)⊗𝒞ℳ\textstyle{\mathrm{Mod}_{A}(\mathcal{C})\otimes_{\mathcal{C}}\mathcal{M}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}G⊗id\scriptstyle{G\otimes{\rm id}}ModT​(ℳ)\textstyle{\mathrm{Mod}_{T}(\mathcal{M})}

and thus a functor to modules over the monad T=(G⊗id)∘(F⊗id)T=(G\otimes{\rm id})\circ(F\otimes{\rm id}) acting on ℳ\mathcal{M}. The functor underlying TT is given by tensoring with AA, so we also have an equivalence ModT​(ℳ)≃ModA​(ℳ)\mathrm{Mod}_{T}(\mathcal{M})\simeq\mathrm{Mod}_{A}(\mathcal{M}).

By its universal characterization, the functor G⊗idG\otimes{\rm id} is colimit preserving. Note as well that GG and hence G⊗idG\otimes{\rm id} is also 𝒞\mathcal{C}-linear (or in other words, the adjunction satisfies an analogue of the projection formula). Thus it follows from Lemma 4.3 that G⊗idG\otimes{\rm id} is also conservative. Thus G⊗idG\otimes{\rm id} satisfies the monadic Barr-Beck conditions, and we obtain the desired equivalence ModA​(𝒞)⊗𝒞ℳ≃ModA​(ℳ)\mathrm{Mod}_{A}(\mathcal{C})\otimes_{\mathcal{C}}\mathcal{M}\simeq\mathrm{Mod}_{A}(\mathcal{M}).

Next, we can apply this to the instance where ℳ\mathcal{M} is the ∞\infty-category of left modules over another associative algebra A′A^{\prime} to conclude that there is a natural equivalence ModA​(𝒞)⊗𝒞ModA′​(𝒞)≃ModA​(ModA′​(𝒞))\mathrm{Mod}_{A}(\mathcal{C})\otimes_{\mathcal{C}}\mathrm{Mod}_{A^{\prime}}(\mathcal{C})\simeq\mathrm{Mod}_{A}(\mathrm{Mod}_{A^{\prime}}(\mathcal{C})). We now have a chain of adjunctions

𝒞\textstyle{\mathcal{C}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}F′\scriptstyle{F^{\prime}}ModA′​(𝒞)\textstyle{\mathrm{Mod}_{A^{\prime}}(\mathcal{C})\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}F′′\scriptstyle{F^{\prime\prime}}G′\scriptstyle{G^{\prime}}ModA​(ModA′​(𝒞))\textstyle{\mathrm{Mod}_{A}(\mathrm{Mod}_{A^{\prime}}(\mathcal{C}))\ignorespaces\ignorespaces\ignorespaces\ignorespaces}G′′\scriptstyle{G^{\prime\prime}}

in which the composite G′∘G′′G^{\prime}\circ G^{\prime\prime} is colimit preserving and conservative, and hence satisfies the monadic Barr-Beck conditions.

Furthermore, the above adjunction naturally extends to a diagram in which the cycle of left adjoints (denoted by bowed arrows), and hence also the cycle of right adjoints (denoted by straight arrows), commute

𝒞\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\mathcal{C}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}F\scriptstyle{F}F′′​F′\scriptstyle{F^{\prime\prime}F^{\prime}}ModA​(ModA′​(𝒞))\textstyle{\mathrm{Mod}_{A}(\mathrm{Mod}_{A^{\prime}}(\mathcal{C}))\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}G′​G′′\scriptstyle{G^{\prime}G^{\prime\prime}}f\scriptstyle{f}ModA⊗A′​(𝒞)\textstyle{\ignorespaces\ignorespaces\ignorespaces\ignorespaces\mathrm{Mod}_{A\otimes A^{\prime}}(\mathcal{C})\ignorespaces\ignorespaces\ignorespaces\ignorespaces}G\scriptstyle{G}g\scriptstyle{g}

Here F(−)=A1⊗A2⊗−F(-)=A_{1}\otimes A_{2}\otimes- is the induction, GG is the forgetful functor, ff is the natural functor factoring through ModA​(𝒞)⊗𝒞ModA′​(𝒞)\mathrm{Mod}_{A}(\mathcal{C})\otimes_{\mathcal{C}}\mathrm{Mod}_{A^{\prime}}(\mathcal{C}), and gg is its right adjoint. From this diagram, we obtain a morphism of monads

G′​G′′​F′′​F′\textstyle{G^{\prime}G^{\prime\prime}F^{\prime\prime}F^{\prime}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}G′​G′′​g​f​F′′​F′≃G​F.\textstyle{G^{\prime}G^{\prime\prime}gfF^{\prime\prime}F^{\prime}\simeq GF.}

Now the underlying functors of the monads G​F​(−)GF(-) and G′​G′′​F′′​F′​(−)G^{\prime}G^{\prime\prime}F^{\prime\prime}F^{\prime}(-) are both equivalent to the tensor A⊗A′⊗(−)A\otimes A^{\prime}\otimes(-), so the above morphism of monads is an equivalence. Thus we obtain the promised equivalence ModA​(𝒞)⊗𝒞ModA′​(𝒞)≃ModA​(ModA′​(𝒞))≃ModA⊗A′​(𝒞)\mathrm{Mod}_{A}(\mathcal{C})\otimes_{\mathcal{C}}\mathrm{Mod}_{A^{\prime}}(\mathcal{C})\simeq\mathrm{Mod}_{A}(\mathrm{Mod}_{A^{\prime}}(\mathcal{C}))\simeq\mathrm{Mod}_{A\otimes A^{\prime}}(\mathcal{C}).

Finally, we show that the ∞\infty-category of left AA-modules ModA​(𝒞)\mathrm{Mod}_{A}(\mathcal{C}) is a dualizable 𝒞\mathcal{C}-module by directly exhibiting the ∞\infty-category of right AA-modules ModAop​(𝒞)\mathrm{Mod}_{A^{\rm op}}(\mathcal{C}) as its dual. The trace map is given by the two-sided bar construction

τ:ModA​(𝒞)⊗𝒞ModAop​(𝒞)→𝒞M,N↦M⊗AN\tau:\mathrm{Mod}_{A}(\mathcal{C})\otimes_{\mathcal{C}}\mathrm{Mod}_{A^{\rm op}}(\mathcal{C})\to\mathcal{C}\qquad M,N\mapsto M\otimes_{A}N

The unit map is given by the induction

u:𝒞→ModAop​(𝒞)⊗𝒞ModA​(𝒞)≃ModAop⊗A​(𝒞)c↦A⊗cu:\mathcal{C}\to\mathrm{Mod}_{A^{\rm op}}(\mathcal{C})\otimes_{\mathcal{C}}\mathrm{Mod}_{A}(\mathcal{C})\simeq\mathrm{Mod}_{A^{\rm op}\otimes A}(\mathcal{C})\qquad c\mapsto A\otimes c

where we regard A⊗cA\otimes c as an AA-bimodule.

One can verify directly that the composition

ModA​(𝒞)\textstyle{\mathrm{Mod}_{A}(\mathcal{C})\ignorespaces\ignorespaces\ignorespaces\ignorespaces}id⊗u\scriptstyle{{\rm id}\otimes u}ModA(𝒞)⊗𝒞ModAop(𝒞)⊗𝒞ModA(𝒞)\textstyle{\mathrm{Mod}_{A}(\mathcal{C})\otimes_{\mathcal{C}}\mathrm{Mod}_{A^{\rm op}}(\mathcal{C})\otimes_{\mathcal{C}}\mathrm{Mod}_{A}(\mathcal{C})\ignorespaces\ignorespaces\ignorespaces\ignorespaces}τ⊗id\scriptstyle{\tau\otimes{\rm id}}ModA​(𝒞)\textstyle{\mathrm{Mod}_{A}(\mathcal{C})}

is equivalent to the identity. First, (id⊗u)​(M)({\rm id}\otimes u)(M) is equivalent to A⊗MA\otimes M regarded as an A⊗Aop⊗AA\otimes A^{\rm op}\otimes A-module, and second, (τ⊗id)​(A⊗M)(\tau\otimes{\rm id})(A\otimes M) is equivalent to A⊗AM≃MA\otimes_{A}M\simeq M. ∎

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

David Ben-Zvi, John Francis, David Nadler

Original source: arXiv:0805.0157v5