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.
Godunov scheme captures a stationary Burgers entropy shock
Example
Assume . For Burgers' flux , take for and for . Use , , and the Godunov flux from Godunov numerical flux for Burgers' equation. The grid interface is aligned with the initial jump. Every numerical face flux is , so the finite-volume profile is stationary at every time step. The exact shock speed is zero, and the stationary jump satisfies all Kruzhkov entropy inequalities. Theorem Strong entropy convergence of monotone finite-volume schemes therefore applies, although in this aligned example the reconstructions already equal their limit exactly.
The diagram shows the stationary interface and the two constant states. The horizontal coordinate is , the vertical coordinate is time, and the vertical line is the shock curve ; the proof uses the recurrence and entropy fluxes, not the drawing.
Facts & Assumptions
Given: , , the Riemann datum on and on , , , and the Burgers Godunov flux.
The Burgers Godunov flux has and, when , (Godunov numerical flux for Burgers' equation, The Burgers Godunov flux is continuous and consistent).
Under , the chosen Godunov flux has coordinate Lipschitz bounds on , so satisfies the full CFL bound; the entropy-convergence theorem then applies to bounded BV data (Burgers Godunov flux under the invariant-interval CFL bound, The Axiom of Countable Choice (), Strong entropy convergence of monotone finite-volume schemes).
A bounded weak solution satisfies the integral identity with the initial boundary term (Distributional weak solutions of the Cauchy problem).
For a piecewise smooth weak solution with a graph shock and distinct traces, the Rankine–Hugoniot speed is (The Rankine--Hugoniot jump condition in space--time normal form).
Kruzhkov entropy admissibility is the family of inequalities using , together with a strong local initial trace (Kruzhkov entropy solutions).
The datum is a bounded BV equivalence class with total translation variation (Bounded BV data on the real line).
Verification
The initial cell averages are for and for . Same-state faces have flux by [F1], and the only mixed face has pair and flux . Thus every face flux equals .
Every cell's left and right fluxes are both , so the conservative update leaves every unchanged. Induction in proves that both reconstructions equal the stationary step function almost everywhere for every ; in particular they converge strongly locally to it.
The stationary profile is a bounded weak solution: for every , its time term satisfies , while almost everywhere and hence at each time. This is exactly the weak identity of [F3].
Fix . The entropy flux traces are on the left and on the right. If or , both states lie on the same side of and these fluxes are equal because . If , then For any nonnegative interior test , the time term vanishes because is stationary. Integration on the two half-lines gives The initial trace is exactly , so [F5] shows the stationary shock is a Kruzhkov entropy solution.
The left and right traces are and . By [F4], the shock speed is which agrees with the stationary interface. The Rankine–Hugoniot supplier applies because step 3.1 verified the weak identity and the traces are distinct.
The translation variation of the datum is : for , is nonzero only on , where its absolute value is , so . The ratio is , and the flux bounds from [F2] give . Thus the hypotheses of the main convergence theorem in [F2] hold; since the exact reconstruction is the entropy solution from step 3.2, it is the unique limit. No global assertion is made because the two tails are nonzero.
Depends on
- Bounded BV data on the real line
- Monotone finite-volume scheme and invariant-interval CFL
- Godunov numerical flux for Burgers' equation
- The Burgers Godunov flux is continuous and consistent
- Distributional weak solutions of the Cauchy problem
- The Rankine--Hugoniot jump condition in space--time normal form
- Kruzhkov entropy solutions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Burgers Godunov flux under the invariant-interval CFL bound
- Strong entropy convergence of monotone finite-volume schemes
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
41 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)