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.
Outward-rounded interval, rectangle and ball operations
Definition
For real intervals and , compute the displayed exact
endpoint formulas and round the lower endpoint down and the upper endpoint up
in the format of
Dyadic floating-point format and directed rounding. If either exact
endpoint overflows, return overflow with the outward extended endpoints;
never substitute a finite endpoint for an overflow sentinel. Addition is
, subtraction is , and multiplication is
. Division is defined only when
and is , with reciprocal endpoints computed as exact
rationals before outward rounding. Squaring is
when and
otherwise. Square root is defined only for
and is enclosed by applying
Exact dyadic bisection for square-root endpoints to the exact dyadic endpoints with
request , where is the selected format precision, and rounding
outward for storage.
If for division, return split-domain with the two subdomains
and , or entire when the caller does not
request subdivision. No finite quotient interval is returned in this case.
An invalid square-root domain returns domain-error or an explicitly
restricted nonnegative subdomain.
Complex-rectangle addition, subtraction and multiplication use , applying the real interval operations to each component. For a rectangle excluding , define its reciprocal by , computing the square hulls, their sum, and the component quotient endpoint formulas as exact rationals before rounding the final reciprocal components outward. The exact denominator interval is strictly positive because at least one coordinate interval excludes zero; do not round it before division, since underflow could introduce zero. Propagate any final endpoint overflow. Division multiplies by this reciprocal.
For a ball , let and
be its coordinate projection intervals. For a real
interval , let and let if
, otherwise . Put
and . Then
for every and for every such .
Define ball addition and subtraction as
, multiplication as
, and division as
only when . These
origin-centered output balls are conservative but inclusion-isotone. If
, return split-domain, entire, or inconclusive; if a radius
overlows, return overflow.
Well-definedness
Dyadic endpoints are rational, so every real arithmetic endpoint and every complex-division component before square root is rational. Reciprocals are formed only for nonzero rational endpoints. In a complex rectangle excluding zero, at least one coordinate interval omits zero; its exact squared interval has a strictly positive lower endpoint, so the unrounded does also. The prescribed exact rational component quotients therefore have nonzero denominators even when storage rounding would underflow that lower bound. For ball division, gives for every . Every endpoint overflow is reported explicitly and cannot produce a finite-result claim.
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 geometric predicate for interval-valued coordinates Algorithm
- Certified Hermitian eigenvalue intervals from residual and Gram bounds Algorithm
- Certified range evaluation for elementary real and complex functions Algorithm
- Finite certified Airy power-series evaluation Algorithm
- Finite certified evaluation of Gamma and a continued log-Gamma branch Algorithm
- Finite certified evaluation of integer-order Bessel functions Algorithm
- Finite certified evaluation of the scaled complementary error function Algorithm
- Finite certified power-series evaluation for Fresnel, erf, and Gauss functions Algorithm
- Finite checker for rational residual-tube certificates Algorithm
- Finite complex contour resolvent validator with cover and inconclusive statuses Algorithm
- Finite McCormick convex relaxation construction for factorable box problems Algorithm
- Finite precision point linear solve certificate with explicit status Algorithm
- Finite primitive and contracted Gaussian integral evaluation with certified screening Algorithm
- Finite-budget certified evaluation of Boys function tables 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
- 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-bounded floating determinant filter 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
- Certified special-function enclosure result Definition
- Finite rational residual-tube certificate for an ODE trajectory Definition
- A nearly cocircular quadruple has a certified lifted sign Example
- A nearly collinear dyadic triangle falls through to the exact sign Example
- An uncertain coordinate interval does not decide orientation Example
- Division of [1,2] by [-1,1] has no finite hull Example
- Natural interval subtraction loses repeated-input correlation Example
- Finite real interval operations enclose their exact values Lemma
- The certified particle-mesh Ewald evaluator terminates with finite outputs or an explicit status Lemma
- Upward and downward Boys recurrence error amplification bounds Lemma
…and 12 more results.
Dependency tree · two levels
5 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
- Kearfott, Interval Computations: Introduction, Uses, and Resources, §1 (standard reference, not scraped)
- Rump, Verification methods: Rigorous results using floating-point arithmetic, §§5.1–5.5 (standard reference, not scraped)