Zygmund’s Fourier restriction theorem and Bernstein’s inequality

Jordan Bell
February 13, 2015

1 Zygmund’s restriction theorem

Write 𝕋d=d/d. Write λd for the Haar measure on 𝕋d for which λd(𝕋d)=1. For ξd, we define eξ:𝕋dS1 by

eξ(x)=e2πiξx,x𝕋d.

For fL1(𝕋d), we define its Fourier transform f^:d by

f^(ξ)=𝕋dfeξ¯𝑑λd=𝕋df(x)e-2πiξx𝑑x,ξd.

For xd, we write |x|=|x|2=x12++xd2, |x|1=|x1|++|xd|, and |x|=max{|xj|:1jd}.

For 1p<, we write

fp=(𝕋d|f(x)|p𝑑x)1/p.

For 1pq, fpfq.

Parseval’s identity tells us that for fL2(𝕋d),

f^2=(ξd|f^(ξ)|2)1/2=f2,

and the Hausdorff-Young inequality tells us that for 1p2 and fLp(𝕋d),

f^q=(ξd|f^(ξ)|q)1/qfp,

where 1p+1q=1; f^=supξd|f^(ξ)|.

Zygmund’s theorem is the following.11 1 Mark A. Pinsky, Introduction to Fourier Analysis and Wavelets, p. 236, Theorem 4.3.11.

Theorem 1 (Zygmund’s theorem).

For fL4/3(T2) and r>0,

(|ξ|=r|f^(ξ)|2)1/251/4f4/3. (1)
Proof.

Suppose that

S=(|ξ|=r|f^(ξ)|2)1/2>0.

For ξ2, we define

cξ=f^(ξ)¯Sχ|ζ|=r.

Then

|ξ|=r|cξ|2=|ξ|=r|f^(ξ)|2|S|2=1. (2)

We have

S2 =|ξ|=r|f^(ξ)|2
=|ξ|=rf^(ξ)f^(ξ)¯
=(|ξ|=rf^(ξ)cξ)S,

hence, defining c:𝕋2 by

c(x)=ξdcξe2πiξx=|ξ|=rcξe2πiξx,x𝕋2,

we have, applying Parseval’s identity,

S=|ξ|=rf^(ξ)cξ=𝕋2f(x)c(x)¯𝑑x.

For p=43, let 1p+1q=1, i.e. q=4. Hölder’s inequality tells us

𝕋2|f(x)c(x)¯|𝑑xf4/3c4.

For ρ2, we define

γρ=μ-ν=ρcμcν¯.

Then define Γ(x)=|c(x)|2, which satisfies

Γ(x)=c(x)c(x)¯=ξ2ζ2cξcζ¯e2πi(ξ-ζ)x=ρ2γρe2πiρx.

Parseval’s identity tells us

c44=Γ22=ρ2|γρ|2.

First,

γ0=μ2cμcμ¯=μ2|cμ|2=1.

Second, suppose that ρ2,|ρ|=2r. If ρ/22, then γρ=cρ/2c-ρ/2¯, and if ρ/22 then γρ=0. It follows that

|ρ|=2r|γρ|2=|μ|=r|γ2μ|2=|μ|=r|cμ|2|c-μ|2. (3)

Third, suppose that ρ2,0<|ρ|<2r. Then, for

Cρ={μ2:|μ|=r,|μ-ρ|=|ρ|},

we have |Cρ|2. If |Cρ|=0 then γρ=0. If |Cρ|=1 and Cρ={μ}, then γρ=cμcμ-ρ¯ and so |γρ|2=|cμ|2|cμ-ρ|2. If |Cρ|=2 and Cρ={μ,m}, then γρ=cμcμ-ρ¯+cmcm-ρ¯ and so

|γρ|22|cμ|2|cμ-ρ|2+2|cm|2|cm-ρ|2.

It follows that

0<|ρ|<2r|γρ|24|μ|=r,|ν|=r,0<|μ-ν|<2r|cμ|2|cν|2.

Using (3) and then (2),

0<|ρ|2r|γρ|2 4|μ|=r,|ν|=r,0<|μ-ν|<2r|cμ|2|cν|2+|μ|=r|cμ|2|c-μ|2
4|μ|=r,|ν|=r,0<|μ-ν|<2r|cμ|2|cν|2+4|μ|=r|cμ|2|c-μ|2
4|μ|=r,|ν|=r|cμ|2|cν|2
=4(|μ|=r|cμ|2)2
=4.

Fourth, if ρ2,|ρ|>2r then γρ=0. Putting the above together, we have

ρ2|γρ|21+4=5.

Hence c445, and therefore

|S|=|𝕋2f(x)c(x)¯𝑑x|𝕋2|f(x)c(x)¯|𝑑xf4/3c4f4/351/4,

proving the claim. ∎

2 Tensor products of functions

For f1:X1 and f2:X2, we define f1f2:X1×X2 by

f1f2(x1,x2)=f1(x1)f2(x2),(x1,x2)X1×X2.

For f1L1(𝕋d1) and f2L1(𝕋d2), it follows from Fubini’s theorem that f1f2L1(𝕋d1+d2).

For ξ1d1 and ξ2d2, Fubini’s theorem gives us

f1f2^(ξ1,ξ2) =𝕋d1+d2f1f2(x1,x2)e-2πi(ξ1,ξ2)(x1,x2)𝑑λd1+d2(x1,x2)
=𝕋d1(𝕋d2f1f2(x1,x2)e-2πi(ξ1,ξ2)(x1,x2)𝑑λd2(x2))𝑑λd1(x1)
=𝕋d1f1(x1)e-2πiξ1x1(𝕋d2f2(x2)e-2πiξ2x2𝑑λd2(x2))𝑑λd1(x1)
=f1^(ξ1)f2^(ξ2)
=f1^f2^(ξ1,ξ2),

showing that the Fourier transform of a tensor product is the tensor product of the Fourier transforms.

3 Approximate identities and Bernstein’s inequality for 𝕋

An approximate identity is a sequence kN in L(𝕋d) such that (i) supNkN1<, (ii) for each N,

𝕋dkN(x)𝑑λd(x)=1,

and (iii) for each 0<δ<12,

limnδx1-δ|kN(x)|𝑑λd(x)=0.

Suppose that kN is an approximate identity. It is a fact that if fC(𝕋d) then kN*ff in C(𝕋d), if 1p< and fLp(𝕋d) then kN*ff in Lp(𝕋d), and if μ is a complex Borel measure on 𝕋d then kN*μ weak-* converges to μ.22 2 Camil Muscalu and Wilhelm Schlag, Classical and Multilinear Harmonic Analysis, volume I, p. 10, Proposition 1.5. (The Riesz representation theorem tells us that the Banach space (𝕋d)=rca(𝕋d) of complex Borel measures on 𝕋d, with the total variation norm, is the dual space of the Banach space C(𝕋d).)

A trigonometric polynomial is a function P:𝕋d of the form

P(x)=ξdaξe2πiξx,x𝕋d

for which there is some N0 such that aξ=0 whenever |ξ|>N. We say that P has degree N; thus, if P is a trigonometric polynomial of degree N then P is a trigonometric polynomial of degree M for each MN.

For fL1(𝕋), we define SNfC(𝕋) by

(SNf)(x)=|j|Nf^(j)e2πijx,x𝕋.

We define the Dirichlet kernel DN:𝕋 by

DN(x)=|j|Ne2πijx,x𝕋,

which satisfies, for fL1(𝕋),

DN*f=SNf.

We define the Fejér kernel FNC(𝕋) by

FN=1N+1n=0NDn,

We can write the Fejér kernel as

FN(x)=|j|N(1-|j|N+1)e2πijx=jχ[-N,N](j)(1-|j|N+1)e2πijx,

where χA is the indicator function of the set A. It is straightforward to prove that FN is an approximate identity.

We define the d-dimensional Fejér kernel FN,dC(𝕋d) by

FN,d=FNFNd.

We can write FN,d as

FN,d(x)=|ξ|N(1-|ξ1|N+1)(1-|ξd|N+1)e2πiξx,x𝕋d.

Using the fact that FN is an approximate identity on 𝕋, one proves that FN,d is an approximate identity on 𝕋d.

The following is Bernstein’s inequality for T.

Theorem 2 (Bernstein’s inequality).

If P is a trigonometric polynomial of degree N, then

P4πNP.
Proof.

Define

Q=((e-NP)*FN-1)eN-((eNP)*FN-1)e-N.

The Fourier transform of the first term on the right-hand side is, for j,

(e-NP*FN-1^)*eN^(j) =ke-NP^(j-k)FN-1^(j-k)eN^(k)
=e-NP^(j-N)FN-1^(j-N)
=P^(j)FN-1^(j-N),

and the Fourier transform of the second term is

P^(j)FN-1^(j+N).

Therefore, for j, using P^=χ[-N,N]P^,

Q^(j) =P^(j)(FN-1^(j-N)-FN-1^(j+N))
=P^(j)(χ[-N+1,N-1](j-N)(1-|j-N|N)-χ[-N+1,N-1](1-|j+N|N))
=P^(j)(χ[1,N](j)(1+j-NN)+χ[N,2N-1](j)(1-j-NN)
-χ[-2N+1,-N](j)(1+j+NN)-χ[-N,-1](j)(1-j+NN))
=P^(j)(χ[1,N](j)(1+j-NN)-χ[-N,-1](j)(1-j+NN))
=P^(j)(jNχ[1,N](j)+jNχ[-N,-1](j))
=jNP^(j).

On the other hand,

P^(j)=2πijP^(j),

so that

P=2πiNQ,

i.e.

P=2πiN(((e-NP)*FN-1)eN-((eNP)*FN-1)e-N).

Then, by Young’s inequality,

P =2πN((e-NP)*FN-1)eN-((eNP)*FN-1)e-N
2πN((e-NP)*FN-1)eN+2πN((eNP)*FN-1)e-N
=2πN(e-NP)*FN-1+2πN(eNP)*FN-1
2πNe-NPFN-11+2πNeNPFN-11
=4πNP.