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.
Bessel differential equations and order recurrences from the series
Statement
For , the functions in Integer-order Bessel series satisfy
For real or complex and integer , they also satisfy
In addition, .
At , the series limits are and for .
Facts & Assumptions
Given: The series definitions of Integer-order Bessel series and their compact-uniform convergence and termwise differentiability from Convergence and geometric tails for integer-order Bessel series.
Integer-order Bessel series: the coefficient of degree is for and for .
Convergence and geometric tails for integer-order Bessel series: the series and their first two derivative series converge uniformly on compact disks.
Inside its disc of convergence a complex power series is holomorphic and may be differentiated term by term: each defining complex power series may be differentiated term by term strictly inside its radius of convergence.
Proof
The convergence of the first two formal derivative series in [F2], together with the infinite radius supplied by the ratio bound in Convergence and geometric tails for integer-order Bessel series, lets [F3] justify each termwise differentiation used below. For a monomial , . The coefficient ratio in [F1] is for , with the minus sign for and plus sign for . Thus the coefficient of each power cancels in the respective differential equation.
For , reindex the series so both terms have power . For their combined coefficient is , and for it is . These are exactly the coefficients of . For the same reindexing gives the same positive combined coefficient, proving the second recurrence.
Differentiating the series termwise by [F3] and reindexing gives
Setting in the convergent series leaves only the term; every term has a positive power of when . Hence the stated limits hold.
Depends on
Used by
- Finite certified evaluation of integer-order Bessel functions Algorithm
- An arbitrarily small seed perturbation flips a later Bessel sign Example
- Adjacent initial Bessel values cannot both vanish Lemma
- Exact finite terminal-contamination error identity Lemma
- Positive discrete Wronskian for the Bessel recurrence pair Lemma
Dependency tree · two levels
6 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
- DLMF, §10.25(i), modified Bessel differential equation (standard reference, not scraped)
- DLMF, §10.2(i), Bessel differential equation (standard reference, not scraped)
- DLMF, §§10.2(i), 10.6(i), and 10.25(i) (standard reference, not scraped)
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §§2 and 4 (standard reference, not scraped)