Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not suppliedPipeline-generated‡ not proved here
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

‡ Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

The general Fourier restriction problem remains open

Remark

Recorded orientation, not proved here. For f∈L∞(Sn−1) the restriction conjecture asks for ∥fdσ^∥Lq(Rn)≲q∥f∥∞ for all q>2n/(n−1); the constant density shows this range is best possible. The conjecture is known for n=2 (Fefferman and Zygmund) and remains open for n≥3. The Stein-Tomas theorem of this page settles only the L2-density line q≥2(n+1)/(n−1), which lies strictly above the conjectured L∞ range; no claim here settles the general restriction problem, and the Knapp examples of the companion page constrain every such estimate.

The operators in the display are those of Fourier restriction and adjoint extension operators; the necessity of the L2-density threshold recorded here is the theorem Knapp necessary condition for spherical L2 restriction, and the companion page's counterexample exhibits the same cap family in the limit δ↓0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources