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.
The Burgers Godunov flux is continuous and consistent
Statement
The map defined in Godunov numerical flux for Burgers' equation is continuous on and satisfies for every .
Facts & Assumptions
Given: The flux definition and the consistency convention for a numerical flux.
The case formula for , including its branches and its branch. (Godunov numerical flux for Burgers' equation)
A numerical flux for the scalar law with flux is consistent when it is continuous and satisfies for every . (Conservative two-point finite-volume schemes for scalar laws)
Proof
On each open region cut out by , , and , the displayed formula in [F1] is either a polynomial, zero, or , so it is continuous there.
At a boundary with both adjacent formulas tend to ; at both tend to ; at the left and right limits are zero; at the limits are zero. On the remaining axis portions and , a neighborhood lies in the single shock branch , whose formula is continuous there. At every branch has absolute value at most , which tends to zero. These checks cover every branch boundary and prove continuity on all of .
On the diagonal, if the first branch gives ; if the second branch gives . Thus for all , and [F2] makes a consistent numerical flux.
Depends on
Used by
Dependency tree · two levels
3 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)