Anderson's paving conjecture

About 12 years old · traced to

Let ε>0\varepsilon>0. For every n×nn\times n Hermitian matrix TT with zero diagonal, a diagonal projection is an orthogonal projection represented by a diagonal matrix. Anderson's paving conjecture. There exists an r∈Nr\in\mathbb{N} such that there are diagonal projections P1,⋯ ,PrP_{1},\cdots,P_{r} satisfying

∑i=1rPi=I\sum_{i=1}^{r}P_{i}=I

and

∥PiTPi∥≤ε∥T∥,for i=1,…,r.\left\Vert P_{i}TP_{i}\right\Vert \leq\varepsilon\left\Vert T\right\Vert,\quad\text{for }i=1,\ldots,r.

This is a matrix-paving formulation of the Kadison–Singer problem. The supplied text presents it as Anderson's original paving conjecture but does not state its resolution, so its database status remains open.

References

Primary source

Palle Jorgensen and Feng Tian, “Noncommutative analysis, Multivariable spectral theory for operators in Hilbert space, Probability, and Unitary Representations”, arXiv:1408.1164 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.