Alphabeta Math
Pipeline-generated
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.

✓ 7 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

High-resolution TVD, ENO and WENO reconstruction

1 · Prerequisites

2 · Summary

Objective

This page separates nodal ENO2 from finite-volume cell-average reconstruction, defines minmod MUSCL, WENO5-JS and the WENO-Z comparison, and proves their stated smooth-region face accuracy. The scalar linear monotonicity barrier is proved by a finite-stencil moment argument. The unchanged direct reconstructed-upwind forward-Euler MUSCL/minmod update is TVD under the sharp CFL bound ∣a∣Δt/h≤2/3, proved in Direct forward-Euler MUSCL/minmod is TVD under the sharp two-thirds CFL bound. The exact CFL-one counterexample remains in The specified direct MUSCL/minmod flux update is not TVD at CFL one; the theorem also shows failure for every larger CFL number through one.

For the cell-average convention, each rectangle below is one half-open cell and its label is the cell average. The dashed vertical line is the target face. The three lower bars show the five-cell WENO5 candidate stencils; the nodal ENO2 rule uses separate point samples and is defined by its own divided-difference formula in Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions. The diagram records stencil geometry only; the proofs use the displayed formulas and moment calculations.

\begin{tikzpicture}[x=1cm,y=0.75cm]
  \draw (0,0) rectangle (1,0.6);
  \draw (1,0) rectangle (2,0.6);
  \draw (2,0) rectangle (3,0.6);
  \draw (3,0) rectangle (4,0.6);
  \draw (4,0) rectangle (5,0.6);
  \node at (0.5,0.3) {$U_{i-2}$};
  \node at (1.5,0.3) {$U_{i-1}$};
  \node at (2.5,0.3) {$U_i$};
  \node at (3.5,0.3) {$U_{i+1}$};
  \node at (4.5,0.3) {$U_{i+2}$};
  \draw[red,dashed] (3,-0.2) -- (3,1.4);
  \node[red,right] at (3,1.25) {$x_{i+1/2}$};
  \draw[thick] (0,-0.35) -- (3,-0.35);
  \node at (1.5,-0.62) {$S_0$};
  \draw[thick] (1,-0.9) -- (4,-0.9);
  \node at (2.5,-1.17) {$S_1$};
  \draw[thick] (2,-1.45) -- (5,-1.45);
  \node at (3.5,-1.72) {$S_2$};
\end{tikzpicture}

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions

Definition

Let h>0, let Ii=[ih,(i+1)h), let xi=(i+12)h be its center, and write xi+1/2=(i+1)h and xi−1/2=ih for its right and left faces. A cell average of a locally integrable scalar function u is Ui=h−1∫Iiu(x) dx. The cells are half-open only to form a partition; the choice of endpoint representatives does not change an integral.

Here MUSCL/minmod means the piecewise-linear reconstruction with the limiter defined next; nodal ENO2 means the two-stencil quadratic selector defined below; and cell-average WENO5-JS/WENO-Z means the three-candidate reconstructions with the normalized nonlinear weights displayed below. These names specify the constructions and do not, by themselves, assert an accuracy or stability property.

For real a,b, define minmod⁡(a,b)={sgn⁡(a)min⁡(∣a∣,∣b∣),ab>0,0,ab≤0. The MUSCL/minmod reconstruction assigns the cell slope si=h−1minmod⁡(Ui−Ui−1,Ui+1−Ui) and the two face states Ui−1/2+,M=Ui−hsi/2 and Ui+1/2−,M=Ui+hsi/2. Here + denotes a trace from the right cell and − a trace from the left cell.

For separate nodal data Vj=u(yj) at yj=jh, define the second divided difference by [ya,yb,yc]V=(((Vc−Vb)/(yc−yb))−((Vb−Va)/(yb−ya)))/(yc−ya). At the face yi+1/2=(i+12)h, set dL=∣[yi−1,yi,yi+1]V∣ and dR=∣[yi,yi+1,yi+2]V∣. Choose the left triple when dL≤dR and otherwise choose the right triple. For the selected triple (ya,yb,yc) define its Newton quadratic by Pa,b,c(y)=Va+Vb−Vayb−ya(y−ya)+[ya,yb,yc]V (y−ya)(y−yb). The nodal ENO2 face value is Pa,b,c(yi+1/2). This nodal interpolation branch is distinct from the cell-average WENO branch below.

For cell averages Ui−2,…,Ui+2, define the left-biased WENO5 candidate face functionals p0=(2Ui−2−7Ui−1+11Ui)/6,p1=(−Ui−1+5Ui+2Ui+1)/6,p2=(2Ui+5Ui+1−Ui+2)/6. Define the Jiang–Shu indicators β0=1312(Ui−2−2Ui−1+Ui)2+14(Ui−2−4Ui−1+3Ui)2, β1=1312(Ui−1−2Ui+Ui+1)2+14(Ui−1−Ui+1)2,β2=1312(Ui−2Ui+1+Ui+2)2+14(3Ui−4Ui+1+Ui+2)2. Fix a positive parameter ϵ0 with the same units as each βk, independently of h, and ideal weights (d0,d1,d2)=(1/10,6/10,3/10). If u is nondimensionalized, ϵ0 is a fixed positive number. The WENO-JS weights and left face value are αkJ=dk/(ϵ0+βk)2, ωkJ=αkJ/∑l=02αlJ, and Ui+1/2−,J=∑k=02ωkJpk. For the WENO-Z comparison, use the fifth-order p=2 weights: with τ5=∣β0−β2∣, set αkZ=dk[1+(τ5/(ϵ0+βk))2], ωkZ=αkZ/∑l=02αlZ, and Ui+1/2−,Z=∑k=02ωkZpk. All denominators are positive because ϵ0>0 and every βk is a sum of squares. The right face state is obtained by reflection about that face: replace each stencil value Uk in the displayed left formula by U2i+1−k.

For scalar linear advection ut+aux=0, a direct reconstructed-upwind forward-Euler update uses ν=aΔt/h, the flux Fi+1/2=aUi+1/2−,M when a≥0 and Fi+1/2=aUi+1/2+,M when a<0, and Uin+1=Uin−(Δt/h)(Fi+1/2−Fi−1/2). The total variation of a sequence is TV⁡(U)=∑i∈Z∣Ui+1−Ui∣ when the sum is finite; TVD means that this quantity does not increase in one update.

For a vector system whose flux Jacobian at an interface is diagonalizable as A=RΛR−1 with real diagonal Λ, a characteristic-wise reconstruction applies a chosen scalar reconstruction to the components of R−1U and maps the reconstructed vector back by R. This definition alone gives no TVD or stability result for systems.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A monotone linear one-step advection scheme cannot be second order at noninteger CFL

Statement

Let a≠0, h>0 and Δt>0, and put ν=aΔt/h. Fix a noninteger ν. Consider a finite-stencil, translation-invariant linear one-step scheme Ujn+1=∑ℓ=−rrcℓUj+ℓn with real coefficients that may depend on the fixed ν but are independent of h, j and n. Assume the scheme is conservative, is consistent with ut+aux=0, and is second-order accurate in the local truncation sense. For these fixed coefficients, second-order consistency requires exact matching of the constant, linear and quadratic Taylor moments for the one-step translation. If the update is monotone in the componentwise order on grid sequences, then these assumptions are inconsistent. Thus at a noninteger Courant number no such linear monotone scheme can be second order.

Facts & Assumptions

Given: A finite radius r, a fixed noninteger Courant number ν, a linear translation-invariant one-step update with coefficients cℓ, conservation and second-order consistency through quadratic data.

[A1]

Monotone means order preserving: if Vj≥Uj for every integer j, then Vjn+1≥Ujn+1 for every j.

[A2]

With coefficients fixed as h→0, second-order local accuracy requires the update moments on 1, x and x2 to equal those of u(x)↦u(x−aΔt).

Proof

1.1givenA1choose

Fix an integer offset ℓ. Compare the zero input sequence with the sequence that is 1 at the single index j+ℓ and 0 elsewhere. The first is componentwise below the second; by [A1], their outputs at index j are ordered. Linearity makes those outputs 0 and cℓ, respectively, so cℓ≥0. This holds for each ℓ.

1.2givenA2algebra

Apply [A2] to the constant polynomial u(x)=1. Its exact translate is 1, so ∑ℓcℓ=1. Applying [A2] to u(x)=x gives ∑ℓcℓ(x+ℓh)=x−aΔt=x−νh; subtracting x∑cℓ=x yields ∑ℓℓcℓ=−ν. Applying [A2] to u(x)=x2 gives ∑ℓcℓ(x+ℓh)2=(x−aΔt)2; expanding both sides and using the first two identities yields ∑ℓℓ2cℓ=ν2.

2.1A1step 1.1step 1.2algebra∎

The three moment identities imply ∑ℓcℓ(ℓ+ν)2=∑ℓℓ2cℓ+2ν∑ℓℓcℓ+ν2∑ℓcℓ=ν2−2ν2+ν2=0. Every summand is nonnegative by step 1.1, so any ℓ with cℓ>0 must satisfy ℓ=−ν. Since ℓ is an integer and ν is not, all coefficients vanish, contradicting ∑ℓcℓ=1 from step 1.2.

Remarks

The noninteger restriction is necessary: when ν is an integer, an exact grid shift is monotone and reproduces every polynomial. The theorem is the scalar linear barrier; nonlinear limiters and nonmonotone high-order schemes lie outside its hypotheses.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The selected nodal ENO2 quadratic reconstructs the face to third order

Statement

Let h>0, let yj=jh, and let u∈C3([yi−1,yi+2]) with M:=sup⁡∣u′′′∣<∞. Form the nodal ENO2 value at yi+1/2 by the rule in Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions. Then ∣Ui+1/2ENO2−u(yi+1/2)∣≤Mh3/16. The conclusion holds for either selected triple, so it includes the left-tie case.

Facts & Assumptions

Given: Uniform distinct nodes yj=jh, nodal values Uj=u(yj) from a C3 function, and the ENO2 selector and Newton quadratic.

[F1]

Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions: ENO2 compares the absolute divided differences on (yi−1,yi,yi+1) and (yi,yi+1,yi+2), chooses the smaller (ties left), and evaluates the corresponding Newton quadratic at yi+1/2.

[F2]

Existence and uniqueness of the cardinal-polynomial interpolant: for distinct real nodes, the data have a unique interpolating polynomial of degree at most the number of nodes minus one.

[F3]

Pointwise Lagrange interpolation remainder: for three distinct nodes and u∈C3, the quadratic interpolant error at a non-node x is u′′′(ξ)(x−ya)(x−yb)(x−yc)/3! for some ξ between the nodes and x.

Proof

1.1givenF1F2algebra

For either candidate triple ya<yb<yc, let Dab=(Ub−Ua)/(yb−ya) and Dbc=(Uc−Ub)/(yc−yb). The Newton polynomial in [F1] takes values Ua and Ub at the first two nodes. At yc, its value is Ua+Dab(yc−ya)+(Dbc−Dab)(yc−yb)=Ub+Dbc(yc−yb)=Uc, using the divided-difference definition. By [F2] it is the unique quadratic interpolant to that triple.

1.2givenF3algebra

Apply [F3] to the left triple. The offsets from yi+1/2 are −3h/2,−h/2,h/2, whose product has magnitude 3h3/8; hence the error is at most M(3h3/8)/6=Mh3/16. For the right triple the offsets are −h/2,h/2,3h/2, with the same product magnitude, so it has the same bound.

2.1F1step 1.2∎

The selector in [F1] returns one of those two quadratics, including the left one at a tie. Since both candidates satisfy the bound from step 1.2, whichever is selected satisfies it.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The WENO5 ideal linear weights reproduce quartics at the right face

Statement

Let h>0, let Ij=[jh,(j+1)h), and let xi+1/2=(i+1)h. For u∈C5 on the union of cells Ii−2,…,Ii+2, let p0,p1,p2 be the cell-average functionals in Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions. Each candidate reproduces every polynomial of degree at most two exactly at xi+1/2. The ideal combination popt=p0/10+3p1/5+3p2/10 reproduces every polynomial of degree at most four and satisfies ∣popt−u(xi+1/2)∣≤(23/15)(35/5!) sup⁡∣u(5)∣ h5. Each candidate separately satisfies ∣pk−u(xi+1/2)∣≤15sup⁡∣u′′′∣h3.

Facts & Assumptions

Given: Uniform cell averages of a C5 function, the three candidate functionals and the ideal weights in Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions.

[F1]

Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions: the candidate coefficient vectors, in order (Ui−2,Ui−1,Ui,Ui+1,Ui+2), are (2,−7,11,0,0)/6, (0,−1,5,2,0)/6, and (0,0,2,5,−1)/6; the ideal weights are (1/10,3/5,3/10).

[F2]

A uniform derivative bound gives a uniform Taylor remainder bound: if ∣u(m+1)∣≤M on the interval between a center c and x, the degree-m Taylor polynomial at c has remainder bounded by M∣x−c∣m+1/(m+1)!.

Proof

1.1F1algebra

Combining the three coefficient vectors in [F1] gives popt=(2Ui−2−13Ui−1+47Ui+27Ui+1−3Ui+2)/60.

1.2F1F2algebra

For p0, the coefficient vector (2,−7,11) has dot products 6, 0, and 0 with the average vectors (1,1,1), (−5/2,−3/2,−1/2), and (19/3,7/3,1/3). For p1, (−1,5,2) has dot products 6, 0, and 0 with (1,1,1), (−3/2,−1/2,1/2), and (7/3,1/3,1/3). For p2, (2,5,−1) has dot products 6, 0, and 0 with (1,1,1), (−1/2,1/2,3/2), and (1/3,1/3,7/3). After division by 6, each candidate exactly reproduces 1,z,z2 at the face. The degree-two Taylor polynomial at xi+1/2 therefore cancels from pk−u(xi+1/2). By [F2], the pointwise remainder on each stencil is bounded by M3(3h)3/3!, where M3=sup⁡∣u′′′∣; averaging preserves this bound. The largest sum of absolute candidate coefficients is 10/3, giving ∣pk−u(xi+1/2)∣≤(10/3)M3(3h)3/6=15M3h3.

2.1step 1.1algebra

Write z=(x−xi+1/2)/h. The vectors of cell averages of 1,z,z2,z3,z4 over the five cells, ordered from i−2 through i+2, are respectively (1,1,1,1,1), (−5/2,−3/2,−1/2,1/2,3/2), (19/3,7/3,1/3,1/3,7/3), (−65/4,−15/4,−1/4,1/4,15/4), and (211/5,31/5,1/5,1/5,31/5). Direct multiplication gives dot products 60/60, 0/60, 0/180, 0/240, and 0/300 with (2,−13,47,27,−3)/60, respectively. Thus the functional in step 1.1 returns the value at z=0 for every polynomial of degree at most four.

3.1F1F2step 2.1algebra∎

Let T4 be the degree-four Taylor polynomial of u at xi+1/2 and put M5=sup⁡∣u(5)∣ on the stencil. By [F2], the cell-average remainder after subtracting T4 has magnitude at most M5(3h)5/5! in each cell. Step 2.1 reproduces T4 exactly, and the absolute coefficients of popt sum to (2+13+47+27+3)/60=23/15. Therefore ∣popt−u(xi+1/2)∣≤(23/15)M5(3h)5/5!, as claimed.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

MUSCL/minmod face states are second order on smooth monotone data

Statement

Let u∈C2 on a neighborhood of a cell and its two neighbors, and suppose ∣u′(x)∣≥c>0 there. Let Uj be the averages of u over uniform cells of width h, centered at xj=x0+jh. For sufficiently small h, the MUSCL/minmod face states of Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions satisfy ∣Ui+hsi/2−u(xi+h/2)∣≤Ch2,∣Ui−hsi/2−u(xi−h/2)∣≤Ch2, where C depends only on c and a bound for ∣u′′∣ on the stated neighborhood.

Facts & Assumptions

Given: The stated smoothness and nonvanishing derivative, uniform cell averages, and minmod MUSCL slopes.

[F1]

Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions: hsi=minmod⁡(Ui−Ui−1,Ui+1−Ui) and the two face states are Ui±hsi/2.

[F2]

A uniform derivative bound gives a uniform Taylor remainder bound: with ∣u′′∣≤M2, the degree-one Taylor remainder at distance r is bounded by M2∣r∣2/2.

Proof

1.1givenF2algebra

Let M2=sup⁡∣u′′∣ on the cell and its neighbors. Applying [F2] about xi and averaging over the symmetric central cell cancels the linear term, giving ∣Ui−u(xi)∣≤M2h2/24. Applying [F2] at xi to the neighboring centers and using the same cell-average estimate gives Ui−Ui−1=hu′(xi)+O(M2h2) and Ui+1−Ui=hu′(xi)+O(M2h2).

2.1F1step 1.1algebra

Because ∣u′(xi)∣≥c, both increments in step 1.1 have the same nonzero sign for all sufficiently small h. Minmod selects one of them, and either equals hu′(xi)+O(M2h2); hence hsi=hu′(xi)+O(M2h2).

3.1F2step 1.1step 2.1algebra∎

By step 1.1 and step 2.1, Ui+hsi/2=u(xi)+hu′(xi)/2+O(M2h2). Applying [F2] at distance h/2 gives u(xi+h/2)=u(xi)+hu′(xi)/2+O(M2h2), so subtraction proves the right-face estimate. The same calculation with −h/2 proves the left-face estimate.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Direct forward-Euler MUSCL/minmod is TVD under the sharp two-thirds CFL bound

Statement

Let h>0, Δt≥0, a∈R, and μ=∣a∣Δt/h. Use the direct reconstructed-upwind forward-Euler update for scalar linear advection from Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions, with the stated MUSCL/minmod reconstruction and no time predictor; write U+ for the sequence after one such update. The data are either a real bi-infinite sequence with finite discrete total variation TV⁡(U)=∑i∈Z∣Ui−Ui−1∣<∞, or a real N-periodic sequence, for an integer N≥1, with TV⁡N(U)=∑i=0N−1∣Ui−Ui−1∣, where periodic indices are taken modulo N. If 0≤μ≤2/3, one update satisfies TV⁡(U+)≤TV⁡(U) in the bi-infinite case and TV⁡N(U+)≤TV⁡N(U) in the periodic case.

The constant 2/3 is sharp within the original range 0≤μ≤1: for every 2/3<μ≤1 there are finite-support data of variation 2 whose updated variation is 3μ>2. For every period N≥7, the same witness periodized with period N has the same strict increase.

Facts & Assumptions

Given: h>0, Δt≥0, a∈R, the direct forward-Euler MUSCL/minmod update for scalar linear advection, and either a bi-infinite real sequence of finite discrete total variation or an N-periodic real sequence with N≥1.

[F1]

Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions: the MUSCL/minmod slope is si=h−1minmod⁡(Ui−Ui−1,Ui+1−Ui), with face states Ui±hsi/2. Minmod vanishes when either argument is zero or their signs differ, and otherwise has their common sign and magnitude no larger than either argument's magnitude.

[F2]

Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions: for a>0, the direct update is Ui+=Ui−μ[di+(mi−mi−1)/2], where di=Ui−Ui−1 and mi=hsi. For a<0, the fluxes are Fi+1/2=a(Ui+1−mi+1/2) and Fi−1/2=a(Ui−mi/2).

Proof

1.1givenF1F2algebra

First suppose a>0. If di≠0, then mi/di and mi−1/di lie in [0,1]: in each minmod, di is one argument, so a nonzero output has the sign of di and magnitude at most ∣di∣. Set Ci=μ[1+mi/di−mi−1/di2] in this case. If di=0, then mi=mi−1=0; set Ci=μ. In either case μ/2≤Ci≤3μ/2, and the exact update satisfies Ui+=Ui−Cidi=(1−Ci)Ui+CiUi−1. Thus 0≤Ci≤1 when μ≤2/3, including equality.

2.1step 1.1algebra

Subtract the identity for Ui−1+ in step 1.1 from that for Ui+ to obtain di+=(1−Ci)di+Ci−1di−1. The coefficients are nonnegative, so ∣di+∣≤(1−Ci)∣di∣+Ci−1∣di−1∣. For periodic data, Ci is N-periodic because it is defined from shifts of U; summing over one period and cyclically reindexing gives TV⁡N(U+)≤∑i=0N−1[(1−Ci)+Ci]∣di∣=TV⁡N(U). This also covers N=1, when every di=0. For bi-infinite data, both nonnegative series on the right are bounded by ∑i∣di∣<∞. Reindexing the absolutely convergent second series gives TV⁡(U+)≤∑i[(1−Ci)+Ci]∣di∣=TV⁡(U), so the updated sequence still has finite variation.

3.1F1F2step 2.1algebra

Now suppose a<0. At face i+1/2, [F2] gives Fi+1/2=a(Ui+1−mi+1/2) and Fi−1/2=a(Ui−mi/2), hence Ui+=Ui+μ[(Ui+1−Ui)−(mi+1−mi)/2]. Reflect the data by Vj=U−j. Its minmod increments obey mjV=−m−j, because reflection reverses each adjacent difference and minmod is odd under simultaneous sign reversal. With i=−j, the positive-speed expression for Vj is Vj−μ[(Vj−Vj−1)+(mjV−mj−1V)/2]=Ui+μ[(Ui+1−Ui)−(mi+1−mi)/2], exactly the negative-speed update just computed. Also Vj−Vj−1=−(U−j+1−U−j), so reflection only reindexes the absolute increments and preserves both the bi-infinite and periodic variation sums. Step 2.1 therefore proves the claim for negative velocity. If a=0, both fluxes vanish; if Δt=0, their difference is multiplied by zero in the update. In either case the update is the identity, covering μ=0.

4.1F1F2step 2.1step 3.1algebra∎

Fix 2/3<μ≤1, any h>0 and any a≠0, and take Δt=μh/∣a∣. For positive velocity choose U−1=U1=1/2, U0=1, and Ui=0 otherwise; its initial variation is ∣1/2∣+∣1/2∣+∣−1/2∣+∣−1/2∣=2. The only nonzero differences are d−1=d0=1/2 and d1=d2=−1/2, so the only nonzero minmod increments are m−1=1/2 and m1=−1/2. Substituting these in [F2], the four affected updates are U−1+=1/2−μ(1/2+1/4)=A, U0+=1−μ(1/2−1/4)=B, U1+=1/2−μ(−1/2−1/4)=C, and U2+=0−μ(−1/2+1/4)=D, where A=1/2−3μ/4, B=1−μ/4, C=1/2+3μ/4, and D=μ/4; every other update is zero because its state and all adjacent minmod increments are zero. Here A<0, B≥3/4>0, C−B=μ−1/2>0, D>0, and C−D=1/2+μ/2>0, so A<0<B<C and 0<D<C. Hence TV⁡(U+)=−A+(B−A)+(C−B)+(C−D)+D=2(C−A)=3μ>2. For negative velocity reflect this witness; step 3.1 preserves its updated variation. Periodizing the data with any N≥7 leaves at least four zero initial cells between successive three-cell supports and at least three zero updated entries between the four affected entries; since a positive-velocity update uses only cells i−2,…,i+1 and a negative-velocity update uses only cells i−1,…,i+2, no stencil meets two distinct support copies, and the periodic variation is the same 3μ. At μ=2/3, the coefficient argument in steps 1.1–2.1 still proves TVD, and the witness updates to (0,5/6,1,1/6) with variation 2; every larger CFL number through one fails.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

The specified direct MUSCL/minmod flux update is not TVD at CFL one

Statement refuted

The direct reconstructed-upwind forward-Euler update in Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions is TVD for every scalar grid sequence whenever ∣a∣Δt/h≤1.

Facts & Assumptions

Given: a=h=Δt=1, so the CFL number is 1; the minmod slope and direct forward-Euler flux update of Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions. For a finite-support sequence, TV⁡(U)=∑i∣Ui+1−Ui∣.

[F1]

Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions: the slope increments are σi=hsi=minmod⁡(Ui−Ui−1,Ui+1−Ui) and the positive-velocity face flux is Fi+1/2=Ui+σi/2.

Counterexample

1.1givenF1algebra

Set U−3=U3=0, U−2=U2=0, U−1=U1=1/2, U0=1, and Ui=0 for all other indices. The initial variation is 1/2+1/2+1/2+1/2=2. By [F1], the nonzero slope increments are σ−1=1/2 and σ1=−1/2; the central slope is σ0=minmod⁡(1/2,−1/2)=0, and the adjacent outer slopes are zero.

2.1F1step 1.1algebra

The relevant right-going face fluxes from [F1] are F−3/2=0, F−1/2=3/4, F1/2=1, F3/2=1/4, and F5/2=0. Substituting in the stated update gives U−1n+1=−1/4, U0n+1=3/4, U1n+1=5/4, and U2n+1=1/4, with neighboring states zero.

3.1step 1.1step 2.1algebra∎

The new variation is 1/4+1+1/2+1+1/4=3, which exceeds the initial value 2. The data satisfy the claimed CFL bound with equality, so the proposed all-data TVD claim is false.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Fixed-epsilon WENO-JS and WENO-Z face reconstructions are fifth order

Statement

Let u∈C5 on the five-cell stencil, let sup⁡∣u′′′∣<∞ and sup⁡∣u(5)∣<∞, and let ϵ0>0 be fixed independently of h. For the cell-average WENO-JS and WENO-Z states in Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions, there is a constant C independent of sufficiently small h such that ∣Ui+1/2−,J−u(xi+1/2)∣≤Ch5,∣Ui+1/2−,Z−u(xi+1/2)∣≤Ch5. The same result holds for the reflected right states.

Facts & Assumptions

Given: The fixed positive ϵ0, uniform cell averages of a C5 scalar function, the WENO-JS/WENO-Z formulas and ideal weights, and the finite-volume candidate estimates.

[F1]

Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions: each βk is a sum of squares, τ5=∣β0−β2∣, ϵ0>0, and both normalized weight triples are positive and sum to one.

[F2]

The WENO5 ideal linear weights reproduce quartics at the right face: ∑dkpk=u(xi+1/2)+O(h5) and each pk=u(xi+1/2)+O(h3) for the stated smooth data.

Proof

1.1givenF1algebra

Each first-difference combination in [F1] is O(h) on C1 data, and each second-difference combination is O(h2) on C2 data. Squaring shows βk=O(h2) for all three stencils; consequently τ5=O(h2). For the constant data case all these differences vanish and both schemes return the ideal weights exactly.

2.1F1step 1.1algebra

For WENO-JS, αkJ=dkϵ0−2(1+βk/ϵ0)−2=dkϵ0−2(1+O(h2)). Since ∑dk=1, normalization gives ωkJ=dk+O(h2). For WENO-Z, ϵ0+βk≥ϵ0, so (τ5/(ϵ0+βk))2=O(h4); hence αkZ=dk(1+O(h4)) and normalization gives ωkZ=dk+O(h4). The positive fixed ϵ0 makes all constants uniform for sufficiently small h.

3.1F2step 2.1algebra∎

For either normalized weight vector ω, ∑k(ωk−dk)=0. Therefore ∑kωkpk−∑kdkpk=∑k(ωk−dk)(pk−u(xi+1/2)). By [F2] the right side is O(h5) for WENO-JS and O(h7) for WENO-Z. The ideal combination has error O(h5) by [F2], so both left states have error O(h5). Reflection changes only the stencil orientation and preserves the same estimates.

Remarks

This is the fixed-ϵ0 asymptotic branch. The estimate does not claim fifth order for arbitrary choices ϵ=ϵ(h); the critical-point example on the companion page computes a scale-dependent branch separately.

5 · Examples, counterexamples and false statements

None yet.

Sources