[{"content":"Algebraic Pattern Algebraic pattern is a blueprint for a notion of functors on a fixed category satisfying a Segal condition, suitable for formalizing homotopy-coherent algebra in the Cartesian setting.\nInformally, algebraic pattern generalizes the active and inert morphisms in operads and chooses certain objects to control the Segal condition.\nDefinition 1. An algebraic pattern is a category $\\mathcal{O}$ equipped with:\nA collection of objects called elementary objects. A factorization system $(\\mathcal{O}^{\\text{inv}}, \\mathcal{O}^{\\text{act}})$ where every morphism factors uniquely (up to equivalence) as an inert morphism followed by an active morphism. We let $\\mathcal{O}^{\\mathrm{el}}$ denote the full subcategory of $\\mathcal{O}$ spanned by the elementary objects and the inert morphisms between them. For any object $X \\in \\mathcal{O}$, we also write \\[ \\mathcal{O}^{\\mathrm{el}}_{X/} := \\mathcal{O}^{\\mathrm{el}} \\times_{\\mathcal{O}^{\\text{inv}}} \\mathcal{O}^{\\text{inv}}_{X/}. \\] for the category of inter morphisms $X \\to E$ with $E \\in \\mathcal{O}^{\\text{el}}$.\nA morphism of algebraic patterns from $\\mathcal{O}$ to $\\mathcal{P}$ is a functor $f \\colon \\mathcal{O} \\to \\mathcal{P}$ that preserves inert and active morphisms and elementary objects.\nWe will use $\\mathsf{AlgPatt}$ to denote the category of algebraic patterns.\nRemark. A factorization system on a category $\\mathcal{C}$ is a pair of subcategories $(\\mathcal{L}, \\mathcal{R})$ that contain all objects, such that for any morphism $f \\colon X \\to X'$, the anima of factorizations $X \\xrightarrow{l} Y \\xrightarrow{r} X'$ with $l \\in \\mathcal{L}$ and $r \\in \\mathcal{R}$ is contractible. Proposition 2. $\\mathsf{AlgPatt}$ admits limits and filtered colimits, and the forgetful functor \\[ \\mathsf{AlgPatt} \\to \\mathsf{Cat} \\] preserves these.\nProof. [CH21, Corollary 5.5] $\\square$ Definition 3 (Trivial Pattern). Trivial Pattern $\\mathsf{Triv}$ is the final object of $\\mathsf{AlgPatt}$. The underlying category of trivial pattern is the final category $*$. Definition 4 (Empty Pattern). Empty Pattern $\\varnothing$ is the initial object of $\\mathsf{AlgPatt}$. The underlying category of empty pattern is the initial category $\\varnothing$. Definition 5 (Commutative Pattern). Consider the category of pointed finite sets $\\mathsf{Fin}_*$ with $\\langle n \\rangle \\coloneqq (\\{0,1,\\cdots,n\\},0)$. We say a morphism $f \\colon \\langle n \\rangle \\to \\langle m \\rangle$ is:\nInert, if $f$ restricts to an isomorphism $\\langle n \\rangle \\setminus f^{-1}(0) \\to \\langle m \\rangle \\setminus \\{0\\}$. Active, if $f^{-1}(0) = \\{0\\}$. We make this an algebraic pattern by taking $\\langle 1 \\rangle$ to be the single elementary object and denote it by $\\mathsf{Comm}$. We refer to this pattern as commutative pattern.\nRemark. In Definition 5 , if we take $\\langle 0 \\rangle$ and $\\langle 1 \\rangle$ to be the elementary objects, we can get a new algebraic pattern $\\mathsf{Fin}_*^{\\natural}$. Definition 6 (Associative Pattern). Consider the opposite of the simplex category, $\\Delta^{\\operatorname{op}}$. A morphism $f \\colon [n] \\to [m]$ in $\\Delta^{\\operatorname{op}}$ is:\nInert, if its corresponding map $g \\colon [m] \\to [n]$ in $\\Delta$ is an interval inclusion. Active, if its corresponding map $g \\colon [m] \\to [n]$ preserves endpoints. We choose the object $[1]$ as the unique elementary object. This algebraic pattern, denoted $\\mathsf{Assoc}$, is called the associative pattern.\nDefinition 7 ($\\mathbb{A}_n$-Pattern). For $1 \\le n \\le \\infty$, let $\\mathbb{A}_n$ denote the full subcategory of $\\Delta^{\\operatorname{op}}$ spanned by the objects $[m]$ for $0 \\le m \\le n$.\nThe category $\\mathbb{A}_n$ can be endowed with an algebraic pattern structure inherited from $\\mathsf{Assoc}$, in which the inert and active morphisms are precisely those that are inert or active in $\\mathsf{Assoc}$, and the elementary object is given by $[1]$. We will refer to $\\mathbb{A}_n$ as the $\\mathbb{A}_n$-pattern.\nRemark. One can find that the $\\mathbb{A}_{\\infty}$-pattern is the associative pattern. Definition 8 (Nonunital $\\mathbb{A}_n$-Pattern). Let $\\Delta_{\\operatorname{inj}} \\subseteq \\Delta$ denote the subcategory whose morphisms are strictly increasing maps. For $0 \\le n \\le \\infty$, let $\\mathbb{A}_n^{\\operatorname{nu}}$ denote the full subcategory of $\\Delta_{\\operatorname{inj}}^{\\operatorname{op}}$ spanned by the objects $[m]$ for $1 \\le m \\le n$ (so $\\mathbb{A}_0^{\\operatorname{nu}} \\simeq \\varnothing$).\nThe category $\\mathbb{A}_n^{\\operatorname{nu}}$ can be endowed with an algebraic pattern structure inherited from $\\mathsf{Assoc}$, in which the inert and active morphisms are precisely those that are inert or active in $\\mathsf{Assoc}$, and the elementary object is given by $[1]$. We will refer to $\\mathbb{A}_n^{\\operatorname{un}}$ as the nonunital $\\mathbb{A}_n$-pattern.\nDefinition 9 ($\\mathsf{E}_k$-Pattern). Consider the $k$-copies of the opposite of simplex categories, $\\Delta^{k,\\operatorname{op}} \\coloneqq (\\Delta^{\\operatorname{op}})^{\\times k}$, equipped with the factorization system where the inert and active maps are those that are inert or active in $\\mathsf{Assoc}$ in each component. We choose the object $([1],\\cdots,[1])$ to be the unique elementary object. This algebraic pattern, denoted $\\mathsf{E}_k$, is called the $\\mathsf{E}_k$-pattern. Next, we introduce patterns related to modules.\nDefinition 10 (Commutative Modules Pattern). The underlying category of commutative modules pattern $\\mathsf{CM}$ is the category $\\mathsf{Fin}_{*,\\langle 1 \\rangle/}$. Its factorzation system is lifted from $\\mathsf{Comm}$ along the canonical left fibration $\\mathsf{Fin}_{*,\\langle 1 \\rangle/} \\to \\mathsf{Fin}_*$. And the elementary objects are given by $\\langle 1 \\rangle \\to \\{0\\} \\subseteq \\langle 1 \\rangle$ and $\\operatorname{id}_{\\langle 1 \\rangle}$.\nBy construction, an object $\\langle 1 \\rangle \\to \\langle n \\rangle$ in $\\mathsf{Fin}_{*,\\langle 1 \\rangle/}$ can be regarded as a pair $(\\langle n \\rangle,i)$, where $i$ is the image of $1 \\in \\langle 1 \\rangle$. The morphism in $\\mathsf{CM}$, which is form $f \\colon (\\langle n \\rangle,i) \\to (\\langle h \\rangle,j)$, refers to the pointed map $\\langle n \\rangle \\to \\langle h \\rangle$ with $f(i) = j$.\nDefinition 11 (Bimodule Pattern). The underlying category of bimodule pattern $\\mathsf{BM}$ is the category $(\\Delta_{/[1]})^{\\operatorname{op}}$. Its factorization system is lifted from $\\mathsf{Assoc}$ along the canonical left fibration $(\\Delta_{/[1]})^{\\operatorname{op}} \\to \\Delta^{\\operatorname{op}}$. And the elementary objects are given by $[1] \\simeq \\{0\\} \\to [1]$, $[1] \\simeq \\{1\\} \\to [1]$ and $\\operatorname{id}_{[1]}$.\nBy construction, an object $[n] \\to [1]$ in $\\Delta_{/[1]}$ can be viewed as an ordered sequence $(i_0, \\dots, i_n)$ where $0 \\le i_0 \\le \\dots \\le i_n \\le 1$. The elementary objects correspond to the sequences $(0,0)$, $(0,1)$, and $(1,1)$.\nDefinition 12 (Left Module Pattern, Simplicial model version). The underlying category of left module pattern $\\mathsf{LM}$ is the category $\\Delta^{\\operatorname{op}} \\times [1]$. Consider the functor $T \\colon \\Delta^{\\operatorname{op}} \\to \\Delta^{\\operatorname{op}}$, sending $[n]$ to $[n] \\star [0] \\simeq [n+1]$. Then the functor induces a functor \\[ (T \\to \\operatorname{id}) \\colon \\Delta^{\\operatorname{op}} \\times [1] \\to \\Delta^{\\operatorname{op}}. \\] The algebraic pattern structure of $\\mathsf{LM}$ is lifted from $\\mathsf{Assoc}$ along $(T \\to \\operatorname{id})$. More precisely,\n$\\Delta^{\\operatorname{op}} \\times \\{1\\}$ is precisely $\\mathsf{Assoc}$. For each $[n] \\in \\Delta$, the induced morphism $([n],0) \\to ([n],1)$ is an inert morphism in $\\mathsf{LM}$. If $f \\colon [h] \\to [n]$ is an inert morphism in $\\Delta$ such that $f(h) = n$, then the corresponding morphism $([n],0) \\to ([h],0)$ is an inert morphism in $\\mathsf{LM}$. If $g \\colon [h] \\to [n]$ is a morphism in $\\Delta$ such that $g(0) = 0$, then the corresponding morphism $([n],0) \\to ([h],0)$ is an active morphism in $\\mathsf{LM}$. The elementary objects of $\\mathsf{LM}$ are $([0],0)$ (often denoted by $\\mathfrak{m}$) and $([1],1)$ (often denoted by $\\mathfrak{a}$). Remark. Saying \u0026ldquo;left\u0026rdquo; versus \u0026ldquo;right\u0026rdquo; is just a convention; the same algebraic pattern also encodes right actions. Segal Object The algebra represented by the algebraic pattern is called Segal object.\nDefinition 13. Let $\\mathcal{O}$ be an algebraic pattern. A functor $X \\colon \\mathcal{O} \\to \\mathcal{C}$ is called Segal $\\mathcal{O}$-object of category $\\mathcal{C}$ if for every $O \\in \\mathcal{O}$ the induced functor \\[ \\left(\\mathcal{O}_{O/}^{\\text{el}}\\right)^{\\lhd} \\to \\mathcal{O} \\xrightarrow{X} \\mathcal{C} \\] is a limit diagram. If $\\mathcal{C}$ has limit for diagrams indexed by $\\mathcal{O}_{O/}^{\\text{el}}$ for all $O \\in \\mathcal{O}$ in which case we say that $\\mathcal{C}$ is $\\mathcal{O}$-complete, then this condition is equivalent to the canonical morphisms \\[ X(O) \\to \\underset{E \\in \\mathcal{O}_{O/}^{\\text{el}}}{\\operatorname{lim}}\\, X(E). \\] Now, we will provide some examples to explain how algebraic patterns work.\nExample 14 (Segal $\\mathsf{Trivial}$-Objects). Let $\\mathcal{C}$ be a category. Then the Segal $\\mathsf{Trivial}$-object in $\\mathcal{C}$ is just an object in $\\mathcal{C}$. Example 15 (Segal $\\mathsf{Comm}$-Objects). Let $\\mathcal{C}$ be a category with finite products, and let $X \\colon \\mathsf{Comm} \\to \\mathcal{C}$ be a functor. The Segal condition on $X$ is \\[ X(\\langle n \\rangle) \\simeq \\underset{(\\langle n \\rangle \\to \\langle 1 \\rangle) \\in \\mathsf{Comm}^{\\text{inv}}}{\\operatorname{lim}}\\, X(\\langle 1 \\rangle). \\] We can identify the category $\\mathsf{Comm}^{\\text{el}}_{\\langle n \\rangle/}$ with the set of inert morphisms $\\{\\rho_i \\colon i = 1, \\dots, n\\}$, where $\\rho_i \\colon \\langle n \\rangle \\to \\langle 1 \\rangle$ is given by \\[ \\rho_i(j) = \\begin{cases} 1 \u0026 \\text{if } j=i, \\\\ 0 \u0026 \\text{if } j \\neq i. \\end{cases} \\] Then, the Segal condition says that the canonical map \\[ (\\rho_i^*)_{i = 1}^n \\colon X(\\langle n \\rangle) \\to \\prod_{i=1}^n X(\\langle 1 \\rangle) \\] is an equivalence. This means that for each non-basepoint element $i \\in \\langle n \\rangle$ (where $i \\neq 0$), we can specify a corresponding object $x_i \\in X(\\langle 1 \\rangle)$. Therefore, we can describe an object in $X(\\langle n \\rangle)$ as a sequence $(x_1, \\dots, x_n)$.\nNext, we will show how inert and active morphisms work:\nLet $f \\colon \\langle n \\rangle \\to \\langle m \\rangle$ be an inert morphism in $\\mathsf{Comm}$. Then $f$ corresponds to the projection \\[ X(f) \\colon X(\\langle n \\rangle) \\simeq X(\\langle 1 \\rangle)^n \\to X(\\langle 1 \\rangle)^m \\simeq X(\\langle m \\rangle), \\quad (x_1, \\dots, x_n) \\mapsto (x_{f^{-1}(1)}, \\dots, x_{f^{-1}(m)}). \\] Let $g \\colon \\langle n \\rangle \\to \\langle m \\rangle$ be an active morphism in $\\mathsf{Comm}$, and let $I_j \\coloneqq g^{-1}(j)$ for $j \\in \\{1, \\dots, m\\}$. Then $g$ corresponds to the morphism \\[ X(g) \\colon X(\\langle n \\rangle) \\simeq X(\\langle 1 \\rangle)^n \\to X(\\langle 1 \\rangle)^m \\simeq X(\\langle m \\rangle), \\quad (x_1, \\dots, x_n) \\mapsto \\left(\\prod_{i_1 \\in I_1} x_{i_1}, \\dots, \\prod_{i_m \\in I_m} x_{i_m}\\right). \\] In particular, the active morphism $s \\colon \\langle 2 \\rangle \\to \\langle 2 \\rangle$ that swaps $1$ and $2$ corresponds to the map $(x_1, x_2) \\mapsto (x_2, x_1)$, which enforces the commutativity. Active morphisms represent the “commutative multiplication”. When we set $\\mathcal{C} = \\mathsf{Set}$, we find that $\\mathsf{Comm}$-Segal objects are precisely commutative monoids.\nExample 16 (Segal $\\mathsf{Assoc}$-Objects). Let $\\mathcal{C}$ be a category with finite products, and let $X \\colon \\mathsf{Assoc} \\to \\mathcal{C}$ be a simplicial object. The Segal condition on $X$ is \\[ X([n]) \\simeq \\underset{([n] \\to [1]) \\in \\mathsf{Assoc}^{\\text{inv}}}{\\operatorname{lim}}\\, X([1]). \\] Now, let\u0026rsquo;s analyze the limit above. An inert morphism $e_i \\colon [n] \\to [1]$ in $\\Delta^{\\operatorname{op}}$ corresponds to an inclusion $[1] \\hookrightarrow [n]$ in $\\Delta$ with image $\\{i-1, i\\}$. Notice that $[n]$ is a linearly ordered set, and one can think of it as being cut into $n$ pieces: \\[ [n] = \\left\\{0 \\xrightarrow{e_1} 1 \\xrightarrow{e_2} \\cdots \\xrightarrow{e_n} n \\right\\}, \\] where the segment $i-1 \\to i$ corresponds to the inert map $e_i$. The Segal condition says that the canonical map \\[ (e_i^*)_{i=1}^n \\colon X([n]) \\to \\prod_{i=1}^n X([1]) \\] is an equivalence. This means we can associate each arrow $i-1 \\to i$ in $[n]$ with a corresponding object $x_i \\in X([1])$. Therefore, we can describe an object in $X([n])$ as a sequence $(x_1, \\dots, x_n)$.\nNext, we will show how inert and active morphisms work:\nLet $f \\colon [n] \\to [m]$ be an inert morphism in $\\mathsf{Assoc}$, and let $f^{\\operatorname{op}} \\colon [m] \\to [n]$ be the corresponding morphism in $\\Delta$. In the Segal object $X$, the morphism $X(f)$ corresponds to a projection: \\[ X([n]) \\simeq X([1])^n \\to X([1])^m \\simeq X([m]), \\quad (x_1, \\dots, x_n) \\mapsto (x_{f^{\\operatorname{op}}(1)}, \\dots, x_{f^{\\operatorname{op}}(m)}). \\] Let $g \\colon [n] \\to [m]$ be an active morphism in $\\mathsf{Assoc}$, and let \\[ I_j \\coloneqq \\{(g^{\\operatorname{op}})^{-1}(j-1)+1,\\cdots,(g^{\\operatorname{op}})^{-1}(j)\\} \\] for $j \\in \\{1, \\dots, m\\}$. In the Segal object $X$, the morphism $X(g)$ corresponds to: \\[ X([n]) \\simeq X([1])^n \\to X([1])^m \\simeq X([m]), \\quad (x_1, \\dots, x_n) \\mapsto \\left(\\prod_{i_1 \\in I_1} x_{i_1}, \\dots, \\prod_{i_m \\in I_m} x_{i_m}\\right), \\] which represents “multiplication”. When we set $\\mathcal{C} = \\mathsf{Set}$, we find that $\\mathsf{Assoc}$-Segal objects are precisely monoids.\nRemark. Note that:\nthe morphism $[0] \\to [1]$ in $\\mathsf{Assoc}$ corresponds to the morphism $1 \\colon * \\to X([1])$, which is the unit of the associative algebra. the degenerate morphism $\\operatorname{s}^i\\colon [n] \\to [n-1]$ corresponds to the morphism \\[ X([n-1]) \\to X([n]), \\quad (x_1,\\cdots,x_{n-1}) \\mapsto (x_1,\\cdots,\\underset{i\\text{-th}}{1},\\cdots, x_{n-1}). \\] Therefore, if we remove these data, we will get the Segal $\\mathbb{A}_{\\infty}^{\\operatorname{nu}}$-object (Definition~\\ref{def-nonunital-An-pattern}). Example 17 (Segal $\\mathsf{CM}$-Objects). Let $\\mathcal{C}$ be a category with finite products, and $X \\colon \\mathsf{CM} \\to \\mathcal{C}$ be a functor. The Segal condition on $X$ is \\[ X(\\langle n \\rangle,i) \\simeq \\underset{(\\langle h \\rangle,j) \\in \\mathsf{CM}^{\\text{el}}_{(\\langle n \\rangle,i)/}}{\\operatorname{lim}}\\, X(\\langle h \\rangle,j). \\] Now, let\u0026rsquo;s analyze the limit above. When $i = 0$, the Segal condition is equivalent to saying that \\[ X(\\langle n \\rangle,0) \\simeq \\prod_{j = 1}^n X(\\langle 1 \\rangle,0). \\]When $i \\neq 0$, the Segal condition is equivalent to saying that \\[ X(\\langle n \\rangle,i) \\simeq \\prod_{j = 1}^{i-1} X(\\langle 1 \\rangle,0) \\times X(\\langle 1 \\rangle,1) \\times \\prod_{j = i+1}^n X(\\langle 1 \\rangle,0). \\]We will refer to $X(\\langle 1 \\rangle,0)$ as $A$ and $X(\\langle 1 \\rangle,1)$ as $M$. Next, we will show how inert and active morphisms work:\nLet $f \\colon (\\langle n \\rangle,i) \\to (\\langle h \\rangle,j)$ be an inert morphism in $\\mathsf{CM}$. If $i = 0$, we have $j = 0$ by construction of $\\mathsf{CM}$, in this case, $f$ corresponds to the projection \\[ \\begin{aligned} A^n \u0026\\to A^h\\\\ (a_1,\\cdots,a_n) \u0026\\mapsto (a_{f^{-1}(1)},\\cdots, a_{f^{-1}(h)}). \\end{aligned} \\] If $i \\neq 0$ with $j = 0$, then $f$ corresponds to the projection \\[ \\begin{aligned} A^{i-1} \\times M \\times A^{n-i} \u0026\\to A^h\\\\ (a_1,\\cdots,m,\\cdots,a_n) \u0026\\mapsto (a_{f^{-1}(1)},\\cdots,a_{f^{-1}(h)}). \\end{aligned} \\] If $i \\neq 0$ with $j \\neq 0$, then $f$ corresponds to the projection \\[ \\begin{aligned} A^{i-1} \\times M \\times A^{n-i} \u0026\\to A^{j-1} \\times M \\times A^{h-j}\\\\ (a_1,\\cdots,m,\\cdots,a_n) \u0026\\mapsto (a_{f^{-1}(1)},\\cdots,m,\\cdots,a_{f^{-1}(h)}). \\end{aligned} \\] Let $g \\colon (\\langle n \\rangle,i) \\to (\\langle h \\rangle,j)$ be an active morphism in $\\mathsf{CM}$. If $i = 0$, then we have $j = 0$ by construction of $\\mathsf{CM}$, in this case, let $I_j \\coloneqq g^{-1}(j)$ for $j \\in \\{1, \\dots, m\\}$, we have $g$ corresponds to the morphism \\[ \\begin{aligned} A^n \u0026\\to A^h\\\\ (a_1,\\cdots,a_n) \u0026\\mapsto \\left(\\prod_{i_1 \\in I_1}a_{i_1},\\cdots, \\prod_{i_h \\in I_h}a_{i_h} \\right). \\end{aligned} \\] If $i \\neq 0$, then by the description of the active morphism, we know that $j \\neq 0$. Let $I_j \\coloneqq g^{-1}(j)$ for $j \\in \\{1, \\dots, m\\}$, we have $g$ corresponds to the morphism \\[ \\begin{aligned} A^{i-1} \\times M \\times A^{n-i} \u0026\\to A^{j-1} \\times M \\times A^{h-j}\\\\ (a_1,\\cdots,a_n) \u0026\\mapsto \\left(\\prod_{i_1 \\in I_1}a_{i_1},\\cdots, \\left(\\prod_{i_j \\in I_j} a_{i_j}\\right)\\cdot m, \\cdots, \\prod_{i_h \\in I_h}a_{i_h} \\right). \\end{aligned} \\] which represents “action”. Example 18 (Segal $\\mathsf{LM}$-Objects). Let $\\mathcal{C}$ be a category with finite products, and $X \\colon \\mathsf{LM} \\to \\mathcal{C}$ be a functor. The Segal condition on $X$ is \\[ X([n],i) \\simeq \\underset{([h],j) \\in \\mathsf{LM}^{\\text{el}}_{([n],i)/}}{\\operatorname{lim}}\\, X([h],j). \\] Now, let\u0026rsquo;s analyze the limit above. Consider the canonical projection $p \\colon ([n],0) \\to ([0],0)$ in $\\mathsf{LM}$ corresponds to an inclusion $[0] \\simeq \\{n\\} \\hookrightarrow [n]$.\nWhen $i = 1$, the Segal condition is equivalent to saying that \\[ \\left((e_i,1)^*\\right)_{i = 1}^n \\colon X([n],1) \\simeq \\prod_{i = 1}^n X([1],1). \\]When $i = 0$, the Segal condition is equivalent to saying that \\[ \\left((e_i,0)^*\\right)_{i = 1}^{n} \\times p \\colon X([n],0) \\to \\left(\\prod_{i = 1}^n X([1],1)\\right) \\times X([0],0). \\]We will refer to $X([1],1)$ as $A$ and $X([0],0)$ as $M$.\nThat is, the Segal $\\mathsf{LM}$-objects in $\\mathcal{C}$ consists of those natural transformations \\[ M_{\\bullet} \\Rightarrow A_{\\bullet} \\] of simplicial objects $M_{\\bullet},A_{\\bullet} \\colon \\Delta^{\\operatorname{op}} \\to \\mathcal{C}$ such that $A_{\\bullet}$ is a Segal $\\mathsf{Assoc}$-object in $\\mathcal{C}$ and for all $n \\ge 0$, we have \\[ M_n = A^n \\times M. \\]Now we will show how inert and active morphisms work:\n$\\{1\\} \\times \\Delta^{\\operatorname{op}}$ consistent with $\\mathsf{Assoc}$. For each $[n] \\in \\Delta$, the induced morphism $([n],0) \\to ([n],1)$ corresponds to the projection \\[ \\begin{aligned} M_n = A^n \\times M \u0026\\to A^n\\\\ (a_1,\\cdots,a_n,m) \u0026\\mapsto (a_1,\\cdots,a_n). \\end{aligned} \\] Let $f \\colon ([n],0) \\to ([h],0)$ be an inert morphism in $\\mathsf{LM}$, denote its image under $(T \\to \\operatorname{id})$ as $\\tilde{f} \\colon [n+1] \\to [h+1]$. Then $f$ corresponds to the projection \\[ \\begin{aligned} M_n = A^n \\times M \u0026\\to A^h \\times M = M_h \\\\ (a_1,\\cdots,a_n,m) \u0026\\mapsto \\left(a_{\\tilde{f}^{\\operatorname{op}}(1)},\\cdots,a_{\\tilde{f}^{\\operatorname{op}}(h)},m\\right). \\end{aligned} \\] Let $g \\colon ([n],0) \\to ([h],0)$ be an active morphism in $\\mathsf{LM}$, denote its image under $(T \\to \\operatorname{id})$ as $\\tilde{g} \\colon [n+1] \\to [h+1]$. Let \\[ I_j \\coloneqq \\{(\\tilde{g}^{\\operatorname{op}})^{-1}(j-1)+1,\\cdots,(\\tilde{g}^{\\operatorname{op}})^{-1}(j)\\} \\] for $j \\in \\{1, \\dots, h+1\\}$. Then $g$ corresponds to the morphism \\[ \\begin{aligned} M_n = A^n \\times M \u0026\\to A^h \\times M = M_h\\\\ (a_1,\\cdots,a_n,m) \u0026\\mapsto \\left(\\prod_{i_1 \\in I_1} a_{i_1},\\cdots,\\prod_{i_h \\in I_h} a_{i_h},\\left(\\prod_{i_{h+1} \\in I_{h+1}} a_{i_{h+1}}\\right)\\cdot m \\right) \\end{aligned} \\] which represents “left action”. Operad Over An Algebraic Pattern In this section, we introduce operads, which are mathematical structures designed to encode the abstract properties of algebraic operations. Building on the notion of algebraic patterns, operads allow us to describe entire algebraic theories, such as the theory of homotopy-coherence algebras.\nFor more heuristics of operads, we refer to the excellent overview in [Cno25, Chapter 10] .\nAn operad $\\mathcal{O}$ over an algebraic pattern $\\mathcal{P}$ can be regarded as a category of “$\\mathcal{P}$-type” operation, where the “$\\mathcal{P}$-type” means Segal condition of $\\mathcal{P}$.\nDefinition 19 (Operad). Let $\\mathcal{P}$ be an algebraic pattern. An $\\mathcal{P}$-operad is a functor \\[ p \\colon \\mathcal{O} \\to \\mathcal{P} \\] with the algebraic pattern structure lifted from $\\mathcal{P}$ such that:\n$\\mathcal{O}$ has $p$-coCartesian lifts of inert morphisms in $\\mathcal{P}$. For $P \\in \\mathcal{P}$, let $\\mathcal{O}_{P}$ denote the fiber of $P$. For $X \\in \\mathcal{O}_{P}$, if \\[ \\xi \\colon \\left( \\mathcal{P}_{P/}^{\\text{el}} \\right)^{\\lhd} \\to \\mathcal{C} \\] is a diagram of coCartesian morphisms over the object of $\\mathcal{P}_{P/}^{\\text{el}}$, then for $Y \\in \\mathcal{O}_{P'}$, the commutative square is Cartesian. 3. The functor \\[ \\mathcal{O}_{P} \\to \\underset{O \\in \\mathcal{P}_{P/}^{\\text{el}}}{\\operatorname{lim}}\\, \\mathcal{O}_{O} \\] is an equivalence.\nWe refer to $\\mathsf{Op}(\\mathcal{P})$ as the category of $\\mathcal{P}$-operads and functors over $\\mathcal{P}$ that preserve inert coCartesian morphisms.\nRemark. When we consider the category (without algebraic pattern structure) of a $\\mathcal{P}$-operad $\\mathcal{O}$, we will denote it as $\\mathcal{O}^{\\otimes}$. Example 20 (Operad). $\\mathsf{Comm}$-operad is precisely the operad in the sense of [HA, Definition 2.1.1.10] . Unless specified otherwise, we will use the term “operad” to mean a $\\mathsf{Comm}$-operad and denote its category by $\\mathsf{Op}$. Example 21 (Generalized Operad). By Remark , one can consider $\\mathsf{Fin}_*^{\\natural}$-operad, which is precisely the generalized operad in the sense of [HA, Definition 2.3.2.1] . Unless specified otherwise, we will use the term “generalized operad” to mean a $\\mathsf{Fin}_*^{\\natural}$-operad and denote its category by $\\mathsf{Op}^{\\operatorname{gen}}$. Remark. Consider the inclusion \\[ \\mathsf{Op} \\subseteq \\mathsf{Op}^{\\operatorname{gen}}. \\] By [HA, Proposition 2.1.4.6] , [HA, Remark 2.3.2.4] , and [HTT, Proposition A.3.7.6] , one can find that both $\\mathsf{Op}$ and $\\mathsf{Op}^{\\operatorname{gen}}$ are presentable. And $\\mathsf{Op} \\hookrightarrow \\mathsf{Op}^{\\operatorname{gen}}$ preserves limits. Therefore, it admits a left adjoint \\[ \\operatorname{L}_{\\operatorname{gen}} \\colon \\mathsf{Op}^{\\operatorname{gen}} \\to \\mathsf{Op}. \\] Example 22 (Planar Operad). $\\mathsf{Assoc}$-operad is the planar operad in the sense of [HA, Definition 4.1.3.2] . Unless specified otherwise, we will use the term “planar operad” to mean a $\\mathsf{Assoc}$-operad and denote its category by $\\mathsf{Op}^{\\operatorname{ns}}$. If \\[ f \\colon \\mathcal{O} \\to \\mathcal{P} \\] is a functor between algebraic patterns that preserves the factorization system and elementary objects, and moreover, the induced functor \\[ \\mathcal{O}_{X/}^{\\text{el}} \\to \\mathcal{P}_{f(X)/}^{\\text{el}} \\] is initial, that is, let $F \\colon \\mathcal{P}_{f(X)/}^{\\text{el}} \\to \\mathcal{C}$, then \\[ \\operatorname{lim} F \\simeq \\operatorname{lim} F \\circ f. \\] Then the pullback functor \\[ f^* \\colon \\mathsf{Op}(\\mathcal{P}) \\to \\mathsf{Op}(\\mathcal{O}) \\] admits a left adjoint under mild assumptions.\nExample 23 (Cut). Define a functor \\[ \\operatorname{Cut} \\colon \\Delta^{\\operatorname{op}} \\to \\mathsf{Fin}_* \\] that takes $[n]$ to $\\langle n \\rangle$ and a morphism $\\varphi \\colon [n] \\to [m]$ in $\\Delta$ to the map \\[ \\operatorname{Cut}(\\varphi) \\colon \\langle m \\rangle \\to \\langle n \\rangle \\] given by \\[ \\operatorname{Cut}(\\varphi)(i) = \\begin{cases} j, \u0026 \\varphi(j-1) \u003c i \\leq \\varphi(j), \\\\ 0, \u0026 \\text{otherwise}. \\end{cases} \\] Pulling back along this gives a functor \\[ \\mathsf{Op} \\to \\mathsf{Op}^{\\operatorname{ns}} \\] that informally “forgets symmetric group actions”. Its left adjoint is a “symmetrization” functor \\[ \\mathsf{Op}^{\\operatorname{ns}} \\to \\mathsf{Op}. \\] In fact, [BHS24, Theorem 5.1.1] proves a comparison result that gives conditions for certain functors as above to induce equivalences.\nLet us examine the structure of a $\\mathsf{Comm}$-operad $\\mathcal{O}$ in more detail. We refer to the fiber \\[ \\mathcal{O}_{\\langle 1 \\rangle} \\coloneqq p^{-1}(\\langle 1 \\rangle) \\] as the underlying category of the operad $\\mathcal{O}$. We denote its groupoid core by \\[ \\mathcal{O}^{\\simeq} \\coloneqq \\left(\\mathcal{O}_{\\langle 1 \\rangle}^{\\otimes}\\right) \\] and refer to it as the anima of colors of $\\mathcal{O}$.\nFor $\\langle n \\rangle \\in \\mathsf{Fin}_*$, condition~(3) guarantees that every object in $\\mathcal{O}_{I}^{\\otimes}$ may be uniquely written as a product \\[ \\prod_{i \\in I} x_i \\] for some colors $x_i \\in \\mathcal{O}^{\\simeq}$. We also denote such a product as an unordered tuple $\\{x_i\\}_{i \\in I}$.\nGiven another color $y \\in \\mathcal{O}^{\\simeq}$, we define the anima of multimorphisms (or anima of operations) in $\\mathcal{O}$ from $\\{x_i\\}_{i \\in I}$ to $y$ as the anima of morphisms in $\\mathcal{O}^{\\otimes}$ that map to the active morphism $\\langle n \\rangle \\to \\langle 1 \\rangle$: A multimorphism in an operad $\\mathcal{O}$ represents an abstract operation with multiple inputs. When interpreted in a symmetric monoidal category $\\mathcal{C}$, this corresponds to a morphism of the form \\[ x_1 \\otimes \\cdots \\otimes x_n \\to y. \\]At the end of this section, we will give the notion weakly enrichment.\nDefinition 24. Let $\\mathcal{C} \\to \\mathsf{Assoc}$ be a planar operad, and let $\\mathcal{M}$ be a category. We say $\\mathcal{M}$ is weakly enriched over $\\mathcal{C}$ if there exists a $\\mathsf{LM}$-operad $\\mathcal{O}$ such that \\[ \\mathcal{O}_{\\mathfrak{a}}^{\\otimes} \\simeq \\mathcal{C} \\quad\\text{and}\\quad \\mathcal{O}_{\\mathfrak{m}}^{\\otimes} \\simeq \\mathcal{M}. \\] $\\mathcal{O}$-Monoidal Category And $\\mathcal{O}$-Algebra In this section, we will consider $\\mathcal{O}$-monoidal category and $\\mathcal{O}$-algebra for some algebraic pattern $\\mathcal{O}$.\nBy the discussion above, it is suitable to consider algebraic objects in the Cartesian setting.\nDefinition 25 (Cartesian pattern). A Cartesian pattern is an algebraic pattern $\\mathcal{O}$ equipped with a morphism of algebraic patterns \\[ |-| \\colon \\mathcal{O} \\to \\mathsf{Comm} \\] such that for every $O \\in \\mathcal{O}$, the induced functor \\[ \\mathcal{O}_{O/}^{\\text{el}} \\to \\mathsf{Comm}_{|O|/}^{\\text{el}} \\] is an equivalence.\nRemark. All of the examples we considered before are Cartesian patterns. Now, one can define the $\\mathcal{O}$-monoidal categories and $\\mathcal{O}$-algebras in them.\nDefinition 26. Let $\\mathcal{O}$ be a Cartesian pattern. An $\\mathcal{O}$-monoidal category is a coCartesian fibration \\[ p_{\\mathcal{C}} \\colon \\mathcal{C}^{\\otimes} \\to \\mathcal{O} \\] whose associated functor $\\mathcal{O} \\to \\mathsf{Cat}$ is an $\\mathcal{O}$-Segal object.\nRemark. One can find that every $\\mathcal{O}$-monoidal category is an $\\mathcal{O}$-operad, if we lift the algebraic pattern structure along $p_{\\mathcal{C}}$. Definition 27. Let $\\mathcal{O}$ be a Cartesian pattern and $\\mathcal{V}^{\\otimes}$, $\\mathcal{W}^{\\otimes}$ be $\\mathcal{O}$-monoidal categories. A lax $\\mathcal{O}$-monoidal functor between them is a commutative triangle\nsuch that $F$ preserves inert morphisms. Equivalently, a lax $\\mathcal{O}$-monoidal functor is a morphism of algebraic patterns over $\\mathcal{O}$.\nIf the functor $F \\colon \\mathcal{V}^{\\otimes} \\to \\mathcal{W}^{\\otimes}$ preserves all coCartesian morphisms over $\\mathcal{O}$, we call it an $\\mathcal{O}$-monoidal functor.\nExample 28. A monoidal category is a $\\mathsf{Assoc}$-monoidal category $\\mathcal{C}^{\\otimes}$. We will denote the image of $[1]$ by $\\mathbb{1}_{\\mathcal{C}}$ and refer to it as the unit of the monoidal structure. We also let $\\mathcal{C}$ denote the fiber of $[1]$. In this context, $\\mathcal{C}^{\\otimes}$ will be referred to as the monoidal structure on $\\mathcal{C}$. By Example 16 , the active morphism $[2] \\to [1]$ in $\\mathsf{Assoc}$ corresponds to a functor \\[ -\\otimes- \\colon \\mathcal{C} \\times \\mathcal{C} \\to \\mathcal{C}, \\] which we will refer to as the tensor product functor.\nExample 29. A symmetric monoidal category is a $\\mathsf{Comm}$-monoidal category $\\mathcal{C}^{\\otimes}$. We will denote the image of $\\langle 1 \\rangle$ by $\\mathbb{1}_{\\mathcal{C}}$ and refer to it as the unit of the monoidal structure. We also let $\\mathcal{C}$ denote the fiber of $\\langle 1 \\rangle$. In this context, $\\mathcal{C}^{\\otimes}$ will be referred to as the symmetric monoidal structure on $\\mathcal{C}$. By Example 15 , the active morphism $\\langle 2 \\rangle \\to \\langle 1 \\rangle$ corresponds to a functor \\[ -\\otimes- \\colon \\mathcal{C} \\times \\mathcal{C} \\to \\mathcal{C}, \\] which we will refer to as the tensor product functor.\nLet $X \\colon \\mathsf{LM} \\to \\mathsf{Cat}$ be a $\\mathsf{LM}$-monoidal category. Using Grothendieck–Lurie construction, one can get a coCartesian fibration \\[ p \\colon \\mathcal{O} \\to \\mathsf{LM}. \\] Let $\\mathcal{O}_{\\mathfrak{a}}$ and $\\mathcal{O}_{\\mathfrak{m}}$ be the fiber of $\\mathfrak{a}$ and $\\mathfrak{m}$, respectively. One can imply the existence of the following structures:\nThe fiber $\\mathcal{O}_{\\mathfrak{a}}$ is a monoidal category. The fiber $\\mathcal{O}_{\\mathfrak{m}}$ is a category that is a left module over $\\mathcal{O}_{\\mathfrak{a}}$, meaning there is an action functor \\[ \\otimes \\colon \\mathcal{O}_{\\mathfrak{a}} \\times \\mathcal{O}_{\\mathfrak{m}} \\to \\mathcal{O}_{\\mathfrak{m}} \\] which is well-defined up to homotopy. Definition 30. Let $\\mathcal{C}$ be a monoidal category. We say a category $\\mathcal{M}$ is $\\mathcal{C}$-linear if there exists an $\\mathsf{LM}$-Segal object in $\\mathsf{Cat}$ given by a coCartesian fibration \\[ p \\colon \\mathcal{O} \\to \\mathsf{LM} \\] satisfying the following two properties:\n$\\mathcal{O}_{\\mathfrak{a}} \\simeq \\mathcal{C}$; $\\mathcal{O}_{\\mathfrak{m}} \\simeq \\mathcal{M}$. Remark. One can find that if $\\mathcal{M}$ is linear over $\\mathcal{C}$, then $\\mathcal{M}$ is weakly enriched over $\\mathcal{C}$. Example 31. For every category $\\mathcal{C}$, $\\mathcal{C}$ can be regarded as a $\\mathsf{Fun}(\\mathcal{C},\\mathcal{C})$-linear category (where the monoidal structure is composition). The action is given by \\[ (F,c) \\mapsto F(c). \\] The required higher coherence data is provided by the natural associativity of functor composition.\nExample 32. For any pair of categories $\\mathcal{C}$ and $\\mathcal{D}$, the category $\\mathsf{Fun}(\\mathcal{C},\\mathcal{D})$ can be regarded as being left tensored over the monoidal category $\\mathsf{Fun}(\\mathcal{C},\\mathcal{C})$ (where the monoidal structure is composition). The action is given by precomposition: \\[ \\otimes \\colon \\mathsf{Fun}(\\mathcal{C},\\mathcal{C}) \\times \\mathsf{Fun}(\\mathcal{C},\\mathcal{D}) \\to \\mathsf{Fun}(\\mathcal{C},\\mathcal{D}), \\quad (T,G) \\mapsto G \\circ T. \\] The required higher coherence data is provided by the natural associativity of functor composition.\nNow, we define the algebra object in a $\\mathcal{O}$-monoidal category $\\mathcal{C}$.\nDefinition 33. Let $\\mathcal{P}$ and $\\mathcal{P}'$ be Cartesian patterns with a morphism \\[ f \\colon \\mathcal{P} \\to \\mathcal{P}' \\] over $\\mathsf{Comm}$ and let $\\mathcal{O}$ be a $\\mathcal{P}$-operad. An $\\mathcal{O}$-algebra in $\\mathcal{O}$ is a commutative triangle\nsuch that $A$ takes inert morphisms in $\\mathcal{P}$ to coCartesian morphisms in $\\mathcal{O}$. We write $\\mathsf{Alg}_{\\mathcal{P}/\\mathcal{P}'}(\\mathcal{O})$ for the full subcategory of $\\mathsf{Fun}_{/\\mathcal{P}'}(\\mathcal{P},\\mathcal{O})$ spanned by the $\\mathcal{P}$-algebras. If $f = \\operatorname{id}_{\\mathcal{P}'}$, we will denote $\\mathsf{Alg}_{\\mathcal{P}/\\mathcal{P}'}(\\mathcal{O})$ by $\\mathsf{Alg}_{/\\mathcal{P}'}(\\mathcal{C})$. If $\\mathcal{P}' = \\mathsf{Comm}$, then we will omit $\\mathcal{P}'$ in $\\mathsf{Alg}_{\\mathcal{P}/\\mathcal{P}'}(\\mathcal{O})$.\nMoreover, if $\\mathcal{O} = \\mathcal{C}^{\\otimes}$ is a $\\mathcal{P}'$-monoidal category, then we will omit the notation $\\otimes$ in $\\mathsf{Alg}_{\\mathcal{P}/\\mathcal{P}'}(\\mathcal{C}^{\\otimes})$.\nExample 34. Let $\\mathcal{C}^{\\otimes}$ be a symmetric monoidal category. Consider the morphism \\[ |-| \\colon \\mathsf{Trivial} \\to \\mathsf{Comm} \\] sending $*$ to the elementary object $\\langle 1 \\rangle$. Then, $\\mathsf{Trivial}$-algebra in $\\mathcal{C}^{\\otimes}$ is just an object in \\[ \\mathcal{C} \\simeq \\mathcal{C}_{\\langle 1 \\rangle}^{\\otimes}. \\] Now, let $\\mathcal{P} = \\mathsf{Comm}$, we try to describe what an $\\mathcal{O}$-algebra is in a symmetric monoidal category $\\mathcal{C}$.\nDefinition 35. Let $\\mathcal{O}$ be an operad. Then:\n$\\mathsf{Comm}$-algebra in $\\mathcal{O}$ is called commutative algebra in $\\mathcal{O}$, and we denote $\\mathsf{Alg}_{\\mathsf{Comm}}(\\mathcal{O})$ by $\\mathsf{CAlg}(\\mathcal{O})$. $\\mathsf{Assoc}$-algebra in $\\mathcal{O}$ is called associative algebra in $\\mathcal{O}$, and we denote $\\mathsf{Alg}_{\\mathsf{Assoc}}(\\mathcal{O})$ by $\\mathsf{Alg}(\\mathcal{O})$. $\\mathsf{CM}$-algebra in $\\mathcal{O}$ is called modules over commutative algebra in $\\mathcal{O}$, and we denote $\\mathsf{Alg}_{\\mathsf{CM}}(\\mathcal{O})$ by $\\mathsf{Mod}(\\mathcal{O})$. $\\mathsf{LM}$-algebra in $\\mathcal{O}$ is called left modules in $\\mathcal{O}$, and we denote $\\mathsf{Alg}_{\\mathsf{LM}}(\\mathcal{O})$ by $\\mathsf{LMod}(\\mathcal{O})$. $\\mathsf{BM}$-algebra in $\\mathcal{O}$ is called bimodule in $\\mathcal{O}$, and we denote $\\mathsf{Alg}_{\\mathsf{BM}}(\\mathcal{O})$ by $\\mathsf{BMod}(\\mathcal{O})$. Remark. By Remark , one can also use $\\mathsf{LM}$ to define right modules in $\\mathcal{O}$ (in this case, we will use $\\mathsf{RM}$ to denote $\\mathsf{LM}$) and use \\[ \\mathsf{RMod}(\\mathcal{O}) \\coloneqq \\mathsf{Alg}_{\\mathsf{RM}}(\\mathcal{O}) \\] to denote the category of right modules.\nDefinition 36. Let $\\mathcal{C}$ be a monoidal category and let \\[ q \\colon \\mathcal{O} \\to \\mathsf{LM} \\] exhibit $\\mathcal{M}$ weakly enriched over $\\mathcal{C}$. We let $\\mathsf{LMod}(\\mathcal{M})$ denote the category $\\mathsf{Alg}_{/\\mathsf{LM}}(\\mathcal{O})$. We will refer to $\\mathsf{LMod}(\\mathcal{M})$ as the category of left module objects of $\\mathcal{M}$. If $A$ is an associative algebra in $\\mathcal{C}$, we let $\\mathsf{LMod}_A(\\mathcal{M})$ denote the pullback\nRemark. One can analogously define $\\mathsf{Mod}_A$, $\\mathsf{RMod}_A$, and $_B\\mathsf{BMod}_A$ as pullbacks. References [CH21] Hongyi\u0026nbsp;Chu and Rune\u0026nbsp;Haugseng. Homotopy-coherent algebra via Segal conditions. Advances in Mathematics 385, 2021. DOI. [Cno25] Bastiaan\u0026nbsp;Cnossen. An ∞-categorical introduction to Stable Homotopy Theory and Higher Algebra. 2025. PDF. [HA] Jacob\u0026nbsp;Lurie. Higher Algebra. 2017. PDF. [HTT] Jacob\u0026nbsp;Lurie. Higher Topos Theory. Princeton University Press, 2009. PDF. [BHS24] Shaul\u0026nbsp;Barkan, Rune\u0026nbsp;Haugseng, and Jan\u0026nbsp;Steinebrunner. Envelopes for Algebraic Patterns. arXiv:2208.07183, 2024. arXiv. ","permalink":"https://ou-liu-red-sugar.github.io/en/notes/basic-concepts-on-higher-algebra/","summary":"\u003ch2 id=\"algebraic-pattern\"\u003eAlgebraic Pattern\u003c/h2\u003e\n\u003cp\u003eAlgebraic pattern is a blueprint for a notion of functors on a fixed category satisfying a Segal condition, suitable for formalizing homotopy-coherent algebra in the Cartesian setting.\u003c/p\u003e\n\u003cp\u003eInformally, algebraic pattern generalizes the active and inert morphisms in operads and chooses certain objects to control the Segal condition.\u003c/p\u003e\n\u003cdiv class=\"thm-block kind-definition\" id=\"main-1\"\u003e\n    \u003cdiv class=\"thm-header\"\u003e\n      \u003cspan class=\"thm-title\"\u003e\n        Definition 1.\n      \u003c/span\u003e\n    \u003c/div\u003e\n    \u003cdiv class=\"thm-body\"\u003e\u003cp\u003eAn \u003cem\u003ealgebraic pattern\u003c/em\u003e is a category $\\mathcal{O}$ equipped with:\u003c/p\u003e\n\u003col\u003e\n\u003cli\u003eA collection of objects called \u003cem\u003eelementary objects\u003c/em\u003e.\u003c/li\u003e\n\u003cli\u003eA factorization system $(\\mathcal{O}^{\\text{inv}}, \\mathcal{O}^{\\text{act}})$ where every morphism factors uniquely (up to equivalence) as an \u003cem\u003einert\u003c/em\u003e morphism followed by an \u003cem\u003eactive\u003c/em\u003e morphism.\u003c/li\u003e\n\u003c/ol\u003e\n\u003cp\u003eWe let $\\mathcal{O}^{\\mathrm{el}}$ denote the full subcategory of $\\mathcal{O}$ spanned by the elementary objects and the inert morphisms between them. For any object $X \\in \\mathcal{O}$, we also write\n\u003c/p\u003e","title":"Basic Concepts on Higher Algebra"},{"content":" This is a public research summary of a framework under live testing. It contains no portfolio recommendations or account-level implementation. Nothing here is financial advice.\nFundamental analysis as translation The difficult first step in fundamental analysis is often not calculation. It is translating events, context, and business narratives into variables that can be observed, compared, and revised.\n“Competition is getting worse,” for example, is not yet an input. It may imply pricing pressure, market-share loss, weaker retention, higher acquisition cost, margin compression, greater capital requirements, or a lower valuation multiple. Those possibilities have different evidence and different consequences.\nA useful translation therefore asks:\nWhat changed in the world or in the business? Through which operating driver could that change affect results? What evidence would reveal the effect? Over what time horizon should it become visible? What alternative explanation could produce the same observation? The quality of later valuation cannot repair a poor translation at the beginning.\nRisk-Reward as scenario compression Risk-Reward compresses a larger body of research into a small set of decision-relevant scenarios, usually Bull, Base, and Bear. Each scenario connects the business model, operating drivers, dependencies, risk paths, plausible outcomes, and a valuation range.\nThe scenarios are not three arbitrary growth rates. They should represent different causal paths. Their purpose is to expose which assumptions produce which outcomes and where present price sits relative to that range.\nProbability enters only after the scenarios are coherent enough to deserve it. A numerical probability attached to a vague narrative creates an appearance of precision without improving the model.\nAgentic R-D-G as an updateable structure Agentic R-D-G, or Agentic R/D Graph, is the working structure used to connect research over time. It organizes events, operating drivers, dependencies, risk paths, scenario prices, and the evidence that updates them.\nNew evidence should change a specific node, relationship, scenario assumption, or probability rather than merely replacing one story with another.\nAI can assist with evidence gathering, comparison, counterarguments, and maintaining the graph. It does not supply accountability: the investor remains responsible for defining the question, judging source quality, choosing uncertainty, and making the decision.\nConnection to probability and decisions Once narratives have been translated and scenarios structured, the framework can connect to the language of probability and risk:\nscenarios form a practical state space; valuation outcomes become a distribution rather than a single target; confidence can be recorded and calibrated; risk exposure can be compared with prospective reward; decisions can include sizing, waiting, or taking no action. This is not an attempt to turn company research into a perfectly specified mathematical model or an automatic order generator. It is a way to make qualitative judgment explicit enough to inspect, update, and connect to risk management.\nWhat live testing is meant to learn The current test is not simply whether a position makes money. It asks whether the framework identifies important variables, separates drivers from symptoms, responds coherently to evidence, improves uncertainty handling, reduces unstructured reactions, and makes mistakes legible enough to revise the process.\nThe framework remains provisional. Public updates will focus on changes to method and research structure; detailed trades, forecast logs, and positions remain private.\n","permalink":"https://ou-liu-red-sugar.github.io/en/invest/framework/","summary":"\u003cblockquote\u003e\n\u003cp\u003eThis is a public research summary of a framework under live testing. It contains no portfolio recommendations or account-level implementation. Nothing here is financial advice.\u003c/p\u003e\n\u003c/blockquote\u003e\n\u003ch2 id=\"fundamental-analysis-as-translation\"\u003eFundamental analysis as translation\u003c/h2\u003e\n\u003cp\u003eThe difficult first step in fundamental analysis is often not calculation. It is translating events, context, and business narratives into variables that can be observed, compared, and revised.\u003c/p\u003e\n\u003cp\u003e“Competition is getting worse,” for example, is not yet an input. It may imply pricing pressure, market-share loss, weaker retention, higher acquisition cost, margin compression, greater capital requirements, or a lower valuation multiple. Those possibilities have different evidence and different consequences.\u003c/p\u003e","title":"Framework"},{"content":" Status: This is a current working protocol, not a mature strategy declaration. It is being tested in live practice and will change when evidence shows that it should.\nThe public version describes method and high-level review. Detailed trades, positions, and account data remain private. Nothing here is financial advice.\n1. Purpose and scope The protocol is designed for low-frequency, months-to-years investing. Its purpose is to make research and decisions more explainable, comparable, and revisable while keeping investing within a sustainable work-and-life boundary.\nThe framework is evaluated by process questions rather than short-term returns alone:\nWere events and narratives translated into the right variables? Were the main operating drivers and dependencies identified? Were scenarios meaningfully different rather than cosmetic variations? Was uncertainty stated before the outcome became known? Did new evidence update the structure in a disciplined way? 2. Current constraints These are working constraints intended to limit avoidable risk while the framework is still being tested:\nno leverage and no high-frequency trading; low action when expected return or uncertainty cannot be explained; no change to a long-term thesis solely because of short-term price movement; technical signals may inform execution, but do not create the fundamental thesis; complexity must earn its place by improving a decision or exposing an assumption; taking no position is always an admissible outcome. These constraints are defaults, not evidence that the process has been validated.\n3. Research architecture The current architecture has three connected layers. A fuller public summary is available in Framework.\n3.1 Translation Fundamental analysis begins before valuation. An event such as deteriorating competition is not yet a model input; it must be translated into variables such as pricing pressure, market-share change, retention, margin compression, capital intensity, or a lower valuation multiple.\nThe first question is therefore not “which formula should I use?” but “what would have to change in the business for this narrative to be true?”\n3.2 Risk-Reward scenarios Business model, operating drivers, risks, and valuation are compressed into Bull, Base, and Bear scenarios. Each scenario should state its distinguishing assumptions, the implied operating path, a valuation range, and evidence that would move probability toward or away from it.\nScenarios are decision objects, not predictions presented with certainty.\n3.3 Agentic R-D-G Agentic R-D-G organizes events, operating drivers, dependencies, risk paths, and scenario prices into a structure that can be updated as evidence arrives. The aim is to make the path from qualitative research to probability, distribution, risk exposure, and decision visible enough to inspect.\nIt is not an automatic trading system. AI may help gather evidence, challenge assumptions, and maintain structure, but responsibility for interpretation and risk decisions remains human.\n4. Research and decision cycle For a new or revised thesis:\nDefine the question and the decision it could affect. Map the business model, key drivers, dependencies, and risk paths. Translate important narratives into observable variables. Build Bull, Base, and Bear scenarios with valuation ranges. Record confidence, a review date, verification sources, and falsification conditions. Compare the opportunity with realistic alternatives, including near-riskless yield and no action. If action is justified, keep implementation consistent with uncertainty. Review the thesis when scheduled evidence or a defined trigger arrives. The public record emphasizes steps 1-6 and 8. Step 7 and account-level implementation remain private.\n5. Uncertainty review Substantive forecasts should be written so that later review is possible. A useful private record includes a clear proposition, a confidence level chosen before resolution, a deadline or review date, a verification source, and observations that would count as disconfirmation.\nThe public site keeps this at the level of method and framework changes. Detailed forecast logs remain local.\n6. Updating rules New evidence can change different parts of the structure:\nan event may alter a driver without invalidating the business model; a driver may change the scenario range; a risk path may change scenario probabilities; a price change may alter prospective return without changing the business thesis; repeated review error may require changing the framework itself. Updates should identify which layer changed and why. A new opinion is not enough; the changed variable, relationship, probability, or decision threshold should be visible.\n7. Attention boundary Research is done in bounded windows rather than through always-on monitoring. Review frequency should follow the information cadence of the thesis, not the emotional cadence of the market.\nIf investing begins to crowd out broader work, learning, health, or relationships, reduce its frequency and scope. Attention is part of risk management.\n8. Public and private records The public lab contains framework summaries, methodology notes, and high-level review structure. Exact positions, trade records, forecast logs, cost bases, orders, and account-level exposure remain private.\nThe older Log, Lessons, and Monthly Reviews are retained as historical records. They may reflect earlier versions of the framework, including rules and assumptions that are no longer current. They should be read as dated evidence of iteration, not as presently binding instructions.\n9. Version note This protocol replaces the earlier “playbook as constitution” framing. The current emphasis is on translation, scenario construction, explicit uncertainty, review discipline, and structured updating. Version changes will be recorded when live testing produces a meaningful change in method, not merely when wording is edited.\n","permalink":"https://ou-liu-red-sugar.github.io/en/invest/playbook/","summary":"\u003cblockquote\u003e\n\u003cp\u003e\u003cstrong\u003eStatus:\u003c/strong\u003e This is a current working protocol, not a mature strategy declaration. It is being tested in live practice and will change when evidence shows that it should.\u003c/p\u003e\n\u003cp\u003eThe public version describes method and high-level review. Detailed trades, positions, and account data remain private. Nothing here is financial advice.\u003c/p\u003e\n\u003c/blockquote\u003e\n\u003chr\u003e\n\u003ch2 id=\"1-purpose-and-scope\"\u003e1. Purpose and scope\u003c/h2\u003e\n\u003cp\u003eThe protocol is designed for low-frequency, months-to-years investing. Its purpose is to make research and decisions more explainable, comparable, and revisable while keeping investing within a sustainable work-and-life boundary.\u003c/p\u003e","title":"Working Protocol"},{"content":"Built bottom-up from actual experience + verified knowledge, NOT aspiration. Buffett\u0026rsquo;s \u0026ldquo;20-punch card\u0026rdquo; idea: out-of-circle names should be fast-skipped — don\u0026rsquo;t consume attention budget on them.\nTrigger mechanism: when a sector / industry is mentioned in conversation, auto-check this file:\nIn-circle → full thesis analysis + Interconnections framework Edge of circle → explicitly tag \u0026ldquo;learning area, apply Interconnections cautiously + open questions\u0026rdquo; Out-of-circle → fast-skip, suggest stay out Status: Starter version 2026-05-18, awaiting review + ongoing expansion.\nIn-circle (Strong edge — full thesis authority) AI hands-on capability assessment Edge source: Deep first-hand use of mainstream AI tools → can judge whether the market is over-optimistic about AI\u0026rsquo;s actual deployment capability Confirmed applications: ACN AI-substitution thesis skepticism (based on real AI consulting capability assessment, judge that AI cannot capture 30–40% share) DUOL DET application-rate read (AI substitute/augment in language-learning context) SPGI AI-threat-narrative-mispriced judgment (field research, SP500 corporate governance ratings, etc. — AI cannot do these) Limits: Not in-circle on AI model architecture / training economics Language learning consumer apps Edge source: DET as first-hand test taker + DUOL as user Confirmed applications: DUOL DET strategic role analysis (brand pawn, not standalone revenue) Limits: K12 education / corporate training are out-of-circle Mag 7 cross-comparison (relative risk positioning) Edge source: Continuous tracking + Interconnections framework applied along the AI vector Confirmed applications: AMZN → MSFT swap (within Mag 7, MSFT carries the lowest AI-exposure risk); GOOG/META capital-allocation relative positioning Limits: Deep operational analysis of a single Mag 7 company (e.g., Azure margin breakdown) is edge-of-circle Edge of circle (Learning — apply Interconnections cautiously) US Defense sector Status: 2026-05-17 LDOS 5-round research established the faction + ultimate-beneficiary + EO discretionary-buyback framework Open questions: ITA basket economics vs single-name picking Does CACI\u0026rsquo;s premium valuation reflect a faction advantage (vs LDOS being mispriced)? PLTR / AXON / Booz / SAIC relative faction positioning Promote criteria: Complete ≥ 2 defense-name comparative studies + 1 government-budget cycle tracked US Telecom (incumbent carriers) Status: 2026-05-18 VZ research established cable MVNO threat + FWA + capex cycle second-order library Open questions: TMUS upgrade path vs VZ / T defense Long-term equilibrium cable wireless share (will 45% → 50%+ stop somewhere?) Timing of the 6G capex cycle and its FCF impact Promote criteria: Complete 1 cycle tracked + 1 TMUS vs T comparative study Financial data infrastructure Status: Hold SPGI + V + IBKR + AXP, but the thesis rests more on \u0026ldquo;upstream/downstream + defensive\u0026rdquo; than on a deep sector model Open questions: SPGI ratings business vs index business vs Platts data business — relative growth drivers V vs MA fee-structure differences under new payment rails (RTP, stablecoin) and how they evolve Promote criteria: Complete SPGI three-segment analysis + detailed V/MA comparison AI-power / data center electricity (IPP) Status: 2026-05 TLN hold + sell crystallized the framework \u0026ldquo;AI-power is a component of the AI bubble\u0026rdquo; Edge source: AI hands-on edge → recognize AI-power narrative as an extension of the AI bubble (not an independent utility thesis) Current view: Short-term bearish — pure AI-capex beneficiary, AI-bubble-late-stage priced-in, high leverage amplifies downside Long-term: Uncertain — depends on whether AI genuinely produces new incremental demand (vs converting existing demand) → after AI-capex peaks, the IPP investment logic will reset Representative names: TLN (sold), VST, CEG, and similar nuclear / IPP names with hyperscaler PPAs Open questions: Real economics of PPA structures with hyperscaler long-term contracts Nuclear regulatory path (Three Mile Island restart, SMR rollout) IPP leverage sensitivity through rate-hike cycles (the TLN case is the lesson) Promote criteria: Wait for AI-bubble situation to clarify / complete VST + CEG + TLN three-IPP comparative study Out-of-circle (Fast-skip — do not form a thesis) Sectors / strategies explicitly not participated in:\nBiotech / pharma early-stage — FDA approval / pipeline probabilities not reliably estimable Semis manufacturing process detail — TSMC / Samsung fab process minutiae (different from NVDA application-layer judgment) Early startup / VC private — not participated in Forex trading — not a thesis-driven school Crypto / digital assets — not participated in (unless KB is recalibrated) Commodities active trading (not the GLDM fiat-debasement long-term thesis hedge) — not participated in Options / derivatives strategies — not participated in (holdings only simple equity + ETF) Distressed / bankruptcy restructuring — Klarman 1980s style is not suited to the current environment Maintenance New sector library added → assess whether the sector belongs in-circle / edge / outside Quarterly review: should any edge-of-circle sectors be promoted / demoted? Hands-on experience (e.g., new product use, on-the-ground industry observation) → can push a sector up into the inner circle \u0026ldquo;I suddenly feel like looking at [out-of-circle sector]\u0026rdquo; → should trigger a discipline check: is real edge actually forming, or is this narrative-driven curiosity? ","permalink":"https://ou-liu-red-sugar.github.io/en/invest/circle-of-competence/","summary":"\u003cp\u003eBuilt bottom-up from \u003cstrong\u003eactual experience + verified knowledge\u003c/strong\u003e, NOT aspiration. Buffett\u0026rsquo;s \u0026ldquo;20-punch card\u0026rdquo; idea: out-of-circle names should be fast-skipped — don\u0026rsquo;t consume attention budget on them.\u003c/p\u003e\n\u003cp\u003e\u003cstrong\u003eTrigger mechanism\u003c/strong\u003e: when a sector / industry is mentioned in conversation, auto-check this file:\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003eIn-circle → full thesis analysis + Interconnections framework\u003c/li\u003e\n\u003cli\u003eEdge of circle → explicitly tag \u0026ldquo;learning area, apply Interconnections cautiously + open questions\u0026rdquo;\u003c/li\u003e\n\u003cli\u003eOut-of-circle → fast-skip, suggest stay out\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp\u003e\u003cstrong\u003eStatus\u003c/strong\u003e: Starter version 2026-05-18, awaiting review + ongoing expansion.\u003c/p\u003e","title":"Circle of Competence"},{"content":"Candidate pool — not held but in active monitoring. Append-only; on status change (Promoted / Dropped / Reset) move the entry to the Closed section at the bottom.\nTrigger mechanism: when a ticker is mentioned in conversation, silent-grep this file; on hit, load thesis stub + trigger conditions into reply context.\nActive candidates ACN — re-entry candidate Status: Monitoring price trigger Thesis stub: Market prices in AI capturing 30–40% of ACN consulting/IT services share; based on hands-on AI research I judge that take-rate is implausible → upside in ACN Trigger conditions: Primary: Price ≤ $150 Secondary: + empirical evidence on AI-in-consulting (is it actually substituting ACN-style services?) Layer signal at entry: build-up (NOT test-tier — prior conviction from previous hold) Sizing intent: TBD (based on EV at trigger time vs near-riskless) Next review: 2026-08-17 OR price trigger Date added: 2026-05-18 LDOS — deferred but monitored Status: Deferred (5-round research 2026-05-17 concluded defer, NOT refute) Thesis stub: FCF yield 10.4% + $48.4B backlog + Q1 BEAT real; but unfavorable political faction + EO discretionary buyback risk + Entrust integration overhang Re-trigger conditions (any one sufficient): Faction environment shift (Trump 2.0 broader vendor base shift) CACI materially de-rates (27x → 18x) — narrative crack signal Catalyst-driven re-rate (hyperscaler grid contract / specific Pentagon endorsement) Price drop to $90-100 (Fwd PE 7-8x) for larger margin of safety Committee Green signal (broader regime shift) Layer signal at entry: test-tier (lower-conviction restart) Next review: 2026-08-17 OR re-trigger Date added: 2026-05-17 Closed (historical archive) (empty — Promoted / Dropped / Reset entries are moved here)\nMaintenance At quarterly review, check whether each active candidate\u0026rsquo;s trigger conditions are still valid; stale trigger → Reset New candidates must include: thesis stub + trigger conditions + Layer signal at entry + next review date + evidence that the Interconnections framework has been applied Reject / Drop reason must be explicit (e.g., \u0026ldquo;thesis weakened by X\u0026rdquo; / \u0026ldquo;better alternative available\u0026rdquo;) ","permalink":"https://ou-liu-red-sugar.github.io/en/invest/watchlist/","summary":"\u003cp\u003eCandidate pool — not held but in active monitoring. Append-only; on status change (Promoted / Dropped / Reset) move the entry to the Closed section at the bottom.\u003c/p\u003e\n\u003cp\u003e\u003cstrong\u003eTrigger mechanism\u003c/strong\u003e: when a ticker is mentioned in conversation, silent-grep this file; on hit, load thesis stub + trigger conditions into reply context.\u003c/p\u003e\n\u003chr\u003e\n\u003ch2 id=\"active-candidates\"\u003eActive candidates\u003c/h2\u003e\n\u003ch3 id=\"acn--re-entry-candidate\"\u003eACN — re-entry candidate\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e\u003cstrong\u003eStatus\u003c/strong\u003e: Monitoring price trigger\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eThesis stub\u003c/strong\u003e: Market prices in AI capturing 30–40% of ACN consulting/IT services share; based on hands-on AI research I judge that take-rate is implausible → upside in ACN\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eTrigger conditions\u003c/strong\u003e:\n\u003cul\u003e\n\u003cli\u003ePrimary: Price ≤ $150\u003c/li\u003e\n\u003cli\u003eSecondary: + empirical evidence on AI-in-consulting (is it actually substituting ACN-style services?)\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eLayer signal at entry\u003c/strong\u003e: build-up (NOT test-tier — prior conviction from previous hold)\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eSizing intent\u003c/strong\u003e: TBD (based on EV at trigger time vs near-riskless)\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eNext review\u003c/strong\u003e: 2026-08-17 OR price trigger\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eDate added\u003c/strong\u003e: 2026-05-18\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch3 id=\"ldos--deferred-but-monitored\"\u003eLDOS — deferred but monitored\u003c/h3\u003e\n\u003cul\u003e\n\u003cli\u003e\u003cstrong\u003eStatus\u003c/strong\u003e: Deferred (5-round research 2026-05-17 concluded defer, NOT refute)\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eThesis stub\u003c/strong\u003e: FCF yield 10.4% + $48.4B backlog + Q1 BEAT real; but unfavorable political faction + EO discretionary buyback risk + Entrust integration overhang\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eRe-trigger conditions\u003c/strong\u003e (any one sufficient):\n\u003col\u003e\n\u003cli\u003eFaction environment shift (Trump 2.0 broader vendor base shift)\u003c/li\u003e\n\u003cli\u003eCACI materially de-rates (27x → 18x) — narrative crack signal\u003c/li\u003e\n\u003cli\u003eCatalyst-driven re-rate (hyperscaler grid contract / specific Pentagon endorsement)\u003c/li\u003e\n\u003cli\u003ePrice drop to $90-100 (Fwd PE 7-8x) for larger margin of safety\u003c/li\u003e\n\u003cli\u003eCommittee Green signal (broader regime shift)\u003c/li\u003e\n\u003c/ol\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eLayer signal at entry\u003c/strong\u003e: test-tier (lower-conviction restart)\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eNext review\u003c/strong\u003e: 2026-08-17 OR re-trigger\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eDate added\u003c/strong\u003e: 2026-05-17\u003c/li\u003e\n\u003c/ul\u003e\n\u003chr\u003e\n\u003ch2 id=\"closed-historical-archive\"\u003eClosed (historical archive)\u003c/h2\u003e\n\u003cp\u003e(empty — Promoted / Dropped / Reset entries are moved here)\u003c/p\u003e","title":"Watchlist"},{"content":"This note is not part of the original lecture course; it grew out of discussions about understanding sheaf cohomology from a derived / animated perspective. The treatment follows Lurie\u0026rsquo;s Spectral Algebraic Geometry ([lurie-sag] ) and Mathew\u0026rsquo;s work on Galois groups in stable homotopy theory ([mathew-galois] ).\nConventions Throughout we work in the derived setting and drop the $\\mathrm{R}$-prefix on all functors. Concretely:\nAll limits, colimits, and tensor products are derived. The symbol $\\otimes$ denotes derived tensor product; the classical tensor product is recovered as $\\pi_0(- \\otimes -)$. $\\Gamma(X, \\mathcal{F})$ denotes derived global sections; the classical $\\Gamma$ is $H^0(X, \\mathcal{F}) \\coloneqq \\pi_0\\,\\Gamma(X, \\mathcal{F})$. $\\Hom_R(M, N)$ denotes derived $\\Hom$, so $\\operatorname{Ext}^i_R(M, N) = \\pi_{-i}\\Hom_R(M, N)$. $\\mathrm{Mod}_R$ denotes the $\\infty$-category of (left) module spectra over a connective $\\mathbb{E}_\\infty$-ring $R$ (equivalently, $\\mathsf{D}(R)$ when $R$ is discrete). Presheaves take values in a stable presentable category $\\mathcal{D}$ — typically $\\mathsf{D}(\\mathbb{Z})$, $\\mathsf{Sp}$, or $\\mathrm{Mod}_R$ for a base ring. The classical $1$-categorical theory is recovered by passing to $\\pi_0$ at the end.\nThe thesis: cohomology = sheafification + global sections The core observation is captured in a single line. For a scheme $X$ and a presheaf $\\mathcal{F} \\in \\mathrm{Fun}(\\mathsf{Sch}^{\\mathrm{op}}, \\mathcal{D})$, set \\[ \\boxed{\\,\\Gamma(X, \\mathcal{F}) \\coloneqq (L\\mathcal{F})(X),\\,} \\] where $L\\colon \\mathrm{PShv}(\\mathsf{Sch}, \\mathcal{D}) \\to \\mathrm{Shv}_\\tau(\\mathsf{Sch}, \\mathcal{D})$ is sheafification with respect to a Grothendieck topology $\\tau$ (we focus on the Zariski topology). All cohomological information about $\\mathcal{F}$ is packed into this single derived object. Three immediate consequences illustrate the formalism.\nMayer–Vietoris. For an open cover $X = U \\cup V$, the sheaf condition is exactly the fibre square Čech cohomology. For an open cover $\\mathfrak{U} = (U_i \\to X)_{i \\in I}$, write \\[ U_n \\coloneqq \\coprod_{(i_0, \\dots, i_n) \\in I^{n+1}} U_{i_0} \\cap \\cdots \\cap U_{i_n}. \\] The sheaf condition along $\\mathfrak{U}$ unfolds into the equivalence \\[ \\Gamma(X, \\mathcal{F}) \\xrightarrow{\\;\\sim\\;} \\lim_{[n] \\in \\mathbf{\\Delta}} \\Gamma(U_n, \\mathcal{F}). \\] We call the right-hand side the derived Čech complex of $\\mathfrak{U}$.\nPushforward and base change. For $f\\colon Y \\to X$, the pushforward $f_*\\colon \\mathrm{Shv}_\\tau(Y, \\mathcal{D}) \\to \\mathrm{Shv}_\\tau(X, \\mathcal{D})$ is determined by $\\Gamma(X, f_* \\mathcal{F}) \\simeq \\Gamma(Y, \\mathcal{F})$. Higher direct images are $H^i(X, f_*\\mathcal{F}) = \\pi_{-i} f_*\\mathcal{F}$ in the appropriate $t$-structure.\nThese are the standard cohomological tools, derived without spectral sequences, injective resolutions, or flabby/soft sheaves: everything is encoded in the sheaf condition together with the universal property of sheafification.\nRemark(Where classical Čech can fail). The classical naïve Čech complex of a cover is the cosimplicial abelian group $[n] \\mapsto H^0(U_n, \\mathcal{F})$ — the degree-zero truncation of $\\Gamma(U_n, \\mathcal{F})$. When some $\\Gamma(U_n, \\mathcal{F})$ has non-zero higher cohomology, this truncation drops information and naïve Čech cohomology disagrees with sheaf cohomology. We will see in the final section that the two agree precisely when each $\\Gamma(U_n, \\mathcal{F})$ is concentrated in degree zero. Quasi-coherent sheaves are sheaves For a scheme $X$, recall that the category of quasi-coherent modules is the limit \\[ \\mathrm{Mod}_X = \\lim_{(R,\\, x\\colon \\Spec(R) \\to X)} \\mathrm{Mod}_R \\] with derived base change as transition functors. For an $R$-module $M$, the associated presheaf on $\\mathrm{CAlg}_R$ is \\[ \\mathcal{F}_M\\colon \\mathrm{CAlg}_R \\to \\mathcal{D}, \\qquad A \\mapsto M \\otimes_R A. \\]The main theorem of this note is:\nTheorem 1 (Quasi-coherent modules are Zariski sheaves). For any ring $R$ and any $R$-module $M$, the presheaf $\\mathcal{F}_M$ is a Zariski sheaf on $\\mathrm{CAlg}_R$. Equivalently, $L\\mathcal{F}_M \\simeq \\mathcal{F}_M$, and consequently \\[ \\Gamma(\\Spec(R), \\mathcal{F}_M) \\simeq \\mathcal{F}_M(R) = M. \\] Since $M$ is concentrated in degree zero (for $M \\in \\mathrm{Mod}_R^{\\heartsuit}$), the higher cohomology vanishes:\nCorollary 2 (Affine cohomology vanishing). For an affine scheme $X = \\Spec(R)$ and a discrete quasi-coherent module $M$, \\[ H^i(X, \\mathcal{F}_M) = 0 \\quad \\text{for all } i \u003e 0. \\] The strategy for Theorem 1 is to establish the stronger statement that $\\mathcal{F}_M$ satisfies faithfully flat descent. This is the content of the next section, via Mathew\u0026rsquo;s framework of descendable algebras.\nFaithfully flat descent Throughout this section $\\mathcal{C}$ is a stable presentable symmetric monoidal category. In our application $\\mathcal{C} = \\mathrm{Mod}_R$.\nDescendable algebras Definition 3 (Thick tensor ideal). For $A \\in \\mathrm{CAlg}(\\mathcal{C})$, the thick tensor ideal generated by $A$, denoted $\\langle A \\rangle \\subset \\mathcal{C}$, is the smallest full subcategory containing $A$ and closed under finite (co)limits, retracts, and tensor products $- \\otimes X$ for arbitrary $X \\in \\mathcal{C}$. Definition 4 (Descendable algebra). $A \\in \\mathrm{CAlg}(\\mathcal{C})$ is descendable if $\\mathbf{1}_{\\mathcal{C}} \\in \\langle A \\rangle$.\n([mathew-galois, Def. 3.18] .)\nThe cobar construction associated to $A$ is the cosimplicial algebra \\[ A^{\\otimes \\bullet}\\colon \\mathbf{\\Delta} \\to \\mathrm{CAlg}(\\mathcal{C}), \\qquad [n] \\mapsto A^{\\otimes(n+1)}. \\] Definition 5 (Pro-constant cosimplicial object). A cosimplicial object $M^{\\bullet}\\colon \\mathbf{\\Delta} \\to \\mathcal{C}$ is pro-constant if its filtered diagram of partial totalisations \\[ n \\mapsto \\mathrm{Tot}_{\\le n}(M^{\\bullet}) \\coloneqq \\lim_{m \\in \\mathbf{\\Delta}_{\\le n}} M^m \\] is pro-equivalent (in $\\mathsf{Pro}(\\mathcal{C})$) to a constant pro-system.\nExample 6 (Split cosimplicial objects). If $M^{\\bullet}$ is split (admits a coaugmentation that is a section in homotopy at each level), then $\\mathrm{Tot}_{\\le n}(M^{\\bullet})$ stabilises for $n \\gg 0$, so $M^{\\bullet}$ is automatically pro-constant. Example 7 (Tensoring with pro-constants). In any stable symmetric monoidal category where $\\otimes$ preserves limits in each variable, tensoring with a pro-constant cosimplicial object remains pro-constant, and the limit commutes with the tensor: \\[ \\Big(\\lim_{\\mathbf{\\Delta}} M^{\\bullet}\\Big) \\otimes X \\simeq \\lim_{\\mathbf{\\Delta}} (M^{\\bullet} \\otimes X). \\] This is automatic for $\\mathcal{C} = \\mathrm{Mod}_R$, since $\\otimes_R$ is exact.\nTwo theorems of Mathew connect descendability with pro-constancy.\nTheorem 8 (Mathew). $A \\in \\mathrm{CAlg}(\\mathcal{C})$ is descendable iff the cobar $A^{\\otimes \\bullet}$ is pro-constant with limit $\\mathbf{1}_{\\mathcal{C}}$.\n([mathew-galois, Prop. 3.20] .)\nProof. ($\\Rightarrow$). Let $\\mathcal{X} \\subset \\mathcal{C}$ be the full subcategory of those $X$ such that $X \\otimes A^{\\otimes \\bullet}$ is pro-constant with limit $X$. Example 7 shows $\\mathcal{X}$ is closed under finite (co)limits, retracts, and tensor products. By Example 6 , $A \\in \\mathcal{X}$ — the cosimplicial object $A \\otimes A^{\\otimes \\bullet}$ is split via the obvious extra degeneracy. Hence $\\langle A \\rangle \\subset \\mathcal{X}$; in particular $\\mathbf{1} \\in \\mathcal{X}$.\n($\\Leftarrow$). If $A^{\\otimes \\bullet}$ is pro-constant with limit $\\mathbf{1}$, some $\\mathrm{Tot}_{\\le n}(A^{\\otimes \\bullet})$ admits $\\mathbf{1}$ as a retract. But $\\mathrm{Tot}_{\\le n}(A^{\\otimes \\bullet})$ is a finite limit of $A, A^{\\otimes 2}, \\dots$, hence lies in $\\langle A \\rangle$.\n$\\square$ Theorem 9 (Mathew). If $A \\in \\mathrm{CAlg}(\\mathcal{C})$ is descendable, then the canonical functor \\[ \\mathcal{C} \\xrightarrow{\\;\\sim\\;} \\lim_{\\mathbf{\\Delta}} \\mathrm{Mod}_{A^{\\otimes(\\bullet+1)}}(\\mathcal{C}) \\] is an equivalence.\n([mathew-galois, Thm. 3.26] .)\nProof. The adjunction $- \\otimes A\\colon \\mathcal{C} \\rightleftarrows \\mathrm{Mod}_A(\\mathcal{C}) \\colon F$ satisfies the Barr–Beck–Lurie criterion.\nConservativity of $- \\otimes A$. If $X \\otimes A \\simeq 0$, the subcategory $\\mathcal{Y} = \\{Y : X \\otimes Y \\simeq 0\\}$ contains $A$ and is closed under finite (co)limits, retracts, and tensor products, so $\\mathbf{1} \\in \\langle A \\rangle \\subset \\mathcal{Y}$, giving $X \\simeq 0$.\nLimit-exchange for split cosimplicial objects. Similar, via Example 7 and Theorem 8 .\n$\\square$ Faithfully flat maps are descendable We specialise to $\\mathcal{C} = \\mathrm{Mod}_R$ with $A = S$ for a connective ring map $R \\to S$.\nDefinition 10 (Flat / faithfully flat). A connective $R$-module $M$ is flat if $- \\otimes_R M$ is $t$-exact; equivalently, $\\pi_0 M$ is a flat $\\pi_0 R$-module and the canonical map $\\pi_n R \\otimes_{\\pi_0 R} \\pi_0 M \\to \\pi_n M$ is an isomorphism for every $n$.\nA connective ring map $R \\to S$ is faithfully flat if $S$ is a flat $R$-module and $\\pi_0 R \\to \\pi_0 S$ is faithfully flat in the classical sense (equivalently, $\\Spec \\pi_0 S \\to \\Spec \\pi_0 R$ is surjective).\nThe technical engine is a flat-Ext vanishing lemma due to Lurie:\nLemma 11 (Flat Ext vanishing). Let $R$ be a connective ring and $M$ a flat $R$-module such that $\\pi_0 M$ is $\\aleph_n$-presentable as a $\\pi_0 R$-module. Then for any connective $N \\in \\mathrm{Mod}_R$ and any $k \u003e n$, \\[ \\operatorname{Ext}^k_R(M, N) = 0. \\]([lurie-sag, Lem. D.3.3.6] .)\nTheorem 12 (Faithfully flat descent). Let $R \\to S$ be a faithfully flat connective ring map, with the cardinality bound that $\\pi_0 S$ is $\\aleph_n$-presentable over $\\pi_0 R$ for some $n$ (e.g. $\\aleph_{\\omega}$ — automatic for finitely or countably presented algebras). Then $S$ is descendable as an $R$-algebra, and consequently \\[ \\mathrm{Mod}_R \\xrightarrow{\\;\\sim\\;} \\lim_{\\mathbf{\\Delta}} \\mathrm{Mod}_{S^{\\otimes(\\bullet+1)}}. \\] Proof. By Theorem 9 , descendability of $S$ implies the equivalence; we show $S$ is descendable.\nSet $K \\coloneqq \\mathrm{fib}(R \\to S)$ and $C \\coloneqq \\mathrm{cofib}(R \\to S)$, related by $K \\simeq C[-1]$. The structure map $\\rho\\colon K \\to R$ assembles, for each $m \\ge 1$, into the $m$-fold tensor power \\[ \\rho^{(m)}\\colon K^{\\otimes m} \\xrightarrow{\\;\\rho \\otimes \\cdots \\otimes \\rho\\;} R. \\]Claim. $\\rho^{(m)}$ is null-homotopic for $m$ large enough.\nBy the shift $K \\simeq C[-1]$, \\[ \\rho^{(m)} \\in [K^{\\otimes m}, R]_{\\mathrm{Mod}_R} = [C^{\\otimes m}[-m], R]_{\\mathrm{Mod}_R} = \\operatorname{Ext}^m_R(C^{\\otimes m}, R). \\] Flatness of $S$ makes $C = \\mathrm{cofib}(R \\to S)$ flat too (long exact sequence on $\\pi_*$), so $C^{\\otimes m}$ is flat. The cardinality assumption makes $\\pi_0(C^{\\otimes m})$ $\\aleph_n$-presentable, and Lemma 11 gives $\\operatorname{Ext}^m_R(C^{\\otimes m}, R) = 0$ for $m \u003e n$.\nConcluding descendability. The factorisation $\\rho^{(m+1)}\\colon K^{\\otimes(m+1)} \\xrightarrow{\\mathrm{id} \\otimes \\rho^{(m)}} K \\xrightarrow{\\rho} R$ produces a cofibre sequence \\[ K^{\\otimes m} \\otimes_R S \\to \\mathrm{cofib}(\\rho^{(m+1)}) \\to \\mathrm{cofib}(\\rho^{(m)}). \\] Inductively, $\\mathrm{cofib}(\\rho^{(m)}) \\in \\langle S \\rangle$ for every $m$, since $K^{\\otimes m} \\otimes_R S \\in \\langle S \\rangle$ and $\\langle S \\rangle$ is closed under cofibres. When $\\rho^{(m)}$ is null-homotopic, \\[ \\mathrm{cofib}(\\rho^{(m)}) \\simeq R \\oplus K^{\\otimes m}[1], \\] exhibiting $R$ as a retract of an object in $\\langle S \\rangle$. Thus $R \\in \\langle S \\rangle$, i.e. $S$ is descendable.\n$\\square$ Proof of the main theorem Proof of Theorem on quasi-coherent modules. Set $S \\coloneqq \\prod_i R_{f_i}$ for a Zariski cover $(f_i)_{i \\in I}$ — i.e. elements generating the unit ideal of $R$. (We may reduce to finite $I$, since the unit ideal is generated by finitely many of the $f_i$.) The ring map $R \\to S$ is faithfully flat: each $R_{f_i}$ is flat over $R$, and $\\Spec(S) = \\coprod_i \\Spec(R_{f_i}) \\to \\Spec(R)$ is surjective by the unit-ideal hypothesis. The cardinality bound of Theorem 12\nis automatic.\nTheorem 12 gives an equivalence \\[ \\mathrm{Mod}_R \\xrightarrow{\\;\\sim\\;} \\lim_{\\mathbf{\\Delta}} \\mathrm{Mod}_{S^{\\otimes_R(\\bullet+1)}}. \\] Tracing $M$ through this equivalence: the unit of the adjunction sends $M$ to the cosimplicial $S^{\\otimes_R(\\bullet+1)}$-module $[n] \\mapsto M \\otimes_R S^{\\otimes_R(n+1)}$, and the equivalence reads \\[ M \\xrightarrow{\\;\\sim\\;} \\lim_{[n] \\in \\mathbf{\\Delta}} \\bigl(M \\otimes_R S^{\\otimes_R(n+1)}\\bigr). \\] This is exactly the Zariski sheaf condition for $\\mathcal{F}_M$ along the cover $(\\Spec R_{f_i})_i$: at level $n$, $S^{\\otimes_R(n+1)} = \\prod_{i_0, \\dots, i_n} R_{f_{i_0} \\cdots f_{i_n}}$, so the displayed limit is the equaliser (in the appropriate cosimplicial sense) corresponding to $\\mathcal{F}_M$ on the cover. Hence $\\mathcal{F}_M$ is a Zariski sheaf, and $L\\mathcal{F}_M \\simeq \\mathcal{F}_M$.\n$\\square$ Naïve Čech as a special case Theorem 1 immediately clarifies the relationship between derived and classical Čech cohomology.\nDerived Čech is sheaf cohomology, always. Let $\\mathcal{F}$ be a sheaf on $X$ and $\\mathfrak{U} = (U_i \\to X)_{i \\in I}$ any cover. The sheaf condition along $\\mathfrak{U}$ is the equivalence \\[ \\Gamma(X, \\mathcal{F}) \\xrightarrow{\\;\\sim\\;} \\lim_{[n] \\in \\mathbf{\\Delta}} \\Gamma(U_n, \\mathcal{F}). \\] No truncation, no spectral sequence, no acyclicity hypothesis. The right-hand side is the derived Čech complex.\nNaïve Čech recovers derived Čech when intersections are acyclic. The classical naïve Čech complex is the cosimplicial discrete abelian group $[n] \\mapsto H^0(U_n, \\mathcal{F})$ — the degree-zero truncation of $\\Gamma(U_n, \\mathcal{F})$. By Corollary 2 , this truncation loses nothing precisely when each $U_n$ is affine (so $\\Gamma(U_n, \\widetilde{M})$ is concentrated in degree zero). By the affine intersection property of separated schemes (diagonal is a closed immersion), this is automatic for affine covers of separated schemes:\nCorollary 13 (Naïve Čech for separated schemes). Let $X$ be a separated scheme, $\\mathfrak{U}$ an affine open cover, and $\\mathcal{F}$ a quasi-coherent sheaf on $X$. Then naïve and derived Čech cohomology along $\\mathfrak{U}$ coincide, and both equal sheaf cohomology: \\[ \\check{H}^i(\\mathfrak{U}, \\mathcal{F}) \\xrightarrow{\\;\\sim\\;} H^i(X, \\mathcal{F}) \\qquad \\text{for all } i \\ge 0. \\] Proof. Since $X$ is separated, the diagonal $X \\to X \\times X$ is a closed immersion, so every finite intersection of affine opens is affine; in particular each $U_n$ is affine. Corollary 2 then makes $\\Gamma(U_n, \\mathcal{F})$ concentrated in degree zero, where it agrees with $H^0(U_n, \\mathcal{F})$. Hence the cosimplicial object $[n] \\mapsto \\Gamma(U_n, \\mathcal{F})$ is discrete, and its limit is the Moore complex of the cosimplicial abelian group $[n] \\mapsto H^0(U_n, \\mathcal{F})$ — i.e. the naïve Čech complex. $\\square$ Cartan–Leray, reinterpreted. The classical Cartan–Leray spectral sequence \\[ E_2^{p,q} = \\check{H}^p(\\mathfrak{U}, \\mathcal{H}^q(\\mathcal{F})) \\Longrightarrow H^{p+q}(X, \\mathcal{F}) \\] is precisely the spectral sequence associated to the Bousfield–Kan filtration on $\\lim_{\\mathbf{\\Delta}} \\Gamma(U_{\\bullet}, \\mathcal{F})$. The Cartan–Leray hypothesis — vanishing of higher $H^q$ on the cover — collapses the spectral sequence to its $E_2^{p,0}$ row, recovering naïve Čech.\nConnection with the locally ringed space picture The category $\\mathrm{Mod}_X$ defined as a limit \\[ \\mathrm{Mod}_X = \\lim_{(R,\\, x\\colon \\Spec R \\to X)} \\mathrm{Mod}_R \\] agrees, when $X$ is a scheme, with the classical category of quasi-coherent $\\mathcal{O}_X$-modules on the locally ringed space $(|X|, \\mathcal{O}_X)$. Under this identification, the derived global sections $\\Gamma(X, \\mathcal{F})$ defined here match the classical $\\mathrm{R}\\Gamma$ of an $\\mathcal{O}_X$-module computed via injective resolutions. All the classical formalism (injective resolutions, derived $\\Hom$, hypercohomology, …) gives an equivalent answer; the derived viewpoint adopted here is simply a way to skip the resolution machinery and work directly with the universal property.\nReferences J. Lurie. Spectral Algebraic Geometry. Book draft. PDF. A. Mathew. The Galois group of a stable homotopy theory. Adv. Math. 291 (2016), 403–541. arXiv:1404.2156. J. Lurie. Higher Topos Theory. Ann. Math. Stud. 170, Princeton Univ. Press, 2009. J. Lurie. Higher Algebra. PDF. ","permalink":"https://ou-liu-red-sugar.github.io/en/notes/sheaf-cohomology-as-sheafification/","summary":"\u003cp\u003e\u003cem\u003eThis note is not part of the original lecture course; it grew out of\ndiscussions about understanding sheaf cohomology from a derived / animated\nperspective. The treatment follows Lurie\u0026rsquo;s\u003c/em\u003e Spectral Algebraic Geometry\n\u003cem\u003e(\u003ca class=\"citation\" href=\"#ref-lurie-sag\"\u003e[lurie-sag]\u003c/a\u003e\n) and Mathew\u0026rsquo;s work on Galois groups in stable\nhomotopy theory (\u003ca class=\"citation\" href=\"#ref-mathew-galois\"\u003e[mathew-galois]\u003c/a\u003e\n).\u003c/em\u003e\u003c/p\u003e\n\u003ch2 id=\"conventions\"\u003eConventions\u003c/h2\u003e\n\u003cp\u003eThroughout we work in the derived setting and \u003cstrong\u003edrop the $\\mathrm{R}$-prefix\u003c/strong\u003e\non all functors. Concretely:\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003eAll limits, colimits, and tensor products are derived. The symbol $\\otimes$\ndenotes derived tensor product; the classical tensor product is recovered\nas $\\pi_0(- \\otimes -)$.\u003c/li\u003e\n\u003cli\u003e$\\Gamma(X, \\mathcal{F})$ denotes derived global sections; the classical\n$\\Gamma$ is $H^0(X, \\mathcal{F}) \\coloneqq \\pi_0\\,\\Gamma(X, \\mathcal{F})$.\u003c/li\u003e\n\u003cli\u003e$\\Hom_R(M, N)$ denotes derived $\\Hom$, so\n$\\operatorname{Ext}^i_R(M, N) = \\pi_{-i}\\Hom_R(M, N)$.\u003c/li\u003e\n\u003cli\u003e$\\mathrm{Mod}_R$ denotes the $\\infty$-category of (left) module spectra\nover a connective $\\mathbb{E}_\\infty$-ring $R$ (equivalently,\n$\\mathsf{D}(R)$ when $R$ is discrete).\u003c/li\u003e\n\u003cli\u003ePresheaves take values in a stable presentable category $\\mathcal{D}$ —\ntypically $\\mathsf{D}(\\mathbb{Z})$, $\\mathsf{Sp}$, or $\\mathrm{Mod}_R$ for\na base ring.\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp\u003eThe classical $1$-categorical theory is recovered by passing to $\\pi_0$ at\nthe end.\u003c/p\u003e","title":"Sheaf Cohomology as Sheafification"},{"content":"This page aims to explain how type theory can be understood within the framework of synthetic category theory.\nThe content of this page is derived from my questions to Tashi during the second exercise class and Tashi’s responses. I would like to express my gratitude to Tashi here.\nWe focus on the following two questions:\nQuestion I. How should we understand the notion of isofibration (hereafter referred to as a fibration) in synthetic category theory? Question II. Do we still have a weak factorization system in this context? Next, we will answer these questions through the lens of type theory and the categorical perspective of synthetic category theory.\n\\tableofcontents\nType Theory (More precisely, dependent type theory.)\nI have not formally studied type theory, so the definitions here may differ significantly from those of a type theory expert. Please feel free to correct me if there are any issues.\nContext First, let us discuss what a context is.\nDefinition A context $\\Gamma$ is a finite sequence of typed variables \\[ x_1 : X_1,\\; x_2 : X_2(x_1),\\; \\dots,\\; x_n : X_n(x_1,\\dots,x_{n-1}), \\] satisfying the following condition: for any $1 \\le k \\le n$, we can form the judgment \\[ x_1 : X_1,\\dots,x_{k-1} : X_{k-1}(x_1,\\dots,x_{k-2}) \\;\\vdash\\; X_k(x_1,\\dots,x_{k-1})\\ \\mathrm{Type}. \\] The Empty Context A context of length $0$ is denoted by $[0]$ (sometimes also written as $()$) and is called the empty context.\nThis means that at this stage we have no prior assumptions or restrictions. Hence, for any type $X$ (in particular, a constant type not depending on undefined variables), we have the judgment \\[ [0] \\vdash X \\ \\mathrm{Type}. \\]This also implies that any sequence of length $1$, $(x_1 : X_1)$, forms a valid context if and only if $X_1$ is a type in the empty context.\nIntuitive Interpretation Intuitively, a context is a value-dependent iterative structure:\nFirst, we have a type $X_1$ in the empty context, which may be viewed as a base space. Given a variable $x_1 : X_1$, we can specify $X_2(x_1)$. Strictly speaking, $X_2(x_1)$ is not a single type but a family of types over $X_1$, depending on the value of $x_1$. This is why it is called a dependent type. Fixing $x_1 : X_1$ and then $x_2 : X_2(x_1)$, we may specify $X_3(x_1,x_2)$. This process continues inductively. If for a context $\\Gamma$ we can form the judgment \\[ \\Gamma \\vdash A \\ \\mathrm{Type}, \\] then $A$ is called a type (or dependent type) in the context $\\Gamma$.\nExample Consider the natural number type $\\mathbb{N}$ and the context \\[ \\Gamma = (x : \\mathbb{N}). \\]In this context, we would like to discuss the object “integers modulo $x$”, denoted $\\mathbb{Z}/x$. Clearly, its structure depends on the specific value of $x$. Therefore, $\\mathbb{Z}/x$ is a dependent type in the context $\\Gamma$, and we have the judgment \\[ x : \\mathbb{N} \\vdash \\mathbb{Z}/x \\ \\mathrm{Type}. \\]Geometrically, this corresponds to a fiber bundle over the discrete base space $\\mathbb{N}$:\nwhen $x = 2$, the fiber is $\\mathbb{Z}/2$; when $x = 0$, the fiber is $\\mathbb{Z}$ (if we define $\\mathbb{Z}/0 \\cong \\mathbb{Z}$). Context Extension Given a context $\\Gamma$ and a type $A$ in the context $\\Gamma$, we may form a new context $(\\Gamma, a : A)$.\nIf $\\Gamma$ has the form \\[ x_1 : X_1,\\dots,x_n : X_n, \\] then the extended context encodes the data \\[ x_1 : X_1,\\dots,x_n : X_n,\\ a : A(x_1,\\dots,x_n). \\]This is called the extension of $\\Gamma$ by $A$, and is also written as $\\Gamma.A$.\nGeometrically:\n$\\Gamma$ corresponds to the base space; $A$ corresponds to a fiber bundle over the base; $\\Gamma.A$ corresponds to the total space. Context Induction Contexts in dependent type theory are generated inductively by the following rules:\nBase: the empty context $[0]$ is valid. Induction: if $\\Gamma$ is a valid context and $\\Gamma \\vdash A \\ \\mathrm{Type}$, then the extension $\\Gamma.A$ is also a valid context. Contexts as $\\Sigma$-Types Once $\\Sigma$-types (dependent sums) are available, every context can be encoded as a single type:\nthe empty context corresponds to the unit type $\\mathbf{1}$; a context $(x : X)$ corresponds to $X$; a context $(x : X, y : Y(x))$ corresponds to $\\sum_{x:X} Y(x)$; in general, contexts correspond to iterated $\\Sigma$-types. Terms A term of type $A$ in a context $\\Gamma$ is expressed by the judgment \\[ \\Gamma \\vdash a : A. \\]From various perspectives:\nin type theory, $a$ is a term of $A$; in set theory, $a$ is an element of $A$; in homotopy theory or geometry: in the empty context, $a$ is a point of $A$; in a non-empty context, $a$ is a section of the bundle corresponding to $A$. Concretely, $a$ is a rule assigning to each choice of context variables a point in the corresponding fiber.\n(Synthetic) Category Theory We now consider a category $\\mathcal{C}$, often referred to as the syntactic category or the category of contexts.\nObjects: contexts $\\Gamma$. Morphisms: given contexts $\\Gamma$ and $\\Delta$, a morphism $\\Gamma \\to \\Delta$ is a tuple of terms representing substitution. Composition: substitution of substitutions. Display Maps and Isofibrations Given a context $\\Gamma$ and a type $A$ over it, the extension $\\Gamma.A$ comes with a canonical projection \\[ p : \\Gamma.A \\to \\Gamma. \\]In type theory, this is called a display map.\nIn synthetic category theory, such maps are called isofibrations.\nBase Change and Substitution Let $A \\twoheadrightarrow B$ be an isofibration corresponding to a dependent type $A(b)$ over $B$, \\[ A \\twoheadrightarrow B \\quad\\Longleftrightarrow\\quad \\sum_{b:B} A(b) \\to B. \\]Given any morphism $f : B' \\to B$, substitution in type theory corresponds to pullback in synthetic category theory. Explicitly, the following diagrams describe the same construction:\n\\(\\Leftrightarrow\\) Thus, pullback corresponds to substitution, and the object $A'$ is precisely the total space of the substituted dependent type.\nPath Objects For any object $A$, consider the diagonal morphism $\\Delta : A \\to A \\times A$. This admits a factorization\nHere:\n$p : \\operatorname{Iso}(A) \\twoheadrightarrow A \\times A$ is an isofibration; $r : A \\xrightarrow{\\sim} \\operatorname{Iso}(A)$ is a weak equivalence. The object $\\operatorname{Iso}(A)$ is called the path object of $A$.\nType-Theoretic Semantics In type-theoretic terms:\nThe isofibration $p$ corresponds to the identity type \\[ x : A,\\ y : A \\vdash (x \\simeq y)\\ \\mathrm{Type}. \\] The path object is the total space \\[ \\operatorname{Iso}(A) = \\sum_{x:A} \\sum_{y:A} (x \\simeq y). \\] The map $r$ corresponds to reflexivity, \\[ x \\mapsto (x,x,\\mathrm{refl}_x). \\] Mapping Path Spaces and Weak Factorization For any morphism $f : A \\to B$, we obtain a factorization\nThe intermediate object carries the type-theoretic meaning \\[ b : B \\vdash \\sum_{a:A} (f(a) \\simeq b)\\ \\mathrm{Type}, \\] which is precisely the homotopy fiber of $f$ over $b$.\nThis shows that synthetic category theory admits a weak factorization system, directly mirroring the situation in model categories.\n","permalink":"https://ou-liu-red-sugar.github.io/en/notes/synthetic-category-theory-and-type-theory/","summary":"\u003cp\u003eThis page aims to explain how \u003cstrong\u003etype theory\u003c/strong\u003e can be understood within the framework of \u003cstrong\u003esynthetic category theory\u003c/strong\u003e.\u003c/p\u003e\n\u003cp\u003eThe content of this page is derived from my questions to Tashi during the second exercise class and Tashi’s responses. I would like to express my gratitude to Tashi here.\u003c/p\u003e\n\u003cp\u003eWe focus on the following two questions:\u003c/p\u003e\n\u003cul\u003e\n\u003cli\u003e\u003cstrong\u003eQuestion I.\u003c/strong\u003e How should we understand the notion of \u003cstrong\u003eisofibration\u003c/strong\u003e (hereafter referred to as a \u003cem\u003efibration\u003c/em\u003e) in synthetic category theory?\u003c/li\u003e\n\u003cli\u003e\u003cstrong\u003eQuestion II.\u003c/strong\u003e Do we still have a \u003cstrong\u003eweak factorization system\u003c/strong\u003e in this context?\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp\u003eNext, we will answer these questions through the lens of type theory and the categorical perspective of synthetic category theory.\u003c/p\u003e","title":"Synthetic category theory and type theory"},{"content":"Introduction Remark(Conventions). Throughout this talk, we adopt the following conventions:\nImplicit ∞-categories: For the sake of readability, we systematically omit the prefix “∞-” from our terminology. Thus, unless stated otherwise, the term category always refers to an ∞-category. 1-categories: To avoid confusion, we refer to ordinary categories (i.e., those enriched over sets) explicitly as 1-categories. Homological indexing: We use homological indexing for chain complexes. In particular, the differential on any chain complex, $\\partial_n: C_n \\to C_{n-1}$, lowers the degree by $1$. Simplex category: We use $\\Delta$ to denote the standard simplex category. Overview and Structure These notes accompany a talk given at the Goodwillie Calculus Seminar, held in the Winter Term 2025 at the University of Regensburg.\nOur primary objective is two-fold:\nTo provide a self-contained introduction to and proof of the stable Dold–Kan correspondence. To demonstrate its power by applying it to descent theory, specifically relating descendable algebras to nilpotent Adams towers. The notes are organized as follows:\nSection “Classical Dold–Kan”: We begin by warming up with the classical story. We review the correspondence between simplicial objects and chain complexes in additive 1-categories. Section “The stable setup”: We shift to the stable categorical setting. We explain why, in this context, the natural analogue of a chain complex is a $\\mathbb{Z}_{\\ge 0}$-filtration. Chapter “The proof”: This is the technical heart of the talk. We construct the “bridge categories” $\\mathcal{J}$ and $\\mathcal{J}_+$ to prove that simplicial objects are equivalent to filtrations. Appendix “Application to descent”: Finally, we reap the rewards of our hard work. We apply the stable Dold–Kan correspondence to the theory of descendable algebras. We will show how this correspondence translates the difficult problem of descent (convergence of the cobar construction) into a manageable problem of nilpotence (vanishing of the Adams tower), culminating in the descendable Barr–Beck theorem. Review of the Classical Dold–Kan Correspondence We begin with a motivating example from topology.\nConstruction 1. Let $X$ be a topological space. We can construct a simplicial set $\\operatorname{Sing}_{\\bullet}(X)$ as follows: for $[n] \\in \\Delta$, define $\\operatorname{Sing}_n(X) \\coloneqq \\operatorname{Hom}_{\\mathsf{Top}}(\\Delta^n_{\\operatorname{top}}, X)$, where $\\Delta^n_{\\operatorname{top}}$ denotes the topological $n$-simplex. This defines a functor \\[ \\operatorname{Sing} \\colon \\mathsf{Top} \\to \\mathsf{sSet}. \\] This functor induces an equivalence between classical homotopy theory and simplicial homotopy theory: \\[ \\mathsf{Top}[\\text{weak homotopy equivalence}^{-1}] \\simeq \\mathsf{An}. \\]However, for computational purposes, we often want to “linearize” this homotopy data. We can form the free abelian group generated by the $n$-simplices, denoted $\\mathbb{Z} \\operatorname{Sing}_n (X)$, obtaining a simplicial abelian group $\\mathbb{Z} \\operatorname{Sing}_{\\bullet} (X)$. While this object captures the homology of $X$, it contains redundant information: the degeneracy maps merely repeat lower-dimensional data, and the full collection of face maps is unwieldy.\nTo extract the homological data efficiently, we pass to the singular chain complex $\\operatorname{C}_*(X)$:\nFor each $n \\ge 0$, let $\\operatorname{C}_n(X) \\coloneqq \\mathbb{Z} \\operatorname{Sing}_n(X)$. The differential $\\partial_n \\colon \\operatorname{C}_n(X) \\to \\operatorname{C}_{n-1}(X)$ is defined as the alternating sum of the face maps: \\[ \\partial_n \\coloneqq \\sum_{i=0}^n (-1)^i d_i^n, \\] where $d_i^n$ is the $i$-th face map. This yields a functor \\[ \\operatorname{C}_* \\colon \\mathsf{sAb} \\to \\mathsf{Ch}_{\\geq 0}(\\mathsf{Ab}). \\] While this functor captures the correct homology, it is not an equivalence of categories because it retains the degenerate simplices in its object definition. However, if we quotient out the degenerate simplices, we obtain the normalized chain complex $\\operatorname{N}_*(X)$. The celebrated Dold–Kan correspondence asserts that this normalization functor is an equivalence of categories. Thus, in a very precise sense, singular homology theory is the linearization of the homotopy theory of topological spaces.\nMore formally, this correspondence establishes a fundamental relationship between connective chain complexes1 and simplicial objects in an idempotent-complete additive 1-category $\\mathcal{A}$.\nGiven a simplicial object $X_{\\bullet}$ in $\\mathcal{A}$, one can construct its unnormalized chain complex (or Moore complex), denoted $\\operatorname{C}_*(X)$, as follows:\nThe object in degree $n$ is simply $\\operatorname{C}_n(X) \\coloneqq X_n$. The differential $\\partial_n \\colon \\operatorname{C}_n(X) \\to \\operatorname{C}_{n-1}(X)$ is the alternating sum of face maps: \\[ \\partial_n \\coloneqq \\sum_{i=0}^n (-1)^i d_i^n. \\] This complex is “too large” as it contains redundant information from degenerate simplices. Let $\\operatorname{D}_n(X)$ be the subobject of $X_n$ generated by all degenerate $n$-simplices. A more efficient representation is given by the normalized chain complex, denoted $\\operatorname{N}_*(X)$, defined by $\\operatorname{N}_n(X) \\coloneqq \\bigcap_{i=1}^{n} \\ker(d_i^n)$. A fundamental result states that there is a canonical isomorphism $\\operatorname{N}_n(X) \\xrightarrow{\\sim} \\operatorname{C}_n(X)/\\operatorname{D}_n(X)$, and the inclusion $\\operatorname{N}_*(X) \\hookrightarrow \\operatorname{C}_*(X)$ is a quasi-isomorphism.\nConversely, we can construct a simplicial object from a connective chain complex $C_* \\in \\operatorname{Ch}(\\mathcal{A})_{\\geq 0}$. First, we form a semi-simplicial object $C_{\\bullet,\\operatorname{inj}}$: where the arrow corresponding to the $i$-th coface operator $\\delta_n^i \\colon [n-1] \\hookrightarrow [n]$ is $\\partial$ if $i=0$ (or specific indices depending on convention) and zero otherwise.\nWe then obtain the corresponding simplicial object via the left Kan extension along the inclusion $\\Delta_{\\operatorname{inj}} \\hookrightarrow \\Delta$: We refer to this functor $\\operatorname{DK}$ as the Dold–Kan construction. Intuitively, this process “freely adds” the necessary degenerate simplices to the chain complex.\nTheorem 2 (Classical Dold–Kan correspondence). Let $\\mathcal{A}$ be an additive 1-category. The functor \\[ \\operatorname{DK} \\colon \\operatorname{Ch}(\\mathcal{A})_{\\geq 0} \\to \\operatorname{Fun}(\\Delta^{\\operatorname{op}},\\mathcal{A}) \\] is fully faithful. Furthermore, if $\\mathcal{A}$ is idempotent-complete, then $\\operatorname{DK}$ and the normalization functor $\\operatorname{N}_*$ constitute an equivalence of categories.\nProof. We verify this by reducing it to the abelian case. Recall that for $\\mathcal{A} = \\mathsf{Ab}$, the classical Dold–Kan correspondence holds (c.f. [HA, Lemma 1.2.3.13] ).\nNow, let $\\mathcal{A}$ be a general additive 1-category. Consider the category of additive presheaves $\\mathcal{A}' = \\operatorname{Fun}(\\mathcal{A}^{\\operatorname{op}},\\mathsf{Ab})$. Via the additive Yoneda embedding $y \\colon \\mathcal{A} \\to \\mathcal{A}'$, we can embed $\\mathcal{A}$ into an abelian category. Since $y$ preserves finite limits and colimits, the following diagram commutes up to canonical isomorphism:\nNow consider the bottom map. By the exponential law (or currying), we have $\\mathsf{Ch}(\\mathcal{A}')_{\\geq 0} \\cong \\operatorname{Fun}(\\mathcal{A}^{\\operatorname{op}}, \\mathsf{Ch}(\\mathsf{Ab})_{\\geq 0})$. Thus, the bottom functor corresponds to post-composition with the classical equivalence $\\operatorname{DK}_{\\mathsf{Ab}}$. Since post-composition with an equivalence is an equivalence, the bottom map is an equivalence.\nSince $y$ is fully faithful, it follows that the top $\\operatorname{DK}$ functor is fully faithful. The essential surjectivity in the idempotent-complete case follows from the splitting of $\\operatorname{N}_n$ as a direct summand.\n$\\square$ What is the Stable Dold–Kan Correspondence? We now shift our focus to the setting of higher category theory. In modern homotopy theory, stable categories serve as the higher categorical analogue of abelian categories.\nConsider the homotopy category $\\operatorname{h}\\mathcal{C}$ of a stable category $\\mathcal{C}$. While $\\operatorname{h}\\mathcal{C}$ is typically not abelian, it carries a triangulated structure. This implies two key properties:\n$\\operatorname{h}\\mathcal{C}$ is an additive 1-category. It satisfies the following splitting property: $(*)$ If $f \\colon X \\to Y$ is a morphism in $\\operatorname{h}\\mathcal{C}$ which admits a left inverse, then there is an isomorphism $Y \\simeq X \\oplus X'$ such that $f$ is identified with the inclusion into the first factor. This property guarantees that the classical Dold–Kan correspondence applies perfectly to $\\operatorname{h}\\mathcal{C}$ (allowing us to identify chain complexes in $\\operatorname{h}\\mathcal{C}$ with simplicial objects).\nHowever, the stable correspondence is a much deeper statement at the full categorical level. The key insight is to relate simplicial objects to $\\mathbb{Z}_{\\geq 0}$-filtrations. A functor $F_{\\star} \\colon \\mathbb{Z}_{\\geq 0} \\to \\mathcal{C}$ represents a tower of objects: \\[ F_0 \\to F_1 \\to F_2 \\to \\cdots \\] Construction 3. Let $F_{\\star}$ be a filtration in stable category $\\mathcal{C}$, then for $s \\in \\Z$, one can define the $s$-th associative graded piece of $F_{\\star}$ to be the cofiber \\[ \\operatorname{gr}_{F}^{s} \\coloneqq \\operatorname{cofib}(F_{s} \\to F_{s+1}) = \\frac{F_{s+1}}{F_s}. \\] In [HA, Remark 1.2.2.3] , one can find that if $F_{\\star}$ is a filtration, then the graded objects form a kind of chain complex. Specifically, each fiber sequence \\[ \\operatorname{gr}^{s} \\to \\frac{F_{s+2}}{F_s} \\to \\operatorname{gr}^{s+1} \\] gives rise to a ‘differential’ $d \\colon \\operatorname{gr}^{s+1} \\to \\operatorname{gr}^s[1]$.\nThus, one obtain a chain complex \\[ \\cdots \\to \\operatorname{gr}^{2}[-2] \\to \\operatorname{gr}^1[-1] \\to \\operatorname{gr}^0 \\to \\operatorname{gr}^{-1}[1] \\to \\operatorname{gr}^{-2}[2] \\to \\cdots \\]Using the classical Dold–Kan correspondence on $\\operatorname{h}\\mathcal{C}$, this chain complex determines a simplicial object. The stable Dold–Kan correspondence asserts that this relationship lifts to an equivalence of $\\infty$-categories:\nTheorem 4 (Stable Dold–Kan correspondence). Let $\\mathcal{C}$ be a stable category. Then there exists an equivalence of categories: \\[ \\operatorname{Fun}(\\Delta^{\\operatorname{op}},\\mathcal{C}) \\simeq \\operatorname{Fun}(\\mathbb{Z}_{\\geq 0},\\mathcal{C}). \\] Acknowledgements I would like to express my sincere gratitude to the organizer, Prof. Marc Hoyois, for the opportunity to give this talk at the Goodwillie Calculus Seminar. I am also indebted to Yuchen Wu for providing the key insight regarding the model-independent proof of , which greatly clarified the combinatorial arguments. Finally, I thank Gemini for assisting with grammatical corrections and polishing the text.\nTechnical Lemmas In the proof of the stable Dold–Kan correspondence (Chapter “Stable-DK”), we relied on a crucial identification between left and right Kan extensions. The goal of this chapter is to provide a rigorous, model-independent proof of this fact.\nLemma 5 (Kan extension equivalence). Let $\\mathcal{C}$ be a stable category, let $n \\geq 0$, and let $F \\colon \\Delta_{+,\\leq n}^{\\operatorname{op}} \\to \\mathcal{C}$ be a functor. The following conditions are equivalent:\nThe functor $F$ is a left Kan extension of its restriction $F|_{\\Delta_{\\leq n}^{\\operatorname{op}}}$. The functor $F$ is a right Kan extension of its restriction $F|_{\\Delta_{+,\\leq n-1}^{\\operatorname{op}}}$. To prove this, we need to analyze the combinatorics of the simplex category. We adopt the strategy of Yuchen Wu, which avoids the use of topological barycentric subdivisions.\nCoinitial We first establish a general lemma regarding the contractibility of unions of posets.\nLemma 6 (Union of Contractible Posets). Let $V$ be a poset and let $\\mathcal{F} = \\{U_1, \\dots, U_m\\}$ be a non-empty finite collection of subposets of $V$. Suppose that:\nCovering: $V = U_1 \\cup \\cdots \\cup U_m$. Downward Closure Compatibility: For any $a, b \\in V$ with $a \\le b$, if $a \\in U_i$ and $b \\in U_j$, then either $a, b \\in U_i$ or $a, b \\in U_j$. (This holds in particular if each $U_i$ is a downward closed subposet). Intersection Contractibility: Any non-empty intersection of elements in $\\mathcal{F}$ is a weakly contractible subposet of $V$. Then $V$ itself is weakly contractible.\nProof. We proceed by induction on $m$. The case $m=1$ is trivial. Assume the statement holds for $m \\le k$. Let $W_k = \\bigcup_{i=1}^k U_i$. Consider the pushout $P$ in $\\mathsf{Cat}$ of the span:\nWe claim that $P$ is equivalent to $V$. By condition (2), the inclusion functors in the span are fully faithful. As shown in [haine2025fullyfaithfulfunctorspushouts] , fully faithful inclusions ensure that the categorical pushout behaves well:\nBy condition (1) and (2), the pushout $P$ has the same underlying set (anima) as the union $V = W_k \\cup U_{k+1}$. The mapping animae in $P$ agree with those in $V$: for $a, b \\in V$, if $a \\le b$, the mapping space is contractible; otherwise, it is empty. Thus, $P \\simeq V$.\nNow, by the inductive hypothesis, $W_k$ is weakly contractible. The intersection $W_k \\cap U_{k+1} = \\bigcup_{i=1}^k (U_i \\cap U_{k+1})$ satisfies the conditions of the lemma for the collection $\\{U_i \\cap U_{k+1}\\}$, so it is also weakly contractible. Since $U_{k+1}$ is contractible by (3), $V$ (being the homotopy pushout of contractible spaces) is weakly contractible.\n$\\square$ Now we apply this to the specific geometry of the simplex category.\nLemma 7. Let $\\Delta^{\\operatorname{inj}}$ be the subcategory of $\\Delta$ consisting of injective maps. The functor \\[ \\iota \\colon \\Delta^{\\operatorname{inj}}_{/[n]} \\to \\Delta_{\\leq n} \\] defined by sending $([m], [m] \\hookrightarrow [n])$ to $[m]$ is coinitial.\nProof. By Quillen\u0026rsquo;s Theorem A, it suffices to show that for any $[k] \\in \\Delta_{\\leq n}$, the slice category \\[ Q_{n,k} \\coloneqq \\Delta^{\\operatorname{inj}}_{/[n]} \\times_{\\Delta_{\\leq n}} (\\Delta_{\\leq n})_{/[k]} \\] is weakly contractible.\nExplicitly, objects in $Q_{n,k}$ are pairs $(\\beta, f)$, where $\\beta \\colon [m] \\hookrightarrow [n]$ is an injective map and $f \\colon [m] \\to [k]$ is a map in $\\Delta_{\\leq n}$. Since $\\beta$ is injective, it is uniquely determined by its image $I \\subseteq [n]$. Thus, we can identify objects of $Q_{n,k}$ with pairs $(I, f)$ where $I \\subseteq [n]$ is a subset and $f \\colon I \\to [k]$ is an order-preserving map (where we identify $I$ with $[|I|-1]$ via the unique order isomorphism).\nLet $O_{n,k}$ be the set of all maps $[n] \\to [k]$. We equip $O_{n,k}$ with the alphabetic order $\\le$ (a reverse lexicographical order): we say $g \u003c h$ if there exists some $i \\in [n]$ such that \\[ g(n)=h(n), \\dots, g(i+1)=h(i+1) \\quad \\text{and} \\quad g(i) \u003c h(i). \\] This defines a total order on $O_{n,k}$.\nFor each $\\phi \\in O_{n,k}$, let $U_{\\phi} \\subseteq Q_{n,k}$ be the subposet of elements $(I, f)$ such that the composite map $([n] \\twoheadrightarrow I \\xrightarrow{f} [k])$ is $\\le \\phi$ in the pointwise order. Each $U_{\\phi}$ has a terminal object (the pair corresponding to the largest subset $I$ compatible with the constraints) and is thus contractible.\nWe filter $Q_{n,k}$ by the subposets $V_{\\phi} \\coloneqq \\bigcup_{\\psi \\le \\phi} U_{\\psi}$. We prove that each $V_{\\phi}$ is contractible by induction on the alphabetic order.\nBase case: $V_{(0,\\dots,0)}$ is contractible. Inductive step: Let $\\phi$ be a map and $\\phi' = \\phi + 1$ be its successor in the alphabetic order. We have a pushout square: It suffices to show the intersection $V_{\\phi} \\cap U_{\\phi'}$ is contractible.\nAnalyzing the intersection:\nLet $i$ be the largest index such that $\\phi(i) \u003c k$ (the pivot for the successor). Then the successor $\\phi'$ is given by: \\[ \\phi'(t) = \\begin{cases} \\phi(t) \u0026 \\text{if } t \u003e i \\\\ \\phi(t) + 1 \u0026 \\text{if } t = i \\\\ 0 \u0026 \\text{if } t \u003c i. \\end{cases} \\] The intersection $V_{\\phi} \\cap U_{\\phi'}$ consists of pairs $(I, f)$ compatible with $\\phi'$ that are also pointwise $\\le \\psi$ for some $\\psi \\le \\phi$. As shown in Wu, this intersection decomposes nicely as a union of principal ideals: \\[ V_{\\phi} \\cap U_{\\phi'} = \\bigcup_{c \\in S(\\phi)} P_{\\le ([n] \\setminus \\{c\\})}, \\] where $S(\\phi) \\subseteq [n]$ is a specific set of indices determined by the descent of $\\phi'$. An index $c$ belongs to $S(\\phi)$ if and only if $c=i$, or $c \u003e i$ and $\\phi'(c-1) \u003c \\phi'(c)$.\nCrucially, since $k \\le n$, the set $S(\\phi)$ is not the entire set $[n]$. Thus, the total intersection of these principal ideals corresponds to the ideal generated by $[n] \\setminus S(\\phi)$, which is non-empty.\nTherefore, the collection of ideals $\\{ P_{\\le ([n] \\setminus \\{c\\})} \\}_{c \\in S(\\phi)}$ satisfies the conditions of Lemma “Union of Contractible Posets” (any intersection is a principal ideal, hence contractible). We conclude that $V_{\\phi} \\cap U_{\\phi'}$ is contractible, and by induction, $Q_{n,k}$ is contractible.\n$\\square$ The Cube Lemma in Stable Categories Definition 8 (Cubes in a stable category). Let $\\mathcal{C}$ be a stable category. A cube is a functor $D \\colon \\mathcal{P}(S) \\to \\mathcal{C}$ for some finite set $S$.\nWe say $D$ is cartesian (or a limit diagram) if the object $D(\\emptyset)$ is the limit of $D|_{\\mathcal{P}(S) \\setminus \\{\\emptyset\\}}$. We say $D$ is cocartesian (or a colimit diagram) if the object $D(S)$ is the colimit of $D|_{\\mathcal{P}(S) \\setminus \\{S\\}}$. Lemma 9 (The cube lemma). Let $\\mathcal{C}$ be a stable category and $D \\colon \\mathcal{P}(S) \\to \\mathcal{C}$ a cube. The following are equivalent:\n$D$ is cartesian. $D$ is cocartesian. Proof. This is a standard result in higher algebra. The core idea is to define the total fiber (denoted $\\operatorname{tfib}(D)$) and the total cofiber (denoted $\\operatorname{tcof}(D)$).\n$D$ is cartesian $\\iff \\operatorname{tfib}(D) \\simeq 0$. $D$ is cocartesian $\\iff \\operatorname{tcof}(D) \\simeq 0$. In a stable category, there is a natural equivalence $\\operatorname{tfib}(D) \\simeq \\operatorname{tcof}(D)[-|S|]$, where $|S|$ is the cardinality of $S$. Thus, the vanishing of one implies the vanishing of the other. $\\square$ Proof of Lemma “Kan extension equivalence” Proof. Let $F \\colon \\Delta_{+,\\leq n}^{\\operatorname{op}} \\to \\mathcal{C}$ be the functor. We interpret the two conditions:\n1. Analysis of the Left Kan Extension.\nCondition (1) states that $F$ is a left Kan extension at the object $[-1]$. By definition, this means \\[ F([-1]) \\simeq \\operatorname{colim}_{\\alpha: [k] \\to [-1]} F([k]), \\] where the colimit is over the slice category $\\Delta_{\\le n}^{\\operatorname{op}}$. By Lemma “Coinitiality of the Injective Slice”, the inclusion $\\Delta^{\\operatorname{inj}}_{/[n]} \\to \\Delta_{\\leq n}$ is coinitial. Note that $\\Delta^{\\operatorname{inj}}_{/[n]}$ is isomorphic to $\\mathcal{P}([n]) \\setminus \\{\\emptyset\\}$. Thus, condition (1) is equivalent to saying that the restriction of $F$ to the $(n+1)$-cube $\\mathcal{P}([n])$ is a cocartesian (where the colimit cone is the value at $\\emptyset \\subseteq [n]$, corresponding to $[-1]$).\n2. Analysis of the Right Kan Extension.\nCondition (2) states that $F$ is a right Kan extension at the object $[n]$. The relevant index category is the slice of $\\Delta_{+, \\le n-1}^{\\operatorname{op}}$ under $[n]$, which essentially corresponds to $\\Delta_{\\leq n}$ (mapping into $[n]$). Using Lemma “Coinitiality of the Injective Slice” again (in the dual or shifted context), we can identify this limit with a limit over the same combinatorial structure $\\Delta^{\\operatorname{inj}}_{/[n]} \\cong \\mathcal{P}([n])$. Thus, condition (2) is equivalent to saying that the restriction of $F$ to the cube is a limit diagram (where the limit cone is the value at $[n]$).\n3. Conclusion.\nWe have identified both conditions with properties of a single cube diagram formed by restricted values of $F$.\nLeft Kan Extension $\\iff$ The cube is cocartesian. Right Kan Extension $\\iff$ The cube is cartesian. By the Cube Lemma (stability), these two conditions are equivalent. $\\square$ The Proof of the Stable Dold–Kan Correspondence In this chapter, we provide a complete proof of the stable Dold–Kan correspondence.\nOur proof strategy relies on constructing a “bridge” between the two worlds. Specifically, we will:\nConstruct a chain of functors connecting the category of simplicial objects, $\\operatorname{Fun}(\\Delta^{\\operatorname{op}}, \\mathcal{C})$, with the category of filtered objects, $\\operatorname{Fun}(\\mathbb{Z}_{\\geq 0}, \\mathcal{C})$. Show that every functor in this chain is an equivalence of categories. Preliminaries: The Skeletal Filtration Before diving into the formal construction of the bridge categories, let us ground our intuition in the geometry of simplicial objects. This will explain why the proof takes the form it does.\nRecall that for any simplicial object $X_{\\bullet} \\in \\operatorname{Fun}(\\Delta^{\\operatorname{op}}, \\mathcal{C})$, we can define its $n$-skeleton $\\operatorname{sk}_n X$. Categorically, this is the Left Kan Extension of the restriction of $X$ to the truncated category $\\Delta_{\\le n}^{\\operatorname{op}}$ along the inclusion: \\[ \\operatorname{sk}_n X \\coloneqq \\operatorname{Lan}_{\\Delta_{\\le n}^{\\operatorname{op}} \\hookrightarrow \\Delta^{\\operatorname{op}}} (X|_{\\Delta_{\\le n}^{\\operatorname{op}}}). \\] The sequence of skeletons provides a natural filtration of $X$: \\[ \\operatorname{sk}_0 X \\to \\operatorname{sk}_1 X \\to \\operatorname{sk}_2 X \\to \\cdots \\to \\operatorname{colim}_n \\operatorname{sk}_n X \\simeq X. \\]The Geometric Intuition Why is this relevant to Dold–Kan? In the classical case (e.g., simplicial sets), $\\operatorname{sk}_n X$ is obtained from $\\operatorname{sk}_{n-1} X$ by attaching non-degenerate $n$-simplices via a pushout square: Step 1: Building the Bridge Categories To make the skeletal intuition precise, we introduce two index categories: $\\mathcal{J}$ and $\\mathcal{J}_+$.\nThe Category $\\mathcal{J}_+$ We define $\\mathcal{J}_+$ as the full subcategory of $\\mathbb{Z}_{\\geq 0} \\times \\Delta^{\\operatorname{op}}_+$ spanned by pairs $(n,[m])$ satisfying $m \\leq n$. Here, $\\Delta^{\\operatorname{op}}_+$ is the augmented simplex category (including $[-1]$).\nThe first coordinate $n \\in \\mathbb{Z}_{\\ge 0}$ represents the filtration stage (related to the $n$-skeleton). The second coordinate $[m] \\in \\Delta^{\\operatorname{op}}_+$ represents the simplicial degree. Intuitively, an object $(n,[m])$ corresponds to the term $(X_m)$ sitting inside the $n$-skeleton. The condition $m \\leq n$ reflects that the $n$-skeleton is determined by simplices of dimension up to $n$.\nThe picture to have in mind is a large commutative diagram: The Category $\\mathcal{J}$ and the Functor Chain In parallel, we define $\\mathcal{J}$ as the full subcategory of $\\mathcal{J}_+$ spanned by pairs $(n,[m])$ where $0 \\leq m \\leq n$ (excluding the bottom row $m=-1$). This encodes the skeleton data without the geometric realization.\nWe define $\\operatorname{Fun}^0(\\mathcal{J},\\mathcal{C})$ to be the full subcategory of $\\operatorname{Fun}(\\mathcal{J},\\mathcal{C})$ spanned by functors $F$ satisfying the following stability condition:\nFor every $s \\leq m \\leq n$, the image of the natural map $(m,[s]) \\to (n,[s])$ is an equivalence in $\\mathcal{C}$. Similarly, we define $\\operatorname{Fun}^0(\\mathcal{J}_+,\\mathcal{C})$ for functors $F_+ \\colon \\mathcal{J}_+ \\to \\mathcal{C}$ satisfying the same stability condition. Additionally, we require that $F_+$ is a Left Kan Extension of its restriction to $\\mathcal{J}$. This condition formally encodes that the bottom row objects $(n, [-1])$ are geometric realizations (colimits) of the columns above them.\nThis setup yields a diagram of categories: \\[ \\operatorname{Fun}(\\Delta^{\\operatorname{op}},\\mathcal{C}) \\xrightarrow{G} \\operatorname{Fun}^0(\\mathcal{J},\\mathcal{C}) \\xleftarrow{G'} \\operatorname{Fun}^0(\\mathcal{J}_+,\\mathcal{C}) \\xrightarrow{G''} \\operatorname{Fun}(\\mathbb{Z}_{\\geq 0},\\mathcal{C}). \\] Here:\n$G$ is induced by the projection $p \\colon \\mathcal{J} \\to \\Delta^{\\operatorname{op}}$. $G'$ is the restriction functor. $G''$ is the restriction to the bottom row $\\mathbb{Z}_{\\geq 0} \\hookrightarrow \\mathcal{J}_+$ via $n \\mapsto (n,[-1])$. Our goal is to show that $G$, $G'$, and $G''$ are equivalences.\nStep 2: Proving the Equivalences The Functor $G$ is an equivalence We first show that $G$ is an equivalence. The strategy is to express $G$ as a limit of equivalences $G_k$.\nDefine the “truncated” index categories:\n$\\mathcal{J}^{\\leq k}$: the full subcategory of $\\mathcal{J}$ spanned by pairs $(n,[m])$ where $m \\leq n \\leq k$. $\\mathcal{J}^{k}$: the full subcategory of $\\mathcal{J}$ spanned by pairs $(n,[m])$ where $m \\leq n = k$. Note that the projection $p$ restricts to an equivalence $\\mathcal{J}^k \\simeq \\Delta_{\\leq k}^{\\operatorname{op}}$.\nWe aim to show an equivalence: \\[ \\operatorname{Fun}^0(\\mathcal{J}^{\\leq k},\\mathcal{C}) \\xrightarrow{\\sim} \\operatorname{Fun}(\\mathcal{J}^k,\\mathcal{C}). \\] Consider the right Kan extension along the fully faithful inclusion $\\iota \\colon \\mathcal{J}^{k} \\hookrightarrow \\mathcal{J}^{\\leq k}$: This induces a fully faithful functor $\\iota_* \\colon \\operatorname{Fun}(\\mathcal{J}^{k},\\mathcal{C}) \\to \\operatorname{Fun}(\\mathcal{J}^{\\leq k},\\mathcal{C})$. It remains to identify the essential image of $\\iota_*$ with $\\operatorname{Fun}^0(\\mathcal{J}^{\\leq k},\\mathcal{C})$.\nFor any $s \\leq m \\leq n \\leq k$, observe that the under-categories satisfy $\\mathcal{J}^k_{(m,[s])/} \\simeq \\mathcal{J}^k_{(n,[s])/}$. Consequently, the limit diagrams defining the right Kan extension at $(m,[s])$ and $(n,[s])$ are isomorphic. Since $\\mathcal{C}$ is stable (and thus admits finite limits), the pointwise formula for the Right Kan Extension implies that the map \\[ \\operatorname{Ran}_{\\iota}H ((m,[s])) \\to \\operatorname{Ran}_{\\iota}H ((n,[s])) \\] is an equivalence. Thus, the image of $\\iota_*$ lies in $\\operatorname{Fun}^0(\\mathcal{J}^{\\leq k},\\mathcal{C})$. Conversely, for any $F \\in \\operatorname{Fun}^0(\\mathcal{J}^{\\leq k},\\mathcal{C})$, one can check that $F \\simeq \\operatorname{Ran}_{\\iota}(F|_{\\mathcal{J}^k})$.\nThus, we obtain a sequence of equivalences: \\[ G_k \\colon \\operatorname{Fun}(\\Delta_{\\leq k}^{\\operatorname{op}},\\mathcal{C}) \\xrightarrow{\\sim} \\operatorname{Fun}(\\mathcal{J}^{k},\\mathcal{C}) \\xrightarrow{\\sim} \\operatorname{Fun}^0(\\mathcal{J}^{\\leq k},\\mathcal{C}). \\] Taking the limit as $k \\to \\infty$, we have $G \\simeq \\lim_{k} G_k$. Since a limit of equivalences is an equivalence, $G$ is an equivalence.\nThe Functor $G'$ is an equivalence The inclusion $\\mathcal{J} \\hookrightarrow \\mathcal{J}_+$ is fully faithful. For any $(n, [-1]) \\in \\mathcal{J}_+$, the slice category $\\mathcal{J}_{/(n,[-1])}$ is finite. Since $\\mathcal{C}$ admits finite colimits, the Left Kan Extension exists. By definition, $\\operatorname{Fun}^0(\\mathcal{J}_+,\\mathcal{C})$ consists precisely of those functors which are Left Kan extensions of their restriction to $\\mathcal{J}$. Since fully faithful embeddings induce fully faithful restriction functors onto the subcategory of Kan extensions, $G'$ is an equivalence.\nThe Functor $G''$ is an equivalence Finally, we show that $G''$ is an equivalence. This is the subtlest part, which relies on our Technical Lemma.\nLet $\\mathcal{J}_+^{\\leq k}$ be the full subcategory of $\\mathcal{J}_+$ spanned by $(n,[m])$ where either $m \\leq n \\leq k$ or $m = -1$. Let $\\mathcal{D}(k) \\coloneqq \\operatorname{Fun}^0(\\mathcal{J}_+^{\\leq k}, \\mathcal{C})$ be the category of functors satisfying the standard stability condition and the Left Kan Extension condition at $(n,[-1])$ for $n \\le k$.\nWe have a limit decomposition: \\[ \\operatorname{Fun}^0(\\mathcal{J}_+,\\mathcal{C}) \\simeq \\lim \\left( \\cdots \\to \\mathcal{D}(k) \\to \\mathcal{D}(k-1) \\to \\cdots \\to \\mathcal{D}(-1) \\right), \\] where $\\mathcal{D}(-1) \\simeq \\operatorname{Fun}(\\mathbb{Z}_{\\geq 0}, \\mathcal{C})$. It suffices to show that the restriction map $\\mathcal{D}(k) \\to \\mathcal{D}(k-1)$ is an equivalence for all $k \\geq 0$.\nWe decompose this restriction into two steps: \\[ \\mathcal{D}(k) \\xrightarrow{\\theta} \\mathcal{D}'(k) \\xrightarrow{\\theta'} \\mathcal{D}(k-1). \\] Here, $\\mathcal{D}'(k)$ is defined on the domain $\\mathcal{J}_{0}^{\\leq k} \\coloneqq \\mathcal{J}_+^{\\leq k} \\setminus \\{(k,[k])\\}$.\nThe map $\\theta'$: A functor in $\\mathcal{D}'(k)$ is determined by its restriction to $\\mathcal{J}_+^{\\leq k-1}$ plus the Left Kan extension condition at $(k,[-1])$. Since the Kan extension is unique, $\\theta'$ is an equivalence. The map $\\theta$: This restricts a functor from $\\mathcal{J}_+^{\\leq k}$ to $\\mathcal{J}_0^{\\leq k}$. To show this is an equivalence, we need to show that the value at the missing point $(k,[k])$ is uniquely determined. By definition of $\\mathcal{D}(k)$, any $F \\in \\mathcal{D}(k)$ is a Left Kan Extension of $F|_{\\mathcal{J}^{\\leq k}}$. Observe that $\\mathcal{J}^k \\simeq \\Delta_{\\leq k}^{\\operatorname{op}}$ is coinitial in the diagram computing this Kan extension at $(k,[-1])$.\nCrucially, we invoke our Technical Lemma (“Kan extension equivalence”): Since $\\mathcal{C}$ is stable, being a Left Kan Extension from $\\Delta_{\\leq k}^{\\operatorname{op}}$ is equivalent to being a Right Kan Extension from $\\Delta_{+,\\leq k-1}^{\\operatorname{op}} \\simeq \\mathcal{J}_+^{k-1}$.\nNote that $\\mathcal{J}_+^{k-1} \\subseteq \\mathcal{J}_0^{\\leq k}$. This means the value at $(k,[k])$ is determined by a Right Kan extension from data we already possess in $\\mathcal{D}'(k)$. Thus, $\\theta$ is an equivalence.\nSince both steps are equivalences, $G''$ is an equivalence.\nAlternative Perspective on $G$ There is a more high-level way to see that $G$ is an equivalence using the language of localizations.\nWe can regard $\\operatorname{Fun}^0(\\mathcal{J},\\mathcal{C})$ as the functor category $\\operatorname{Fun}(\\mathcal{J}[W^{-1}],\\mathcal{C})$, where $W$ is the set of morphisms $\\{(m,[s]) \\to (n,[s]) \\mid s\\leq m \\leq n\\}$ that we require to be inverted.\nConsider the forgetful functor $p' \\colon \\mathcal{J} \\to \\mathbb{Z}_{\\geq 0}$ given by $(m,[n]) \\mapsto m$. Observe that $p'$ is a cocartesian fibration, and $W$ is precisely the collection of $p'$-cocartesian morphisms. By the fundamental theorem of $\\infty$-categorical colimits (or the description of localizations of cocartesian fibrations), we have an equivalence: \\[ \\mathcal{J}[W^{-1}] \\simeq \\operatorname{colim}_{n \\in \\mathbb{Z}_{\\ge 0}} (\\mathcal{J}_n), \\] where $\\mathcal{J}_n$ is the fiber over $n$. Since each fiber $\\mathcal{J}_n \\simeq \\Delta_{\\leq n}^{\\operatorname{op}}$, the colimit is precisely $\\Delta^{\\operatorname{op}}$. Thus, $\\operatorname{Fun}^0(\\mathcal{J},\\mathcal{C}) \\simeq \\operatorname{Fun}(\\Delta^{\\operatorname{op}}, \\mathcal{C})$.\nApplication: Descent and Comonadicity In the final part of this talk, we apply the stable Dold–Kan correspondence to prove a fundamental result in stable homotopy theory: the descendable Barr–Beck theorem. This result provides a powerful criterion for recovering a category $\\mathcal{C}$ from the category of modules over a “nice” algebra $A$.\nUnless otherwise specified, let $\\mathcal{C}$ be a stable symmetric monoidal category where the tensor product preserves colimits.\nThe Descent Problem Let $A \\in \\mathsf{CAlg}(\\mathcal{C})$ be a commutative algebra. We have a standard adjunction: The central question of descent theory is: When is the comparison functor from $\\mathcal{C}$ to the category of coalgebras over the associated comonad an equivalence? In geometric terms, this asks if the map $A \\to A \\otimes A$ satisfies effective descent.\nAccording to the Lurie–Barr–Beck theorem, this equivalence holds if and only if two conditions are met:\nConservativity: The functor $-\\otimes A$ is conservative (i.e., it reflects equivalences). Convergence: For any cosimplicial object split by $-\\otimes A$, the totalization converges to the original object. Descendable Algebras We focus on a broad class of algebras where “convergence” is guaranteed by “nilpotence”.\nDefinition 10 (Descendable). For every object $A \\in \\mathcal{C}$, we denote by $\\langle A \\rangle \\subseteq \\mathcal{C}$ (or $\\operatorname{Thick}^{\\otimes}(A)$) the smallest full subcategory containing $A$ which is stable under:\nFinite limits and colimits (cofiber sequences), Retracts, Tensor products with arbitrary objects of $\\mathcal{C}$. We say that a commutative algebra $A$ is descendable if $\\mathbb{1}_{\\mathcal{C}}$ is in $\\langle A \\rangle$. Key Tool: Stable Dold–Kan The convergence condition involves the cobar construction $\\operatorname{CB}^{\\bullet}(A)$: Checking whether $\\operatorname{Tot}(\\operatorname{CB}^{\\bullet}(A)) \\simeq \\mathbb{1}$ is typically difficult.\nHowever, the stable Dold–Kan correspondence allows us to translate this cosimplicial problem into a much simpler filtration problem.\nLet $A \\in \\mathsf{Alg}(\\mathcal{C})$ be an associative algebra of $\\mathcal{C}$. Construction 11 (Adams Tower). Let $M \\in \\mathcal{C}$ be an object. We can form a tower in $\\mathcal{C}$ \\[ \\cdots \\to T_2(A,M) \\to T_1(A,M) \\to T_0(A,M) \\simeq M \\] as follows:\n$T_1(A,M)$ is the fiber of the morphism $M \\to M \\otimes A$ induced by $\\mathbb{1}_{\\mathcal{C}} \\to A$, so that $T_1(A,M)$ admits a natural morphism to $M$. More generally, $T_i(A,M) \\coloneqq T_1(A,T_{i - 1}(A,M))$, which admits a natural morphism to $T_{i-1}(A,M)$. Inductively, this defines the functors $T_i$ and the desired tower. We will call this the $A$-Adams tower of $M$. Observe that the $A$-Adams tower of $M$ is simply the tensor product of $M$ with the $A$-Adams tower of $\\mathbb{1}_{\\mathcal{C}}$. Remark(Alternate description). We can write the construction of the Adams tower in another way. Let $I = \\operatorname{fib}(\\mathbb{1}_{\\mathcal{C}} \\to A)$, so that $I$ is a nonunital associative algebra in $\\mathcal{C}$ equipped with a morphism $I \\to \\mathbb{1}_{\\mathcal{C}}$. In fact, we can get a tower \\[ \\cdots \\to I^{\\otimes n} \\to I^{\\otimes (n-1)} \\to \\cdots \\to I^{\\otimes 2} \\to I \\to \\mathbb{1}_{\\mathcal{C}}, \\] and this is precisely the $A$-Adams tower $\\{T_i(A,\\mathbb{1}_{\\mathcal{C}})\\}_{i \\geq 0}$. The $A$-Adams tower for $M$ is obtained by tensoring this with $M$.\nTheorem 12 (DK translation: cobar ↔ Adams). Let $I = \\operatorname{fib}(\\mathbb{1} \\to A)$ be the fiber of the unit map. The cobar construction corresponds to the Adams tower via the stable Dold–Kan correspondence. Specifically, we have a natural equivalence: \\[ \\operatorname{Tot}_n(\\operatorname{CB}^{\\bullet}(A)) \\simeq \\operatorname{cofib}\\left(I^{\\otimes(n+1)} \\to \\mathbb{1}\\right), \\] where $\\operatorname{Tot}_n(\\operatorname{CB}^{\\bullet}(A)) \\coloneqq \\operatorname{Tot}(\\operatorname{CB}^{\\bullet}(A)\\mid_{\\Delta_{\\leq n}})$.\nThis translation implies a crucial fact: The totalization converges ($\\operatorname{Tot} \\simeq \\mathbb{1}$) if and only if the Adams tower vanishes (i.e., is contractible).\nFrom Descendability to Nilpotence We now establish the link between our algebraic definition (descendability) and the geometric convergence (Adams tower).\nTheorem 13 (Nilpotence theorem). A commutative algebra $A$ is descendable if and only if the Adams tower is nilpotent. That is, the tower $\\{I^{\\otimes s}\\}_{s \\ge 0}$ is pro-zero: there exists an integer $N$ such that the transition map $I^{\\otimes (s+N)} \\to I^{\\otimes s}$ is null-homotopic for any $s$. Sketch. Let\u0026rsquo;s check the two implications separately.\n($\\Rightarrow$) Descendability implies Nilpotence:\nLet $\\mathcal{C}_{\\text{nil}}$ be the class of objects $M$ for which the $A$-based Adams tower vanishes (i.e., acts like zero).\nFirst, observe that $A \\otimes I \\simeq 0$. As we discussed, the unit map $A \\to A \\otimes A$ is a split monomorphism (via the multiplication map), so its fiber $A \\otimes I$ is contractible. Consequently, $A \\in \\mathcal{C}_{\\text{nil}}$. One can verify that $\\mathcal{C}_{\\text{nil}}$ forms a thick tensor-ideal. Since $A$ is descendable, we know that the unit lies in the thick ideal generated by $A$, i.e., $\\mathbb{1} \\in \\langle A \\rangle \\subseteq \\mathcal{C}_{\\text{nil}}$. Therefore, the Adams tower for $\\mathbb{1}$ itself must be pro-zero. ($\\Leftarrow$) Nilpotence implies Descendability:\nSuppose the tower is nilpotent. This means there exists some large $N$ such that the map $I^{\\otimes N} \\to \\mathbb{1}$ is null-homotopic. Let\u0026rsquo;s look at the cofiber sequence associated with this map: \\[ I^{\\otimes N} \\xrightarrow{0} \\mathbb{1} \\longrightarrow \\operatorname{cofib}(I^{\\otimes N} \\to \\mathbb{1}). \\] Since the first map is null, the sequence splits (a standard property in triangulated categories), giving us an equivalence: \\[ \\operatorname{cofib}(I^{\\otimes N} \\to \\mathbb{1}) \\simeq \\mathbb{1} \\oplus \\left(I^{\\otimes N}[1]\\right). \\] In particular, $\\mathbb{1}$ is a retract of $\\operatorname{cofib}(I^{\\otimes N} \\to \\mathbb{1})$.\nBy Theorem “DK translation: cobar ↔ Adams”, this cofiber is precisely the partial totalization $\\operatorname{Tot}_{N-1}(\\operatorname{CB}^{\\bullet}(A))$. This object is built from finite limits of $A, A^{\\otimes 2}, \\dots, A^{\\otimes N}$, all of which live in $\\langle A \\rangle$.\nSince $\\langle A \\rangle$ is closed under retracts, we conclude that $\\mathbb{1} \\in \\langle A \\rangle$. Thus, $A$ is descendable.\n$\\square$ Geometric interpretation: Nilpotent thickening This result offers a profound geometric intuition for descent in stable homotopy theory. Classically, for a map to satisfy effective descent (like a faithfully flat map in algebraic geometry), we usually require the cobar construction to be acyclic. However, in the stable setting, descendability is a relaxation of this condition.\nIt asserts that the error term (the ideal $I$) is not necessarily zero, but it is nilpotent (the tower $\\{I^{\\otimes s}\\}$ is pro-zero). Geometrically, this means the map $\\operatorname{Spec}(A) \\to \\operatorname{Spec}(\\mathbb{1})$ behaves like a nilpotent thickening. In classical algebraic geometry, a scheme and its reduction share the same underlying topological space; nilpotent elements only add “infinitesimal” structure without changing the topology. Similarly, a stable category $\\mathcal{C}$ is essentially unchanged if we thicken the unit by a nilpotent ideal. The stable Dold–Kan correspondence is the essential dictionary that allows us to see this “nilpotence” hidden inside the simplicial structure of descent.\nThe Main Result: Descendable Barr–Beck Finally, combining these insights, we prove the main theorem. Theorem 14 (Descendable Barr–Beck theorem). Let $A \\in \\mathsf{CAlg}(\\mathcal{C})$ be a descendable commutative algebra. Then the adjunction $-\\otimes A : \\mathcal{C} \\rightleftarrows \\mathsf{Mod}_A(\\mathcal{C})$ exhibits $\\mathcal{C}$ as comonadic over $\\mathsf{Mod}_{A}(\\mathcal{C})$. In particular, for any $M \\in \\mathcal{C}$, we have a canonical equivalence: \\[ M \\xrightarrow{\\sim} \\operatorname{Tot}\\left( M \\otimes \\operatorname{CB}^{\\bullet}(A) \\right). \\] Proof. We verify the conditions of Lurie–Barr–Beck Theorem ([HA, Theorem 4.7.3.5] ):\nConservativity: Suppose $M \\otimes A \\simeq 0$. Let $\\mathcal{Z} = \\{X \\in \\mathcal{C} \\mid M \\otimes X \\simeq 0\\}$. One can verify that $\\mathcal{Z}$ is stable under finite limits/colimits, retracts, and tensor products. Since $A \\in \\mathcal{Z}$ (by assumption) and $A$ is descendable, we have $\\mathbb{1} \\in \\langle A \\rangle \\subseteq \\mathcal{Z}$. Thus $M \\simeq M \\otimes \\mathbb{1} \\simeq 0$.\nConvergence: We need to show that for any $M$, the natural map $M \\to \\operatorname{Tot}(M \\otimes \\operatorname{CB}^{\\bullet}(A))$ is an equivalence. By the Dold–Kan translation, the fiber of this map is the limit of the Adams tower: $\\lim_s (M \\otimes I^{\\otimes s})$. Since $A$ is descendable, the nilpotence theorem ensures that the tower $\\{I^{\\otimes s}\\}$ is pro-zero. Thus, the inverse limit of the tower is zero. Consequently, the map to the totalization is an equivalence.\n$\\square$ References Jacob Lurie. Higher Algebra. (2017). Link. Jacob Lurie. Higher Topos Theory (AM-170). (2009). Link. Jacob Lurie. Kerodon. (2018). Link. Peter J. Haine; Maxime Ramzi; Jan Steinebrunner. Fully faithful functors and pushouts of ∞-categories. (2025). Link. Claudius Heyer; Lucas Mann. 6-Functor Formalisms and Smooth Representations. (2024). Link. Akhil Mathew; Niko Naumann; Justin Noel. Nilpotence and descent in equivariant stable homotopy theory. (2017). Link. Akhil Mathew. The Galois group of a stable homotopy theory. (2016). Link. A chain complex $C_*$ in an additive category $\\mathcal{A}$ is called connective if it is concentrated in non-negative degrees, i.e., $C_n = 0$ for all $n \u003c 0$.\u0026#160;\u0026#x21a9;\u0026#xfe0e;\n","permalink":"https://ou-liu-red-sugar.github.io/en/notes/stable-doldkan-and-descent/","summary":"Unified exposition of the stable Dold–Kan correspondence and its application to descent theory in stable categories.","title":"Stable Dold–Kan and Descent"},{"content":"","permalink":"https://ou-liu-red-sugar.github.io/en/notebook/call-payoff/","summary":"","title":"A call option: payoff is not profit"},{"content":"Ou Liu (刘欧) I am learning stochastic processes and financial markets while testing an investing research framework in live practice. I use this site to keep public notes on what I am learning, how the framework changes, and where experience disagrees with the model.\nThe framework is still being tested. Nothing here should be read as financial advice, and detailed trade records and position data remain private.\nLeaving mathematics was not only an academic change. My years in Germany left serious physical problems, including severe dry eye and persistent inflammation around the throat and nose, and also a depressive period that I am still recovering from. Even after leaving, the body has not simply returned to normal, and mentally I am still far from fully recovered. I do not want this site to be centered on that period, but it is part of the background: I am still trying to do better.\nEarlier work I previously studied mathematics, with interests including motivic homotopy theory, derived algebraic geometry, and higher category theory. I have stepped away from academic mathematics; the earlier notes, talks, and publications are preserved here as an archive rather than an active research programme.\nMath Notes Archive Publications Archive Wiki Archive Contact Email: ouliuredsugar@gmail.com\nLanguages Chinese (native) and English (working).\nResearch identifier ORCID 0009-0006-5593-4339\n","permalink":"https://ou-liu-red-sugar.github.io/en/about/","summary":"\u003ch1 id=\"ou-liu-刘欧\"\u003eOu Liu (刘欧)\u003c/h1\u003e\n\u003cp\u003eI am learning stochastic processes and financial markets while testing an\ninvesting research framework in live practice. I use this site to keep public\nnotes on what I am learning, how the framework changes, and where experience\ndisagrees with the model.\u003c/p\u003e\n\u003cp\u003eThe framework is still being tested. Nothing here should be read as financial\nadvice, and detailed trade records and position data remain private.\u003c/p\u003e\n\u003cp\u003eLeaving mathematics was not only an academic change. My years in Germany left\nserious physical problems, including severe dry eye and persistent inflammation\naround the throat and nose, and also a depressive period that I am still\nrecovering from. Even after leaving, the body has not simply returned to normal,\nand mentally I am still far from fully recovered. I do not want this site to be\ncentered on that period, but it is part of the background: I am still trying to\ndo better.\u003c/p\u003e","title":"About"}]