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.
Dyadic floating-point format and directed rounding
Definition
An exact dyadic rational is a number with integers . Fix integers and . Put and . The finite representable set consists of zero, both signs of every normal number with integers satisfying and , and both signs of every subnormal number with integer satisfying . The smallest positive subnormal is , the smallest positive normal is , and the largest finite magnitude is . The extended endpoint set also contains and as enclosure sentinels; they are not finite machine numbers.
For a real with , define as the
greatest member of not exceeding , and as
the least member of not less than . Define
. Set .
For nonzero in the
subnormal range, define the absolute-error bound ;
for in the normal range, define
. For , set
; for
, set
.
In either overflow case set and report
overflow, even when the selected directed endpoint is finite.
The rounding procedure reports finite, subnormal, or
overflow, so no relative-error assumption is implicit.
An exact rational intermediate may be converted by comparing integer numerators and denominators after clearing powers of two. A directed interval endpoint is the resulting greatest lower or least upper member of the extended endpoint set .
Depends on
Used by
- 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 range evaluation for elementary real and complex functions Algorithm
- Exact dyadic bisection for square-root endpoints Algorithm
- Finite certified Airy power-series evaluation Algorithm
- Finite primitive and contracted Gaussian integral evaluation with certified screening Algorithm
- Finite-budget certified evaluation of Boys function tables Algorithm
- Finite-budget validated range evaluation Algorithm
- Outward-bounded floating determinant filter Algorithm
- Outward-rounded interval enclosures for factorable expression DAGs on boxes Algorithm
- Dyadic orientation and lifted sphere determinants Definition
- Outward-rounded interval, rectangle and ball operations Definition
- A nearly cocircular quadruple has a certified lifted sign Example
- A nearly collinear dyadic triangle falls through to the exact sign Example
- A positive mode multiplier too small to certify Example
- Clearing dyadic row denominators preserves determinant sign Lemma
- Directed dyadic rounding encloses with explicit underflow and overflow bounds Lemma
- Rational boxes admit dyadic enclosure boundaries and exact affine root charts Lemma
- The certified particle-mesh Ewald evaluator terminates with finite outputs or an explicit status Lemma
- Outward interval and Lipschitz midpoint bounds are sound and consistent under refinement Theorem
- Sound integral enclosure from certified adaptive Simpson Theorem
Dependency tree · one level
1 result 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
- Tucker, Validated Numerics: A Short Introduction to Rigorous Computations, Ch. 1 Computer Arithmetic (standard reference, not scraped)
- Rump, Verification methods: Rigorous results using floating-point arithmetic, §4 (standard reference, not scraped)