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.
Monotone finite-volume entropy convergence — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Approximation and Compactness in C(K)
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conservative finite-volume weak limits
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convex and Semicontinuous Functions on Rⁿ
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Harmonic Functions and Mean Values in Rn
- Heat Equation Maximum Principles Duhamel and Smoothing
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone finite-volume entropy convergence
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partial Differential Equations and Characteristics
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Regular Surfaces and Surface Integrals
- Relations, Functions, and Quotients
- Rellich Kondrachov and Sobolev Compactness
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Scalar Conservation Laws and Entropy Solutions
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Smooth Partitions of Unity and Exhaustions
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Divergence Theorem and Classical Stokes
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Heat Kernel and the Cauchy Problem
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples verify the Burgers Godunov and Lax–Friedrichs fluxes under the declared invariant-interval CFL bound, and show an aligned stationary Burgers entropy shock preserved exactly by Godunov. A consistent conservative but nonmonotone polynomial flux instead preserves a stationary expansion shock; its strong local limit is weak but violates the Kruzhkov inequality.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A consistent nonmonotone flux selects a nonentropy expansion shock
Statement refuted
For every , every continuous consistent conservative two-point finite-volume flux, without a monotonicity assumption, sends every bounded BV datum to reconstructions whose strong local limits are Kruzhkov entropy solutions.
Facts & Assumptions
Given: , Burgers' flux , the Riemann datum on and on , and the polynomial flux below.
A continuous consistent numerical flux is inserted in the shared-face flux-difference update, with initial cell averages (Conservative two-point finite-volume schemes for scalar laws).
A locally bounded distributional weak solution satisfies the initial-boundary weak identity for every smooth compactly supported test (Locally bounded distributional weak solutions of scalar laws).
Entropy admissibility requires each Kruzhkov inequality with (Kruzhkov entropy solutions).
For each there is a nonnegative cutoff equal to near the origin and supported in the ball of radius (Explicit compactly supported smooth cutoffs).
The datum is globally bounded and has finite translation variation (Bounded BV data on the real line).
Counterexample
For Burgers' flux , take the bounded BV datum for and for . Define the continuous polynomial flux It is consistent, since , but it is not monotone in its first coordinate. On every grid with as a cell face, the finite-volume scheme keeps the expansion shock fixed. The resulting reconstructions converge strongly locally to a weak solution that fails the Kruzhkov inequality.
The polynomial is continuous. On the diagonal, its correction term vanishes and , so it is consistent. Its first partial derivative is At this equals , so it is not nondecreasing in its first coordinate.
On the uniform cells with , the initial averages are for and for . Every same-state face flux is . The only mixed pair is ; both correction factors vanish and . Thus every face flux equals , and the recurrence leaves every cell average unchanged at every step.
The datum has by [F5]. For any sequence with this aligned grid convention, the piecewise-constant reconstruction is exactly the stationary step function almost everywhere. It therefore converges strongly in local space-time to for and for . Its initial trace is .
Since almost everywhere, for any one has for almost every , because is stationary and vanishes near . Integrating in cancels the initial term in [F2]. The flux contribution is for each , since has compact spatial support. Thus satisfies the weak identity and is a locally bounded distributional weak solution.
Let and choose the cutoff of [F4] with on the unit ball and support in the radius-two ball. The function is nonnegative, smooth, supported in , and satisfies . For , is stationary, so , while and give This contradicts the required nonnegative entropy pairing in [F3].
Remarks
The diagram shows the stationary discontinuity at with its left and right states. The horizontal axis is space and the vertical axis is time. The proof verifies the weak equation and entropy defect by direct integration; it does not rely on the drawing.
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.
Lax–Friedrichs flux under the invariant-interval CFL bound
Example
Assume , and additionally assume Dependent Choice when .
Let be a compact invariant interval, let , and choose finite with on and . The Lax–Friedrichs flux is consistent, nondecreasing in , nonincreasing in , and has coordinate Lipschitz bounds . Thus any bounded BV datum in and mesh family satisfying falls under Strong entropy convergence of monotone finite-volume schemes.
Facts & Assumptions
Given: Countable Choice , the compact interval , , constants with on , bounded BV data in , and the displayed numerical flux; additionally assume Dependent Choice when .
A continuous real-valued function on a compact interval is bounded, so a finite exists for on (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
If is continuous on and differentiable on , then for some (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
The full invariant-interval CFL condition uses the sum of coordinate Lipschitz bounds, and under —with DC additionally on the branch—the convergence theorem requires a positive lower bound for (Monotone finite-volume scheme and invariant-interval CFL, 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).
is bounded and has finite translation variation (Bounded BV data on the real line).
Verification
On the diagonal, , so the flux is consistent. If , the first-coordinate difference is zero; if , the mean-value theorem gives Thus it is nondecreasing in its first coordinate.
If , the second-coordinate difference is zero; if , the mean-value theorem gives so it is nonincreasing in its second coordinate. The mean-value bounds on each variable also give .
Since is locally Lipschitz and the flux adds a linear term, is locally Lipschitz. The displayed flux is consistent by its diagonal formula, and steps 1.1 and 1.2 prove monotonicity with coordinate bounds whose sum is . Hence the displayed upper ratio gives the full CFL condition, while the lower ratio and bounded BV data satisfy the remaining hypotheses of [F3]. The convergence theorem applies.
Godunov scheme captures a stationary Burgers entropy shock
Example
Assume . For Burgers' flux , take for and for . Use , , and the Godunov flux from Godunov numerical flux for Burgers' equation. The grid interface is aligned with the initial jump. Every numerical face flux is , so the finite-volume profile is stationary at every time step. The exact shock speed is zero, and the stationary jump satisfies all Kruzhkov entropy inequalities. Theorem Strong entropy convergence of monotone finite-volume schemes therefore applies, although in this aligned example the reconstructions already equal their limit exactly.
The diagram shows the stationary interface and the two constant states. The horizontal coordinate is , the vertical coordinate is time, and the vertical line is the shock curve ; the proof uses the recurrence and entropy fluxes, not the drawing.
Facts & Assumptions
Given: , , the Riemann datum on and on , , , and the Burgers Godunov flux.
The Burgers Godunov flux has and, when , (Godunov numerical flux for Burgers' equation, The Burgers Godunov flux is continuous and consistent).
Under , the chosen Godunov flux has coordinate Lipschitz bounds on , so satisfies the full CFL bound; the entropy-convergence theorem then applies to bounded BV data (Burgers Godunov flux under the invariant-interval CFL bound, The Axiom of Countable Choice (), Strong entropy convergence of monotone finite-volume schemes).
A bounded weak solution satisfies the integral identity with the initial boundary term (Distributional weak solutions of the Cauchy problem).
For a piecewise smooth weak solution with a graph shock and distinct traces, the Rankine–Hugoniot speed is (The Rankine--Hugoniot jump condition in space--time normal form).
Kruzhkov entropy admissibility is the family of inequalities using , together with a strong local initial trace (Kruzhkov entropy solutions).
The datum is a bounded BV equivalence class with total translation variation (Bounded BV data on the real line).
Verification
The initial cell averages are for and for . Same-state faces have flux by [F1], and the only mixed face has pair and flux . Thus every face flux equals .
Every cell's left and right fluxes are both , so the conservative update leaves every unchanged. Induction in proves that both reconstructions equal the stationary step function almost everywhere for every ; in particular they converge strongly locally to it.
The stationary profile is a bounded weak solution: for every , its time term satisfies , while almost everywhere and hence at each time. This is exactly the weak identity of [F3].
Fix . The entropy flux traces are on the left and on the right. If or , both states lie on the same side of and these fluxes are equal because . If , then For any nonnegative interior test , the time term vanishes because is stationary. Integration on the two half-lines gives The initial trace is exactly , so [F5] shows the stationary shock is a Kruzhkov entropy solution.
The left and right traces are and . By [F4], the shock speed is which agrees with the stationary interface. The Rankine–Hugoniot supplier applies because step 3.1 verified the weak identity and the traces are distinct.
The translation variation of the datum is : for , is nonzero only on , where its absolute value is , so . The ratio is , and the flux bounds from [F2] give . Thus the hypotheses of the main convergence theorem in [F2] hold; since the exact reconstruction is the entropy solution from step 3.2, it is the unique limit. No global assertion is made because the two tails are nonzero.