Proof of Proposition 4.1.We first prove that is equivalent to
by the natural evaluation functor. Consider the
adjunction
where is the induction, and is the forgetful functor.
The above adjunction induces an adjunction
and thus a functor to modules over the monad acting on . The functor underlying
is given by tensoring with , so we also have an equivalence
.
By its universal characterization, the functor
is colimit preserving.
Note as well that and hence is also -linear
(or in other words, the adjunction satisfies an analogue of the projection formula).
Thus it follows from Lemma 4.3 that is also conservative.
Thus satisfies the monadic Barr-Beck conditions, and we obtain the
desired equivalence .
Next, we can apply this to the instance where is the
-category of left modules over another associative algebra
to conclude that there is a natural equivalence . We now have a chain of
adjunctions
in which the composite 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
Here is the induction, is the forgetful functor,
is the natural functor factoring through ,
and is its right adjoint. From this diagram, we obtain a morphism of monads
Now the underlying functors of the monads and are both equivalent to the tensor , so
the above morphism of monads is an equivalence. Thus we obtain the promised equivalence
.
Finally, we show that the -category of left -modules
is a dualizable -module by directly exhibiting the
-category of right -modules as its
dual. The trace map is given by the two-sided bar construction
The unit map is given by the induction
where we regard as an -bimodule.
One can verify directly that the composition
is equivalent to the identity. First, is equivalent to
regarded as an -module, and
second, is equivalent to .
∎