5 Equivalent Versions of Fourier Restriction

Searching for (p,q) for which

f^Lq(Sn1)Cp,q,nfLp(n).

Reminder: RSn1(pq) means

f^Lq(Sn1)Cp,q,nfLq(n)fS(n).

Conjecture (Restriction Conjecture). RSn1(pq) if and only if n+1n1qn+1p and p<2nn+1.

First proved for S12 by Fefferman (1970) and Zygmund (1974).

Special things happen in 2, classical harmonic analysis techniques apply.

Same conjecture for RPn1(pq), where

Pn1={(ξ,|ξ|2)n:|ξ|<1}.

f^Lq(Pn1)q=|ξ|<1|f^(ξ,|ξ|2)|qdξ.

PIC

For n3, open and active!

Restriction theory can be used to deduce continuum incidence geometry estimates.

Surprisingly, we can go the other way too (very recent progress, whereas the above direction has been well-known since at least the 90s).

Equivalent formulations of RPn1(pq)

Dual version is called “Fourier extension”:

f^Lq(Pn1)=supgLq(Pn1)gLq(Pn1)=1||ξ|<1ξn1f^(ξ,|ξ|2)g(ξ)dξ|.

(1q+1q=1). The integral equals:

|ξ|<1ne2πix(ξ,|ξ|2)f(x)dxg(ξ)dξ=nf(x)|ξ|<1e2πix(ξ,|ξ|2)g(ξ)dξEg(x)dxEgLp(n)Cp,q,ngLq(Pn1)S(Pn1)

Call the last inequality RPn1(qp).

Local, dual version: allows us to work with functions, F.T.

For any R1, any BRn, we have

(n|f(x)|p)1pR1q(|f^(ξ)|qdξ)1q

for all fS(n) with suppf^NR1(Pn1).

Call this RPn1,loc(qp).

RPn1(qp)Rpn1,loc(qp). First thing bounds Eg, while secound thing bounds f when we have suppf^NR1(Pn1).

Let fS(n), suppf^NR1(Pn1). Try to express f in trems of ext. op.

f(x)=Fourier inversionne2πixξf^(ξ)dξ=n1e2πix(ξ,ξn)f^(ξ,ξn)dξndξ=e2πxnξnn1e2πix(ξ,|ξ|2)f^(ξ,|ξ|2+ξn)=:gξn(ξ)dξdξnξnξn+|ξ|2=[R1,R1]e2πxnξn|ξ|<1e2πix(ξ,|ξ|2)f^(ξ,|ξ|2+ξn)=:gξn(ξ)dξEgξn(x)dξnn|f(x)|pdx=n|IR1e2πixnξnEgξn(x)dξn|pdxR bounds |Eg|pHölders’sn|IR1|p1IR1|Egξn(x)|pdξndx(R1)p1IR1(|ξ|<1|gξn(ξ)|qdξ)pqdξn()using RPn1(qp) Goal is to bound this last expression by
RpqIR1|ξ|<1|gξn(ξ)|qdξdξnf^Lq(NR1(Pn1))

Lucy case: pq<1, i.e. 1<qp. Then

()Rp+1IR1
AhHölder’s|A|11s(Ahs)1s,

s1 (actually since h approximately constant on A)

RPn1(qp)RPn1,loc(qp) continued.

Spatial: x,f(x),Eg(x)

n|f(x)|pdx
n|Eg(x)|pdx

PIC

Frequency ξ:

PIC

g(ξ,|ξ|2)=g(ξ), suppf^NR1(Pn1),

NR1(Pn1)|f^(ξ)|qdξ
|ξ|<1|g(ξ)|qdξ.
BR|f(x)|pdx()R(p1)IR1(|ξ|<1|gξn(ξ)|qdξ)pqdξn.

Aiming for

()Rpq(IR1|ξ|<1|gξn(ξ)|qdξ)pq.

Lucky case: pq1.

()Hölder’s inequality in ξnR(p1)|IR1|1pq(IR1|ξ|<1|gξn(ξ)|qdξdξn)pq

R(p1)(R1)1pq=Rpq (1=1q+1q)

Unlucky case: pq>1. Hölder’s inequality goes in the wrong direction:

Ah|A|11s(Ahs)1s

for all s1, h0.

This is equality if h is constant on A.

PAUSE THIS.

Useful Harmonic Analysis tool

The locally constant property.

Convolution: Let f,gS(n). Define fgS(n) by

fg(x)=nf(xy)g(y)dy=nf(Y)g(xy)dy.

See Young’s convolution:

fgLrfpgq

when 1+1r=1p+1q.

Example. g=χB (B is the unit ball in n),

fχB(x)=yBf(xy)dy

RHS is “average value of f on B(x)”.

fχB is approximately constant on balls of radius 1”.

Support property: suppf=A, suppg=B, suppfgA+B={a+b:aA,bB}.

Convolution and Fourier Transform: fg^=f^g^.

Locally constant property: Let fS(n), suppf^B1(0). Then for any unit ball Bn and any xB,

fL(B)mn|f|(xy)1(1+|y|2)mdy.

1(1+|y|2)m is 1 on |y|1.

PIC

Digesting f0.

For any unit interval In, xI,

fL(I)(12,12)f(xy)dy.

Suppose this:

PIC

LHS has to be constant.

fL(I)(12,12)f(xy)dy.

PIC

fL(I)()(12,12)f(xy)dy

Lemma (Locally constant property). Assuming that:

  • fS(n)

  • suppf^B1(0)

Then for any unit ball B1n and any xB,
fL(B)mn|f|(xy)1(1+|y|2)mdy.

The proof of this fact is more important than the statement – we will be using the strategy in future.

Proof of locally constant property. Let fS(n), suppf^B1(0). Let φCc(n) such that φ1 on B1(0), suppφB2(0).

By Fourier inversion:

f=ˇ(f^)=ˇ(f^φ)=ˇ(f^)ˇφ=fˇφ.

Let x0,xB1 (unit ball in n).

|f(x0)|=|f(x0y)ˇφ(y)dy||f|(x0y)|ˇφ(y)|dy=|f|(xy)|ˇφ|(y(yx0))dym|f|(xy)1(1+|y(xx0)|xx0|<1|2)mdym|f|(xy)1(1+|y|2)m
Returning to RPn1(qp)RPn1,loc(qp)
BR|f(x)|pdxBR|fφBR|pdx

where φBRS(n) satisfies φBR1 on BR, suppφBR^BR1(0).

fφBR^=f^R1 neighbourhood of Pn1φBR^R1 ball(ξ)

supported in 2R1-neighbourhood of Pn1.

Repeat steps of proof:

BR|f(x)|pdxR(p1)IR1(|ξ|<1|hξn(ξ)|qdξ)pqdξn

PIC

h(ξn)=f^φBR^(ξ,|ξ|2+ξn)