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.
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.
Depends on
Used by
- Finite certified power-series evaluation for Fresnel, erf, and Gauss functions Algorithm
- Soundness of the finite Fresnel, erf, and Gauss-series enclosures Theorem
Cited to discharge well-definedness by Fresnel, error, and Gauss hypergeometric series.
Dependency tree · one level
1 result within one dependency step of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- DLMF, §15.2(i), equation 15.2.1 (standard reference, not scraped)
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §2 (standard reference, not scraped)