3 Introduction to Fourier Transform

Correction for lecture 2: Number Theory Lemma.

True statements:

-1  ∑   # ÷ (n) ≲ logN,
N 1≤n≤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:

       |           |p
  ∫    ||∑          ||           p− 2    2
−  [0,N2]||    bne(anx)|| dx ≾ (1 +N 2 )∥bn∥2.
        n∼N
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

 ∫     ||∑         ||p      ∫     ||∑      ||p2
−      ||   bne(anx)|| dx ∼ −      ||   |bn|2|| dx.
  [0,N2]| n        |        [0,N2]| n     |

Constant integral: bn1. (1,1,1,,1).

        |        |p
  ∫     ||∑        ||      -1-∫     p      p−2     p− 2   p
−  [0,N2]||   e(anx)|| dx ≳ N 2 [0,c]N  dx ∼ N    = N 2 ∥bn∥2.
         n

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:

       |         ( ∘ --- )|p            |              |
 ∫     ||  ∑          m2   ||       ∫     || ∑    ( m   ) ||p
−    2 ||        e    N-x  || dx = −    2 ||     e √---x  ||dx
  [0,N ]|N≤m2≤2N           |        [0,N ] m2∼N     N

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

 ∫     ||∑       ||4
−      ||   e(anx )|| dx ≾ N 2 = |{an}|2.
   [0,N2]| n      |
                                 2
=⇒  #{an1 + an2 = an3 + an4} ≲ |{an}|.
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(ξ) =   e−2πix⋅ξf(x)dx.
       ℝn
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^qfp for 1p2, 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φ(xvk).

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

      ∫ ||∑            ||p  ∑  ∫
∥f∥pp =  ||   𝜀kφ(x− vk)|| =      |φ(x− vk)|pdx = N ∥φ∥pp.
        | k           |    k
Also
       N                (  N          )
 ^     ∑    − 2πiξvk        ∑     −2πiξvk
f (ξ) =    𝜀ke      ^φ(ξ) =     𝜀ke       φ^(ξ).
       k=1                 k=1
We will use Khinchin’s inequality.

f^qN12φ^q.