3 Introduction to Fourier Transform

Correction for lecture 2: Number Theory Lemma.

True statements:

1N∑1≤n≤N#÷(n)≲ log ⁡N,

and #÷(n)≲𝜀n𝜀.

See Terence Tao notes online.

Explaining #÷(n)≲𝜀n𝜀: ∀⁡𝜀>0, ∃⁡c𝜀∈(0,∞) such that #÷(n)≤C𝜀n𝜀 for all n≥1.

We will be using ≾ to mean “≤ but up to sub-polynomial in n”.

Question:

−∫[0,N2]|∑n∼Nbne(anx)|pdx≾(1+Np2−2)∥bn∥22.

For example, an=n2N2.

Recall: n∼N means N≤n≤2N.

{an}⊆[0,10], an+1−an∼1N, (an+2−an+1)−(an+1−an)∼1N2.

Reasonable conjecture?

Yes, reasonable.

Khinchin’s inequality: May select bn∈{±1} so that

−∫[0,N2]|∑nbne(anx)|pdx∼−∫[0,N2]|∑n|bn|2|p2dx.

Constant integral: bn≡1. (1,1,1,…,1).

−∫[0,N2]|∑ne(anx)|pdx≳1N2∫[0,c]Npdx∼Np−2=Np2−2∥bn∥2p.

Warning. Enemy scenario: {an}={nN}n=N2N (technically {−3N−nN} if we want to satisfy the conditions mentioned above).

(bn)=(1,0,…,0,1,0,…,0,1,…,0). Length N vector with N12 many 1s. Have:

−∫[0,N2]|∑N≤m2≤2Ne(m2Nx)|pdx=−∫[0,N2]|∑m2∼Ne(mNx)|pdx

PIC

We can calculate that the above expression is in fact ≥Np2−12 (which breaks the conjecture until p>6).

It turns out that this is (roughly speaking) the only problem.

Why do we care?

bn≡1, p=4. Then

−∫[0,N2]|∑ne(anx)|4dx≾N2=|{an}|2.
⟹#{an1+an2=an3+an4}≲|{an}|2.

→ Convex sequences have minimal additive energy.

Decoupling doesn’t know how to take advantage of bn≡1.

3.1 Fourier Transform on ℝn

f:ℝn→ℂ, f∈S(ℝn) Schwartz function: ∥xα∂βf∥∞<∞ for all α,β.

f^(ξ)=∫ℝne−2πix⋅ξf(x)dx.

x is the spatial variable, and ξ is the frequency variable.

Facts:

Basic question about f^: Lp to Lq boundedness?

Plancherel’s:

∥f^∥22=∫f^f^¯=∫ff¯=∥f∥22

(isometry on L2).

p=1, q=∞:

|∫e−2πix⋅ξf(x)dx|≤∫|f(x)|dx=∥f∥1

(contraction from L1 to L∞).

By interpolation (Marcinkiewicz): ∥f^∥q≤∥f∥p for 1≤p≤2, 1p+1q=1 (Hausdorff-Young inequality).

Are there any other (p,q) for which

∥f^∥q≲p,q∥f∥q?

Attempt 1: Let φ∈Cc∞(ℝn) (compactly supported smooth function on ℝn), with supp⁡φ⊆B1(0).

Consider f(x)=∑⁡k=1N𝜀kφ(x−vk).

Choose vk so that {B1(vk)} are not overlapping. Then

∥f∥pp=∫|∑k𝜀kφ(x−vk)|p=∑k∫|φ(x−vk)|pdx=N∥φ∥pp.

Also

f^(ξ)=∑k=1N𝜀ke−2πiξvkφ^(ξ)=(∑k=1N𝜀ke−2πiξvk)φ^(ξ).

We will use Khinchin’s inequality.

∥f^∥q∼N12∥φ^∥q.