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.
Stable special function recurrences and certified evaluation
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Average Orders Divisor Sums and Representation Counts
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Power Series and Analytic Functions
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Equivalent Forms of Completeness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outward rounded interval and ball arithmetic
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Gamma Function
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Logarithm and General Powers
- The Real Gamma and Beta Functions
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The Winding Number and the Global Cauchy Theorem
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Objective
This page defines finite, domain-specific enclosures for integer-order Bessel and modified Bessel functions, Airy functions, Fresnel integrals, the error function and a Gauss hypergeometric series, Gamma and a continued log-Gamma branch, and the scaled complementary error function. The evaluation contract separates exact mathematical error bounds from the finite interval operations that propagate them.
Each evaluator has explicit input domains, finite work and precision caps, absolute-radius success tests, and inconclusive, domain, or range outcomes. Relative certification is reported only when the returned enclosure excludes zero. Power-series branches use finite geometric tails; the erfcx expansion uses a signed finite remainder; the log-Gamma product uses an explicit tail; and the large-argument branch uses a locally proved sectorial constant.
For integer Bessel order, the page proves the series recurrences and integral representations, a composite midpoint certificate, and a finite Miller terminal-contamination identity from two exact recurrence solutions and their positive discrete Wronskian. The Miller certificate is evaluated only when all normalization and denominator intervals exclude zero. It makes no claim that increasing the terminal index forces convergence. The modified Bessel output is the scaled value on .
The spherical branch evaluates , outgoing , and their first derivatives on positive-real point interfaces or dyadic input intervals. It supplies both unscaled values and explicit scaled values; each scaled derivative is the scaled derivative of the original function. Exact finite Laurent expressions and a rational Taylor remainder certify the interval propagation. Absolute success, optional zero-excluding relative flags, and finite-cap, domain, and range outcomes follow the common result contract. The represented point need not be dyadic: a caller may propagate certified parameter intervals to arguments such as or , provided each refinement encloses the exact positive argument and terminates. The exact scattering statements retain their full real-parameter domains; numerical certification separately requires those input interfaces.
The Airy series uses ; all initial values are read against DLMF §9.2(ii). The Gauss-series branch is restricted to with not a nonpositive integer. The log-Gamma branch uses the principal-log slit plane .
The required quadrature pages provide surrounding library context. The Bessel midpoint certificates are proved locally with their exact second-derivative bounds. Outward interval, rectangle, and elementary range operations are supplied by the listed interval-arithmetic page.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Airy initial-value series
Definition
For , set and for . Define by this series with
and define by the same recurrence with
Here is Euler's integral on the right half-plane from Euler's Gamma function on the right half-plane. The standard Airy initial values are those in DLMF §9.2(ii); in particular, the power of in is in the denominator.
Certified special-function enclosure result
Definition
A certified enclosure for a real value is a nonempty closed interval with finite dyadic endpoints; for a complex value it is a nonempty closed rectangle with finite dyadic endpoints. Its radius is half its length in the real case and half its Euclidean diagonal in the complex case; is the Euclidean distance from to . An evaluator item declares whether its input is an exact dyadic point or a dyadic interval/rectangle enclosure; a successful range result contains the exact function image of every admissible point in an input enclosure. Constants not exactly dyadic must be supplied with certified enclosing intervals or rectangles.
The interval backend uses the endpoint operations in Outward-rounded interval, rectangle and ball operations; the soundness of finite arithmetic expression DAGs follows from Outward-rounded operations are inclusion-isotone and enclose DAG evaluations. Real elementary function ranges use Certified real elementary-function evaluations enclose their ranges, and complex exponential and principal-logarithm ranges use Certified complex exponential and principal logarithm enclose their ranges. An operation that returns a non-finite status supplies no finite enclosure claim.
A finite-budget evaluator receives a branch input enclosure wholly within the stated domain, absolute tolerance , optional relative tolerance , finite integer work and precision caps, and the fixed format and truncation parameters required by the backend. Its result has one of four statuses:
success: the returned enclosure contains the exact requested value and its radius is at most . If and relative tolerance was requested, the evaluator may also reportrelative_certified: trueonly when .inconclusive: the procedure exhausted a finite cap before its requested enclosure test passed.domain: the input is outside the stated branch domain, violates a stated parameter condition, or lies on a branch cut excluded by that branch.range: a certified finite enclosure cannot be represented in the requested output format; the procedure returns no unsound finite interval.
If a success enclosure contains , it still supplies the stated absolute bound, but it carries no relative-accuracy claim. The work and precision caps do not imply that success occurs for every input.
Fresnel, error, and Gauss hypergeometric series
Definition
For , define the Fresnel functions and error function by
The following local lemmas prove convergence and show that equal the standard entire integral functions with their usual normalizations.
For with and , define
Only this Gauss-series branch of is defined on this page; no value outside or across a continuation cut is implicit.
Integer-order Bessel series
Definition
For an integer and , define
These are the integer-order Bessel and modified Bessel functions used on this page. For real , the scaled modified Bessel value means . This notation does not assert a finite evaluation method or a truncation bound; those are proved separately.
Log-Gamma branch on the right half-plane
Definition
On , define
Here is the principal logarithm from Complex logarithms, the principal logarithm, and principal and multivalued complex powers, and denotes Euler's constant from The Euler-Mascheroni constant. Both and lie in the principal-logarithm domain. The local uniform convergence of this series and the identity are established by Weierstrass log-Gamma series converges to a Gamma branch ↗.
Finite harmonic enclosure for Euler's constant
Statement
For each integer , put . Euler's constant satisfies Thus is a finite enclosure for .
Facts & Assumptions
Given: An integer .
The Euler–Mascheroni constant and the harmonic asymptotic: decreases to .
Proof
For each , [F1] and [F2] give The integrand is nonnegative and at most on this interval. Therefore
Summing step 1.1 for telescopes to Let and use from [F1]. Since , the claimed two-sided bound follows.
Gamma functional equation away from the poles
Statement
For every , where is the meromorphic continuation of Euler's Gamma function.
Facts & Assumptions
Given: Euler's Gamma integral on and .
Euler's Gamma function on the right half-plane and Euler's Gamma integral converges locally uniformly on the right half-plane: Euler's integral defines on .
Euler's Gamma function is holomorphic on the right half-plane: this integral defines a holomorphic function on the right half-plane.
The Gamma functional equation: if , then .
Dedekind completeness implies the Archimedean property: for every real , some integer satisfies .
Proof
For each integer , let and define as a meromorphic function on . Its numerator is holomorphic on this half-plane by [F1] and [F2], and its denominator is a polynomial.
For every , . Applying [F3] at and cancelling the common meromorphic factor gives on the overlap . By [F4], the union of the is , so these compatible meromorphic formulas define a meromorphic continuation of Euler's Gamma function on the whole plane.
Choose large enough that ; then . Because is not a nonpositive integer, the denominator factors below are nonzero. The glued formulas give and . Multiplying the first identity by yields the second.
Spherical Bessel and outgoing Hankel function conventions
Definition
For real , let and define, for integers , The definition fixes the outgoing convention. The functions solve the radial Helmholtz equation and have the recurrence, origin, Wronskian, and infinity behavior by Spherical Bessel and outgoing Hankel recurrences solve the radial Helmholtz equation ↗.
These symbolic definitions assert no stable or certified numerical evaluation algorithm for large or .
Complementary solution for the integer Bessel recurrence
Definition
Fix real . Let and , and for every integer define
Thus is the second sequence obtained from the same order recurrence as . It is a local auxiliary solution, not the Bessel function of the second kind.
Scaled complementary error function and its moments
Definition
For real , define . For each integer , define the finite positive moment
The moments are auxiliary quantities for a finite-depth interval enclosure of . They are not the modified Bessel functions .
Log-Gamma branch on the slit plane
Definition
Let . For every , an admissible integer with exists by the Archimedean property Dedekind completeness implies the Archimedean property. Choose any such and set
where the sum is empty if and and are defined in Log-Gamma branch on the right half-plane. The next lemma proves that this value is independent of the admissible and satisfies . This is a continued branch of log-Gamma, not a separate principal .
Airy coefficient recurrence and geometric tail bounds
Statement
The coefficient recurrence in Airy initial-value series makes both series solve . In a residue class , successive nonzero terms have absolute ratio
If the ratio of each term after a chosen first omitted term is bounded by , that class's tail is at most the first omitted term's absolute value divided by . The series and their first two derivative series converge locally uniformly on .
Facts & Assumptions
Given: The coefficient recurrence, , and initial coefficients from Airy initial-value series.
Airy initial-value series: and the four initial values specify and .
Inside its disc of convergence a complex power series is holomorphic and may be differentiated term by term: a complex power series may be differentiated term by term strictly inside its radius of convergence.
Proof
Multiplying the coefficient relation in [F1] by shows that the coefficient of in is , which is the coefficient of in . At degree , the coefficients agree because ; at degree , they agree by the recurrence at . Thus the formal series satisfy .
For with , . This tends to zero and decreases in ; once all subsequent ratios are at most , summing the geometric majorant gives .
On every disk , the ratios of each residue-class term and of its first two formal derivative series tend to zero uniformly as . Applying the geometric bound from step 1.2 to each class gives locally uniform convergence of the series and differentiated series. The series have infinite radius by these bounds, so [F2] permits termwise differentiation; step 1.1 then proves the Airy equation for the sums.
Error-function series geometric tail bound
Statement
For the th term of the series in Fresnel, error, and Gauss hypergeometric series,
The displayed quotient is asserted when . At , every , so the series and every tail are zero; the corresponding division-free inequality holds there as well.
Thus, if , the tail after terms is bounded by . The series converges locally uniformly. For every piecewise- path with and , it equals where the complex line integral is defined by The complex line integral over a rectifiable path as a componentwise Riemann–Stieltjes integral. In particular, the straight-segment integral has this value, and the integral is path-independent.
Facts & Assumptions
Given: The series in Fresnel, error, and Gauss hypergeometric series.
The complex exponential by its power series and The complex exponential series converges absolutely for every complex argument: with absolute convergence for every complex .
Inside its disc of convergence a complex power series is holomorphic and may be differentiated term by term: an entire power series may be differentiated term by term.
The second fundamental theorem: if is differentiable on with and is integrable, then and Complex differentiability at a point implies continuity there and A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: the real and imaginary parts of a continuously differentiable path satisfy the fundamental theorem of calculus; continuous derivatives on a compact parameter interval are integrable.
The complex line integral over a rectifiable path as a componentwise Riemann–Stieltjes integral: for a continuous integrand on a rectifiable path, the complex line integral is defined by its four componentwise real Riemann--Stieltjes integrals.
For piecewise-C1 contours the Riemann–Stieltjes integral agrees with the parametric complex integral and the published real line integrals: on a piecewise- path, the line integral equals the sum of the parameter integrals of over its smooth pieces.
Proof
For , every term in [F1] is nonzero, so dividing successive absolute terms gives the stated ratio. At all terms vanish, and the stated division-free inequality and zero tail follow directly without division. For it is at most , so the tail is dominated by . On every disk the ratio is eventually below , proving local uniform convergence.
The series in [F1] has infinite radius by step 1.1, so [F3] gives using [F2] and the definition of the exponential series. Thus erf is an entire primitive of the stated integrand and .
Let be any piecewise- path with and . On a smooth piece, put . Complex differentiability gives with as ; set . Since , division by makes the remainder tend to zero and proves . At a piece endpoint the same limit with one-sided increments gives the relative derivative, and continuity of extends this derivative continuously to the closed piece. By [F4], the real and imaginary parts of this derivative integrate to the endpoint differences. By [F6], these parameter integrals sum to the line integral defined in [F5]. Hence This proves the segment identity and path independence without interchanging a series limit with a line integral.
Fresnel series geometric tail bounds
Statement
For the terms of and of in Fresnel, error, and Gauss hypergeometric series,
Each displayed quotient is asserted only when its denominator is nonzero. At , every , so both series and every tail are zero. The corresponding division-free inequalities obtained by multiplying by or hold for every .
Once the applicable bound is at most for all terms after a first omitted term, the absolute tail is bounded by that term divided by . Both series converge locally uniformly on . For every piecewise- path with and , they equal where the complex line integral is defined by The complex line integral over a rectifiable path as a componentwise Riemann–Stieltjes integral. In particular, these integrals are path-independent and agree with the straight-segment integrals.
Facts & Assumptions
Given: The series definitions of in Fresnel, error, and Gauss hypergeometric series.
Complex sine, cosine, hyperbolic sine, and hyperbolic cosine from the complex exponential and The exponential definitions of complex sine, cosine, hyperbolic sine, and hyperbolic cosine equal their entire power series: complex sine and cosine are given by their entire factorial power series.
Inside its disc of convergence a complex power series is holomorphic and may be differentiated term by term: an entire power series may be differentiated term by term.
The second fundamental theorem: if is differentiable on with and is integrable, then and Complex differentiability at a point implies continuity there and A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: along each compact smooth path piece, the real and imaginary parts of a continuously differentiable function integrate to their endpoint differences.
The complex line integral over a rectifiable path as a componentwise Riemann–Stieltjes integral: for a continuous integrand on a rectifiable path, the complex line integral is defined by its four componentwise real Riemann--Stieltjes integrals.
For piecewise-C1 contours the Riemann–Stieltjes integral agrees with the parametric complex integral and the published real line integrals: on a piecewise- path, the line integral equals the sum of the parameter integrals of over its smooth pieces.
Proof
If , all terms in [F1] vanish, and their division-free bounds and zero tails hold directly. For , every term is nonzero, and taking ratios in [F1] gives The omitted factors are each less than , yielding the displayed bounds.
The denominators in the bounds grow quadratically in , so the ratios tend to zero; summing the resulting geometric majorant gives the stated tail bound and uniform convergence on every disk.
The infinite-radius power series in [F1] may be differentiated termwise by [F3]. The resulting derivatives are where the last equalities use [F2].
Both and are entire primitives of their displayed integrands. For any piecewise- path from to , put on each smooth piece. Complex differentiability gives with as ; set . Since , division by makes the remainder tend to zero and proves . The same argument gives . At each piece endpoint the same limit with one-sided increments gives the relative derivatives; they extend continuously to the closed piece. By [F4], the real and imaginary parts integrate to endpoint differences. By [F6], the parameter integrals sum to the complex line integrals defined in [F5]. Since , the line integrals equal and . Hence they are path-independent and agree with the straight-segment integrals.
Gauss hypergeometric series geometric tail bound
Statement
Let , , and . If , then and for , so the series equals and every tail after is zero. Suppose instead that and neither nor is a nonpositive integer. Then every term is nonzero, and for any integer ,
For sufficiently large , ; then the tail starting at is at most . If or is a nonpositive integer, the series terminates and its tail after the last nonzero term is zero.
Facts & Assumptions
Given: The Gauss series in Fresnel, error, and Gauss hypergeometric series and its parameter restrictions.
Fresnel, error, and Gauss hypergeometric series: and (and likewise for ).
Proof
In the nonterminating case with , every term is nonzero. The Pochhammer product gives . For , , , , and . These inequalities yield the stated .
For fixed nonterminating parameters, , so a finite has ; summing the geometric majorant proves the stated tail bound. On a compact subset with , replacing by gives a uniform ratio bound below for all sufficiently large , proving local uniform convergence. If , the tail is exactly zero by the Statement. If or is a nonpositive integer, its Pochhammer product becomes zero after finitely many terms, so the series terminates and its tail after the last nonzero term is zero.
Convergence and geometric tails for integer-order Bessel series
Statement
For , , and either series in Integer-order Bessel series, the absolute term ratio is
At , the order-zero series have only the constant term and positive orders have only zero terms; in every case the tail after terms is zero. The series for and converge absolutely and locally uniformly in . If and , then the tail after terms has absolute value at most , where is the corresponding series term. The first two formal termwise derivative series also converge locally uniformly.
Facts & Assumptions
Given: An integer , , and the two power series in Integer-order Bessel series.
Integer-order Bessel series: the terms are and .
Proof
For , every term is nonzero, and cancellation of the factorials gives . This ratio decreases to . At , the series have only the possible order-zero constant term, so every tail after is zero without using a quotient.
For and the ratios are at most , so . At the same tail bound holds because the tail is zero. On each disk , put . For sufficiently large , and the nonzero-argument tail is bounded uniformly by ; at it is zero. Thus the series converge uniformly on every disk.
For derivative order , put . When , the absolute value of the formal derivative term on is at most . For the ratio equals times a factor tending to , so it tends to . The ratio test makes finite; the Weierstrass test then gives uniform convergence of each formal derivative series on the disk. The finitely many terms with have zero derivative, and a disk of radius is immediate.
Weierstrass log-Gamma series converges to a Gamma branch
Statement
For every with , the series defining in Log-Gamma branch on the right half-plane converges locally uniformly, defines a holomorphic function, and satisfies for Euler's Gamma function on that half-plane.
Facts & Assumptions
Given: and the definitions in Log-Gamma branch on the right half-plane.
The principal logarithm is the normalised holomorphic branch on the slit plane: and on the slit plane.
The second fundamental theorem: if is differentiable on with and is integrable, then and A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuously differentiable real function integrates its derivative to its endpoint difference, and a continuous derivative on a compact interval is integrable; apply componentwise to complex-valued functions of a real parameter.
Integrable functions on form a set closed under sums and scalar multiples, and and If on and both are integrable then ; and : addition commutes with the real integral, and pointwise order gives the corresponding integral bounds; apply to components of complex-valued integrands.
The complex exponential is entire and its complex derivative is itself, Complex differentiability is equivalent to real total differentiability together with a complex-linear derivative, with , or with the Cauchy–Riemann equations, and The chain rule for total derivatives: : the complex exponential is real-totally differentiable with derivative multiplication by its value, so the real-parameter derivative of is . , and the complex exponential extends the real exponential gives the addition law; Sums, scalar multiples, products and quotients: , , , and when supplies the product rule used for . The same complex-to-real derivative correspondence and total chain rule apply to the holomorphic principal logarithm along the affine real-parameter paths in step 1.1.
, , and : for , under the real-log power convention.
Euler's Gamma function on the right half-plane and Euler's Gamma integral converges locally uniformly on the right half-plane: for , , and the corresponding positive real majorant is integrable.
The exponential function is strictly increasing, The exponential function is smooth and , and Mean value theorem on a closed real interval: the real exponential is increasing, has derivative , and its mean-value estimate applies on compact intervals.
Locally uniform limits of holomorphic functions are holomorphic and their derivatives converge locally uniformly: a locally uniform limit of holomorphic functions is holomorphic.
Change of variable in an improper integral: monotone affine changes of variable preserve the corresponding proper and improper integrals; apply componentwise to the complex Beta integrand.
Proof
For with , the path lies in the principal-logarithm domain. Its derivative integrand is continuous on and is integrable by [F3]. By [F2], [F3], and the real-parameter chain rule, Since , the summand has absolute value at most . Summing this bound is uniform on every compact subset of the right half-plane. Each summand is holomorphic there, so the series converges locally uniformly and defines a holomorphic function by [F11].
For , the Beta integrals satisfy For the base formula, apply [F3] componentwise on to the primitive and let ; the lower boundary tends to since . For , differentiate on . By [F6], The derivative is continuous and integrable on this compact interval by [F3]. Applying the componentwise fundamental theorem and then letting gives ; both boundary terms vanish. The integrand identity and [F4] give . Combining these two equalities yields , proving the recurrence. Iterating it from gives All denominators are nonzero because for .
Fix with , and define for and for . For , [F5] and [F12] give so by exponential monotonicity and the addition law; the same bound holds at . On a fixed interval , for , The mean value theorem in [F10] and for give uniformly on .
Define By step 1.2 and the substitution in [F12], The real logarithm laws in [F5] preserve the stated power convention under this substitution.
By [F7], . For each real or imaginary component, the integral difference on is bounded, using [F4], by On , bounds the difference in each component by , which tends to as by [F8]. First choosing large and then large proves .
Let be the defining partial sum through and put The principal-log identity , the exponential addition law in [F6], and the formula from step 1.2 give By [F9] the second expression tends to . By step 1.1, ; continuity of the complex exponential gives . Step 2.2 gives , so Multiplying by and using the addition law proves .
Spherical Bessel and outgoing Hankel recurrences solve the radial Helmholtz equation
Statement
For the functions of Spherical Bessel and outgoing Hankel function conventions, define Then , and for , The regular-origin and outgoing-infinity normalizations are where . Their Wronskian is
Facts & Assumptions
Given: The exact finite-derivative definitions of and from Spherical Bessel and outgoing Hankel function conventions, their power-series meanings, and ordinary differentiation rules on .
Spherical Bessel and outgoing Hankel function conventions: for and integer , and .
Sums, scalar multiples, products and quotients: , , , and when and The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with : real-valued differentiable functions satisfy the product, quotient, and chain rules at limit points of their domains. For complex-valued functions of the real variable, define ; expansion into real and imaginary components then gives the same product rule. Every finite derivative used below exists on : sine and cosine derivatives alternate by [F3], the derivative of is by [F3], and derivatives of follow from the real quotient and chain rules.
The derivatives of sine and cosine are cosine and minus sine gives and ; Euler's formula: for every real gives . Componentwise differentiation therefore gives for real .
Inside its radius a real power series may be differentiated term by term, and the differentiated series has the same radius permits termwise differentiation strictly inside the radius of a real power series, and A power series converges absolutely and uniformly on every closed interval strictly inside its interval of convergence gives uniform convergence on each compact subinterval strictly inside that radius. Ratio test: gives absolute convergence and hence convergence, and gives divergence gives absolute convergence when the nonzero consecutive absolute-term ratio tends to a number below .
The sine and cosine power series converge absolutely for every real argument: the defining factorial series for sine and cosine converge absolutely at every real argument.
A function continuous on an interval whose derivative vanishes at every interior point of is constant on ; consequently two such functions with the same derivative differ by a constant: a real function continuous on an interval and differentiable with derivative zero at every interior point is constant on that interval.
In the displayed normalizations, and for , with the second product empty and equal to at . For , means for some and all sufficiently small ; for , means for all sufficiently large . A Wronskian here means .
Trigonometric identities, Machin's formula and reduced Taylor tails: the power-series sine and cosine satisfy the addition identities, , and , ; it defines . Together with [F3], this gives for real .
The factorial and the falling factorial , defined by recursion in defines , the factorial recursion , and proves every factorial is nonzero; Canonical naturals are positive and strictly increasing gives positivity of the natural factors in their real embedding. Regrouping the even and odd factors in gives .
Proof
Given: The functions and conventions in the Statement.
Write and . By [F2]–[F3], and , so . Also and , so . For any function with the required finite derivatives on , put with . Since , differentiating the product gives , hence . This recurrence applies to both functions in [F1].
The sine series gives . After applications of , the formal series is . For its successive nonzero absolute-term ratio is ; at only its constant term remains. Thus each such series has infinite radius by [F4]. Termwise differentiation and division by give the next series: the term is constant and differentiates to zero, so no negative power appears. The operation at kills ; its first remaining coefficient is by [F9]. The later powers are ; their coefficient series is bounded on by compact uniform convergence in [F4], so their sum is . This proves the stated origin expansion for .
Put and . Direct differentiation gives . Thus if , the recurrence in step 1.1 gives . Starting from step 1.1 proves both radial equations by induction. For , differentiate and substitute ; this yields . Substituting from step 1.1 and collecting terms gives .
Write , starting with . Applying the recurrence of step 1.1 and the product rule in [F2]–[F3] gives . Induction shows is a finite Laurent polynomial with exponents . If its most singular term is , the coefficient of in is ; the term is less singular. Since , this gives . Also as by [F3] and differentiability at , so the outgoing origin expansion follows. For infinity, induct on using step 1.1. The base terms are and . If , , with a finite sum of and terms for , then by [F3],[F7],[F8], and ; hence by the addition identities [F8]. For , the coefficient recurrence gives a finite form . Its leading coefficient obeys because the terms and have powers at most ; thus . The remainder and its derivative are by [F3],[F7],[F8], so the recurrence gives . Differentiating the leading terms and finite remainders also gives and .
For two solutions of , differentiation and substitution of their equations gives , hence . Applying [F6] separately to the real and imaginary parts on shows is a constant complex number. With , the expansions and derivative expansions of step 2.2 give . Indeed, Euler's formula and the addition identities give ; repeated use of and gives . Since and , the displayed limit is . The constant is therefore , which proves the Wronskian formula.
Scaled spherical Bessel evaluation on positive real arguments
Definition
Let be an integer and real. Put where the second product is empty and equals when . Using the outgoing convention of Spherical Bessel and outgoing Hankel function conventions, define The symbols and mean the scaled derivatives of the original functions, not derivatives of the scaled functions. The available targets are , , , , and these four scaled quantities; every derivative is with respect to .
An input is either (i) a closed dyadic interval , requesting an enclosure of the whole target image on , or (ii) a positive real supplied by an interface that, on each integer request , terminates and returns a closed dyadic interval containing with width at most . The intervals need not be nested. This is a representation hypothesis on a supplied input, not a claim that every positive real has such a representation. An exact positive dyadic point is the constant-interface case . A represented point need not be dyadic: arguments such as or are admitted when a caller constructs a terminating interface by rigorous interval propagation from represented parameters. Each returned box must contain the exact composed argument; a midpoint or approximate point alone is not an admissible interface. The caller's construction must retain positivity and prove termination of every requested refinement.
For each target, outputs and optional relative tests use Certified special-function enclosure result: a real enclosure is an interval, a complex enclosure is a rectangle, and its radius is half its length or half its Euclidean diagonal, respectively. Each target has an exact positive rational absolute tolerance ; an exact positive rational relative tolerance may also be requested. A relative flag may be true only when the returned enclosure excludes zero and . No relative flag is available when the enclosure contains zero.
Intermediate interval endpoints may be exact rationals. Final endpoints are rounded outward to multiples of for an integer . The mathematical procedure has no fixed exponent limit. A concrete bounded implementation must return range or inconclusive rather than claim a finite result it cannot represent. Finite caps are specified by the evaluating algorithm. A fixed nondegenerate input interval requests its whole image and is not promised arbitrarily small radius; eventual absolute success is asserted separately for represented-point inputs.
Finite certified power-series evaluation for Fresnel, erf, and Gauss functions
Definition
Inputs are a target label , an exact dyadic complex argument , and, for the Gauss-series target, exact dyadic complex parameters . Also input positive exact rational absolute tolerance , optional positive exact rational relative tolerance , a fixed exponent range , and finite positive integer caps , with . The stage cap bounds retries, bounds series terms, bounds dyadic precision, and bounds this procedure's exact interval operations, term constructions, and elementary-DAG node operations. Every nested elementary-range call shares this counter and is interrupted with inconclusive before its next operation would exceed the remaining budget. At stage , use precision and truncation index for every elementary-range subcall.
Reject an invalid target, nonpositive tolerance, invalid cap, invalid exponent range , or a Gauss input with or by returning domain. The Fresnel and error-function branches accept every finite complex . Outputs are a finite interval or rectangle with status success, or a status inconclusive, domain, or range as in Certified special-function enclosure result.
All rational and interval arithmetic uses Outward-rounded interval, rectangle and ball operations. Embed real coefficient intervals as in complex arithmetic; typed elementary DAG nodes never use an implicit real-to-complex conversion. If a required intermediate operation or output endpoint overflows its selected format, return range. If an elementary-range subcall returns a non-finite status, skip the current candidate; if no later stage succeeds, return inconclusive. The same candidate-skip rule applies to every other non-finite arithmetic status, including split-domain or entire when a rounded divisor contains zero; never use such a status as a finite interval. Charge each exact arithmetic operation, coefficient term, rounding, and elementary-range call against ; before an operation that would exceed , return inconclusive.
At each stage, form , a certified dyadic interval containing , only when . For , form and by exact rational arithmetic. The arctangent series and geometric-tail argument in Range-reduced exponential, logarithm and arctangent series have certified tails gives . Combine these intervals as , then round the resulting endpoints outward to the selected format at precision . The Machin identity in Trigonometric identities, Machin's formula and reduced Taylor tails proves . If this conversion is non-finite, skip this stage for the selected Fresnel or erf target. For the Gauss-series target, omit and all square-root calls.
Only when , call Certified range evaluation for elementary real and complex functions on the one-node real DAG with the same exponent range and precision , and truncation index . If it returns a finite interval , continue only if ; otherwise skip this stage. This call encloses by Certified real elementary-function evaluations enclose their ranges. The branches use directly and do not call square root. For a complex rectangle , write ; this rational quantity bounds the modulus of every point in .
At each stage , form the following candidate for the selected target.
- For , sum its defining terms from Fresnel, error, and Gauss hypergeometric series by interval arithmetic, using for . Let be the first omitted term and set If , enlarge the partial-sum rectangle in both coordinates by ; otherwise skip this stage.
- For , sum its first defining terms using , let be the first omitted term, and set If , enlarge the partial-sum rectangle in both coordinates by ; otherwise skip this stage.
- For erf, use the interval from the single square-root call above for , sum the first defining terms, and let be the first omitted term. Set . If , enlarge the partial-sum rectangle in both coordinates by ; otherwise skip this stage.
- For the Gauss series, compute its terms by and using outward interval operations. The exact is nonzero by the domain check, but its rounded enclosure may contain zero; in that case skip this candidate before division. If or is a nonpositive integer, let be one more than the smaller absolute value of those nonpositive integer parameters. If , sum exactly through and use zero tail. Otherwise put If , skip this stage before forming a quotient. Otherwise set If , sum , let be the first omitted term, and enlarge the partial-sum rectangle in both coordinates by ; otherwise skip this stage. The geometric bound in Gauss hypergeometric series geometric tail bound applies because dominate the corresponding complex moduli.
Round each candidate's final endpoints outward to precision . Return success at the first stage where its radius is at most . If relative tolerance was requested, set relative_certified to true exactly when zero is excluded and the contract's relative-radius inequality holds; failure of that relative test does not prevent absolute success. If no stage produces a passing candidate, return inconclusive. The finite stage loop and the finite elementary-range calls define the procedure completely.
The Airy Ai function has a negative real zero
Statement
The real Airy function has at least one zero on the negative real axis.
Facts & Assumptions
Given: The Airy series in Airy initial-value series.
Airy coefficient recurrence and geometric tail bounds: is entire and satisfies .
Euler's Gamma function on the right half-plane: for real , .
The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sums, scalar multiples, products and quotients: , , , and when , and The derivatives of sine and cosine are cosine and minus sine supply the chain, product, and sine and cosine derivative formulas used in the real-variable argument.
Proof
By [F3], , so [F2] gives ; in particular, is not the zero function. Put . By [F1] and the chain rule in [F4], for real .
Suppose has no zero on . Continuity gives a constant sign; replace by if necessary so that there. Set . The product rule and sine and cosine derivatives in [F4], together with the equation in step 1.1, give on this interval.
But and , contradicting that is nonincreasing. Therefore has a zero in , and has a zero in .
Integral representations and a range bound for integer Bessel functions
Statement
Facts & Assumptions
Given: Integer , real , and the series definitions of Integer-order Bessel series.
Integer-order Bessel series: and are the absolutely convergent power series with the displayed factorial coefficients.
Convergence and geometric tails for integer-order Bessel series: the defining and series converge absolutely and locally uniformly; their coefficients are the factorial coefficients used in the generating-function calculation below.
The complex exponential by its power series and The complex exponential series converges absolutely for every complex argument: the exponential is its absolutely convergent factorial power series for every complex argument.
The Cauchy product of two absolutely convergent complex series converges absolutely to the product of their sums: the Cauchy product of two absolutely convergent complex series converges to the product of their sums. Every absolutely convergent complex series converges, and rearrangements preserve its sum permits regrouping the resulting absolutely convergent terms by their Laurent exponent.
, and the complex exponential extends the real exponential, Euler's formula: for every real , and Trigonometric identities, Machin's formula and reduced Taylor tails: the exponential addition law, Euler's formula, and the trigonometric periodicity and reflection identities hold.
A uniform limit of Riemann-integrable functions is Riemann integrable, and its integral is the limit of their integrals: a uniform limit of integrable real functions on a compact interval may be integrated by taking limits; apply separately to real and imaginary parts. The second fundamental theorem: if is differentiable on with and is integrable, then and A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion give the usual integral and endpoint rules for the continuous functions below.
Change of variable in an improper integral: the proper affine substitution preserves the integral after reversing the endpoints.
Proof
For fixed and , both exponential series in have absolute tails bounded independently of , by [F3]. Their product therefore has an absolutely and uniformly convergent double series on the unit circle; grouping its terms by the Laurent exponent is legitimate by [F4] and the absolute bound. For , the coefficient of is by [F1]. Replacing the minus sign in the first exponential by a plus sign gives the coefficient
For every integer , direct integration of the real and imaginary parts gives For , the sine and cosine antiderivatives and their -periodicity from [F5] give zero. Integrating each finite Laurent partial sum against therefore extracts exactly its coefficient. The uniform convergence in step 1.1 permits passage to the full integral by [F6], applied componentwise. Consequently each coefficient is where is the corresponding generating function.
For real , Euler's formula in [F5] gives and . In the first coefficient integral, the real part is ; the substitution on , justified by [F7], shows that the imaginary parts cancel and the real parts on the two half intervals agree. Thus the coefficient is . For the second integral, and the sine Fourier terms cancel under the same substitution, giving . This proves both representations.
For , every term in the series for is nonnegative, so . The integral gives , since .
Binet integral identity for the right-half-plane log-Gamma branch
Statement
For , let be the branch in Log-Gamma branch on the right half-plane. Define Then the absolutely convergent integral satisfies On each unit interval, for ; hence .
Facts & Assumptions
Given: and an integer tending to infinity in the proof.
Log-Gamma branch on the right half-plane: is defined by
Weierstrass log-Gamma series converges to a Gamma branch: the defining series converges locally uniformly on the right half-plane.
Stirling's formula for factorials: as through positive integers.
The principal logarithm is the normalised holomorphic branch on the slit plane: on the slit plane.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion and The second fundamental theorem: if is differentiable on with and is integrable, then : continuous functions on compact intervals are integrable, and an integrable derivative integrates to its endpoint difference; the real statement applies to real and imaginary parts of a complex-valued path.
If are differentiable on with integrable, then , Changing an integrable function at finitely many points changes neither its integrability nor its integral, and For : is integrable on if and only if it is integrable on and on , and then ; with the oriented form for arbitrary : on each unit interval, integration by parts applies to the continuous polynomial restrictions of ; changing the derivative integrand at the finitely many endpoints does not change its integral, and the panel integrals add.
The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: the real logarithm is continuous on and satisfies .
The natural logarithm as the inverse of the exponential function and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: writing gives , and for positive .
Proof
Define . For with integer and , . Each full unit interval has integral zero, and its partial integral is . Therefore , , and .
On , and [F7] gives since . Summing over gives Because and , the right-hand side converges absolutely as .
On each , write . By [F5] the function has derivative ; its derivative is continuous and integrable on the compact interval by [F6]. Applying [F6] and summing the resulting endpoint differences yields The coefficient of each internal in the endpoint sum is . For , because is real and multiplication by it preserves the principal argument; [F9] gives . These identities give the displayed form.
Add to the finite sum in step 2.2. By [F1]--[F3], the resulting left side converges to , while
Taking logarithms in [F4] is valid by continuity [F8]. The laws [F9] and give At , since , this becomes The logarithm estimate follows by integrating on ; the difference from is bounded by . Also [F3] gives . Finally, for fixed and , since and lie in the right half-plane, so . By [F5] and [F6], for ; here when . Therefore .
Substitute these asymptotics into step 3.1. The coefficients of cancel, and cancels the in the factorial term, leaving By step 2.1, the limit is the absolutely convergent integral of . This is the claimed identity.
Moment recurrence for the scaled complementary error function
Statement
For and integer , the moments in Scaled complementary error function and its moments are finite and positive. They satisfy
With , it follows that
Facts & Assumptions
Given: Real , integer , and the moment and scaled-error definitions in Scaled complementary error function and its moments.
Error-function series geometric tail bound: for real , .
If are differentiable on with integrable, then : on compact intervals, if its hypotheses hold, . In particular the derivatives used below are integrable on each compact interval because they are continuous.
Change of variable in an improper integral: an admissible increasing substitution preserves convergence and value of an improper integral.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: each continuous real derivative on a compact truncation interval is Riemann integrable; apply to real and imaginary parts for the complex-valued integration-by-parts formulas.
The exponential function is smooth and , Sum, product, quotient, and chain rules from difference quotients: the displayed real functions are smooth on their stated domains, and their derivatives follow by the product, power and chain rules; iterate these rules for the finite higher derivatives used below.
Proof
The integrands in [F1] are positive. Near they are bounded by . For , ; the substitution and [F6] bound the tail by , which is finite by the Gamma integral convergence in [F8]. The integrands are continuous on every compact truncation interval, so their proper integrals there exist by [F7]. Thus each is finite; it is strictly positive because its integrand is positive on .
Apply [F5] on to and to . These functions and their derivatives are continuous on the compact interval, so all derivatives required by [F5] are integrable by [F7]; the complex-valued integration-by-parts statement is applied componentwise. The boundary terms tend to at ; for they also tend to at , while for the lower boundary tends to . For the infinite endpoint, choose an integer ; the exponential series gives , so . Passing to the limits in the integration-by-parts identities gives and, for , .
Divide the recurrence with index by . Since and , this gives and hence . Positivity gives .
The integrand in [F4] is even, so . Subtract the integral identity in [F3] and use the definition in [F2] to get The increasing substitution from [F6] then gives The first identity in step 2.1 gives ; substitution proves .
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.
Explicit tail bound for the log-Gamma product series
Statement
For and integer , the tail in the series for after its first summands satisfies
Facts & Assumptions
Given: and an integer .
Log-Gamma branch on the right half-plane: the summands are .
The principal logarithm is the normalised holomorphic branch on the slit plane: on the slit plane.
The second fundamental theorem: if is differentiable on with and is integrable, then : the derivative of a continuously differentiable complex-valued path integrates to its endpoint difference, by applying the real theorem to each component.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous function on is Riemann integrable.
Proof
Put , so . The integrand in the path formula is continuous and integrable by [F4]. By [F2], [F3], and the chain rule, Since , this summand has modulus at most .
The decreasing function satisfies . Summing step 1.1 gives . Since under , this is no larger than the stated bound.
Shifted log-Gamma branch is independent of the shift
Statement
For every , the value in Log-Gamma branch on the slit plane is independent of the integer with , is holomorphic on , and satisfies .
Facts & Assumptions
Given: and the branch definitions Log-Gamma branch on the right half-plane and Log-Gamma branch on the slit plane.
Weierstrass log-Gamma series converges to a Gamma branch: and is holomorphic for .
The Gamma functional equation: if , then .
Gamma functional equation away from the poles: the same functional equation holds when is not a nonpositive integer.
The principal logarithm is the normalised holomorphic branch on the slit plane: is holomorphic on the slit plane and . Complex logarithms, the principal logarithm, and principal and multivalued complex powers and Every nonzero complex number has a unique polar form with and give for positive real .
A differentiable map on a connected open Euclidean set has zero derivative exactly when it is constant: a holomorphic function with zero derivative on a connected open domain is constant.
, and the complex exponential extends the real exponential and The complex exponential by its power series: and . In particular, is the reciprocal of .
The natural logarithm as the inverse of the exponential function and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: on the positive reals, is the inverse of and .
Real and imaginary parts, complex conjugation, and modulus, Real and complex modulus product and triangle inequalities, and Every path-connected space is connected, and every path component lies inside a component: the right half-plane is open, since if and , then . For in it, has positive real part and , which proves continuity by the metric definition. The half-plane contains and is open and connected.
Complex differentiability is equivalent to real total differentiability together with a complex-linear derivative, with , or with the Cauchy–Riemann equations: under , a complex-differentiable function is totally differentiable and its real derivative is multiplication by its complex derivative; in particular, implies .
Proof
For , the function is holomorphic by [F1]. The functional equation [F2], branch identity [F1], and from [F4] give . By [F7], . Differentiating this identity by [F5] gives , hence . By [F10], the real derivative of vanishes; the right half-plane is nonempty, open, and connected by [F9], so [F6] makes constant there. For positive real , all three terms are real by the defining series for and the real logarithm, so [F8] and imply . Therefore throughout the right half-plane.
If are both admissible shifts, then has positive real part, as do . Iterating step 1.1 gives so the definition is independent of . Locally can be fixed, making the formula holomorphic; independence makes these local formulas agree.
Exponentiating the formula with any admissible gives by [F1]. None of the factors vanishes because . Iterating [F3] downward therefore identifies this quotient with .
Finite exact-interval evaluation of scaled spherical Bessel values
Definition
Inputs are those of Scaled spherical Bessel evaluation on positive real arguments, a nonempty finite list of valid targets, finite exact positive rational absolute tolerances, optional exact positive rational relative tolerances, and finite integer caps . is the maximum exact-arithmetic work count, the maximum stage and represented-point interface index, the maximum Taylor degree, and the maximum final dyadic precision. A Gaussian rational is with . A Laurent polynomial is a finite sum with integer exponents and Gaussian-rational coefficients; its formal derivative uses . An expression graph below is a finite directed acyclic graph of exact rational arithmetic operations.
Factorials are those of The factorial and the falling factorial , defined by recursion in ; they are nonzero by that definition and Canonical naturals are positive and strictly increasing, so every displayed factorial denominator is defined. For a rational , denotes the least integer greater than or equal to , computed by exact integer division.
Reject an invalid order, target, tolerance, cap, or interval input not contained in with domain. For a represented point, an interval returned by the input interface may meet zero; such a stage is skipped and a later interface index is tried.
Construct Laurent polynomials by for . With and denoting the sine and cosine input enclosures, form the unscaled outputs Form the scaled outputs Collect like Laurent powers exactly; in particular cancel negative powers in the scaled value when they cancel algebraically. A remaining in the scaled derivative is evaluated only on positive input intervals.
For real intervals use exact rational endpoint hulls: , , and when . For complex rectangles, apply these real interval operations to the real and imaginary components of . Thus interval arithmetic encloses every pointwise sum and product; division is only by a positive power of the positive argument or by a positive integer constant. Compute powers, factorials, and rational endpoints by finite exact arithmetic.
At a positive current box , choose with and form the rational interval polynomial and rational tail The interval power is repeated complex-rectangle multiplication. Enclose by and by . Evaluate each requested output graph with these leaves and , and round each final endpoint outward to the grid .
Use the following deterministic finite search. Charge the Laurent recurrence, graph construction, and coefficient collection to the work counter as they are performed. For stages , first take the fixed interval unchanged, or call the represented-point interface at index . Skip a represented-point stage unless its returned interval has . Set and . If or , stop with inconclusive. Evaluate all requested graphs and the displayed using the work counter: each exact rational or Gaussian-rational arithmetic operation or comparison, each Taylor term, each endpoint-rounding operation, and each interface call costs one unit. If the next operation would exceed , stop with inconclusive before performing it. If the output format cannot represent a certified endpoint, return range with no finite claim. If every requested target has radius at most its absolute tolerance, return success; for each optional relative tolerance, set its flag true exactly when the enclosure excludes zero and the relative test in the contract passes. A failed relative test does not prevent absolute success. If no stage succeeds before a cap or the search ends, return inconclusive. No floating-point recurrence is used.
Composite midpoint enclosure for the integer Bessel integral
Statement
Let be an integer, , , and . Put and . Then
This is the local composite-midpoint certificate for the Bessel integral; it does not certify floating-point summation unless each operation is enclosed.
Facts & Assumptions
Given: Integer , real , and positive integer .
Taylor's Lagrange remainder follows from repeated Rolle steps: for a function, the first-order Taylor remainder at is for some point between and .
Sum, product, quotient, and chain rules from difference quotients, The derivatives of sine and cosine are cosine and minus sine: the displayed real functions are smooth on their stated domains, and their derivatives follow by the product, power and chain rules; iterate these rules for the finite higher derivatives used below.
Proof
Write , so and . Differentiating gives .
On a panel centered at with half-width , [F2] gives . Integrating over cancels the odd term and bounds the panel error by .
Summing the panel errors gives . Divide by and use [F1] to obtain the stated bound.
Adjacent initial Bessel values cannot both vanish
Statement
For every real , and are not both zero.
Facts & Assumptions
Given: A real number and the integer-order Bessel functions from Integer-order Bessel series.
Bessel differential equations and order recurrences from the series: is entire, satisfies , has , and .
Identity theorem for holomorphic functions: two holomorphic functions on a complex domain that agree on a set with an interior accumulation point agree throughout that domain.
Proof
Suppose . By [F1], . Expand the entire function about , . The coefficient of in the differential equation in [F1] is with . Since and , induction gives for all , so vanishes on a disk about .
Apply [F2] to and the zero function on the connected domain . It follows that is identically zero, contradicting from [F1]. Thus and cannot both vanish.
Signed finite remainder for the erfcx asymptotic expansion
Statement
For real and integer , put
Then
This is a finite signed remainder bound, not a convergence assertion for the asymptotic series.
Facts & Assumptions
Given: , integer , and the definitions of erfcx and in Scaled complementary error function and its moments.
Change of variable in an improper integral: a valid increasing substitution preserves convergence and value of an improper integral.
Taylor's Lagrange remainder follows from repeated Rolle steps: the Taylor remainder after degree of a function is for some between the expansion point and .
Gamma at the positive integers: for integer .
Continuity and derivatives of positive-base real powers, Sum, product, quotient, and chain rules from difference quotients: the displayed real functions are smooth on their stated domains, and their derivatives follow by the product, power and chain rules; iterate these rules for the finite higher derivatives used below.
Proof
In the integral for , set . Its derivative for , so [F2] applies. Then , , and
Direct differentiation gives . Apply [F3] to at to obtain because for .
Substitute in step 1.2 and integrate against . By the Gamma integral and [F4], by [F5] and [F4]. The signed remainder is nonnegative after removing and is at most . The identity follows by separating even and odd factors in . This gives the stated bound.
Finite continued-fraction enclosure for erfcx
Statement
Fix real and integer . Set , and for define
Then for every , where is the moment ratio from Moment recurrence for the scaled complementary error function. Therefore
Each finite depth gives a valid enclosure; no convergence or shrinking-width claim as grows is made.
Facts & Assumptions
Given: , integer , and the intervals defined above.
Proof
The upper bound in [F1] puts in . The map is positive and decreasing for . Hence, if , then ; by [F1] the middle term is . Backward induction gives down to .
The function is positive and decreasing on . Applying it to the interval and using [F2] gives the stated erfcx enclosure. Every step used a finite number of inclusions, so the enclosure is valid at this regardless of whether its width decreases with larger .
Composite midpoint enclosure for the scaled modified Bessel integral
Statement
Let be an integer, , , , and Then The bound certifies the exact midpoint integral. Floating-point summation is certified only if its operations are enclosed separately.
Facts & Assumptions
Given: Integer , real , and integer .
Taylor's Lagrange remainder follows from repeated Rolle steps: for a function, the first-order Taylor remainder at is for some point between and .
The exponential function is smooth and , Sum, product, quotient, and chain rules from difference quotients, The derivatives of sine and cosine are cosine and minus sine: the displayed real functions are smooth on their stated domains, and their derivatives follow by the product, power and chain rules; iterate these rules for the finite higher derivatives used below.
Proof
Put . Since , we have on . Differentiation gives and . Thus and . For ,
On each panel centered at , [F2] bounds by , where by step 1.1. Integrating over cancels the odd linear term and bounds that panel's error by .
Summing the panel errors gives . By [F1], ; dividing by proves the claim.
Explicit sectorial remainder bound for the right-half-plane log-Gamma branch
Statement
Fix and with . For the branch from Log-Gamma branch on the right half-plane, Binet integral identity for the right-half-plane log-Gamma branch gives where . Then For , the bound is . The relative error after exponentiating the three main terms is at most .
Facts & Assumptions
Given: and .
Binet integral identity for the right-half-plane log-Gamma branch: the exact branch identity and its remainder representation hold, with on each unit interval.
Signs, monotonicity intervals, and ranges of sine and cosine and Trigonometric identities, Machin's formula and reduced Taylor tails: cosine decreases on and , hence for .
Trigonometric identities, Machin's formula and reduced Taylor tails: the cosine addition identity and give and .
Proof
The formula in [F1] defines for integer and . Hence for every .
Write , with , and put . By [F2], since and by [F3]. The difference between the last expression and is by [F4]. Thus .
Applying steps 1.1 and 1.2 to the remainder in [F1] gives For any complex , by the exponential series; apply this with .
Soundness of the finite Fresnel, erf, and Gauss-series enclosures
Statement
If Finite certified power-series evaluation for Fresnel, erf, and Gauss functions returns success for
, or a Gauss-series value on its stated domain, its
returned interval or rectangle contains that exact function value and passes
the requested absolute-radius test. A relative certificate is valid only when
the enclosure excludes zero and the contract's relative-radius test passes.
Every execution with finite caps terminates. The theorem makes no claim of success for every valid input.
Facts & Assumptions
Given: A successful return of the procedure in Finite certified power-series evaluation for Fresnel, erf, and Gauss functions with a sound outward interval backend.
Outward-rounded interval, rectangle and ball operations and Outward-rounded operations are inclusion-isotone and enclose DAG evaluations: every finite interval operation encloses its exact rational or interval result.
Certified range evaluation for elementary real and complex functions is the finite subroutine used for sqrt-pi range evaluation; its finite real and complex outputs are sound by Certified real elementary-function evaluations enclose their ranges and Certified complex exponential and principal logarithm enclose their ranges.
Finite certified power-series evaluation for Fresnel, erf, and Gauss functions: a successful series branch encloses its finite partial sum and enlarges it by the applicable geometric tail bound before applying the radius test.
Fresnel, error, and Gauss hypergeometric series: the four functions on the stated branches are represented by the specified series.
Fresnel series geometric tail bounds: the Fresnel tail bound contains the exact omitted series tail when the tested ratio is below .
Error-function series geometric tail bound: the tail bound contains the exact omitted series tail when the tested ratio is below .
Gauss hypergeometric series geometric tail bound: the Gauss tail bound contains the exact omitted series tail when and ; terminating parameter cases have zero tail after their last nonzero term.
Certified special-function enclosure result: the radius and relative
tests specify exactly which claims accompany success.
Proof
In each nonterminating success branch, the exact value is the sum of the partial series and its omitted tail by the series definitions in the algorithm contract. The relevant lemma among [F3], [F4], and [F5] bounds the modulus of that tail by the radius used to enlarge the partial-sum enclosure. In a terminating Gauss branch [F5] makes the tail exactly zero.
The outward interval backend encloses the exact arithmetic partial sums by [A1]. Every elementary-range subcall used for constants or interval images is sound by [A2]. Adding the symmetric tail enlargement therefore gives an interval or rectangle containing the exact full value.
The procedure reports success only after the containing enclosure passes the absolute-radius test; its relative flag is set only under the stated zero-exclusion and relative-radius conditions. These are exactly the certificate claims in [F6]. If no candidate passes, the procedure returns inconclusive; no universal success is asserted.
The outer stage count is finite, each partial sum has at most the capped number of terms, and each elementary-range call has a finite DAG, format, and truncation index. Thus every capped execution terminates.
Soundness and eventual absolute precision for spherical Bessel enclosures
Statement
Every success output of Finite exact-interval evaluation of scaled spherical Bessel values encloses each requested scaled or unscaled value, or the entire requested image for an interval input, and satisfies its absolute-radius test. Its relative flags satisfy Certified special-function enclosure result. Every capped execution terminates. For each fixed order, positive represented real point, finite nonempty target list, and positive rational absolute tolerances, some finite work, degree, interface-index, and precision caps permit absolute success. The same holds for an exact positive dyadic point. For a nonzero requested target, any positive rational relative tolerance can also eventually be certified by rerunning with sufficiently small positive rational absolute tolerances and sufficiently large finite caps; no relative certification is promised at a zero. The theorem gives no uniform floating-point condition number, bit-complexity bound, success guarantee for fixed small caps, or scattering uniqueness result.
Facts & Assumptions
Given: An integer , a nonempty finite list of targets, positive rational absolute tolerances, optional positive rational relative tolerances, and either a positive dyadic interval or a positive real point with the terminating interval interface specified in Scaled spherical Bessel evaluation on positive real arguments.
Spherical Bessel and outgoing Hankel function conventions defines and for integers and real .
Sine and cosine defined by their real power series and The complex exponential by its power series define sine, cosine, and exponential by their factorial-denominator power series. The complex exponential series converges absolutely for every complex argument states that the exponential series is absolutely convergent for every complex argument. The factorial and the falling factorial , defined by recursion in defines , for , and proves ; Canonical naturals are positive and strictly increasing states each positive natural has positive real embedding.
Scaled spherical Bessel evaluation on positive real arguments fixes the positive-real point/interval modes, all eight targets, their scaling conventions, and the absolute/relative meanings. In particular, a scaled derivative is the scaled derivative of the original function.
Finite exact-interval evaluation of scaled spherical Bessel values uses exact rational Laurent expressions, interval operations, the Taylor polynomial , the error bound , final outward rounding, and finite caps as stated in its Definition.
Sums, scalar multiples, products and quotients: , , , and when supplies the real product and quotient rules, and The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with supplies the real chain rule at limit points. For complex-valued functions of a real variable these rules apply componentwise to real and imaginary parts.
The derivatives of sine and cosine are cosine and minus sine gives and . Euler's formula: for every real gives for real , so componentwise differentiation gives .
The Cauchy product of two absolutely convergent complex series converges absolutely to the product of their sums: if two complex series converge absolutely, their Cauchy product converges absolutely and its sum is the product of their sums.
Ratio test: gives absolute convergence and hence convergence, and gives divergence: a real series with nonzero terms converges absolutely when the successive absolute-term ratio tends to a number less than .
Certified special-function enclosure result: a successful real enclosure is an interval and a complex enclosure a rectangle; their radii are half the length and half the Euclidean diagonal, respectively. success requires the exact requested image to be enclosed and the radius to be at most the absolute tolerance. A relative flag can be true only when zero is excluded and ; inconclusive, domain, and range make no finite-value claim.
For the sequence is null, and for the sequence diverges to : if , then as the natural index ; in particular .
Proof
Given: The order, targets, tolerances, and input mode in the Statement.
For , differentiation as in [F1] gives . Starting from with , the derivative formula gives exactly the algorithm's . Starting from with , the componentwise product rule [F5]–[F6] gives and exactly the algorithm's recurrence for . Euler's identity [F6] identifies the algorithm's with . Thus represent , respectively.
The two series for and are absolutely convergent by [F2], so [F7] identifies their product with the sum of the Cauchy-product coefficients. For total degree , its coefficient is , where . For , combining over the denominator and using and gives . For or , omit the summand whose index is outside ; the remaining summand equals the left side by . Splitting the finite sum for with this identity and reindexing its second part gives for every , while . The factorials and are nonzero by [F2], so these divisions are defined. Hence the product series has constant coefficient and every positive-degree coefficient , so .
Fix a positive input box and choose with . For every , the first omitted absolute exponential-series term is at most . Each subsequent ratio is at most , so the sum of the omitted terms is at most . Thus the real and imaginary parts of , enlarged by , contain and . Exact rational interval addition and multiplication enclose pointwise addition and multiplication by their endpoint-hull formulas; inversion of a positive interval is . Evaluation over the finite graph and outward rounding therefore preserve containment of every graph value on .
Each cap bounds its corresponding loop or finite expansion. The Laurent graph for fixed is finite; each rational operation and each terminating represented-point interface call takes finite work, and every cap exhaustion has an explicit status return. Therefore every capped execution terminates, including one that never obtains a positive point box or never passes its requested tests.
Fix a positive represented point . By [F10], choose a sufficiently large index that . Write ; the interface width bound gives . For all , , because contains , has width at most , and while . Thus eventually and , since the successive ratios are eventually at most . Put . For , positivity of makes repeated complex-rectangle multiplication of exact along one coordinate: its th power is up to the sign absorbed by the interval endpoints. Therefore by factoring the difference of powers. Each degree- term in has component width at most , so each component of the polynomial interval has width at most . The terms of the last series are nonzero because , and their successive ratio is ; [F8] makes its sum finite, say . With the Taylor tail added, the sine and cosine enclosure widths tend to zero.
Multiplying the unscaled expressions of step 1.1 by the scales in Scaled spherical Bessel evaluation on positive real arguments gives the four scaled identities. For and , cancel by step 1.2; the derivative scale acts on the original derivative as defined, not on . Starting with , if has exponents , then and have exponents at least , while has exponents at least ; induction gives only exponents in . Thus is a polynomial and has at worst exponent , which is well-defined on the positive input domain.
The remaining expression graph is fixed and finite. On , each reciprocal has width and is bounded. Sums of bounded intervals with widths tending to zero also have widths tending to zero; for bounded real intervals , . Applying these bounds to the real component operations in each complex rectangle proves by induction that every output rectangle or interval has width tending to zero. By [F10], the outward rounding increment also tends to zero, so all output radii tend to zero. Thus every positive rational absolute tolerance is passed at some finite stage, and the finite work through that stage gives finite sufficient caps. Constant interfaces prove the exact positive-dyadic case as well.
By steps 1.1 and 2.1 the graph roots are the exact requested targets. Step 1.3 encloses the sine and cosine leaves for every admissible argument; induction through the finite graph, using the interval formulas in [F4], encloses every sum, product, reciprocal, and requested output value. Outward endpoint rounding preserves these containments. The success-radius and relative-flag tests are precisely the contract in [F9], so every finite success is sound for point or whole-interval input.
If a requested target has value , any sound enclosure of step 3.1 has diameter and contains , so . Eventually and , giving any requested positive rational relative tolerance along the refined sequence. The algorithm may already have stopped with absolute success before that relative test passes. To obtain the relative flag, rerun with successively smaller positive rational absolute tolerances and increasing finite caps: step 2.2 supplies a successful finite capped run for each such tolerance, and its returned radius is bounded by that tolerance. For a finite list of nonzero requested targets, sufficiently small absolute tolerances make all requested relative flags true. If , every sound enclosure contains zero and no relative flag is available. A fixed interval input encloses its whole image, which may have positive diameter, so the point-mode limiting argument asserts no arbitrary-radius guarantee there.
Finite certified evaluation of the scaled complementary error function
Definition
Input an exact dyadic real , positive rational absolute tolerance , optional positive rational relative tolerance , a fixed exponent range , and finite positive integer caps , with . Here bounds stages, the continued-fraction depth, the asymptotic truncation, the dyadic precision, and the exact interval operations, terms, and subroutine calls performed by this procedure. Reject nonpositive tolerances, invalid caps, , or with domain. At stage , use , , precision , and truncation index for elementary-range calls. Outputs and status meanings are those of Certified special-function enclosure result.
All rational and interval arithmetic uses Outward-rounded interval, rectangle and ball operations. Charge every exact arithmetic operation, range-evaluator node operation, term, rounding, and loop update to the shared counter . Interrupt any nested elementary-range call with inconclusive before its next operation would exceed the remaining budget. Return inconclusive before any local operation would exceed . A final endpoint overflow returns range. A non-finite required arithmetic operation or elementary-range subcall makes its candidate unavailable; if neither candidate can be formed, the current stage is inconclusive and later stages may still be tried.
For each stage , compute , a finite dyadic interval containing , as follows. For , form and exactly; the arctangent-tail lemma gives . Combine these intervals by and round outward to the selected format at precision . The Machin identity is supplied by Trigonometric identities, Machin's formula and reduced Taylor tails; the arctangent series and its geometric-tail argument are in Range-reduced exponential, logarithm and arctangent series have certified tails. If the interval conversion is non-finite, skip the stage. Call Certified range evaluation for elementary real and complex functions on the real one-node DAG , using exponent range , precision , and truncation . If this call is not finite or its output does not have positive lower endpoint, skip this stage. Otherwise encloses by Certified real elementary-function evaluations enclose their ranges.
Form the continued-fraction candidate as follows. Set . For , set by outward interval operations. Apply the decreasing map to , evaluating with , to obtain a candidate interval . The finite-depth containment lemma Finite continued-fraction enclosure for erfcx makes a valid enclosure for every .
If , also form the asymptotic candidate. Evaluate with and exact factorial/rational interval arithmetic. Write the computed sum interval as and take a nonnegative outward upper endpoint for the remainder bound . Set when is even and when is odd, rounding the final endpoints outward. The signed remainder lemma Signed finite remainder for the erfcx asymptotic expansion makes a valid enclosure.
If both candidates are finite, intersect them when the intersection is nonempty; if it is empty, discard the stage. If only one is finite, use that candidate. Round the selected final endpoints outward to precision . Return success at the first stage whose radius is at most . Set relative_certified to true exactly when relative tolerance was requested, the interval excludes zero, and the contract's relative-radius test passes; a failed relative test does not prevent absolute success. If no stage passes before the finite caps, return inconclusive.
Finite certified evaluation of Gamma and a continued log-Gamma branch
Definition
Inputs are a finite dyadic complex rectangle , a target label or , positive exact rational absolute tolerance , optional positive exact rational relative tolerance , a fixed dyadic format precision and exponent range , fixed integer elementary truncation index , finite positive integer work cap , and integer precision cap . The target is the continued branch in Log-Gamma branch on the slit plane. Reject an invalid target, empty or non-finite rectangle, invalid cap, tolerance, , or by returning domain. The exact rectangle test is: either the imaginary interval omits zero, or the real interval has strictly positive lower endpoint. Reject a selected shift with inconclusive. For stages , use precision , harmonic cutoff , product cutoff , and the fixed elementary truncation index for every range call. Output statuses are those of Certified special-function enclosure result.
Use Outward-rounded interval, rectangle and ball operations for interval arithmetic. Count every exact rational or interval operation, series term, elementary-DAG node operation, rounding, and loop update against the shared counter . If the procedure is called by another evaluator, charge these same primitive operations directly to that caller's shared counter, so the caller can debit the actual child work; the local cap remains in force. Before any operation would exceed either remaining cap, return inconclusive. Run nested elementary-range calls under that counter and interrupt a subcall before its next operation would exceed the remaining budget. A non-finite range result makes the current candidate unavailable. Any other non-finite arithmetic result also makes its candidate unavailable; no partial result is retained. Final output overflow returns range.
Choose which is the least integer for which . Compute this exactly from the rational endpoint; if , return inconclusive before forming the shift. Put . Before every elementary-range call, round each rational interval input outward to the stage dyadic format; a conversion overflow makes that candidate unavailable. A rounded Log input must still avoid the cut; otherwise its candidate is unavailable, rather than declaring the valid original input outside the domain. Embed a real interval explicitly as whenever it participates in a complex expression; real and complex DAG nodes retain their declared types. All elementary-range calls below use Certified range evaluation for elementary real and complex functions with the selected format and fixed truncation ; its soundness for finite real and complex results is given by Certified real elementary-function evaluations enclose their ranges and Certified complex exponential and principal logarithm enclose their ranges.
For stage , form a dyadic containing : for , compute exactly and , combine by the Machin identity, and round outward to the selected format at precision . The arctangent series and its geometric-tail argument are in Range-reduced exponential, logarithm and arctangent series have certified tails, and the Machin identity is in Trigonometric identities, Machin's formula and reduced Taylor tails. If the conversion is non-finite or , the Stirling candidate is unavailable for this stage; still attempt the product candidate. Let and ; is an exact rational upper bound for on .
For this stage, call the elementary-range algorithm on the principal-log node for each , . Translation by these real integers preserves avoidance of the cut for an input rectangle wholly in the slit plane; if the exact branch-domain check fails, return domain. Add the finite log rectangles to form the shift sum . If any shift-log call is non-finite, discard this whole stage, since both candidates require that sum. When , set .
Construct the product candidate when . Call the elementary-range algorithm for the real node to get an enclosure of , and form the outward-rounded Euler-constant interval , where exactly. Call the complex principal-log node on and on each for . All these rectangles lie in the principal-log domain since . Form by interval arithmetic, and enlarge each coordinate by an outward upper bound for The tail lemma Explicit tail bound for the log-Gamma product series proves that this is an enclosure of , uniformly on the whole rectangle. Subtract to get the shifted product candidate for . If or a required call is non-finite, this candidate is unavailable at this stage.
Construct the Stirling candidate only when is finite and has positive lower endpoint. Call the complex principal-log node on , and the real logarithm node on . Form by interval arithmetic and enlarge each coordinate by an outward upper bound for . The sectorial remainder lemma Explicit sectorial remainder bound for the right-half-plane log-Gamma branch proves this is an enclosure of . If a required call is non-finite, this candidate is unavailable at this stage.
If both log candidates are available, intersect them when the intersection is nonempty; if empty, discard the stage. If only one is available, select it. For target , use this rectangle as the output candidate. For target , call the complex exponential node on the selected rectangle and use its finite output rectangle. Return success at the first stage whose candidate radius is at most . Set relative_certified to true exactly when relative tolerance was requested, zero is excluded, and the contract's relative-radius test passes; a failed relative test does not prevent absolute success. If no stage succeeds before its caps, return inconclusive.
Positive discrete Wronskian for the Bessel recurrence pair
Statement
Fix real , let be as in Integer-order Bessel series, and let be as in Complementary solution for the integer Bessel recurrence. Define . Then
In particular, the two recurrence solutions and are linearly independent.
Facts & Assumptions
Given: A real and the two sequences in the statement.
Complementary solution for the integer Bessel recurrence: , with and .
Adjacent initial Bessel values cannot both vanish: and are not both zero.
Proof
Using [F1] and [F2], for , Thus for every .
By [F2], , which is strictly positive by [F3]. A linear dependence of would make every determinant zero, so they are independent.
Exact finite terminal-contamination error identity
Statement
Fix , integers and , and define the exact backward recurrence solution by , , and for . If , put . For such that , let . Then
This is a finite- identity. It makes no assertion that the error tends to zero as .
Facts & Assumptions
Given: as above; the sequences ; and the terminal recurrence sequence .
Positive discrete Wronskian for the Bessel recurrence pair: are linearly independent solutions of the same second-order recurrence.
Complementary solution for the integer Bessel recurrence: obeys the same recurrence.
Proof
The sequence obeys the recurrence by [F2] and [F3], and its value at is . Its value at is nonzero: if it too were zero, backward recurrence would make it zero at every index, contradicting the linear independence in [F1] and its coefficient on . Therefore has the terminal values . Uniqueness of the finite backward recurrence gives for .
Taking the ratio of the formulas for and yields . Since the denominator is nonzero, Every equality uses this single fixed terminal index ; no limit in was taken.
Soundness of finite erfcx enclosures
Statement
If Finite certified evaluation of the scaled complementary error function returns success for , the
returned interval contains and passes the requested
absolute-radius test. A relative certificate is valid only if zero is outside
the interval and the required relative-radius test passes. Every execution
with finite caps terminates. The theorem makes no success claim for every
or finite cap.
Facts & Assumptions
Given: A successful return of Finite certified evaluation of the scaled complementary error function using a sound outward interval backend.
Certified range evaluation for elementary real and complex functions supplies the finite square-root range call for ; soundness of that real output is given by Certified real elementary-function evaluations enclose their ranges.
Outward-rounded interval, rectangle and ball operations and Outward-rounded operations are inclusion-isotone and enclose DAG evaluations: every finite arithmetic interval operation encloses its exact result.
Finite continued-fraction enclosure for erfcx: each finite-depth continued- fraction interval contains the exact value.
Signed finite remainder for the erfcx asymptotic expansion: the signed remainder interval formed from and contains the exact value for every .
Certified special-function enclosure result: success requires a containing interval with the stated radius, and relative certification requires zero exclusion.
Finite certified evaluation of the scaled complementary error function: the procedure returns only a continued-fraction or signed-asymptotic candidate, or a non-success status.
Proof
A continued-fraction candidate contains by [F1]. A signed-asymptotic candidate contains it by [F2]. The interval evaluation of each candidate is sound by [A1] and [A2]. If the procedure intersects both candidates, their common exact value lies in the intersection; otherwise the selected candidate remains an enclosure.
Thus every interval eligible for a success return contains the exact value. The finite arithmetic and intersection preserve inclusion by [A2] and the algorithm definition.
The procedure reports success only after the absolute-radius test in [F3] and sets a relative flag only when the interval excludes zero and the relative-radius test passes. No width decrease or universal success is asserted.
The stage loop is finite; every continued-fraction recurrence, asymptotic sum, and elementary-range call has finite depth, terms, format, and truncation index. Every branch has an explicit return or proceeds to the next bounded stage. Therefore every capped execution terminates.
Soundness of finite Gamma and log-Gamma enclosures
Statement
For any finite dyadic rectangle ,
whenever Finite certified evaluation of Gamma and a continued log-Gamma branch returns success, its
returned enclosure contains the range of or the continued log-Gamma
branch on and passes the stated absolute-radius test. Any reported
relative certificate obeys the zero-exclusion condition. No assertion
guarantees success for every valid input or finite cap. Every execution with
finite caps terminates.
Facts & Assumptions
Given: An invocation of Finite certified evaluation of Gamma and a continued log-Gamma branch with its finite backend parameters. For enclosure assertions assume a successful return on the admissible rectangle ; termination also covers unsuccessful returns.
Certified range evaluation for elementary real and complex functions, Certified real elementary-function evaluations enclose their ranges and Certified complex exponential and principal logarithm enclose their ranges give sound finite real and complex elementary outputs. Outward-rounded interval, rectangle and ball operations and Outward-rounded operations are inclusion-isotone and enclose DAG evaluations preserve containment through the finite arithmetic expressions.
Finite certified evaluation of Gamma and a continued log-Gamma branch defines the least admissible shift, finite stage cutoffs, actual outward range calls, coordinate enlargements, candidate intersection, final tests and shared work accounting. This is a procedure specification; its correctness is proved below.
Certified special-function enclosure result defines the absolute-radius and optional zero-excluding relative-radius tests and the four statuses.
Shifted log-Gamma branch is independent of the shift: on the slit plane, for an admissible shift ,
Weierstrass log-Gamma series converges to a Gamma branch: the series defining converges to the stated Gamma branch on the right half-plane. Explicit tail bound for the log-Gamma product series bounds the tail after terms by .
Explicit sectorial remainder bound for the right-half-plane log-Gamma branch: on the right half-plane,
Trigonometric identities, Machin's formula and reduced Taylor tails gives the Machin identity; Range-reduced exponential, logarithm and arctangent series have certified tails supplies the arctangent series and its geometric-tail argument used to enclose .
Proof
For an admissible , the prescribed integer shift has . Translation by a nonnegative real integer preserves cut avoidance: either the imaginary interval omits zero, or the real lower endpoint was already positive. Thus each exact shift-log input lies in its domain. Its outward-rounded input still contains it; the procedure uses it only when its domain is certified. By [A1] the finite shift-log sum therefore encloses the corresponding exact sum for every . An unavailable shift sum discards the stage and makes no finite claim.
Write for a finite enclosure of . By [F5], the outward interval contains the same real used by the branch. Finite outward evaluation of the product partial sum contains its exact value for every by [A1]. The exact rational majorant bounds uniformly. When , [F4] bounds each omitted tail by , since the numerator increases and the positive denominator decreases when is replaced by . The disk of radius lies in the coordinate rectangle used to enlarge the partial sum. Subtracting the containing shift-log sum from step 1.1 and using [F3] therefore encloses the full range .
The finite Machin construction encloses by [F7]. Its positive interval and the real logarithm call enclose by [A1]. Therefore the finite Stirling main-term rectangle contains the exact main term on . For every such , , so [F6] gives . The prescribed outward coordinate enlargement contains this remainder disk. After subtracting the shift-log sum, [F3] again identifies every enclosed target as the same continued branch .
Either finite log candidate thus contains ; their coordinatewise intersection, when used, also contains that entire image. For a log-Gamma target the selected rectangle is therefore sound. For a Gamma target, [A1] encloses its complex exponential, and [F3] identifies the pointwise exponential with for every . This proves full input-range containment for both targets.
The algorithm tests the actual final outward rectangle's radius before reporting success, and sets a relative flag only when the rectangle excludes zero and passes the relative-radius test. By [F2] these arithmetic tests give exactly the stated absolute and reported relative guarantees. Failed or non-finite candidates are never used for a finite success claim; no finite-cap success guarantee is asserted.
The stage count is at most , each shift and sum has a finite integer cutoff, and each elementary call has a finite DAG, format and truncation index. Moreover [F1] checks the shared counter before each local or nested primitive operation and loop update, interrupting before either its own or its caller's remaining work budget is exceeded. Consequently every capped invocation returns a status after finitely many charged operations, whether or not any candidate succeeds.
Finite certified Airy power-series evaluation
Definition
Inputs are an exact dyadic complex number , a target label or , positive rational absolute tolerance , optional positive rational relative tolerance , a fixed exponent range , and finite positive integer caps , with . Reject an invalid target, nonpositive tolerance, invalid cap, or with domain. The caps bound stages, terms per residue class, final dyadic precision, and this procedure's exact interval operations and subroutine calls. For stage , use , precision , and elementary-range truncation ; run stages .
All arithmetic uses Outward-rounded interval, rectangle and ball operations. Charge every exact arithmetic operation, range-evaluator node operation, term, rounding, and loop update to the shared counter . Return inconclusive before any local operation would exceed ; interrupt a nested subroutine before its next operation would exceed the remaining budget. When nested, charge every Gamma-child operation directly to the same parent counter. If a final endpoint overflows, return range. A non-finite subroutine result makes the current stage unavailable; later stages may still be tried. Other statuses are those of Certified special-function enclosure result.
At stage , outward-round the rational points and to dyadic intervals at precision . For each , charge the child-call operation to the parent counter. If no parent work unit remains, return inconclusive; otherwise pass the positive remaining budget as the child's work cap and call Finite certified evaluation of Gamma and a continued log-Gamma branch with target on the complex rectangle , absolute tolerance , no relative tolerance, the same exponent range, fixed elementary truncation , base format precision , and precision cap . Debit every operation performed by the Gamma child to the shared counter. A success output rectangle encloses , since ; if either call is not successful or its rectangle contains zero, skip this stage. A failed rational-to-dyadic conversion also makes the stage unavailable.
For , outward-round the exact rational to a dyadic interval , then call Certified range evaluation for elementary real and complex functions on the real expression DAG , with the same exponent range, precision , and truncation . These calls enclose by Certified real elementary-function evaluations enclose their ranges. If a required call is not finite, skip this stage. Embed each real power interval as the complex rectangle , then combine it with the Gamma rectangles by outward complex arithmetic to enclose the two initial coefficients for Ai, or for Bi. If any divisor rectangle contains zero or an arithmetic operation is non-finite, skip this stage.
Put , an exact rational upper bound for . For each residue , initialize using the selected pair of initial coefficient intervals, and compute , where . Sum and compute the first omitted term . Put and If either , skip the stage. Otherwise enlarge the sum of both partial rectangles in each coordinate by where . The residue class vanishes identically. The ratio and tail lemma Airy coefficient recurrence and geometric tail bounds therefore makes the enlarged rectangle a containing enclosure of the selected Airy value.
Round the final rectangle outward to precision . Return success at the first stage whose radius is at most . Set relative_certified to true exactly when relative tolerance was requested, zero is excluded, and the contract's relative-radius test passes; a failed relative test does not prevent absolute success. If no stage succeeds before its caps, return inconclusive. The stage loop and all subroutine calls have finite caps, so the procedure has no unbounded retry.
Finite certified evaluation of integer-order Bessel functions
Definition
Inputs are an integer order , a target or scaled , an exact dyadic real argument , positive rational absolute tolerance , optional positive rational relative tolerance , a fixed exponent range , and finite positive integer caps , with . The caps bound stages, series terms, midpoint panels, Miller terminal index, dyadic precision, and exact interval operations and subroutine calls. Run stages , using precision and elementary-range truncation . Reject , invalid targets, nonpositive tolerances, invalid caps, , or for the scaled target with domain. The scaled target is always .
Use exact rational endpoint formulas for finite sums, recurrences, mesh construction, and error bounds, with final endpoints rounded outward to precision . Charge every exact arithmetic operation, range-evaluator node operation, term, rounding, and loop update to the shared counter ; interrupt a nested elementary-range call with inconclusive before its next operation would exceed the remaining budget. Factorials use The factorial and the falling factorial , defined by recursion in . Call Certified range evaluation for elementary real and complex functions for the real sine, cosine, and exponential ranges in the midpoint branches. Before each call, round its rational input interval outward to the fixed dyadic format. Its finite outputs are sound by Certified real elementary-function evaluations enclose their ranges. Count each exact operation, term, rounding, and subroutine call against ; if the next operation would exceed , return inconclusive. A non-finite elementary call makes that branch unavailable. Final endpoint overflow returns range.
Before forming any stage constant, if the target is scaled and ,
use precision , form when and when , and round its
endpoints outward to that format. If either conversion overflows,
return range. Otherwise apply the ordinary absolute-radius test to the rounded candidate and return success only when it passes; return inconclusive if it fails. The internal exact candidate has radius zero, but outward underflow may widen its stored enclosure. Set a successful output's relative flag by the usual contract test, so a zero value
receives no relative certificate. This branch does not call the
elementary-range procedure.
At stage , compute an outward dyadic interval containing from the Machin identity in Trigonometric identities, Machin's formula and reduced Taylor tails and the arctangent series and geometric-tail argument in Range-reduced exponential, logarithm and arctangent series have certified tails: for , use the -term sum and tail bound , combine by , and round outward to the selected format at precision . If this conversion is non-finite or , midpoint candidates are unavailable at this stage; the independent power-series or Miller branches may still be attempted.
For a requested , first form a power-series candidate if possible. For any order , define the finite subroutine : start and ; sum , and compute . Put If , return the interval partial sum enlarged by ; otherwise mark this series candidate unavailable. The tail lemma Convergence and geometric tails for integer-order Bessel series proves each returned interval contains .
For each requested target, also form its composite-midpoint candidate with panels, , and nodes , , using as the interval for . For , call the elementary-range algorithm for , form , and call it for the cosine of that interval. Let be the interval sum and The candidate is . For the scaled target with , call the elementary algorithm for , form , call it for the real exponential, and also call it for . Let be times the sum of the resulting product intervals and set The candidate is . The exact midpoint error lemmas Composite midpoint enclosure for the integer Bessel integral and Composite midpoint enclosure for the scaled modified Bessel integral prove these inclusions.
For a Miller candidate, only try this branch when and . Obtain for ; if any is unavailable, skip the branch. Set , , and compute for by interval arithmetic. Set , and compute for . Require the intervals for , , , and below to exclude zero. Form . In the fixed order , whenever the tests pass, form The exact finite terminal-contamination identity Exact finite terminal-contamination error identity proves that each contains . The Casoratian lemma Positive discrete Wronskian for the Bessel recurrence pair supplies the independent recurrence pair and positive invariant required by that identity.
Collect every available sound candidate for the requested target. If more than one is available, intersect them; if the intersection is empty, discard this stage. Round the selected candidate outward to precision . Return success at the first stage whose radius is at most . Set relative_certified to true exactly when relative tolerance was requested, zero is excluded, and the contract's relative-radius test passes; failure of that relative test does not prevent absolute success. If no stage succeeds before the finite caps, return inconclusive. No branch uses a limit in the Miller terminal index.
Soundness of finite Airy enclosures
Statement
Whenever Finite certified Airy power-series evaluation returns success, its interval or
rectangle contains the requested or
and passes the requested absolute-radius test. Any
relative certificate is valid only when the enclosure excludes zero. No
success guarantee is made for every input or finite cap. Every execution with finite
caps terminates.
Facts & Assumptions
Given: A successful return of Finite certified Airy power-series evaluation using a sound outward interval backend.
Finite certified evaluation of Gamma and a continued log-Gamma branch supplies each finite Gamma call; Soundness of finite Gamma and log-Gamma enclosures says every successful call encloses the Gamma range on its dyadic input rectangle.
Certified range evaluation for elementary real and complex functions supplies the finite real range calls for powers of 3; their finite outputs are sound by Certified real elementary-function evaluations enclose their ranges.
Outward-rounded interval, rectangle and ball operations and Outward-rounded operations are inclusion-isotone and enclose DAG evaluations: every finite interval operation encloses its exact result.
Certified special-function enclosure result: the success radius test and zero-exclusion rule have the stated absolute and relative meanings.
Airy coefficient recurrence and geometric tail bounds: each nonzero Airy residue-class tail is bounded by its first omitted term divided by when all later ratios are at most .
Finite certified Airy power-series evaluation: the procedure encloses the two partial sums, adds the two residue-class tail bounds, and uses certified Gamma initial constants.
Proof
The initial coefficients used by the procedure enclose the exact Airy initial values by [F3], with the Gamma calls sound by [A1] and the powers of 3 sound by [A2]. Arithmetic on these intervals is sound by [A3]. The series definition and recurrence determine all later coefficients, so the resulting partial sums enclose their exact finite series sums.
By [F2], each nonzero omitted class tail lies within its computed absolute tail bound; the third class is zero because its initial coefficient is zero and the recurrence preserves zero. Therefore the exact Airy value lies in the partial-sum enclosure enlarged by the sum of the two tail bounds.
The algorithm reports success only when that containing rectangle passes the requested radius test, and its relative flag obeys [F1]. If its finite caps do not allow that test, the result is inconclusive; no claim of universal success is made.
The stage loop is finite; each Gamma and elementary-range subcall has finite caps and truncation index, and the residue-class sums have at most the capped number of terms. Thus every capped execution terminates.
Soundness of finite integer-order Bessel enclosures
Statement
Whenever Finite certified evaluation of integer-order Bessel functions returns success,
its interval contains the requested or scaled modified Bessel value
and passes the requested absolute-radius test. A relative
certificate is valid only when zero is outside the interval and the relative
test passes. The theorem makes no success guarantee for every input or finite
cap. Every execution with finite caps terminates.
Facts & Assumptions
Given: A successful return of Finite certified evaluation of integer-order Bessel functions with a sound outward interval backend.
Certified range evaluation for elementary real and complex functions supplies the finite real sine, cosine, and exponential ranges used by the midpoint branches; every finite range is sound by Certified real elementary-function evaluations enclose their ranges.
Outward-rounded interval, rectangle and ball operations and Outward-rounded operations are inclusion-isotone and enclose DAG evaluations: every finite interval operation encloses its exact result.
Finite certified evaluation of integer-order Bessel functions: series, midpoint, and finite Miller candidates are returned only after their respective tail or terminal-error enclosures are applied; its exact scaled- input branch returns the corresponding defining-series value. Candidate intersections are taken only when nonempty.
Integer-order Bessel series and Real elementary functions and their domains: at , the defining series gives , for , and .
Certified special-function enclosure result: success requires exact inclusion and the stated radius; relative certification requires zero exclusion.
Convergence and geometric tails for integer-order Bessel series: the truncated series tail is enclosed by the geometric bound when its ratio test passes.
Exact finite terminal-contamination error identity: the finite normalized backward recurrence error is exactly the displayed terminal-contamination expression whenever its denominators are nonzero.
Composite midpoint enclosure for the integer Bessel integral: the midpoint enclosure contains the exact cosine integral.
Composite midpoint enclosure for the scaled modified Bessel integral: the midpoint enclosure contains the exact scaled integral.
Trigonometric identities, Machin's formula and reduced Taylor tails supplies the Machin identity; the arctangent series and geometric-tail argument in Range-reduced exponential, logarithm and arctangent series have certified tails give the finite bounds used to enclose for the midpoint mesh.
Complementary solution for the integer Bessel recurrence: , , and for and .
Proof
If the target is scaled and , the defining series [F2] gives for and for , so the exact internal singleton contains the target; its final outward conversion also contains it by [A2], and the algorithm tests the actual rounded radius. Otherwise, the power-series candidate contains by [F4]. The two midpoint candidates contain their integrals by [F6] and [F7]; their finite sine, cosine, and exponential ranges are sound by [A1], their mesh constant is enclosed by [F8], and their arithmetic interval operations are sound by [A2].
For a Miller candidate, [F1] requires and , and obtains from successful calls. Their intervals contain these exact values by [F4] and [A2]. Starting from , induction through the finite recurrence [F9] and [A2] encloses every required by the error formula, including . The prescribed terminal singletons and backward recurrence similarly enclose every exact . The procedure divides only after the interval for excludes zero, so the resulting interval contains . It also requires the intervals for , and to exclude zero. Thus the exact denominators in [F5] are nonzero, and [A2] encloses both and its exact error from [F5]. Their interval difference contains . Repeated occurrences of the same enclosed values may widen this difference but preserve containment; unavailable calls or failed guards discard the candidate.
Every candidate used by the procedure therefore contains the same exact requested value. Any nonempty intersection of candidates also contains that value.
The algorithm reports success only after the containing interval passes the absolute-radius test and, when reported, the zero-excluding relative test in [F3]. Otherwise it returns an inconclusive or range status under finite caps. Thus the success claims are sound and do not rely on a limit as the Miller terminal index grows.
The stage and candidate loops are finite, every series and recurrence uses at most its stated finite index, and each elementary-range call has a finite DAG, format, and truncation index. Hence every capped execution terminates.
5 · Examples, counterexamples and false statements
None yet.
Sources
- DLMF, §9.2(ii), equations 9.2.3–9.2.6
- DLMF, §9.4, Maclaurin series
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §2
- DLMF, Chapter 3, Numerical Methods, §3.1
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §§2–5
- DLMF, §7.6, Series Expansions
- DLMF, §15.2(i), Gauss Series
- DLMF, §10.2(ii), equation 10.2.2
- DLMF, §10.25(ii), equation 10.25.2
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §§2 and 4
- DLMF, §5.8(ii), Weierstrass product
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §§2 and 3
- DLMF, §5.2, Gamma and psi functions
- DLMF, §5.5, Functional Relations
- Maximilian Kreuzer, Quantum Theory: Lecture Notes, Chapter 8
- Pierre Capel, Introduction to Scattering Theory, TALENT lecture notes
- DLMF, §3.6(iii), Miller's Algorithm
- DLMF, §7.2, definitions and elementary properties
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §§3 and 5
- DLMF, §5.8, analytic continuation and Weierstrass product
- DLMF, §§5.8 and 5.11
- DLMF, §9.4, Airy Maclaurin series
- DLMF, §9.2(ii), Airy initial values
- DLMF, §§9.2(ii), 9.4, and 9.17(i)
- DLMF, §7.6(i), equation 7.6.1
- DLMF, §7.6(i), equations 7.6.4 and 7.6.6
- DLMF, §15.2(i), equation 15.2.1
- DLMF, §10.25(ii), modified Bessel power series
- DLMF, §10.2(ii) and §10.25(ii)
- DLMF, §5.2, Gamma function and Euler constant
- DLMF, §5.8(ii), equation 5.8.2
- Maximilian Kreuzer, Quantum Theory: Lecture Notes, version July 15, 2009, Chapter 8
- NIST Digital Library of Mathematical Functions, §10.49, Explicit Formulas
- University of Toronto, Lecture Notes on Mathematical Methods 2019–20
- NIST Digital Library of Mathematical Functions, §10.51, Recurrence Relations and Derivatives
- DLMF, §15.2(i), Gauss series
- DLMF, §§7.6(i) and 15.2(i)
- DLMF, §9.9(i), real zeros of Airy functions
- DLMF, §§9.2(i)–(ii) and 9.9(i)
- DLMF, §10.32(i), integral representations for modified Bessel functions
- DLMF, §10.25(ii), modified Bessel functions
- DLMF, §§10.9, 10.25, and 10.32(ii)
- DLMF, §10.74(iii)
- DLMF, §5.9(i), Binet's integral representation
- DLMF, §§7.2 and 7.12(i)
- DLMF, §10.25(i), modified Bessel differential equation
- DLMF, §10.2(i), Bessel differential equation
- DLMF, §§10.2(i), 10.6(i), and 10.25(i)
- DLMF, §5.11, asymptotic expansions
- DLMF, §5.5, functional relations
- DLMF, §§5.5, 5.8, and 5.11
- NIST Digital Library of Mathematical Functions, §10.74, Methods of Computation
- DLMF, Chapter 3, §3.5, quadrature
- DLMF, §10.74(iii) and Chapter 3, §3.5
- DLMF, §§10.2(i)–(ii)
- DLMF, §7.12(i), equation 7.12.1
- DLMF, §7.9, continued fractions for erfc
- DLMF, §10.32(ii), integral representations for modified Bessel functions
- DLMF, §5.9(i), Binet's integral representations
- DLMF, §5.11(i), Stirling's expansion for log-Gamma
- DLMF, §7.9, continued fractions
- DLMF, §3.6, Linear Difference Equations
- DLMF, §9.17(i), numerical evaluation
- DLMF, §10.9, integral representations
- DLMF, §10.6, recurrence relations and derivatives
- DLMF, §10.2, Bessel functions of the first kind
- DLMF, §§10.2, 10.6, 10.9, 10.25, and 10.74(iii)