On Average Distance, Level-1 Fourier Weight, and Chang's Lemma

In this paper, we improve the well-known level-1 weight bound, also known as Chang’s lemma, by using an induction method. Our bounds are close to optimal no matter when the set is large or small. Our bounds can be seen as bounds on the minimum average distance problem, since maximizing the level-1 weight is equivalent to minimizing the average distance. We apply our new bounds to improve the Friedgut–Kalai–Naor theorem. We also derive the sharp version for Chang’s original lemma for ${\mathbb{F}}_2^n$. That is, we show that in ${\mathbb{F}}_2^n$, Hamming balls maximize the dimension of the space spanned by large Fourier coefficients.