Colimits in \(\PrL _{\st }\) are computed as limits along the right adjoints (Section A.5). If all functors in the diagram are strongly continuous, then the right adjoints preserve colimits, and this allows us to show that colimits in \(\Pr ^{\mathrm {LL}}_{\st }\) and in \(\Pr ^{\dual }\) are computed in \(\PrL _{\st }\).
Proposition 7.1 ([Efimov (2024), Proposition 1.7]). Let \(I \to \Pr ^{\mathrm {LL}}_{\st }\), \(i \mapsto C_i\), be a small diagram, let \(C := \colim _i C_i\) be its colimit in \(\PrL _{\st }\), and let \(F_i\colon C_i \to C\) be the structure functors.
- (1)
-
The functors \(F_i\) are strongly continuous.
- (2)
-
A colimit-preserving functor \(G\colon C \to D\) to a presentable stable category \(D\) is strongly continuous if and only if each composite \(G \circ F_i\) is strongly continuous.
In particular, \(\Pr ^{\mathrm {LL}}_{\st }\) is cocomplete, and the inclusion \(\Pr ^{\mathrm {LL}}_{\st } \to \PrL _{\st }\) preserves colimits.
Proof.
We identify \(C\) with the limit \(\lim _i C_i\) in \(\widehat {\Cat }\), taken along the right adjoints \(F_{ij}^R\) of the transition functors \(F_{ij}\). Under this identification, \(F_i^R\colon C \to C_i\) is the projection. Since the transition functors \(F_{ij}^R\) preserve colimits, colimits in \(\lim _i C_i\) exist and are computed pointwise [Lurie (2009), Remark 5.4.7.13]. In particular, the projections \(F_i^R\) preserve colimits, which proves (1). Similarly, the right adjoint \(G^R\colon D \to C \simeq \lim _i C_i\) corresponds to the compatible family of functors \(F_i^RG^R \simeq (GF_i)^R\). As colimits in the limit are computed pointwise, \(G^R\) preserves colimits if and only if each \((GF_i)^R\) does, which proves (2).
For the final assertion, note that \(\Map _{\Pr ^{\mathrm {LL}}_{\st }}(C,D) \subseteq \Map _{\PrL _{\st }}(C,D)\) is a union of path components, and similarly for the \(C_i\). By (2), the equivalence \(\Map _{\PrL _{\st }}(C,D) \simeq \lim _i \Map _{\PrL _{\st }}(C_i,D)\) restricts to an equivalence \(\Map _{\Pr ^{\mathrm {LL}}_{\st }}(C,D) \simeq \lim _i \Map _{\Pr ^{\mathrm {LL}}_{\st }}(C_i,D)\), so that \(C\), together with the cocone of (1), is also a colimit in \(\Pr ^{\mathrm {LL}}_{\st }\). ā”
Proposition 7.2 ([Efimov (2024), Proposition 2.63]). The full subcategory \(\Pr ^{\dual } \subseteq \Pr ^{\mathrm {LL}}_{\st }\) is closed under small colimits. In particular, \(\Pr ^{\dual }\) is cocomplete, and the inclusion \(\Pr ^{\dual } \to \PrL _{\st }\) preserves colimits.
Proof.
Let \(I \to \Pr ^{\dual }\), \(i \mapsto C_i\), be a small diagram, and let \(C = \colim _i C_i\) in \(\PrL _{\st }\). By Proposition 7.1, it suffices to show that \(C\) is dualizable. The structure functors \(F_i\colon C_i \to C\) are strongly continuous by Proposition 7.1(1). Their right adjoints are the projections \(\lim _i C_i \to C_i\), which are jointly conservative. Hence the localizing subcategory \(L \subseteq C\) generated by the essential images of the \(F_i\), which is generated by a set of objects and hence presentable, satisfies \(L^{\perp } = 0\). By Proposition 2.12(1), we get \(L = C\). So \(C\) is dualizable by Proposition 4.25. ā”
As a first consequence, we can describe the epimorphisms in these categories.
Proposition 7.3 ([Efimov (2024), Propositions 1.13 and 1.14 and Corollary 2.64]). A morphism \(F\colon C \to D\) in \(\PrL _{\st }\), \(\Pr ^{\mathrm {LL}}_{\st }\) or \(\Pr ^{\dual }\) is an epimorphism if and only if it is a localization, i.e.Ā \(F^R\) is fully faithful.
Proof.
A morphism \(F\colon C \to D\) in a category with pushouts is an epimorphism if and only if the codiagonal \(\nabla \colon D \sqcup _C D \to D\) is an equivalence. By Proposition 7.1, Proposition 7.2, pushouts in \(\Pr ^{\mathrm {LL}}_{\st }\) and \(\Pr ^{\dual }\) are computed in \(\PrL _{\st }\). So it suffices to treat \(\PrL _{\st }\).
Computing the pushout as a pullback along the right adjoints, we have \(D \sqcup _C D \simeq D \times _C D\), where both functors \(D \to C\) are \(F^R\), and the right adjoint of \(\nabla \) is the diagonal \(\delta \colon D \to D \times _C D\). So \(F\) is an epimorphism if and only if \(\delta \) is an equivalence. If \(F^R\) is fully faithful, then \(F^R\) is a monomorphism in \(\widehat {\Cat }\), so \(\delta \) is an equivalence. Conversely, suppose that \(\delta \) is an equivalence, and let \(x,y \in D\). Then the map \begin {align*} \hom _D(x,y) \to \hom _{D \times _C D}(\delta x,\delta y) &\simeq \hom _D(x,y) \times _{\hom _C(F^Rx,F^Ry)} \hom _D(x,y) \\ &\simeq \hom _D(x,y) \oplus \fib \big (\hom _D(x,y) \to \hom _C(F^Rx,F^Ry)\big ) \end {align*}
is the diagonal, and it is an equivalence. Here the splitting of the pullback is induced by the first projection and its section given by the diagonal, so the diagonal corresponds to the inclusion of the first summand. We find that \(\hom _D(x,y) \to \hom _C(F^Rx,F^Ry)\) is an equivalence. So \(F^R\) is fully faithful. ā”
Remark 7.4. Dually, the monomorphisms in \(\PrL _{\st }\), in \(\Pr ^{\mathrm {LL}}_{\st }\) and in \(\Pr ^{\dual }\) are precisely the fully faithful functors [Efimov (2024), Propositions 1.13 and 1.14 and Corollary 2.87]. For \(\Pr ^{\dual }\), this requires the description of pullbacks in \(\Pr ^{\dual }\), see Corollary 7.22 below.