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.
Convergence of the positive-interpolation and upwind first-order HJB schemes
Statement
Let and the coefficients satisfy Periodic first-order controlled Hamilton–Jacobi Cauchy problem. Consider a sequence of periodic grids with , time steps , , and finite nonempty control sets whose Hamiltonian errors tend to zero for each finite . For the positive-interpolation scheme additionally assume . For the upwind scheme assume its CFL condition at every step. Extend the initial interpolant constantly for and identify the mesh sequence with the parameter family for in Half-relaxed limits of a locally bounded family. Then the respective piecewise multilinear-in-space, piecewise-constant-in-time extensions of the nodal solutions converge locally uniformly on to the same bounded continuous viscosity solution of the Cauchy problem. This conclusion includes exact finite-control models (), where . The proof does not assert a rate.
Facts & Assumptions
Given: One of the two scheme families and mesh conditions in the statement. Let denote its spatially multilinear and temporally piecewise-constant periodic extension on , initialized as in the statement for .
Each update is order-preserving and commutes with adding a constant to all nodal values; it is bounded by the preceding sup norm plus . Its smooth-test residual is , uniformly on compact test sets, with the respective conditions or CFL and with (Monotonicity, L-infinity stability, and consistency of the semi-Lagrangian HJB step, Monotonicity, L-infinity stability, and consistency of the upwind HJB step).
For any locally bounded family, the set-defined upper and lower half-relaxed limits are respectively upper and lower semicontinuous, satisfy , and have sequential recovery pairs under Countable Choice (Half-relaxed limits of a locally bounded family, The Axiom of Countable Choice ()).
A strict upper (respectively lower) half-relaxed contact by a smooth test localizes to nodal local maxima (respectively minima) on a fixed space-time ball; the localizing nodes converge to the contact and their values recover the envelope (Localization of strict half-relaxed contacts to periodic mesh nodes).
Testing a subsolution or supersolution with smooth tests is equivalent to testing with all tests for this first-order equation (Smooth test functions suffice for the first- and second-order HJB viscosity notions).
The periodic HJB Hamiltonian obeys so with it satisfies the positive-constant whole-space comparison bounds and comparison applies to bounded USC subsolutions and bounded LSC supersolutions on the periodic lift when their initial traces are ordered (Periodic first-order controlled Hamilton–Jacobi Cauchy problem, Comparison for first-order Hamilton--Jacobi equations).
For the semi-Lagrangian branch the nodal values approach uniformly as under ; for the upwind branch the same holds under its CFL condition (Initial trace for the positive-interpolation and upwind HJB schemes).
The convex interpolation weights give for a modulus , by uniform continuity of the periodic initial data (Positive partition of unity and interpolation error for periodic multilinear interpolation, Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous).
Every open cover of a compact subset of the lifted space-time domain has a finite subcover (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line).
Countable Choice is used in [F2] and [F3] only to select near-recovery pairs and contradiction subsequences; no choice is used in any finite row calculation (The Axiom of Countable Choice ()).
Proof
By the stability part of [F1] and , all nodal values satisfy The convex interpolation weights give the same bound for , so the family is locally bounded on . Form its upper and lower half-relaxed limits as in [F2].
Let have a local maximum at an interior point , with smooth. Add to ; this makes the contact strict without changing its first derivatives at , as in [F4]. Choose the nodal local maxima in [F3], with ; write . For all sufficiently large , every node used by the previous-time update at lies inside the fixed contact ball: the upwind neighbors are at distance at most and each semi-Lagrangian interpolation vertex is at distance at most . Hence each such previous-layer nodal value satisfies . Order preservation and constant-shift invariance from [F1] imply Since , the normalized residual is nonpositive. Taking and using the consistency estimate in [F1] gives . By [F4], is a viscosity subsolution for the full test class.
At a local minimum of , subtract from to make the contact strict without changing its derivatives at , as in [F4]. Use the minimizing nodes in [F3]. All previous-layer stencil nodes lie in the contact ball, so . Order preservation and constant-shift invariance now yield the reverse update inequality, hence the normalized consistency residual is nonnegative. Passing to the limit gives the viscosity supersolution inequality. The smooth-test equivalence [F4] extends it to every lower test.
The initial trace estimate [F6] and the interpolation error [F7] show that both half-relaxed limits equal on . They are bounded by step 1.1 and have the required semicontinuity by [F2]. Apply comparison [F5] to the periodic lifts of and : it gives . The reverse inequality is part of [F2], so they coincide with a continuous viscosity solution having initial data .
Fix and let in the periodic lift; it is compact by [F8]. Fix and write for the common continuous limit from step 2.3. For and , put when the set-defined upper and lower envelopes in [F2] give and continuity gives whenever . The family of all balls covers : each point has a positive real radius from the two envelope definitions and continuity, and a smaller rational radius still works. This is the family of all qualifying pairs, so no radius is selected for every point. By [F8] take a finite subcover and let be its least radius. For , every lies in one of these balls and therefore . This proves uniform convergence on the fundamental box through , hence on the torus and every compact subset of .
Depends on
- Positive-interpolation semi-Lagrangian update for first-order HJB equations
- CFL-monotone upwind update for first-order HJB equations
- Positive partition of unity and interpolation error for periodic multilinear interpolation
- Monotonicity, L-infinity stability, and consistency of the semi-Lagrangian HJB step
- Monotonicity, L-infinity stability, and consistency of the upwind HJB step
- Initial trace for the positive-interpolation and upwind HJB schemes
- Localization of strict half-relaxed contacts to periodic mesh nodes
- Smooth test functions suffice for the first- and second-order HJB viscosity notions
- Periodic first-order controlled Hamilton–Jacobi Cauchy problem
- Half-relaxed limits of a locally bounded family
- Viscosity subsolutions and supersolutions of a first-order equation and of the Cauchy problem
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Comparison for first-order Hamilton--Jacobi equations
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous
Used by
Dependency tree · two levels
77 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)
- Guy Barles and Panagiotis E. Souganidis, Convergence of approximation schemes for fully nonlinear second order equations (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)