Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 ACω. Let T>0, f∈C1(R), and u0∈BVb(R) in the sense of Bounded BV data on the real line. Put I=[ess inf⁡u0,ess sup⁡u0]. Let F ⁣:R2→R be locally Lipschitz, consistent with f, nondecreasing in its first coordinate and nonincreasing in its second on I2, with coordinate Lipschitz bounds L1,L2 as in Monotone finite-volume scheme and invariant-interval CFL. For a family of meshes (hm,τm) assume hm,τm→0,τmhm(L1+L2)≤1,τmhm≥c∗>0. For each mesh, initialize by cell averages and update with the shared flux F. Let Wm be the piecewise-linear time interpolant and Um the piecewise-constant state reconstruction. If u0∈L1(R), assume Dependent Choice DC in addition to ACω; no DC assumption is made when u0∉L1(R).

Then there is a unique bounded Kruzhkov entropy solution u on R×(0,T) with initial datum u0, and Wm⟶uin C([0,T];Lloc1(R)),Um⟶ustrongly in Lloc1(R×(0,T)). 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 L1 convergence requires additional uniform tail control. The time-to-space lower bound c∗ is retained from the approved convergence interface, and no system-valued or non-BV entropy-process conclusion is asserted.

Facts & Assumptions

Given: ACω; T>0; f∈C1(R); bounded BV initial class u0; a locally Lipschitz, consistent, coordinatewise monotone two-point flux F on the invariant interval I; coordinate constants L1,L2; a family hm,τm→0 with c∗≤τm/hm and (τm/hm)(L1+L2)≤1; and the cell-average finite-volume recurrences and reconstructions.

[A1]

ACω is the assertion that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[A2]

On the branch u0∈L1(R), DC 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 N-indexed chain).

[F1]

The scheme uses cell-average data and the shared-flux recurrence for a locally Lipschitz consistent monotone flux on I, with the full invariant-interval CFL bound (Monotone finite-volume scheme and invariant-interval CFL).

[F2]

Wm interpolates affinely between consecutive scheme states on each cell and slab, and Um is the piecewise-constant space-time state (Piecewise-linear time interpolant of a finite-volume scheme).

[F3]

Every scheme state stays in I, its spatial discrete variation is at most TV⁡(u0), and the discrete time-increment sum is bounded by (L1+L2)TV⁡(u0) (Invariant range, TVD and time increments for a monotone finite-volume update).

[F4]

Every mesh subsequence has a further subsequence whose linear interpolants converge uniformly in local L1 to a continuous local-L1 map with initial value u0; the piecewise-constant reconstructions converge strongly to the same limit in space-time Lloc1 (Local compactness and initial trace for BV finite-volume states).

[F5]

If the finite-volume state reconstructions converge strongly in local L1 and are uniformly locally bounded up to t=0, their limit satisfies the weak conservation-law identity with initial boundary term; this theorem assumes ACω and makes no entropy assertion (Conservative finite-volume strong-limit theorem).

[F6]

A bounded Kruzhkov entropy solution is characterized by all inequalities ∫(∣u−k∣φt+qk(u)φx)≥0 for nonnegative interior tests, together with the strong local L1 initial trace (Kruzhkov entropy solutions).

[F7]

Under ACω, two bounded Kruzhkov entropy solutions for the same C1 flux satisfy the local L1 contraction estimate, so equal initial data give equality almost everywhere (Local L1 contraction for two entropy solutions).

[F8]

Under ACω+DC, if u0∈L1(R)∩L∞(R) and f is locally Lipschitz and C1, a bounded Kruzhkov entropy solution with the stated strong local trace exists (Existence of bounded Kruzhkov entropy solutions).

[F9]

For every real k, the scheme satisfies the one-step inequality with numerical entropy flux Gk(a,b)=F(a∨k,b∨k)−F(a∧k,b∧k), and Gk(s,s)=qk(s) (Discrete Kruzhkov inequality for a monotone finite-volume scheme).

Proof

1.1F1F2F4givenchoose

Start with any subsequence of meshes. By [F4] it has a further subsequence along which Wm converges in C([0,T];Lloc1) to a map u(t) with u(0)=u0, values in I, and Um→u strongly in space-time Lloc1. The range condition gives the uniform local state bound required below.

1.2F2F3F9givenchoosealgebra

Fix k∈R and a nonnegative φ∈Cc∞(R×(0,T)). Let Φjn be the average of φ on Ij×[tn,tn+1], and choose N so that φ vanishes on and after the last time slab. Multiply the one-step inequality [F9] by hΦjn, sum over the finitely many relevant j,n, telescope in time, and reindex the shared entropy fluxes in space. The resulting exact inequality is ∑n=1N−1∑jh∣Ujn−k∣(Φjn−Φjn−1)+∑n=0N−1∑jτGk(Ujn,Uj+1n)(Φj+1n−Φjn)≥0. There is no initial term because φ is supported away from t=0.

2.1A1F1F4F5step 1.1given

The hypotheses of [F5] hold along this further subsequence: f is continuous, the cell data and shared-flux recurrence are those of [F1], the mesh widths vanish, the states are bounded by I, and the strong local convergence is from step 1.1. Therefore u satisfies the distributional weak equation with the prescribed initial boundary term.

2.2F1F3F6step 1.1algebra

On the compact state interval J spanned by I∪{k}, local Lipschitz continuity of F gives a finite constant Ck for which ∣Gk(a,b)−Gk(a,a)∣≤Ck∣b−a∣. By [F3], the local space-time L1 difference between the face entropy flux Gk(Ujn,Uj+1n) and qk(Ujn)=Gk(Ujn,Ujn) is at most CkThmTV⁡(u0), which tends to zero. Also qk is Lipschitz on I because f∈C1, so strong convergence in step 1.1 gives qk(Um)→qk(u) in local L1.

3.1F2F3step 1.2step 2.2givenalgebra

The finite-sum expression in step 1.2 converges to ∫0T ⁣∫R(∣u−k∣φt+qk(u)φx) dx dt. Writing φt‾jn for the average of φt on Ij×[tn,tn+1], Taylor's formula in time gives ∣Φjn−Φjn−1−τmφt‾jn∣≤Cφτm2. After multiplication by hm∣Ujn−k∣ and summing the O(hm−1) cells and O(τm−1) slabs in the compact support, the error is O(τm). For the flux term, translation of adjacent cell averages gives τm(Φj+1n−Φjn)=∫tntn+1∫Ijhm−1∫0hmφx(x+s,t) ds dx dt; replacing the averaged derivative by φx has total error O(hm) because φxx 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 k,φ. Since both were arbitrary, all interior Kruzhkov inequalities hold.

4.1F4F6step 3.1algebra

The initial value and continuity from [F4] imply the strong local L1 trace: for every compact interval K, ∥u(t)−u0∥L1(K)→0 as t↓0, hence the essential supremum over 0<t<δ also tends to zero. Together with the entropy inequalities of step 3.1, [F6] makes u a bounded Kruzhkov entropy solution.

5.1A1A2F7F8F10step 4.1given

Put M0:=max⁡{∣a−∣,∣a+∣}. By [F10], f is Lipschitz on [−M0,M0], which contains the range I of every limit from step 4.1. Thus the range and flux hypotheses of [F7] hold for any pair of such limits. If u0∈L1(R), [A2] and [F8] supply a bounded Kruzhkov solution, and [F7] makes it unique and identifies it with the limit of step 4.1. If u0∉L1(R), 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 L1 domain.

6.1F4F6F7step 1.1step 4.1step 5.1algebra∎

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 Lloc1 classes. If the full sequence failed to converge strongly on some compact space-time set, a subsequence would stay at distance at least ε>0 from that target; [F4] would give a further subsequence converging strongly there to an entropy solution, contradicting uniqueness. Therefore Um→u strongly in local space-time L1. For the uniform-in-time conclusion, Fubini in [F6] turns this space-time equality into equality of the L1(K) sections for almost every t, for each compact interval K. The two local-L1 limit maps are continuous, so they agree for every t: 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 Wm then follows by the same subsequence contradiction using [F4].

Depends on

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