Abstract bivariant Cuntz semigroups
Ramon Antoine, Francesc Perera, Hannes Thiel

TL;DR
This paper develops a new categorical framework for Cuntz semigroups, introducing a bivariant theory that generalizes morphisms and connects to C$^*$-algebra invariants, with computable cases and applications to order-zero maps.
Contribution
It introduces a closed symmetric monoidal category structure on abstract Cuntz semigroups and defines a bivariant semigroup $[[S,T]]$ for morphisms, extending the theory.
Findings
The category of abstract Cuntz semigroups is closed and symmetric monoidal.
The bivariant semigroup $[[S,T]]$ generalizes morphisms between Cuntz semigroups.
Order-zero maps induce elements in the bivariant Cuntz semigroup.
Abstract
We show that abstract Cuntz semigroups form a closed symmetric monoidal category. Thus, given Cuntz semigroups and , there is another Cuntz semigroup playing the role of morphisms from to . Applied to C-algebras and , the semigroup should be considered as the target in analogues of the UCT for bivariant theories of Cuntz semigroups. Abstract bivariant Cuntz semigroups are computable in a number of interesting cases. We also show that order-zero maps between C-algebras naturally define elements in the respective bivariant Cuntz semigroup.
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.
\newaliascnt
thmCtlma \aliascntresetthethmCt
\newaliascntcorCtlma \aliascntresetthecorCt
\newaliascntprpCtlma \aliascntresettheprpCt
\newaliascntpgrCtlma \aliascntresetthepgrCt
\newaliascntdfnCtlma \aliascntresetthedfnCt
\newaliascntrmkCtlma \aliascntresetthermkCt
\newaliascntrmksCtlma \aliascntresetthermksCt
\newaliascntqstCtlma \aliascntresettheqstCt
\newaliascntpbmCtlma \aliascntresetthepbmCt
\newaliascntexaCtlma \aliascntresettheexaCt
\newaliascntexasCtlma \aliascntresettheexasCt
\newaliascntconjCtlma \aliascntresettheconjCt
\newaliascntntnCtlma \aliascntresetthentnCt
Abstract bivariant Cuntz semigroups
Ramon Antoine
,
Francesc Perera
and
Hannes Thiel
Ramon Antoine and Francesc Perera, Departament de Matemàtiques, Universitat Autònoma de Barcelona, 08193 Bellaterra, Barcelona, Spain
[email protected]; [email protected]
Hannes Thiel, Mathematisches Institut, Universität Münster, Einsteinstrasse 62, 48149 Münster, Germany
Abstract.
We show that abstract Cuntz semigroups form a closed symmetric monoidal category. Thus, given Cuntz semigroups and , there is another Cuntz semigroup playing the role of morphisms from to . Applied to -algebras and , the semigroup should be considered as the target in analogues of the UCT for bivariant theories of Cuntz semigroups.
Abstract bivariant Cuntz semigroups are computable in a number of interesting cases. We also show that order-zero maps between -algebras naturally define elements in the respective bivariant Cuntz semigroup.
Key words and phrases:
Cuntz semigroup, tensor product, continuous poset, -algebra
2010 Mathematics Subject Classification:
Primary 06B35, 06F05, 15A69, 46L05. Secondary 06B30, 06F25, 13J25, 16W80, 16Y60, 18B35, 18D20, 19K14, 46L06, 46M15, 54F05.
1. Introduction
The Cuntz semigroup of a -algebra is an invariant that plays an important role in the structure theory of -algebras and the related Elliott classification program. It is defined analogously to the Murray-von Neumann semigroup, , by using equivalence classes of positive elements instead of projections; see [Cun78]. In general, however, the semigroup contains much more information than , and it is therefore also more difficult to compute.
The Cuntz semigroup has been successfully used in classification results, both in the simple and nonsimple setting. For example, Toms constructed two simple AH-algebras that have the same Elliott invariant, but which are not isomorphic, a fact that is captured by their Cuntz semigroups; see [Tom08]. On the other hand, Robert classified (not necessarily simple) inductive limits of one-dimensional NCCW-complexes with trivial -groups using the Cuntz semigroup; see [Rob12].
The connection of , for a -algebra , with the Elliott invariant of has been explored in a number of instances; see for example [PT07], [BPT08] and [Tik11]. In fact, for the class of simple, unital, nuclear -algebras that are -stable (that is, that tensorially absorb the Jiang-Su algebra ), the Elliott invariant and the Cuntz semigroup together with determine one another functorially; see [ADPS14]. When dropping the assumption of -stability, it is not known whether the pair consisting of the Elliott invariant and the Cuntz semigroup provides a complete invariant for classification of simple, unital, nuclear -algebras.
It is therefore very interesting to study the structural properties of , for a -algebra . This study was initiated by Coward, Elliott and Ivanescu in [CEI08], who introduced a category and showed that the assignment is a sequentially continuous functor from -algebras to . The objects of are called abstract Cuntz semigroups or -semigroups. Working in this category allows one to provide elegant algebraic proofs for structural properties of -algebras.
A systematic study of the category was undertaken in [APT18]. One of the main results obtained is that is naturally a symmetric monoidal category (see Subsection 2.2 for more details). This means, in particular, that admits tensor products and that there is a bifunctor
[TABLE]
which is (up to natural isomorphisms) associative, symmetric, and has a unit object, namely the semigroup . The basic properties of this construction were studied in [APT18], relating in particular with for certain classes of -algebras.
An important motivation for our investigations here is to find an analogue of the universal coefficient theorem (UCT) for Cuntz semigroups. Recall that a separable -algebra is said to satisfy the UCT if for every separable -algebra there is a short exact sequence
[TABLE]
We refer to [Bla98, Chapter 23] for details.
The goal is then to replace by a suitable bivariant version of the Cuntz semigroup (for example, along the lines of [BTZ16]), and the -functor in the category of abelian groups by a suitable internal-hom functor in the category . In this direction, the construction developed in [BTZ16] as a possible substitute for uses certain equivalence classes of completely positive contractive (abbreviated c.p.c.) order-zero maps between -algebras, denoted here as .
The substitute of the -functor in the exact sequence above should be, if it exists, the adjoint to the tensor product functor alluded to above. It is thus a very natural question to determine whether the category is, besides symmetric monoidal, also closed. This problem was left open in [APT18, Chapter 9]. More precisely, given -semigroups and , the question asks if there exists a -semigroup that plays the role of morphisms from to , and such that the functor is adjoint to the functor . This means that, for any other -semigroup , we have a natural bijection
[TABLE]
where denotes the set of morphisms in the category . The morphisms in , also called -morphisms, are order-preserving monoid maps that preserve suprema of increasing sequences and that preserve the so-called way-below relation; see Subsection 2.1. By functoriality, the natural model for -morphisms consists of the ∗-homomorphism between -algebras.
One of the main objectives of this paper is to construct the -semigroup and to study its basic properties. We call an abstract bivariant Cuntz semigroup or a bivariant -semigroup. The construction defines a bifunctor
[TABLE]
referred to as the internal-hom bifunctor; see, for example, [Kel05].
The said construction resorts to the use of a more general class of maps than just -morphisms. A generalized -morphism is defined as an order-preserving monoid map that preserves suprema of increasing sequences (but not necessarily the way-below relation); see Subsection 2.1. The natural model for generalized -morphisms comes from order-zero maps between -algebras. We denote the set of such maps by . Since every -morphism is also a generalized -morphism, we have an inclusion .
When equipped with pointwise order and addition, has a natural structure as a partially ordered monoid, but it is in general not a -semigroup. Similarly, is usually not a -semigroup. The solution is to consider paths in , that is, rationally indexed maps that are ‘rapidly increasing’ in a certain sense. Equipped with a suitable equivalence relation, these paths define the desired -semigroup .
This procedure can be carried out in a much more general setting. In Section 4 we introduce a category of partially ordered semigroups that, roughly speaking, is a weakening of the category , in that the way-below relation is replaced by a possibly different binary relation (called auxiliary relation). We show that is a full subcategory of ; see Section 4. The path construction we have delineated above yields a covariant functor
[TABLE]
that turns out to be right adjoint to the natural inclusion functor from into ; see Section 4. We refer to this functor as the -construction. In [APT18c] we show that the -construction can also be used to compute the Cuntz semigroup of ultraproduct -algebras. In our setting, the functor applied to the semigroup of generalized -morphisms yields the internal-hom of and ; see Subsection 5.1. In other words, for -semigroups and , we define
[TABLE]
We illustrate our results by computing a number of examples, that include the (Cuntz semigroups of the) Jiang-Su algebra , the Jacelon-Razak algebra , UHF-algebras of infinite type, and purely infinite simple -algebras. Interestingly, is isomorphic to the Cuntz semigroup of a II1-factor.
The fact that is a closed category automatically adds additional features well known to category theory. For example, one obtains a composition product given in the form of a -morphism:
[TABLE]
In particular, this product equips with the structure of a (not necessarily commutative) -semiring. These structures will be further analysed in a subsequent paper; see [APT18b].
Finally, we specialise to -algebras and show that a c.p.c. order-zero map between -algebras and naturally defines an element in the bivariant -semigroup ; see Section 6 and Section 6. We then analyse the induced map
[TABLE]
and show it is surjective in a number of cases; namely for a UHF-algebra of infinite type, the Jiang-Su algebra, or the Jacelon-Razak algebra ; see Section 6.
Acknowledgements
This work was initiated during a research in pairs (RiP) stay at the Oberwolfach Research Institute for Mathematics (MFO) in March 2015. The authors would like to thank the MFO for financial support and for providing inspiring working conditions.
Part of this research was conducted while the third named author was visiting the Universitat Autònoma de Barcelona (UAB) in September 2015 and June 2016, and while the first and second named authors visited Münster Universität in June 2015 and 2016. Part of the work was also completed while the second and third named authors were attending the Mittag-Leffler institute during the 2016 program on Classification of Operator Algebras: Complexity, Rigidity, and Dynamics. They would like to thank all the involved institutions for their kind hospitality.
The two first named authors were partially supported by DGI MICIIN (grant No. MTM2011-28992-C02-01), by MINECO (grant No. MTM2014-53644-P), and by the Comissionat per Universitats i Recerca de la Generalitat de Catalunya. The third named author was partially supported by the Deutsche Forschungsgemeinschaft (SFB 878).
2. Preliminaries
Throughout, denotes the -algebra of compact operators on a separable, infinite-dimensional Hilbert space. Given a -algebra , we let denote the positive elements in .
2.1. The category of abstract Cuntz semigroups
In this subsection, we recall the definition of the category of abstract Cuntz semigroups.
\thepgrCt**.**
We first recall the basic theory of the category of positively ordered monoids; see [APT18, Appendix B.2] for details. A positively ordered monoid is a commutative monoid together with a partial order such that implies that for all , and such that for all . We let denote the category whose objects are positively ordered monoids, and whose morphisms are maps preserving addition, order and the zero element.
Let and be positively ordered monoids. We denote the set of -morphisms from to by . A map is called a -bimorphism if it is a -morphism in each variable. We denote the collection of such maps by . We equip both and with pointwise order and addition, which gives them a natural structure as positively ordered monoids.
Given positively ordered monoids and , there exists a positively ordered monoid and a -bimorphism with the following universal property: For every , mapping a -morphism to the -bimorphism defines a natural bijection
[TABLE]
which moreover respects the structure of the (bi)morphism sets as positively ordered monoids. We call together with the tensor product of and .
Recall that a set with a binary relation is called upward directed if for all there exists with . Following [GHK*+*03, Definition I-1.11, p.57], we define auxiliary relations on partially ordered sets and monoids:
Definition \thedfnCt.
Let be a partially ordered set. An auxiliary relation on is a binary relation on satisfying the following conditions for all :
- (1)
If then . 2. (2)
If then .
If is also a monoid, then an auxiliary relation on is said to be additive if for all and if for all with and we have .
An important example of an auxiliary relation is the so called way-below relation, which has its origins in domain theory (see [GHK*+*03]). We recall below its sequential version, which is the one used to define abstract Cuntz semigroups.
Definition \thedfnCt.
Let be a partially ordered set, and let . We say that is way-below , or that is compactly contained in , in symbols , if whenever is an increasing sequence in for which the supremum exists and which satisfies , then there exists with . We say that is compact if . We let denote the set of compact elements in .
The following definition is due to Coward, Elliott and Ivanescu in [CEI08]. See also [APT18, Definition 3.1.2].
Definition \thedfnCt.
A -semigroup, also called abstract Cuntz semigroup, is a positively ordered semigroup that satisfies the following axioms (O1)-(O4):
- (O1)
Every increasing sequence in has a supremum in .
- (O2)
For every element there exists a sequence in with for all , and such that .
- (O3)
If and for , then .
- (O4)
If and are increasing sequences in , then .
Given -semigroups and , a -morphism is a map that preserves addition, order, the zero element, the way-below relation and suprema of increasing sequences. A generalized -morphism is a -morphism that is not required to preserve the way-below relation. We denote the set of -morphisms by ; and we denote the set of generalized -morphisms by .
We let be the category whose objects are -semigroups and whose morphisms are -morphisms.
Remark \thermkCt.
Let be a -semigroup. Note that for all . Thus, (O3) ensures that is an additive auxiliary relation on .
\thepgrCt**.**
Let be a -algebra, and let . We say that is Cuntz subequivalent to , denoted , if there is a sequence in such that . We say that and are Cuntz equivalent, written , provided and . The set of equivalence classes is called the (completed) Cuntz semigroup of . One defines an addition on by setting for . (One uses that there is an isomorphism , and that the definition does not depend on the choice of isomorphism.) The class of is a zero element for . One defines an order on by setting whenever . This gives the structure of a positively ordered monoid.
Theorem \thethmCt ([CEI08]).
For every -algebra , the positively ordered monoid is a -semigroup. Furthermore, if is another -algebra, then a ∗-homomorphism induces a -morphism by
[TABLE]
for . This defines a functor from the category of -algebras with ∗-homomorphisms to the category .
Remark \thermkCt.
Let be a -algebra. In order to show that (O2) holds for one proves that, for every and we have , and that moreover . One can then derive from this that the sequence satisfies the required properties in (O2).
This suggests the possibility of formally strengthening (O2) for every -semigroup in the following way: Given , there exists a -indexed chain of elements with the property that , and whenever . Next, we show that this property holds for all -semigroups.
Lemma 2.1**.**
Let be a set equipped with a transitive binary relation that satisfies the following condition:
- (*)
For each there exists a sequence in such that for all ; and such that whenever satisfies then there exists with .
Then, for every , there exists a chain such that whenever satisfy , and such that for every with there exists with .
Proof.
Note that condition (*) implies the following: Whenever satisfy , then there exists with . This property, which we will refer to as the interpolation property, will be used throughout.
Given , first use (*) to fix an increasing sequence which is cofinal in . (This means that, if satisfies , then there is with .) Use the interpolation property to find such that and consider the chain . Now use the interpolation property to refine the above chain as
[TABLE]
in such a way that moreover . We now proceed inductively, and thus suppose we have constructed a chain with . Use the interpolation property to construct a new chain
[TABLE]
such that
[TABLE]
and such that moreover . This latter condition will ensure that the set of elements thus constructed is cofinal in .
The index set can be totally ordered by setting provided . It now follows from the construction above that whenever .
The set is order-isomorphic to the dyadic rationals in . In fact, is a countably infinite, totally ordered, dense set with no minimal nor maximal element. (Here, dense means that whenever in there exists with .) By a classical result of G. Cantor (see, for example, [Roi90, Theorem 27]), there is only one such set, up to order-isomorphism. We can therefore choose an order-isomorphism and set whenever . ∎
The proof of the following proposition is (essentially) included in [GHK*+*03, Proposition IV-3.1].
Proposition \theprpCt.
Let be a -semigroup, and let . Then, there exists a family in with ; such that whenever satisfy ; and such that for every .
Proof.
Consider equipped with the transitive relation . Then (O2) ensures that condition (*) in Lemma 2.1 is fulfilled with in place of . Hence, given we can apply Lemma 2.1 to choose a -increasing chain with . For each , define . It is now easy to see that the chain satisfies the conclusion. ∎
2.2. Closed, monoidal categories
In this subsection, we recall the basic notions from the theory of closed, monoidal categories. For details we refer to [Kel05] and [Mac71]. See also [APT18, Appendix A].
\thepgrCt**.**
A monoidal category consists of a category (which we assume is locally small), a bifunctor (covariant in each variable) and a unit object in such that, whenever are objects in , there are natural isomorphisms , and , and , that are subject to certain coherence axioms. An object or morphism in means an object or morphism in , respectively. In concrete examples, such as and , we will use the same notation for a monoidal category and its underlying category.
A monoidal category is called symmetric provided that for each pair of objects and there is a natural isomorphism .
In many concrete examples of monoidal categories, the tensor product of two objects and is the object (unique up to natural isomorphism) that linearizes bilinear maps from . This is formalized by considering a functorial association of bimorphisms such that represents the functor , that is, for each there is a natural bijection
[TABLE]
One instance of this is the monoidal structure in the category of abstract Cuntz semigroups. We recall details in Subsection 2.3. Another example is the category of positively ordered monoids; see Subsection 2.1.
\thepgrCt**.**
A monoidal category is said to be closed provided that for each object , the functor has a right adjoint, that we will denote by . Thus, in a closed monoidal category, for all objects , there is a natural bijection
[TABLE]
where denotes the morphisms between two objects and .
Let be a monoidal category with unit object . An enriched category over consists of: a collection of objects in ; an object in , for each pair of objects and in (playing the role of the morphisms in from to ); a -morphism , called the identity on , for each object in (playing the role of the identity morphism on ); and for each triple , and of objects in , a -morphism that plays the role of a composition law and is subject to certain coherence axioms; see [Kel05, Section 1.2] for details.
It follows from general category theory that every closed symmetric monoidal category can be enriched over itself. Let us recall some details. Given two objects and in , the object in plays the role of the morphisms from to . Given an object , the identity on (for the enrichment) is defined as the -morphism that corresponds to the ‘usual’ identity morphism \operatorname{id}_{X}\in\mathcal{V}_{0}\big{(}X,X\big{)} under the following natural bijections
[TABLE]
It is easiest to construct the composition map by using the evaluation maps. Given objects and , the evaluation (or counit) map is defined as the -morphism that corresponds to the identity morphism in under the natural bijection
[TABLE]
Then, given objects , and , the composition is defined as the -morphism that corresponds to the composition
[TABLE]
under the natural bijection
[TABLE]
The natural question of whether is a closed category was left open in [APT18, Problem 2]. We show in Subsection 5.1 that this is indeed the case.
2.3. Tensor products in
In this subsection we recall the construction of tensor products of -semigroups as introduced in [APT18].
Definition \thedfnCt ([APT18, Definition 6.3.1]).
Let and be -semigroups, and let be a -bimorphism. We say that is a -bimorphism if it satisfies the following conditions:
- (1)
We have that , for every increasing sequences in and in . 2. (2)
If and satisfy and , then .
We denote the set of -bimorphisms by .
Given -semigroups and , we equip with pointwise order and addition, giving it the structure of a positively ordered monoid. Similarly, we consider the set of -morphisms between two -semigroups as a positively ordered monoid with the pointwise order and addition.
Theorem \thethmCt ([APT18, Theorem 6.3.3]).
Let and be -semigroups. Then there exists a -semigroup and a -bimorphism such that for every -semigroup the following universal properties hold:
- (1)
For every -bimorphism there exists a (unique) -morphism such that . 2. (2)
If are -morphisms, then if and only if .
Thus, for every , the assignment that sends a -morphism to the -bimorphism defines a natural bijection
[TABLE]
which respects the structure of the (bi)morphism sets as positively ordered monoids.
\thepgrCt**.**
Let and be -semigroups, and consider the universal -bimorphism from Subsection 2.3. Given and , we set . We call a simple tensor.
The tensor product in is functorial in each variable: If and are -morphisms, then there is a unique -morphism with the property that for every and .
Thus, the tensor product in defines a bifunctor . The -semigroup is a unit object, that is, for every -semigroup there are canonical isomorphisms and . Further, for every -semigroups , and , there are natural isomorphisms
[TABLE]
It follows that is a symmetric, monoidal category; see also [APT18, 6.3.7].
3. The Path Construction
In this section we introduce a functorial construction from a category of monoids with a transitive relation to the category . This construction, when restricted to the category introduced in Section 4 (a category that contains ) is a coreflection for the natural inclusion from .
Definition \thedfnCt.
A -semigroup is a pair , where is a commutative monoid and where is a transitive relation on , such that:
- (1)
We have for all . 2. (2)
If satisfy and , then .
We often denote a -semigroup simply by .
A -morphism is a monoid morphism that preserves the relation. Given -semigroups and , we denote the collection of all -morphisms by , or simply by . We let be the category whose objects are -semigroups and whose morphisms are -morphisms.
Remark \thermkCt.
Conditions (1) and (2) of Section 3 are the same as the conditions from Subsection 2.1 for an auxiliary relation to be additive.
Definition \thedfnCt.
Let be a set with an upward directed transitive relation . Let be a -semigroup. An -path (or simply a path) in is a map such that whenever satisfy . We set
[TABLE]
We define the sum of two paths and setting , for . Let denote the path given by , for .
We define a binary relation on by setting for two paths and if and only if for every there exists such that . Finally we antisymmetrize the relation by setting if and only if and .
Given and , we write if for all ; and we write provided for all .
The proof of the following result is straightforward and therefore omitted.
Lemma 3.1**.**
Let be a set with an upward directed transitive relation, and let be a -semigroup. Then the addition and the zero element defined in Section 3 give the structure of a commutative monoid. Moreover, the relation on is transitive, reflexive and satisfies:
- (1)
For every we have . 2. (2)
If satisfy and , then .
Further, is an equivalence relation on .
Definition \thedfnCt.
Let be a set with an upward directed transitive relation, and let be a -semigroup. Let be the equivalence relation on from Section 3. We define
[TABLE]
Given a path in , its equivalence class in is denoted by .
We define as the equivalence class of the zero-path. We define and on by setting , and by setting provided .
The following results follows immediately from Lemma 3.1.
Proposition \theprpCt.
Let be a set with an upward directed transitive relation, and let be a -semigroup. Then the addition, the zero element, and the order defined in Section 3 give the structure of a positively ordered monoid.
Remarks \thermksCt.
(1) We call the construction of the -construction or path construction. We call the path type.
(2) Given a -semigroup , the path construction depends heavily on the choice of . For instance, using the most simple case , we obtain
[TABLE]
For , one can show that is the (sequential) round ideal completion of as considered for instance in [APT18, Proposition 3.1.6].
We will not pursue this general constructions further. Rather, motivated by the results in Lemma 2.1 and Subsection 2.1, we will focus on the concrete case where the path type is taken to be \big{(}\mathbb{Q}\cap(0,1),<\big{)}.
Notation \thentnCt.
We set I_{\mathbb{Q}}:=\big{(}\mathbb{Q}\cap(0,1),<\big{)}. Given a -semigroup , we denote and by and , respectively. If we want to stress the auxiliary relation on , we also write and .
Thinking of as an ordered index set, we will often denote a path in as an indexed family .
Given a -semigroup , we show in Section 3 that is a -semigroup when equipped with the order and addition in Section 3. We split the proof into several lemmas. Recall from Section 3 that, given paths and in , and given , we write (respectively, ) if (respectively, ) for every .
Lemma 3.2**.**
Let be a -semigroup, let be a path in , and let satisfy . Then there exists a path in such that .
Proof.
Define by
[TABLE]
for . Then is a path satisfying , as desired. ∎
Lemma 3.3**.**
Let be a -semigroup. Given a sequence of paths in , and given a sequence in such that
[TABLE]
there exists a path in such that for all .
Proof.
Define as follows:
[TABLE]
It is easy to see that is a path and that , as desired. ∎
Lemma 3.4**.**
Let be a -semigroup, and let be an increasing sequence in . Then there exists a strictly increasing sequence in and a path in such that the following conditions hold:
- (1)
We have . 2. (2)
We have , whenever . 3. (3)
We have for all .
Moreover, if is a path in for which there exists a strictly increasing sequence in satisfying conditions (1), (2) and (3) above, then in . In particular, satisfies (O1).
Proof.
The proof is divided in two parts.
We inductively find and for such that:
- (a)
and , for all ; and
- (b)
, for all .
Set , and define the path by . Note that .
Assume we have chosen and for all . For each , using that , we choose such that . Let be the maximum of . Choose with . Using Lemma 3.2, we choose a path with .
Note that in particular we have the following relations:
[TABLE]
Applying Lemma 3.3, we choose with for all . Then it is easy to check that the sequence and the path satisfy conditions (1), (2) and (3).
For the second part, let be a strictly increasing sequence in , and let satisfy (1), (2) and (3). We show that in .
We first show that for each . Fix . To verify that , let be an element in . Use (1) to choose with and . Using that is a path at the first step, using condition (2) at the second step, and using (3) at the last step, we obtain that
[TABLE]
Hence , as desired.
Conversely, let satisfy for all . To show that , take . Choose such that . Since , there exists such that . Using this at the last step, using that is a path at the first step, and using condition (3) at the second step, we get
[TABLE]
This shows that , as desired. ∎
Definition \thedfnCt.
Let be a -semigroup, let , and let . We define by
[TABLE]
We will refer to as the -cut down of .
Remark \thermkCt.
It is easy to see that is a path in . If is a real number, we write for . Then, under the convention that , we have for all .
Lemma 3.5**.**
Let be a -semigroup, and let . Then in , for every with . Moreover, we have in . In particular, satisfies (O2).
Proof.
It is routine to check that . Given with , note that . Thus it is enough to show that for every .
Fix . To show that , let be an increasing sequence in with . By Lemma 3.4, there exists a path and an increasing sequence in such that , and such that for all .
Choose with . Since , there exists satisfying . Choose such that . Let us show that . For every , we have . Therefore, using that and are paths at the second and fourth step, respectively, and using that at the third step, we obtain that
[TABLE]
for every . This proves that , as desired. ∎
Theorem \thethmCt.
Let be a -semigroup. Then is a -semigroup.
Proof.
By Section 3, Lemma 3.4 and Lemma 3.5, is a positively ordered monoid that satisfies axioms (O1) and (O2). It remains to show that satisfies (O3) and (O4).
To verify (O3), let satisfy and . Using that , we can choose such that . Similarly we choose for . Set . We then have and . Using that at the third step, and using Lemma 3.5 at the fourth step, we deduce that
[TABLE]
which implies that , as desired.
To prove (O4), let and be two increasing sequences in . It is clear that . Let us prove the converse inequality.
By Lemma 3.4, there exist and increasing sequences and in such that and , and such that and for all . Given , choose with . Choose such that . We deduce that
[TABLE]
It follows that , as desired. This verifies (O4). ∎
The following result provides a useful criterion for compact containment in .
Lemma 3.6**.**
Let be a -semigroup, and let be elements in . Then in if and only if there exists such that .
Proof.
Assume that . Since , there exists such that . Let us show that has the desired properties, that is, . Given , there is with . Using that at the last step, we deduce that
[TABLE]
Conversely, suppose that there exists with . Then, for every with we have , as desired. ∎
Lemma 3.7**.**
Let and be -semigroups, and let be a -morphism. Then, for every , the map belongs to . Moreover, the induced map given by
[TABLE]
for , is a well-defined -morphism.
Proof.
Given , it is easy to see that belongs to . Moreover, given with we have . This shows that is well-defined and order-preserving. It is also easy to see that preserves addition and the the zero element.
To show that preserves the way-below relation, let satisfy in . By Lemma 3.6, there is with . Since is a -morphism, we obtain that . A second usage of Lemma 3.6 implies that , as desired.
To show that preserves suprema of increasing sequences, let be such a sequence in . By Lemma 3.4, there exist and a strictly increasing sequence in such that the following conditions are satisfied:
- (1)
We have . 2. (2)
We have , whenever . 3. (3)
We have for all .
Further, for every satisfying these conditions, we have .
To show that , we verify that the path and the sequence satisfy the analogs of the above conditions with respect to the sequence . Condition (1) is unchanged. To verify the analog of condition (2), let . Since is a -morphism, we have , as desired. The analog of (3) holds, since
[TABLE]
for every . Thus, the path satisfies conditions (1), (2) and (3) for the sequence , which implies that . Using this in the third step, we deduce that
[TABLE]
as desired. Altogether, we have that is a -morphism. ∎
Proposition \theprpCt.
The -construction defines a covariant functor by sending a -semigroup to the -semigroup (see Section 3), and by sending a -morphism to the -morphism (see Lemma 3.7).
Proof.
It follow easily from the construction that for every -semigroup . It is also straightforward to check that for every pair of composable -morphisms and . This shows that the -construction defines a covariant functor, as claimed. ∎
Although the -construction is a useful tool to derive -semigroups from such simple objects as -semigroups, the next example shows that without additional care the -construction may just produce a trivial object.
Example \theexaCt.
Consider with the usual structure as a monoid. We define on by setting if or . It is easy to check that is a -semigroup, and that the only path in is the constant path with value [math]. It follows that .
4. The category
The category introduced in the previous section, though useful in certain situations to construct -semigroups from semigroups with very little structure, is too general to provide a nice categorical relation from to . In this section we introduce a subcategory of , which we denote by , where can be embedded as a full subcategory, and in such a way that the restriction of the -construction from Section 3 defines a coreflection ; see Section 4.
Recall the definition of an additive auxiliary relation from Subsection 2.1.
Definition \thedfnCt.
A -semigroup is a positively ordered monoid together with an additive, auxiliary relation on such that the following conditions are satisfied:
- (O1)
Every increasing sequence in has a supremum in .
- (O4)
If and are increasing sequences in , then .
Given -semigroups and , a -morphism from to is a map that preserves addition, order, the zero element, the auxiliary relation and suprema of increasing sequences. We denote the set of -morphisms by . A generalized -morphism is a map that preserves addition, order, the zero element and suprema of increasing sequences. We denote the set of generalized -morphisms by .
We let be the category whose objects are -semigroups and whose morphisms are -morphisms.
Remarks \thermksCt.
(1) Axioms (O1) and (O4) in Section 4 are the same as in Subsection 2.1. A generalized -morphism is a -morphism if and only if it preserves the auxiliary relation. Moreover, generalized -morphisms are precisely the Scott continuous -morphisms. (See [GHK*+*03, Proposition II-2.1, p.157].)
(2) Let , be -semigroups. The sets and of (generalized) -morphism are positively ordered monoids, when equipped with the pointwise addition and order. It is easy to see that satisfies (O1) and (O4).
\thepgrCt**.**
We define a functor as follows: Given a -semigroup , the (sequential) way-below relation is an additive auxiliary relation on . It follows that is a -semigroup, and we let map to .
Further, given -semigroups and , a map is a -morphism if and only if is a -morphism. We let map a -morphism to itself, considered as a -morphism. This defines a functor from to .
Proposition \theprpCt.
The functor from Section 4 embeds as a full subcategory of .
Every -semigroup can be considered as a -semigroup by forgetting its partial order. Therefore, if is a -semigroup with auxiliary relation , then a path in is a map such that whenever satisfy ; see Section 3 and Section 3. Recall that denotes the set of paths in .
Definition \thedfnCt.
Let be a -semigroup, and let . We define the endpoint of , denoted by , as .
Proposition \theprpCt.
Let be a -semigroup, and let . Then:
- (1)
We have in . 2. (2)
If , then in . 3. (3)
If in , then . 4. (4)
If is an increasing sequence in and , then in .
Proof.
(1): This is a consequence of the fact that satisfies (O4).
(2): Given , using that , there is with . Taking the supremum over , we obtain that .
(3): Assuming , we use Lemma 3.6 to choose with . Then .
(4): Let be an increasing sequence in , and let . By (2), the endpoint of a path only depends on its equivalence class with respect to the relation from Section 3.
By Lemma 3.4, there are and an increasing sequence in such that and , and such that for all . Using that at the first step, and using the above property of at the fourth step we obtain that
[TABLE]
For each , we have and therefore by (2). It follows that , and therefore , as desired. ∎
By Section 4, the endpoint of a path only depends on the equivalence class in . Therefore, the following definition makes sense.
Definition \thedfnCt.
Let be a -semigroup. We define a map by
[TABLE]
for all . We refer to as the endpoint map.
Proposition \theprpCt.
Let be a -semigroup. Then the endpoint map is a well-defined -morphism (when considering as a -morphism via the inclusion functor from Section 4.)
Moreover, the endpoint map is natural in the sense that for every -morphism between -semigroups and . This means that the following diagram commutes:
[TABLE]
Proof.
It follows directly from Section 4 that is a well-defined -morphism. To show the commutativity of the diagram, let . Using that preserves suprema of increasing sequences at the second step, we deduce that
[TABLE]
as desired. ∎
Remark \thermkCt.
The naturality of the endpoint map as formulated in Section 4 means precisely that the -morphisms , for ranging over the objects in , form the components of a natural transformation from to the identity functor on .
In general, the endpoint map is neither surjective nor injective; see Examples 4 and 4. We now show that is an order-isomorphism if (and only if) is a -semigroup.
Proposition \theprpCt.
Let be a -semigroup, considered as a -semigroup . Then the endpoint map is an order-isomorphism.
Proof.
We first prove that is an order-embedding. Let satisfy . Then, by definition, . To show that , let . Choose with . We deduce that
[TABLE]
Therefore, there exists such that . Choose with . Then . This implies that and thus , as desired.
To show that is surjective, let . Choose a -increasing chain as in Subsection 2.1. In particular, we have , and whenever satisfy . Thus, if we define by , for , then belongs to . By construction, , as desired. ∎
Given -semigroups and , recall that we equip the set of -morphisms with pointwise order and addition; see Section 4.
Proposition \theprpCt.
Let be a -semigroup, let be a -semigroup, and let be the endpoint map from Section 4. Then:
- (1)
For every -morphism there exists a -morphism such that . 2. (2)
We have if and only if , for any pair of -morphisms .
Statement (1) means that for every one can find making the following diagram commute:
[TABLE]
Proof.
To show (1), let be given. Since is a -semigroup, it follows from Section 4 that is an order-isomorphism. Set , which is clearly a -morphism. By Section 4, we have . It follows that . The maps are shown in the following diagram:
[TABLE]
To show (2), let be -morphisms. It is clear that implies that . Thus let us assume that .
To show that , let . Using that satisfies (O2), choose a -increasing sequence in with supremum . Fix , and choose paths with , and , and . Since preserves the way-below relation, we have in . By Lemma 3.6, we can choose such that for all . Passing to the supremum over , we obtain that . Using this at the last step, and using the assumption that at the second step, we deduce that
[TABLE]
for every . By definition, we have that , and hence .
Using that preserves suprema of increasing sequences at the second step, and using the above observation for each at the last step, we deduce that
[TABLE]
as desired. ∎
Theorem \thethmCt.
The category is a coreflective, full subcategory of ; the functor is a right adjoint to the inclusion functor from Section 4.
More precisely, let be a -semigroup, let be the endpoint map from Section 4, and let be a -semigroup. Then the assignment that sends a -morphism to the -morphism defines a natural bijection
[TABLE]
which respects the structure of the morphism sets as positively ordered monoids.
Proof.
Let us denote the assignment from the statement by . Then is well-defined since is a -morphism by Section 4. Statement (1) in Section 4 means exactly that is surjective. Further, statement (2) in Section 4 shows that is an order-embedding. Thus, is an order-isomorphism, and in particular bijective. This shows that is right adjoint to , as desired. ∎
We now consider examples of -semigroups and their associated endpoint maps. In Section 4 we introduce two important -semigroups that are obtained by using the -construction. We denote these -semigroups by and since they turn out to be the Cuntz semigroups of - and -factors, respectively; see Section 4.
Example \theexaCt.
Consider with as in Section 3. Then , which shows that the endpoint map need not be surjective.
Recall that, given a -semigroup and , we say that is soft if for every with we have , that is, there exists with ; see [APT18, Definition 5.3.1]. We denote the set of soft elements in by .
Example \theexaCt.
Consider , with its usual structure as a positively ordered monoid. We define two relations and on as follows: given we set if and only if and ; and we set if and only if . It is easy to check that and are -semigroups. We set
[TABLE]
Let us compute the precise structure of and . For the most part, the argument is the same in both cases, and we use to stand for either or . Recall that is the set of -increasing map . Given a path , we let denote the endpoint, that is, ; see Section 4.
Let . If , then , by Section 4 (2). Conversely, if , then it is easy to deduce that . In fact, it is clear that the equivalence class of a path only depends on its definition in , for some . Therefore, all eventually constant paths with the same endpoint are equivalent and they majorize any path with the same endpoint. Furthermore, two paths with equal endpoint which are not eventually constant are in fact equivalent.
Thus, for every there are exactly two equivalence classes of paths with endpoint : the classes and with and given by and , for . The endpoints [math] and are particular: The only path with endpoint [math] is the constant path with value [math].
The only difference between and appears now for paths with endpoint . There is no -increasing path that is (eventually) constant with value . Therefore, all paths in with endpoint are equivalent to given by . On the other hand, also contains the constant path with value . We obtain that
[TABLE]
Thus, and differ only in that contains an additional infinite element. It is easy to see that the natural map is an additive order-embedding. Hence, it suffices to describe order and addition in . We have for . Further, for we have if and only if ; and if and only if . We have .
It is straightforward to check that the addition in is given by
[TABLE]
for and . We have that .
Abusing notation, we use and to denote and in . Further, we use [math] to denote the classes of . Now, the compact elements in are [math] and for . The soft elements in are [math] and for . The additional element in is both soft and compact.
The endpoint map is not injective since it sends both and to , for every . Analogously, the endpoint map is not injective.
Proposition \theprpCt.
We have for every -factor ; and we have for every -factor .
Proof.
Let be a -factor , let denote its unique tracial state, and let denote the unique extension to a tracial weight on the stabilization. It is known that is isomorphic to , with the usual structure as a positively ordered monoid, via .
Recall that a countably generated interval in a positively ordered monoid is a nonempty, upward directed, order-hereditary subset that contains a countable cofinal subset. By [ABP11, Theorem 6.4], the Cuntz semigroup of a -unital -algebra with real rank zero can be computed as , the set of countably-generated intervals in .
Now, the countably generated intervals in are given as: ; and , for ; and . We obtain an order-isomorphism by mapping to , for , and by mapping to , for . Together, we obtain order-isomorphisms:
[TABLE]
For a -factor , the argument runs analogous to the -case, with the difference that contains infinite projections. We thus have , and therefore . ∎
Definition \thedfnCt.
Let and be -semigroups. We define a binary relation on the set of generalized -morphisms by setting if and only and for all with .
Proposition \theprpCt.
Let and be -semigroups. Then the relation on , as defined in Section 4, is an auxiliary relation. Moreover, is a -semigroup.
Proof.
Since addition and order in are defined pointwise, it is easy to verify that is a positively ordered monoid. Given an increasing sequence in , let be the pointwise supremum, that is, , for . Then clearly is a generalized -morphism and in . Thus, satisfies (O1). It is also clear that taking suprema is compatible with addition and hence also satisfies (O4).
Next, note that is an auxiliary relation on . It is also easy to verify that is additive. Therefore, is a -semigroup. ∎
Next, we define bimorphisms in the category analogous to the definition of -bimorphisms; see Subsection 2.3. Recall the definition of -bimorphisms from Subsection 2.1.
Definition \thedfnCt.
Let and be -semigroups, and let be a -bimorphism. We say that is a -bimorphism if it satisfies the following conditions:
- (1)
We have that , for every increasing sequences in and in . 2. (2)
If and satisfy and , then .
We denote the set of -bimorphisms by .
Given -semigroups and , we equip with pointwise order and addition, giving it the structure of a positively ordered monoid. Similarly, we consider the set of -morphisms between two -semigroups as a positively ordered monoid with the pointwise order and addition.
The proof of the following result follows straightforward from the definition of -bimorphisms and is therefore omitted.
Lemma 4.1**.**
Let and be -semigroups, and let be a -bimorphism. For each , define by . Then belongs to . Moreover, if satisfy , then .
Notation \thentnCt.
Let and be -semigroups, and let be a -bimorphism. Using Lemma 4.1 we may define a map by , for , which belongs to .
Theorem \thethmCt.
Let and be -semigroups. Then:
- (1)
For every -morphism there exists a -bimorphism such that . 2. (2)
If are -bimorphisms, then if and only if .
Thus, the assignment that sends a -bimorphism to the -morphism defines a natural bijection
[TABLE]
which respects the structure of the (bi)morphism sets as positively ordered monoids.
Proof.
To verify (1), let be a -morphism. Define by . It is straightforward to check that is a -bimorphism satisfying , as desired. Statement (2) is also easily verified. It follows that is an order-isomorphism, and hence a bijection. It is also clear that is additive and preserves the zero element. ∎
Lemma 4.2**.**
Let , and be -semigroups, and let be a (generalized) -morphism. Then the map given by , for , is a (generalized) -morphism.
Analogously, given -semigroups , and , and given a (generalized) -morphism , the map defined by , for , is a (generalized) -morphism.
Proof.
It is straightforward to check that and are generalized -morphisms. Assume that is a -morphism. To show that preserves the auxiliary relation, let satisfy . To show that , let satisfy . Since preserves the auxiliary relation, we have . Using that at the second step, we deduce that
[TABLE]
as desired. Analogously, one shows that preserves the auxiliary relation whenever does. ∎
\thepgrCt**.**
Let be a -semigroup. We let be the contravariant functor that sends a -semigroup to the -semigroup (see Section 4), and that sends a -morphism to the -morphism as in Lemma 4.2.
Analogously, we obtain a covariant functor for every -semigroup . Thus, we obtain a bifunctor
[TABLE]
5. Abstract bivariant Cuntz semigroups
In this section, we use the -construction developed in Sections 3 and 4 to prove that is a closed symmetric monoidal category.
5.1. Construction of abstract bivariant Cuntz semigroups
Recall the notion of a generalized -morphism (see Subsection 2.1), and that the set of generalized -morphisms is denoted by . We equip this set with pointwise order and addition, giving it a natural structure as a positively ordered monoid.
From Section 4, there is functor that embeds as a full subcategory of . This is given by considering a -semigroup as a -semigroup for the auxiliary relation .
In Section 4 we introduced an auxiliary relation on the set of generalized -morphisms, giving itself the structure of a -semigroup; see Section 4. Let us transfer this definition to the setting of -semigroups.
Definition \thedfnCt.
Let and be -semigroups. We define a binary relation on the set of generalized -morphisms by setting if and only for all with .
Remarks \thermksCt.
(1) The auxiliary relation on the set of generalized -morphisms was already considered in [APT18, 6.2.6]. It is easy to verify that, for , the relation as defined in Subsection 5.1 implies .
(2) Every -morphism is also a generalized -morphism, and we therefore consider as a subset of . For , we have if and only if is a -morphism.
It follows from Section 4 that is an auxiliary relation on and that is a -semigroup. We may therefore apply the -construction.
Definition \thedfnCt.
Let and be -semigroups. We define the internal hom from to as the -semigroup
[TABLE]
We call the bivariant -semigroup, or the abstract bivariant Cuntz semigroup of and .
Remark \thermkCt.
Recall that a path in is a map such that whenever satisfy . We often denote by and we denote the path by . By definition then, the elements of are equivalence classes of paths in the -semigroup .
\thepgrCt**.**
We now show that the internal-hom in is functorial in both variables: contravariant in the first and covariant in the second variable.
Let be a -semigroup. Considering as a -semigroup, we have a contravariant functor as in Section 4. Precomposing with the inclusion from Section 4 and postcomposing with the functor , we obtain a functor .
Given -semigroups and , and a -morphism , we use to denote the induced -morphism . Thus, if we consider as a -morphism and if we let denote the induced -morphism from Lemma 4.2, then is given as .
Analogously, given a -semigroup , we define the functor as the composition of the functors , the functor from Section 4 and .
Given -semigroups and , and a -morphism , we use to denote the induced -morphism . If we consider as a -morphism and if we let denote the induced -morphism from Lemma 4.2, then is given as .
Thus, the internal-hom in the category is a bifunctor
[TABLE]
Next, we transfer the concept of the endpoint map from Section 4 to the setting of bivariant -semigroups. To simplify notation, we write for , the endpoint map associated to the -semigroup . The next definition makes this precise.
Definition \thedfnCt.
Let and be -semigroups. We let be defined by
[TABLE]
for a path in and . We refer to as the endpoint map.
Lemma 5.1**.**
Let , and be -semigroups, and let be a -morphism. Let be the endpoint map from Subsection 5.1. Define by
[TABLE]
for and . Then is a -bimorphism.
Proof.
We write for . To show that is a generalized -morphism in the first variable, let . Since and are both additive and order preserving, we conclude that is additive and order preserving as well. To show that preserves suprema of increasing sequences, let be an increasing sequence in . Set . Since both and preserve suprema of increasing sequences, we obtain that
[TABLE]
in . Since the supremum of an increasing sequence in is the pointwise supremum, we get that , as desired.
For each , we have , which is an element in . Therefore, is a generalized -morphism in the second variable.
Lastly, to show that preserves the joint way-below relation, let and satisfy and . Since is a -morphism we have . Using that is a -morphism, it follows that . Therefore, applying the definition of the auxiliary relation at the second step, we obtain that
[TABLE]
as desired. ∎
We omit the straightforward proof of the following result.
Lemma 5.2**.**
Let and be -semigroups, and let be a map. Then is a -bimorphism if and only if , considered as a map between -semigroups, is a -bimorphism. Thus, we have a natural bijection
[TABLE]
which, moreover, respects the structure of the bimorphism sets as positively ordered monoids.
Lemma 5.3**.**
Let and be -semigroups. Then the assignment that sends a -morphism to the -bimorphism given in Lemma 5.1 defines a natural bijection
[TABLE]
which respects the structure of the (bi)morphism sets as positively ordered monoids.
Proof.
By definition, we have \mathrm{Cu}\big{(}S,\llbracket T,P\rrbracket\big{)}=\mathrm{Cu}\big{(}S,\tau(\mathcal{Q}[T,P])\big{)}. Further, we have natural bijections, respecting the structure as positively ordered monoids, using Section 4 at the first step, using Section 4 at the second step, and using Lemma 5.2 at the last step:
[TABLE]
It is straightforward to check that the composition of these bijections identifies a -morphism with the -bimorphism as defined in Lemma 5.1. ∎
Theorem \thethmCt.
Let and be -semigroups. Then there are natural bijections
[TABLE]
which respect the structure of the (bi)morphism sets as positively ordered monoids.
The first bijection is given by assigning to a -morphism the -bimorphism as in Lemma 5.1, that is, , for . The second bijection is given by assigning to a -morphism the -bimorphism , , for .
Proof.
The first bijection is obtained from Lemma 5.3. The second bijection follows from Subsection 2.3. It is also shown in these results that the bijections respect the structure of the (bi)morphism sets as positively ordered monoids. ∎
Let be a -semigroup. We consider the functor given by tensoring with . It follows from Subsection 5.1 that the functor is a right adjoint of . By definition, this shows that the monoidal category is closed, and we obtain the following result:
Theorem \thethmCt.
The category of abstract Cuntz semigroups is a closed, symmetric, monoidal category.
Every closed symmetric monoidal category is enriched over itself, as noted in Subsection 2.2. Given -semigroups and , the -semigroup plays the role of morphisms from to . First, we show that -morphisms correspond to compact elements in .
Proposition \theprpCt.
Let and be -semigroups. Then there is a natural bijection , between -morphisms and compact elements in . A -morphism is associated with the class in of the constant path with value . Conversely, given a compact element in represented by a path , then for close enough to the map is a -morphism and independent of .
Proof.
It is straightforward to verify that the described associations are well-defined and inverses of each other. Alternatively, note that for every -semigroup , there is a natural identification of with , by associating to a -morphism the compact element . Using this fact at the first step, using Subsection 5.1 at the second step, and using the isomorphism at the third step, we obtain that
[TABLE]
as desired. ∎
In particular, the identity -morphism naturally corresponds to a compact element in , also denoted by . Further, also naturally corresponds to a -morphism , which is the identity of for the enrichment of over itself.
Given -semigroups and , recall that the counit map, or evaluation map is the -morphism that corresponds to under the identification \mathrm{Cu}\big{(}\llbracket S,T\rrbracket,\llbracket S,T\rrbracket\big{)}\cong\mathrm{Cu}\big{(}\llbracket S,T\rrbracket\otimes S,T\big{)}.
Given -semigroups , and , consider the following -morphism:
[TABLE]
Under the identification \mathrm{Cu}\big{(}\llbracket T,P\rrbracket\otimes\llbracket S,T\rrbracket,\llbracket S,P\rrbracket\big{)}\cong\mathrm{Cu}\big{(}\llbracket T,P\rrbracket\otimes\llbracket S,T\rrbracket\otimes S,P\big{)}, the above -morphism corresponds to a -morphism
[TABLE]
that we will call the composition product. The composition product implements the composition of morphisms when viewing the category as enriched over itself. (See [APT18b] for further details.)
Remark \thermkCt.
The order of the product in -theory is reversed from the one used here for the category , that is, given -algebras and , the product in -theory is as a bilinear map
[TABLE]
see [Bla98, Section 18.1, p166] and [JT91, Before Lemma 2.2.9, p.73].
We have mainly two reasons for our choice of ordering for the composition product in the category : First, the composition product extends the usual composition of -morphisms and our choice is compatible with the standard notation for composition of maps. Second, our ordering agrees with that of the composition law of internal-homs in closed categories; see [Kel05, Section 1.6, p.15].
5.2. Examples
In this subsection, we compute several examples of bivariant -semigroups . We mostly consider the case that and are the Cuntz semigroups of the Jacelon-Razak algebra , of the Jiang-Su algebra , of a UHF-algebra of infinite type, or of the Cuntz algebra .
Recall that denotes the semigroup with the usual order and addition. It is known that , the Cuntz semigroup of the Jacelon-Razak algebra introduced in [Jac13] (see [Rob13]). The product of real numbers extends to a natural product on giving the structure of a solid -semiring; see [APT18, Definition 7.1.5, Example 7.1.7].
Let be defined as in Section 4. By Section 4, is the Cuntz semigroup of a -factor .
Proposition \theprpCt.
There is a natural isomorphism .
Proof.
We show that the -semigroup is isomorphic to , where is the auxiliary relation defined in Section 4. Applying the -construction, and using the arguments in Section 4 at the last step, we then obtain
[TABLE]
Since is a solid -semiring, any generalized -morphism is -linear (see [APT18, Proposition 7.1.6]). Thus, we have for all . We may identify with by and this is easily seen to be an additive order-isomorphism. To conclude the argument, we need to show that under this identification, the auxiliary relation on corresponds to the auxiliary relation on as defined in Section 4.
Let . Clearly implies . Moreover, if , then , since while . Thus, implies . Conversely, assume that . By definition, is finite, and . To show that , let satisfy . Using that is finite at the second step, we deduce that
[TABLE]
We let be the disjoint union , with elements in being compact, and with elements in being soft. It is known that is isomorphic to the Cuntz semigroup of the Jiang-Su algebra introduced in [JS99] (see [PT07] and also [BT07]). To distinguish elements in both parts, we write (with a prime symbol) for the soft element of value . For example, the compact one, denoted , corresponds the class of the unit in ; and the soft one, denoted , corresponds to the class of a positive element in that has spectrum and with , for the unique trace on .
Order and addition are the usual inside the components and of . Given and , we have (the soft part is absorbing), and we have if and only , and we have if and only if .
We have a natural commutative product in , extending the natural products in the components and , and such that for every , and such that for and . Note that (the compact one) is a unit for this semiring, but is not. Indeed, we have . This gives the structure of a solid -semiring T(see [APT18, Section 7.3]).
Given a supernatural number satisfying , we let denote the set of nonnegative rational numbers whose denominators divide , with usual addition. Let , with elements in being compact, and with elements in being soft. Addition and order in is defined in analogy with . If denotes the UHF-algebra of type , then it is known that . Analogous to the case for , we can define a multiplication on , giving it the structure of a solid -semiring (see [APT18, Section 7.4]).
We exclude zero as a supernatural number. However, is supernatural number that agrees with its square. It is consistent to let denote the Cuntz semigroup of the Jiang-Su algebra . Thus, we set , which simplifies the statement of Subsection 5.2 below.
Given supernatural numbers and satisfying and , we have . In particular, . Moreover, if we let , then is isomorphic to the Cuntz semigroup of the universal UHF-algebra (whose -group is isomorphic to the rational numbers). We have .
Proposition \theprpCt.
Let and be supernatural numbers with and . If divides , then . If does not divide , then and .
Proof.
First, assume that divides . Then and . Let be a generalized -morphism. It follows from [APT18, Proposition 7.1.6] that is -linear. Thus, is determined by the image of the unit. Moreover, for every , there is a generalized -morphism with , given by for . Thus, there is a bijection given by identifying with . It is straightforward to check that under this identification, the relation on corresponds precisely to the way-below relation on . It follows that
[TABLE]
as desired.
Assume now that does not divide . Let be a prime number dividing but not . Every element of is divisible by arbitrary powers of .
On the other hand, we claim that only the soft elements of are divisible by arbitrary powers of . Indeed, every element of is either compact or nonzero and soft. Moreover, the sum of a nonzero soft element with any other element in is soft. It follows that if a compact element of is divisible in then it is also divisible in the monoid of compact elements of , which we identify with . However, since does not divide , the only element in that is divisible by arbitrary powers of is the zero element, which is soft.
It follows that every generalized -morphism has its image contained in the soft part of . In particular, if is a -morphism, then every compact element of is sent to zero by . Using that is simple, it follows that is the zero map. Thus, , as desired.
We identify with the soft part of , and similarly for . Let be a generalized -morphism. We have seen that belongs to . Moreover, for every there is a generalized -morphism with , given by for . Thus, there is a bijection given by identifying with . It is straightforward to check that under this identification, the relation on corresponds to the way-below relation on . As above, it follows that
[TABLE]
Example \theexaCt.
By Subsection 5.2, there are natural isomorphisms and . More generally, for every supernatural number with , there are natural isomorphisms and .
Example \theexaCt.
Let be a supernatural number with . Then there are natural isomorphisms and , which can be proved similarly as Propositions 5.2 and 5.2. In particular, we have and .
Given , we set , equipped with the natural order and addition as a subset of , with the convention that whenever in . With the obvious multiplication, is a solid -semiring (see, e.g. [APT18, Example 8.1.2]). Note that is the Cuntz semigroup of the Cuntz algebra (or of any other simple, purely infinite -algebra).
Proposition \theprpCt.
Let be natural numbers. Let denote the smallest natural number larger than or equal to . Then is isomorphic to the sub--semigroup of .
Proof.
Let be a generalized -morphism. Then is determined by the image of , which can be zero or any element such that . Thus, for every there is a unique generalized -morphism given by . Moreover, each such a map preserves the way-below relation and is therefore a -morphism. The desired result follows. ∎
Example \theexaCt.
There is a natural isomorphism , and more generally for every .
6. Applications to -algebras
Given -algebras and , a map is called completely positive contractive (abbreviated c.p.c.) if it is linear, contractive and for each the amplification to -matrices is positive. Every c.p.c. map induces a contractive, positive map .
Two elements and in a -algebra are called orthogonal, denoted , if . If and are self-adjoint, then if and only if . A c.p.c. map is said to have order-zero if for all we have that implies . We denote the set of c.p.c. order-zero maps by .
The concept of c.p.c. order-zero maps was studied by Winter and Zacharias, [WZ09], who also gave a useful structure theorem for such maps. We present their result in a slightly different way.
Theorem \thethmCt (Winter and Zacharias, [WZ09, Theorem 3.3]).
Let and be -algebras, and let be a c.p.c. order-zero map. Set , the sub--algebra of generated by the image of . Then there exists a unital ∗-homomorphism , from the minimal unitization of to the multiplier algebra of , such that
[TABLE]
for . In particular, the element is contractive, positive, it commutes with the image of , and for all .
This structure theorem has many interesting applications. For instance, it implies that c.p.c. order-zero maps induce generalized -morphisms. Let us recall some details. Let be a c.p.c. order-zero map. Then the amplification is a c.p.c. order-zero map as well; see [WZ09, Corollary 4.3]. Define by
[TABLE]
for . Then is a generalized -morphism; see [WZ09, Corollary 4.5] and [APT18, 2.2.7, 3.2.5]. We thus obtain a natural map
[TABLE]
Below, we will show that this map factors through .
\thepgrCt**.**
The theorem of Winter and Zacharias also allows us to define functional calculus for order-zero maps: Let be a c.p.c. order-zero map. Choose , and as in Section 6. Given a continuous function with , we define by for ; see [WZ09, Corollary 4.2].
In particular, this allows us to define ‘cut-downs’ of c.p.c. order-zero maps: Given , we may apply the function to . To simplify notation, we set . Thus, for we have .
Theorem \thethmCt.
Let and be -algebras, and let be a c.p.c. order-zero map. For each , let be the generalized -morphism induced by the c.p.c. order-zero map . Then is a path in . Moreover, the endpoint of is , the generalized -morphism induced by .
Proof.
We have already observed that every is a generalized -morphism. To verify that is a path, we need to show that for . Since , it is enough to show the following:
Claim: We have . To show the claim, let such that in . Recall that two positive elements and in a -algebra satisfy if and only if there exists with . Thus, we can choose such that . Note that if and are commuting positive elements in a -algebra, then . Using this at the last step, we deduce that
[TABLE]
which implies that
[TABLE]
as desired. This proves the claim and shows that is a path.
Let be the generalized -morphism induced by . To show that the endpoint of is , let . We have
[TABLE]
This implies that in , as desired. ∎
Definition \thedfnCt.
Let and be -algebras, and let be a c.p.c. order-zero map. We let be the element in that is the class of the path as constructed in Section 6.
Remark \thermkCt.
Let be a ∗-homomorphism. In the definition of the functor we denoted as the -morphism given by for .
On the other hand, in Section 6 we defined as the class of the path as constructed in Section 6. Given , it is easy to verify that . It follows that for . Thus, the path is constant with value .
We identify a -morphism with the compact element in given by the constant path with value ; see Subsection 5.1. It follows that the notation for a ∗-homomorphism is unambiguous.
\thepgrCt**.**
The functor defines a map
[TABLE]
By Section 6 we obtain a well-defined map
[TABLE]
As noticed in Section 6, these assignemnts are compatible, which means that the following diagram commutes:
[TABLE]
Problem \thepbmCt.
Study the properties of the map . In particular, when is this map surjective?
Example \theexaCt.
Recall that denotes the Jacelon-Razak algebra. We know that . By Subsection 5.2, we have , and recall that . We claim that the map
[TABLE]
is surjective.
The idea is to choose a unital, simple, AF-algebra with unique tracial state and a suitable element and consider the map , given by , followed by a ∗-isomorphism .
Let be a unital, simple AF-algebra with unique tracial state. We claim that . By construction, is an inductive limit of the building blocks considered by Razak in [Raz02]. Since is an AF-algebra, is an inductive limit of Razak building blocks as well. Since is simple and has a unique tracial state, and have the same invariant used for the classification [Raz02, Theorem 1.1], which gives the desired ∗-isomorphism .
Given , let us define a c.p.c. order-zero map corresponding to . We distinguish two cases:
Case 1: Assume that is nonzero and soft. Let denote the universal UHF-algebra. We have . We consider as a soft element in . Choose with Cuntz class . (For example, let be a positive element with spectrum - ensuring that its Cuntz class is soft - and such that for the unique normalized extended trace we have .)
Consider the map given by for . It is easy to see that is a c.p.c. order-zero map. Let be an isomorphism. Then is a c.p.c. order-zero map with the desired properties.
Case 2: Assume that is compact. We claim that there exists a unital, simple AF-algebra with unique normalized trace and a projection with . Indeed, if is rational, then we can take . If is irrational, then we use that is a dimension group for the order and addition inherited as a subgroup of . Moreover, has a unique normalized state. It follows that there is a unique unital AF-algebra such that is isomorphic to . By construction, there exists a projection with .
Define by for . Then is a ∗-homomorphism. Postcomposing with a ∗-isomorphism , we obtain a ∗-homomorphism with the desired properties.
Example \theexaCt.
With similar methods as in Section 6, one can show that the map is surjective whenever and are any of the following -algebras: a UHF-algebra of infinite type, the Jiang-Su algebra, the Jacelon-Razak algebra .
Remark \thermkCt.
In [BTZ16, Definition 2.27], Bosa, Tornetta and Zacharias introduced a bivariant Cuntz semigroup, denoted , as suitable equivalence classes of c.p.c. order-zero maps . It would be interesting to study if the map from Section 6 factors through , that is, if the following diagram can be completed to be commutative:
[TABLE]
Observe that, in order for this to be satisfied, one needs to show that, given and in such that in the sense of [BTZ16] then, for , there is such that .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[ABP 11] R. Antoine , J. Bosa , and F. Perera , Completions of monoids with applications to the Cuntz semigroup, Internat. J. Math. 22 (2011), 837–861. MR 2812090 (2012 d:46146) . Zbl 1239.46042 .
- 2[ADPS 14] R. Antoine , M. Dadarlat , F. Perera , and L. Santiago , Recovering the Elliott invariant from the Cuntz semigroup, Trans. Amer. Math. Soc. 366 (2014), 2907–2922. MR 3180735 . Zbl 06303118 .
- 3[APT 18] R. Antoine , F. Perera , and H. Thiel , Tensor products and regularity properties of Cuntz semigroups, Mem. Amer. Math. Soc. 251 (2018), viii+191. MR 3756921 .
- 4[APT 18b] R. Antoine , F. Perera , and H. Thiel , Abstract bivariant Cuntz semigroups II, preprint, (2018).
- 5[APT 18c] R. Antoine , F. Perera , and H. Thiel , Cuntz semigroups of ultraproduct C ∗ superscript 𝐶 C^{*} -algebras, in preparation, 2018.
- 6[Bla 98] B. Blackadar , K 𝐾 K -theory for operator algebras , second ed., Mathematical Sciences Research Institute Publications 5 , Cambridge University Press, Cambridge, 1998. MR 1656031 (99g:46104) . Zbl 0597.46072 .
- 7[BTZ 16] J. Bosa , G. Tornetta , and J. Zacharias , A bivariant theory for the cuntz semigroup, preprint (ar Xiv:1602.02043 [math.OA]), 2016.
- 8[BPT 08] N. P. Brown , F. Perera , and A. S. Toms , The Cuntz semigroup, the Elliott conjecture, and dimension functions on C ∗ superscript 𝐶 C^{*} -algebras, J. Reine Angew. Math. 621 (2008), 191–211. MR 2431254 (2010 a:46125) .
