A Walk From Free Probability to Matrix Discrepancy III: Higher Rank Kadison-Singer and Spectrally Thin Trees
The paper proves that positive semidefinite matrices can be decomposed into signs with low discrepancy, even when their dimension and number are unknown.
This paper provides a stronger result than previous work, with a deterministic algorithm and no computational assumptions.
Before reading this…
Applications
- →Spectral thinning of spanning trees
- →Fractional colorings of incidence matrices
To understand this paper, make sure you know these concepts first:
- Linear algebrafind papers →
- Matrix theoryfind papers →
Abstract
More Like ThisLet $A_1,\ldots,A_N$ be positive semidefinite matrices of rank at most $r$, with $\sum_iA_i=I$ and $\|A_i\|\le\varepsilon$. We prove that the original matrices admit signs with discrepancy $O(\sqrt\varepsilon\log(2r))$, independently of their dimension and number which is a significantly stronger result than what was known existentially. We give a deterministic algorithm with polynomial real-arithmetic work, and a separate existence proof requiring no computational assumptions. This extends our companion paper on rank-one Kadison--Singer discrepancy. A concave matrix power interpolates between the trace source, which pays a factor $r$, and the sandwich source, whose density response is harder to control. We prove that source concavity controls this additional response in the same inverse-Sylvester metric as the optimized spectral potential. As an application, a single spanning tree can be chosen simultaneously $O(\varepsilon\log^2(2s))$-spectrally thin for $s$ positive edge weightings of a common graph, provided every edge has leverage at most $\varepsilon$ in every weighting. The reduction preserves one common selection decision per edge. For incidence matrices with at most $t$ ones in every row and column, the diagonal specialization gives a deterministic walk on fractional colorings with discrepancy $O(\sqrt t\log(2t))$. The local-walk mechanism gives both existence and an efficient construction without using the Lovász local lemma. A Lean formalization of our existence proof has been completed and will be released shortly.