Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Spherical Hankel modulus and uniform radial bounds

Statement

For integers ℓ≥0 and real z>0, write hℓ=hℓ(1) using Spherical Bessel and outgoing Hankel function conventions. Then ∣hℓ(z)∣2=∑m=0ℓSℓmz−2m−2,Sℓm=(2m)!(ℓ+m)!4m(m!)2(ℓ−m)!. Consequently ∣hℓ(z)∣ is nonincreasing in z, ∣hℓ−1(z)∣≤∣hℓ(z)∣ for ℓ≥1, and ∣hℓ′(z)∣≤(1+(ℓ+1)/z)∣hℓ(z)∣. For every fixed z0>0 and all z≥z0, ∣z(hℓ′(z)−ihℓ(z))∣∣hℓ(z0)∣≤(ℓ+1)e2z0.

Facts & Assumptions

Given: The finite-derivative outgoing Hankel convention and its radial recurrences.

[F1]

Spherical Bessel and outgoing Hankel function conventions: hℓ=(−z)ℓ(z−1d/dz)ℓ(−ieiz/z).

[F2]

Spherical Bessel and outgoing Hankel recurrences solve the radial Helmholtz equation: hℓ+1=ℓhℓ/z−hℓ′ and hℓ′=hℓ−1−(ℓ+1)hℓ/z for ℓ≥1.

Proof

Given: Integer ℓ≥0, real z>0, and [F1]–[F2].

1.1F1F2algebra

Direct differentiation of h0=−ieiz/z gives the finite expression hℓ(z)=(−i)ℓ+1eiz∑m=0ℓimAℓmz−m−1,Aℓm=(ℓ+m)!m!(ℓ−m)!2m. Indeed it holds at ℓ=0; substituting this expression in hℓ+1=ℓhℓ/z−hℓ′ gives Aℓ+1,m=Aℓm+(ℓ+m)Aℓ,m−1 (out-of-range coefficients are zero), and the displayed factorial formula satisfies that recurrence and the m=0 base.

2.1F1F2step 1.1algebra

Let Fℓ=∣hℓ∣2. The radial recurrence gives hℓ+1=(2ℓ+1)hℓ/z−hℓ−1. Also Fℓ′=2Re⁡(hˉℓhℓ−1)−2(ℓ+1)Fℓ/z by [F2]. Expanding the squared modulus and eliminating the real cross term yields Fℓ+1=Fℓ−1−(2ℓ+1)Fℓ′/z−(2ℓ+1)Fℓ/z2. From F0=z−2 and F1=z−2+z−4, coefficient comparison yields Sℓ+1,0=Sℓ−1,0=1 and, for 1≤q≤ℓ, Sℓ+1,q=Sℓ−1,q+(2ℓ+1)(2q−1)Sℓ,q−1. The displayed factorial coefficients satisfy this: the ratios are Sℓ−1,q/Sℓ+1,q=(ℓ−q)(ℓ−q+1)/[(ℓ+q)(ℓ+q+1)] and Sℓ+1,q/Sℓ,q−1=(2q−1)(ℓ+q)(ℓ+q+1)/(2q), whose difference gives the recurrence. At the top index q=ℓ+1, Sℓ+1,ℓ+1=(2ℓ+1)2Sℓ,ℓ; thus induction proves the stated sum at every degree.

3.1step 2.1F2algebra

Every Sℓm is positive, so differentiating the finite sum gives Fℓ′(z)<0. For 0≤m≤ℓ−1, Sℓm/Sℓ−1,m=(ℓ+m)/(ℓ−m)≥1, and the degree-ℓ sum has one additional positive term. Hence ∣hℓ∣ decreases with z and ∣hℓ−1∣≤∣hℓ∣. For ℓ≥1, [F2] now implies ∣hℓ′∣≤∣hℓ−1∣+(ℓ+1)∣hℓ∣/z≤(1+(ℓ+1)/z)∣hℓ∣; for ℓ=0 the same bound follows by differentiating h0=−ieiz/z.

4.1step 1.1step 2.1algebra∎

Differentiating the finite sum in step 1.1 cancels its ieiz derivative in hℓ′−ihℓ, so ∣z(hℓ′−ihℓ)∣≤∑m=0ℓ(m+1)Aℓmz−m−1. The lowest-power term of the positive modulus sum gives ∣hℓ(z0)∣≥Aℓℓz0−ℓ−1. For j=ℓ−m, factorial cancellation gives Aℓ,ℓ−jAℓℓ=2jj!∏s=0j−1ℓ−s2ℓ−s≤2jj!. Using z≥z0 and m+1≤ℓ+1, the quotient in the claim is at most (ℓ+1)∑j=0ℓ(2z0)j/j!≤(ℓ+1)e2z0.

Depends on

Used by

Dependency tree · two levels

16 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