Alphabeta Math
LemmaStatement: 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.

Invariant range, TVD and time increments for a monotone finite-volume update

Statement

Let u0∈BVb(R) and put V:=TV⁡(u0). Let Un=(Ujn)j∈Z be generated by Monotone finite-volume scheme and invariant-interval CFL under its full invariant-interval CFL bound. Define the update map H(a,b,c):=b−λ(F(b,c)−F(a,b)). Then H is nondecreasing in each coordinate on I3 and H(s,s,s)=s for s∈I. Consequently, a−≤Ujn≤a+(j∈Z, n≥0),∑j∈Z∣Uj+1n−Ujn∣≤V(n≥0). Moreover, for every n≥0, hτ∑j∈Z∣Ujn+1−Ujn∣≤(L1+L2)V. For a sequence x=(xj)j∈Z, the notation ∥x∥1:=∑j∈Z∣xj∣ is used only when this sum is finite; x∨y and x∧y mean the coordinatewise maximum and minimum.

Facts & Assumptions

Given: u0, V, the cells and cell-average initialization, a locally Lipschitz monotone consistent flux F on I=[a−,a+], coordinate bounds L1,L2, λ=τ/h with λ(L1+L2)≤1, and the flux-difference update.

[F1]

TV⁡(u0)<∞ means ∫R∣u0(x+h)−u0(x)∣ dx≤hV for every h>0 (Bounded BV data on the real line).

[F2]

Each updated coordinate is H(Uj−1n,Ujn,Uj+1n) and H is defined from the flux-difference rule (Monotone finite-volume scheme and invariant-interval CFL).

Proof

1.1F1givenalgebra

For a finite set J⊂Z, the cell-average formula gives ∑j∈J∣Uj+10−Uj0∣≤1h∫∪j∈JIj∣u0(x+h)−u0(x)∣ dx≤V. Taking the supremum over finite J proves the initial discrete variation bound. Every initial cell average lies in I, since a−≤u0≤a+ almost everywhere on its cell.

1.2F2givenalgebra

If a or c increases, monotonicity of F in its first or second coordinate makes H nondecreasing in that variable. If b2≥b1, coordinate Lipschitz bounds give H(a,b2,c)−H(a,b1,c)≥(b2−b1)(1−λ(L1+L2))≥0. Thus H is nondecreasing in all coordinates. Consistency gives H(s,s,s)=s.

2.1step 1.2step 1.1algebra

Suppose Un takes values in I. Coordinatewise comparison with the constant triples (a−,a−,a−) and (a+,a+,a+), followed by step 1.2, yields a−=H(a−,a−,a−)≤Ujn+1≤H(a+,a+,a+)=a+. Induction from step 1.1 proves the range bound at every time.

2.2F2step 1.2algebra

Let S denote the sequence update. If x,y∈IZ and ∑j∣xj−yj∣<∞, monotonicity gives ∣Sx−Sy∣≤S(x∨y)−S(x∧y) coordinatewise. The difference on the right is summable: the update formula and the coordinate Lipschitz bounds make its flux differences summable. For any z,w with ∑j∣zj−wj∣<∞, summing the update over −N≤j≤N yields ∑j=−NN(Szj−Swj)=∑j=−NN(zj−wj)−λ(dN−d−N−1),dj:=F(zj,zj+1)−F(wj,wj+1). The coordinate Lipschitz bounds make ∑j∣dj∣<∞, so both boundary terms tend to zero. The update difference is absolutely summable, and hence ∑j(Szj−Swj)=∑j(zj−wj). Applying this to z=x∨y and w=x∧y proves ∥Sx−Sy∥1≤∥x−y∥1.

3.1step 1.1step 2.2algebra

The initial neighbor difference is summable by step 1.1. The update commutes with integer shifts because the same H is applied at every index. Apply step 2.2 to x=Un and its shift yj=Uj+1n to obtain ∑j∣Uj+1n+1−Ujn+1∣≤∑j∣Uj+1n−Ujn∣. Induction proves the stated TVD bound.

4.1F2step 3.1algebra∎

Adding and subtracting F(Ujn,Ujn) in the update and using the two coordinate Lipschitz bounds gives ∣Ujn+1−Ujn∣≤λ(L2∣Uj+1n−Ujn∣+L1∣Ujn−Uj−1n∣). Multiply by h/τ=1/λ, sum over j, and use step 3.1 to obtain the time-increment estimate.

Depends on

Used by

Dependency tree · two levels

6 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