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.
Piecewise-constant finite-volume state and face-flux reconstructions
Definition
Use the cells, time levels, states and interface fluxes from Conservative two-point finite-volume schemes for scalar laws. For , the piecewise-constant state reconstruction and face-flux reconstruction are the measurable functions whenever . Values on cell or time-grid boundaries may be assigned arbitrarily, since those boundaries have two-dimensional Lebesgue measure zero. In particular, for almost every ,
Remarks
Strong convergence of reconstructions means convergence in on every compact subset of . It is an explicit hypothesis in the weak-limit theorem below; it is not produced by the reconstruction definition.
Depends on
Used by
- A conservative consistent finite-volume weak limit need not be entropic Counterexample
- Piecewise-linear time interpolant of a finite-volume scheme Definition
- Godunov finite volumes preserve the Burgers shock speed Example
- Discrete weak identity for a conservative finite-volume update Lemma
- Strong local convergence of consistent finite-volume face fluxes Lemma
- Conservative finite-volume strong-limit theorem Theorem
Dependency tree · two levels
2 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)