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ξ_1, \ldots, ξ_n with finite support, e.g. {±1}\{ \pm 1 \} or {0,1}\{ 0,1 \}-valued random variables, or some combination thereof. Let u1,…,un∈Cmu_1, \dots, u_n \in \mathbb{C}^m and σ2=∥∑i=1nVar[ξi](uiui∗)2∥. σ^2 = \left\| \sum_{i=1}^n \text{Var}[ ξ_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ξ_1, \ldots, ξ_n s.t. ∥∑i=1nE[ξi]uiui∗−∑i=1nεiuiui∗∥≤4σ. \left \|\sum_{i=1}^n \mathbb{E} [ ξ_i] u_i u_i^* - \sum_{i=1}^n \varepsilon_i u_i u_i^* \right \| \leq 4 σ. A simple consequence of our result is an improvement of a Lyapunov-type theorem of Akemann and Weaver.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.