Noncommutative Harmonic Analysis and Quantum Information 255 The Kakeya conjecture is a classical theorem in dimension 2 [4], and more precisely Keich’s construction [8] of…
Statement
Noncommutative Harmonic Analysis and Quantum Information 255 The Kakeya conjecture is a classical theorem in dimension 2 [4], and more precisely Keich’s construction [8] of Besicovitch sets gives that c C \leq f2 (\delta) \leq | log \delta| | log \delta| In dimension 3, a solution has recently been given in a celebrated breakthrough by Wang and Zahl [17, Theorem 1.12]; in higher dimension it remains open. Connes rigidity conjecture and approximation properties. Given a dis- crete group Γ, its von Neumann algebra LΓ is the algebra of bounded convolution operators on ℓ2 (Γ). That is the set of all bounded linear P operators a : ℓ2 (Γ) \to ℓ2 (Γ) such that there is f : Γ \to C such that aξ(s) = t\inΓ f (t)ξ(t−1 s) for every (say finitely supported) ξ : Γ \to C. A particular case of Connes’ rigidity conjecture predicts that LPSLn (Z) and LPSLm (Z) are not isomorphic whenever n < m. It is wide open, except when n = 2 where at least two von Neumann algebras invari- ants distinguish rank 1 from higher rank: property (T) [3] and weak amenability [5, 7, 2]. In ancient works with Vincent Lafforgue [12] and Tim de Laat [10], I had proven that if | p1 − 21 | > 2d 1 , then the non-commutative Lp space of LPSL2d−1 (Z) does not have the completely bounded approximation property. The condition on p was essential in the proofs. The question whether it is also essential for the statement is therefore natural. Its importance is that a positive answer would distinguish the von Neumann algebras LPSLn (Z) and LPSLm (Z) whenever |n − m| \geq 2, by the invariant of a von Neumann algebra M equal to the set of values of Noncommutative Harmonic Analysis and Quantum Information 255
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.