Ambidexterity and the universality of finite spans
Yonatan Harpaz
Abstract.
Pursuing the notions of ambidexterity and higher semiadditivity as developed by Hopkins and Lurie, we prove that the span ∞-category of m-finite spaces is the free m-semiadditive ∞-category generated by a single object. Passing to presentable ∞-categories we obtain a description of the free presentable m-semiadditive ∞-category in terms of a new notion of m-commutative monoids, which can be described as spaces in which families of points parameterized by m-finite spaces can be coherently summed. Such an abstract summation procedure can be used to give a formal ∞-categorical definition of the finite path integral described by Freed, Hopkins, Lurie and Teleman in the context of 1-dimensional topological field theories.
Contents
-
1 Introduction
-
2 Preliminaries
-
2.1 ∞-Categories of spans
-
2.2 Spans of finite spaces
-
2.3 Colimits in ∞-categories of spans
-
3 Ambidexterity and duality
-
4 The universal property of finite spans
-
5 Applications
-
5.1 m-semiadditive ∞-categories as modules over spans
-
5.2 Higher commutative monoids
-
5.3 Decorated spans
-
5.4 Higher semiadditivity and topological field theories
1. Introduction
The notion of ambidexterity, as developed by Lurie and Hopkins in [11] in the ∞-categorical setting, is a duality phenomenon concerning diagrams φ:K⟶C whose limit and colimit coincide. The simplest case where this can happen is when K is empty. In this case a colimit of K is simply an initial object of C, and a limit of K is a final object of C. If C has both an initial object ∅∈C and a final object ∗∈C then there is an essentially unique map ∅⟶∗. Given that both ∅ and ∗ exist there is hence a canonical way to require that they coincide, namely, asserting that the unique map ∅⟶∗ is an equivalence. In this case we say that C is pointed. An object 0∈C which is both initial and final is called a zero object.
Generalizing this property to cases where K is non-empty involves an immediate difficulty. In general, even if φ:K⟶C admits both a limit and a colimit, there is apriori no natural choice of a map relating the two. Informally speaking, choosing a map colimx∈Kφ(x)⟶limx∈Kφ(x) is the same as choosing, compatibly for every two objects x,y∈K, a map φ(x)⟶φ(y) in C. The diagram φ, on its part, provides such maps φ(e):φ(x)⟶φ(y) for every e∈MapK(x,y). We thus have a whole space of maps φ(e):φ(x)⟶φ(y) at our disposal, but no a-priori way to choose a specific one naturally in both x and y.
To see how this problem might be resolved assume for a moment that C is pointed, i.e., admits a zero object 0∈C, and that MapK(x,y) is either empty or contractible for every x,y∈K (i.e., K is equivalent to a partially ordered set, or a poset).
Then for every X,Y∈C there is a distinguished point in MapC(X,Y), namely the essentially unique map which factors as f:X⟶0⟶Y, where 0∈C is a zero object. We may call this map X⟶Y the zero map. We then obtain a choice of a map Nx,y:φ(x)⟶φ(y) which is natural in both x and y: if MapK(x,y) is contractible then we take Nx,y to be φ(e) for the essentially unique map e:x⟶y, and if MapK(x,y) is empty then we just take the zero map. It is then meaningful to ask whether the limits and colimit of a diagram φ:K⟶C coincide: assuming both of them exist, we may ask whether the map Nφ:colimφ⟶limφ we have just constructed is an equivalence.
For general posets and general pointed ∞-categories C the map Nφ is rarely an equivalence. For example, if K=[1] then Nφ is simply the [math]-map. However, there is a class of posets for which this property turns out to yield something interesting: the class of finite sets, i.e., finite posets for which the order relation is the equality. In this case we may identify colimφ≃∐x∈Kφ(x) and limφ≃∏x∈Kφ(x). The map
[TABLE]
we constructed above is then given by the “matrix” of maps [Nx,y]x,y∈K, where Nx,y:φ(x)⟶φ(y) is the identity if x=y and the zero map if x=y. When a pointed ∞-category satisfies the property that Nφ is an equivalence for every finite set K and every diagram φ:K⟶C we say that C is semiadditive. Examples of semiadditive ∞-categories include all abelian (discrete) categories and all stable ∞-categories. For more general examples, if C is any ∞-category with finite products then the ∞-category MonE∞(C) of E∞-monoids in C is semiadditive.
In their paper [11], Hopkins and Lurie observed that the passage from pointed ∞-categories to semiadditive ones is just a first step in a more general process. Suppose, for example, that C is a semiadditive ∞-category. Then for every X,Y∈C, the mapping space MapC(X,Y) carries a natural structure of an E∞-monoid, where the sum of two maps f,g:X⟶Y is given by the composition
[TABLE]
Now suppose that K is an ∞-category whose mapping spaces are equivalent to finite sets and that φ:K⟶C is a diagram which admits both a limit and colimit. Then we may construct a natural map colimφ⟶limφ by choosing, for every x,y∈K, the map
[TABLE]
where the sum is taken with respect to the natural E∞-monoid structure on MapC(X,Y). We may now ask if the induced map
[TABLE]
which is often called the norm map, is an equivalence. When (2) is an equivalence for every finite groupoid K we say that C is 1-semiadditive. We note that when C is stable the cofiber of (2) is also known as the associated Tate object, and hence 1-semiadditivity in the stable context was often considered as a phenomenon of Tate vanishing.
This vanishing happens in many examples of interest, e.g., when C is a Q-linear ∞-category,
or when C is the ∞-category of K(n)-local spectra, where K(n) is the n’th Morava K-theory at a prime p (Hovey–Sadofsky–Greenlees [7, 4]). Hopkins and Lurie constructed an inductive approach for continuing this process, where at the m’th stage one considers ∞-groupoids whose homotopy groups are all finite and vanish above dimension m. In this paper we will refer to such ∞-groupoids as m-finite spaces. This yields the notion of m-semiadditive ∞-category for every m≥−1.
The main result of Hopkins–Lurie [11] is that the ∞-category of K(n)-local spectra is not just 1-semiadditive, but in fact m-semiadditive for every m. A similar result was recently established for the ∞-category of T(n)-local spectra by Carmeli–Schlank–Yanovski [2], generalizing a theorem of Khun [8] on the 1-semiadditivity of T(n)-local spectra, and using, among other things, results from the present paper.
Our goal in this work is to form a link between the theory of higher semiadditivity as developed in [11] and the ∞-category of spans of m-finite spaces. To understand the role of this ∞-category, let us consider for a moment the central role played by the ∞-category Spfin of finite spectra in the theory of stable ∞-categories. To begin, Spfin can be described as the free stable ∞-category generated by a single object \SS∈Spfin, the sphere spectrum. Furthermore, one can use Spfin in order to characterize stable ∞-categories inside the ∞-category Catfin of all small ∞-categories with finite colimits (and right exact functors between them). Indeed, Catfin carries a natural symmetric monoidal structure (see [10, §4.8.1]) whose unit is the the smallest full subcategory of spaces Sfin⊆S closed under finite colimits. One can then show that Spfin is an idempotent object in Catfin in the following sense: the suspension spectrum functor Σ+∞:Sfin⟶Spfin induces an equivalence Spfin≃Spfin⊗Sfin⟶≃Spfin⊗Spfin. The fact that Spfin is idempotent has a remarkable consequence: it endowed Spfin with a canonical commutative algebra structure in Catfin such that the forgetful functor ModSpfin(Catfin)⟶Catfin is fully-faithful. From a conceptual point of view, this fact can be described as follows: given an ∞-category with finite colimits C, the structure of being an Spfin-module is essentially unique once it exists, and can hence be considered as a property. One can then show that this property coincides with being stable. In other words, stable ∞-categories are exactly those C∈Catfin which admit an action of Spfin, in which case the action is essentially unique.
This double aspect of stability, as either a property or a structure, is very useful. On one hand, in a higher categorical setting structures are often difficult to construct explicitly, while properties are typically easier to define and to check. On the other hand, having a higher categorical structure available is often a very powerful tool. An equivalence between a given property and the existence of a given structure allows one to enjoy both advantages simultaneously. Indeed, while the property of being stable is easy to define and often to establish, once we know that a given ∞-category is stable we can use the canonically defined Spfin-module structure at our disposal. For example, it implies that any stable ∞-category is canonically enriched in spectra, and in particular its mapping spaces carry a canonical E∞-group structure.
In this paper we describe a completely analogous picture for the property of m-semiadditivity. Let Km be the set of equivalence classes of m-finite Kan complexes. Let CatKm be the ∞-category of small ∞-categories which admit Km-indexed colimits and functors which preserve Km-indexed colimits between them. Then CatKm carries a natural symmetric monoidal structure whose unit is the ∞-category Sm of m-finite spaces. Another object contained in CatKm is the ∞-category Span(Sm) whose objects are m-finite spaces and whose morphisms are given by spans (see 2 for a formal definition). Our main result can then be phrased as follows:
Theorem 1.1**.**
Span(Sm)* is the free m-semiadditive ∞-category generated by a single object. More precisely, if D is an m-semiadditive ∞-category then evaluation at ∗∈Span(Sm) induces an equivalence*
[TABLE]
where the left hand side denotes the ∞-category of functors which preserve Km-indexed colimits.
Furthermore, we will show in §5.1 that Span(Sm) is in fact an idempotent object of CatKm. Consequently, Span(Sm) carries a canonical commutative algebra structure in CatKm, and the forgetful functor ModSpan(Sm)(CatKm)⟶CatKm is fully-faithful. The structure of a Span(Sm)-module on a given ∞-category C∈CatKm is hence essentially a property. This property is exactly the property of being m-semiadditive.
The flexibility of switching the point of view between a property and a structure seems to be especially useful in the setting of m-semiadditivity. Indeed, while m-semiadditivity is a property (involving the coincidence of limits and colimits indexed by m-finite spaces) it is quite hard to define directly. The reason, as described above, is that in order to define the various norm maps which are required to induce the desired equivalences, one needs to use the fact that the ∞-category in question is already known to be (m−1)-semiadditive. Even then, describing these maps requires an elaborate inductive process (see [11, §4]). On the other hand, having a canonical Span(Sm−1)-module structure on an (m−1)-semiadditive ∞-category leads to a direct and short definition of when an (m−1)-semiadditive ∞-category is m-semiadditive (see, e.g., Corollary 3.18).
The picture becomes even more transparent when one passes to the world of presentable ∞-categories. Let PrL denote the ∞-category of presentable ∞-categories and left functors between them. Then one has a natural symmetric monoidal functor PKm:CatKm⟶PrL which sends C∈CatKm to the ∞-category PKm(C) of presheaves of spaces on C that take Km-indexed colimits in C to limits of spaces. Applying this functor to Span(Sm) one obtains a presentable ∞-category which is equivalent to a certain ∞-category of higher commutative monoids, and which we will investigate in §5.2. Informally speaking, an m-commutative monoid can be described as a space X endowed with the following type of structure: for any map f:K⟶X from an m-finite space K to X, we have an associated point ∫Kf∈X, which we can think of as the “continuous sum” of the family of points {f(x)}x∈K. This association is of course required to satisfy various compatibility conditions. For m=0 we have that f is indexed by a finite set and we obtain the structure of an E∞-monoid. When m=−1 this is just the structure of a pointed space. Now since the functor PKm is monoidal the ∞-category Monm of m-commutative monoids is idempotent as a presentable ∞-category, and the property characterizing Monm-modules in PrL is again m-semiadditivity. There is, however, an advantage for considering Monm in addition to Span(Sm). Note that given an m-semiadditive ∞-category C, the canonical action of Span(Sm) described above is not closed in general, i.e., it doesn’t endow C with an enrichment in Span(Sm). It does, however, endow C with an enrichment in Monm. In particular, mapping spaces in C are m-commutative monoids, and so we have a canonically defined summation over families of maps indexed by m-finite spaces. This structure can be used in order to redefine the norm maps of [11] and hence to define when an (m−1)-semiadditive ∞-category is m-semiadditive (in a manner analogous to the cases of m=−1,0,1 described above). Indeed, for every m-finite space K, any diagram φ:K⟶C and any x,y∈K we obtain a natural map
[TABLE]
by using the (m−1)-commutative monoid structure of MapC(x,y) and the fact that the mapping spaces in K are (m−1)-finite. The compatible collection of maps Nx,y then induces a map
[TABLE]
which coincide with the norm maps constructed in [11]. In particular, an (m−1)-semiadditive ∞-category C is m-semiadditive if and only if the maps Nφ are equivalences for every K∈Km and every φ:K⟶C.
In the final part of the paper we will explain a relation between the above results and 1-dimensional topological field theories, specifically with respect to the finite path integral described in [3, §3]. In particular, our approach allows one to formally define this finite path integral whenever the target ∞-category is m-semiadditive. This requires a description of the free m-semiadditive ∞-category generated by an arbitrary ∞-category D, which we establish in 5.3 using the formalism of decorated spans. The link with finite path integrals is then described in 5.4.
2. Preliminaries
In this paper we work in the higher categorical setting of ∞-categories as set up in [9]. In particular, by an ∞-category we will always mean a simplicial set C which has the right lifting property with respect to inner horns. We will often refer to the vertices of C as objects and to edges in C as morphisms. In the same spirit, if I is an ordinary category then we will often depict maps N(I)⟶C to an ∞-category C in diagrammatic form, as would be the case if C was an ordinary category. By a space we will always mean a Kan simplicial set, which we will generally regard as an ∞-groupoid, i.e., a ∞-category in which every morphism is invertible. Given an ∞-category C, we will denote by C≃, the maximal subgroupoid (i.e, maximal sub Kan complex) of C.
2.1. ∞-Categories of spans
In this section we will recall the definition of the ∞-category of spans in a given ∞-category C with admits pullbacks. To obtain more flexibility it will be useful to consider a slightly more general case, following the approach of Barwick [1]. Recall that a functor F:C⟶D between ∞-categories is called
faithful if for every X,Y∈C the induced map FX,Y:MapC(X,Y)⟶MapD(F(X),F(Y)) is (−1)-truncated (i.e., each homotopy fiber of FX,Y is either empty or contractible). Equivalently, F is faithful if the induced map Ho(C)⟶Ho(D) on homotopy categories is faithful and the square
[TABLE]
is homotopy Cartesian. In this case we will also say that C is a subcategory of D (and will often omit the explicit reference to F and use the abusive notation C⊆D). A subcategory C⊆D is called wide if the induced map C≃⟶D≃ is an equivalence of spaces. Given a wide subcategory C⊆D and a morphism f in D we will say that f belongs to C if it is equivalent in the arrow category of D to a morphism in the image of C.
Definition 2.1**.**
Let C be an ∞-category. A weak coWaldhausen structure on C is a wide subcategory C†⊆C such that any diagram
[TABLE]
in which g belongs to C† extends to a pullback square
[TABLE]
in which g′ belongs to C†. In this case we will refer to the pair (C,C†) as a weak coWaldhausen ∞-category.
Example 2.2*.*
For any ∞-category C the maximal subgroupoid C≃⊆C is a weak coWaldhausen structure on C. If C admits pullbacks then C itself is a weak coWaldhausen structure as well. We may consider these examples as the minimal and maximal coWaldhausen structures respectively.
Given a weak coWaldhausen ∞-category (C,C†) we would like to define an associated ∞-category Span(C,C†). Informally speaking, Span(C,C†) is the ∞-category whose objects are the objects of C and whose morphisms are given by diagrams of the form
[TABLE]
such that p belongs to C†. We will refer to such diagrams as spans in (C,C†). A composition of two spans can be described by forming the diagram
[TABLE]
in which the central square is a pullback square, and the external span is the composition of the two bottom spans. Note that since p and g belong to C† Definition 2.1 insures that this pullback exists and g∘s belongs to C†. To define Span(C,C†) formally, it is convenient to use the twisted arrow category Tw(Δn) of the n-simplex Δn. This ∞-category can be described explicitly as the nerve is the category whose objects are pairs (i,j)∈[n]×[n] with i≤j and such that Hom((i,j),(i′,j′)) is a singleton if i′≤i≤j≤j′ and empty otherwise. Given a weak coWaldhausen ∞-category (C,C†) we will say that a map f:Tw(Δn)op⟶C is Cartesian if for every i′≤i≤j≤j′∈[n] the square
[TABLE]
is Cartesian and its vertical maps belong to C†.
Definition 2.3** (cf.[1]).**
Let (C,C†) be a weak coWaldhausen ∞-category. The span ∞-category Span(C,C†) is the simplicial set whose set of n-simplices is the set of Cartesian maps f:Tw(Δn)op⟶C.
By [1, §3.4-3.8] the simplicial set Span(C,C†) is always an ∞-category. We refer the reader to loc. cit. for a more detailed discussion of this construction and its properties.
Remark 2.4*.*
Let (C,C†) be a weak coWaldhausen ∞-category. Unwinding the definitions we see that the objects of Span(C,C†) are the objects of C and the morphisms are given by spans of the form (5) such that p belongs to C†. Furthermore, a homotopy from the span X⟵Z⟶Y to the span X⟵Z′⟶Y is given by an equivalence η:Z⟶Z′ over X×Y. Elaborating on this argument one can identify the mapping space from X to Y in C with the full subgroupoid of (C/X×Y)≃ spanned by objects of the form (5) such that p belongs to C†.
Remark 2.5*.*
It follows from Remark 2.10 that if (C†)′⊆C†⊆C are two weak coWaldhausen structures on C then the associated functor Span(C,(C†)′)⟶Span(C,C†) is a subcategory inclusion. In particular, C≃Span(C,C≃) can be considered as a subcategory of Span(C,C†) for any coWaldausen structure C†. In the cases considered in this paper this subcategory will often be wide, see, e.g., Corollary 2.14.
2.2. Spans of finite spaces
Definition 2.6**.**
Let X be a space. For n≥0 we say that X is n-truncated if πi(X,x)=0 for every i>n and every x∈X. We will say that X is (−1)-truncated if it is either empty of contractible and that X is (−2)-truncated if it is contractible. We will say that a map f:X⟶Y is n-truncated if the homotopy fiber of f over every point of Y is n-truncated.
Definition 2.7**.**
Let X be a space. For n≥−2 we will say that X is n-finite if it is n-truncated and all its homotopy groups/sets are finite. We will say that X is π-finite if it is n-finite for some n.
The collection of weak equivalence types of n-finite Kan complexes is a set. We will denote by Kn be a complete set of representatives of equivalence types of n-finite Kan complexes.
Warning 2.8**.**
The notion of a finite space should not be confused with the notion of a space equivalent to a simplicial set with finitely many non-degenerate simplices.
Let SetΔ denote the category of simplicial sets and let Kan⊆SetΔ denote the full subcategory spanned by Kan simplicial sets. Then Kan is a fibrant simplicial category and its coherent nerve S:=N(Kan) is a model for the ∞-category of spaces. We let Sn⊆S denote the full subcategory spanned by n-finite spaces. The condition of being n-finite is closed under pullbacks, which means that the ∞-category Sn has pullbacks and those are computed in S. For −2≤m≤n we may consider the wide subcategory Sn,m⊆Sn containing all objects and whose mapping spaces are spanned by the m-truncated maps.
Then (Sn,Sm,n) is a weak coWaldhausen ∞-category, and we will denote by
[TABLE]
the associated span ∞-category (see §2.1).
We note that Sn,−2 is just the maximal subgroupoid of Sn and hence Sn−2≃Sn. By [6, Theorem 1.3(iv)]) the Cartesian monoidal product on Sn induces a symmetric monoidal structure on Snm, which is given on the level of objects by (X,Y)↦X×Y, and on the level of morphisms by taking levelwise Cartesian products of spans. We remark that this monoidal structure on Snm is not the Cartesian one.
2.3. Colimits in ∞-categories of spans
In this section we will prove some basic results concerning Kn-indexed colimits in Snm. We begin with the following basic observation:
Lemma 2.9**.**
The ∞-category Sn admits Kn-indexed colimits which are preserved and detected by the inclusion Sn⊆S.
Proof.
Since the inclusion Sn⊆S is fully-faithful it detects colimits, i.e., every cone diagram in Sn which is a colimit diagram in S is already a colimit diagram in Sn. Since S admits all small colimits it will suffice to show that Sn⊆S is closed under Kn-indexed colimits. More explicitly, we need to show that if X is an n-finite Kan complex and φ:X⟶S is an X-indexed diagram of spaces such that φ(x) is n-finite for every x∈X then the colimit of φ is also n-finite. For this it is convenient to use the fact that colimits in spaces can be modeled by the total space of the left fibration p:Eφ⟶X classified by φ (see [9, Corollary 3.3.4.6]). Since X is a Kan complex Eφ is also a Kan complex and p is a Kan fibration. We thus need to show that the total space of a Kan fibration with an n-finite base and n-finite fibers is also n-finite. But this is now a direct consequence of the long exact sequence of homotopy groups associated to a Kan fibration.
∎
Remark 2.10*.*
Lemma 2.9 implies that we can model the colimit of a diagram φ:X⟶Sn by the total space of the Kan fibration Eφ⟶X classified by φ. More precisely, for such a φ the total space Eφ is n-finite
and the collection of fiber inclusions {φ(x)≃(Eφ)x⟶Eφ}x∈X exhibits Eφ as the colimit of φ in Sn.
Given a space X and a point x∈X we will denote by ix:∗⟶X the map which sends the point to x.
Lemma 2.11**.**
Let D be an ∞-category which admits Kn-indexed colimits and let F:Sn⟶D be a functor. Then F preserves Kn-indexed colimits if and only if for every X∈Sn the collection {F(ix):F(∗)⟶F(X)}x∈X exhibits F(X) as the colimit of the constant X-indexed diagram with value F(∗).
Proof.
The “only if” direction is due to the fact that the collection of maps ix:∗⟶X exhibits X as the colimit in Sn of the constant X-indexed diagram with value ∗ (see Remark 2.10). Now suppose that for every X∈Sn the collection {F(ix)}x∈X exhibits F(X) as the colimit of the constant X-indexed diagram with value F(∗). Let Y∈Kn be an n-finite space and let φ:Y⟶Sn be a Y-indexed diagram in Sn. Let p:Eφ⟶Y be the Kan fibration classified by φ, so that, in light of Remark 2.10, we have that Eφ is n-finite and the collection of fiber inclusions {(Eφ)y≃φ(y)⟶Eφ}y∈Y exhibits Eφ as the colimit of φ in Sn. To finish the proof we need to show that the collection of maps {F(φ(y))⟶F(Eφ)}y∈Y exhibits F(Eφ) as the colimit of the diagram ψ:=F∘φ:Y⟶D.
Consider the lax commutative diagram
[TABLE]
where the left diagonal functor is the constant functor with value F(∗), and the right diagonal functor sends the point to F(Eφ). By our assumption for every y∈Y the collection of maps {F(iz):F(∗)⟶F(φ(y))}z∈φ(y) exhibits ψ(y)=F(φ(y)) as the colimit in D of the constant φ(y)-indexed diagram with value F(∗). Identifying φ(y) with the homotopy fiber of p:Eφ⟶Y over y we may conclude that left lax triangle in (6) exhibits ψ:Y⟶D as a left Kan extension along p:Eφ⟶Y of the constant diagram Eφ⟶D with value F(∗). Similarly, our assumption implies that the collection of maps {F(iz):F(∗)⟶F(Eφ)}z∈Eφ exhibits F(Eφ) as the colimit in D of the constant Eφ-indexed diagram with value F(∗), and so the external lax triangle is a left Kan extension diagram as well. It then follows the right lax triangle is a left Kan extension triangle by the pasting lemma for left Kan extensions. But this exactly means that the collection of maps {ψ(y)⟶F(Eφ)}y∈Y exhibits F(Eφ) as the colimit in D of the diagram ψ:Y⟶D, as desired.
∎
Proposition 2.12**.**
For every −2≤m≤n the subcategory inclusion Sn↪Snm preserves Kn-indexed colimits.
Proof.
By Lemma 2.11 it will suffice to show that for every X∈Snm, the collection of morphisms {ix:∗⟶X}x∈X exhibit X as the colimit of the constant diagram {∗}x∈X in Snm. Equivalently, we need to show that given any test object Y∈Snm, the map
[TABLE]
determined by the collection of restriction maps ix∘(−):MapSnm(X,Y)⟶MapSnm(∗,Y) is an equivalence of spaces. Let pX:X×Y⟶X denote the projection on the first coordinate. By Remark 2.4 we may identify MapSnm(X,Y) with the full subgroupoid of ((Sn)/X×Y)≃ spanned by those objects Z⟶X×Y such that the composite map Z⟶X×Y⟶pXX is m-truncated. Under this equivalence, the restriction map ix∘(−) is induced by the pullback functor i{x}×Y∗:(Sn)/X×Y⟶(Sn)/{x}×Y.
Now by the straightening-unstraightening equivalence the collection of pullback functors i{x}×{y}∗:S/X×Y⟶S induces an equivalence of ∞-categories
[TABLE]
Using straightening-unstraightening again and the equivalence Fun(X×Y,S)≃Fun(X,Fun(Y,S)) we may conclude that the collection of pullback functors
i{x}×Y∗:S/X×Y⟶S/{x}×Y induces an equivalence of ∞-categories
[TABLE]
and hence an equivalence on the corresponding maximal subgroupoids
[TABLE]
Given an object Z⟶X×Y in (S/X×Y)≃, the condition that the composite map Z⟶X×Y⟶pXX is an m-truncated map is equivalent to the condition that the essential image of StX≃(Z):X⟶(S/Y)≃ is contained in ((Sm)/Y)≃. Furthermore, since X is n-truncated this condition automatically implies that Z is n-truncated. Identifying ((Sm)/Y)≃ with MapSnm(∗,Y) we may then conclude that the collection of pullback functors i{x}×Y∗:(Sn)/X×Y⟶(Sn)/{x}×Y induces an equivalence of ∞-groupoids
[TABLE]
as desired.
∎
Lemma 2.13**.**
Let −2≤m≤n be integers. Then any equivalence in Snm is homotopic to the image of an equivalence in Sn⊆Snm.
Proof.
Given a span
[TABLE]
we may associate to it the functor p!q∗:Fun(Y,S)⟶Fun(X,S), where q∗:Fun(Y,S)⟶Fun(Z,S) is the restriction functor and p!:Fun(Z,S)⟶Fun(X,S) is given by left Kan extension. The Beck-Chevalley condition (see [11, Proposition 4.3.3]) implies that this association respects composition of spans up to homotopy. It follows that if (7) is an equivalence in Snm then the induced functor p!q∗:Fun(Y,S)⟶Fun(X,S) is an equivalence of ∞-categories. In particular, p!q∗ preserves terminal objects. Since the restriction functor q∗ also preserves terminal object it now follows that p!(∗):X⟶S is the terminal functor. On the other hand, by the pointwise construction of left Kan extensions p!(∗) is also the functor which associates to x∈X the homotopy fiber Zx of p over x. It then follows that the homotopy fibers of p are all contractible, and so p is an equivalence. Let r:X⟶Z be a homotopy inverse of p. Then (7) is homotopic to the image in MapSnm(X,Y) of the arrow q∘r∈MapSn(X,Y), as desired.
∎
Corollary 2.14**.**
The subcategory inclusion Sn⊆Snm is wide.
Corollary 2.15**.**
Let X be a space. Then any X-indexed diagram in Snm comes from an X-indexed diagram in Sn.
Corollary 2.16**.**
For every −2≤m≤n the ∞-category Snm admits Kn-indexed colimits. Furthermore, if F:Snm⟶D is any functor then F preserves Kn-indexed colimits if and only if the composed functor Sn↪Snm⟶D preserves Kn-indexed colimits.
Proof.
Combine Corollary 2.15 and Proposition 2.12. ∎
Corollary 2.17**.**
The symmetric monoidal product Snm×Snm⟶Snm preserves Kn-indexed colimits in each variable separately.
Proof.
We have a commutative diagram
[TABLE]
Where the left and middle vertical maps are the respective Cartesian product and right vertical map is the one induced by the Cartesian product on span ∞-categories. Since Cartesian products in S preserve colimits in each variable separately and the inclusion Sn↪S preserves products and Km-indexed colimits (Lemma 2.9) we get that Cartesian products in Sn preserve Kn-indexed colimits in each variable separately. Since the functor Sn⟶Snm is essentially surjective the desired result now follows from Corollary 2.15 and Proposition 2.12. ∎
We will denote by CatKn the ∞-category of small ∞-categories which admit Kn-indexed colimits and functors which preserve Kn-indexed colimits between them. If C,D are ∞-categories which admit Kn-indexed colimits then we denote by FunKn(C,D)⊆Fun(C,D) the full subcategory spanned by those functors which preserve Kn-indexed colimits. Recall that by [10, corollary 4.8.4.1] we may endow this ∞-category with a symmetric monoidal structure CatKn⊗⟶N(Fin∗) such that for C,D∈CatKn their tensor product C⊗KnD admits a map C×D⟶C⊗KnD from the Cartesian product and is characterized by the following universal property: for every ∞-category E∈CatKn the restriction
[TABLE]
is fully-faithful and its essential image is spanned by those functors C×D⟶E which preserve Kn-indexed colimits in each variable separately. In particular, we may identify commutative algebra objects in CatKm with symmetric monoidal ∞-categories which admit Km-indexed colimits and such that the monoidal product preserves Km-indexed colimits in each variable separately.
Corollary 2.16 and Corollary 2.17 now imply the following:
Corollary 2.18**.**
The ∞-category Snm together with its symmetric monoidal structure determines a commutative algebra object in CatKm⊗
3. Ambidexterity and duality
Definition 3.1** (see [11, Definition 4.4.2]).**
Let D be an ∞-category and −2≤m an integer. Following [11], we shall say that D is m-semiadditive if D admits Km-indexed colimits and every m-finite space is D-ambidextrous in the sense of [11, Definition 4.3.4].
Informally speaking, m-semiadditive ∞-categories are ∞-categories in which Km-indexed colimits and limits coincide. The reason we do not recall [11, Definition 4.3.4] in full is that it requires a somewhat elaborate inductive process in order to define the maps which induce the desired equivalence. That said, if D is an ∞-category with Km-indexed colimits which admits a compatible action of Smm−1, then we will see below that the condition that D is m-semiadditive can be expressed rather succinctly (see Proposition 3.17 and Corollary 3.18). On the other hand, the main result of this paper (Theorem 4.1 below) implies in particular that any (m−1)-semiadditive ∞-category which admits Km-indexed colimits acquires a canonical action of Smm−1, and so this approach can be considered as an alternative way to define higher semiadditivity.
Examples 3.2*.*
- (1)
An ∞-category D is (−1)-semiadditive if and only if it is pointed, i.e., contains an object which is both initial and final.
2. (2)
Every stable ∞-category is [math]-semiadditive.
3. (3)
Let D be an ∞-category which admits finite products. Then the ∞-category of E∞-monoid objects in D is [math]-semiadditive (see §5.2).
4. (4)
For any prime p and integer n≥0, the ∞-category of K(n)-local spectra is m-semiadditive for any m (where K(n) denotes the Morava K-theory spectrum at height n). This is the main result of [11].
5. (5)
For any prime p and integer n≥0, the ∞-category of T(n)-local spectra is m-semiadditive for any m (where T(n) denotes the telescope of a finite p-local type n spectrum). This is the main result of [2].
6. (6)
For every −2≤m≤n the ∞-category Snm is m-semiadditive (see Corollary 3.20 below).
7. (7)
The ∞-category CatKm of small ∞-categories which admit Km-indexed colimits is m-semiadditive (see Proposition 5.26
below).
8. (8)
If D is m-semiadditive then Dop is m-semiadditive.
Notation 3.3**.**
For a space X and an ∞-category D, we will typically refer to functors X⟶D as D-valued local systems on X. We will denote by DX:=Fun(X,D) the ∞-category of D-valued local system on X. Given a map f:X⟶Y of spaces we have a restriction functor f∗:DY⟶DX. If D admits Km-indexed colimits and the homotopy fibers of f are m-finite then f∗ admits a left adjoint f!:DX⟶DY given by left Kan extension. If in addition D is m-semiadditive then f! is also right adjoint to f∗. We will say that a natural transformation u:Id⇒f!f∗ exhibits f as D-ambidextrous if it is a unit of an adjunction f∗⊣f!.
In this section we fix an integer m≥−1 and consider the situation where D is an ∞-category satisfying the following properties:
Hypothesis 3.4**.**
- (1)
D* admits Km-indexed colimits.*
2. (2)
D* is (m−1)-semiadditive.*
3. (3)
D* admits a structure of a Smm−1-module in CatKm. In other words, there is an action of the monoidal ∞-category Smm−1 on D such that the action map Smm−1×D⟶D preserves Km-indexed colimits in each variable separately. Following [11], we will denote the functor X⊗(−) also by [X]:D⟶D.*
Our first goal in this section is to show that if D satisfies Hypothesis 3.4, and if f:X⟶Y is an (m−1)-truncated map of m-finite spaces, then a unit transformations u:Id⇒f!f∗ exhibiting f as D-ambidextrous can be written in terms of the Smm−1 action on D (see Lemma 3.12). We will use this description in order to give an explicit criteria characterization those D satisfying 3.4 which are also m-semiadditive (see Proposition 3.17 and Corollary 3.18).
Let X∈Smm−1 be an object. Recall that for a point x∈X we denote by ix:∗⟶X the map in Sm⊆Smm−1 which sends ∗ to the point x. By Proposition 2.12 and Lemma 2.11, for any object D∈D the collection of induced maps
[TABLE]
exhibits [X](D) as the colimit in D of the constant X-indexed diagram with value [∗](D)=D. Letting D vary we obtain that the maps [ix]:[∗]⇒[X] exhibit [X] as the colimit in Fun(D,D) of the constant diagram {Id}x∈X. In particular, we may identify the functor [X] with the composed functor D⟶p∗DX⟶p!D, where p:X⟶∗ is the terminal map.
Lemma 3.5**.**
Let D be as in Hypothesis 3.4, let X be an m-finite space and let p:X⟶∗ be the terminal map in Sm (which we naturally consider as a map in Smm−1). Then the natural transformation
[TABLE]
is a counit exhibiting p!:DX⟶D as left adjoint to p∗:D⟶DX.
Proof.
If X is empty then [X] is initial in Fun(D,D), and since such a counit exists it must be homotopic to [p]. We may hence suppose that X is not empty. Since p! is left adjoint to p∗ the desired claim is equivalent to the natural transformation [p]ad:p∗⇒p∗ adjoint to [p]:p!p∗⇒Id being an equivalence.
We note that to specifying a natural transformation T:p∗⇒p∗ is the same as giving an X-indexed family of natural transformations {Tx:Id⇒Id}x∈X from the identify functor Id∈Fun(D,D) to itself. Furthermore, since the maps [ix]:[∗]⇒[X] exhibit [X] as the colimit in Fun(D,D) of the constant diagram {Id}x∈X it follows that if T:[X]≃p!p∗⇒Id is a natural transformation then the adjoint natural transformation Tad:p∗⇒p∗ is given by the family {T∘[ix]:Id⇒Id}x∈X.
Since p∘ix:∗⟶∗ is an equivalence in Smm−1 it follows that [p]∘[ix]:Id→Id is a natural equivalence for every x∈X and so the natural transformation [p]ad:p∗⇒p∗ is an equivalence, as desired.
∎
Definition 3.6**.**
Given a map f:X⟶Y in Sm−1 let us denote by f^:Y⟶X the morphism in Smm−1 determined by the span
[TABLE]
We will refer to f^ as the dual span of f.
Lemma 3.7**.**
Let D be as in Hypothesis 3.4, let X be an (m−1)-finite space and let p:X⟶∗ be the terminal map in Sm−1. Then the natural transformation
[TABLE]
is a unit exhibiting p! as right adjoint to p∗, where p^:∗⟶X is the span dual to p (see Definition 3.6). In other words, it exhibits p:X⟶∗ as D-ambidextrous.
Proof.
Since X is D-ambidextrous there exists a counit vX:p∗p!⇒Id exhibiting p! as right adjoint to p∗. As in Hopkins–Lurie [11, Notation 5.1.7] let us define the trace form TrFmX:[X]∘[X]⇒Id by the composition
[TABLE]
where ϕX is a counit exhibiting p! as left adjoint to p∗. Since D is assumed to be (m−1)-semiadditive, [11, Proposition 5.1.8] implies that the trace form exhibits [X] as self dual in Fun(D,D). Let uX:Id⇒p!p∗ be a unit which is compatible with vX. It will then be enough to show that [p^] is equivalent to uX in the arrow category of Fun(D,D). Since [X] is self dual it will suffice to compare the natural transformations [X]⇒Id which are dual to uX and [p^] respectively. In the case of uX we observe that
[TABLE]
is homotopic to the identity in light of the compatibility of uX and vX. It hence follows that the map [X]⇒Id dual to uX is the counit
[TABLE]
On the other hand, the action functor Smm−1⟶Fun(D,D) is monoidal and sends X to [X]. Since X is (m−1)-finite it is self-dual in Smm−1 (cf. Remark 3.16 below). It follows that the dual of [p^] is the image of the dual of p^ in Smm−1, which is given
by the image in Smm−1 of the terminal map p:X⟶∗ of Sm. It will hence suffice to show that [p] is equivalent to ϕX in the arrow category of Fun(D,D). But this now follows from Lemma 3.5.
∎
Definition 3.8**.**
Given an (m−1)-truncated map f:X⟶Y of m-finite spaces let us denote by Stf:Y⟶S the diagram obtained by applying to f the straightening construction (see [9, §2.1]). Informally, Stf:Y⟶S sends y∈Y to the homotopy fiber Xy of f over y. Since f is (m−1)-truncated every homotopy fiber Xy is (m−1)-finite and we may consequently consider Stf as a functor Y⟶Sm−1. Using the inclusions Sm−1⊆Sm⊆Smm−1 (see Corollary 2.14) we may further consider Stf as a functor Y⟶Smm−1, i.e., as a Smm−1-valued local system. To avoid confusion we will use the notation Stf:Y⟶Smm−1 to denote the straightening of f when considered as taking values in Smm−1.
Construction 3.9**.**
Let f:X⟶Y be an (m−1)-truncated map of m-finite spaces and let Stf:Y⟶Smm−1 be its straightening as in Definition 3.8. The action of Smm−1 on D induces a pointwise action of (Smm−1)Y on DY. In particular, the action of Stf∈(Smm−1)Y determines a functor
[TABLE]
given informally on a local system L∈DY by the formula
[TABLE]
Lemma 3.10**.**
Let D be as in Hypothesis 3.4 and let f:X⟶Y be an (m−1)-truncated map of m-finite spaces. Then there is a natural equivalence
[TABLE]
of functors DY⟶DY
Proof.
Consider the base change g:X×YX⟶X of f along itself. Then the diagonal map δ:X⟶X×YX determines a section of g, which we can consider as a map of spaces over X. Applying the straightening construction as in Definition 3.8 over the base X we obtain a natural transformation
[TABLE]
from the straightening of the identity Id:X⟶X (which is the constant diagram with value ∗), to the straightening of g:X×YX⟶X. The latter, in turn, is naturally equivalent to the restriction along f:X⟶Y of Stf:Y⟶Snn−1, by the compatibility of unstraightening with base change (see [9]). Applying Construction 3.9 we obtain a natural transformation
[TABLE]
of functors from DX to DX. Pre-composing with the restriction functor f∗:DY⟶DX we now obtain a natural transformation
[TABLE]
of functors DY⟶DX.
For a local system L∈DY, the component at L of δ∗ is a map
[TABLE]
of D-valued local systems on X. To finish the proof it will now suffice to show that δL exhibits [Stf]L as the left Kan extension of f∗(L):X⟶D along f. Indeed, by the pointwise formula for the left Kan extension we need to check that for every y∈Y the diagram
[TABLE]
which sends the cone point to [Xy]L(y) and sends the point x∈Xy⊆Xy▹ to L(y) (equipped with the map to [Xy]L(y) determined by x∈Xy) is a colimit diagram in D. But this follows directly from our assumption that the action of Smm−1 on D is compatible with Km−1-indexed colimits, since the collection of maps ix:∗⟶Xy for x∈Xy exhibit Xy as the colimit in Smm−1 of the constant Xy-indexed diagram with value ∗ (by Proposition 2.12). ∎
Let us now fix an (m−1)-truncated map f:X⟶Y between m-finite spaces. Consider the commutative diagram of spaces
[TABLE]
as a span in (Sm)/Y. Applying the straightening construction
over Y and using the assumption that f is (m−1)-truncated we obtain a span of the form
[TABLE]
in the ∞-category (Sm−1)Y, which we can consider as a map
[TABLE]
of Smm−1-valued local systems on Y.
Applying Construction 3.9 and using Lemma 3.10 we then obtain a natural transformation
[TABLE]
of functors DY⟶DY.
Lemma 3.11**.**
Let D be as in Hypothesis 3.4. Then for every (m−1)-truncated map f:X⟶Y of m-finite spaces the natural transformation [f^]:[Y]⇒[X] associated to the span f^:Y⟵fX⟶IdX of Definition 3.6
is homotopic to
[TABLE]
where q:Y⟶∗ is the terminal map and [f^]Y is the natural transformation (8).
Proof.
Since q! is given by taking the colimit along Y and the action map Smm−1⟶Fun(D,D) preserves Km-indexed colimits it will suffice to show that the span f^=[Y⟵fX⟶IdX] is the colimit in Smm−1 of StId⟵Stf⟶Stf, considered as a Y-indexed family of morphisms in Smm−1. Now since Y is m-finite the ∞-category (Sm)Y of Sm-valued local systems on Y is equivalent by the straightnening-unstraightening construction to the slice ∞-category (Sm)/Y, while the ∞-category (Smm−1)Y of Smm−1-valued local systems on Y is equivalent in the same manner to the generalized span ∞-category of (Sm)/Y with respect to the weak coWaldhausen structure (Sm)/Y†⊆(Sm)/Y consisting of the (m−1)-truncated maps in (Sm)/Y. In addition, since Km-indexed colimits in Smm−1 are the same as the corresponding colimits in Sm (Proposition 2.12), the colimit functor (Smm−1)Y⟶Smm−1 corresponds to the functor
[TABLE]
induced by the forgetful functor (Sm)/Y⟶Sm (which respects the weak coWaldhausen structures on both sides). The desired claim is then simply a consequence of the fact that, since unstraightening is inverse to straightening, the span StId⟵Stf⟶Stf unstraightens to Y⟵fX⟶IdX. ∎
Lemma 3.12**.**
Let D be as in Hypothesis 3.4. Then for every (m−1)-truncated map f:X⟶Y between m-finite spaces the natural transformation [f^]Y:Id⇒f!f∗ of (8)
exhibits f! as right adjoint to f∗. In other words, it exhibits f as D-ambidextrous.
Proof.
Let LX:X⟶D and LY:Y⟶D be two local systems. We need to show that the composite map
[TABLE]
is an equivalence. By [11, Lemma 4.3.8] it is enough prove this for objects of the form LY=(iy)!D where iy:{y}⟶Y is the inclusion of some point y∈Y and D is an object of D. Since (iy)! is left adjoint to the restriction functor iy∗:DY⟶D this is the same as showing that for every y∈Y the composed natural transformation
[TABLE]
exhibits iy∗f! as right adjoint to f∗(iy)!, where uy is the unit of the adjunction (iy)!⊣iy∗. Now by the definition of the functor [Stf] (see Construction 3.9) we have a natural equivalence
[TABLE]
of functors DY⟶D. Identifying [Stf] with f!f∗ via Lemma 3.10 we see that this is just an incarnation of the fact that left Kan extensions are determined pointwise. The latter fact is best phrased via the Beck-Chevalley transformation τy:(fy)!iXy∗⟹iy∗f! associated to the Cartesian square
[TABLE]
Indeed, by [11, Proposition 4.3.3] the transformation τy is an equivalence, asserting, in effect, that the value of the left Kan extension f!L at a given point y is the colimit of L restricted to the homotopy fiber Xy. In this formalism the equivalence (10) is obtained by composing the equivalences
[TABLE]
Now by the compatibility of the straightening-unstraightening equivalence with base change we see that under the equivalence (10) the natural transformation iy∗[f^]Y:iy∗⇒iy∗[Stf] identifies with the natural transformation [f^y]iy∗:iy∗⇒[Xy]iy∗. In other words, we have a commuting square of the form
[TABLE]
in the ∞-category Fun(DY,D). Precomposing with the functor (iy)! we obtain the top square in the diagram
[TABLE]
in the ∞-category Fun(D,D), where uy:Id⇒iy∗(iy)! is the unit of the adjunction (iy)!⊣iy∗.
In particular, we can identify the composed transformation
[TABLE]
with the composed transformation
[TABLE]
Now the transpose of the square (11) also has a Beck-Chevalley transformation σy:(iXy)!fy∗⟹f∗(iy)!, which (see [11, Remark 4.1.2]) is given by the composition of transformations
[TABLE]
Applying [11, Proposition 4.3.3] again we get that σy is an equivalence. Let uXy:Id⟹iXy∗(iXy)! be a unit transformation compatible with the counit vXy above. Then the compatibility of uXy and vXy implies that (13) (and hence (12)) is homotopic to the composed transformation
[TABLE]
Comparing now (12) and (14) we have reduced to showing that
[TABLE]
exhibits (fy)!iXy∗ as right adjoint to (iXy)!fy∗. But this just follows from the fact that uXy is the unit of (iXy)!⊣iXy∗ by construction and [fy^] exhibits (fy)! as right adjoint to (fy)∗ by Lemma 3.7.
∎
Construction 3.13**.**
Let X∈Sm be an m-finite space. We will denote by δ:X⟶X×X the associated diagonal map. Let π1,π2:X×X⟶X be the two projections and let σX:(π1)!π2∗⟹q∗q! be the Beck-Chevalley transformation associated to the Cartesian square
[TABLE]
By [11, Proposition 4.3.3] the transformation σX is an equivalence. Let [δ^]X×X:Id⟶(δ)!δ∗ be the natural transformation (8) for the map δ. We will then denote by
[TABLE]
the composed natural transformation.
Observation 3.14**.**
Let D be as in Hypothesis 3.4. Let X∈Sm be an m-finite spaces and q:X⟶∗ the terminal map. Then X is D-ambidextrous in the sense of [11, Definition 4.3.4] if and only if the natural transformation vq:q∗q!⇒Id of Construction 3.13 is a counit exhibiting q∗ as left adjoint to q!.
Proof.
Since D is assumed to be (m−1)-semiadditive we have that X is automatically weakly ambidextrous in the sense of [11]. We hence just need to identify the natural transformation vq with the natural transformation vq(m) appearing in [11, Construction 4.1.8]. Comparing the respective definitions we see that it will suffice to show that the natural transformation [δ^]X×X:Id⟶(δ)!δ∗ is homotopic to the natural transformation μδ(m−1):Id⟶(δ)!δ∗ appearing in [11, Construction 4.1.8]. But this now follows from the uniqueness of units since both natural transformations exhibit δ! as right adjoint to δ∗ (Lemma 3.12).
∎
Definition 3.15**.**
Let X be an m-finite space. We will denote by trX:X×X⟶∗ the morphism in Smm−1 given by the span
[TABLE]
where δ:X⟶X×X, as above, is the diagonal map.
Remark 3.16*.*
Let X∈Smm−1 and trX:X×X⟶∗ be as in Definition 3.15. If we consider X as an object of the larger (symmetric monoidal) ∞-category Smm, then trX exhibits X as self-dual. To see this, observe that in Smm the dual span tr^X:∗⟵X⟶δX×X exists as well, and the pair trX and tr^X form a compatible pair of evaluation and coevaluation maps exhibiting X as self-dual. More precisely, the compositions
[TABLE]
and
[TABLE]
are both homotopic to the identity.
Having an action of Smm−1 on D means in particular that for every X∈Sm we are equipped with an equivalence mX:[X×Y]≃[X]∘[Y]. Since the action of Smm−1 is compatible with Km-indexed colimits we have a canonical equivalence [X]≃colimx∈XId and the map mX is completely determined by m∗:Id≃Id∘Id via the canonical “Fubini map”
[TABLE]
The latter can be described in terms of the Beck-Chevalley transformation σX,Y:(πX)!πY∗⟹qX∗(qY)! associated to the Cartesian square
[TABLE]
The Fubini map, and hence mX,Y, can then be the identified with the map
[TABLE]
where Q:X×Y⟶∗ is the terminal map.
Proposition 3.17**.**
Let D be as in Hypothesis 3.4. Then D is m-semiadditive if and only if the natural transformation
[TABLE]
exhibits the functor [X]:D⟶D as self-adjoint.
Proof.
By Lemma 3.11 and (17) we may identify the composed natural transformation (18) with the composed natural transformation
[TABLE]
where vq is defined as in Construction 3.13. Identifying vq with the natural transformation vq(m) of [11, Construction 4.1.8] as in the proof of Observation 3.14 and using
Lemma 3.5 to identify [q]:q!q∗⇒Id as a counit exhibiting q! as left adjoint ot q∗ we may conclude that the natural transformation (18) is homotopic to the trace form associated to the map q:X⟶∗ by Hopkins–Lurie [11, Notation 5.1.7]. By [11, Proposition 5.1.8] we the get that (18) exhibits [X] as self-adjoint if and only if the natural transformation vq:q∗q!⟶Id is a counit of an adjunction, and so if and only if X is D-ambidextrous (Observation 3.14).
∎
Corollary 3.18**.**
Let D be as in Hypothesis 3.4. Then D is m-semiadditive if and only if the collection of natural transformations [i^x]:[X]⇒[∗] exhibits [X] as the limit, in Fun(D,D), of the constant diagram X-indexed diagram with value [∗] (here the morphism i^x:X⟶∗ in Smm−1 is as in Definition 3.6).
Proof.
By Proposition 3.17 it will suffice to show that the collection of natural transformations [i^x]:[X]⇒[∗] exhibits [X] as the limit in Fun(D,D) of the constant X-indexed diagram with value [∗] if and only if
[trX]∘mX,X−1:[X]∘[X]⇒Id
exhibits [X] as self-adjoint. Let G:D⟶D be any other functor and let αG be the composed map
[TABLE]
Recall that the collection of natural transformations [ix]:[∗]⇒[X] exhibits [X] as the colimit in Fun(D,D) of the constant X-indexed diagram with value [∗].
Since colimits in functor categories are computed objectwise it follows that the natural transformations [ix]∘G:[∗]∘G⇒[X]∘G exhibit [X]∘G as the colimit in Fun(D,D) of the constant X-indexed diagram with value [∗]∘G≃G. We may hence identify a map [X]∘G⇒Id with a collection of natural transformations Tx:G⇒Id indexed by x∈X. Since the map i^x:X⟶∗ is equivalent to the composition X=X×∗⟶Id×ixX×X⟶trX∗ we see that the map αG associates to a natural transformation T:G⟶[X] the collection of natural transformations [i^x]∘T:G⟶[∗]≃Id. It hence follows that the collection of natural transformations [i^x]:[X]⇒[∗] exhibits [X] as the limit in Fun(D,D) of the constant diagram X-indexed diagram with value [∗] if and only if αG is an equivalence for every G, i.e., if and only if [trX]∘mX,X−1:[X]∘[X]⇒Id exhibits [X] as self-adjoint.
∎
Corollary 3.19**.**
Let D be an ∞-category which is tensored over Smm, such that the action functor Smm×D⟶D preserves Km-indexed colimits separately in each variable. Then D is m-semiadditive.
Proof.
Let us prove that D is m′-semiadditive for every −2≤m′≤m by induction on m′. Since every ∞-category is (−2)-semiadditive we may start our induction at m′=−2. Now suppose that D is m′-semiadditive for some −2≤m′≤m. As above let us denote by [X]:D⟶D the action of X∈Sm′m′−1. By Proposition 3.17 it will suffice to show that the morphism (18)
exhibits the functor [X] as self-adjoint. But this follows from the fact that the action of Sm′m′−1 extends to an action of Sm′m′, and the morphism trX:X×X⟶∗ exhibits X as self-dual in the monoidal ∞-category Sm′m′ (see Remark 3.16).
∎
Corollary 3.20**.**
For every −2≤m≤n the ∞-category Snm is m-semiadditive.
Proof.
Combine Corollary 2.18 and Corollary 3.19.
∎
4. The universal property of finite spans
In this section we will prove our main result, establishing a universal property for the ∞-categories Snm in terms of m-semiadditivity.
Theorem 4.1**.**
Let −2≤m≤n be integers and let D be an m-semiadditive ∞-category which admits Kn-indexed colimits. Then evaluation at ∗∈Snm induces an equivalence of ∞-categories
[TABLE]
In other words, the ∞-category Snm is the free m-semiadditive ∞-category which admits Kn-indexed colimits, generated by ∗∈Snm.
Our strategy is essentially a double induction on n and m. For this it will be useful to employ the following terminology:
Definition 4.2**.**
Let D be an ∞-category and let −2≤m≤n be integers. We will say that D is (n,m)-good if the following conditions are satisfied:
- (1)
D is m-semiadditive and admits Kn-indexed colimits.
2. (2)
Evaluation at ∗ induces an equivalence of ∞-categories
[TABLE]
In other words, D is (n,m)-good if Theorem 4.1 holds for m,n and D. We may hence phrase the induction step on n as follows: given an (n−1,m)-good ∞-category D which admits Kn-indexed colimits, show that D is (n,m)-good. To establish this claim we will need to understand how to extend functors from Sn−1m to Snm when m≤n−1. Note that if f:Z⟶X is an m-truncated map and X is (n−1)-truncated then Z is (n−1)-truncated as well, and so the inclusion Sn−1m↪Snm is fully-faithful. The core argument for the induction step on n is the following:
Proposition 4.3**.**
Let −2≤m<n be integers. Let D be an m-semiadditive ∞-category which admits Kn-indexed colimits and let F:Sn−1m⟶D be a functor which preserves Kn−1-indexed colimits. Let ι:Sn−1m↪Snm be the fully-faithful inclusion. Then the following assertion hold:
- (1)
F* admits a left Kan extension*
[TABLE]
2. (2)
An arbitrary extension F:Snm⟶D of F is a left Kan extension if and only if F preserves Kn-indexed colimits.
Proof.
For Y∈Snm let us denote by
[TABLE]
the associated comma ∞-category. To prove (1), it will suffice by [9, Lemma 4.3.2.13] to show that the composed map
[TABLE]
can be extended to a colimit diagram in D for every Y∈Snm. Now an object of IY corresponds to an object X∈Sn−1m together with a morphism X⟶Y in Snm, i.e., a span of the form
[TABLE]
where g is m-truncated (and hence Z is (n−1)-finite). Since Sn−1m↪Snm is fully-faithful the mapping space from (X,Z,f,g) to (X′,Z′,f′,g′) in IY can be identified with the homotopy fiber of the map MapSnm(X,X′)⟶MapSnm(X,Y) over (Z,f,g)∈MapSnm(X,Y). Now let
[TABLE]
be the analogue comma ∞-category for the inclusion Sn−1↪Sn. Then the inclusions Sn−1↪Sn−1m and Sn↪Snm induce a functor ρ:JY⟶IY, and it is not hard to check that ρ is in fact fully-faithful, and its essential image consists of those objects as in (19) for which g is an equivalence. We now claim that ρ is also cofinal. To prove this, we need to show that for every object (X,Z,f,g)∈IY as in (19), the comma ∞-category (JY)(X,Z,f,g)/:=JY×IY(IY)(X,Z,f,g)/ is weakly contractible. Given an object h:X′⟶Y in JY, we may identify the mapping space from (X,Z,f,g) to ρ(X′,h) in IY with the homotopy fiber of the map
[TABLE]
over the span (Z,f,g)∈MapSnm(X,Y). Now clearly any span of n-finite spaces from X to X′ whose composition with h:X′⟶Y belongs to Snm already itself belongs to Snm. We may hence identify the homotopy fiber of (20) with the homotopy fiber of the map
[TABLE]
over the object (f,g):Z⟶X×Y. Finally, using the general equivalence C/A×B≃C/A×CC/B we may identify the homotopy fiber of (21) with the homotopy fiber of the map
[TABLE]
over f:Z⟶Y. We may then conclude that the functor from JY to spaces given by (X′,h)↦MapIY((X,Z,f,g),ρ(X′,h)) is corepresented by f:Z⟶Y (considered as an object of JY). This implies that the comma ∞-category (JY)(X,Z,f,g)/
has an initial object and is hence weakly contractible. Since this is true for any (X,Z,f,g)∈IY it follows that ρ is cofinal, as desired.
It will now suffice to show that each of the diagrams
[TABLE]
can be extended to a colimit diagram. Let JY′=JY×Sn−1{∗}⊆JY be the full subcategory spanned by objects of the form ∗⟶hY. Then JY′ is an ∞-groupoid which is equivalent to the underlying space of Y, and the composed functor JY′⟶JY⟶D is constant with value F(∗)∈D. Since we assumed that F:Sn−1m⟶D preserves Km-indexed colimits it follows from Proposition 2.12 that the restriction F∣Sn−1:Sn−1⟶D preserves Kn−1-indexed colimits and hence by Lemma 2.11 the functor F∣Sn−1 is a left Kan extension of its restriction to the object ∗∈Sn−1. Now since the projection JY⟶Sn−1 is a right fibration (classified by the functor X↦MapSn(X,Y)) it induces an equivalence (JY)/(X,h)⟶(Sn−1)/X for every (X,h)∈JY. We may then conclude that F∣JY is a left Kan extension of F∣JY′. Since D admits Kn-indexed colimits (and JY′ is an n-finite Kan complex) the diagram FY∣JY′ admits a colimit. It then follows that the diagram FY∣JY:JY⟶D admits a colimit, as desired.
To prove (2), note that by the above considerations an arbitrary functor F:Snm⟶D is a left Kan extension of F if and only if the extension (JY′)▹⟶D determined by F is a colimit diagram. By construction, this means that F is a left Kan extension if and only if for every Y∈Snm the collection of maps {F(iy):F(∗)⟶F(Y)}y∈Y exhibits F(Y) as the colimit of the constant Y-indexed diagram with value F(∗). It then follows from Lemma 2.11 that F is a left Kan extension of F if and only if F preserves Kn-indexed colimits.
∎
Corollary 4.4**.**
Let −2≤m<n be integers and let D be an ∞-category which admits Kn-indexed colimits. Then the restriction map
[TABLE]
is an equivalence of ∞-categories.
Proof.
This a direct consequence of Proposition 4.3 in light of [9, Proposition 4.3.2.15].
∎
Corollary 4.5**.**
Let −2≤m≤n≤n′ be integers and let D be an m-semiadditive ∞-category which admits Kn′-indexed colimits. Then D is (n′,m)-good if and only if D is (n,m)-good.
We shall now proceed to perform the induction step on m. We begin with the following lemma.
Lemma 4.6**.**
Let D be an (m,m−1)-good ∞-category and let F:Smm−1⟶D be a functor which preserves Km-indexed colimits. If D is m-semiadditive then the collection of maps F(i^x):F(X)⟶F(∗) for x∈X exhibits F(X) as the limit in D of the constant X-indexed diagram with value F(∗).
Proof.
Using the symmetric monoidal structure of Smm−1 we may consider Smm−1 as tensored over itself. Since the monoidal structure preserves Km-indexed colimits separately in each variable (see Corollary 2.17), and since D is (m,m−1)-good, we may endow FunKm(Smm−1,D)≃D with an action of Smm−1 via precomposition. Then D is tensored over Smm−1 and the action map Smm−1×D⟶D preserves Km-indexed colimits separately in each variable. As above let us denote by [X]:D⟶D the action of X∈Smm−1.
By Corollary 3.18 the collection of natural transformations [i^x]:[X]⇒[∗] exhibits [X] as the limit, in Fun(D,D), of the constant X-indexed diagram with value [∗].
Evaluating at F(∗) we may conclude that the collection of maps [i^x](F(∗)):[X](F(∗))⟶F(∗) exhibits [X](F(∗)) as the limit in D of the constant X-diagram with value F(∗). By construction we may identify [X](F(∗)) with F(X) and [i^x](F(∗)) with F(i^x) and so the desired result follows.
∎
We next proceed to the establish the inductive step. As in the proof of 4.3 we will use a Kan extension argument (though this time it will be a right Kan extension). Since the subcategory inclusion Smm−1⊆Smm is not fully-faithful this requires a slightly more elaborate setup for which it will be convenient to make use of the language of marked simplicial sets, as developed by Lurie [9]. Given an m≥−1 let
[TABLE]
be the right marked mapping cone of the inclusion ι:Smm−1↪Smm. Let
[TABLE]
be a factorization of the projection Conem⟶(Δ1)♯ into a trivial cofibration follows by a fibration in the Cartesian model structure over (Δ1)♯. In particular, r:M⟶Δ1 is a Cartesian fibration and the marked edges of M♮ are exactly the r-Cartesian edges. Let ι0:Smm↪M×Δ1Δ{0}⊆M and ι1:Smm−1↪M×Δ1Δ{1}⊆M be the corresponding inclusions. Then ι0 and ι1 exhibit r:M⟶Δ1 as a correspondence from Smm to Smm−1 which is the one associated to the functor ι:Smm−1↪Smm.
Proposition 4.7**.**
Let D be an ∞-category which admits Km-indexed limits and let F:Smm−1⟶D be a functor which satisfies the following property: for every X∈Smm−1 the collection of maps F(i^x):F(X)⟶F(∗) exhibits F(X) as the limit in D of the constant X-indexed diagram with value F(∗). Then the following assertion hold:
- (1)
There exists a right Kan extension
[TABLE]
2. (2)
An extension F:M⟶D as above is a right Kan extension if and only if F maps r-Cartesian edges to equivalences in D.
Remark 4.8*.*
An extension F as in (23) is equivalent to the data of a functor F′:Smm⟶D together with a natural transformation τ:F′∘ι⇒F (where ι:Smm−1⟶Smm is the inclusion as above), and F is a right Kan extension if and only if τ exhibits F′ as a right Kan extension of F along ι. We should hence morally consider Proposition 4.7 as pertaining to right Kan extensions of F along ι:Smm−1⟶Smm. In particular, we could have worked directly with Smm instead of M at the expense of replacing (23) with a diagram which commutes up to a prescribed natural transformation. We also note that this issue did not arise in Proposition 4.3 since, unlike ι, the map Sn−1m⟶Snm appearing in Proposition 4.3 is fully-faithful (cf. [9, §4.3.2,4.3.3]).
Proof of proposition 4.7.
For an object X∈Smm let us set
[TABLE]
To prove (1), it will suffice by [9, Lemma 4.3.2.13] to show that the composed map
[TABLE]
can be extended to a limit diagram in D for every X∈Smm. Now an object of IX corresponds to an object Y∈Smm−1 and a morphism ι0(X)⟶ι1(Y) in M, or, equivalently, a morphism X⟶ι(Y) in Smm, i.e., a span
[TABLE]
of m-finite spaces.
Recall that we have denoted by Sm,m−1⊆Sm the subcategory of Sm consisting of all objects and (m−1)-truncated maps between them. Then we have a commutative square
[TABLE]
where the vertical functors map are the identity on objects and send an (m−1)-truncated map f:X⟶Y to the span Y⟵fX⟶X. Let JX=Sm,m−1op×Smop(Smop)X/ be the associated comma ∞-category. We will write the objects of JX as maps X⟵gY of m-finite spaces, or simply as pairs (Y,g). We note that morphisms from X⟵gY to X⟵g′Y′ are commutative triangles of the form
[TABLE]
such that h is (m−1)-truncated. The square (25) induces a fully-faithful fuctor ρ:JX↪IX whose essential image consists of those objects as in (24) for which f is an equivalence. We now claim that ρ is coinitial.
To prove this, we need to show that for every object (Y,Z,f,g)∈IY as in (24), the comma ∞-category (JX)/(Y,Z,f,g):=JX×IX(IX)/(Y,Z,f,g) is weakly contractible. Given an object (Y′,h) in JX, we may identify the mapping space from ρ(Y′,h) to (Y,Z,f,g) in IX with the homotopy fiber of the map
[TABLE]
over the span (Z,f,g)∈MapSmm(X,Y). As in the proof Proposition 4.3 we may identify these mapping spaces as MapSmm−1(Y′,Y)≃((Sm,m−1op)Y′/)≃×Sm((Sm)/Y)≃ and MapSmm(X,Y)≃((Smop)X/)≃×Sm((Sm)/Y)≃ we may identify the homotopy fiber of (26) with the homotopy fiber of the map
[TABLE]
over the object X⟵gZ. We may then conclude that the functor from JX to spaces given by (Y′,h)↦MapIY(ρ(Y′,h),(Y,Z,f,g)) is represented in JX by the object X⟵gZ. This implies that the comma ∞-category (JX)/(Y,Z,f,g)
has an terminal object and is hence weakly contractible. Since this is true for any (Y,Z,f,g)∈IX it follows that ρ is coinitial, as desired.
It will hence suffice to show that each of the diagrams
[TABLE]
can be extended to a limit diagram.
Let JX′=JX×Sm,m−1op{∗}⊆JX be the full subcategory spanned by objects of the form X⟵g∗. Then JX′ is an ∞-groupoid which is equivalent to the underlying space of X, and the composed functor JX′⟶JX⟶D is constant with value F(∗)∈D. By our assumption on F it follows that the restricted functor F∣Sm,m−1op:Sm,m−1op⟶D is a right Kan extension F∣{∗}. Now since the projection JX⟶Sm,m−1op is a left fibration it induces an equivalence (JX)(Y,h)/⟶(Sm,m−1op)Y/ for every (Y,h)∈JX. We may then conclude that F∣JX is a right Kan extension of F∣JX′. Since D is m-semiadditive it admits Km-indexed limits and hence the diagram FX∣JX′ admits a limit. It follows that the diagram FX∣JX:JX⟶D admits a limit, as desired.
Let us now prove (2). Let F:M⟶D be a map extending F. Then for every X∈Smm the functor F determines a diagram
[TABLE]
extending FX∣JX. By the considerations above F is a right Kan extension of F if and only if each FX is a limit diagram. Let JX′′⊆JX denote the full subcategory spanned by those objects X⟵gY such that g is (m−1)-truncated. By the above arguments the functor FX∣JX′′ is a right Kan extension of FX∣JX′, and so by [9, Proposition 4.3.2.8] we have that FX is a right Kan extension of FX∣JX′′. It follows that FX is a limit diagram if and only if FX∣(JX′′)◃ is a limit diagram. Let ⋄∈(JX′′)◃ be the cone point. We now observe that the ∞-category JX′′ has initial objects, namely every object of the form X⟵gX′ such that g is an equivalence. It follows that FX∣(JX′′)◃ is a limit diagram if and only if FX sends every edge connecting ⋄ with an initial object of JX′′ to an equivalence in D. To finish the proof it suffices to observe that these edges are exactly the edges which map to r-Cartesian edges by the natural map (JX′′)◃⟶M, and that all r-Cartesian edges are obtained in this way.
∎
Corollary 4.9**.**
Let D be an m-semiadditive ∞-category. Then the restriction map
[TABLE]
is an equivalence of ∞-categories.
Proof.
Let r:M♮⟶Δ1 be as above and consider the marked simplicial set D♮=(D,M) where M is the collection of edges which are equivalences in D. For two marked simplicial sets (X,M),(Y,N) let Fun♭((X,M),(Y,N))⊆Fun(X,Y) be the full sub-simplcial set spanned by those functors X⟶Y which send M to N.
We will denote by FunKm♭(M♮,D♮)⊆Fun♭(M♮,D♮) and by FunKm♭(Conem,D♮)⊆Fun♭(Conem,D♮) the respective full subcategories spanned by those makred functors whose restriction to Smm−1 preserves Km-indexed colimits.
Now consider the commutative diagram of functors categories and restriction maps
[TABLE]
Since the inclusion of marked simplicial sets Conem⟶M♮ is a trivial cofibration in the Cartesian model structure over (Δ1)♯ it follows that the left diagonal map is a trivial Kan fibration. On the other hand by Proposition 4.7 and [9, Proposition 4.3.2.15] the right diagonal map is a trivial Kan fibration. We may hence deduce that ι1∗ is an equivalence of ∞-categories.
Since the inclusion Smm↪Conem is a pushout along the inclusion Smm−1×Δ{0}↪Smm−1×(Δ1)♯ (which is itself a trivial cofibration in the coCartesian model structure over Δ0) it follows that the map i0∗:Fun♭(Conem,D♮)⟶Fun(Smm,D) is a trivial Kan fibation and that the composed functor
[TABLE]
is homotopic to i1∗:Fun♭(Conem,D♮)⟶≃Fun(Smm−1,D). We may consequently conclude that i0∗ induces an equivalence between FunKm♭(Conem,D♮)⊆Fun♭(Conem,D♮) and the full subcategory of Fun(Smm,D) spanned by those functors whose restriction to Smm−1 preserves Km-indexed colimits. By Corollary 2.16 these are exactly the functors Smm⟶D which preserves Km-indexed colimits. We may finally conclude that
[TABLE]
is an equivalence of ∞-categories, as desired.
∎
Corollary 4.10**.**
Let −1≤m≤n integer and let D be an m-semiadditive ∞-category which admits Kn-indexed colimits. If D is (n,m−1)-good then D is (n,m)-good.
Proof.
By Corollary 4.5 we know that D is (n,m)-good if and only if D is (m,m)-good, and that D is (n,m−1)-good if and only if D is (m,m−1)-good. The desired result now follows directly from Corollary 4.10.
∎
Proof of Theorem 4.1.
We want to prove that if D is an m-semiadditive ∞-category which admits Kn-indexed colimits then D is (n,m)-good. Let us consider the set A={(a,b)∈Z×Z∣a≤b} as partially ordered saying that (a,b)≤(c,d) if a≤c and b≤d. We now note that for every (−2,−2)≤(n′,m′)≤(n,m) in A, the ∞-category D is m′-semiadditive and admits Kn′-indexed colimits. Furthermore, D is tautologically (−2,−2)-good. It follows that there exists a pair (−2,−2)≤(n′,m′)≤(n,m) for which D is (n′,m′)-good and which is maximal with respect to this property. If n′<n then Corollary 4.5 implies that D is (n′+1,m′)-good, contradicting the maximality of (n′,m′). On the other hand, if n′=n and m′<m then m′<n′. By Corollary 4.10 we may conclude that D is (n′,m′+1)-good, a contradiction again. It follows that (n′,m′)=(n,m) and hence D is (n,m)-good, as desired.
∎
5. Applications
5.1. m-semiadditive ∞-categories as modules over spans
By Corollary 3.19, every ∞-category with Km-indexed colimits which carries a compatible action of Smm is m-semiadditive. On the other hand, our main theorem 4.1 implies that every m-semiadditive ∞-category D carries an action of Smm (by identifying D, for example, with FunKm(Smm,D)). This suggests that the theory of m-semiadditive ∞-categories is strongly related to that of Smm-modules in CatKm. In this section we will make this idea more precise by proving a suitable equivalence of ∞-categories. This equivalence is strongly related to the fact that Smm is an idempotent object of CatKm, a corollary we will deduce below.
Let Addm⊆CatKm denote the full subcategory spanned by m-semiadditive ∞-categories. The discussion above implies that the essential image of the forgetful functor
[TABLE]
is exactly Addm. We note that U admits a left adjoint F:CatKm⟶ModSmm(CatKm) given by F(D)=Smm⊗KmD.
Lemma 5.1**.**
Let C be an ∞-category. Then the unit map
[TABLE]
associated to F⊣U is an equivalence on C if and only if C is m-semiadditive.
Proof.
If uC is an equivalence then C carries an Smm-module structure and is hence m-semiadditive by Corollary 3.19. Now assume that C is m-semiadditive. By Corollary 3.19 again Smm⊗KmC is m-semiadditive and hence it will suffice to show that for every m-semiadditive ∞-category D the induced map
[TABLE]
is an equivalence. Identifying the functor ∞-category FunKm(Smm⊗KmC,D) with FunKm(Smm,FunKm(C,D)) and uC∗ with evaluation at ∗∈Smm it will suffice, in light of Theorem 4.1, to show that FunKm(C,D) is m-semiadditive. But this follows from Corollary 3.19 since FunKm(C,D) carries an action of Smm (given by pre-composing the action on C, whose existence is insured by Theorem 4.1).
∎
Lemma 5.2**.**
Let C be an Smm-module. Then the counit map
[TABLE]
is an equivalence of Smm-modules. In particular, U:ModSmm(CatKm)⟶CatKm is fully-faithful.
Proof.
Since U is conservative it will suffice to show that U(vC) is an equivalence of ∞-categories. Since the composition
[TABLE]
is homotopic to the identity we are reduced to showing that the functor
[TABLE]
is an equivalence. But this now follows from Lemma 5.1 since U(C) is m-semiadditive in virtue of Corollary 3.19.
∎
Corollary 5.3**.**
The forgetful functor induces an equivalence of ∞-categories ModSmm(CatKm)≃Addm.
Corollary 5.4**.**
The inclusion Addm↪CatKm admits both a left adjoint, given by D↦Smm⊗KmD, and a right adjoint, given by D↦FunKm(Smm,D).
Corollary 5.5**.**
Smm* is an idempotent algebra object in CatKm. In particular, the monoidal product map Smm⊗KmSmm⟶≃Smm is an equivalence.*
Since Smm is an idempotent algebra object of CatKm the functor L:CatKm⟶CatKm given by C↦Smm⊗KmC is a localization functor (see [10, Proposition 4.8.2.4]), and the L-local objects are those ∞-categories C such that the map C⟶Smm⊗KmC (induced by the unit Sm↪Smm) is an equivalence, which are exactly the m-semiadditive ∞-categories by Lemma 5.1. In other words, the ∞-category Addm is a localization of CatKm with localization functor Smm⊗Km(−).
We shall now discuss tensor products of m-semiadditive ∞-categories.
Proposition 5.6**.**
There exists a symmetric monoidal structure Addm⊗⟶N(Fin∗) on Addm such that the functor F:CatKm⟶Addm given by F(D)=Smm⊗KmD extends to a symmetric monoidal functor F⊗:CatKm⊗⟶Addm⊗. In particular, Smm is the unit of Addm⊗.
Proof.
This is a particular case of [10, Proposition 4.8.2.7].
∎
Corollary 5.7**.**
Smm* carries a canonical commutative algebra structure making it the initial object of CAlg(Addm).*
Let us refer to commutative algebra objects in CatKm as Km-symmetric monoidal ∞-categories. These can identified with ordinary symmetric monoidal ∞-categories such that the underlying ∞-category admits Km-indexed colimits and the monoidal product preserves Km-indexed colimits it each variable separately.
Proposition 5.8**.**
The inclusion Addm⊗↪CatKm⊗ is symmetric monoidal. Furthermore the induced map
[TABLE]
is fully-faithful and its essential image is spanned by those Km-symmetric monoidal ∞-categories whose underlying ∞-category is m-semiadditive.
Proof.
Recall that the symmetric monoidal structure on Addm was inherited from CatKm by identifying Addm with the localization of CatKm associated to the localization functor L(C):=Smm⊗KmC. In this case the inclusion Addm⊆CatKm of local objects is always lax symmetric monoidal structure ([10, Proposition 2.2.1.9(3)]) and is given informally by the formula (C,D)↦L(C⊗KmD). To show that in this case the inclusion is actually symmetric monoidal we need to show that if C,D are local then C⊗KmD is local as well. But this is a direct consequence of the fact that our localization functor is obtained by tensoring with an idempotent object.
To show the second part of the claim, we note that the symmetric monoidal left adjoint F⊗:CatKm⊗⟶Addm⊗ of Proposition 5.6 induces a left adjoint F′:CAlg(CatKm)⟶CAlg(Addm) to R whose value on the underlying objects is given by F′. In particular, the counit of F′⊣R is given by the counit of F⊣U on the underlying ∞-categories and is hence an equivalence by Lemma 5.2. We then get that R is fully-faithful. Let E⊆CAlg(CatKm) denote the full subcategory spanned by those Km-symmetric monoidal ∞-categories whose underlying ∞-category is m-semiadditive, so that the image of R is contained in E. To finish the proof we need to show that every object in E is in the image of R. For this, it will suffice to show the unit of F′⊣R is an equivalence on objects whose underlying ∞-category is m-semiadditive. But this now follows from Lemma 5.1 since the unit of F′⊣R is given by the unit of F⊣U on underlying ∞-categories.
∎
We hence obtain yet another universal characterization of Smm:
Corollary 5.9**.**
The Km-symmetric monoidal ∞-category Smm is initial among those Km-symmetric monoidal ∞-categories whose underlying ∞-category is m-semiadditive.
5.2. Higher commutative monoids
In §5.1 we discussed the inclusion of Addm inside the ∞-category of CatKm of ∞-categories admitting Km-indexed colimits. But there is also a dual story, when one embeds Addm inside the ∞-category CatKm consisting of those ∞-categories which admit Km-indexed limits. Indeed, the symmetry here is complete: the operation D↦Dop which sends an ∞-category to its opposite induces an equivalence CatKm≃CatKm which maps Addm to itself. We may hence apply any of the constructions of the previous section to ∞-categories with Km-indexed limits by “conjugating” it with the operation D↦Dop. From an abstract point of view this seems to yield no additional interest. However, for one of the procedures above applying this conjugation yields an interesting relation with the theory of commutative monoids, which is worthwhile spelling out.
By Corollary 5.4, if D is an ∞-category which admits Km-indexed colimits, then the restriction functor r:FunKm(Smm,D)⟶D exhibits FunKm(Smm,D) as the universal m-semiadditive ∞-category carrying a Km-colimit preserving functor to D. In other words, any Km-colimit preserving functor from any other m-semiadditive ∞-category C factors essentially uniquely through r.
Now suppose that D admits Km-indexed limits. Then Dop admits Km-indexed colimits and FunKm(Smm,Dop) is the universal m-semiadditive ∞-category admitting a Km-colimit preserving functor to Dop. We now note that
[TABLE]
where FunKm(−,−)⊆Fun(−,−) denotes the full subcategory spanned by Km-limit preserving functors. It the follows that FunKm(Smm,D) is the universal m-semiadditive ∞-category admitting a Km-limit preserving functor to D. Our next goal is to relate the ∞-category FunKm(Smm,D) with the theory of commutative monoid objects in D.
Definition 5.10**.**
Let m≥−1 be an integer and let D be an ∞-category admitting Km-indexed limits. An m-commutative monoid in D is a functor F:Smm−1⟶D with the following property: for every X∈Smm−1 the collection of maps F(i^x):F(X)⟶F(∗) exhibits F(X) as the limit in D of the constant X-indexed diagram with value F(∗). We will denote by CMonm(D)⊆FunKm(Smm−1,D) the full subcategory spanned by the m-commutative monoids.
Example 5.11*.*
If m=−1 then Smm−1=S−1−2=S−1 is the ∞-category of (−1)-finite spaces and ordinary maps between them. In particular, we may identify S−1 with the category consisting of two objects ∅,∗ and a unique non-identity morphism ∅⟶∗. An ∞-category D admits K−1-indexed limits if and only if it admits a final object. A functor S−1⟶D is completely determined by the associated morphism F(∅)⟶F(∗) in D. By definition such a functor F is a (−1)-commutative monoid if and only if F(∅) is a terminal object of D. We may hence identify CMon−1(D) with the full subcategory of the arrow category of D spanned by those arrows A⟶B for which A is a final object. In particular, if we fix a particular final object ⋆∈D then we may form an equivalence CMon−1(D)≃D⋆/. In other words, we may identify CMon−1(D) with the ∞-category of pointed objects D.
Example 5.12*.*
If m=0 then we may identify Smm−1=S0−1 with the category whose objects are finite sets, and such that a morphism from a finite set A to a finite set B is a pair (C,f) where C is a subset of A and f:C⟶B is a map. In particular, S0−1 is equivalent to the nerve of a discrete category. By sending a finite set A to the pointed set A+=A∐{∗} and sending a map (C,f) to the map f′:A+⟶B+ which restricts to f on C and sends A\C to the base point of B+ we obtain an equivalence S0−1≃Fin∗, where Fin∗ is the category of finite pointed sets. To say that an ∞-category D has K0-indexed limits is to say that D admits finite products. Unwinding the definitions we see that a functor S0−1⟶D is a [math]-commutative monoid object if and only if the corresponding functor Fin∗⟶D is a commutative monoid object in the sense of [10, Definition 2.4.2.1], also known as an E∞-monoid. When D is the ∞-category of spaces this notion of commutative monoids was first developed by Segal under the name special Γ-spaces.
Lemma 5.13**.**
Let D be an ∞-category which admits Km-indexed limits and let F:Smm⟶D be a functor. Then F preserves Km-indexed limits if and only if the restriction F∣Smm−1 is an m-commutative monoid object.
Proof.
Apply Corollary 2.16 and Lemma 2.11 to (Smm)op≃Smm and Dop.
∎
Proposition 5.14**.**
Fix an m≥−1 and let D be an ∞-category which admits Km-indexed limits. Then restriction along Smm−1↪Smm induces an equivalence of ∞-categories
[TABLE]
Proof.
Let Conem
be the right marked mapping cone of the natural inclusion ι:Smm−1↪Smm (see the discussion before Lemma 4.6) and let
Conem↪M♮⟶rΔ1
be a factorization of the projection Conem⟶(Δ1)♯ into a trivial cofibration follows by a fibration in the Cartesian model structure over (Δ1)♯. Let ι0:Smm↪M×Δ1Δ{0}⊆M and ι1:Smm−1↪M×Δ1Δ{1}⊆M be the corresponding inclusions, so that ι0 and ι1 exhibit r:M⟶Δ1 as a correspondence from Smm to Smm−1 which is the one associated to the functor ι:Smm−1↪Smm.
Let Fun0♭(M♮,D♮)⊆Fun♭(M♮,D♮) and Fun0♭(Conem,D♮)⊆Fun♭(Conem,D♮) denote the respective full subcategories spanned by those marked functors whose restriction to Smm−1 is an m-commutative monoid in D. Since the inclusion of marked simplicial sets Conem⟶M♮ is a trivial cofibration in the Cartesian model structure over (Δ1)♯ it follows that the restriction map Fun0♭(M♮,D♮)⟶Fun0♭(Conem,D♮) is a trivial Kan fibration, and by Proposition 4.7 and [9, Proposition 4.3.2.15] the restriction map Fun0♭(M♮,D♮)⟶CMonm(D) is a trivial Kan fibration. We may hence deduce that the restriction map
[TABLE]
is a an equivalence. On the other hand, by Lemma 5.13 the image of the restriction map Fun0♭(Conem,D)⟶Fun(Smm,D) consists of exactly those functors Smm⟶D which preserves Km-indexed limits. Arguing as in the proof of Corollary 4.9 we may now conclude that the restriction map
[TABLE]
is an equivalence of ∞-categories, as desired.
∎
Corollary 5.15**.**
Let D be an ∞-category which admits Km-indexed limits. Then CMonm(D) is m-semiadditive and the forgetful functor CMonm(D)⟶D exhibits CMonm(D) as universal among those m-semiadditive ∞-categories admitting a Km-limit preserving map to D. In particular, D is m-semiadditive if and only if the forgetful functor CMonm(D)⟶D is an equivalence.
To get a feel for what these higher commutative monoids are, let us consider the example of the ∞-category S of spaces. Let F:Smm−1⟶S be an m-commutative monoid object and let us refer to M=F(∗) as the underlying space of F. We may then identify two types of morphisms in Smm−1. The first type are morphisms of the form
[TABLE]
where f is (m−1)-truncated, and which we denote f^:Y⟶X (see Definition 3.6). These morphisms help us to identify the spaces F(X): by definition, the collection of maps i^x:X⟶∗ exhibit F(X) as the limit of the constant X-indexed diagram with value F(∗)=M. In particular, we may identify F(X) with the mapping space MapS(X,M). Other morphisms of the form f^:Y⟶X don’t really give more information: if f:X⟶Y is an (m−1)-truncated map then for every x∈X we have f^∘i^x=i^f(x), and so the induced map
[TABLE]
is forced to coincide with restriction along f. The second type of morphisms in Smm−1 are the spans of the form
[TABLE]
where g:X⟶Y is any map of m-finite spaces. We can think of the associated map g∗:MapS(X,M)⟶MapS(Y,M) as encoding the structure of M. Let Xy be homotopy fiber of g over y∈Y, equipped with its natural map iXy:Xy⟶X, and let gy:Xy⟶{y} be the constant map. Then i^y∘g=gy∘i^Xy and so for each φ∈MapS(X,M) the function g∗(φ)∈MapS(Y,M) maps the point y to the point (gy)∗(φ∣Xy)∈M. We may hence think of the core algebraic structure of an m-commutative monoid as given by the maps p∗:Map(X,M)⟶M associated to constant maps p:X⟶∗, while the other maps g:X⟶Y specify various forms of compatibility. Informally speaking, the structure of being an m-commutative monoid means that for every m-finite space X we can take an X-family {φ(x)}x∈X of points in M and “integrate” it to obtain a new point ∫Xφ:=p∗(φ)∈M. These operations are then required to satisfy various “Fubini-type” compatibility constraints when one is integrating over a space X which is fibered over another space Y. We note that when m=0 the spaces involved are finite sets, and we obtain the usual notion of being able to sum a finite collection of points in a commutative monoid.
Examples 5.16*.*
- (1)
For every space X, the ∞-groupoid (Sm×SS/X)≃ classifying m-finite spaces equipped with a map to X is naturally an m-commutative monoid. This is the free m-commutative monoid generated from X.
2. (2)
Any Q-vector space is an m-commutative monoid (in the category of Q-vector spaces). Indeed, if X is an m-finite space then the limit limXV of the constant X-indexed diagram on V is just the vector space of functions f:π0(X)⟶V. To such an f we may associate the vector
[TABLE]
where
χ(X0)=∏i≥0∣π2i+1(X0)∣∏i≥0∣π2i(X0)∣ is the “homotopy cardinality” of X0. This yields a structure of an m-commutative monoid on V.
3. (3)
More generally, if D is an m-semiadditive ∞-category then any object in D carries a canonical m-commutative monoid structure and for each X,Y∈D the mapping space MapD(X,Y) is canonically an m-commutative monoid in spaces. For example, by the main result of [11], for any two K(n)-local spectra X,Y the mapping space from X to Y is an m-commutative monoid in spaces.
4. (4)
If C is an ∞-category which admits Km-indexed colimits (resp. Km-indexed limits) then C carries the coCartesian (resp. Cartesian) m-commutative monoid structure in Cat∞, and its maximal ∞-groupoid is an m-commutative monoid in spaces.
Let us now discuss the role of m-commutative monoids in the setting of m-semiadditive presentable ∞-categories.
Lemma 5.17**.**
Let D be a presentable ∞-category. Then CMonm(D) is presentable and the forgetful functor CMonm(D)⟶D is conservative, accessible and preserves all limits.
Proof.
Let CMonm(D)⊆Fun(Smm−1,D) be the natural inclusion. Then CMonm(D) is closed under limits in Fun(Smm−1,D) and under κ-filtered colimits for any κ such that the simplicial sets in Km are κ-small. Since Fun(Smm−1,D) is presentable it now follows from [9, Corollary 5.5.7.3] that CMonm(D) is presentable and the inclusion CMonm(D)↪Fun(Smm−1,D) is accessible. This, in turn, implies that the composition CMonm(D)↪Fun(Smm−1,D)⟶ev∗D is accessible and preserves limits. Finally,
to show that CMonn(D)⟶D is conservative it is enough to note that if f:M⟶M′ is a map in CMonm(D) such that f∗:M(∗)⟶M′(∗) is an equivalence in D then for any X∈Smm−1 the induced map fX:M(X)≃limXM(∗)⟶limXM′(∗) is an equivalence and hence f is an equivalence.
∎
When D is presentable, Lemma 5.17 and the adjoint functor theorem ([9]) imply that the forgetful functor CMonn(D)⟶D admits a left adjoint F:D⟶CMonm(D), which can be considered as the free m-commutative monoid functor. Given two presentable ∞-categories C,D let us denote by FunL(C,D) the ∞-category of left functors from C to D (i.e. those functors which admit right adjoints) and by FunR(C,D) the ∞-category of right functors from C to D.
Corollary 5.18**.**
Let D be a presentable ∞-category and let E be a presentable m-semiadditive ∞-category. Then post-composition with the forgetful functor CMon(D)⟶D induces an equivalence
[TABLE]
Dually pre-composition with F:D⟶CMonm(D) induces an equivalence
[TABLE]
In particular, the functor F exhibits CMon(D) as the free presentable m-semiadditive ∞-category generated from D.
Proof.
Let us prove the first claim (the second then follows by the equivalence FunR(−,−)≃FunL(−,−) which associates to every right functor its left adjoint). By Corollary 5.15 it will suffice to show that if F:E⟶CMonn(D) is a functor that preserves Km-indexed limits then F belongs to FunR(E,D) if and only if ev∗∘F:E⟶D belongs to FunR(E,CMon(D)). By the adjoint functor theorem right functors between presentable ∞-categories are exactly the limit preserving functors which are also accessible, i.e., preserve sufficiently filtered colimits. The result is now follows from Lemma 5.17 which asserts that ev∗ preserves limits and sufficiently filtered colimits, and also detects them since it is conservative.
∎
Given an ∞-category C, let PKm(C)⊆Fun(Cop,S) denote the full subcategory consisting of those presheaves which send Km-indexed colimits in C to limits of spaces. Then PKm(C) is presentable and is an accessible localization of Fun(Cop,S) (choose an infinite cardinal κ such that all Km-colimit diagrams in C are κ-small and use [9, Corollary 5.5.7.3]). Let PrL denote the ∞-category of presentable ∞-categories and left functors between them. Identifying PrL as a full subcategory of cocomplete ∞-categories and colimit preserving functors and using [9, Corollary 5.3.6.10] we may conclude that the functor
[TABLE]
is left adjoint to the forgetful functor PrL⟶CatKm. In particular, we may consider PKm(C) as the free presentable ∞-category generated from C. We hence obtain two universal characterizations of the ∞-category CMonm(S). On the one hand, by Corollary 5.18 we may identify CMonm(S) as the free presentable m-semiadditive ∞-category generated from the presentable ∞-category S. On the other hand, since Smm≃(Smm)op we may interpret Proposition 5.14 as identifying CMonm(S)≃PKm(Smm) as the free presentable ∞-category generated from the Km-cocomplete ∞-category Smm. Furthermore, by [10, Proposition 4.8.1.14] and [10, Remark 4.8.1.8] the functor (29) is symmetric monoidal (where PrL is endowed with the symmetric monoidal structure inherited from that of cocomplete ∞-categories).
We may then deduce the following:
Corollary 5.19**.**
The ∞-category CMonm(S) is an idempotent commutative algebra object in PrL. In particular, the monoidal product CMonm(S)⊗CMonm(S)⟶CMonm(S) is an equivalence.
Lemma 5.20**.**
Let D be a presentable ∞-category. Then D carries an action of CMonm(S) (with respect to the symmetric monoidal structure of PrL) if and only if D is m-semiadditive.
Proof.
By [10, Remark 4.8.1.17] the data of an action of CMonm(S) on a presentable ∞-category D is equivalent to the data of a monoidal colimit preserving functor CMonm(S)⟶FunL(D,D), which since (29) is monoidal, is equivalent to the data of a Km-colimit preserving monoidal functor Smm⟶FunL(D,D), i.e., to an action of Smm on D which preserves Km-colimits in Smm and all colimits in D. We now observe that any action of Smm on D which preserves Km-colimits in Smm will automatically preserve all colimits which exist in D, since the object X∈Smm will necessarily acts as an X-indexed colimit of the identity functor. The desired result now follows from Corollary 5.3.
∎
Arguing as in the proof of Lemma 5.2 we may now conclude the following:
Corollary 5.21**.**
The forgetful functor ModCMonm(S)(PrL)⟶PrL is fully-faithful and its essential image consists of the m-semiadditive presentable ∞-categories.
Remark 5.22*.*
The statements of Corollary 5.21 and 5.19 are strongly related. In fact, under mild conditions on a symmetric monoidal ∞-category C, the property of A∈CAlg(C) being idempotent is equivalent to the forgetful functor ModA(C)⟶C being fully-faithful. Idempotent commutative algebra objects in PrL feature in some recent investigations of T. Schlank ([13]), where they are called modes. Informally speaking, modes describe aspects of presentable ∞-categories which are both a property and a structures, such as being pointed (the mode of pointed spaces), being semiadditive (the mode of E∞-spaces) being stable (the mode of spectra), being an (n,1)-category (the mode of n-truncated spaces), and more. Corollary 5.19 then adds a new infinite family of modes: the mode of m-commutative monoids in spaces for every m, which is associated to the property of being m-semiadditive.
Let us now consider the case where we replace S by the ∞-category Cat∞ of ∞-categories. As above, we may informally consider an m-commutative monoid structure on an ∞-category M as giving us a rule for taking an X-indexed family of objects of M (where X is an m-finite space) and producing a new object of M. Two immediate examples come to mind: if M is an ∞-category admitting Km-indexed colimits then we may form the colimit of any X-indexed family of objects in M. On the other hand, if M admits Km-indexed limits then we may form the limit of any such family. One might hence expect that if M admits Km-indexed colimits (resp. limits) then there should be a canonical m-commutative monoid structure on M, which can be called the coCartesian (resp. Cartesian) m-commutative monoid structure. To show that these structures indeed exist we shall prove the following theorem:
Theorem 5.23**.**
- (1)
The forgetful functor CMonm(CatKm)⟶CatKm is an equivalence. In other words, every object in CatKm admits an essentially unique m-commutative monoid structure.
2. (2)
The forgetful functor CMonm(CatKm)⟶CatKm is an equivalence. In other words, every object in CatKm admits an essentially unique m-commutative monoid structure.
Remark 5.24*.*
If M is an ∞-category which admits Km-indexed colimits, then we may consider it as belonging to either Cat∞ or CatKm. Since the faithful inclusion CatKm↪Cat∞ preserves limits we obtain a natural map
[TABLE]
where the left hand side is contractible by Theorem 5.23, and the right hand side is an ∞-groupoid which can be considered as the space of m-commutative monoid structures on M. The point in CMonm(Cat∞)×Cat∞{M} determined by (30) can be considered as identifying the coCartesian m-commutative monoid structure on M. Similarly, if M admits Km-indexed limits then the image of the map
[TABLE]
identifies the Cartesian m-commutative monoid structure.
Remark 5.25*.*
The category Smm admits Km-indexed limits and colimits, but also carries an m-commutative monoid structure which is neither Cartesian nor coCartesian. To see this, observe that the operation C↦Span(C)=Span(C,C) which associates to any ∞-category C with finite limits its span category determines a limit preserving functor Span:CatKfin⟶CatKfin, where Kfin denotes the collection of simplicial sets with finitely many non-degenerate simplices. We then have an induced functor
[TABLE]
Since the ∞-category Sm has both Km-indexed limits and Km-indexed colimits it carries both a Cartesian m-commutative monoid structure and a coCartesian m-commutative monoid structure. Applying the functor Span∗ we obtain two m-commutative monoid structures on Span(Sm)=Smm. The coCartesian m-commutative monoid structure of Sm induces an m-commutative monoid structure on Smm which is both coCartesian and Cartesian. The Cartesian m-commutative monoid structure on Sm, however, induces a different m-commutative monoid structure on Smm, which is neither Cartesian nor coCartesian. The restriction of this structure to S0−1 determines a symmetric monoidal structure on Smm which is the one we’ve been considering throughout this paper.
As CatKm≃CatKm by the functor which sends C to Cop, Theorem 5.23 will follows from Theorem 4.1 and Proposition 5.14 once we prove the following result:
Proposition 5.26**.**
The ∞-category CatKm is m-semiadditive.
The proof of Proposition 5.26 will be given below. Since CatKm has all limits it follows that CatKmop has all colimits and hence admits a canonical action of the ∞-category of spaces S which preserves colimits in each variable separately. Dually, CatKm admits an action of Sop which preserves limits in each variable separately. Given a space X∈Sop this action [X]:CatKm⟶CatKm sends M to MX=limXM and sends f:X⟶Y to the restriction functor f∗MY⟶MX).
For our purposes we will only be interested in the action of the full subcategory Smop⊆Sop on CatKm. Given a morphism σ:X⟶Y in Smm of the form
[TABLE]
where X,Y,Z are m-finite spaces we will denote by Tσ:[Y]⇒[X] the natural transformation given by the composition
[TABLE]
where q∗ denotes the restriction functor along q and p! denotes the left Kan extension functor, whose existence is insured by the fact that M has Km-indexed colimits. If σ is a span as in (31) then we will denote by σ^:Y⟶X the dual span Y⟵qZ⟶pX.
Lemma 5.27**.**
Let trX:X×X⟶∗ be the span of Definition 3.15. Then the natural transformation
[TABLE]
exhibits [X] as a self-adjoint functor. Furthermore, under this self-adjunction the natural transformation Tσ:[X]⇒[Y] associated to a span σ:X⟶Y is dual to the natural transformation Tσ^:[Y]⇒[X] associated with the dual span σ^.
Proof.
The Beck-Chevalley condition for pullbacks and left Kan extensions (see [11, Proposition 4.3.3]) implies in particular that the association σ↦Tσ respects composition of spans up to homotopy. Both claims now follow from the fact that tr:X×X⟶∗ exhibit X as self-dual in the monoidal ∞-category Smm (see Remark 3.16) and that under this self duality the dual morphism of σ is σ^.
∎
Proof of Proposition 5.26.
Arguing by induction, let us assume that CatKm is (m′−1)-semiadditive for some −1≤m′≤m and show that it is in fact m′-semiadditive. By Corollary 5.3 (applied to CatKmop) we may extend the (Sm′)op-action on CatKm described above to an (Sm′m′−1)op-action which preserves Km′-indexed limits in each variable separately. Applying Lemma 3.12 and Lemma 3.11 to CatKmop we may deduce that for every morphism of the form Y⟵qX in Sm′,m′−1op⊆Sm′m′−1 the induced transformation [q](M):[X](M)≃MX⟶MY≃[Y](M) is given by the formation of left Kan extensions. Applying now Lemma 5.27 we may conclude that for every X∈Sm′m′−1, the natural transformation [trX]:Id⇒[X]∘[X] exhibits [X] as a self-adjoint functor. By (the dual version of) Proposition 3.17 the ∞-category CatKm is m′-semiadditive, as desired.
∎
Remark 5.28*.*
Proposition 5.26 implies in particular that if X is an m-finite space and M∈CatKm is an ∞-category admitting Km-indexed colimits then Fun(X,M)≃limXM is also a model for the colimit of the constant X-indexed diagram with value M. Using Lemma 5.27 we can make this claim more precise: for any M∈CatKm and X∈Sm, the collection of left Kan extension functors (ix)!:M⟶MX exhibits MX as the colimit of the constant X-indexed diagram with value M.
5.3. Decorated spans
Theorem 4.1 identifies Smm as the free m-semiadditive ∞-category generated by a single object. In this section we will show how to bootstrap Theorem 4.1 in order to obtain a description of the free m-semiadditive ∞-category generated by an arbitrary small ∞-category C.
Let π:Sm(C)⟶Sm be a Cartesian fibration classifying the functor X↦CX. We may informally describe objects in Sm(C) as pairs (X,LX) where X is an m-finite space and LX:X⟶C is a C-valued local system on X (i.e., a functor). A map (X,LX)⟶(Y,LY) in Sm(C) can be described in these terms as a pair (f,T) where f:X⟶Y is a map of spaces and T:LX⇒f∗LY is a map of local systems on X (i.e., a natural transformation). In particular, a morphism (f,T) corresponds to a π-Cartesian edge of Sm(C) if and only T is an equivalence in CX. Now since Sm admits pullbacks it follows that Sm(C) admits pullbacks of diagram of the form φ:Δ1∐Δ{1}Δ1⟶Sm(C) such that φ∣Δ1 is π-Cartesian. Let Smcar(C)⊆Sm(C) denote the subcategory containing all objects and whose mapping spaces are the subspaces spanned by π-Cartesian edges. Then Smcar determines a weak coWaldhausen structure on C (see §2.1) and we may consider the associated span ∞-category
[TABLE]
By Remark 2.4 we may identify the objects of Smm(C) with the objects of Sm(C) and the mapping space in Smm(C) from (X,LX) to (Y,LY) with the classifying space of spans
[TABLE]
such that (p,T) is π-Cartesian (i.e., such that T is an equivalence in CZ).
The fiber of the Cartesian fibration Sm(C)⟶Sm over ∗∈Sm is equivalent to C∗≃C and we may fix an equivalence C⟶≃Sm(C)×Sm{∗}. We will denote by ι:C⟶Sm(C) the composition of this equivalence with the inclusion of the fiber over ∗∈Sm. Let
[TABLE]
be the full subcategory spanned by those arrows (X,LX)⟶ι(C) which are π-Cartesian. We may informally describe objects of U as tuples (X,LX,C,T) where T is a natural equivalence from LX:X⟶C to the constant functor C:X⟶C with value C. Since π:Sm(C)⟶Sm is a Cartesian fibration and ∗ is terminal in Sm it follows that the maps U⟶≃SmΔ1×SmΔ{1}C⟶≃Sm×C are trivial Kan fibrations (whose composition can informally be described as sending (X,LX,C,T) to (X,C)) and hence there exists an essentially unique section s:Sm×C⟶U. We will denote by
[TABLE]
the composition of s with the projection U⟶Sm(C). We may informally describe ι′ by the formula ι′(X,C)=(X,C), where C:X⟶C denotes the constant functor with value C.
Recall that we denote by C≃⊆C the maximal subgroupoid of C. Since Sm admits pullbacks it follows that Sm×C admits pullbacks of diagram of the form φ:Δ1∐Δ{1}Δ1⟶Sm×C such that φ∣Δ1 belongs to Sm×C≃. Since the functor ι′:Sm×C⟶Sm(C) maps Sm×C≃ to Smcar(C) we obtain an induced functor of span ∞-categories
[TABLE]
We may informally describe the functor ι′′:Smm×C⟶Smm(C) as the functor which sends the object (X,C) to the object (X,C) and a pair (X⟵pZ⟶qY,α:C⟶D) of a morphism in Smm and a morphism in C to the span
[TABLE]
Our goal in this section is to prove the following characterization of the above constructions in terms of suitable universal properties:
Theorem 5.29**.**
- (1)
The functor ι:C⟶Sm(C) exhibits Sm(C) as the free ∞-category with Km-indexed colimits generated from C.
2. (2)
The composed functor C⟶Sm(C)⟶Smm(C) exhibits Smm(C) as the free m-semiadditive ∞-category generated from C.
3. (3)
The functor Smm×Sm(C)⟶Smm(C) exhibits Smm(C) as the tensor product Smm⊗KmSm(C) in CatKm.
The rest of this section is devoted to the proof of Theorem 5.29, which is covered by Corollaries 5.33, 5.36 and 5.38. We begin with the following general lemma about colimits in Cartesian fibrations.
Lemma 5.30**.**
Let K be a Kan complex and let φ:K▹⟶C be a diagram taking values in an ∞-category C. Let π:D⟶C be a Cartesian fibration classified by a functor χ:Cop⟶Cat∞ which sends φ to a limit diagram in Cat∞. Then a lift ψ:K▹⟶D of φ is a π-colimit diagram in D if and only if ψ sends every morphism in K▹ to a π-Cartesian edge.
Proof.
Let φ=φ∣K and ψ=ψ∣K and consider the induced map π∗:Dψ/⟶Cφ/. By definition, ψ is a π-colimit diagram if and only if the object ψ∈Dψ/ is π∗-initial. By (the dual of) [9, Proposition 2.4.3.2] the map π∗ is a Cartesian fibration, and hence by [9, Corollary 4.3.1.16] we have that ψ is π∗-initial if and only if it is initial when considered as an object of Dψ/×Cφ/{φ}. Using the natural equivalence (see [9, §4.2.1] for the two types of slice constructions)
[TABLE]
it will suffice to show that ψ:K▹⟶D is initial when considered as an object of the RHS of (33) if and only it sends all edges to π-Cartesian edges. Let L=(K×Δ1)▹ and let L1,L2⊆L be the subsimplicial sets given by
[TABLE]
Let L be the marked simplicial set whose underlying simplicial set is L and the marked edges are those which are contained in (K×Δ{1})▹. Similarly, let L1 and L2 be the marked simplicial sets whose underlying simplicial sets are L1 and L2 respectively and whose markings are inherited from L. In particular, L2=L2♭≅K▹. We now claim that the inclusions L1↪L and L2↪L are marked anodyne. For L1 this follows from the fact that L1↪L is inner anodyne by [9, Lemma 2.1.2.3] and all the marked edges of L are contained in L1. For L2 we can write the inclusion K×Δ{0}↪K×Δ1 as a transfinite composition of pushouts along ∂Δn↪Δn for n≥0, yielding a description of L2↪L as a transfinite composition of pushouts along marked maps of the form (Λn+1n+1,(Λn+1n+1)1∩Δ{n,n+1})↪(Δn+1,Δ{n,n+1}) which are marked anodyne by definition.
Let D♮ be the marked simplicial set whose underlying simplicial set is D and the marked edges are the π-Cartesian edges. Then D♮ is fibrant in the Cartesian model structure over C and so we obtain a zig-zag of trivial Kan fibrations
[TABLE]
where φ′:L⟶C is the composition of φ with the projection L⟶K▹ and φi′=φ′∣Li. Let ρ:L1⟶D♮ be an object which corresponds to ψ:L2⟶D under the zig-zag of equivalences (35). We now observe that if a map L⟶D♮ sends all edges in L2 to π-Cartesian edges then it sends all edges in L to π-Cartesian edges. It then follows that ψ sends all edges to π-Cartesian edges if and only if ρ sends all edges to π-Cartesian edges. To finish the proof it will hence suffice to show that ρ is initial in
Fun♭(L1,D♮)×Fun(K×Δ{0},D)×Fun(L1,C){(ψ,φ1′)} if and only if it sends all edges to π-Cartesian edges.
We now invoke our assumption that the functor χ:Cop⟶Cat∞ maps φ to a limit diagram in Cat∞. By [9, Proposition 3.3.3.1] and using the fact that K is a Kan complex we may conclude that the projection
[TABLE]
[TABLE]
is a weak equivalence, where φ′:K×Δ1⟶C is the composition of φ with the projection K×Δ1⟶K. We now observe that ρ∣K×Δ1 is initial in
[TABLE]
if and only if the morphism in Fun(K,D)×Fun(K,C){φ} determined by ρ∣K×Δ1 is an equivalence, and so the desired result follows.
∎
For an object (X,LX)∈Sm(C) and a point x∈X, let us denote by ix:({x},LX(x))⟶(X,LX) the corresponding morphism in Sm(C).
Lemma 5.31**.**
- (1)
The ∞-category Sm(C) admits Km-indexed colimits. Furthermore, if ψ:K▹⟶Sm(C) is a cone diagram with K∈Km then ψ is a colimit diagram if and only if π∘ψ:K▹⟶Sm is a colimit diagram and ψ sends every morphism in K▹ to a π-Cartesian edge.
2. (2)
For any ∞-category D with Km-indexed colimits, an arbitrary functor F:Sm(C)⟶D preserves Km-indexed colimits if and only if for every (X,LX)∈Sm(C) the collection of maps F(ix):F({x},LX(x))⟶F(X,LX) exhibits F(X,LX) as the colimit of the diagram {F({x},LX(x))}x∈X.
Proof.
Let us first prove (1). By definition, the Cartesian fibration π:Sm(C)⟶Sm is classified by the functor χC:Smop⟶Cat∞ given by χC(X)=CX. Since the inclusion Sm↪S preserves Km-indexed colimits (Lemma 2.9) and the inclusion S⟶Cat∞ preserves all colimits it follows that χC sends Km-indexed colimit diagrams to limit diagrams in Cat∞. Now let K be an m-finite Kan complex, let ψ:K⟶Sm(C) be a diagram and let φ=π∘ψ:K⟶Sm. Since Sm admits Km-indexed colimits we may extend φ to a colimit diagram φ:K▹⟶Sm. Since χC∘φop:(Kop)◃⟶Cat∞ is a limit diagram and K is a Kan complex we may use [9, Proposition 3.3.3.1] to deduce the existence of a dotted lift
[TABLE]
such that ψ sends all edges in K▹ to π-Cartesian edges. By Lemma 5.30 we may conclude that ψ is a π-colimit diagram, and since φ is a colimit diagram it follows that ψ is also a colimit diagram in Sm(C). Finally, by uniqueness of colimits this construction covers all colimit of Kn-indexed diagram, and so the characterization of colimits given in (1) follows.
We shall now prove (2). The “only if” direction is clear since the collection of maps ix:({x},LX(x))⟶(X,LX) exhibits (X,LX) as the colimit in Sn(C) of the diagram {({x},LX(x))}x∈X by the characterization of colimits diagram given in (1). Now suppose that for every X∈Sn(C) the collection F(ix):F({x},LX(x))⟶F(X,LX)
exhibits F(X,LX) as the colimit of the diagram {({x},LX(x))}. Let Y∈Kn be an n-finite space and let φ:Y⟶Sm(C) be a Y-indexed diagram. For each y∈Y let us write φ(y)=(Zy,Ly) where Zy is an m-finite space and Ly:Zy⟶C is a local system. By (1) we may identify the colimit of φ in Sm(C) with the pair (Z,h) where Z is the total space of the left fibration p:Z⟶Y classified by φ and L:Z⟶C is the essentially unique local system such that L∣Zy=Ly. We now proceed as in the proof of Lemma 2.11. Let ψ:=F∘φ:Y⟶D and let ρ:Z⟶D be the diagram which sends z∈Z to F({z},L(z)).
We then have a natural transformation σ:ρ⇒p∗ψ and our assumption on F implies that σ exhibits ψ:Y⟶D as a left Kan extension of ρ:Z⟶D along p:Z⟶Y. Similarly, our assumption implies that the natural transformation from ρ to the constant diagram on F(Z,L) exhibits the latter as the colimit of ρ. By the pasting lemma for left Kan extensions we may now conclude that the natural transformation from ψ to the constant diagram on F(Z,L) exhibits the latter as the colimit of ψ, as desired.
∎
Now let (X,LX)∈Sm(C) be an object. The forgetful functor π:Sm(C)/(X,LX)⟶(Sm)/X is a Cartesian fibration classifying the functor (Y⟶fX)↦C/f∗LXY. Since all the fibers of π have terminal objects we may choose an essentially unique Cartesian section s:(Sm)/X⟶Sm(C)/(X,LX) such that s(f:Y⟶X) is terminal in the fiber over f for every f:Y⟶X in (Sm)/X.
We may then form the diagram of ∞-categories
[TABLE]
where V is chosen so that the top square is Cartesian (and the bottom square is Cartesian by construction as well). It then follows that the external rectangle is Cartesian. Using this we may then identify objects of V with pairs (C,f:Y⟶X,η) where η is an equivalence from (∗,C) to (Y,f∗LX) in Sm(C). In particular, Y≃∗ must be contractible and the data of η is just an equivalence from LX(f(Y))=LX(f(∗)) to C in C. We may hence identify V with the ∞-groupoid X, in which case the map
[TABLE]
can be informally described by the formula
[TABLE]
Lemma 5.32**.**
The map s′ is cofinal.
Proof.
The map s′ is a base change of the map s, which is cofinal since it is a terminal section of a Cartesian fibration.
∎
Corollary 5.33**.**
The inclusion ι:C⟶Sm(C) exhibits Sm(C) as the ∞-category obtained from C by freely adding Km-indexed colimits. In particular, if D is an ∞-category with Km-indexed colimits then restriction along ι induces an equivalence of ∞-categories
[TABLE]
Proof.
By Lemma 5.31(1) we know that Sm(C) has Km-indexed colimits. Now suppose that D is an ∞-category that admits Km-indexed colimits and let F:C⟶D be a functor. Since D admits colimits indexed by X for every X∈Sm Lemma 5.32 and [9, Lemma 4.3.2.13] together imply that any functor F:C⟶D admits a left Kan extension F:Sm(C)⟶D, and that an arbitrary functor F:Sm(C)⟶D extending F is a left Kan extension of F if and only if for every (X,LX)∈Sm(C) the collection of maps {F(ix):F({x},LX(x))=F(LX(x))⟶F(X,LX)} exhibit F(X,LX) as the colimit of the diagram {F(LX(x))}x∈X. By Lemma 5.31(2) the latter condition is equivalent to the condition that F preserves Km-indexed colimits. The desired result now follows from the uniqueness of left Kan extensions (see [9, Proposition 4.3.2.15]).
∎
We now address the universal property of Smm(C) as described in the second claim of Theorem 5.29. We begin with the following Lemma:
Lemma 5.34**.**
- (1)
The ∞-category Smm(C) admits Km-indexed colimits and the inclusion Sm(C)⟶Smm(C) preserves Km-indexed colimits. Furthermore, every Km-indexed diagram in Smm(C) comes from a Km-indexed diagram in Sm(C).
2. (2)
For any ∞-category D with Km-indexed colimits, an arbitrary functor F:Smm(C)⟶D preserves Km-indexed colimits if and only if for every (X,LX)∈Smm(C) the collection of maps {F(ix):F({x},LX(x))⟶F(X,LX)} exhibit F(X,LX) as the colimit of the diagram {F({x},LX(x))}.
3. (3)
The functor ι′′:Smm×C⟶Smm(C) preserves Km-indexed colimits in the Smm variable.
Proof.
Let us begin with Claim (1). We first claim that every equivalence in Smm(C) is in the image of the map Sm(C)⟶Smm(C). Indeed, a morphism in Smm(C) is given by a span
[TABLE]
such that T is an equivalence in CZ. If (36) is an equivalence then its image in Smm is an equivalence which means by Lemma 2.13 that p:Z⟶X is an equivalence in Sm and hence that (p,T):(Z,LZ)⟶(X,LX) is an equivalence in Sm(C). In this case the span (36) is essentially equivalent to an honest map, i.e., is in the image of Sm(C)⟶Smm(C). Since the inclusion Sm(C)⟶Smm(C) is faithful it follows that any Km-indexed diagram in Smm(C) is the image of an essentially unique Km-indexed diagram in Sm(C). It will hence suffice to prove that the map Sm(C)⟶Smm(C) preserves Km-indexed colimits.
By Lemma 5.31(2) it will suffice to show that for every (X,LX)∈Smm(C), the collection of maps ({x},LX(x))⟶(X,LX) exhibit (X,LX) as the colimit of the X-indexed diagram {({x},LX(x))}x∈X in Smm(C). In other words, we need to show that the data of a span of the form (36) such that T:LZ⟶≃p∗LX is an equivalence in CZ is equivalent to the data of an X-indexed family of spans
[TABLE]
where Zx denotes the homotopy fiber of p:Z⟶X over x∈X. But this is now a consequence of the straightening-unstraightening equivalence which implies that the collection of fiber functors ix∗:(Sm)/X⟶S identifies (Sm)/X with SmX, and furthermore for every Z⟶X the collection of maps ix∗Z⟶Z exhibits Z as the homotopy colimit of the X-indexed family {Zx}x∈X. Claim (2) is now a direct consequence of the above and Lemma 5.31(2).
Let us now prove Claim (3). We have a commutative diagram of ∞-categories
[TABLE]
where the vertical maps are faithful. Let C∈C be an object, let K be an m-finite Kan complex and let φ:K⟶Smm×{C} be a diagram. By Lemma 2.13 the diagram φ is the image of an essentially unique diagram φ′:K⟶Sm×{C}, and the inclusion Sm×{C}⟶Smm×{C} preserves Km-indexed colimits. By Claim (2) above it will suffice to show that the top horizontal map preserves Km-indexed colimits, which is clear in light of the characterization of colimit cones in Sm(C) given in 5.31(1).
∎
Since Sm(C) admits Km-indexed colimits it carries a canonical action of Sm, given informally by the formula X⊗(Y,LY)=colimx∈X(Y,LY)=(X×Y,pY∗LY), where pY:X×Y⟶Y is the projection on the second factor. By Lemma 5.31(1) we get that if f:X⟶X′ is a map of m-finite Kan complexes then the induced edge X⊗(Y,LY)⟶X′⊗(Y,LY) is π-Cartesian in Sm(C). On the other hand, for a fixed space X and a π-Cartesian map (Y,LY)⟶(Z,LZ) the induced map X⊗(Y,LY)⟶X⊗(Z,LZ) is again π-Cartesian. It then follows that the action of Sm on Sm(C) induces an action of Span(Sm) on Span(Sm(C),Smcar(C))=Smm(C). Furthermore, by Lemma 5.34 and Lemma 2.13 this action preserves Km-indexed colimits in each variable separately. By Corollary 3.19 we now get that Smm(C) is m-semiadditive.
Let us now consider the left marked mapping cone
[TABLE]
of the inclusion ι′′:Smm×C↪Smm(C). Let
Conem↪M♮⟶rΔ1
be a factorization of the projection Conem⟶(Δ1)♯ into a trivial cofibration follows by a fibration in the coCartesian model structure over (Δ1)♯. In particular, r:M⟶Δ1 is a coCartesian fibration and the marked edges of M♮ are exactly the r-coCartesian edges. Let ι0:Smm×C↪M×Δ1Δ{0}⊆M and ι1:Smm(C)↪M×Δ1Δ{1}⊆M be the corresponding inclusions. Then ι0 and ι1 exhibit r:M⟶Δ1 as a correspondence from Smm×C to Smm(C) which is the one associated to the functor ι′′:Smm×C↪Smm(C).
Proposition 5.35**.**
Let D be an m-semiadditive ∞-category and let F:Smm×C⟶D be a functor which preserves Km-indexed colimits in the Smm variable. Then the following holds:
- (1)
F* admits a left Kan extension*
[TABLE]
2. (2)
An arbitrary functor F:M⟶D extending F is a left Kan extension if and only if F maps r-coCartesian edges in M to equivalences in D and F∘ι1:Smm(C)⟶D preserves Km-indexed colimits.
Proof.
For (Y,LY)∈Smm(C) let us denote by
[TABLE]
the associated comma ∞-category.
To prove (1), it will suffice by [9, Lemma 4.3.2.13] to show that the composed map
[TABLE]
can be extended to a colimit diagram in D for every (Y,LY)∈Smm(C). Now an object of I(Y,LY) corresponds to an object (X,C)∈Smm×C and a morphism (X,C)⟶(Y,LY) in Smm(C), i.e., a span
[TABLE]
where T:LZ⟶p∗C is an equivalence in CZ. Let J(Y,LY):=(Sm×C)×Sm(C)(Sm(C))/(Y,LY) be the comma ∞-category over (Y,LY) associated to the inclusion ι′:Sm×C⟶Sm(C). Then the faithful maps Sm×C↪Smm×C and Sm(C)⟶Smm(C) induce a fully-faithful inclusion ρ:J(Y,LY)↪I(Y,LY) whose essential image consists of those objects as in (38) for which p:Z⟶X is an equivalence. We now claim that ρ is cofinal.
Consider an object P∈I(Y,LY) of the form (38). We need to show that the comma ∞-category (J(Y,LY))P/:=J(Y,LY)×I(Y,LY)(I(Y,LY))P/ is weakly contractible. Given an object (q′,S′):(X′,C′)⟶(Y,LY) of J(Y,LY) the mapping space from P to ρ(X′,C′,q′,S′) in I(Y,LY) is given by the homotopy fiber of the map
[TABLE]
over the map determined by P. In light of Remark 2.4 we may identify the homotopy fiber of (39) with the homotopy fiber of the map
[TABLE]
over the object corresponding to P. Now since the map ((Sm)/X)≃⟶(Smcar(C)/(X,C))≃ is an equivalence we may identify the homotopy fiber of (40) with the homotopy fiber of the map
[TABLE]
over the point (q,S)∈MapSm(C)((Z,C),(Y,LY)) determined by P. Unwinding the definitions we recover that the map (41) sends a pair (q′′:Z⟶X′,α:C⟶C′) to the composition
[TABLE]
We may then conclude that the functor J(Y,LY)⟶S defined by (X′,C′,q′,S′)↦MapI(Y,LY)(P,ρ(X′,C′,q′,S′)) is corepresented in J(Y,LY) by the object (q,S):(Z,C)⟶(Y,LY). It then follows that (J(Y,LY))P/ has an initial object and is hence weakly contractible. This means that ρ:J(Y,LY)↪I(Y,LY) is cofinal, as desired.
It will now suffice to show that each of the diagrams
[TABLE]
can be extended to a colimit diagram. Let J(Y,LY)′:=J(Y,LY)×Sn{∗}⊆JY be the full subcategory spanned by objects of the form (q,S):(∗,C)⟶(Y,LY).
Since we assumed that F:Smm×C⟶D preserves Km-indexed colimits in the first coordinate it follows from Proposition 2.12 that the restriction F∣Sm×C:Sm×C⟶D preserves Km-indexed colimits in the first coordinate and by combining Lemma 2.11 with Lemma 5.32 we may conclude that the functor F∣Sm×C is a left Kan extension of its restriction to {∗}×C∈Sm. Now since the projection JY⟶Sm×C is a right fibration it induces an equivalence (J(Y,LY))/(X′,C′,q′,S′)⟶(Sm×C)/(X′,C′) for every (X′,C′,q′,S′)∈J(Y,LY). We may then conclude that F(Y,LY)∣J(Y,LY)
is a left Kan extension of F(Y,LY)∣J(Y,LY)′. Since D admits Km-indexed colimits and J(Y,LY)′ contains an m-finite Kan complex as a cofinal subcategory by Lemma 5.32 the diagram F(Y,LY)∣J(Y,LY)′ admits a colimit. It then follows that the diagram F(Y,LY)∣J(Y,LY)⟶D admits a colimit, as desired.
To prove (2), we begin by noting that by the above considerations, an arbitrary extension F:M⟶D is a left Kan extension if and only if for every (Y,LY) the diagram
[TABLE]
determined by F is a colimit diagram. By Lemma 5.32 the functor Y⟶J(Y,LY)′ sending y∈Y to the object ({y},LY(y))⟶(Y,LY) is cofinal and so F is a left Kan extension of F if and only if for every (Y,LY) the diagram
[TABLE]
determined by F is a colimit diagram. Now by Lemma 2.11 and Lemma 2.16 we know that for each Y∈Smm the collection of maps ιy:{y}⟶Y exhibits Y as the colimit in Smm of the constant Y-diagram with value ∗. Since F:Smm×C⟶D preserves Km-indexed colimits in the first variable it follows that each (Y,C)∈Smm×C the collection of maps F(ιy,IdC):F({y},C)⟶F(Y,C) exhibit F(Y,C) as the colimit of the diagram {F({y},C)}y∈Y. This means that F(Y,C) is a colimit diagram if and only if F maps every r-coCartesian edge in M of the form (Y,C)⟶(Y,C) (covering the map 0⟶1 of Δ1) to an equivalence in D. Since all the other r-coCartesian edges of M are equivalences we may conclude that F maps r-coCartesian edges to equivalences if and only if the diagrams F(Y,C) are colimit diagrams for every Y∈Smm and C∈C. On the other hand, when these two equivalent conditions hold for Y=∗ and all C∈C then the condition that F(Y,LY) is a colimit diagram for every (Y,LY) is equivalent by Lemma 5.34(2) to the condition that F∘ι1:Smm(C)⟶D preserves Km-indexed colimits. We may hence conclude that F is a left Kan extension of F if and only if it maps all r-coCartesian edges of M to equivalences in D and F∘ι1:Smm(C)⟶D preserves Km-indexed colimits.
∎
Given an ∞-category D admitting Km-indexed colimits, let us denote by
[TABLE]
the full subcategory spanned by those functors which preserves Km-indexed colimits in the Smm variable.
Corollary 5.36**.**
Let D be an m-semiadditive ∞-category. Then restriction along ι′′:Smm×C↪Smm(C) induces an equivalence of ∞-categories:
[TABLE]
Proof.
Let r:M♮⟶Δ1 be as above and consider the marked simplicial set D♮=(D,M) where M is the collection of edges which are equivalences in D. Let FunKm♭(M♮,D♮)⊆Fun♭(M♮,D♮) and FunKm♭(Conem(C),D♮)⊆Fun♭(Conem(C),D♮) be the respective full subcategories spanned by those makred functors whose restriction to Smm×C preserves Km-indexed colimits in the left variable and whose restriction to Smm(C) preserves Km-indexed colimits. Since the map Conem(C)⟶M♮ is marked anodyne it follows that the restriction map FunKm♭(M♮,D♮)⟶FunKm♭(Conem(C),D♮) is an equivalence and by Proposition 5.35 the restriction map FunKm♭(M♮,D♮)⟶FunKm/C(Smm×C,D) is an equivalence. We may hence deduce that the restriction map
[TABLE]
is an equivalence.
Now since the inclusion Smm×C↪Conem(C) is a pushout along the inclusion Smm××C×Δ{1}↪Smm×C×(Δ1)♯ (which is itself a trivial cofibration in the Cartesian model structure over Δ0) it follows that the map i1∗:Fun♭(Conem(C),D♮)⟶Fun(Smm(C),D) is a trivial Kan fibation and that the composed functor
[TABLE]
is homotopic to i0∗:Fun♭(Conem(C),D♮)⟶≃Fun(Smm×C,D). We may consequently conclude that i1∗ induces an equivalence between FunKm♭(Conem(C),D♮) and the full subcategory of FunKm(Smm(C),D) spanned by those functors whose restriction to Smm×C which preserves Km-indexed colimits in the left variable. By Lemma 5.34(3) the latter condition is automatic and hence the restriction map ι1∗:FunKm♭(Conem(C),D♮)⟶FunKm♭(Smm(C),D♮) is an equivalence. We may then conclude that
[TABLE]
is an equivalence of ∞-categories, as desired.
∎
Corollary 5.37**.**
Let D be an m-semiadditive ∞-category. Then restriction along the inclusion {∗}×C↪Smm(C) induces an equivalence of ∞-categories:
[TABLE]
Proof.
Combine Corollary 5.36 and Theorem 4.1.
∎
Corollary 5.38**.**
The functor Smm×Sm(C)⟶Smm(C) exhibits Smm(C) as the tensor product Smm⊗KmSm(C) in CatKm.
Proof.
Combine Corollary 5.36 and Corollary 5.33.
∎
Remark 5.39*.*
For m≤n one may also consider the subcategory Snm(C)⊆Snn(C) containing all objects and whose mapping spaces are spanned by those morphisms as in (32) for which p is m-truncated. A similar argument then shows that Snm(C) is the free m-semiadditive ∞-category with Kn-indexed colimits generated from C.
5.4. Higher semiadditivity and topological field theories
In this section we will discuss a relation between the results of this paper and 1-dimensional topological field theories, and more specifically, with the notion of finite path integrals as described in [3, §3].
We first discuss the universal constructions of §5.3 in the presence of a symmetric monoidal structure. Recall that by [9, Proposition 4.8.1.10] the free-forgetful adjunction Cat∞⊣CatKm induces an adjunction CAlg(Cat∞)⊣CAlg(CatKm) on commutative algebra objects which is compatible with the free-forgetful adjunction. In particular, if D⊗∈CAlg(Cat∞) is a symmetric monoidal ∞-category then the ∞-category Sm(D) (which, by Corollary 5.33, is the image of D in CatKm under the free functor Cat∞⟶CatKm) carries a canonical symmetric monoidal structure, under which it can be identified with the image of D⊗ under the left adjoint CAlg(Cat∞)⟶CAlg(CatKm). Since the tensor product on Sm(C) preserves Km-colimits in each variable separately the characterization of colimits given in Lemma 5.31 yields an explicit formula for the monoidal product as (X,LX)⊗(Y,LY)=(X×Y,LX⊗LY), where LX⊗LY:X×Y⟶D is the local system (LX⊗LY)(x,y)=LX(x)⊗LY(y). We also note that by the above the unit map D⟶Sm(D) is symmetric monoidal, and if D already has Km-indexed colimits and its monoidal structure commutes with Km-indexed in each variable separately then the counit map Sm(D)⟶D is symmetric monoidal as well.
Corollary 5.38 tells us that we have a similar phenomenon with Smm(D): indeed, by Proposition 5.6 the ∞-category Smm(D) inherits a canonical commutative algebra structure in Addm≃ModSmm(CatKm) under which it can be identified with the image of Sm(D)⊗∈CAlg(CatKm) under the left functor CatKm⟶Addm. Combined with the above considerations we may further identify Smm(C)⊗∈CAlg(Addm) with the image of D under the left functor CAlg(Cat∞)⟶CAlg(Addm). In explicit terms, Smm(D) carries a symmetric monoidal structure which preserves Km-indexed colimits in each variable separately and the unit map D⟶Smm(D) extends to a symmetric monoidal functor. Furthermore, if D is already m-semiadditive and its symmetric monoidal structure commutes with Km-indexed colimits in each variable separately then the counit map Smm(D)⟶D is symmetric monoidal as well.
The following lemma appears to be well-known, but we could not find a reference. Note that, while the lemma is phrased for Smm(D), it has nothing to do with the finiteness or truncation of the spaces in Smm. In particular, the analogous claim holds if one replaces Smm(D) by the analogous ∞-category of decorated spans between arbitrary spaces.
Lemma 5.40**.**
Let D be a symmetric monoidal ∞-category. Let (X,LX)∈Smm(D) be such that LX(x) is dualizable in D for every x∈X. Then (X,LX) is dualizable in Smm(D).
Proof.
Let Ddl⊆D be the full subcategory spanned by dualizable objects and let (Ddl)≃⊆Ddl be the maximal subgroupoid of Ddl. Let Bord1⊗ be the 1-dimensional framed cobordism ∞-category. By the 1-dimensional cobordism hypothesis ([12],[5]), evaluation at the positively 1-framed point ∗+∈Bord1 induces an equivalence
[TABLE]
Now let (X,LX) be an object of Smm(D) such that LX(x) is dualizable for every x∈X. Then the local system LX:X⟶D factors through a local system LX′:X⟶(Ddl)≃. By the equivalence (43) we may lift LX to a local system LX′:X⟶Fun⊗(Bord1⊗,D⊗) valued in topological field theories. Evaluation at the negatively 1-framed point ∗−∈Bord1 now yields a local system L^X:X⟶D. Furthermore, for every x∈X, evaluation at the evaluation bordism ev:∗+∐∗−⟶∅ induces a map LX′(x,ev):LX(x)⊗L^X(x)⟶1D exhibiting L^X(x) as dual to LX(x). Allowing x to vary we obtain a natural transformation LX′(ev):(LX⊗L^X)∘δ⇒1D of D-valued local systems on X, where δ:X⟶X×X is the diagonal map. Similarly, we may evaluate at the coevaluation cobordism coev:∅⟶∗−∐∗+ and obtain a natural transformation LX′(coev):1D⇒(L^X⊗LX)∘δ, which, for each x, determines a compatible coevaluation map 1⟶L^X(x)⊗LX(x).
Now let q:X⟶∗ denote the constant map and consider the morphisms ev(X,LX):(X,LX)⊗(X,L^X)=(X×X,LX⊗L^X)⟶∗ and ∗⟶(X×X,L^X⊗LX) in Smm(C) given by the spans
[TABLE]
and
[TABLE]
It is now straightforward to check that the morphisms (44) and (45) satisfy the evaluation-coevaluation identities and hence exhibit (X,LX) and (X,L^X) as dual to each other.
∎
Let us now explain the relation of the above construction with the notion of finite path integrals as described in [3]. Given a local system LX:X⟶D of dualizable objects in D (e.g., a family of invertible objects), one obtains, as described in Lemma 5.40, a dualizable object (X,LX) of the decorated span ∞-category Smm(D). By the cobordism hypothesis this object determines a 1-dimensional topological field theory Z:Bord1⟶Smm(D) which sends the point to (X,LX). The term quantization is sometimes used to describe a procedure in which the topological field theory Z can be “integrated” into a topological field theory taking values in D (see, e.g., [14]). This can often be achieved, at various levels of rigor, but performing some kind of a path integral.
Such a path integral is described informally in [3] in the setting of finite groupoids (i.e. m=1) and where the target ∞-category D is the category of vector spaces over the complex numbers. More generally, the authors of [3] work with an n-categorical version of the span construction and consider n-dimensional topological field theories. However, as the paper [3] is expository in nature, it discusses these ideas somewhat informally, leaving many assertions without a formal proof or a precise formulation. In a recent paper [15], F. Trova suggests to use the formalism of Nakayama categories in order to give a formal definition of quantization in the setting of finite groupoids and 1-dimensional field theories, when the target is an ordinary category satisfying suitable conditions. We shall now explain how the results of the present paper can be used to give a formal definition of quantization when the target is an m-semiadditive ∞-category and finite groupoids are generalized to m-finite spaces.
Let Z:Bord1⟶Smm(D) be the topological field theory determined by a local system LX:X⟶D of dualizable objects in D. Suppose that D is m-semiadditive and that the monoidal structure on D preserves Km-indexed colimits in each variable separately. Then we may consider the counit map νD:Smm(D)⟶D associated to the free-forgetful adjunction CAlg(Cat∞)⊣CAlg(CatKm). This counit map is a symmetric monoidal functor, and we may consequently post-compose the topological field theory Z with νD to obtain a topological field theory Z:Bord1⟶D.
The association Z↦Z can be considered as a quantization procedure, and by comparing values on the point it must be compatible with the approach of [3]. We note that one may write the counit map νD:Smm(D)⟶D explicitly by using the formation of colimits and the formal summation of Km-families of maps in D via its canonical enrichment in m-commutative moniods established in §5.2. The resulting formulas can then be considered as explicit forms of path integrals. We may also summarize this process with the following corollary:
Corollary 5.41**.**
Let D be an m-semiadditive ∞-category equipped with a symmetric monoidal structure which preserves Km-indexed colimits in each variable separately. Then the collection of dualizable objects in D is closed under Km-indexed colimits. Furthermore, if X is m-finite space and LX:X⟶D is a local system of dualizable objects in D, then the 1-dimensional topological field theory Bord1⟶D determined by the dualizable object colimL is the quantization of the topological field theory Bord1⟶Smm(D) determined by the dualizable object (X,LX)∈Smm(D).