The Komlós conjecture for complex discrepancy

RESUMO

The Komlós conjecture is a classic problem in discrepancy theory; it asks whether an absolute constant $K$ exists such that given any $n$ vectors $a_1,\ldots,a_n$ inside the $m$-dimensional Euclidean ball, regardless of how large $m,n$ are, there is always a selection of signs $\varepsilon_1,\ldots,\varepsilon_n$ guaranteeing $$\|\varepsilon_1a_1+\ldots+\varepsilon_na_n\|_\infty \leq K.$$ We show that if the $\varepsilon_i$'s are allowed to take not just the values of $\pm 1$ but any unit modulus complex number, which we refer to as complex discrepancy, then the above inequality holds for a finite, explicit constant $K_{\mathbb{C}}$. Here, the $\ell^\infty$ norm of the resulting vector in $\mathbb{C}^m$ is the largest modulus of its entries, and thus the complex discrepancy of real vectors is equivalent to their rank-$2$ vector discrepancy. This quantity provides an upper bound (modulo uniform constant prefactor) on Gaussian discrepancy -- a discrepancy measure introduced by Chewi, Gerber, Rigollet and Turner. Thus, we also resolve the Komlós conjecture for Gaussian discrepancy. Our paper builds upon the recent work of Bansal and Jiang on the Beck-Fiala and Komlós conjectures, which we approach from the formalism of Burkholder and the Bellman function method from probability and harmonic analysis. Our work was in part motivated by the realization that the complex discrepancy of the columns of any unitary matrix is equal to 1, a fact that follows from a straightforward calculation based on Idel and Wolf's generalization of the Sinkhorn normal form for unitary matrices.