As an application of the two characterizations of dualizability in terms of compact exhaustions and (AB6), we show that dualizability propagates along strongly continuous functors whose images generate the target. As a consequence, a strongly continuous functor out of a dualizable category has a well-behaved image. These results will be used in Chapter 7 to study colimits and limits of dualizable categories. We begin with a criterion for strong continuity.

Lemma 4.24 ([Efimov (2024), Proposition 1.8]). Let \(G\colon D \to E\) be a colimit-preserving functor between presentable stable categories, and let \(F_i\colon C_i \to D\), \(i \in I\), be a family of strongly continuous functors from presentable stable categories \(C_i\). Assume that \(D\) is generated under colimits by the essential images of the \(F_i\), and that each composite \(G \circ F_i\) is strongly continuous. Then \(G\) is strongly continuous.

Proof.

The right adjoints \(F_i^R\) are jointly conservative: if \(F_i^R(x) \simeq 0\) for all \(i\), then the full subcategory of objects \(d \in D\) with \(\hom _D(d,x) \simeq 0\) is closed under colimits and contains the essential images of the \(F_i\), so it is all of \(D\), and in particular \(x \simeq 0\). Now let \((e_a)_a\) be a diagram in \(E\). Since the functors \(F_i^R\) and \(F_i^RG^R \simeq (GF_i)^R\) preserve colimits, applying \(F_i^R\) to the comparison map \(\colim _a G^R(e_a) \to G^R(\colim _a e_a)\) gives the comparison map for \((GF_i)^R\), which is an equivalence. Hence the comparison map is an equivalence, i.e. \(G^R\) preserves colimits. □

Proposition 4.25 ([Efimov (2024), Proposition 2.53]). Let \(D\) be a presentable stable category, and let \(F_i\colon C_i \to D\), \(i \in I\), be a family of strongly continuous functors from dualizable categories \(C_i\). If \(D\) is generated under colimits by the essential images of the \(F_i\), then \(D\) is dualizable.

Proof.

As in the proof of Lemma 4.24, the right adjoints \(F_i^R\colon D \to C_i\) are jointly conservative. They preserve small products, being right adjoints, and filtered colimits, by strong continuity. Let \(S\) be a set and let \((x_{s,j})_{j \in J_s}\), \(s \in S\), be filtered diagrams in \(D\). Applying \(F_i^R\) to the comparison map \[ \colim _{(j_s)_s \in \prod _s J_s} \prod _{s \in S} x_{s,j_s} \to \prod _{s \in S} \colim _{j \in J_s} x_{s,j} \] yields the corresponding comparison map for the diagrams \((F_i^R x_{s,j})_j\) in \(C_i\), which is an equivalence by Proposition 4.21, as \(C_i\) is dualizable. Hence the comparison map in \(D\) is an equivalence. So \(D\) satisfies (AB6), and is dualizable by Proposition 4.21. □

Second proof.

A strongly continuous functor \(F\colon C \to D\) preserves weakly compact morphisms. Indeed, let \(f\colon x \to x'\) be weakly compact in \(C\), let \((z_j)_j\) be a filtered diagram in \(D\), and let \(g\colon F(x') \to \colim _j z_j\). The adjoint map \(x' \to F^R(\colim _j z_j) \simeq \colim _j F^R(z_j)\) becomes, after precomposition with \(f\), a map factoring through some \(F^R(z_j)\). Passing back to adjoints, \(gF(f)\) factors through \(z_j\). Hence \(F\) also preserves compact exhaustions (Definition 4.13).

By Proposition 4.14, each \(C_i\) is generated under colimits by compactly exhaustible objects. Their images under \(F_i\) are compactly exhaustible, and they generate \(D\) under colimits, since the localizing subcategory they generate contains the essential images of the \(F_i\). So \(D\) is dualizable by Proposition 4.14. □

Remark 4.26. In the talk, as in [Efimov (2024)], the proof of Proposition 4.25 was first reduced to the case of a single functor, using the induced functor \(\prod _i C_i \to D\). Here we note that the product \(\prod _i C_i\), computed in \(\widehat {\Cat }\), is also the coproduct of the \(C_i\) in \(\PrL _{\st }\), as colimits in \(\PrL \) are computed as limits along the right adjoints (Section A.5). If each \(C_i\) is dualizable, then so is \(\prod _i C_i\): products and filtered colimits in \(\prod _i C_i\) are computed componentwise, so (AB6) holds in \(\prod _i C_i\) since it holds in each \(C_i\). Alternatively, if \(C_i\) is a retract of a compactly generated category \(\widetilde {C}_i\) in \(\PrL _{\st }\), then \(\prod _i C_i\) is a retract of \(\prod _i\widetilde {C}_i\), which is compactly generated by the objects with a single nonzero component, which is compact.

Definition 4.27 ([Efimov (2024), Definition 2.54]). Let \(F\colon C \to D\) be a colimit-preserving functor between presentable stable categories. The image \(\Im (F) \subseteq D\) is the smallest full stable subcategory of \(D\) which contains the essential image of \(F\) and is closed under colimits, i.e. the localizing subcategory generated by the essential image of \(F\).

If \(C\) is generated under colimits by a set \(S\) of objects, then \(\Im (F)\) is generated under colimits by the set \(F(S)\), and hence is presentable [Efimov (2024), Section 1.3]. By Proposition 2.12(1), the cofiber of \(F\) in \(\PrL _{\st }\) is \(D \to \Im (F)^{\perp }\), whose kernel is \(\Im (F)\). So \(\Im (F)\) is equivalently the fiber of the cofiber of \(F\) in \(\PrL _{\st }\).

Corollary 4.28 ([Efimov (2024), Corollary 2.55]). Let \(F\colon C \to D\) be a strongly continuous functor between presentable stable categories, and assume that \(C\) is dualizable. Then \(\Im (F)\) is dualizable, and the inclusion \(j\colon \Im (F) \hookrightarrow D\) is strongly continuous.

Proof.

Write \(F = j \circ F'\) with \(F'\colon C \to \Im (F)\). Since \(j\) is fully faithful, the right adjoint of \(F'\) is \(F^R \circ j\), which preserves colimits. So \(F'\) is strongly continuous, and its essential image generates \(\Im (F)\) under colimits. Hence \(\Im (F)\) is dualizable by Proposition 4.25. Since \(j \circ F' = F\) is strongly continuous, Lemma 4.24 shows that \(j\) is strongly continuous. □

In the talk, the strong continuity of the inclusion \(\Im (F) \hookrightarrow D\) was stated without proof. Unwinding the proof of Lemma 4.24, the point is that the right adjoint \(F'^R\colon \Im (F) \to C\) of \(F'\) is conservative, and its composite \(F'^R j^R \simeq F^R\) with \(j^R\) preserves colimits.

The two criteria have different uses. Compact exhaustions describe objects and allow constructions by successive factorizations; (AB6) detects dualizability through jointly conservative right adjoints. The image and generation results above make the latter method available without choosing an exhaustion for each object.