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.
Invariant range, TVD and time increments for a monotone finite-volume update
Statement
Let and put . Let be generated by Monotone finite-volume scheme and invariant-interval CFL under its full invariant-interval CFL bound. Define the update map Then is nondecreasing in each coordinate on and for . Consequently, Moreover, for every , For a sequence , the notation is used only when this sum is finite; and mean the coordinatewise maximum and minimum.
Facts & Assumptions
Given: , , the cells and cell-average initialization, a locally Lipschitz monotone consistent flux on , coordinate bounds , with , and the flux-difference update.
means for every (Bounded BV data on the real line).
Each updated coordinate is and is defined from the flux-difference rule (Monotone finite-volume scheme and invariant-interval CFL).
Proof
For a finite set , the cell-average formula gives Taking the supremum over finite proves the initial discrete variation bound. Every initial cell average lies in , since almost everywhere on its cell.
If or increases, monotonicity of in its first or second coordinate makes nondecreasing in that variable. If , coordinate Lipschitz bounds give Thus is nondecreasing in all coordinates. Consistency gives .
Suppose takes values in . Coordinatewise comparison with the constant triples and , followed by step 1.2, yields . Induction from step 1.1 proves the range bound at every time.
Let denote the sequence update. If and , monotonicity gives coordinatewise. The difference on the right is summable: the update formula and the coordinate Lipschitz bounds make its flux differences summable. For any with , summing the update over yields The coordinate Lipschitz bounds make , so both boundary terms tend to zero. The update difference is absolutely summable, and hence . Applying this to and proves .
The initial neighbor difference is summable by step 1.1. The update commutes with integer shifts because the same is applied at every index. Apply step 2.2 to and its shift to obtain Induction proves the stated TVD bound.
Adding and subtracting in the update and using the two coordinate Lipschitz bounds gives Multiply by , sum over , and use step 3.1 to obtain the time-increment estimate.
Depends on
Used by
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)