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.
Periodic first-order controlled Hamilton–Jacobi Cauchy problem
Definition
Let , , and let be a nonempty compact subset of (a finite action set is included). For each , let and be bounded and jointly continuous in . Write also for their periodic lifts to . Assume there are constants such that and for all , , and , Given continuous periodic initial data , define The periodic first-order controlled Hamilton–Jacobi Cauchy problem is The signs are fixed by . Whenever the controls are discretized, use a sequence of finite nonempty sets and define Define the Hamiltonian error by The sequence is admissible when for every . Exact minimization over corresponds to . Scheme convergence below uses this explicit control-grid error whenever the controls are discretized.
Remarks
The compact action set and continuity make each displayed maximum attained. The coefficient assumptions imply the exact first-order comparison bounds on the periodic extension to : Thus the published whole-space comparison theorem applies once bounded upper semicontinuous subsolutions and bounded lower semicontinuous supersolutions with the same pointwise initial ordering have been established.
Depends on
Used by
- CFL-monotone upwind update for first-order HJB equations Algorithm
- Positive-interpolation semi-Lagrangian update for first-order HJB equations Algorithm
- A centered HJB update can fail monotonicity Counterexample
- An eikonal kink and its monotone HJB grid updates Example
- Uniform Hamiltonian error for an evenly spaced compact-control grid Example
- Initial trace for the positive-interpolation and upwind HJB schemes Lemma
- Smooth test functions suffice for the first- and second-order HJB viscosity notions Lemma
- Convergence of the positive-interpolation and upwind first-order HJB schemes Theorem
- Monotonicity, L-infinity stability, and consistency of the semi-Lagrangian HJB step Theorem
- Monotonicity, L-infinity stability, and consistency of the upwind HJB step Theorem
Dependency tree · two levels
23 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
- Hung Vinh Tran, Hamilton–Jacobi Equations: Theory and Applications, 2020 author manuscript (standard reference, not scraped)
- Kristian Debrabant and Espen R. Jakobsen, Semi-Lagrangian schemes for linear and fully non-linear Hamilton-Jacobi-Bellman equations (standard reference, not scraped)