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.
Finite-budget scalar interval Newton root certification
Definition
Input a function on an open interval , a nonempty finite dyadic interval , an integer update budget , and interval evaluators and for every queried subinterval . Their admissibility condition is and ; a non-finite evaluator result is not an enclosure usable for certification.
Set . At each of at most interval-Newton updates:
- If a finite excludes , return "root-free" for .
- If , return "unique-root" when , return "root-free" when , and otherwise return "inconclusive".
- Obtain finite . If the evaluation is non-finite or , return "inconclusive" with the original box.
- Let be the midpoint of and obtain a finite enclosure . If unavailable, return "inconclusive".
- Compute the outward interval Newton image and . A non-finite operation returns "inconclusive". If , return "root-free". If , return "unique-root". If is a strict nonempty subinterval of , replace by and continue; otherwise return "inconclusive".
If the update budget is exhausted, return "inconclusive" with the original box. A returned root-free or unique-root status applies to the original box. A failed derivative test, failed contraction, or exhausted budget proves no negative claim.
Depends on
Used by
Dependency tree · two levels
12 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
- Siegfried M. Rump, Verification methods: Rigorous results using floating-point arithmetic, Acta Numerica 19 (2010), §6.2 (standard reference, not scraped)
- R. Baker Kearfott, Interval Computations: Introduction, Uses, and Resources, §2 (standard reference, not scraped)