Math 2.0

Harmonic analysis on Euclidean spaces Restriction, Kakeya and oscillatory integrals Problem

Fourier restriction problem

Builds on Fourier transformLp spaceSchwartz space

Problem

Let n≥2n \ge 2, let S⊆ℝnS \subseteq \R^n be a compact smooth hypersurface, and let σ\sigma be its surface measure. Let f^\hat f be the Fourier transform of ff. For which pairs of exponents 1≤p,q≤∞1 \le p, q \le \infty is there a constant CC such that (∫S∣f^(ξ)∣q dσ(ξ))1/q≤C∥f∥Lp(ℝn)\Big( \int_S \abs{\hat f(\xi)}^q \, d\sigma(\xi) \Big)^{1/q} \le C \norm{f}_{L^p(\R^n)} for every Schwartz function ff on ℝn\R^n?

Remarks

For p=1p = 1 the estimate holds for all qq, since ∣f^∣≤∥f∥L1\abs{\hat f} \le \norm{f}_{L^1} everywhere. For p=2p = 2 it fails for every qq, since f^\hat f is then an arbitrary L2L^2 function and has no meaningful values on a set of measure zero. When SS is a piece of a hyperplane, it fails for every p>1p > 1. When SS has nonzero Gaussian curvature, the Stein–Tomas restriction theorem gives the estimate for q=2q = 2 and 1≤p≤2(n+1)/(n+3)1 \le p \le 2(n+1)/(n+3). For the sphere, the conjectured answer is the restriction conjecture; it is known for n=2n = 2 and open for n≥3n \ge 3.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Fourier transform concept
  2. Lp space concept
  3. Schwartz space concept
  4. Fourier restriction problem problem

Further reading

  1. Web https://en.wikipedia.org/wiki/Restriction_conjecture
About this page
TagFFCH15ZNZG
URIm2://FFCH15ZNZG
Kindproblem
WritingW0 stub
MSC42B10, 42B20
StatusThis copy of the site has no build data. Run m2 status FFCH15ZNZG.
AboutFourier transform
UsesFourier transform, Lp space, Schwartz space

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.