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.
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.
Depends on
Used by
- Finite certified Airy power-series evaluation Algorithm
- Finite certified evaluation of Gamma and a continued log-Gamma branch Algorithm
- Finite certified evaluation of integer-order Bessel functions Algorithm
- Finite certified evaluation of the scaled complementary error function Algorithm
- Finite certified power-series evaluation for Fresnel, erf, and Gauss functions Algorithm
- Finite primitive and contracted Gaussian integral evaluation with certified screening Algorithm
- Finite-budget certified evaluation of Boys function tables Algorithm
- Scaled spherical Bessel evaluation on positive real arguments Definition
- Relative error becomes unavailable at an Airy zero Example
- Soundness and accumulated error bounds for the finite Gaussian integral evaluator Theorem
- Soundness and eventual absolute precision for spherical Bessel enclosures Theorem
- Soundness of every successful finite-budget Boys enclosure Theorem
- Soundness of finite Airy enclosures Theorem
- Soundness of finite erfcx enclosures Theorem
- Soundness of finite Gamma and log-Gamma enclosures Theorem
- Soundness of finite integer-order Bessel enclosures Theorem
- Soundness of the finite Fresnel, erf, and Gauss-series enclosures Theorem
Dependency tree · two levels
18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- DLMF, Chapter 3, Numerical Methods, §3.1 (standard reference, not scraped)
- N. M. Temme, “Numerical aspects of special functions,” Acta Numerica 17 (2008), §§2–5 (standard reference, not scraped)