冠代数中可数饱和的障碍
Obstructions to countable saturation in corona algebras
摘要:
研究了交换C*-代数的冠的可数饱和度。特别地,我们证明了$C_0(\bbR^n)$的冠代数是可数饱和的当且仅当$n=1$。
英文摘要:
We study the extent of countable saturation for coronas of abelian C*-algebras. In particular, we show that the corona algebra of $C_0(\bbR^n)$ is countably saturated if and only if $n=1$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。