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 conservative consistent finite-volume weak limit need not be entropic
Statement refuted
Conservativity, diagonal flux consistency, local uniform boundedness and strong local convergence alone imply Kruzhkov entropy admissibility.
Facts & Assumptions
Given: The Axiom of Countable Choice , Burgers' flux , the Godunov finite-volume scheme with , cell-average Riemann data for and for , and the resulting piecewise-constant reconstructions.
is the axiom that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice ()).
The numerical update is the right-minus-left shared-flux difference and starts from the cell averages of . (Conservative two-point finite-volume schemes for scalar laws)
The reconstruction equals on . (Piecewise-constant finite-volume state and face-flux reconstructions)
For Burgers' flux, and ; the flux is continuous and diagonal-consistent. (Godunov numerical flux for Burgers' equation, The Burgers Godunov flux is continuous and consistent)
Strong local convergence and local uniform state bounds imply that the conservative consistent scheme's limit satisfies the distributional weak identity with the initial boundary term. (Conservative finite-volume strong-limit theorem)
A Kruzhkov entropy solution satisfies, for every real and every nonnegative , (Kruzhkov entropy solutions)
Counterexample
Cell averages of are for and for . The only face pairs along the resulting step are , and ; [F3] gives their fluxes as . The ratio , while , so the usual noninteraction bound fails.
Assume inductively for and for . If , both face fluxes are , so the state remains . At , the left flux is and the right flux is , hence . For both fluxes are , so those states remain . Therefore the step shifts to for and for .
On , the numerical jump is at , while the limit jump is at . The profiles differ only on a strip of width at most and height , so the error on every bounded space-time rectangle is at most . All states are bounded by . By [F4], the limit for and for is a locally bounded distributional weak solution with those initial data.
Take . Then , while and . Choose nonnegative with and nonnegative with , and set . This is an admissible nonnegative test. To evaluate its time term, put . Differentiating the smooth compactly supported test and changing variables gives ; the last integral is zero because is compactly supported. Therefore . Splitting the flux integral at and applying the fundamental theorem of calculus gives . Thus the integral in [F5] equals , contradicting the required entropy inequality. The weak limit is not Kruzhkov entropic.
Depends on
- Conservative two-point finite-volume schemes for scalar laws
- Piecewise-constant finite-volume state and face-flux reconstructions
- Godunov numerical flux for Burgers' equation
- The Burgers Godunov flux is continuous and consistent
- Conservative finite-volume strong-limit theorem
- Kruzhkov entropy solutions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
22 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
- H. De Sterck and P. Ullrich, Introduction to Computational PDEs, Chapter 3, complete chapter, PDF pp. 81–106 (standard reference, not scraped)
- Benjamin Seibold, MIT OpenCourseWare 18.336, Lecture 19: Finite Volume Methods, complete six-page note (standard reference, not scraped)