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 advection schemes and the finite-interval upwind row
Definition
Use the index sets and uniform spacings of Uniform periodic, infinite, and Dirichlet grid conventions: , , or reduced modulo in the periodic case. Fix , , and . The target equation is the one-dimensional constant-velocity transport equation , the constant-coefficient case of Linear transport equations and their characteristic flow. Set and define, for , On a periodic grid, every index in these formulas is reduced modulo ; no physical boundary data are present. For , reflect the stencil by and replace by .
For a finite interval with , the inflow boundary is . The upwind initial/boundary rows are for , with , and The outflow node is computed by this row and receives no prescribed value. This item supplies no finite-interval boundary closure or stability statement for centered, Lax--Friedrichs, or Lax--Wendroff updates.
Depends on
Used by
- CFL-monotone upwind update for first-order HJB equations Algorithm
- Centered advection is consistent and unstable under the CFL bound Example
- Grid Fourier stability alone does not instantiate Lax equivalence Example
- Upwind damping versus downwind growth on a periodic grid Example
- Amplification symbols for periodic scalar advection stencils Lemma
- Scheme-specific periodic power stability for scalar advection Theorem
- Smooth consistency orders for the five periodic advection stencils Theorem
- The nearest-neighbor CFL condition is necessary but not sufficient Theorem
Dependency tree · two levels
7 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)
- Benjamin Seibold, MIT 18.336 Lecture 15, Finite Difference Methods for the One-Way Wave Equation (standard reference, not scraped)
- Benjamin Seibold, MIT 18.336 Lecture 18, Boundary Conditions for Advection (standard reference, not scraped)