paper

On simplicity of Cuntz algebra and its generalizations

arXiv:2312.10362

Abstract

Cuntz algebra is the universal -algebra generated by two isometries satisfying . This is separable, simple, infinite -algebra containing a copy of any nuclear -algebra. The -algebra plays a central role in the modern theory of -algebras and appears in many substantial statements, including a formulation of the celebrated Uniform Coefficient Theorem (UCT). There are several extensions of this notion, including Cuntz algebra , Cuntz-Krieger algebra for a matrix , Cuntz-Pimsner algebra and its relaxation by Katsura for a -correspondence , and Cuntz-Nica-Pimsner algebra , for a product system . We give an overview of the construction of these classes of -algebras with a focus on conditions ensuring their simplicity, which is needed in the Elliott Classification Program, as it erature, except our discussion on the sufficient conditions for simplicity of the reduced Cuntz-Nica-Pimsner algebra , which is known to expertsstands now. The results we present are now part of the lit, but might happen to be new for some of our audiences.

This is a survey