Controlled objects as a symmetric monoidal functor
Ulrich Bunke, Luigi Caputi

TL;DR
This paper constructs a functorial association between symmetric monoidal additive categories with group actions and coarse spaces, enabling a refined equivariant coarse algebraic K-homology.
Contribution
It introduces a new lax symmetric monoidal functor from $G$-bornological coarse spaces to additive categories, refining equivariant coarse algebraic K-homology.
Findings
Defines a functor $ extbf{V}_{ extbf{A}}^{G}$ for symmetric monoidal additive categories with $G$-action.
Establishes a lax symmetric monoidal structure on the equivariant coarse algebraic K-homology.
Provides a framework for functorial and monoidal refinement of equivariant coarse algebraic K-homology.
Abstract
The goal of this paper is to associate functorially to every symmetric monoidal additive category with a strict -action a lax symmetric monoidal functor from the symmetric monoidal category of -bornological coarse spaces to the symmetric monoidal -category of additive categories . This allows to refine equivariant coarse algebraic -homology to a lax symmetric monoidal functor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Algebraic structures and combinatorial models · Advanced Topics in Algebra
Controlled objects as a symmetric monoidal functor
Ulrich Bunke and Luigi Caputi Fakultät für Mathematik, Universität Regensburg, 93040 Regensburg, GERMANY
[email protected]ät für Mathematik, Universität Regensburg, 93040 Regensburg, GERMANY
Abstract
The goal of this paper is to associate functorially to every symmetric monoidal additive category with a strict -action a lax symmetric monoidal functor from the symmetric monoidal category of -bornological coarse spaces to the symmetric monoidal -category of additive categories . This allows to refine equivariant coarse algebraic -homology to a lax symmetric monoidal functor.
Contents
1 Introduction
A -valued equivariant coarse homology theory is a functor
[TABLE]
satisfying a certain family of axioms [BEKW17, Def. 3.10]. Here, is the category of -bornological coarse spaces and is a stable cocomplete -category. We refer to [BEKW17, Sec. 2.1], or Section 3.2, for details. The category has a symmetric monoidal structure , and if also has a symmetric monoidal structure, then we can ask whether the functor can be refined to a lax symmetric monoidal functor. Such a refinement can simplify calculations or can be applied to obtain localization results, see [BC].
In the present paper, as an example for , we consider the universal coarse algebraic -homology
[TABLE]
associated to an additive category with a strict action of the group , where is the stable -category on non-commutative motives, defined as the target of the universal localizing invariant of Blumberg-Gepner-Tabuada [BGT13]. The functor has been introduced in [BC17] as the universal variant of the spectrum-valued coarse algebraic -homology constructed in [BEKW17, Ch. 8].
By [BGT14, Thm. 5.8], the -category has a symmetric monoidal structure.
The main result of the present paper is the following theorem.
Theorem 1.1**.**
A symmetric monoidal structure on induces a lax symmetric monoidal refinement of the functor .
The functor is constructed as a composition of functors
[TABLE]
where associates to a -bornological coarse space its additive category of equivariant -controlled -objects (see Definition 3.11), and sends an additive category to the motive of the associated stable -category of bounded chain complexes over , where is the set of homotopy equivalences. Since sends equivalences of additive categories to equivalences it has a factorization
[TABLE]
where is the localization at the equivalences of additive categories, in the realm of -categories.
Theorem 1.1 follows from the following two assertions:
Theorem 1.2** (Theorem 3.26).**
A symmetric monoidal structure on induces a lax symmetric monoidal refinement
[TABLE]
of the functor .
Theorem 1.3** (Theorem 3.27).**
The functor admits a lax symmetric monoidal refinement
[TABLE]
The main difficulty in proving Theorem 1.2 is that the symmetric monoidal category of small additive categories is of a -categorical nature. A pedestrian approach to the proof of this theorem would thus require to work with symmetric monoidal structures on -categories and therefore tedious considerations of a large set of commuting diagrams. In this paper we prefer to use the language of symmetric monoidal -categories. In Section 3.4, by using the Grothendieck construction, we encode the functor into a cocartesian fibration coming from an op-fibration of -categories. We then encode a symmetric monoidal refinement of the functor into a symmetric monoidal structure on and a symmetric monoidal refinement of the functor to . This only requires -categorical considerations. The machine of -categories then produces, as explained in Section 2, the asserted symmetric monoidal refinement in Theorem 1.2.
The technical results Theorem 2.2 and Theorem 2.3 might be of independent interest in cases where one wants to construct symmetric monoidal refinements of functors from -categories to or .
Theorem 1.3 is shown in Section 3.5 by combining various results in the literature on -categories.
Acknowledgements: We thank Denis-Charles Cisinksi and Thomas Nikolaus for helpful discussion. U.B. was supported by the SFB 1085 (Higher Invariants) and L.C. was supported by the GK 1692 (Curvature, Cycles, and Cohomology).
2 Symmetric monoidal functors to and
In this section, we construct lax symmetric monoidal refinements of functors from symmetric monoidal -categories to the categories (and ) of small (additive) categories.
2.1 From - to -categories
A symmetric monoidal structure on a -category consists of the tensor functor
[TABLE]
the tensor unit , and the associator, symmetry and unit-transformations, which must satisfy various compatibility relations. If and are symmetric monoidal -categories, then we can consider lax symmetric monoidal functors from to . Such a lax symmetric monoidal functor is given by a functor together with a natural transformation
[TABLE]
that is compatible with the associators, symmetries and unit-transformations of and in a suitable way. We will list these structures and relations in Subsection 3.1 below.
The categories or of small additive categories and small categories are naturally -categories. Furthermore, the category is symmetric monoidal with respect to the Cartesian symmetric monoidal structure . The category has also a symmetric monoidal structure : if and are two additive categories, then the objects of the tensor product are pairs of objects in and in , and the morphisms are given by the tensor product
[TABLE]
of abelian groups.
In the case of a symmetric monoidal structure on a -category, like or , we have the same compatibility relations between the structures (tensor functor, tensor unit, etc.) as in the -categorical case, but they are satisfied up to -morphisms only, which in turn must satisfy higher compatibility relations. A similar remark applies to the notion of a (lax) symmetric monoidal functor.
In the present paper we consider the -categorical situation as explicitly manageable, and we will avoid to explicitly work with symmetric monoidal structures on -categories.
Let be a symmetric monoidal -category. Our goal is to construct symmetric monoidal functors or using -categorical data only. Instead of working with the symmetric monoidal -categories or we will actually use the associated symmetric monoidal -categories or .
We start with the ordinary category of small categories. Let be the equivalences in . The localization in large -categories
[TABLE]
is the large -category of categories. It models the -category in the following sense. The -category can be considered as a category enriched in categories. Applying the nerve functor to the -categories in we get a fibrant111i.e., the -complexes are Kan complexes simplicially enriched category . Applying the homotopy coherent nerve functor , we get an -category
[TABLE]
Then, we have an equivalence of -categories
[TABLE]
We refer to the appendix of [GHN17] for more details about .
The category is a symmetric monoidal category and therefore gives rise to an op-fibration of -categories [Lur14, Constr. 2.0.01], and to a symmetric monoidal -category [Lur14, Def. 2.0.0.7 & Ex. 2.1.2.21]
[TABLE]
respectively. The equivalences are preserved by the cartesian product. Hence we can form a symmetric monoidal localization [Hin16, Prop. 3.2.2]
[TABLE]
whose underlying -category is equivalent to . Conseqently, the symmetric monoidal -category models the symmetric monoidal -category . In this way we avoid to spell out the structures of a symmetric monoidal -category explicitly.
A similar reasoning applies to . We consider the large -category of small additive categories and exact functors with the equivalences . Then we define the large -category
[TABLE]
and get an equivalence
[TABLE]
We can consider as a symmetric monoidal category giving rise to an op-fibration of -categories and a symmetric monoidal -category
[TABLE]
Since the equivalences are preserved by the tensor product , we get the symmetric monoidal localization
[TABLE]
whose underlying -category is equivalent to . Therefore models the symmetric monoidal -category .
Let be an ordinary category. A functor (or ) gives rise to a functor between -categories (or ) in the natural way, e.g. as the composition
[TABLE]
A symmetric monoidal -category gives rise to the symmetric monoidal -category whose underlying -category is equivalent to . We now consider a functor (or ). Recall that a map of -operads [Lur14, Def. 2.1.2.7] can be thought of as a (lax) symmetric monoidal functor [Lur14, Def. 2.1.3.7] between the underlying categories.
Let and be as above.
Definition 2.1**.**
A lax symmetric monoidal refinement of is a morphism of -operads
[TABLE]
that induces a functor equivalent to on the underlying -categories.
Using this definition we avoid to spell out the details of the notion of a lax-symmetric functor from to the -category or .
2.2 Symmetric monoidal refinements of functors to and
In this subsection we state the technical results Theorem 2.2 and Theorem 2.3 which provide lax symmetric monoidal refinements of functors to and .
Let be a -category. A functor between -categories
[TABLE]
can be interpreted, via the Grothendieck construction, as a cocartesian fibration
[TABLE]
An object of the -category is a pair with in and in . A morphism is a pair of a morphism in and a morphim in .
Assume that the categories and have symmetric monoidal structures such that
[TABLE]
i.e., preserves the tensor product strictly. Then, we can write
[TABLE]
For every two objects in we obtain a bifunctor
[TABLE]
which is defined on morphisms in the canonical way. Let
[TABLE]
be morphisms in and in and in . Then
[TABLE]
are morphisms in . Then the second component of their tensor product
[TABLE]
is a morphism
[TABLE]
in . This morphism will appear in the assumptions of the two theorems below.
We now consider the following data:
a symmetric monoidal -category , 2. 2.
a functor , 3. 3.
a symmetric monoidal structure on the Grothendieck construction of .
Let denote the associated projection.
Theorem 2.2**.**
Assume:
The functor strictly preserves the tensor product, the tensor unit as well as the associator, unit, and symmetry transformations. 2. 2.
For every two objects and in and morphisms and in the morphism (2.3)
[TABLE]
is an isomorphism.
Then the data provide a lax symmetric monoidal refinement (Def. 2.1)
[TABLE]
of the functor .
Note that Condition 1 in the theorem implies the Relation (2.1) so that the bifunctors appearing in Condition 2 are, in fact, defined.
The analoguous version for additive categories is the following.
Consider the following data:
a symmetric monoidal -category , 2. 2.
a functor , 3. 3.
a symmetric monoidal structure on the Grothendieck construction of .
Let denote the associated projection.
Theorem 2.3**.**
Assume:
The functor strictly preserves the tensor product, the tensor unit as well as the associator, unit, and symmetry transformations. 2. 2.
The functors are bi-additive for every in . 3. 3.
For every two objects and in and morphisms and in the morphism (2.3)
[TABLE]
is an isomorphism.
Then the data provide a lax symmetric monoidal refinement
[TABLE]
of the functor .
2.3 Proofs of Theorem 2.2 and Theorem 2.3.
We start with the proof of Theorem 2.2. Let
[TABLE]
denote the symmetric monoidal -category corresponding to the symmetric monoidal category [Lur14, Ex. 2.1.2.21]. Let
[TABLE]
be the cocartesian fibration corresponding to the symmetric monoidal category of small categories. Then the -category
[TABLE]
corresponds to the -category of lax symmetric monoidal functors
[TABLE]
see the text after [Lur14, Rem. 2.1.3.6]. We let
[TABLE]
denote the category of -monoids in [Lur14, Def. 2.4.2.1]. By [Lur14, Prop. 2.4.2.5], we have an equivalence
[TABLE]
By [Lur14, Rem. 2.4.2.4], in order to provide an object of , it suffices to present a cocartesian fibration
[TABLE]
which exhibits as a -monoidal category [Lur14, Rem. 2.1.2.13]. To this end we must show that the composition
[TABLE]
exhibits as an -operad [Lur14, Prop. 2.1.2.12].
Let
[TABLE]
be a symmetric monoidal functor between -categories as in the Theorem 2.2. We get an induced functor of symmetric monoidal categories
[TABLE]
and thus a morphism of -operads
[TABLE]
Our task is then to show that exhibits as an -monoidal category, and we must only check that is a cocartesian fibration. It suffices to check that is an op-fibration of -categories.
By assumption, the underlying functor of (after forgetting the symmetric monoidal structures) arose from a Grothendieck construction for a functor
[TABLE]
Recall from [Lur14, Constr. 2.0.0.1] that the objects of in the fibre of over in are -tuples of objects of . Consider two objects
[TABLE]
in and and an object
[TABLE]
in , where belongs to . Let be a morphism in and
[TABLE]
be a morphism in over . Then is given by a collection of morphisms with
[TABLE]
We must provide a cocartesian lift of . For in we have a morphism
[TABLE]
in . One now checks in a straightforward (but tedious) manner that the collection is the cocartesian lift of . The argument repeatedly uses the Condition 2. This finishes the proof of Theorem 2.2.
We now turn to the proof of Theorem 2.3. Consider the symmetric monoidal subcategory
[TABLE]
Indeed we can first consider the subcategory of -categories which admit finite coproducts and coproduct preserving functors. By [Lur14, Cor. 4.8.1.4] (applied to the collection of finite sets) we get a symmetric monoidal subcategory
[TABLE]
In the next step we view as a full subcategory of of pointed -categories in which products and coproducts coincide. Using [Lur14, Cor. 2.2.1.1] one then shows that
[TABLE]
is again a suboperad. We now consider the diagram
[TABLE]
The lower horizontal map is a morphism of -operads by Theorem 2.2. We first argue that the dotted lift exists. To this end we use [Lur14, Notation 4.8.1.2]. One must check that takes values in categories admitting finite coproducts (clear), and that the functors
[TABLE]
preserves sums in both variables separately, i.e., Assumption 2. Finally, for the dashed arrow we use that takes values in .
3 The symmetric monoidal functor of controlled objects
3.1 Symmetric monoidal structures
In this subsection we write out, for later reference, the structures of a symmetric monoidal category and of a (lax) symmetric monoidal functor. Let be a -category:
Definition 3.1**.**
[Mac71, Sec. VII. 1. & 7.]** A symmetric monoidal structure on is given by the following data:
a bifunctor , 2. 2.
an object (the tensor unit), 3. 3.
a natural isomorphism (the associativity constraint)
[TABLE] 4. 4.
a natural isomorphism (the unit constraint), 5. 5.
a natural isomorphism (the symmetry) , where is the flip functor.
This data have to satisfy the following relations:
the pentagon relation, 2. 2.
*the triangle relation, * 3. 3.
the inverse relation, 4. 4.
*the associativity coherence. *
A symmetric monoidal category is a category equipped with a symmetric monoidal structure.
We will use the name of the category as a superscript for the constraints, but if we evaluate e.g. the symmetry constraint at the objects of , then we write shortly instead of since the type of objects in the subscript already determines the category in question.
Let and be symmetric monoidal categories, and let be a functor.
Definition 3.2**.**
[Mac71, Sec. XI. 2.]** A symmetric monoidal structure on is given by the following data:
an isomorphism , 2. 2.
a natural isomorphism .
This data have to satisfy the following relations:
associativity relation, 2. 2.
unitality relation, 3. 3.
symmetry relation.
Remark 3.3**.**
If we weaken the assumptions and we only require that and are natural transformations, then we get the definition of a lax symmetric monoidal functor.
3.2 Bornological coarse spaces
In this subsection we recall the definition of the symmetric monoidal category of -bornological coarse spaces [BE16, Sec. 2], [BEKW17, Sec. 2.1].
In the definitions below we will use the following notation:
For a set we let denote the power set of . 2. 2.
If a group acts on a set , then it acts diagonally on and therefore on . For in we set
[TABLE] 3. 3.
For in and in we define the -thickening by
[TABLE] 4. 4.
For in we define its inverse by
[TABLE] 5. 5.
For in we define their composition by
[TABLE]
Let be a group and let be a -set.
Definition 3.4**.**
A -coarse structure on is a subset of with the following properties:
* is closed under composition, inversion, and forming finite unions or subsets. * 2. 2.
* contains the diagonal of .* 3. 3.
For every in , the set is also in .
The pair is called a -coarse space, and the members of are called (coarse) entourages of .
Let and be -coarse spaces and let be an equivariant map between the underlying sets.
Definition 3.5**.**
The map is controlled if for every in we have .
We obtain a category of -coarse spaces and controlled equivariant maps.
Let be a group and let be a -set.
Definition 3.6**.**
A -bornology on is a subset of with the following properties:
* is closed under forming finite unions and subsets.* 2. 2.
* contains all finite subsets of .* 3. 3.
* is -invariant.*
The pair is called a -bornological space, and the members of are called bounded subsets of .
Let and be -bornological spaces and let be an equivariant map between the underlying sets.
Definition 3.7**.**
The map is proper if for every in we have .
We obtain a category of -bornological spaces and proper equivariant maps.
Let be a -set equipped with a -coarse structure and a -bornology .
Definition 3.8**.**
The coarse structure and the bornology are said to be compatible if for every in and in the -thickening (see (3.1)) lies in .
Definition 3.9**.**
A -bornological coarse space is a triple consisting of a -set , a -coarse structure and a -bornology on , such that and are compatible.
Usually we will denote a -bornological coarse space by the symbol and write and for its bornology and coarse structures.
Definition 3.10**.**
A morphism between -bornological coarse spaces is an equivariant map of the underlying -sets that is controlled and proper.
We obtain a category of -bornological coarse spaces and morphisms.
Next we describe the symmetric monoidal structure on [BEKW17, Ex. 2.17]. We have a forgetful functor
[TABLE]
which associates to every -bornological coarse space its underlying -set. This functor is faithful. The category is endowed with the cartesian symmetric monoidal structure. The symmetric monoidal structure on will be defined in such a way that the functor preserves the unit and the tensor product strictly, i.e., the morphisms 1 and 2 in Definition 3.2 are identities. In other words, the associator, unit and symmetry constraints are imported from and satisfy the relations required in Definition 3.1 automatically.
We start with the description of the bifunctor
[TABLE]
Let and be two -bornological coarse spaces. Then their tensor product
[TABLE]
is the -bornological coarse spaces defined as follows:
The underlying -set of is the cartesian product of the underlying -sets . 2. 2.
The -bornology on is generated by the subsets for all in and in . 3. 3.
The -coarse structure on is generated by the entourages for in and in .
Here a -bornological (or coarse, respectivley) structure generated by a family of subsets (or entourages) is the minimal -bornological (or -coarse) structure containing these subsets (or entourages). Note that the underlying -coarse space of the tensor product represents the cartesian product of the underlying -coarse spaces of the factors in , but the tensor product is not the cartesian product in in general.
From now on we will use the shorter notation for the tensor product of -bornological coarse spaces, i.e., we omit the subscript .
If and are morphisms of -bornological coarse spaces, then their tensor product
[TABLE]
is induced by the equivariant map of underlying -sets . This finishes the description of the bifunctor 3.1.1
The tensor unit (3.1.2) is given by the one-point space .
As explained above, the associativity, unit and symmetry constraints are imported from . It is straightforward to check that they are implemented by morphisms of -bornological coarse spaces.
This finishes the description of the symmetric monoidal structure on the category .
3.3 Controlled objects
In this section, for every additive category with a strict -action, we describe the functor
[TABLE]
which sends a -bornological coarse space to its additive category of equivariant -controlled -object [BEKW17, Sec. 8.2].
For a group , let be the category with one object and . Then is the category of additive categories with a strict -action. Explicitly, an additive category with a strict -action is an additive category (the evaluation of the functor at the object in ) together with an action of on by exact functors, which is strictly associative. Our notation for the action of in on objects of and morphisms is
[TABLE]
Let be an additive category with a strict -action and be a -bornological coarse space. We consider the bornology of as a poset with a -action , hence as a category with a strict -action, i.e., an object of .
The category has an induced -action which can explicitly be described as follows. If is a functor and is an element of , then is the functor which sends a bounded set in to the object of . If is a natural transformation between two such functors, then we let denote the canonically induced natural transformation.
Definition 3.11**.**
[BEKW17, Def. 8.3]** An equivariant -controlled -object is a pair consisting of a functor and a family of natural isomorphisms satisfying the following conditions:
. 2. 2.
For all in , the commutative square
[TABLE]
is a pushout square. 3. 3.
For all in there exists a finite subset of such that the inclusion induces an isomorphism . 4. 4.
For all pairs of elements of we have the relation .
If is an invariant coarse entourage of , i.e., an element of , then we get a -equivariant functor
[TABLE]
which sends a bounded subset of to its -thickening , see (3.1). Indeed, the -thickening of a bounded subset is again bounded by the compatibility of the coarse structure and the bornology of , and preserves the inclusion relation. Since is -invariant we have the equality . It implies that is -equivariant. If is a functor, then we write for the pull-back of along .
Let be two equivariant -controlled -objects and be an invariant coarse entourage of .
Definition 3.12**.**
An equivariant -controlled morphism is a natural transformation
[TABLE]
such that for all elements of .
We let denote the abelian group of equivariant -controlled morphisms.
If is in such that , then for every in we have . These inclusions induce a transformation between functors and therefore a map
[TABLE]
by postcomposition. Using these maps in the interpretation of the colimit we define the abelian group of equivariant controlled morphisms from to by
[TABLE]
We now consider a pair of morphisms in
[TABLE]
respectively, which are represented by
[TABLE]
We define the composition of the two morphisms to be represented by the morphism
[TABLE]
(see (3.2) for notation) where
[TABLE]
is defined in the canonical manner. We denote the resulting category of equivariant -controlled -objects and equivariant controlled morphisms by . This category is additive [BEKW17, Lemma 8.7].
Let be a morphism of -bornological coarse spaces, and let be an equivariant -controlled -object. Since is proper, it induces an equivariant functor , and we can define a functor by
[TABLE]
Furthermore, we define
[TABLE]
Let be in and let be an equivariant -controlled morphism. Then belongs to and we have for all bounded subsets of . Therefore, we obtain an induced -controlled morphism
[TABLE]
One checks that this construction defines an additive functor
[TABLE]
This completes the construction of the functor
[TABLE]
In the following we give a more explicit description of the objects and morphisms in which will be used in the description of the symmetric monoidal structure on the Grothendieck construction associated to the functor in Section 3.4.
Convention 3.13**.**
We consider an additive category . If is a family of objects of with at most finitely many non-zero members, then we use the symbol in order to denote a choice of an object of together with a family of morphisms representing the coproduct of the family.
Since in an additive category coproducts and products coincide, for every in we furthermore have a canonical projection
[TABLE]
such that the diagram
[TABLE]
commutes.
If is a second family of this type and is a family of morphisms in , then we have a unique morphism such that the squares
[TABLE]
commute for every in and in .∎
Let be a small additive category with strict -action. Let be a -bornological coarse space (see Definition 3.9), and let be an equivariant -controlled -object (see Definition 3.11). Let be in and be a point in . The inclusion induces a morphism in . The conditions 3.11.1 and 3.11.2 together imply that for all but finitely many points of , and that the canonical morphism (induced by the universal property of the coproduct in )
[TABLE]
is an isomorphism.
Let now be in , and let be an equivariant -controlled morphism. By Definition 3.12, the morphism is given by a natural transformation of functors satisfying an equivariance condition. For every point in we get a morphism
[TABLE]
in . We let
[TABLE]
denote the composition of (3.6) with the projection onto the summand corresponding to . In this way we get a family of morphisms in . In a similar manner, for in , the transformation gives rise to a family of morphisms
[TABLE]
By construction the family satisfies the following conditions.
For all in the condition implies that . 2. 2.
We have for all in and in .
Lemma 3.14**.**
We have a bijection between equivariant -controlled morphisms and families of morphisms as in (3.7) satisfying the Conditions 1 and 2.
Proof.
Let and be in . We must show that a matrix of morphisms as in (3.7) which satisfies the Conditions 1 and 2 gives rise to an equivariant controlled morphism . Let be in such that Condition 1 holds true. We must construct an equivariant natural transformation .
We consider in . Then and are families of objects in with at most finitely many non-zero members. Using Convention 3.13, and in particular the notation from (3.4), we can define the morphism such that
[TABLE]
commutes. It is now straightforward to check that the family assembles to a natural transformation as required. By construction the morphism is -controlled. Furthermore, the Condition 2 implies that satisfies the equivariance condition stated in Definition 3.12. ∎
Let be a morphism of -bornological coarse spaces and be objects of for . Then a morphism
[TABLE]
induces a matrix
[TABLE]
To this end we observe that
[TABLE]
so that
[TABLE]
is the matrix representing according to Lemma 3.14. As a consequence of Lemma 3.14 we obtain:
Corollary 3.15**.**
A matrix (3.10) represents a morphism (3.9) iff the following conditions are satisfied:
There exists an entourage in such that for every in and in the condition implies that . 2. 2.
For every in we have the equality
[TABLE]
3.4 The symmetric monoidal refinement of
Let be a small additive category with a strict -action. Then we let
[TABLE]
denote the Grothendieck construction associated to the functor (see (3.3)) viewed as a functor from to . The goal of this section is the construction of a symmetric monoidal structure (see Definition 3.1) on which satisfies the assumptions of Theorem 2.3.
Assumption 3.16**.**
We assume that has a symmetric monoidal structure and that the strict action of on has a refinement to an action by symmetric monoidal functors.
In order to introduce the notation for later arguments, we spell out the Assumption 3.16 explicitly. According to Definition 3.1 the category comes with the following data:
a bifunctor , 2. 2.
a tensor unit , 3. 3.
an associativity constraint , 4. 4.
a unit constraint , 5. 5.
a symmetry constraint .
This data satisfy the relations specified in Definition 3.1.
The strict action of on by symmetric monoidal functors is implemented by the following data. For every in we have:
an additive functor , 2. 2.
an isomorphism , 3. 3.
a natural isomorphism ,
satisfying the relations specified in Definition 3.2. We require that for all and in the following relation between the composition of symmetric monoidal functors and multiplication in holds true:
[TABLE]
The equality (as opposed to the additional data of a natural transformation) expresses the fact that the action of on is strict.
We now describe the category explicitly.
The objects of are pairs of objects in and in . 2. 2.
A morphism consists of a morphism in and a morphism in . 3. 3.
The composition of morphisms is given by
[TABLE]
The functor
[TABLE]
is the obvious functor which forgets the second component.
We now start with the description of the symmetric monoidal structure on .
Let denote the one-point space. Then we can consider the equivariant -controlled -object in defined as follows:
The functor is uniquely determined by . 2. 2.
for all in (see 2.).
Definition 3.17**.**
The tensor unit of is defined to be the object .
We now construct the bifunctor
[TABLE]
We start with its definition on objects. We consider two objects and in . Then we define the functor
[TABLE]
as follows:
For every in we set (see Convention 3.13)
[TABLE]
Note that the sum has finitely many non-zero summands because of Definition 3.11 (3). 2. 2.
If is in such that , then the morphism
[TABLE]
is given by the canonical map
[TABLE]
as described in Convention 3.13.
By using our Convention 3.13 and the universal property of the direct sum, one easily checks that this describes a functor satisfying the first three conditions of Definition 3.11.
We now define the family as follows:
[TABLE]
using the notation (3.8). One checks using (3.11) that satisfies the remaining condition of Definition 3.11 and therefore belongs to .
Definition 3.18**.**
We define the bifunctor (3.12) on objects by
[TABLE]
Let be a morphism in (see 2). Then we define the morphism
[TABLE]
as follows.
We set using the tensor product in . 2. 2.
In order to describe the morphism
[TABLE]
we use Corollary 3.15. We must describe the matrix
[TABLE]
Now note that by definition
[TABLE]
so that we can set
[TABLE]
One easily checks that this matrix satisfies the conditions listed in Corollary 3.15 and therefore represents the desired morphism.
In a similar manner we define for a morphism .
Definition 3.19**.**
We define the bifunctor (3.12) on morphisms by the preceding description.
It is straightforward to check that (3.12) is a bifunctor, i.e., that its description on morphisms is compatible with composition.
Next we define the associativity constraint . We consider three objects , , and . Then
[TABLE]
must be a morphism
[TABLE]
We set
[TABLE]
using the associativity constraint of . The second component is given via Corollary 3.15 by the matrix whose only non-trivial entries are
[TABLE]
using the associativity constraint of . The first condition of Corollary 3.15 is satisfied for the diagonal entourage of , and for the second condition we use that acts on by symmetric monoidal functors, in particular the first relation in Definition 3.2 for for all in , see 3.
Definition 3.20**.**
We define the associativity constraint by the description above.
It is straightforward but tedious to check that is a natural transformation.
Following Definition 3.17 the unit constraint of is implemented by morphisms
[TABLE]
for all objects of . We set
[TABLE]
using the unit constraint of . Note that
[TABLE]
Hence, using Corollary 3.15, we can define morphism such that the non-trivial entries of its matrix are
[TABLE]
using the unit constraint of . It is easy to check that this matrix satisfies the first condition of Corollary 3.15 for the diagonal of and the second condition since the morphisms in 2 satisfy the relation of Definition 3.2.2 for all in .
Definition 3.21**.**
We define the unit constraint by the description above.
It is straightforward to check that is a natural transformation.
Finally we define the symmetry constraint . We consider two objects and of . Then we must define a morphism
[TABLE]
We set
[TABLE]
using the symmetry contraint for . The morphism is the given, using Corollary 3.15, by the matrix whose only non-trivial entries are
[TABLE]
using the symmetry constraint of . One easily checks that the first condition of Corollary 3.15 is satisfied for the diagonal entourage of . In order to verify the second condition we use that the transformations in 3 satisfy Definition 3.2.3 for every in .
Definition 3.22**.**
We define the symmetry constraint of by the description above.
It is straightforward to check that is a natural transformation.
Proposition 3.23**.**
The functor and the object together with the natural isomorphisms , and define a symmetric monoidal structure on .
The functor preserves the tensor product and the tensor unit as well as the associator, unit, and symmetry transformations.
Proof.
One verifies the relations listed in Definition 3.1 in a straightforward manner by inserting the definitions and using that the corresponding relations are satisfied for the symmetric monoidal structures on and . ∎
Let and be -bornological coarse spaces.
Proposition 3.24**.**
The functor
[TABLE]
obtained in (2.2) is additive in both variables.
Proof.
Let be in for and be in . In view of the symmetry it suffices to show that the canonical morphism
[TABLE]
is an isomorphism. In view of Conditions 3.11.1 and 3.11.2 it suffices to show that
[TABLE]
is an isomorphism for every point in . By inserting the definitions we see that this morphism is the same as
[TABLE]
But this last morphism is an isomorphism since the tensor product in is additive in the first argument. ∎
Let and be two morphisms of -bornolgical coarse spaces. Let be in and be in .
Lemma 3.25**.**
The morphism
[TABLE]
in (see (2.3)) is an isomorphism.
Proof.
In view of Conditions 3.11.1 and 3.11.2 it suffices to show that
[TABLE]
is an isomorphism for every point in . Inserting the definitions this morphism is given by
[TABLE]
which for every in is the morphism
[TABLE]
induced by the inclusions of the respective summands of the tensor factors. Since the tensor product in preserves sums in both arguments we conclude that (3.13) is an isomorphism. ∎
In view of Theorem 2.3 the Propositions 3.23 and 3.24 and Lemma 3.25 now imply:
Theorem 3.26**.**
If is a symmetric monoidal additive category with a strict action of by symmetric monoidal functors, then the functor admits a refinement to a lax symmetric monoidal functor
[TABLE]
3.5 The symmetric monoidal -theory functor for additive categories
In [BC17] a universal -theory functor
[TABLE]
was considered, where is the category of non-commutative motives of Blumberg-Gepner-Tabuada [BGT13]. This functor was defined as the upper horizontal composition in the diagram
[TABLE]
where is the universal localizing invariant, and sends an additive category to the stable -category of bounded chain complexes over with homotopy equivalences inverted. Since the functor preserves equivalences of additive categories we have the indicated factorization .
Theorem 3.27**.**
The functor admits a symmetric monoidal refinement
[TABLE]
Proof.
The proof of this theorem will be finished at the end of the present section. As a first step we observe that it suffices to construct a symmetric monoidal refinement of . Then we obtain the symmetric monoidal refinement of from the universal property of the symmetric monoidal localization using [Hin16].
By [BGT14] the universal localizing invariant refines to a symmetric monoidal functor
[TABLE]
It therefore remains to produce a symmetric monoidal functor
[TABLE]
refining . We use the symbol in order to indicate that this functor is related with stabilization.
We are going to use the following notation. The category is the -category of small dg-categories. The set is the set of Morita equivalences, i.e., functors between -categories which induce an equivalence of derived categories [Kel06, Sec. 4.6], [Coh, Def. 2.29].
The category contains the full subcategory of locally flat dg-categories, i.e., dg-categories with the property that for every two objects in the complex consists of flat -modules. It furthermore contains the full subcategory of pre-triangulated -categories [Kel06, Sec. 4.5], [BK91].
Furthermore, is the category of -linear stable idempotent complete -categories and -linear exact functors, and forgets the -linear structure. For the equivalence marked by (for Dold-Kan) we refer to [Coh].
Proposition 3.28**.**
We have the bold part of the following commuting diagram:
[TABLE]
Proof.
For every -category the canonical inclusion represents the pretriangulated hull [Kel06, Sec. 4.5], [BK91]. In particular, the functor has values in pretriangulated -categories. 2. 2.
The two triangles in the corresponding square commute since for every -category the canonical inclusion induces a Morita equivalence . To this end we use that the inclusion of into its triangulated hull is a Morita equivalence [Kel06, Sec. 4.6]. 3. 3.
The -nerve preserves Morita equivalences and therefore descends to as indicated. 4. 4.
We have an equivalence , [Fao17, Prop. 3.3.2], see also [Tab10], [Toe07]. In order to provide more details we consider the functor which associates to a -category its underlying category (with ) considered as an -category. We furthermore let be the morphisms in which become isomorphisms in the homotopy category (with ). Then both functors
[TABLE]
present the localization .
∎
The horizontal composition given by the middle row in (3.14) defines a functor .
Lemma 3.29**.**
The functor is equivalent to the functor constructed in [BC17, Prop. 2.11].
Proof.
By [BC17, Rem. 2.9] we have the first equivalence of functors in the chain
[TABLE]
from to . This implies the Lemma in view of the commutativity of (3.14). ∎
Proposition 3.30**.**
The functor has a symmetric monoidal refinement .
Proof.
All -categories in the lower two lines of the diagram (3.14) have symmetric monoidal structures and the functors connecting them have canonical symmetric monoidal refinements. The same is true for the -categories and the remaining functors except for and the corresponding functors. The problem is that the tensor product of dg-categories is not compatible with Morita equivalences and therefore does not descend to the localization directly. For this reason one considers the subcategory of locally flat dg-categories and uses the equivalence in order to transfer the symmetric monoidal structures. So in order to construct the symmetric monoidal refinement of we must bypass this node of the diagram. To this end we use a symmetric monoidal flat resolution functor as indicated. The left triangle in (3.14) is filled by a natural transformation (not an isomorphism), but the square
[TABLE]
does commute. We then get the following commuting diagram of symmetric monoidal functors
[TABLE]
defining the symmetric monoidal refinement of .
It remains to argue that a symmetric monoidal flat resolution functor exists. We start with the following well-known fact.
Lemma 3.31**.**
There exists a functor fitting into the commuting diagram
[TABLE]
such that the filler is a quasi-isomorphism. 2. 2.
The functor has a lax symmetric monoidal structure.
Proof.
The natural idea works. The functor sends in to
[TABLE]
in , where is the free abelian group generated by the underlying set of , is the kernel of the canonical homomorphism , and is the inclusion. ∎
We define the flat resolution functor for additive categories by
[TABLE]
where the dotted arrow is the natural functor induced from the lax symmetric monoidal functor which provides a functor from -enriched categories to -enriched categories with flat -complexes. Furthermore, the symmetric monoidal structure on induces naturally a symmetric monoidal structure on . ∎
This finishes the proof of Theorem 3.27. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BC] U. Bunke and L. Caputi. Localization for coarse homology theories. in prep.
- 2[BC 17] U. Bunke and D.-Ch. Cisinski. A universal coarse K-theory. ar Xiv:1705.05080 , 2017.
- 3[BE 16] U. Bunke and A. Engel. Homotopy theory with bornological coarse spaces. ar Xiv:1607.03657 v 3 , 2016.
- 4[BEKW 17] U. Bunke, A. Engel, D. Kasprowski, and Ch. Winges. Equivariant coarse homotopy theory and coarse algebraic K 𝐾 K -homology. ar Xiv:1710.04935 , 2017.
- 5[BGT 13] A. J. Blumberg, D. Gepner, and G. Tabuada. A universal characterization of higher algebraic K 𝐾 K -theory. Geom. Topol. , 17(2):733–838, 2013.
- 6[BGT 14] A. J. Blumberg, D. Gepner, and G. Tabuada. Uniqueness of the multiplicative cyclotomic trace. Adv. Math. , 260:191–232, 2014.
- 7[BK 91] A. I. Bondal and M. M. Kapranov. Enhanced triangulated categories. Mathematics of the USSR-Sbornik , 70(1):93, 1991.
- 8[Coh] L. Cohn. Differential graded categories are k-linear stable infinity categories. https://arxiv.org/abs/1308.2587 .
