English

Four Deviations Suffice for Rank 1 Matrices

Combinatorics 2020-08-05 v4 Discrete Mathematics Functional Analysis

Abstract

We prove a matrix discrepancy bound that strengthens the famous Kadison-Singer result of Marcus, Spielman, and Srivastava. Consider any independent scalar random variables ξ1,,ξn\xi_1, \ldots, \xi_n with finite support, e.g. {±1}\{ \pm 1 \} or {0,1}\{ 0,1 \}-valued random variables, or some combination thereof. Let u1,,unCmu_1, \dots, u_n \in \mathbb{C}^m and σ2=i=1nVar[ξi](uiui)2. \sigma^2 = \left\| \sum_{i=1}^n \text{Var}[ \xi_i ] (u_i u_i^{*})^2 \right\|. Then there exists a choice of outcomes ε1,,εn\varepsilon_1,\ldots,\varepsilon_n in the support of ξ1,,ξn\xi_1, \ldots, \xi_n s.t. i=1nE[ξi]uiuii=1nεiuiui4σ. \left \|\sum_{i=1}^n \mathbb{E} [ \xi_i] u_i u_i^* - \sum_{i=1}^n \varepsilon_i u_i u_i^* \right \| \leq 4 \sigma. A simple consequence of our result is an improvement of a Lyapunov-type theorem of Akemann and Weaver.

Keywords

Cite

@article{arxiv.1901.06731,
  title  = {Four Deviations Suffice for Rank 1 Matrices},
  author = {Rasmus Kyng and Kyle Luh and Zhao Song},
  journal= {arXiv preprint arXiv:1901.06731},
  year   = {2020}
}

Comments

Typo in Appendix corrected. To appear in Advances in Mathematics

R2 v1 2026-06-23T07:17:05.058Z