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.
A consistent nonmonotone flux selects a nonentropy expansion shock
Statement refuted
For every , every continuous consistent conservative two-point finite-volume flux, without a monotonicity assumption, sends every bounded BV datum to reconstructions whose strong local limits are Kruzhkov entropy solutions.
Facts & Assumptions
Given: , Burgers' flux , the Riemann datum on and on , and the polynomial flux below.
A continuous consistent numerical flux is inserted in the shared-face flux-difference update, with initial cell averages (Conservative two-point finite-volume schemes for scalar laws).
A locally bounded distributional weak solution satisfies the initial-boundary weak identity for every smooth compactly supported test (Locally bounded distributional weak solutions of scalar laws).
Entropy admissibility requires each Kruzhkov inequality with (Kruzhkov entropy solutions).
For each there is a nonnegative cutoff equal to near the origin and supported in the ball of radius (Explicit compactly supported smooth cutoffs).
The datum is globally bounded and has finite translation variation (Bounded BV data on the real line).
Counterexample
For Burgers' flux , take the bounded BV datum for and for . Define the continuous polynomial flux It is consistent, since , but it is not monotone in its first coordinate. On every grid with as a cell face, the finite-volume scheme keeps the expansion shock fixed. The resulting reconstructions converge strongly locally to a weak solution that fails the Kruzhkov inequality.
The polynomial is continuous. On the diagonal, its correction term vanishes and , so it is consistent. Its first partial derivative is At this equals , so it is not nondecreasing in its first coordinate.
On the uniform cells with , the initial averages are for and for . Every same-state face flux is . The only mixed pair is ; both correction factors vanish and . Thus every face flux equals , and the recurrence leaves every cell average unchanged at every step.
The datum has by [F5]. For any sequence with this aligned grid convention, the piecewise-constant reconstruction is exactly the stationary step function almost everywhere. It therefore converges strongly in local space-time to for and for . Its initial trace is .
Since almost everywhere, for any one has for almost every , because is stationary and vanishes near . Integrating in cancels the initial term in [F2]. The flux contribution is for each , since has compact spatial support. Thus satisfies the weak identity and is a locally bounded distributional weak solution.
Let and choose the cutoff of [F4] with on the unit ball and support in the radius-two ball. The function is nonnegative, smooth, supported in , and satisfies . For , is stationary, so , while and give This contradicts the required nonnegative entropy pairing in [F3].
Remarks
The diagram shows the stationary discontinuity at with its left and right states. The horizontal axis is space and the vertical axis is time. The proof verifies the weak equation and entropy defect by direct integration; it does not rely on the drawing.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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)