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.
Initial trace for the positive-interpolation and upwind HJB schemes
Statement
Let be continuous and periodic, and let and bound the drift and running cost in Periodic first-order controlled Hamilton–Jacobi Cauchy problem. For the semi-Lagrangian scheme, if , , and , then For the upwind scheme, the same conclusion holds when , , and its CFL condition holds. Both statements are uniform over all finite control policies and remain true for a finite control discretization.
Facts & Assumptions
Given: The two finite update rules, bounded coefficients, continuous periodic , and a time step satisfying the corresponding mesh condition. For each finite transition tree, denotes the finite sum of path values weighted by the products of their row weights.
The semi-Lagrangian transition weights are the nonnegative tensor weights of Periodic Cartesian grids and tensor-product multilinear interpolation; they sum to one and each coordinate node lies within of the footpoint (Positive partition of unity and interpolation error for periodic multilinear interpolation).
The upwind row weights under the CFL condition are its center weight and neighbor weights , (CFL-monotone upwind update for first-order HJB equations).
The coefficient and reward bounds are and , and is continuous and periodic (Periodic first-order controlled Hamilton–Jacobi Cauchy problem).
The restriction of a continuous periodic lift of to the compact cube is uniformly continuous; translating nearby torus lifts into this cube gives a common modulus (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, Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous, Periodic Cartesian grids and tensor-product multilinear interpolation).
Proof
For a semi-Lagrangian row at a node and action , view its interpolation weights as a finite probability vector on the cell nodes around . In a periodic lift, the weighted mean of each coordinate is , by the product formula in [F1]. The centered interpolation error therefore has weighted mean zero and satisfies .
For an upwind row, the weights in [F2] are nonnegative and sum to one by CFL. The weighted mean displacement to the previous-time node is : in coordinate it is . Its centered error has mean zero and second moment at most , since subtracting the squared mean cannot increase the second moment.
Unroll either update for the finite number of steps. At each stage the minimum chooses one of finitely many control rows, and each row is a finite weighted average; induction therefore represents the value as the minimum of finite weighted path costs . Along any such controlled path the sum of the drift increments has norm at most . The centered increments have conditional mean zero. For , summing the increment over all next-branch weights from each fixed path prefix through time gives zero; hence the finite weighted cross term is zero. Expanding the square therefore shows that their total second moment is at most for the semi-Lagrangian rows and for the upwind rows. Thus the endpoint displacement obeys for the semi-Lagrangian case and for the upwind case. Every path's accumulated reward has magnitude at most .
Let and let be the uniform modulus from [F4]. For any , split the finite weighted endpoint average into paths with and its complement. On the first set, ; on the complement, it is at most . The complement weight is at most . By step 1.3 this tends to zero as under for the semi-Lagrangian scheme, and under for the upwind scheme. The reward contributes at most ; the same two-sided bound holds after taking a minimum over policies. First let the mesh and tend to zero, then let . This proves the asserted uniform initial trace.
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
- Periodic first-order controlled Hamilton–Jacobi Cauchy problem
- Periodic Cartesian grids and tensor-product multilinear interpolation
- Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous
- 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
Used by
Dependency tree · two levels
48 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)
- Hung Vinh Tran, Hamilton–Jacobi Equations: Theory and Applications, 2020 author manuscript (standard reference, not scraped)