Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Stein-Tomas spherical restriction theorem

Statement

Assume Countable Choice and let n≥2. Let σ be the polar surface measure on Sn−1 and set p0=2(n+1)/(n+3), so that p0′=2(n+1)/(n−1). Then (a) there is Cn<∞ with ∥f^∥L2(σ)≤Cn∥f∥Lp0(Rn) for all f∈S(Rn); (b) R0 extends uniquely to a bounded linear R:Lp(Rn)→L2(σ) for every 1≤p≤p0, and E:L2(σ)→Lp′(Rn) is its adjoint under the Lp–Lp′ and L2(σ) pairings with the same norm; equivalently E:L2(σ)→Lq(Rn) is bounded for every q≥q0=2(n+1)/(n−1); (c) the result is sharp: (a) fails for p>p0, and no L2→Lq bound holds for q<q0.

Here and in the sharpness clause the exponents belong to [1,∞].

Facts & Assumptions

Given: Countable Choice, n≥2, the polar surface measure σ on Sn−1, the exponents p0=2(n+1)/(n+3), p0′=2(n+1)/(n−1), and the operators R0,E of Fourier restriction and adjoint extension operators.

[F1]

Sphere charts and partition: the polar measure is written as a finite sum of localizations χjσ supported in the images of the graph charts Xj(y)=(y,hj(y)) with hj=±1−∣y∣2 and det⁡D2hj≠0 on the chart domain; the chart density is (1−∣y∣2)−1/2. (Sphere graph charts, surface density, and a finite partition)

[F2]

Graph-patch endpoint bound: for each chart localization μj=χjσ as a graph measure with det⁡D2hj≠0 one has ∥f∗μˇj∥p0′≤Cj∥f∥p0 for all Schwartz f. (Stein-Tomas TT-star bound from fractional integration, Graph-patch extension family: dispersive and L2 slice bounds)

[F3]

TT*: ∥f^∥L2(σ)2=⟨f∗σˇ,f⟩≤∥f∗σˇ∥p0′∥f∥p0; the identity reduces the restriction bound to a convolution bound. (TT-star reduces extension to convolution with the surface-measure transform)

[F4]

Duality and extensions: for 1<p<∞, the restriction estimate at p is equivalent to the extension estimate at p′ with the same constant; a bounded linear map on a dense subspace of a normed space with Banach target has a unique bounded extension with the same norm; S is dense in every Lp, 1≤p<∞. (Restriction and extension estimates are dual, A bounded linear map from a dense normed subspace into a Banach space extends uniquely with the same norm, Cc∞(Rn) is dense in Lp(Rn) for 1≤p<∞)

[F5]

For a measurable h∈Lq0∩L∞ and q0≤q<∞, integration of ∣h∣q≤∥h∥∞q−q0∣h∣q0 gives ∥h∥q≤∥h∥q0q0/q∥h∥∞1−q0/q. At q=∞ use the given supremum bound. (Complex Lp classes and Euclidean test-function conventions, Translation, modulation, linear dilation and reflection laws, A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not)

[F6]

Sharpness: every restriction estimate forces p≤p0, and every extension estimate forces q≥q0. (Knapp necessary condition for spherical L2 restriction, Conjugate exponents, including the endpoint conventions)

Proof

technique · direct; localize the sphere into curved graph patches, sum the endpoint $TT^*$ bounds, dualize to the full range, and invoke the Knapp obstruction for sharpness
1.1F1F2F7algebra

Summing the graph-patch bounds. Let σ=∑jμj with μj=χjσ the finite chart localization of [F1]. For f∈S(Rn), rotate each patch to graph coordinates; orthogonal changes preserve Lebesgue norms and Schwartz space, and chart translations only modulate the data by a unit character. Thus [F2] applies in ambient coordinates. Now σˇ=∑jμˇj and hence f∗σˇ=∑jf∗μˇj as everywhere-defined bounded continuous functions. By [F2] and the triangle inequality for Lp0′, ∥∑jf∗μˇj∥p0′≤∑j∥f∗μˇj∥p0′≤(∑jCj)∥f∥p0=:Cn∥f∥p0. This is the convolution bound at the endpoint.

2.1F3step 1.1algebra

The restriction bound at p0. Applying the TT∗ identity [F3] to the sum of step 1.1, ∥f^∥L2(σ)2=⟨f∗σˇ,f⟩≤∥f∗σˇ∥p0′∥f∥p0≤Cn∥f∥p02, so ∥f^∥L2(σ)≤Cn1/2∥f∥p0, which is (a).

3.1F4F5step 2.1algebra

By [F4], the endpoint restriction estimate gives ∥Eg∥q0≤Cn1/2∥g∥2. Also ∥Eg∥∞≤σ(Sn−1)1/2∥g∥2 by the definition. Applying [F5] with θ=q0/q gives ∥Eg∥q≤(Cn1/2)θσ(Sn−1)(1−θ)/2∥g∥2 for q0≤q<∞, and the supremum estimate gives q=∞. For 1<p≤p0, duality gives the unique restriction extensions with the same norms. At p=1, ∥R0f∥2≤σ(Sn−1)1/2∥f∥1 directly; density and completeness give its unique extension. The pairing ∫Egf‾=∫gRf‾ dσ extends from Schwartz tests by Hölder, also for p=1. Conversely, norm testing in L2(σ) shows that each restriction norm is bounded by its extension norm; testing the extension against L1 functions gives the reverse inequality at p=1. Thus the adjoint pairing and equality of norms hold throughout the asserted range.

4.1F6step 3.1

Sharpness. By [F6], the existence of a restriction estimate at exponent p forces p≤p0, and the existence of an L2(σ)→Lq extension estimate forces q≥q0; the Knapp cap family g=1Cδ with δ↓0 exhibits both failures. This proves (c).

5.1step 1.1step 2.1step 3.1step 4.1∎

Conclusion. Steps 1.1–2.1 prove the endpoint restriction bound (a), step 3.1 gives the full range and the adjoint formulation (b), and step 4.1 records sharpness (c) from the Knapp necessary condition.

Depends on

Used by

Dependency tree · two levels

140 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