Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 TT-star bound from fractional integration

Statement

Assume Countable Choice. Let n≥2 and let U,h,a,μ be as in Graph-patch extension family: dispersive and L2 slice bounds, with det⁡D2h≠0 on supp⁡a. Set p=2(n+1)/(n+3), so that p′=2(n+1)/(n−1) and 1/p−1/p′=2/(n+1). Then ∥f∗μˇ∥Lp′(Rn)≤Ca∥f∥Lp(Rn) for every f∈S(Rn).

Facts & Assumptions

Given: Countable Choice, n≥2, the graph-patch data U,h,a with det⁡D2h≠0 on supp⁡a, the localized measure μ, its transform μˇ, the exponent p=2(n+1)/(n+3) and f∈S(Rn); write fs(x′):=f(x′,s) for the slice at height s.

[F1]

Slice family: with K(x′,t)=μˇ(x′,t) and U(t)g(x′)=∫K(x′−y′,t)g(y′) dy′, one has for 1≤p≤2 the bound ∥U(t)g∥Lp′(Rn−1)≤Ca⟨t⟩−(n−1)(1/p−1/2)∥g∥Lp(Rn−1), uniformly in t, and ⟨z⟩−(1−α)≤∣z∣−(1−α) for z≠0 for the order α:=2/(n+1). (Graph-patch extension family: dispersive and L2 slice bounds, Conjugate exponents, including the endpoint conventions)

[F2]

Minkowski's integral inequality and Tonelli: for measurable F with ∫Y∥F(⋅,y)∥Lr(X) dν(y)<∞ one has ∥∫Y∣F(⋅,y)∣ dν∥Lr(X)≤∫Y∥F(⋅,y)∥Lr(X)dν(y) for 1≤r<∞; iterated integrals over sigma-finite products agree for nonnegative integrands. (Minkowski's integral inequality, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)

[F3]

Hardy–Littlewood–Sobolev in one dimension: for 0<α<1 and 1<p<1/α with 1/p′=1/p−α, the unit-normalized Riesz potential Iαg(t)=∫∣t−s∣α−1g(s) ds satisfies ∥Iαg∥Lp′(R)≤Cα,p∥g∥Lp(R) for g∈Lp(R); the kernel convention is Kα(z)=∣z∣α−1 for z≠0 and Kα(0)=0. (Hardy–Littlewood–Sobolev fractional integration inequality, Riesz potential of order alpha)

[F4]

Complex Lp conventions: norms on complex classes, Tonelli for nonnegative measurable functions, and the modulus estimates used to pass from complex functions to their pointwise moduli. (Complex Lp classes and Euclidean test-function conventions, Complex Holder, Minkowski, and the quotient norm)

[F5]

Fubini applies to absolutely integrable complex product kernels, and Schwartz decay gives integrability of all slices and arbitrarily rapid decay of their norms in the remaining coordinate. (Fubini's theorem for L^1 functions on a sigma-finite product, Schwartz derivatives are integrable)

Proof

technique · direct; write the full convolution as a superposition of slice operators, apply Minkowski in the space variable, and recognize the resulting one-dimensional kernel as a Riesz potential of order $2/(n+1)$
1.1F1F5givenalgebra

The slice superposition. The bounded kernel and f∈L1 make the full integral absolutely convergent; Fubini therefore licenses splitting the variable y=(y′,s)∈Rn−1×R and writing x=(x′,t), the defining convolution and [F1] give, at every point, f∗μˇ(x′,t)=∫R(∫Rn−1f(x′−y′,t−s)K(y′,s) dy′)ds=∫RU(s)ft−s(x′) ds.

2.1F1F2F4F5step 1.1

Minkowski in the slice variable. Fix t. By [F2] applied in the space variable x′ with ν the Lebesgue measure in s, ∥∫RU(s)ft−s ds∥Lp′(Rn−1)≤∫R∥U(s)ft−s∥Lp′(Rn−1) ds. For Schwartz f, g(τ)=∥fτ∥p decays faster than any prescribed power (bound ∣f(x′,τ)∣ by CN(1+∣x′∣)−N(1+∣τ∣)−N). Thus the slice estimate of [F1] bounds the right side by C∫g<∞, licensing [F2] for every t; this is the Minkowski inequality for the complex-valued measurable integrand of [F4].

3.1F1F2F4step 2.1algebra

The slice decay. For the exponent p=2(n+1)/(n+3) one has 1/p−1/2=1/(n+1), so [F1] gives ∥U(s)ft−s∥Lp′≤Ca⟨s⟩−(n−1)/(n+1)∥ft−s∥Lp(Rn−1). Substituting into step 2.1 and substituting τ=t−s, ∥∫RU(s)ft−s ds∥Lp′(Rn−1)≤Ca∫R⟨t−τ⟩−β g(τ) dτ,g(τ):=∥fτ∥Lp(Rn−1),β:=n−1n+1. The function g is measurable and nonnegative and, by Tonelli, ∥g∥Lp(R)p=∫R∫Rn−1∣f(x′,τ)∣p dx′ dτ=∥f∥Lp(Rn)p, so g∈Lp(R) and ∥g∥p=∥f∥p.

4.1F1F3step 3.1algebra

Fractional integration. Let α:=1−β=2/(n+1)∈(0,1) and compare kernels: ⟨t−τ⟩−(1−α)≤∣t−τ∣−(1−α)=Kα(t−τ) for τ≠t by [F1]. Hence the function h(t):=∥(f∗μˇ)(⋅,t)∥Lp′(Rn−1) satisfies h(t)≤Ca21−α∫RKα(t−τ)g(τ) dτ=Ca21−αIαg(t) for almost every t; the single diagonal point τ=t has zero measure and does not affect the comparison. The HLS hypotheses hold: 0<α<1 because n≥2, and 1<p<1/α=(n+1)/2 because p=2(n+1)/(n+3) and n>1. By [F3] applied in dimension one, ∥∫RU(s)ft−sds∥Lp′(Rn)=∥h∥Lp′(R)≤Ca21−αCα,p∥g∥Lp(R)=Ca′∥f∥Lp(Rn), with Ca′ depending on a,h,n.

5.1step 1.1step 2.1step 3.1step 4.1∎

Conclusion. Steps 1.1–4.1 show that for the endpoint exponent p=2(n+1)/(n+3) the convolution f∗μˇ lies in Lp′(Rn) with norm controlled by ∥f∥p, the constants depending only on a,h,n. The exponent identity 1/p−1/p′=2/(n+1)=1−β used above is exactly the conjugacy of p and p′.

Depends on

Used by

Dependency tree · two levels

82 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