Analysis on simple Lie groups and lattices · 2022-ana-189
Functional Analysis · ICM 2022: Analysis on simple Lie groups and lattices
Problem statement
For every integer , prove that the group von Neumann algebras and are not isomorphic as von Neumann algebras, where, for a discrete group , denotes the weak-operator closure in of the linear span of the left regular representation of .
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Remaining questions in this record
Remaining questions recorded by the source
These are retained within the parent record and are not counted as additional index entries.
Question 1
Determine whether there exists an exponent such that the noncommutative -space has the operator space approximation property; that is, whether there is a net of finite-rank maps such that in norm for every , where is the algebra of compact operators on and is the weak-operator closure in of the linear span of the left regular representation of .
Source reference: Mikael de la Salle, Kakeya conjecture and High-Rank Lattice von Neumann algebras, arXiv preprint (2026), Question 1.1, arXiv:2602.14623, https://arxiv.org/abs/2602.14623.
Progress & source assessment
Source-reported assessment from the ICM catalogue snapshot. This is not an independent review by Frontier Science.
The problem is unresolved. Since has trivial center, it is , so the assertion is a subfamily of Connes' still-open rigidity problem asking whether the factors and can be isomorphic only when . No proof or counterexample covering any of the requested integers was found.
The strongest progress supplies a possible invariant but does not yet distinguish the factors. Vincent Lafforgue and Mikael de la Salle, Noncommutative -spaces without the completely bounded approximation property, Duke Mathematical Journal 160 (2011), 71-116, DOI 10.1215/00127094-1443478, prove that fails the operator space approximation property, and hence the completely bounded approximation property, for (and, by duality, for ). This gives no separation in those ranges because the corresponding high-rank factors also fail these properties there.
Tim de Laat and Mikael de la Salle, Approximation properties for noncommutative -spaces of high rank lattices and nonembeddability of expanders, Journal fuer die reine und angewandte Mathematik 737 (2018), 49-69, DOI 10.1515/crelle-2015-0043, prove increasingly strong failure of the completely bounded approximation property as the rank grows. In the formulation later compiled for , failure holds for . Thus every is covered for , whereas the established threshold for is only . A positive approximation result for at some would therefore settle the stated nonisomorphisms, but none is known.
Mikael de la Salle, Analysis on simple Lie groups and lattices, Proceedings of the International Congress of Mathematicians 2022, Volume 4 (EMS Press, 2023), 3166-3188, DOI 10.4171/ICM2022/160, explicitly presents this missing near- -multiplier regime as the obstacle to distinguishing from for .
The current gap is confirmed and sharpened by two recent sources. Javier Parcet, The impact of Schur multipliers in harmonic analysis and operator algebras, Proceedings of the International Congress of Mathematicians 2026, Volume 4 (2026), DOI 10.1137/25M1803371, Problem 3.3, still asks whether the relevant Fourier critical index is greater than . Mikael de la Salle, Kakeya conjecture and High-Rank Lattice von Neumann algebras, 2026, arXiv:2602.14623, Question 1.1 and Theorem 1.3, likewise leaves the noncommutative operator space approximation problem open and proves that a positive answer in rank would imply a Kakeya-type conjecture in dimension . These results underscore the difficulty but do not resolve the stated factor nonisomorphism.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.