Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generated
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 C1 function f:U→R on an open interval U, a nonempty finite dyadic interval X0=[a,b]⊂U, an integer update budget N≥0, and interval evaluators Ef(I) and Ef′(I) for every queried subinterval I⊆U. Their admissibility condition is f(I)⊆Ef(I) and f′(I)⊆Ef′(I); a non-finite evaluator result is not an enclosure usable for certification.

Set I=X0. At each of at most N interval-Newton updates:

  1. If a finite Ef(I) excludes 0, return "root-free" for X0.
  2. If I={x}, return "unique-root" when Ef(I)={0}, return "root-free" when 0∉Ef(I), and otherwise return "inconclusive".
  3. Obtain finite D=Ef′(I). If the evaluation is non-finite or 0∈D, return "inconclusive" with the original box.
  4. Let m be the midpoint of I and obtain a finite enclosure Fm=Ef({m}). If unavailable, return "inconclusive".
  5. Compute the outward interval Newton image N(I)=m−Fm/D and Y=N(I)∩I. A non-finite operation returns "inconclusive". If Y=∅, return "root-free". If N(I)⊂int⁡I, return "unique-root". If Y is a strict nonempty subinterval of I, replace I by Y 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