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.
Bounded BV data on the real line
Definition
Let be an almost-everywhere equivalence class of measurable functions on with , using the quotient convention of The space as the quotient by null functions, the essentially bounded class of The space of essentially bounded measurable functions, and the local integrability convention of A locally integrable function on . For define where the integral may be . The bounded BV class on the line consists of those classes for which ; we write .
This translation-variation convention is the standard one-dimensional BV seminorm on bounded locally integrable classes. It is unchanged by modifying on a null set, because each translate of a null set is null. It does not require : every bounded constant function belongs to and has variation .
Depends on
Used by
- A consistent nonmonotone flux selects a nonentropy expansion shock Counterexample
- Monotone finite-volume scheme and invariant-interval CFL 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
- 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
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
- 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)