On the Eldan-Gross inequality
Abstract
A recent discovery of Eldan and Gross states that there exists a universal C>0 such that for all Boolean functions f:\-1,1\n \-1,1\, ∫\-1,1\nsf(x)dμ(x) CVar(f) (1+1Σj=1nInfj(f)2) where sf(x) is the sensitivity of f at x, Var(f) is the variance of f, Infj(f) is the influence of f along the j-th variable, and μ is the uniform probability measure. In this note, we give an alternative proof that applies to biased discrete hypercube, and spaces having positive Ricci curvature lower bounds in the sense of Bakry and \'Emery.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.