In this section, we consider some properties of tensor products of -categories
that will be used in what follows. First we prove
(Proposition 4.1) that -categories of modules
over associative algebra objects are dualizable, with duals given by modules for the
opposite algebra, and that tensor product of algebras induces tensor products on module categories.
We then discuss the tensor product of small stable categories, and its compatibility
with passing to the corresponding presentable stable -categories of -objects.
4.1.1. Algebras and modules
Recall the tensor product of presentable stable -categories
developed in [L4], [L5]. Namely, the -category
of presentable -categories (with
morphisms given by left adjoints) carries a natural symmetric monoidal
tensor product that preserves stable objects.
Let be a monoidal -category. For two presentable
-categories and left tensored over , we denote
by the -category of left adjoints
from to that preserve the tensor over .
Similarly, the opposite category of is the
-category of presentable
-categories with morphisms given by right adjoints. For two
presentable -categories and left cotensored over
, we denote by the -category
of right adjoints from to that preserve the cotensor over
.
Lemma 4.2.Let and be stable presentable -categories that are
left tensored and cotensored over .
Let be a right adjoint that is tensored and cotensored over . Assume further that is colimit preserving.
Then is conservative if the induced functor is conservative
for any .
Proof.Suppose is not conservative. Then to prove the lemma, it suffices to exhibit a
presentable -category also
cotensored over and a nontrivial right adjoint
cotensored over such that is trivial.
Define to be the full -subcategory of of -acyclic objects,
that is,
objects such that is trivial. Our first
task is to show that is indeed presentable.
Observe that is equivalent to the fiber product , where the limit is computed in the -category
of -categories. Recall by [L2, Proposition 5.5.3.13], the natural functor
preserves limits. Furthermore,
the forgetful functor also preserves limits since it has a left adjoint (given by induction).
Since the functor preserves colimits and is -linear, we may regard it as a morphism in . Thus can be computed as a limit in ,
and so can be regarded as an object of .
In other words,
is presentable and furthermore tensored over .
Finally, since is tensored over , it is automatically cotensored as well.
Now it remains to show that the inclusion is indeed a right adjoint
and cotensored over .
Since preserves all limits and colimits (and in particular -filtered colimits),
the adjoint functor theorem applies. Finally, since
is cotensored over , is as well.
∎
Lemma 4.3.Let be a stable presentable -category which is left tensored and cotensored over , and let be an associative algebra in . Then the forgetful functor
is conservative.
Proof.Observe that for any tensored over , the pullback
induced by the induction is
conservative. In other words, if a functor out of
(which preserves colimits in each variable) is trivial when restricted
to , then it is necessarily trivial.
Consequently, switching to opposite categories, we have that the corresponding functor
induced by the forgetful functor
is conservative.
Now we can apply Lemma 4.2 with
to obtain that is conservative.
∎
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 .
∎
4.1.2. Small stable categories
We have been working with the symmetric monoidal structure on the -category
of presentable
-categories as developed in [L4],
[L5].
We will also need the tensor product of small stable idempotent complete
-categories,
in particular, the -categories of compact objects in presentable stable -categories.
Let be the full -subcategory of the -category
of stable categories (with morphisms exact functors) consisting of
those -categories that are idempotent complete. Recall that an
-category is idempotent complete if the essential image of
the Yoneda embedding is closed under retracts.
Proposition 4.4.The -category carries a symmetric monoidal structure characterized by the property
that for , the -category of exact functors
is equivalent to the full -subcategory
of all functors that preserve finite colimits in
and separately. Furthermore, passing to the corresponding
stable presentable -categories of -objects
is naturally a symmetric monoidal functor.
where the tensor product of the right hand side is calculated in the -category
of presentable -categories (with morphisms left adjoints), and
the superscript c denotes the full -subcategory of compact objects of a presentable -category.
Since is idempotent complete
and retracts of compact objects are compact,
is idempotent complete as well.
Thus the tensor product is indeed an object of .
For , let be the full -subcategory of
functors that preserve finite colimits in
and separately.
We claim that For , the tensor product
corepresents the functor
in the sense that for any , there is a canonical equivalence
As a consequence, the associativity and symmetry of the tensor product
will immediately follow from the analogous properties of .
For , let be
the full -subcategory of
functors that preserve colimits in
and separately.
To prove the claim, observe that the inclusion induces a fully faithful functor
Its essential image consists of functors that preserve compact objects.
By definition of the monoidal structure on the -category
of presentable -categories, we have a further equivalence
Since the compact objects of are generated by finite colimits of external products of compacts objects, we obtain an equivalence between
and the full -subcategory of consisting of functors that preserve compact objects.
In other words,
we have the asserted equivalence that characterizes the tensor product
Finally, the assertion that the functor
is symmetric monoidal is immediate from the constructions
and the natural equivalence , for .
∎
Remark 4.5. Given small stable idempotent complete
-categories ,
by construction
their tensor product is again
a small stable idempotent complete
-category. Though it is possible to consider other versions of a tensor
product on small stable -categories that need not preserve idempotent complete
-categories,
our approach builds it in from the beginning.