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.
A transverse backward boundary hit has a certified time and trace error bound
Statement
Let be a compact bracket, let be an exact incoming characteristic on , and let be a boundary guard that is -Lipschitz in its state argument on a tube containing the exact path and a dense reconstruction . Suppose has a root and a declared orientation with throughout . If then the matched first-hit time satisfies If the boundary value is Lipschitz in time and state with constants on the same tube and , then This is a local one-hit bound. It gives no conclusion at grazing, unresolved, or simultaneous events.
Facts & Assumptions
Given: A smooth mode characteristic, a boundary guard and orientation, a matched transverse first-hit bracket, a dense-output error bound, a reported guard residual, and the stated boundary-data Lipschitz bounds.
Smooth hybrid ODE modes, guards, resets, and deterministic event priority: a smooth mode follows its ODE until a selected guard event; the event orientation is part of the guard data.
The derivative of a guard along an ODE mode is its Lie derivative: along , the guard derivative is .
A transverse hybrid event time is stable under dense-output and root error: dense state error , guard residual , guard state-Lipschitz constant , and transverse margin imply on the matched bracket.
A first-order initial value problem is equivalent to its Volterra integral equation: a mode trajectory increment equals the oriented integral of its vector field.
For and integrable when , ; for , is integrable: for ordered endpoints , ; reversed oriented integrals must first be rewritten with ordered endpoints.
Proof
If , then , so the time error is zero and hence at most . The stated bounds give ; the state-Lipschitz bound for gives . Here from the error and residual bounds, , and the nonnegative Lipschitz constant , while . Assume below.
By [F2], the transversality hypothesis is the mode derivative condition required by [F3]. Apply [F3] to this matched bracket with the stated ; it yields the unique transverse root and the displayed bound .
By [F4], the increment is the oriented integral from to . Set and ; changing orientation only negates the vector integral, so [F5] gives . The triangle inequality with the dense-output bound gives . Apply the time and state Lipschitz inequalities for to obtain the second displayed bound.
Remarks
An inflow/exit implementation must use a certified first-hit bracket and return unresolved when the bracket or orientation is not certified. This local result does not propagate errors through resets or an event list; those require the full finite-separated-event hypotheses of Finite separated transverse events give an event-aligned hybrid trajectory error bound.
Depends on
- Smooth hybrid ODE modes, guards, resets, and deterministic event priority
- The derivative of a guard along an ODE mode is its Lie derivative
- A transverse hybrid event time is stable under dense-output and root error
- A first-order initial value problem is equivalent to its Volterra integral equation
- For $a \le b$ and $f : [a,b] \to \mathbb{R}^m$ integrable when $a<b$, $\bigl\lVert\int_a^b f\bigr\rVert_2 \le \int_a^b \lVert f\rVert_2$; for $a<b$, $\lVert f\rVert_2$ is integrable
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
38 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
- European Centre for Medium-Range Weather Forecasts, Numerical Methods, Meteorological Training Course Lecture Series, 2002 (standard reference, not scraped)
- Lukas Einkemmer and Alexander Ostermann, On the error propagation of semi-Lagrange and Fourier methods for advection problems, Computers & Mathematics with Applications 69 (2015), 170–179 (standard reference, not scraped)