A logarithmic-radius cube has Gaussian measure at least one half
ProvedKomlos.gaussian_cube_half_measurediscrepancygaussian-measureprobability
For every integer , let be standard Gaussian probability measure on . Then the closed coordinate cube of radius satisfies
The assertion includes dimension zero, where the coordinate condition is vacuous and the Gaussian measure is one. This quantitative Gaussian estimate supplies the measure hypothesis when Banaszczyk’s convex-body balancing theorem is applied to a cube.
Preamble
import Definitions.Def_Komlos_model import Mathlib.Probability.Distributions.Gaussian.Multivariate open MeasureTheory ProbabilityTheory Set open scoped BigOperators
Formal statement
namespace Komlos
theorem gaussian_cube_half_measure (m : ℕ) :
(1/2 : ℝ) ≤ (stdGaussian (EuclideanSpace ℝ (Fin m))).real
{x | ∀ j, |x j| ≤ 2 * Real.sqrt (Real.log ((m:ℝ)+2))} := by sorry
end Komlos
Source
Quantitative version of the cube Gaussian-measure observation on p. 3 after Theorem 1.1 of Dadush–Garg–Lovett–Nikolov, Theory of Computing 15(15), 2019, https://theoryofcomputing.org/articles/v015a015/v015a015.pdf . The explicit radius 2 sqrt(log(m+2)) is certified in the accompanying Gaussian-tail and union-bound proof.