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.
Conservative finite-volume strong-limit theorem
Statement
Assume the Axiom of Countable Choice . Let , be continuous, , and be continuous with for every . For each , form the conservative finite-volume scheme and space-time reconstruction of Conservative two-point finite-volume schemes for scalar laws and Piecewise-constant finite-volume state and face-flux reconstructions using and initial cell averages of . Suppose reconstructions converge strongly in to , and for every bounded interval and there is such that almost everywhere on for every . Then is a locally bounded distributional weak solution in the sense of Locally bounded distributional weak solutions of scalar laws; explicitly, for every ,
The strong convergence and local uniform bounds are hypotheses, not conclusions. No CFL condition or entropy inequality is assumed, so the theorem proves a weak limit only; it does not claim Kruzhkov entropy admissibility. If the limit is also globally essentially bounded, this identity is the published bounded weak formulation in Distributional weak solutions of the Cauchy problem.
Facts & Assumptions
Given: , the scalar flux , initial datum , the scheme and reconstructions, , local uniform bounds on the states up to , strong convergence to , and a compactly supported smooth test whose support may meet .
The Axiom of Countable Choice says that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice ()).
The initial states are cell averages of , and the update is the shared-flux difference . (Conservative two-point finite-volume schemes for scalar laws)
and on each , and the face flux equals almost everywhere. (Piecewise-constant finite-volume state and face-flux reconstructions)
For the averaged test , the exact discrete identity is
when the test vanishes for . (Discrete weak identity for a conservative finite-volume update)
Under strong local convergence and local uniform bounds up to , is locally essentially bounded and in on every bounded interval times . (Strong local convergence of consistent finite-volume face fluxes)
A locally bounded distributional weak solution is a measurable, locally essentially bounded for which the displayed weak identity with initial boundary term holds for every test meeting . (Locally bounded distributional weak solutions of scalar laws)
If the state is globally bounded and satisfies this initial weak identity, it meets the published bounded weak-solution definition. (Distributional weak solutions of the Cauchy problem)
Proof
Fix . Its time support on is contained in for some . For all sufficiently large , choose with . By [F1] and [F2] these are precisely the scheme states and face fluxes of the reconstruction, so [F3] gives the exact summed update identity for this test.
The initial term in [F3] converges to the desired boundary term. Indeed, , while is the average of on . Smoothness gives for ; summing the resulting errors over the finitely many cells meeting the support bounds the total by on a fixed compact .
For , the difference differs from by at most , by Taylor's formula in time for the smooth function . After multiplication by and summation over cells and time slabs in the fixed support, the total error is . The missing first-slab integral is also because is uniformly bounded on the compact support and is bounded. Hence the time sum in [F3] differs from by a quantity tending to zero.
For each , translation of a cell interval and the fundamental theorem of calculus give . Its difference from is at most , by the bound on . The numerical face fluxes are uniformly bounded on cells meeting the test support because is continuous on the compact state square supplied by local boundedness. Summing over the finitely many cells and time slabs meeting the test support gives total error . Thus the flux sum in [F3] differs from by a quantity tending to zero.
Strong local convergence gives on times bounded away from zero. On , the local uniform bound for both and makes the integral difference at most a constant times ; letting proves convergence on the full test support. By [F4], on that support. Step 2.1 gives the initial term limit, and steps 2.2–2.3 identify the limits of the discrete sums. Taking the limit in [F3] proves the weak identity. By [F4], is locally essentially bounded, and [F5] identifies it as the stated local weak solution.
Depends on
- Conservative two-point finite-volume schemes for scalar laws
- Piecewise-constant finite-volume state and face-flux reconstructions
- Discrete weak identity for a conservative finite-volume update
- Strong local convergence of consistent finite-volume face fluxes
- Locally bounded distributional weak solutions of scalar laws
- Scalar conservation laws, fluxes and Cauchy data
- Distributional weak solutions of the Cauchy problem
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- 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)