4 Hypercontractivity

We begin with an important lemma of Bonami.

Lemma 4.1 (Bonami’s Lemma). Let f:{1,1}n be a function of degree k. Then f43k2f2.

This statement is natural: to have f4 much larger than f2, f must be ‘spiky’, because if it is roughly constant, then these norms are roughly the same; but if f is ‘spiky’, then we expect it to not be low degree polynomial.

Example. Consider f(0)=1, f(x)=0 otherwise. f2=2n2, f4=2n4. So f4 is much larger than f2 in this case, and indeed f is not a low degree polynomial.

Proof. Induction on n. n=1 is easy. Let f:{1,1}n. Then f=g+xnh where g(x)=Enf=12(f(xn1)+f(xn1)) and h(x)=Dnx=12(f(xn1)f(xn1)). Note also that g and xnh are orthogonal.

Recall that

xA={0nAxA{n}nA

Therefore, Dnf has degree at most k1. First,

f22=g22+xnh22=g22+h22.

Also,

f44=𝔼x(g(x)+xnh(x))4=𝔼x(g(x)4+4xng(x)3h(x)+6xn2g(x)2h(x)2+4xn3g(x)h(x)3+xn4h(x)4)=g44+6𝔼xg(x)2h(x)2+h44

The last line uses the fact that g, h don’t depend on xn and that xn=±1 with probability 12. Then

f44=g44+6𝔼xg(x)2h(x)2+h44g44+6g42h42+h44(by Cauchy-Schwarz)32kg24+63kg223k1h22+32(k1)h24(by inductive hypothesis)32k(g24+2g22h22+19h24)32k(g22+h22)232kf24

Corollary 4.2 (Anticoncentration of low-degree functions). Let f:{1,1}n have degree k and let 𝔼xf(x)=μ and Varf=σ2. Then

[|f(x)μ|>σ2]91632k.

Proof. Let g=fμ. Then 𝔼g=0 and g22=σ2. Let p=[|g(x)|>σ2]. Let A={x:|g(x)|σ2}, B=Ac. Then

σ2=g22(1p)σ24+p𝔼xBg(x)2.

Therefore,

p𝔼xBg(x)234σ2,

so

𝔼xBg(x)23σ24p.

By Cauchy-Schwarz (or Var(g(x)2)0) we have

𝔼xBg(x)49σ416p2,

so g449σ416p. But Bonami’s Lemma implies that g4432kg24=32kσ4. Therefore, p91632k, as stated.

In this lecture, we are aiming towards the earlier stated stability version of Arrow’s Theorem.

Lemma 4.3. Let g:{1,1}n be given by the formula g(x)=i=1naixi. Then

Varg2=2ijai2aj2.

Remark. Why should one care about studying Var(g(x)2)? Note that if g is a Boolean function, then g(x)21, so Var(g(x)2). So Var(g(x)2) can be used to measure “how close” a function is to being Boolean (or a multiple of a Boolean function).

Proof. 𝔼g2=iai2 by Parseval, so

(𝔼g2)2=iai4+ijai2aj2𝔼g4=i,j,k,laiajakal𝔼xxixjxkxl=iai4+3ijai2aj2

Note that 𝔼xxixjxkxl vanishes if any index appears an odd number of times, which is how we deduce the last equality above.

Subtracting the two above equations gives the result.

Lemma 4.4. Let g:{1,1}n, 1δg221, Varg2Cδ, g linear with no constant term. Then there exists i such that g^(i)21(2+C2)δ.

Proof. Let g(x)=iaixi. Then 1δiai21, 2ijai2aj2Cδ. Therefore,

iai4=(iai2)2ijai2aj212δC2δ=1(2+C2)δ.

Also,

iai4maxiai2(iai2)maxai2=maxg^(i)2.

Theorem 4.5 (Friedgut, Kalai, Naor). Let f:{1,1}n{1,1} be a function with W1(f)1δ. Then there exists i such that f^(i)21O(δ).

Proof. Let G be the degree-1 part of f, i.e. g=if^(i)xi. Then by hypothesis, 1δg22, and by Parseval g22g22=1. Let σ=Varg2. Note that g2 has degree at most 2. By the Anticoncentration of low-degree functions,

[|g2g22|>σ2]916181=19×16.

Since g22[1δ,1], it follows that

[|g21|>σ2δ]19×16.

Also, 1=f2. Therefore,

𝔼x|g(x)2f(x)2|19×16(σ2δ).

But

𝔼x|g(x)2f(x)2|=𝔼x|g(x)+f(x)||g(x)f(x)|f+g2fg22δ

by Cauchy-Schwarz. Therefore, σ2δ32×9δ, so σ64×9δ+2δ600δ, so σ2360000δ. By Lemma 4.4, there exists i such that g^(i)21180002δ=1O(δ). But g^(i)2=f^(i)2, so we are done.

Let p=[f(x)=xi]. Then f^(i)=𝔼f(x)xi=p(1p)=2p1. So if f^(i)=1O(δ), then p=O(δ) or 1p=O(δ). So f is well-approximated by xi or by xi.

This completes the proof of the stability version of Arrow’s Theorem.

Next time: T13f4f2.

Notation. Given f:{1,1}n, write f(=k) for the degree-k part of f, i.e. |A|=kf^(A)xA.

Theorem 4.6. Let ρ=13. Then Tρf4f2 for every f:{1,1}n.

Proof.

Tρf4=k=0nTrhof(=k)4=k=0nρkf(=k)4k=0nρkf(=k)4k=0nρk3k2f(=k)2(by Bonami’s Lemma)=k=0nf(=k)2n(k=0nf(=k)22)12=nf2(since the f(=k) are orthogonal)

To get rid of the n we use the tensor-power trick.

Write fm:({1,1}n)m for the function

fm(x1,,xm)=f(x1)f(xm).

It is easy to check that Tρfm4=Tρf4m and fm2=f2m. Therefore,

Tρf4m=Tρfm4mnfm2=mnf2m,

where the inequality is what we proved earlier.

So Tρf4(mn)12mf2 for every m. Letting m, we deduce that Tρf4f2.

Remark. The tensor trick here would have worked even if n was replaced by any subexponential function.

Corollary 4.7. Let ρ=13 and let f:{1,1}n. Then Tρf2f43.

Proof. Note that Tρ is self adjoint (see the example sheet, or note that it easily follows from Tρf^(A)=ρ|A|f^(A)). So

Tρf2=maxg2=1Tρf,g=maxg2=1f,Tρg(self-adjoint)maxh4=1f,h(by Theorem 4.6)=f43(since L43 is the dual of L4)

Remark. On the last = in the above proof, we could instead just say by Hölder.

Remark. Tρf22=Tρf,Tρf=Tρ2f,f=T13f,f=Stab13f.

So an equivalent formulation of Theorem 4.6 is that Stab13ff432.