Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Monotone finite-volume scheme and invariant-interval CFL

Definition

Let f∈C1(R) and let u0∈BVb(R) as in Bounded BV data on the real line. Put a−:=ess inf⁡Ru0, a+:=ess sup⁡Ru0 and I:=[a−,a+]. A monotone consistent two-point flux on I is a locally Lipschitz map F ⁣:R2→R such that F(s,s)=f(s) for every s, F(⋅,b) is nondecreasing on I, and F(a,⋅) is nonincreasing on I. Choose finite coordinate Lipschitz bounds L1,L2≥0 on I2: ∣F(a,b)−F(a′,b)∣≤L1∣a−a′∣,∣F(a,b)−F(a,b′)∣≤L2∣b−b′∣. Local Lipschitz continuity on the compact square I2 supplies such bounds.

For a mesh width h>0 and time step τ>0, use the half-open cells Ij=[jh,(j+1)h), initial cell averages Uj0:=1h∫Iju0(x) dx, and the shared-flux update Ujn+1=Ujn−λ(F(Ujn,Uj+1n)−F(Uj−1n,Ujn)),λ:=τh,j∈Z, n∈N0. The full invariant-interval CFL bound is λ(L1+L2)≤1. The flux-difference scheme is conservative in the shared-face sense of Conservative two-point finite-volume schemes for scalar laws. The update stencil and positive rightward flux orientation are shown here; the proofs use the displayed recurrence, not the drawing.

diagram failed to render:
\begin{tikzpicture}[x=1.05cm,y=1cm]
  \draw (0,0) rectangle (2,0.7);
  \draw (2,0) rectangle (4,0.7);
  \draw (4,0) rectangle (6,0.7);
  \node at (1,0.35) {$U_{j-1}^n$};
  \node at (3,0.35) {$U_j^n$};
  \node at (5,0.35) {$U_{j+1}^n$};
  \draw[->] (1.55,1.05) -- (2.45,1.05);
  \draw[->] (3.55,1.05) -- (4.45,1.05);
  \node at (2,1.32) {$F(U_{j-1}^n,U_j^n)$};
  \node at (4,1.32) {$F(U_j^n,U_{j+1}^n)$};
  \node[align=center] at (3,-0.7) {$U_j^{n+1}=U_j^n-\lambda(\text{right flux}-\text{left flux})$};
\end{tikzpicture}

Remarks

The same face value leaves one cell and enters the next with opposite signs. Monotonicity and the stated CFL bound make the three-argument update map order-preserving on I3 and preserve constant states, as proved in Invariant range, TVD and time increments for a monotone finite-volume update.

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