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 . Let be the polar surface measure on and set , so that . Then (a) there is with for all ; (b) extends uniquely to a bounded linear for every , and is its adjoint under the – and pairings with the same norm; equivalently is bounded for every ; (c) the result is sharp: (a) fails for , and no bound holds for .
Here and in the sharpness clause the exponents belong to .
Facts & Assumptions
Given: Countable Choice, , the polar surface measure on , the exponents , , and the operators of Fourier restriction and adjoint extension operators.
Sphere charts and partition: the polar measure is written as a finite sum of localizations supported in the images of the graph charts with and on the chart domain; the chart density is . (Sphere graph charts, surface density, and a finite partition)
Graph-patch endpoint bound: for each chart localization as a graph measure with one has for all Schwartz . (Stein-Tomas TT-star bound from fractional integration, Graph-patch extension family: dispersive and L2 slice bounds)
TT*: ; the identity reduces the restriction bound to a convolution bound. (TT-star reduces extension to convolution with the surface-measure transform)
Duality and extensions: for , the restriction estimate at is equivalent to the extension estimate at 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; is dense in every , . (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, is dense in for )
For a measurable and , integration of gives . At use the given supremum bound. (Complex Lp classes and Euclidean test-function conventions, Translation, modulation, linear dilation and reflection laws, A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not)
Sharpness: every restriction estimate forces , and every extension estimate forces . (Knapp necessary condition for spherical L2 restriction, Conjugate exponents, including the endpoint conventions)
Orthogonal coordinate changes preserve Lebesgue norms and Schwartz space; translations of frequency surfaces modulate their inverse transforms. (Translation, modulation, linear dilation and reflection laws, A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not)
Proof
Summing the graph-patch bounds. Let with the finite chart localization of [F1]. For , 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 and hence as everywhere-defined bounded continuous functions. By [F2] and the triangle inequality for , This is the convolution bound at the endpoint.
The restriction bound at . Applying the identity [F3] to the sum of step 1.1, so , which is (a).
By [F4], the endpoint restriction estimate gives . Also by the definition. Applying [F5] with gives for , and the supremum estimate gives . For , duality gives the unique restriction extensions with the same norms. At , directly; density and completeness give its unique extension. The pairing extends from Schwartz tests by Hölder, also for . Conversely, norm testing in shows that each restriction norm is bounded by its extension norm; testing the extension against functions gives the reverse inequality at . Thus the adjoint pairing and equality of norms hold throughout the asserted range.
Sharpness. By [F6], the existence of a restriction estimate at exponent forces , and the existence of an extension estimate forces ; the Knapp cap family with exhibits both failures. This proves (c).
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
- Fourier restriction and adjoint extension operators
- Restriction and extension estimates are dual
- Sphere graph charts, surface density, and a finite partition
- Knapp necessary condition for spherical L2 restriction
- TT-star reduces extension to convolution with the surface-measure transform
- Stein-Tomas TT-star bound from fractional integration
- Riesz–Thorin estimate on the finite simple core
- A bounded linear map from a dense normed subspace into a Banach space extends uniquely with the same norm
- $C_c^\infty(\mathbb{R}^n)$ is dense in $L^p(\mathbb{R}^n)$ for $1 \le p < \infty$
- Conjugate exponents, including the endpoint conventions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Graph-patch extension family: dispersive and L2 slice bounds
- Interpolate L1 to Linfinity and L2 to L2 bounds
- Complex Lp classes and Euclidean test-function conventions
- Translation, modulation, linear dilation and reflection laws
- A linear map $T$ of $\mathbb{R}^n$ sends Lebesgue measurable sets to Lebesgue measurable sets, with $\lambda_n(T[E])=|\det T|\,\lambda_n(E)$ when $T$ is invertible and $T[E]$ Lebesgue null when it is not
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
- Mark Williams, Notes on harmonic analysis (standard reference, not scraped)