×

zbMATH — the first resource for mathematics

Rigidity results for wreath product \(\mathrm{II}_1\) factors. (English) Zbl 1134.46041
Summary: We consider \(\text{II}_1\) factors of the form \(M=(\overline{\bigotimes}_G\, B)\rtimes G\), where either (i) \(B\) is a non-hyperfinite \(\text{II}_1\) factor and \(G\) is an ICC amenable group, or (ii) \(B\) is a weakly rigid \(\text{II}_1\) factor and \(G\) is an ICC group acting on \(\overline{\bigotimes}_G\, B\) by Bernoulli shifts. We prove that isomorphy of two such factors implies cocycle conjugacy of the corresponding Bernoulli shift actions. In particular, the groups acting must be isomorphic. As a consequence, we can distinguish between certain classes of group von Neumann algebras associated to wreath product groups.

MSC:
46L35 Classifications of \(C^*\)-algebras
PDF BibTeX XML Cite
Full Text: DOI arXiv
References:
[1] Cherix, P.; Martin, F.; Valette, A., Spaces with measured walls, Haagerup property and property (T), Ergodic theory dynam. systems, 24, 6, 1895-1908, (2004) · Zbl 1068.43007
[2] Connes, A., Classification of injective factors, Ann. of math. (2), 104, 73-115, (1976) · Zbl 0343.46042
[3] Connes, A., Sur la classification des facteurs de type II, C. R. acad. sci. Paris Sér. I math., 281, A13-A15, (1975)
[4] Connes, A.; Jones, V.F.R., Property (T) for von Neumann algebras, Bull. London math. soc., 17, 57-62, (1985) · Zbl 1190.46047
[5] Dykema, K., Interpolated free group factors, Duke math. J., 69, 97-119, (1993)
[6] Furman, A., On Popa’s cocycle superrigidity theorem · Zbl 1134.46043
[7] Hayashi, T., A note on rigidity for crossed product von Neumann algebras
[8] Herman, R.H.; R Jones, V.F., Central sequences in crossed products, (), 539-544
[9] Jones, V.F.R., Central sequences in crossed products of full factors, Duke math. J., 49, 1, 2933, (1982) · Zbl 0492.46049
[10] V.F.R. Jones, Notes on Connes’ invariant \(\chi(M)\), unpublished
[11] Ioana, A.; Peterson, J.; Popa, S., Amalgamated free products of w-rigid factors and calculation of their symmetry groups, Acta Math., in press · Zbl 1149.46047
[12] Murray, F.; von Neumann, J., Rings of operators IV, Ann. of math., 44, 716-808, (1943) · Zbl 0060.26903
[13] Neuhauser, M., Relative property (T) and related properties of wreath products, Math. Z., 251, 1, 167-177, (2005) · Zbl 1139.22002
[14] Ocneanu, A., Actions of discrete amenable groups on von Neumann algebras, Lecture notes in math., vol. 1138, (1985), Springer-Verlag Berlin · Zbl 0608.46035
[15] Ornstein, D.; Weiss, B., Ergodic theory of amenable groups. I. the rokhlin lemma, Bull. amer. math. soc. (N.S.), 1, 161-164, (1980) · Zbl 0427.28018
[16] Ozawa, N.; Popa, S., Some prime factorization results for type II_{1} factors, Invent. math., 156, 223-234, (2004) · Zbl 1060.46044
[17] Popa, S., Some rigidity results for non-commutative Bernoulli shifts, J. funct. anal., 230, 1-56, (2005)
[18] Popa, S., On a class of type II_{1} factors with Betti numbers invariants, Ann. of math. (2), 163, 809-899, (2006) · Zbl 1120.46045
[19] Popa, S., Strong rigidity of II_{1} factors arising from malleable actions of w-rigid groups I, Invent. math., 165, 369-408, (2006) · Zbl 1120.46043
[20] Popa, S., Strong rigidity of II_{1} factors arising from malleable actions of w-rigid groups II, Invent. math., 165, 409-461, (2006) · Zbl 1120.46044
[21] Popa, S., A unique decomposition result for HT factors with torsion free core, J. funct. anal., 239, (2006)
[22] Popa, S., Cocycle and orbit equivalence superrigidity for Bernoulli actions of Kazhdan groups, Invent. Math., in press
[23] Radulescu, F., Random matrices, amalgamated free products and subfactors of the von Neumann algebra of a free group, Invent. math., 115, 347-389, (1994) · Zbl 0861.46038
[24] Vaes, S., Asterisque, in press
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.