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ξ:𝕋d→S1 by

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

For f∈L1⁢(𝕋d), we define its Fourier transform f^:ℤd→ℂ by

f^⁢(ξ)=∫𝕋df⁢eξ¯⁢𝑑λd=∫𝕋df⁢(x)⁢e-2⁢π⁢i⁢ξ⋅x⁢𝑑x,ξ∈ℤd.

For x∈ℝd, we write |x|=|x|2=x12+⋯+xd2, |x|1=|x1|+⋯+|xd|, and |x|∞=max⁡{|xj|:1≤j≤d}.

For 1≤p<∞, we write

∥f∥p=(∫𝕋d|f⁢(x)|p⁢𝑑x)1/p.

For 1≤p≤q≤∞, ∥f∥p≤∥f∥q.

Parseval’s identity tells us that for f∈L2⁢(𝕋d),

∥f^∥ℓ2=(∑ξ∈ℤd|f^⁢(ξ)|2)1/2=∥f∥2,

and the Hausdorff-Young inequality tells us that for 1≤p≤2 and f∈Lp⁢(𝕋d),

∥f^∥ℓq=(∑ξ∈ℤd|f^⁢(ξ)|q)1/q≤∥f∥p,

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 f∈L4/3⁢(T2) and r>0,

(∑|ξ|=r|f^⁢(ξ)|2)1/2≤51/4⁢∥f∥4/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)¯|⁢𝑑x≤∥f∥4/3⁢∥c∥4.

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

∥c∥44=∥Γ∥22=∑ρ∈ℤ2|γρ|2.

First,

γ0=∑μ∈ℤ2cμ⁢cμ¯=∑μ∈ℤ2|cμ|2=1.

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

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

Third, suppose that ρ∈ℤ2,0<|ρ|<2⁢r. 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μ-ρ¯+cm⁢cm-ρ¯ and so

|γρ|2≤2⁢|cμ|2⁢|cμ-ρ|2+2⁢|cm|2⁢|cm-ρ|2.

It follows that

∑0<|ρ|<2⁢r|γρ|2≤4⁢∑|μ|=r,|ν|=r,0<|μ-ν|<2⁢r|cμ|2⁢|cν|2.

Using (3) and then (2),

∑0<|ρ|≤2⁢r|γρ|2 ≤4⁢∑|μ|=r,|ν|=r,0<|μ-ν|<2⁢r|cμ|2⁢|cν|2+∑|μ|=r|cμ|2⁢|c-μ|2
≤4⁢∑|μ|=r,|ν|=r,0<|μ-ν|<2⁢r|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,|ρ|>2⁢r then γρ=0. Putting the above together, we have

∑ρ∈ℤ2|γρ|2≤1+4=5.

Hence ∥c∥44≤5, and therefore

|S|=|∫𝕋2f⁢(x)⁢c⁢(x)¯⁢𝑑x|≤∫𝕋2|f⁢(x)⁢c⁢(x)¯|⁢𝑑x≤∥f∥4/3⁢∥c∥4≤∥f∥4/3⁢51/4,

proving the claim. ∎

2 Tensor products of functions

For f1:X1→ℂ and f2:X2→ℂ, we define f1⊗f2:X1×X2→ℂ by

f1⊗f2⁢(x1,x2)=f1⁢(x1)⁢f2⁢(x2),(x1,x2)∈X1×X2.

For f1∈L1⁢(𝕋d1) and f2∈L1⁢(𝕋d2), it follows from Fubini’s theorem that f1⊗f2∈L1⁢(𝕋d1+d2).

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

f1⊗f2^⁢(ξ1,ξ2) =∫𝕋d1+d2f1⊗f2⁢(x1,x2)⁢e-2⁢π⁢i⁢(ξ1,ξ2)⋅(x1,x2)⁢𝑑λd1+d2⁢(x1,x2)
=∫𝕋d1(∫𝕋d2f1⊗f2⁢(x1,x2)⁢e-2⁢π⁢i⁢(ξ1,ξ2)⋅(x1,x2)⁢𝑑λd2⁢(x2))⁢𝑑λd1⁢(x1)
=∫𝕋d1f1⁢(x1)⁢e-2⁢π⁢i⁢ξ1⋅x1⁢(∫𝕋d2f2⁢(x2)⁢e-2⁢π⁢i⁢ξ2⋅x2⁢𝑑λ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) supN⁡∥kN∥1<∞, (ii) for each N,

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

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

limn→∞⁡∫δ≤x≤1-δ|kN⁢(x)|⁢𝑑λd⁢(x)=0.

Suppose that kN is an approximate identity. It is a fact that if f∈C⁢(𝕋d) then kN*f→f in C⁢(𝕋d), if 1≤p<∞ and f∈Lp⁢(𝕋d) then kN*f→f 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)=r⁢c⁢a⁢(𝕋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 N≥0 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 M≥N.

For f∈L1⁢(𝕋), we define SN⁢f∈C⁢(𝕋) by

(SN⁢f)⁢(x)=∑|j|≤Nf^⁢(j)⁢e2⁢π⁢i⁢j⁢x,x∈𝕋.

We define the Dirichlet kernel DN:𝕋→ℂ by

DN⁢(x)=∑|j|≤Ne2⁢π⁢i⁢j⁢x,x∈𝕋,

which satisfies, for f∈L1⁢(𝕋),

DN*f=SN⁢f.

We define the Fejér kernel FN∈C⁢(𝕋) by

FN=1N+1⁢∑n=0NDn,

We can write the Fejér kernel as

FN⁢(x)=∑|j|≤N(1-|j|N+1)⁢e2⁢π⁢i⁢j⁢x=∑j∈ℤχ[-N,N]⁢(j)⁢(1-|j|N+1)⁢e2⁢π⁢i⁢j⁢x,

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,d∈C⁢(𝕋d) by

FN,d=FN⊗⋯⊗FN⏟d.

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

∥P′∥∞≤4⁢π⁢N⁢∥P∥∞.
Proof.

Define

Q=((e-N⁢P)*FN-1)⁢eN-((eN⁢P)*FN-1)⁢e-N.

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

(e-N⁢P*FN-1^)*eN^⁢(j) =∑k∈ℤe-N⁢P^⁢(j-k)⁢FN-1^⁢(j-k)⁢eN^⁢(k)
=e-N⁢P^⁢(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,2⁢N-1](j)(1-j-NN)
-χ[-2⁢N+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))
=jN⁢P^⁢(j).

On the other hand,

P′^⁢(j)=2⁢π⁢i⁢j⁢P^⁢(j),

so that

P′=2⁢π⁢i⁢N⁢Q,

i.e.

P′=2⁢π⁢i⁢N⁢(((e-N⁢P)*FN-1)⁢eN-((eN⁢P)*FN-1)⁢e-N).

Then, by Young’s inequality,

∥P′∥∞ =2⁢π⁢N⁢∥((e-N⁢P)*FN-1)⁢eN-((eN⁢P)*FN-1)⁢e-N∥∞
≤2⁢π⁢N⁢∥((e-N⁢P)*FN-1)⁢eN∥∞+2⁢π⁢N⁢∥((eN⁢P)*FN-1)⁢e-N∥∞
=2⁢π⁢N⁢∥(e-N⁢P)*FN-1∥∞+2⁢π⁢N⁢∥(eN⁢P)*FN-1∥∞
≤2⁢π⁢N⁢∥e-N⁢P∥∞⁢∥FN-1∥1+2⁢π⁢N⁢∥eN⁢P∥∞⁢∥FN-1∥1
=4⁢π⁢N⁢∥P∥∞.

∎