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.

Restriction estimates and the missing Strichartz interface

Remark

Recorded orientation, not proved here. The Schrödinger initial-value problem ∂tu+iΔu=h, u(0)=f on R1+d uses a paraboloid extension operator, as seen in Williams's formula (11.21); it is not the spherical extension theorem proved on this page. The two arguments share dispersive bounds, Plancherel, TT∗ and fractional integration. Williams, Definition 11.5 and Theorem 11.6, calls (p,q) admissible when 2/p+d/q=d/2, 2≤p,q≤∞, excluding (2,∞); for admissible pairs with p>2 and Schwartz data he proves ∥u∥LtpLxq≤C(∥f∥2+∥h∥Ltp′Lxq′). This records that nonendpoint theorem with the same pair for solution and forcing. It does not assert endpoint Strichartz estimates or identify them with spherical restriction.

The comparison is anchored to Stein-Tomas spherical restriction theorem. No PDE page is commissioned in this run, and this sourced remark remains a non-load-bearing leaf; it supplies no proof to another item.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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