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.
Monotone finite-volume scheme and invariant-interval CFL
Definition
Let and let as in Bounded BV data on the real line. Put , and . A monotone consistent two-point flux on is a locally Lipschitz map such that for every , is nondecreasing on , and is nonincreasing on . Choose finite coordinate Lipschitz bounds on : Local Lipschitz continuity on the compact square supplies such bounds.
For a mesh width and time step , use the half-open cells , initial cell averages and the shared-flux update The full invariant-interval CFL bound is The flux-difference scheme is conservative in the shared-face sense of Conservative two-point finite-volume schemes for scalar laws. The update stencil and positive rightward flux orientation are shown here; the proofs use the displayed recurrence, not the drawing.
diagram failed to render:
\begin{tikzpicture}[x=1.05cm,y=1cm]
\draw (0,0) rectangle (2,0.7);
\draw (2,0) rectangle (4,0.7);
\draw (4,0) rectangle (6,0.7);
\node at (1,0.35) {$U_{j-1}^n$};
\node at (3,0.35) {$U_j^n$};
\node at (5,0.35) {$U_{j+1}^n$};
\draw[->] (1.55,1.05) -- (2.45,1.05);
\draw[->] (3.55,1.05) -- (4.45,1.05);
\node at (2,1.32) {$F(U_{j-1}^n,U_j^n)$};
\node at (4,1.32) {$F(U_j^n,U_{j+1}^n)$};
\node[align=center] at (3,-0.7) {$U_j^{n+1}=U_j^n-\lambda(\text{right flux}-\text{left flux})$};
\end{tikzpicture}Remarks
The same face value leaves one cell and enters the next with opposite signs. Monotonicity and the stated CFL bound make the three-argument update map order-preserving on and preserve constant states, as proved in Invariant range, TVD and time increments for a monotone finite-volume update.
Depends on
Used by
- Piecewise-linear time interpolant of a finite-volume scheme Definition
- Burgers Godunov flux under the invariant-interval CFL bound Example
- Godunov scheme captures a stationary Burgers entropy shock Example
- Lax–Friedrichs flux under the invariant-interval CFL bound Example
- Positive-state Burgers shock and the monotone finite-volume baseline Example
- Discrete Kruzhkov inequality for a monotone finite-volume scheme Lemma
- Invariant range, TVD and time increments for a monotone finite-volume update Lemma
- Local compactness and initial trace for BV finite-volume states Lemma
- Strong entropy convergence of monotone finite-volume schemes Theorem
Dependency tree · two levels
6 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
- Jérôme Droniou, A beginner’s course in finite volume approximation of scalar conservation laws, complete lecture note (standard reference, not scraped)
- Siddhartha Mishra, Ulrik S. Fjordholm and Rémi Abgrall, Numerical Methods for Conservation Laws, ETH lecture notes (standard reference, not scraped)