Four Deviations Suffice for Rank 1 Matrices

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 with finite support, e.g. \ 1 \ or \ 0,1 \-valued random variables, or some combination thereof. Let u1, …, un ∈ Cm and σ2 = \| Σi=1n Var[ i ] (ui ui*)2 \|. Then there exists a choice of outcomes 1,…,n in the support of 1, …, n s.t. \|Σi=1n E [ i] ui ui* - Σi=1n i ui ui* \| ≤ 4 σ. A simple consequence of our result is an improvement of a Lyapunov-type theorem of Akemann and Weaver.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…