中文

关于因子的遍历嵌入

算子代数 2020-10-28 v3

摘要

冯·诺依曼因子包含 M\CalMM \subset \Cal M 若满足不可约条件 M\CalM=CM'\cap \Cal M=\Bbb C,则称其为{\it 遍历的}。我们研究这一性质与若干更强的遍历性性质之间的关系,例如 RR-{\it 遍历性},它要求 MM 容许超有限 II1_1 因子 RMR\hookrightarrow M 的一个在 \CalM\Cal M 中遍历的嵌入。我们证明,若 MM 是{\it 连续的}(即非 I 型)且包含 \CalM\Cal M 的一个极大交换 ^*-子代数,则 M\CalMM\subset \Cal MRR-遍历的。这特别地表明,任意连续因子都包含一个 RR 的遍历副本。

关键词

引用

@article{arxiv.1910.06923,
  title  = {On ergodic embeddings of factors},
  author = {Sorin Popa},
  journal= {arXiv preprint arXiv:1910.06923},
  year   = {2020}
}

备注

July 2020: Updated to take into account the recent Das-Peterson double-ergodicity theorem for II1 factors (see 2nd part of Theorem 1.1 and comments around Problem 7.4). Paper dedicated to the memory of Dick Kadison, to appear in Communications Math Physics