MathLabs

Kadison–Singer problem

Solved, 2013Analysis
Statement

Let D≅ℓ∞(N)\mathcal{D} \cong \ell^\infty(\mathbb{N}) be the maximal abelian C∗C^*-subalgebra of diagonal bounded linear operators inside the C∗C^*-algebra B(ℓ2(N))\mathcal{B}(\ell^2(\mathbb{N})) of all bounded linear operators on the separable Hilbert space ℓ2(N)\ell^2(\mathbb{N}). Does every pure state ρ\rho on D\mathcal{D} extend uniquely to a pure state on B(ℓ2(N))\mathcal{B}(\ell^2(\mathbb{N}))?

Solved in the affirmative in June 2013 by Adam W. Marcus, Daniel A. Spielman, and Nikhil Srivastava (published in Annals of Mathematics in 2015). Rather than working directly with ultrafilters and C∗C^*-algebras, they proved Nik Weaver's 2004 finite-dimensional discrepancy conjecture KS2\mathrm{KS}_2: if v1,…,vm∈Cdv_1, \dots, v_m \in \mathbb{C}^d satisfy ∑i=1mvivi∗=Id\sum_{i=1}^m v_i v_i^* = I_d and ∥vi∥2≤δ\|v_i\|^2 \le \delta for all ii, then {1,…,m}\{1, \dots, m\} can be partitioned into two sets S1,S2S_1, S_2 such that ∥∑i∈Sjvivi∗∥≤(1+2δ)22\left\|\sum_{i \in S_j} v_i v_i^*\right\| \le \frac{(1 + \sqrt{2\delta})^2}{2} for j=1,2j = 1, 2. They proved this bound by analyzing the largest roots of "mixed characteristic polynomials" using their method of interlacing families and multivariate real-stable polynomials.

References

  1. Richard V. Kadison, Isadore M. Singer (1959). Extensions of pure states · DOI:10.2307/2372748
  2. Adam W. Marcus, Daniel A. Spielman, Nikhil Srivastava (2015). Interlacing families II: Mixed characteristic polynomials and the Kadison–Singer problem · DOI:10.4007/annals.2015.182.1.8 · arXiv:1306.3969
  3. Nik Weaver (2004). The Kadison–Singer problem in discrepancy theory · DOI:10.1016/S0012-365X(03)00253-X