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 and real , write using Spherical Bessel and outgoing Hankel function conventions. Then Consequently is nonincreasing in , for , and . For every fixed and all ,
Facts & Assumptions
Given: The finite-derivative outgoing Hankel convention and its radial recurrences.
Proof
Given: Integer , real , and [F1]–[F2].
Direct differentiation of gives the finite expression Indeed it holds at ; substituting this expression in gives (out-of-range coefficients are zero), and the displayed factorial formula satisfies that recurrence and the base.
Let . The radial recurrence gives . Also by [F2]. Expanding the squared modulus and eliminating the real cross term yields From and , coefficient comparison yields and, for , . The displayed factorial coefficients satisfy this: the ratios are and , whose difference gives the recurrence. At the top index , ; thus induction proves the stated sum at every degree.
Every is positive, so differentiating the finite sum gives . For , , and the degree- sum has one additional positive term. Hence decreases with and . For , [F2] now implies ; for the same bound follows by differentiating .
Differentiating the finite sum in step 1.1 cancels its derivative in , so . The lowest-power term of the positive modulus sum gives . For , factorial cancellation gives Using and , the quotient in the claim is at most .
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
- NIST Digital Library of Mathematical Functions, §§10.49–10.52 (standard reference, not scraped)
- Plamen Stefanov, Scattering and Inverse Scattering in R^n, graduate lecture notes (standard reference, not scraped)