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.
CFL-monotone upwind update for first-order HJB equations
Definition
Use the model and coefficient notation of Periodic first-order controlled Hamilton–Jacobi Cauchy problem and the periodic grid of Periodic Cartesian grids and tensor-product multilinear interpolation. Choose an integer , set , and put for . Choose a finite nonempty control set . For a finite control model take ; for compact controls use a sequence of finite nonempty sets with the stated uniform Hamiltonian error. For each control and grid node put and define the explicit row The periodic HJB upwind update at time is At every step , require the CFL condition Initialize and perform the updates for . Return . Since the transport velocity in Periodic advection schemes and the finite-interval upwind row is for this Hamiltonian sign convention, the displayed one-sided direction is its sign-reflected upwind row.
Depends on
Used by
- A centered HJB update can fail monotonicity Counterexample
- An eikonal kink and its monotone HJB grid updates Example
- Initial trace for the positive-interpolation and upwind HJB schemes Lemma
- Convergence of the positive-interpolation and upwind first-order HJB schemes Theorem
- Monotonicity, L-infinity stability, and consistency of the upwind HJB step Theorem
Dependency tree · two levels
17 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
- Endre Süli, B6.1 Numerical Solution of Partial Differential Equations (standard reference, not scraped)