Alphabeta Math
CorollaryStatement: 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 for compact hypersurfaces with nonzero curvature

Statement

Assume Countable Choice. Let S⊆Rn (n≥2) be a compact embedded C∞ hypersurface with everywhere nonvanishing extrinsic Gaussian curvature and surface measure σ. Set p0=2(n+1)/(n+3) and q0=2(n+1)/(n−1). Then there is CS<∞, depending on S, such that ∥f^∥L2(σ)≤CS∥f∥Lp0(Rn) for all f∈S(Rn); R0 extends uniquely to a bounded linear R:Lp(Rn)→L2(σ) for every 1≤p≤p0; and E:L2(σ)→Lq(Rn) is bounded for every q≥q0.

Facts & Assumptions

Given: Countable Choice, n≥2, a compact embedded C∞ hypersurface S⊆Rn with everywhere nonvanishing extrinsic Gaussian curvature and surface measure σ, the exponents p0,q0, and the operators R0,E.

[F1]

Every smooth embedded Euclidean hypersurface admits smooth graph charts after rigid motions. Compact sets admit finite graph localization, with smooth compactly supported nonnegative weights summing to one. (Smooth Euclidean hypersurface graphs and compact localization)

[F2]

Euclidean shape operators and extrinsic Gaussian curvature have their usual meanings; local normal reversal preserves curvature nonvanishing. On a graph the curvature determinant equals the Hessian determinant divided by the positive graph factor. (Euclidean hypersurface normals, shape operators and curvature, Smooth Euclidean hypersurface graphs and compact localization, Shape operator and Gauss-Kronecker curvature of a graph)

[F3]

Finite cover and partition: the compact hypersurface is covered by finitely many relatively open graph pieces of [F1] with subordinate nonnegative smooth functions χj, ∑jχj=1, each χj compactly supported in its piece; the localized measures μj:=χjσ are graph-patch localizations of the form treated by the patch decay and slice estimates. (Compact curved hypersurfaces admit a finite curved graph cover, Decay of a localized measure on a curved graph patch, Chart and partition independence of surface measure)

[F4]

Endpoint patch bound: for every such localization μj one has ∥f∗μˇj∥p0′≤Cj∥f∥p0 for all Schwartz f, with Cj depending on the patch data. (Stein-Tomas TT-star bound from fractional integration)

[F5]

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

[F6]

Duality, extension and interpolation: for 1<p<∞, restriction at p is equivalent to extension at p′ with the same constant and adjoint identification; bounded maps on dense subspaces have unique bounded extensions; and a map bounded L2→Lp0′ and L2→L∞ with constants C and σ(S)1/2 satisfies ∥Eg∥q≤Cθσ(S)(1−θ)/2∥g∥2 for q≥q0 with 1/q=θ/p0′. (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, Interpolate L1 to Linfinity and L2 to L2 bounds, Riesz–Thorin estimate on the finite simple core, Conjugate exponents, including the endpoint conventions, Complex Lp classes and Euclidean test-function conventions)

Proof

technique · direct; cover the compact curved hypersurface by finitely many curved graph patches, sum the endpoint patch bounds, and conclude by $TT^*$, duality and interpolation
1.1F1F2F3

Finite graph cover. The local reduction of [F1] and the nondegeneracy of the curvature via [F2] produce, at every point, a curved graph chart; the argument of the finite-graph-cover lemma (compactness plus local construction) selects finitely many such charts covering S. The compact localization construction of [F1] uses the local graph normals; their sign-independent nonvanishing curvature in [F2] supplies the curved charts without needing a global normal field. Write the resulting pieces as S1,…,Sm with graphing functions hj satisfying det⁡D2hj≠0 and localizations μj=χjσ as in [F3].

2.1F4F7step 1.1algebra

Endpoint convolution bound. Each patch may be rotated to graph coordinates; its translation contributes a modulation of the data. These operations preserve all relevant norms, so [F4] applies in the original coordinates. Since σˇ=∑jμˇj and f∗σˇ=∑jf∗μˇj, the patch estimates [F4] and the triangle inequality give ∥f∗σˇ∥p0′≤(∑jCj)∥f∥p0=:CS∥f∥p0 for every Schwartz f.

3.1F5step 2.1algebra

The restriction bound. By the TT∗ identity [F5] and step 2.1, ∥f^∥L2(σ)2=⟨f∗σˇ,f⟩≤∥f∗σˇ∥p0′∥f∥p0≤CS∥f∥p02, hence ∥f^∥L2(σ)≤CS1/2∥f∥p0 for every f∈S(Rn).

4.1F6F7step 3.1algebra

The range and the extension. By [F6] the restriction bound of step 3.1 gives a unique bounded extension R:Lp0→L2(σ) and the dual extension estimate ∥Eg∥p0′≤CS1/2∥g∥L2(σ); moreover ∣Eg∣≤∥g∥L1(σ)≤σ(S)1/2∥g∥L2(σ), so E:L2(σ)→L∞ is bounded. For finite q≥q0, integrating ∣Eg∣q≤∥Eg∥∞q−q0∣Eg∣q0 gives E:L2(σ)→Lq for every q≥q0, and dualizing as in [F6] extends R0 uniquely to a bounded R:Lp→L2(σ) for every 1<p≤p0. At p=1, ∥R0f∥2≤σ(S)1/2∥f∥1 directly, and smooth density with completeness gives the unique extension. Hölder extends the integral adjoint pairing to L1 as well. Thus the full asserted range holds.

5.1step 1.1step 2.1step 3.1step 4.1∎

Conclusion. Steps 1.1–2.1 sum the endpoint patch estimates into a convolution bound for the full compact hypersurface, step 3.1 converts it into the endpoint restriction estimate, and step 4.1 gives the full range and the adjoint formulation. The constant depends on S through the finitely many patch constants, the geometry of the cover, and σ(S).

Depends on

Used by

Dependency tree · two levels

141 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