Alphabeta Math
LemmaStatement: 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.

TT-star reduces extension to convolution with the surface-measure transform

Statement

Assume Countable Choice. Let μ be a finite positive Borel measure on Rn, let Eμg=(gμ)∨ for g∈L1(μ)∩L2(μ), and let Eμ∗F be the restriction of F^ to supp⁡μ for F∈S(Rn). Then EμEμ∗F=F∗μˇ for every F∈S(Rn), and for every 1≤p≤∞, ∥F^∥L2(μ)2=⟨(F^μ)∨,F⟩=⟨F∗μˇ,F⟩≤∥F∥Lp∥F∗μˇ∥Lp′. In particular, for a compact hypersurface S with surface measure σ, a bound on ∥F∗σˇ∥Lp′ bounds ∥F^∥L2(σ).

The brackets here denote the absolutely convergent integral ⟨H,F⟩=∫HF‾ dx, not a claim that H∈L2(Rn). Positivity of μ is essential to the squared-norm identity.

Facts & Assumptions

Given: Countable Choice, a finite positive Borel measure μ on Rn with μ(Rn)<∞, F∈S(Rn), and 1≤p≤∞ with conjugate p′.

[F1]

For g∈L1(μ) the extension Eμg=(gμ)∨ is the bounded uniformly continuous function x↦∫e2πix⋅ωg(ω) dμ(ω), and Eμ∗F=F^∣supp⁡μ, so that g=Eμ∗F is the restriction of the Schwartz transform; μˇ(x)=μ^(−x)=∫e2πix⋅ω dμ(ω) is bounded with ∣μˇ∣≤∣μ∣(Rn). (Fourier restriction and adjoint extension operators, Fourier transform of a finite complex Borel measure, A complex L^1 density defines a complex measure whose total variation is |h| dmu)

[F2]

Fourier pairing and convolution identity: for all F,G∈S(Rn), ∫(Gμ)∨F‾ dx=∫GF^‾ dμ, and (F^μ)∨=F∗μˇ holds as an identity of everywhere-defined bounded continuous functions. (Fourier pairing for a finite measure and Schwartz data, A complex measure is a finite-valued countably additive set function)

[F3]

Hölder and inner products: on a measure space, ∫∣fg∣ dν≤∥f∥r∥g∥r′ for conjugate r,r′ and complex measurable f,g (endpoint cases included), and the complex L2 pairing is ⟨h,k⟩=∫hk‾ with ∣⟨h,k⟩∣≤∥h∥2∥k∥2; the L2 norm is ∥h∥22=⟨h,h⟩=∫∣h∣2. (Complex Holder, Minkowski, and the quotient norm, Holder's inequality for integrals, including the endpoint cases, The complex L2 pairing on equivalence classes, The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz, Conjugate exponents, including the endpoint conventions)

Proof

technique · direct; apply the pairing and convolution identities of the finite-measure lemma to $G=\widehat F$ and then bound the resulting pairing by Hölder
1.1F1F2

The TT∗ identity. Applying the convolution identity [F2] with the given F gives (F^μ)∨=F∗μˇ as functions on Rn. Since Eμ∗F=F^∣supp⁡μ and Eμ(F^∣supp⁡μ)=(F^μ)∨, this reads EμEμ∗F=F∗μˇ, which is the first assertion.

2.1F1F2F3step 1.1

The squared norm identity. The L2(μ) norm is computed by [F3]: ∥F^∥L2(μ)2=∫∣F^∣2 dμ=∫F^F^‾ dμ. Applying the pairing identity [F2] with G=F^ (a Schwartz function) gives ∫(F^μ)∨F‾ dx=∫F^F^‾ dμ, that is ∫(F^μ)∨F‾ dx=∥F^∥L2(μ)2. By step 1.1 the left side equals ⟨F∗μˇ,F⟩, so the first two equalities of the statement hold.

3.1F3step 2.1

The Hölder bound. By [F3] for the Lp–Lp′ pairing with h=F∗μˇ and k=F, ∣⟨F∗μˇ,F⟩∣=∣∫(F∗μˇ)F‾ dx∣≤∥F∗μˇ∥p′∥F∥p when F∗μˇ∈Lp′; if that norm is infinite, the inequality is automatic. The pairing itself is absolutely convergent since F∈L1 and F∗μˇ is bounded. Combining with step 2.1, ∥F^∥L2(μ)2=⟨F∗μˇ,F⟩≤∥F∥p∥F∗μˇ∥p′.

4.1F1F2F3step 2.1step 3.1

Specialization to a hypersurface. Let S be a compact hypersurface with surface measure σ; then σ is a finite Borel measure, σˇ=σ^(−⋅) obeys ∣σˇ∣≤σ(S), and the identities of steps 1.1–3.1 hold with μ=σ. Consequently, if there is C<∞ with ∥F∗σˇ∥Lp′≤C∥F∥Lp for every F∈S(Rn), then ∥F^∥L2(σ)2≤C∥F∥p2, that is ∥F^∥L2(σ)≤C1/2∥F∥Lp: a bound on the convolution with σˇ bounds the restriction estimate.

5.1step 1.1step 2.1step 3.1step 4.1∎

Conclusion. Step 1.1 proves EμEμ∗F=F∗μˇ; steps 2.1 and 3.1 prove the chain ∥F^∥L2(μ)2=⟨(F^μ)∨,F⟩=⟨F∗μˇ,F⟩≤∥F∥p∥F∗μˇ∥p′ for every 1≤p≤∞; step 4.1 records the hypersurface specialization. Countable Choice is inherited from the finite-measure pairing and transform suppliers.

Depends on

Used by

Dependency tree · two levels

60 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