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.
Burgers Godunov flux under the invariant-interval CFL bound
Example
Assume , and also assume Dependent Choice if . Let and use the Godunov flux of Godunov numerical flux for Burgers' equation. For every compact invariant interval with , the two coordinate Lipschitz bounds can be taken to be , and is nondecreasing in its first argument and nonincreasing in its second. Therefore, for any with values in , every mesh family satisfying falls under Strong entropy convergence of monotone finite-volume schemes and converges strongly locally to the unique Burgers entropy solution.
Facts & Assumptions
Given: , , a compact interval with , bounded BV data in , the Godunov flux , and ; additionally assume when .
The Godunov flux has the listed increasing-state and decreasing-state branches (Godunov numerical flux for Burgers' equation).
is continuous and consistent: (The Burgers Godunov flux is continuous and consistent).
Data in have finite translation variation and are locally integrable equivalence classes (Bounded BV data on the real line).
Under , and with DC additionally when , if is locally Lipschitz, consistent and coordinatewise monotone on the data range, and with positive lower , the corresponding finite-volume reconstructions converge strongly locally to the unique entropy solution (The Axiom of Countable Choice (), The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain, Strong entropy convergence of monotone finite-volume schemes).
Verification
Fix . On each branch in [F1], the function is either constant, , or . It is nondecreasing: when , the active values are on the negative-negative branch, on the crossing branch, and on the nonnegative branch; when , the maximum is constant while and increases as once is the larger positive magnitude. The branch values agree at their boundaries by [F2], so the monotonicity persists across each switch.
Fix . On the branches of [F1], is either constant, for , or on . As increases, decreases on the negative axis; on , the maximum decreases while and is constant after ; the remaining branches are constant or decrease to zero. Boundary values agree by [F2]. Hence is nonincreasing.
On every smooth branch the derivative in the varying coordinate has absolute value at most on . The maximum branch has the same bound because is piecewise one of the two square branches. The finite branch partition and continuity from [F2] therefore give coordinate Lipschitz bounds on every compact square , proving that is locally Lipschitz on . Applying the same estimate with gives coordinate Lipschitz bounds on the target square. Consistency is [F2], so the full CFL bound is .
The hypotheses of [F4] now hold for every stated family: the data are bounded BV by [F3], the flux is locally Lipschitz, monotone and consistent by steps 1.1–1.3, the full CFL bound holds, and the mesh ratio has the required positive lower bound. Thus the reconstructions converge strongly in local to the unique entropy solution.
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
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Strong entropy convergence of monotone finite-volume schemes
Used by
Dependency tree · two levels
34 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)