3 Introduction to Fourier Transform

Correction for lecture 2: Number Theory Lemma.

True statements:

1N1nN#÷(n) log N,

and #÷(n)𝜀n𝜀.

See Terence Tao notes online.

Explaining #÷(n)𝜀n𝜀: 𝜀>0, c𝜀(0,) such that #÷(n)C𝜀n𝜀 for all n1.

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

Question:

[0,N2]|nNbne(anx)|pdx(1+Np22)bn22.

For example, an=n2N2.

Recall: nN means Nn2N.

{an}[0,10], an+1an1N, (an+2an+1)(an+1an)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: bn1. (1,1,1,,1).

[0,N2]|ne(anx)|pdx1N2[0,c]NpdxNp2=Np22bn2p.

Warning. Enemy scenario: {an}={nN}n=N2N (technically {3NnN} 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]|Nm22Ne(m2Nx)|pdx=[0,N2]|m2Ne(mNx)|pdx

PIC

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

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

Why do we care?

bn1, p=4. Then

[0,N2]|ne(anx)|4dxN2=|{an}|2.
#{an1+an2=an3+an4}|{an}|2.

Convex sequences have minimal additive energy.

Decoupling doesn’t know how to take advantage of bn1.

3.1 Fourier Transform on n

f:n, fS(n) Schwartz function: xαβf< for all α,β.

f^(ξ)=ne2π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¯=f22

(isometry on L2).

p=1, q=:

|e2πixξf(x)dx||f(x)|dx=f1

(contraction from L1 to L).

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

Are there any other (p,q) for which

f^qp,qfq?

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

Consider f(x)=k=1N𝜀kφ(xvk).

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

fpp=|k𝜀kφ(xvk)|p=k|φ(xvk)|pdx=Nφpp.

Also

f^(ξ)=k=1N𝜀ke2πiξvkφ^(ξ)=(k=1N𝜀ke2πiξvk)φ^(ξ).

We will use Khinchin’s inequality.

f^qN12φ^q.