Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: 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.

Knapp rules out extension below the Tomas exponent

Statement refuted

Assume Countable Choice. Let n≥2 and let 1≤q<2(n+1)/(n−1). For every C>0 there is δ∈(0,1] such that the spherical cap data g=1Cδ∈L2(σ) satisfy ∥Eg∥Lq(Rn)>C∥g∥L2(σ). Hence no extension estimate E:L2(Sn−1)→Lq(Rn) holds below the Stein-Tomas exponent, and consequently no restriction estimate R:Lp(Rn)→L2(Sn−1) holds for p>2(n+1)/(n+3).

Facts & Assumptions

[F1]

Cap and tube scales: c′δn−1≤σ(Cδ)≤C′δn−1 and λn(Tδ)=(2cn)nδ−(n+1) for δ∈(0,1]. (Spherical cap and dual slab scales)

[F2]

Concentration: ∣Egδ(x)∣≥12σ(Cδ) for every x∈Tδ, so ∥Egδ∥qq≥(12σ(Cδ))qλn(Tδ); moreover ∥gδ∥L2(σ)=σ(Cδ)1/2. (Cap wave packets concentrate on the dual tube, The nonnegative Lebesgue integral)

[F3]

The exponent relation q<2(n+1)/(n−1) is equivalent to a:=(n−1)/2−(n+1)/q<0. Then δa=exp⁡(alog⁡δ)→∞ as δ↓0: for any M>0, 0<δ<exp⁡(−M) implies log⁡δ<−M by the inverse identity and strict monotonicity, so alog⁡δ→∞, and the exponential diverges there. The Knapp theorem also rules out the restriction endpoint p=∞. (Conjugate exponents, including the endpoint conventions, Knapp necessary condition for spherical L2 restriction, Real powers for positive bases, with the zero-base positive-exponent convention, The natural logarithm as the inverse of the exponential function, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The exponential tends to +∞ at +∞ and to 0 at −∞)

[F4]

Duality: for 1<p<∞, the restriction estimate at exponent p is equivalent to the extension estimate at q=p′ with the same constant. (Restriction and extension estimates are dual)

Counterexample

Given: Countable Choice, n≥2, 1≤q<2(n+1)/(n−1), C>0, the caps Cδ={ω∈Sn−1:1−ω⋅en≤δ2}, the boxes Tδ={x:∣xn∣≤cnδ−2, ∣xj∣≤cnδ−1 (j<n)}, where an>0 is a constant furnished by Cap wave packets concentrate on the dual tube and cn=an/n−1, the extension E of Fourier restriction and adjoint extension operators, and gδ:=1Cδ.

Proof technique: direct; evaluate the extension on the cap family and observe that the quotient of norms diverges as δ↓0 below the Tomas exponent.

1.1F1F2F3algebra

On the coordinate box Tδ, ∣(x1,…,xn−1)∣≤n−1cnδ−1=anδ−1 and ∣xn∣≤cnδ−2≤anδ−2, so this box lies in the cylindrical tube supplied by [F2]. Therefore [F1] and [F2] give ∥Egδ∥q/∥gδ∥2≥12σ(Cδ)1/2λn(Tδ)1/q≥12(c′)1/2(2cn)n/qδ(n−1)/2−(n+1)/q. This is an inequality with an explicit positive constant, and its exponent a=(n−1)/2−(n+1)/q is negative by [F3].

2.1F3step 1.1

Divergence. Since a<0, δa→+∞ as δ↓0; hence for every C>0 there is δ∈(0,1] with ∥Egδ∥q>C∥gδ∥2, which refutes the existence of any finite extension constant ∥E∥L2(σ)→Lq for q below the Tomas exponent.

3.1F1F2F3F4step 2.1

The restriction form. If a restriction estimate at some finite p>1 held with constant R, then by the duality of restriction and extension estimates the extension estimate would hold at q0=p′ with the same constant; for p>2(n+1)/(n+3) one has p′<2(n+1)/(n−1), which step 2.1 rules out. At p=∞, the Knapp theorem [F3] also rules out the estimate by its compact norm tests. Hence no restriction estimate exists for p∈(2(n+1)/(n+3),∞], as asserted.

4.1step 1.1step 2.1step 3.1∎

Conclusion. Steps 1.1–3.1 exhibit the cap family gδ whose extension norms exceed any proposed constant below the exponent 2(n+1)/(n−1), and step 3.1 transfers the failure to the restriction side for p>2(n+1)/(n+3).

Depends on

Used by

Nothing in the library uses this result yet.

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