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.
Strong entropy convergence of monotone finite-volume schemes
Statement
Assume the Axiom of Countable Choice . Let , , and in the sense of Bounded BV data on the real line. Put . Let be locally Lipschitz, consistent with , nondecreasing in its first coordinate and nonincreasing in its second on , with coordinate Lipschitz bounds as in Monotone finite-volume scheme and invariant-interval CFL. For a family of meshes assume For each mesh, initialize by cell averages and update with the shared flux . Let be the piecewise-linear time interpolant and the piecewise-constant state reconstruction. If , assume Dependent Choice in addition to ; no DC assumption is made when .
Then there is a unique bounded Kruzhkov entropy solution on with initial datum , and For nonintegrable bounded BV data, existence is obtained from the local finite-volume limit in the proof before local contraction gives uniqueness. The theorem claims local convergence; global convergence requires additional uniform tail control. The time-to-space lower bound is retained from the approved convergence interface, and no system-valued or non-BV entropy-process conclusion is asserted.
Facts & Assumptions
Given: ; ; ; bounded BV initial class ; a locally Lipschitz, consistent, coordinatewise monotone two-point flux on the invariant interval ; coordinate constants ; a family with and ; and the cell-average finite-volume recurrences and reconstructions.
is the assertion that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice ()).
On the branch , is additionally assumed; it is not part of the nonintegrable-data branch (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
The scheme uses cell-average data and the shared-flux recurrence for a locally Lipschitz consistent monotone flux on , with the full invariant-interval CFL bound (Monotone finite-volume scheme and invariant-interval CFL).
interpolates affinely between consecutive scheme states on each cell and slab, and is the piecewise-constant space-time state (Piecewise-linear time interpolant of a finite-volume scheme).
Every scheme state stays in , its spatial discrete variation is at most , and the discrete time-increment sum is bounded by (Invariant range, TVD and time increments for a monotone finite-volume update).
Every mesh subsequence has a further subsequence whose linear interpolants converge uniformly in local to a continuous local- map with initial value ; the piecewise-constant reconstructions converge strongly to the same limit in space-time (Local compactness and initial trace for BV finite-volume states).
If the finite-volume state reconstructions converge strongly in local and are uniformly locally bounded up to , their limit satisfies the weak conservation-law identity with initial boundary term; this theorem assumes and makes no entropy assertion (Conservative finite-volume strong-limit theorem).
A bounded Kruzhkov entropy solution is characterized by all inequalities for nonnegative interior tests, together with the strong local initial trace (Kruzhkov entropy solutions).
Under , two bounded Kruzhkov entropy solutions for the same flux satisfy the local contraction estimate, so equal initial data give equality almost everywhere (Local contraction for two entropy solutions).
Under , if and is locally Lipschitz and , a bounded Kruzhkov entropy solution with the stated strong local trace exists (Existence of bounded Kruzhkov entropy solutions).
For every real , the scheme satisfies the one-step inequality with numerical entropy flux , and (Discrete Kruzhkov inequality for a monotone finite-volume scheme).
On every compact interval , continuity of gives a finite derivative bound, and the mean value theorem then makes Lipschitz on ; a singleton interval needs no derivative estimate (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
Proof
Start with any subsequence of meshes. By [F4] it has a further subsequence along which converges in to a map with , values in , and strongly in space-time . The range condition gives the uniform local state bound required below.
Fix and a nonnegative . Let be the average of on , and choose so that vanishes on and after the last time slab. Multiply the one-step inequality [F9] by , sum over the finitely many relevant , telescope in time, and reindex the shared entropy fluxes in space. The resulting exact inequality is There is no initial term because is supported away from .
The hypotheses of [F5] hold along this further subsequence: is continuous, the cell data and shared-flux recurrence are those of [F1], the mesh widths vanish, the states are bounded by , and the strong local convergence is from step 1.1. Therefore satisfies the distributional weak equation with the prescribed initial boundary term.
On the compact state interval spanned by , local Lipschitz continuity of gives a finite constant for which . By [F3], the local space-time difference between the face entropy flux and is at most , which tends to zero. Also is Lipschitz on because , so strong convergence in step 1.1 gives in local .
The finite-sum expression in step 1.2 converges to Writing for the average of on , Taylor's formula in time gives . After multiplication by and summing the cells and slabs in the compact support, the error is . For the flux term, translation of adjacent cell averages gives ; replacing the averaged derivative by has total error because and the numerical entropy fluxes are uniformly bounded on the compact support. The face-flux replacement in step 2.2 and strong state convergence supply the remaining limit. Passing to the limit in step 1.2 proves the Kruzhkov inequality for this . Since both were arbitrary, all interior Kruzhkov inequalities hold.
The initial value and continuity from [F4] imply the strong local trace: for every compact interval , as , hence the essential supremum over also tends to zero. Together with the entropy inequalities of step 3.1, [F6] makes a bounded Kruzhkov entropy solution.
Put . By [F10], is Lipschitz on , which contains the range of every limit from step 4.1. Thus the range and flux hypotheses of [F7] hold for any pair of such limits. If , [A2] and [F8] supply a bounded Kruzhkov solution, and [F7] makes it unique and identifies it with the limit of step 4.1. If , step 4.1 itself supplies existence and [F7] supplies uniqueness. Thus in either branch there is a unique target entropy solution, without applying the global existence theorem outside its domain.
Every convergent subsequence from step 1.1 has an entropy-solution limit with the same initial data; by [F7] all such limits agree with the unique target from step 5.1 as space-time classes. If the full sequence failed to converge strongly on some compact space-time set, a subsequence would stay at distance at least from that target; [F4] would give a further subsequence converging strongly there to an entropy solution, contradicting uniqueness. Therefore strongly in local space-time . For the uniform-in-time conclusion, Fubini in [F6] turns this space-time equality into equality of the sections for almost every , for each compact interval . The two local- limit maps are continuous, so they agree for every : if their distance were positive at one time, continuity would make it positive on an interval of positive measure. Uniform-in-time local convergence of then follows by the same subsequence contradiction using [F4].
Depends on
- Bounded BV data on the real line
- Monotone finite-volume scheme and invariant-interval CFL
- Piecewise-linear time interpolant of a finite-volume scheme
- Invariant range, TVD and time increments for a monotone finite-volume update
- Discrete Kruzhkov inequality for a monotone finite-volume scheme
- Local compactness and initial trace for BV finite-volume states
- Conservative finite-volume strong-limit theorem
- Kruzhkov entropy solutions
- Local $L^1$ contraction for two entropy solutions
- Existence of bounded Kruzhkov entropy solutions
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- 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
Used by
Dependency tree · two levels
87 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)