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 — Examples
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
- Stable special function recurrences and certified evaluation
- 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
These examples test the certified branches at the points where domain restrictions, cancellation, scaling, or relative error matter. The proofs include the Gauss series versus its logarithmic continuation, conditioning in , least-term truncation for the signed erfcx asymptotic expansion, absolute versus relative accuracy near an Airy zero, a Bessel recurrence sign error under an arbitrarily small seed perturbation, and growth of unscaled alongside the bounded scaled value.
Every example uses the exact branch and error contract from the A page. No example turns a finite recurrence heuristic or a limiting asymptotic series into an unproved convergence claim.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The Gauss series disk and a continued logarithmic branch have different domains
Statement
For and , the Gauss-series branch in
Fresnel, error, and Gauss hypergeometric series is defined for and
there equals
with value at . The right side has a principal analytic
continuation to , which includes ; the
series evaluator correctly returns domain at because this input lies
outside the defined power-series branch. This example distinguishes the
series branch's disk from the continuation branch's slit domain.
Facts & Assumptions
Given: The exact parameters , .
Fresnel, error, and Gauss hypergeometric series: the Gauss branch is the stated power series on with not a nonpositive integer.
The principal logarithm is the normalised holomorphic branch on the slit plane: away from the nonpositive real axis.
The second fundamental theorem: if is differentiable on with and is integrable, then : a continuously differentiable complex path satisfies the fundamental theorem of calculus by applying the real theorem to its real and imaginary parts.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion and Inside its radius a real power series may be integrated term by term on every closed subinterval: a continuous integrand on is integrable and a real power series may be integrated termwise strictly inside its radius; apply the latter to both real and imaginary component power series along the segment.
Finite certified power-series evaluation for Fresnel, erf, and Gauss functions: its Gauss-series
branch returns domain unless avoids the excluded integers and .
Proof
For , the Pochhammer products give and , so each coefficient is . For , the geometric series converges uniformly along the segment (). Parameterizing the path and integrating the real and imaginary component power series termwise by [F4] gives where [F2], [F3], and [F4] justify the path integral identity since along the segment. Dividing by gives the formula, and the series gives value at .
The principal logarithm is holomorphic when avoids the nonpositive real axis, that is, when . The quotient has a removable value at by step 1.1, so it defines the stated continuation domain, which contains .
Since , the defined Gauss-series branch fails its domain check and [F5] returns domain; this does not contradict the continued formula in step 2.1, which is a separately declared branch.
Subtracting erf from one amplifies absolute input errors in the tail
Statement
For , suppose the inputs to the subtraction are approximations and , where are signed errors. Its output error is exactly , so its relative error is at most For fixed nonzero input error bounds, this conditioning factor grows without bound as , because and tends to zero. The identity and a certified direct enclosure avoid this particular subtraction.
Facts & Assumptions
Given: A real and approximations , .
Error-function series geometric tail bound: for real , .
Soundness of finite erfcx enclosures: a successful direct evaluation supplies a containing absolute enclosure.
Certified real elementary-function evaluations enclose their ranges: every finite successful real elementary-range output encloses its exact value or range on an admissible dyadic input interval; this applies to for exact dyadic .
Proof
By [F1], the exact output is . Subtracting the perturbed inputs gives Since [F2] and [F3] give , division by the exact value and the triangle inequality yield the stated relative-error bound.
The same tail integral tends to zero as , because the nonnegative Gaussian is integrable by [F3]. If with fixed , the choice , attains error , so the relative error is and is unbounded. By [F1], multiplying containing intervals for and with outward rounding encloses and avoids the subtraction. For exact dyadic , [F4] and [F5] supply those factors whenever their finite evaluations succeed; this asserts no finite-cap success for arbitrary real .
Least-term truncation of the erfcx asymptotic expansion
Statement
For , let be an integer nearest to , so . In the expansion from Signed finite remainder for the erfcx asymptotic expansion, the magnitudes of the terms are The term is minimal (ties are possible), and the signed remainder after terms is bounded by exactly . For example, at the least-term truncation is . This describes optimal truncation by term size; it does not assert convergence of the asymptotic series.
Facts & Assumptions
Given: Real and integer with .
Signed finite remainder for the erfcx asymptotic expansion: after terms, with .
Proof
The positive term ratio is For , this ratio is at most , so the terms do not increase up to . For , the ratio is at least , so terms do not decrease after . Hence is a least term.
The upper bound in [F1] equals , and its sign is fixed by . Thus the first omitted least-sized term also bounds the signed asymptotic remainder. At , satisfies ; the same finite certificate applies.
An arbitrarily small seed perturbation flips a later Bessel sign
Statement
At , every is positive and tends to zero as , whereas the complementary recurrence solution defined in Complementary solution for the integer Bessel recurrence is positive and unbounded for . Hence, for every , the perturbed seed pair can be arbitrarily close to the exact seeds, yet its forward recurrence solution is negative for some index where the exact is positive. This is a recurrence-sensitivity example, not a claim that every floating-point implementation follows this particular error direction.
Facts & Assumptions
Given: The Bessel series at , the order recurrence, and the complementary solution .
Integer-order Bessel series: at , .
Convergence and geometric tails for integer-order Bessel series: these series converge absolutely, and their successive absolute term ratio is at .
Complementary solution for the integer Bessel recurrence: , , and at .
Proof
Let . By [F2], the positive terms decrease strictly to zero. Grouping the alternating series in consecutive pairs gives . Also , so In particular, and .
By [F4], and ; hence . If and , then . Induction gives for , so .
The exact sequence obeys the same linear recurrence by [F3] and [F4], so it is the forward-recurrence solution from the displayed perturbed seeds. Since and by steps 1.1 and 2.1, some finite satisfies . At that index . The seed differences have magnitudes and , which tend to zero with .
Relative error becomes unavailable at an Airy zero
Statement
There is a real with . An absolute enclosure remains meaningful there, but the relative certificate in Certified special-function enclosure result cannot be reported by an enclosure containing zero. Near , relative certification requires a radius proportional to the small value and therefore requires increasingly fine absolute enclosures.
Facts & Assumptions
Given: A negative real Airy zero and a real input near .
The Airy Ai function has a negative real zero: some satisfies .
Airy coefficient recurrence and geometric tail bounds: is entire, hence continuous on the real axis.
Certified special-function enclosure result: relative certification requires and .
Soundness of finite Airy enclosures: successful Airy evaluations provide absolute enclosures even when no relative certificate is available.
Proof
At , every enclosure containing the exact value also contains . Therefore the zero-exclusion condition in [F3] fails, while [F4] still permits an absolute-radius success enclosure.
For any , continuity in [F2] at the zero [F1] gives a neighborhood of on which . Whenever a relative certificate succeeds for an enclosure of such a value, [F3] implies . Thus the required absolute radius tends to zero as the input approaches .
Scaling keeps the modified Bessel value bounded as the unscaled value grows
Statement
For and , the scaled value lies in , while as . Thus any fixed finite output range for unscaled values is eventually exceeded, whereas the scaled value remains bounded and can be evaluated directly from its scaled integral.
Facts & Assumptions
Given: Real .
Signs, monotonicity intervals, and ranges of sine and cosine: for all real .
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: the continuous function is integrable, and its primitive gives .
Proof
Let . By [F2], and for by [F3], so . Again by [F2] and [F4],
For and , step 1.1 gives . Restricting the integral in [F1] to this interval therefore yields The exponential series gives for , so this lower bound is at least and tends to infinity.
The scaled range in [F1] holds for every , while step 2.1 shows the unscaled value exceeds any fixed finite range for sufficiently large . The scaled integral method of Composite midpoint enclosure for the scaled modified Bessel integral evaluates the bounded scaled quantity directly.
Sources
- DLMF, §15.2(i), Gauss series
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §2
- DLMF, §7.2, definitions of erf and erfc
- DLMF, §§7.2 and 7.12(i)
- DLMF, §7.12(i), equation 7.12.1
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §§3 and 5
- DLMF, §10.6(i), recurrence relations
- DLMF, §§3.6(iii) and 10.6(i)
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §§2 and 4
- DLMF, §9.17(i), numerical evaluation of Airy functions
- DLMF, §§9.9(i) and 9.17(i)
- DLMF, §10.40, asymptotic expansions for modified Bessel functions
- DLMF, §§10.25 and 10.40