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.
Real boxes and interval Jacobian enclosures
Definition
For an integer , a real box is a nonempty product of closed real intervals with finite dyadic endpoints , using the interval convention of Real intervals, complex rectangles and ball enclosures. Its interior is ; it is empty if any side is degenerate.
Let be open and convex, let be a real box, and let be in the sense of Continuously differentiable maps, local inverses, and local diffeomorphisms. An interval Jacobian enclosure on is an matrix of finite real intervals such that for every , with partial derivatives and Jacobian entries as in The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case. Write for the set of point matrices represented by this interval matrix.
Depends on
Used by
- Finite-budget interval isolation for smooth scalar roots Algorithm
- Finite-budget multidimensional Krawczyk root certification Algorithm
- Finite-budget phase-fixed periodic-orbit correction and validation Algorithm
- Finite-budget scalar interval Newton root certification Algorithm
- Certified residual, Jacobian, trajectory, and monodromy enclosures for periodic shooting Definition
- A continuous self-map of a nonempty closed box has a fixed point Lemma
- An interval Jacobian encloses a vector mean-value matrix Lemma
- Krawczyk inclusion proves existence, disjointness excludes roots, and contraction proves uniqueness Theorem
Dependency tree · two levels
10 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), §13 (standard reference, not scraped)
- R. Baker Kearfott, Interval Computations: Introduction, Uses, and Resources, §§1–2 (standard reference, not scraped)