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.
Monotonicity, L-infinity stability, and consistency of the semi-Lagrangian HJB step
Statement
For the update of Positive-interpolation semi-Lagrangian update for first-order HJB equations, if at all nodes then . If , then For in space and time with bounded derivatives, on a compact test region with , The term is zero when the full finite control set is used.
Facts & Assumptions
Given: The positive-interpolation update, coefficient bounds , a periodic smooth test function, and the control-grid error .
The interpolant is order-preserving, contractive in , and approximates a smooth function with error at most (Positive partition of unity and interpolation error for periodic multilinear interpolation).
The Hamiltonian and sign convention satisfy , and , (Periodic first-order controlled Hamilton–Jacobi Cauchy problem).
Proof
If , [F2] gives at every footpoint. Adding the same running cost preserves the inequality for each action, and taking the minimum preserves it again; hence . Also by the convex weights in [F2]. Every action value in [F1] therefore has absolute value at most , and so does their minimum.
Let in a periodic lift. By [F2], Taylor expansion at gives The minimum of finitely many entries changes by at most their largest perturbation. Replacing by changes the minimum of by at most , by [F3]. A time Taylor expansion then yields the normalized residual in the statement, because .
Steps 1.1 and 1.2 prove order preservation, the stated sup-norm bound, and the local consistency error. The interpolation term is divided by , so convergence of this residual requires the explicit condition . No solution-error rate follows from these one-step estimates.
Depends on
Used by
Dependency tree · two levels
10 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
- Kristian Debrabant and Espen R. Jakobsen, Semi-Lagrangian schemes for linear and fully non-linear Hamilton-Jacobi-Bellman equations (standard reference, not scraped)
- Guy Barles and Panagiotis E. Souganidis, Convergence of approximation schemes for fully nonlinear second order equations (standard reference, not scraped)