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 Cartesian grids and tensor-product multilinear interpolation
Definition
Fix an integer and integers , . This is the unit-period specialization of the periodic tensor-grid definition in Periodic tensor grids and multilinear interpolation, with each period . Put and define the periodic unit torus as ; functions on it are identified with -periodic functions on . The Cartesian grid has nodes Indices on nodal arrays are always reduced modulo in coordinate .
For a nodal array and in the cell with lower corner , write in a periodic lift, where . Write for the supplier's tensor-product multilinear interpolant. In the local coordinates above, it is At cell faces either adjacent cell formula gives the same value, because the weight of the opposite face is zero. The formula is periodic and therefore defines on .
In dimension two the four nodal weights on one cell are shown below. The dot is the evaluation point; the labels are exactly the four factors in the formula. The diagram fixes the cell convention only; no later proof relies on it.
Remarks
For the lower-left node the weight is ; the other three weights are , , and . In every dimension the weights are nonnegative and sum to one by Periodic multilinear interpolation is convex and L-infinity contractive. The next local lemma proves the smooth interpolation error used by the schemes.
Depends on
Used by
- CFL-monotone upwind update for first-order HJB equations Algorithm
- Explicit monotone diagonal-diffusion Bellman grid update Algorithm
- Positive-interpolation semi-Lagrangian update for first-order HJB equations Algorithm
- A centered HJB update can fail monotonicity Counterexample
- Periodic diagonal controlled-diffusion HJB Cauchy problem Definition
- Periodic first-order controlled Hamilton–Jacobi Cauchy problem Definition
- Initial trace for the explicit diagonal-diffusion HJB scheme Lemma
- Initial trace for the positive-interpolation and upwind HJB schemes Lemma
- Localization of strict half-relaxed contacts to periodic mesh nodes Lemma
- Positive partition of unity and interpolation error for periodic multilinear interpolation Lemma
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)