Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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 cap and dual tube volume calculation

Example

Assume Countable Choice, let n≥2, and fix 0<c≤1/(100n−1). For δ∈(0,1] compute the two quantities whose comparison yields the Knapp condition: σ(Cδ)=∫∣y∣2≤2δ2−δ4(1−∣y∣2)−1/2 dy satisfies cnδn−1≤σ(Cδ)≤Cnδn−1, while the dual slab Tδ={ξ:∣ξn∣≤cδ−2,∣ξj∣≤cδ−1 (j<n)} has volume (2c)nδ−(n+1). Hence ∥1Cδ∥L2(σ)≍δ(n−1)/2 and, by Cap wave packets concentrate on the dual tube, ∥1Cδdσ^∥q≳δn−1−(n+1)/q for every 1≤q≤∞; comparing the two powers as δ↓0 gives the necessary condition of Knapp necessary condition for spherical L2 restriction.

Verification

Given: Countable Choice, n≥2, δ∈(0,1], the cap Cδ={ω∈Sn−1:1−ω⋅en≤δ2}, the slab Tδ with 0<c≤1/(100n−1), and the extension E of the spherical measure.

[F1] Cap and slab scales: in the graph chart ω=(y,1−∣y∣2) the cap is {∣y∣2≤2δ2−δ4}, its measure satisfies cnδn−1≤σ(Cδ)≤Cnδn−1, and λn(Tδ)=(2c)nδ−(n+1). (Spherical cap and dual slab scales)

[F2] The extension is Eg(x)=∫e2πix⋅ωg(ω) dσ(ω). Componentwise integration commutes with real parts, Re⁡eiθ=cos⁡θ, and cos⁡θ≥1−∣θ∣ by the one-Lipschitz bound and cos⁡0=1. (Fourier restriction and adjoint extension operators, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0, Sine and cosine are 1-Lipschitz on R, The Lebesgue integral is linear on L1(μ))

[F3] The comparison with the necessary condition: the extension estimate E:L2(Sn−1)→Lq holds only for q≥2(n+1)/(n−1), the threshold forced by the cap family as δ↓0. (Knapp necessary condition for spherical L2 restriction)

1.1F1

The cap integral. With the equator omitted at δ=1 as justified in [F1], the cap condition 1−ω⋅en≤δ2 is equivalent to 1−∣y∣2≥1−δ2, that is ∣y∣2≤2δ2−δ4, and the chart density is (1−∣y∣2)−1/2; hence σ(Cδ)=∫∣y∣2≤2δ2−δ4(1−∣y∣2)−1/2 dy, and by [F1] this is bounded between cnδn−1 and Cnδn−1.

1.2F1algebra

The slab volume. The slab is the box [−cδ−1,cδ−1]n−1×[−cδ−2,cδ−2], a product of n−1 intervals of length 2cδ−1 and one of length 2cδ−2; its volume is their product λn(Tδ)=(2c)n−1δ−(n−1)⋅2cδ−2=(2c)nδ−(n+1).

1.3F1F2givenalgebra

The explicit box concentration. For x∈Tδ, ∣x′∣≤n−1cδ−1≤δ−1/100, while on the cap ∣ω′∣≤2δ and ∣ωn−1∣≤δ2. Hence ∣x⋅(ω−en)∣≤(2+1)/100, since ∣xn∣≤cδ−2≤δ−2/100. In particular ∣2πx⋅(ω−en)∣<1/2. By [F2], Re⁡e2πix⋅(ω−en)≥1/2. Integrating and removing the unit-modulus factor e2πixn gives ∣E1Cδ(x)∣≥Re⁡(e−2πixnE1Cδ(x))≥σ(Cδ)/2. This proves the required bound for every allowed c, independently of the unspecified constant in the concentration lemma.

2.1F1step 1.1

The cap norm. By [F1], ∥1Cδ∥L2(σ)=σ(Cδ)1/2 satisfies cn1/2δ(n−1)/2≤∥1Cδ∥2≤Cn1/2δ(n−1)/2, so the two quantities ∥1Cδ∥2 and δ(n−1)/2 are comparable with constants depending only on n.

2.2F1step 1.2step 1.3algebra

The extension lower bound. By step 1.3 the extension of the cap data satisfies ∣E1Cδ(x)∣≥12σ(Cδ) for every x∈Tδ, so for 1≤q<∞ ∥1Cδdσ^∥q=∥E1Cδ∥q≥12σ(Cδ)λn(Tδ)1/q≥12cn(2c)n/qδn−1−(n+1)/q, and for q=∞ the same lower bound reads ≥12cnδn−1, which is the limiting value of the displayed exponent.

3.1F3step 2.1step 2.2algebra∎

The power comparison. Comparing the two powers of steps 2.1 and 2.2, the extension estimate with a constant uniform in δ requires δ(n−1)−(n+1)/q≲δ(n−1)/2 as δ↓0, that is (n−1)/2≤n−1−(n+1)/q, or equivalently q≥2(n+1)/(n−1); this is exactly the necessary condition of [F3] and the conclusion of the Knapp example.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

55 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