arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.04524math.OA
收藏

一类泛$\mathrm{C}^\ast$ -代数的非单性

Nonsimplicity of certain universal $\mathrm{C}^\ast$-algebras

Marcel de Jeu, Rachid El Harti, Paulo R. Pinto

摘要:

给定$n\geq 2$,$z_{ij}\in\mathbb{T}$使得$z_{ij}=\overline z_{ji}$ for $1\leq i,j\leq n$,$z_{ii}=1$ for $1\leq i\leq n$,以及整数$p_1,...,p_n\geq 1$,我们证明了由酉$u_1,...,u_n$生成的泛$\mathrm{C}^*$ -代数使得$u_i^{p_i}u_j^{p_j}=z_{ij}u_j^{p_j}u_i^{p_i}$ for $1\leq i,j \leq n$不简单,如果至少有一个指数$p_i$至少为2.我们指出如何证明的方法,通过“工作与各种conquerents”可以用来建立非简单的通用$\mathrm{C}^*$ -代数在其他情况下。

英文摘要:

Given $n\geq 2$, $z_{ij}\in\mathbb{T}$ such that $z_{ij}=\overline z_{ji}$ for $1\leq i,j\leq n$ and $z_{ii}=1$ for $1\leq i\leq n$, and integers $p_1,...,p_n\geq 1$, we show that the universal $\mathrm{C}^*$-algebra generated by unitaries $u_1,...,u_n$ such that $u_i^{p_i}u_j^{p_j}=z_{ij}u_j^{p_j}u_i^{p_i}$ for $1\leq i,j \leq n$ is not simple if at least one exponent $p_i$ is at least two. We indicate how the method of proof by `working with various quotients' can be used to establish nonsimplicity of universal $\mathrm{C}^*$-algebras in other cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑