Put
F=1A∗1A. Then
0≤F≤1,
EF=α2, and the
Parseval identity gives
Set d=⌊α2n/(8p2)⌋. If
d<2, the asserted
integer lower bound is trivial. Otherwise take
q=d and
ϵ=3α/(4p) in part
b. The resulting subspace
W has
codimW≤ϵ24d=9α264p2d≤98n.
Thus
dimW≥n/9>d, and
we may choose
a d-dimensional subspace
D≤W.
For
x∈D, part
b gives
∥τxF−F∥Lq≤ϵ∥F∥ℓ1=4p3α2. Apply the supplied maximal inequality to
g(x,y)=F(y+x)−F(y). Since
∣D∣1/q=p, it gives
Eysupx∈D∣F(y+x)−F(y)∣≤p4p3α2=43α2<EF.
Hence some
y satisfies
F(y)>supx∈D∣F(y+x)−F(y)∣, so
F(y+x)>0 for every
x∈D. Since
suppF=A+A, this proves
New to topics? Read the docs here!