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.
Validated forward-Euler tube for the periodic flow and variational equation
Definition
Let be . Set and define the augmented autonomous field
on an open set . The exact flow and its differentiability on a common compact tube use Initial-data sensitivity of an ODE flow on a common compact tube. Inputs are a rational initial-state box , a rational period interval , an integer , a compact convex rational tube , and a sound range oracle with rational bounds as in Exact range-oracle contract for validated flow and monodromy enclosures. Use the maximum norm and exact rational set arithmetic. Let and
For , first set
If , return inconclusive. Then request . If it is inconclusive, return inconclusive. Otherwise form
If any required rational set operation is unavailable or the next box is not finite, return inconclusive; otherwise continue. On success return the tube boxes and endpoint box . The first, second, and last coordinate blocks of enclose the exact endpoint, the exact variational matrix, and the period, respectively. The procedure makes no success claim if the supplied range oracle or bounds are not sound on .
Depends on
Used by
Dependency tree · two levels
13 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
- S. M. Rump, Verification methods: Rigorous results using floating-point arithmetic, Acta Numerica 19 (2010) (standard reference, not scraped)
- E. J. Doedel and B. E. Oldeman, AUTO-07P full manual (2021) (standard reference, not scraped)