In this chapter we study the category \(\Pr ^{\dual }\) of dualizable categories and strongly continuous functors as a category in its own right. Colimits in \(\Pr ^{\dual }\) turn out to be computed in \(\PrL _{\st }\), and filtered colimits in \(\Pr ^{\dual }\) are much better behaved than in \(\PrL _{\st }\): they preserve fully faithful functors and short exact sequences. Limits in \(\Pr ^{\dual }\) are more subtle and are in general not computed in \(\PrL _{\st }\). Kernels and pullbacks exist, but they are given by the largest dualizable subcategories of the corresponding kernels and pullbacks in \(\PrL _{\st }\) on which the relevant functors are strongly continuous.
Along the way we introduce the continuous Calkin category, which is the key ingredient in the definition of localizing invariants of dualizable categories (Chapter 8). The main result about it is that it sends short exact sequences of dualizable categories to short exact sequences of small categories (Proposition 7.9). Its functoriality relies on the description of colimits, which we therefore treat first.
We follow [Efimov (2024), Sections 2.9--2.12]. Recall from Section 2.3 that \(\Pr ^{\mathrm {LL}}_{\st } \subseteq \PrL _{\st }\) denotes the subcategory of presentable stable categories and strongly continuous functors. By Remark 3.14 and Remark 3.13, we have full subcategories \[ \PrL _{\omega ,\st } \subseteq \Pr ^{\dual } \subseteq \Pr ^{\mathrm {LL}}_{\st }. \]
Sections
Colimits of dualizable categories
Colimits along strongly continuous functors are computed in presentable stable categories.
Continuous Calkin categories
The continuous Calkin category and its exactness.
Filtered colimits of dualizable categories
Filtered colimits preserve fully faithful functors, short exact sequences and compact objects.
Finite limits of dualizable categories
Dualizable kernels and pullbacks.