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 intervals, complex rectangles and ball enclosures
Definition
A real interval is a closed set with finite dyadic
endpoints . Its width is , midpoint is , and its
midpoint-radius form is with and . The empty
set is the status empty; the whole real line is entire. overflow,
domain-error, split-domain, and inconclusive are computation statuses,
not finite intervals.
A complex rectangle is for real intervals . Complex addition and multiplication use and . For , its complex modulus is , and for its reciprocal is . A complex ball is with dyadic complex center and dyadic . For any two represented sets , the inclusion order is iff .
The width of a complex rectangle with coordinate widths is its Euclidean diameter ; the width of a ball is its diameter . Width comparisons against a dyadic tolerance can be decided by exact rational comparisons after squaring the nonnegative quantities.
The range of a real or complex function on a set is . A finite expression DAG is a finite directed acyclic graph with input nodes, constant nodes, and operation nodes; constants are exact dyadics or are supplied with certified enclosing intervals. Sharing a node means the exact same intermediate value is reused.
Depends on
Used by
- Budgeted ordered Hermitian eigenvalue bisection by verified inertia Algorithm
- Certified adaptive Simpson from derivative enclosures Algorithm
- Certified dyadic enclosures for unit-circle phases Algorithm
- Certified Gaussian gridding for type 1 and type 2 Algorithm
- Certified Gaussian nodes and weights by Golub–Welsch Algorithm
- Certified Hermitian eigenvalue intervals from residual and Gram bounds Algorithm
- Finite complex contour resolvent validator with cover and inconclusive statuses Algorithm
- Finite precision point linear solve certificate with explicit status Algorithm
- Finite-budget interval isolation for smooth scalar roots Algorithm
- Finite-budget multidimensional Krawczyk root certification Algorithm
- Finite-budget scalar interval Newton root certification Algorithm
- Finite-budget validated range evaluation Algorithm
- Interval Krawczyk linear system certifier with explicit statuses Algorithm
- Outward interval block LDL inertia certifier with pivot-inconclusive status Algorithm
- Outward Leibniz determinant sign and nonsingularity certifier Algorithm
- Outward-rounded interval enclosures for factorable expression DAGs on boxes Algorithm
- Uniform interval linear residual certificate with inconclusive status Algorithm
- Centered Taylor model with derivative-interval remainder Definition
- Certified factorable convex relaxations on a box Definition
- Dyadic orientation and lifted sphere determinants Definition
- Finite complex-array norms used by the NUFFT certificates Definition
- Finite rational residual-tube certificate for an ODE trajectory Definition
- Outward-rounded interval, rectangle and ball operations Definition
- Real boxes and interval Jacobian enclosures Definition
- Real elementary functions and their domains Definition
- Division of [1,2] by [-1,1] has no finite hull Example
- Natural interval subtraction loses repeated-input correlation Example
- An interval Jacobian encloses a vector mean-value matrix Lemma
- Finite real interval operations enclose their exact values Lemma
- Real and complex modulus product and triangle inequalities Lemma
- Certified phase output encloses the exact unit-circle value Theorem
- Outward interval and Lipschitz midpoint bounds are sound and consistent under refinement Theorem
- Outward-rounded operations are inclusion-isotone and enclose DAG evaluations Theorem
- Sound integral enclosure from certified adaptive Simpson Theorem
Dependency tree · one level
2 results within one dependency step 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
- Kearfott, Interval Computations: Introduction, Uses, and Resources, §§1–2 (standard reference, not scraped)
- Rump, Verification methods: Rigorous results using floating-point arithmetic, §5.1 (standard reference, not scraped)