ScalingStacks

B.1.2 Factorization systems on presentable \(\infty\)-categories[00JU]

We now discuss factorization systems of small generation on presentable \(\infty\)-categories. We then proceed to make some further observations about factorization systems that admit specializations when applied to those of small generation.

For motivation, observe that both classes of a factorization system necessarily contain all equivalences. As a result, both classes of a factorization system on a large \(\infty\)-category must be large. However, on a presentable \(\infty\)-category one can define a factorization system in terms of a small set of morphisms (which then generate the left class), as we now recall.

[00JV]

Definition B.1.13. ([Lur09, Def. 5.5.5.1]).

We say that a class of morphisms \(S\) in an \(\infty\)-category \(\mathcal C\) is saturated if it satisfies the following conditions.

  1. The class \(S\) contains all equivalences and is closed under composition.67

  2. The full subcategory \(S \subseteq \mathrm{Fun}([1],\mathcal C)\) is closed under (small) colimits.

  3. The class \(S\) is stable under cobase change.

[00JZ]

Proposition B.1.14. ([Lur09, Prop. 5.5.5.7]).

Fix a presentable \(\infty\)-category \(\mathcal C\) and a small set of morphisms \(S\) in \(\mathcal C\). Then, there exists a factorization system \((\mathcal L,\mathcal R)\) on \(\mathcal C\) with \(\mathcal R= S^\perp\). Moreover, \(\mathcal L\) is the smallest saturated class of morphisms in \(\mathcal C\) that contains \(S\). 0◻

[00K0]

Definition B.1.15.

In the context of Proposition B.1.14, we say that the factorization system \((\mathcal L,\mathcal R)\) (or simply the left class \(\mathcal L\)) is of small generation, or more specifically that it is generated by \(S\). Moreover, we may write \(\overline{S}\) for \(\mathcal L\). We define the subcategories \[{\Pr}^{L,\text{f.s.},\mathcal L} \subset \widehat{\mathrm{Cat}}_\infty^{\text{f.s.},\mathcal L} \qquad \text{and} \qquad {\Pr}^{R,\text{f.s.},\mathcal R} \subset \widehat{\mathrm{Cat}}_\infty^{\text{f.s.},\mathcal R}\] to be those on the presentable \(\infty\)-categories whose factorization systems are of small generation, whose morphisms are respectively required to be left or right adjoints (in addition to preserving the indicated class of the factorization system).

[00K1]

Example B.1.16.

Fix any integer \(n \geq -2\). By [Lur09, Ex. 5.2.8.16], the \(\infty\)-category \(\mathcal S\) of spaces admits a factorization system (\(n\)-connected, \(n\)-truncated),68 which is generated by the singleton \(\{S^{n+1} \rightarrow{\sf pt}\}\).69

[00K2]

Observation B.1.17.

Given an adjunction between \(\infty\)-categories equipped with factorization systems, the left adjoint preserves the left class if and only if the right adjoint preserves the right class. It follows that passing to adjoints determines an equivalence \(\Pr^{L,\text{f.s.},\mathcal L} \simeq (\Pr^{R,\text{f.s.},\mathcal R})^\mathrm{op}\). We use these facts without further comment.

[00K3]

Lemma B.1.18.

If \(\mathcal C\) is a presentably \(\mathcal O\)-monoidal category for a small operad \(\mathcal O\) and suppose that for every color \(X\in \underline{\mathcal O}\), the presentable \(\infty\)-category \(\mathcal C_{X}\) is equipped with a factorization system \((\mathcal L_X, \mathcal R_X)\) generated by a set \(S_X\). Then, the factorization systems are compatible with the \(\mathcal O\)-monoidal structure if and only if for every operation \((X_1, \ldots, X_n) \rightarrow X\) in \(\mathcal O\), the corresponding functor \(\mathcal C_{X_1} \times \cdots \mathcal C_{X_n} \rightarrow\mathcal C_{X}\) carries morphisms in \(S_{X_1} \cdots \times \cdots S_{X_n}\) to morphisms in \(\mathcal L_X\).

[00K4]

Proof.

Assume that \(\mathcal C_{X_1} \times \cdots \mathcal C_{X_n} \rightarrow\mathcal C_{X}\) carries morphisms in \(S_{X_1} \cdots \times \cdots S_{X_n}\) to morphisms in \(\mathcal L_X\). By assumption, the functor \(\mathcal C_{X_1} \times \cdots \times \mathcal C_{X_n} \rightarrow\mathcal C_{X}\) preserves small colimits separately in all variables. Since for every \(Y \in \underline{\mathcal O}\), the class of morphisms \(\mathcal L_Y\) is by proposition B.1.14 the smallest saturated class of morphisms in \(\mathcal C_Y\) that contains \(S_Y\), the functor \(\mathcal C_{X_1} \times \cdots \times \mathcal C_{X_n} \rightarrow\mathcal C_{X}\) therefore also carries morphisms in \(\mathcal L_{X_1} \times \cdots \times \mathcal L_{X_n}\) to morphisms in \(\mathcal L_X\). ◻

[00K5]

Observation B.1.19.

Fix an \(\infty\)-category \(\mathcal C\) with a factorization system \((\mathcal L,\mathcal R)\).

  1. For any object \(c \in \mathcal C\), we obtain factorization systems on both \(\mathcal C_{c/}\) and \(\mathcal C_{/c}\) in which both classes are pulled back from \(\mathcal C\) via the respective forgetful functors.

  2. Suppose that \(\mathcal C\) is presentable and that \((\mathcal L,\mathcal R)\) is of small generation. Then, the factorization systems of part ([00K6]) are both of small generation as well. Specifically, if \(S\) denotes a set of morphisms in \(\mathcal C\) that generates \((\mathcal L,\mathcal R)\), then they are respectively generated by the evident (small) spaces of morphisms indexed by \[\bigsqcup_{(a \rightarrow b) \in S} \mathrm{Hom}_\mathcal C(c,a) \qquad \text{and} \qquad \bigsqcup_{(a \rightarrow b) \in S} \mathrm{Hom}_\mathcal C(b,c) ~.\]

[00K7]

Observation B.1.20.

Fix an \(\infty\)-category \(\mathcal C\) with a factorization system \((\mathcal L,\mathcal R)\).

  1. Assume that \(\mathcal C\) contains a terminal object. Then, there exists a left adjoint Original paper diagram to the fully faithful inclusion, which is given by the formula \(c \mapsto \mathrm{Fact}(c \rightarrow{\sf pt}_\mathcal C)\). Moreover, the right adjoint is the inclusion of the \(\mathcal L\)-local objects, and hence the left adjoint exhibits \(\mathcal C^\mathcal R\) as the localization \(\mathcal C[\mathcal L^{-1}]\).70

  2. Assume that \(\mathcal C\) is presentable and that \((\mathcal L,\mathcal R)\) is generated by a set \(S\) of morphisms in \(\mathcal C\). Then, the reflective localization ([00K9]) also identifies \(\mathcal C^\mathcal R\) with the (accessible) localization \(\mathcal C[S^{-1}]\).

  3. Furthermore, if \(\mathcal C\) has a symmetric monoidal structure compatible with the factorization system and which has the terminal object as monoidal unit, then it induces a symmetric monoidal structure on \(\mathcal C^\mathcal R\), for which the left adjoint \(\mathcal C\rightarrow\mathcal C^R\) is symmetric monoidal.

  4. Given a morphism \((\mathcal C_0,(\mathcal L_0,\mathcal R_0)) \xrightarrow{F} (\mathcal C_1,(\mathcal L_1,\mathcal R_1))\) in \(\mathrm{Cat}_\infty^{\text{f.s.},\mathcal L,\mathcal R}\) in which both \(\mathcal C_0\) and \(\mathcal C_1\) admit terminal objects and \(F({\sf pt}_{\mathcal C_0}) \simeq {\sf pt}_{\mathcal C_1}\), the reflective localizations of part ([00K8]) assemble into a morphism Original paper diagram of adjunctions.

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.

Yu Leon Liu, Aaron Mazel-Gee, David Reutter, Catharina Stroppel, Paul Wedrich

Original source: arXiv:2401.02956v2

Original source · 2401.02956v2