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.
Finite checker for rational residual-tube certificates
Definition
Input a finite rational certificate of Finite rational residual-tube certificate for an ODE trajectory, an outward-rounded real interval format, and the matching operation evaluator of Outward-rounded interval, rectangle and ball operations. Return either certified or inconclusive by this finite procedure:
- Parse and structurally check the rational field DAG, finite mesh, panel polynomials, state boxes, radius polynomials, rational bounds, and subdivisions. Reject malformed syntax, noncanonical/nonfinite numbers, gaps, nontrivial interior overlaps, endpoint mismatches, or a non-acyclic graph as
inconclusive. - In topological order, construct the formal time/state derivative DAG for each field output by Symbolic derivative recursion for a rational expression DAG is correct. If any recursion node is unsupported, return
inconclusive. - Convert each exact rational cell endpoint and constant to a directed outward dyadic interval. On each supplied time cell and panel box, evaluate the field, derivative DAG, reconstruction, its derivative, radius and strict-margin expressions using only outward-rounded real interval addition, subtraction, multiplication, division, and rational constants. If any operation returns
split-domain,entire,domain-error,overflow, orinconclusive, returninconclusive. - Check exactly that the time cells cover each panel and that neighboring reconstruction/radius endpoints agree; verify the initial squared-error inequality separately. From interval endpoints check: each radius and each strict supersolution margin has strictly positive lower endpoint; the componentwise reconstruction-plus-radius boxes lie inside ; the residual component intervals satisfy the displayed squared-norm bound by ; all field and derivative denominator intervals exclude zero; and the squared Frobenius bound on the state Jacobian is at most . Check the initial squared error bound and strict comparison by exact rational arithmetic.
- Return
certifiedonly when every check passes. Any failed inclusion or comparison returnsinconclusivewith the first failed check identifier. No automatic subdivision, transcendental evaluation, complex rectangle operation, or ball operation is performed.
The finite interval evaluator and its DAG interpretation are those of Outward-rounded interval, rectangle and ball operations and Outward-rounded operations are inclusion-isotone and enclose DAG evaluations. A separate theorem proves soundness of every certified result.
Depends on
- Outward-rounded interval, rectangle and ball operations
- Finite rational residual-tube certificate for an ODE trajectory
- Symbolic derivative recursion for a rational expression DAG is correct
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- Outward-rounded operations are inclusion-isotone and enclose DAG evaluations
Used by
Dependency tree · two levels
30 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
- R. Baker Kearfott, Interval Computations: Introduction, Uses, and Resources, §1 (standard reference, not scraped)
- S. M. Rump, Verification methods: Rigorous results using floating-point arithmetic, §§5.1–5.5 (standard reference, not scraped)