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.
A multimodal quartic receives an exact spatial branch-and-bound gap certificate
Example
Let on , with exact dyadic interval evaluation, , and node budget . This polynomial has two global minimizers, while a natural interval extension gives a simple certified gap after one split.
Facts & Assumptions
Given: The unconstrained interval , represented by the DAG , , , exact interval operation results for the displayed dyadic endpoints, and the procedure Finite-budget certified spatial branch and bound with and the interval oracle Outward-rounded interval enclosures for factorable expression DAGs on boxes.
A finite interval-DAG evaluation encloses every exact objective value; a verified upper/lower pair with gap at most epsilon is a global certificate. Outward interval and Lipschitz midpoint bounds are sound and consistent under refinement, A spatial branch-and-bound gap certificate proves global epsilon-optimality
Every nonnegative real has a unique nonnegative square root. Square roots exist: a unique with ; the positives are
Verification
The identity shows , with equality at . If , then and by [F2], so . We have : otherwise either , contradicting , or , which by strict monotonicity of squaring on nonnegatives gives , also impossible. Hence both minimizers lie in , and they are distinct because . Squaring is monotone on the nonnegatives
At the root box, the DAG product encloses as under ordinary interval multiplication; then also encloses as , so encloses as . The root midpoint is , with exact feasible value ; its initial gap is , so the root cannot yet be closed as a global certificate.
The root uses the first call. Bisect at zero and evaluate the lower child on the second call and the upper child on the third call, completing both reports within . On each child and , ordinary interval multiplication gives , then , so has lower bound . The child midpoints are and , and both give , so the incumbent becomes and the global lower bound is .
The gap is . The feasible midpoint and the complete two-leaf ledger therefore certify epsilon-global optimality. Its actual objective is above the minimum, within the declared tolerance.
Depends on
- Finite-budget certified spatial branch and bound
- Outward-rounded interval enclosures for factorable expression DAGs on boxes
- Outward interval and Lipschitz midpoint bounds are sound and consistent under refinement
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Squaring is monotone on the nonnegatives
- A spatial branch-and-bound gap certificate proves global epsilon-optimality
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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
- Arnold Neumaier, Complete Search in Continuous Global Optimization and Constraint Satisfaction, §§11–12 (standard reference, not scraped)