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.

✓ 8 results · all verified · 2 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 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Hyperbolic finite-difference methods

1 · Prerequisites

2 · Summary

This page defines five scalar advection stencils on periodic or infinite uniform grids and the upwind inflow row on a finite interval. It proves smooth consistency orders, exact periodic Fourier power bounds, and the necessity of a nearest-neighbor domain-of-dependence CFL condition. A fixed-period centered-advection family is smooth-consistent but has no uniform finite-time power bound even with ak/h=1/2. For the centered leapfrog wave recurrence, the page proves the discrete Dirichlet summation identity, a conserved coercive energy for 0<ck/h<1, and periodic amplification estimates with explicit treatment of the mean and repeated Nyquist modes; its start data are displacement and discrete initial velocity. Periodic Fourier bounds do not establish finite-boundary stability; smooth consistency does not imply convergence at discontinuities.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Uniform periodic, infinite, and Dirichlet grid conventions

Definition

Use N for the natural-number index set (including zero) (The natural numbers N (von Neumann)), R for the real scalar field (The real numbers), and C with its real embedding and modulus (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i, Real and imaginary parts, complex conjugation, and modulus).

Let N≥2, h>0, k>0, and tn=nk. For the finite periodic grid put JN={0,…,N−1} and reduce every shifted index modulo N. A periodic grid function is a map v:JN→C, with weighted norm ∥v∥2,h=(h∑j=0N−1∣vj∣2)1/2. The infinite uniform grid has indices j∈Z and positions xj=jh. On the periodic and infinite grids define (D+v)j=vj+1−vjh,(D−v)j=vj−vj−1h,(D0v)j=vj+1−vj−12h,(Δhv)j=vj+1−2vj+vj−1h2. Use the inner product linear in its first entry, ⟨p,q⟩2,h=h∑j=0N−1pjqj‾,⟨D+p,D+q⟩e,h=h∑j=0N−1(D+p)j(D+q)j‾, where the indices in D+ are reduced periodically, and set ∥D+p∥e,h2=⟨D+p,D+p⟩e,h. The same definitions apply to real-valued grid functions.

For a finite interval of length L=Nh, use physical nodes xj=jh with indices j=0,…,N. On its edges j=0,…,N−1 define (D+v)j=(vj+1−vj)/h, and on interior nodes j=1,…,N−1 use (Δhv)j=(vj+1−2vj+vj−1)/h2. At the right endpoint define (D−v)N=(vN−vN−1)/h. For interior-node arrays r,s indexed by j=1,…,N−1 and edge arrays p,q indexed by j=0,…,N−1, define ⟨r,s⟩h=h∑j=1N−1rjsj‾,∥r∥h2=⟨r,r⟩h,⟨p,q⟩e,h=h∑j=0N−1pjqj‾. Set ∥p∥e,h2=⟨p,p⟩e,h. For nodal grid functions, interior pairings and norms mean restriction to the interior nodes. Thus ∥⋅∥h is a norm on the zero-endpoint subspace, but only a seminorm on the full nodal space. Dirichlet grid functions have prescribed endpoint values; when they are zero, the interior norm and edge inner product above are the ones used for the wave energy.

All statements below distinguish these periodic, infinite, and finite-interval index sets. Periodic Fourier calculations are not boundary estimates for the finite-interval grid.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Periodic advection schemes and the finite-interval upwind row

Definition

Use the index sets and uniform spacings of Uniform periodic, infinite, and Dirichlet grid conventions: xj=jh, j∈Z, or j reduced modulo N in the periodic case. Fix a>0, h,k>0, and ν=ak/h. The target equation is the one-dimensional constant-velocity transport equation ut+aux=0, the constant-coefficient case of Linear transport equations and their characteristic flow. Set Uj0=u0(jh) and define, for n≥0, upwind: Ujn+1=Ujn−ν(Ujn−Uj−1n),downwind: Ujn+1=Ujn−ν(Uj+1n−Ujn),centered: Ujn+1=Ujn−ν2(Uj+1n−Uj−1n),Lax–Friedrichs: Ujn+1=Uj−1n+Uj+1n2−ν2(Uj+1n−Uj−1n),Lax–Wendroff: Ujn+1=Ujn−ν2(Uj+1n−Uj−1n)+ν22(Uj+1n−2Ujn+Uj−1n). On a periodic grid, every index in these formulas is reduced modulo N; no physical boundary data are present. For a<0, reflect the stencil by j↦−j and replace ν by ∣a∣k/h.

For a finite interval [0,L] with a>0, the inflow boundary is x=0. The upwind initial/boundary rows are Uj0=u0(jh) for j=0,…,N, U0n=g(tn) with u0(0)=g(0), and Ujn+1=(1−ν)Ujn+νUj−1n,j=1,…,N,n≥0. The outflow node j=N is computed by this row and receives no prescribed value. This item supplies no finite-interval boundary closure or stability statement for centered, Lax--Friedrichs, or Lax--Wendroff updates.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Centered leapfrog wave recurrence with Dirichlet and periodic rows

Definition

Use the uniform-grid indices, physical nodes, and spacings of Uniform periodic, infinite, and Dirichlet grid conventions. Fix a wave speed c>0, an interval length L=Nh with N≥2, and a time step k>0. Write ν=ck/h. The target model is the real scalar wave equation utt=c2uxx, and grid states are real-valued. Prescribe a real initial displacement row U0 and discrete initial-velocity row V0, and set U1=U0+kV0. For smooth Dirichlet data u0,u1:[0,L]→R with u0(0)=u0(L)=u1(0)=u1(L)=0, the corresponding sample rows are Uj0=u0(xj) and Vj0=u1(xj); for smooth periodic data, take real L-periodic u0,u1 and sample them at xj. In both cases the discrete initial velocity equals the sampled u1. The centered leapfrog recurrence is Ujn+1−2Ujn+Ujn−1=ν2(Uj+1n−2Ujn+Uj−1n),n≥1. For the finite Dirichlet interval, require U00=UN0=V00=VN0=0 and impose the recurrence for j=1,…,N−1, with U0n=UNn=0 for every n≥0. For the periodic branch, use j=0,…,N−1, reduce indices modulo N, and impose the recurrence at every node. Fourier analysis of this real periodic update uses its complex-linear extension to the complexified grid space. No convergence order for a particular initialization formula is asserted here.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

One-dimensional discrete summation by parts with boundary terms

Statement

Let N≥2, h>0, and let u=(u0,…,uN) and v=(v0,…,vN) be complex grid functions. With the finite-interval inner products and differences of Uniform periodic, infinite, and Dirichlet grid conventions, ⟨u,−Δhv⟩h=⟨D+u,D+v⟩e,h+u0(D+v)0‾−uN(D−v)N‾. In particular, if u0=uN=0, the two boundary terms vanish. On the subspace of grid functions with zero endpoints, −Δh is self-adjoint and nonnegative in the interior grid inner product, with ⟨u,−Δhu⟩h=∥D+u∥e,h2.

Facts & Assumptions

Given: N≥2, h>0, and complex grid values uj,vj on j=0,…,N.

[F1]

The interior and edge inner products and differences are defined in Uniform periodic, infinite, and Dirichlet grid conventions.

Proof

1.1F1algebra

Put dj=vj−vj−1 for j=1,…,N. Expanding the second difference gives ⟨u,−Δhv⟩h=−1h∑j=1N−1uj(dj+1−dj)‾. Shift the index in the dj+1 sum and telescope: −∑j=1N−1uj(dj+1−dj)‾=∑j=1N(uj−uj−1)dj‾+u0d1‾−uNdN‾. Dividing by h identifies the edge sum and boundary terms in the displayed identity.

2.1step 1.1F1∎

When u0=uN=0, step 1.1 reduces to ⟨u,−Δhv⟩h=⟨D+u,D+v⟩e,h. Applying this identity after exchanging u,v and taking complex conjugates gives ⟨−Δhu,v⟩h=⟨u,−Δhv⟩h, so −Δh is self-adjoint on the zero-endpoint subspace. Setting u=v gives ⟨u,−Δhu⟩h=∥D+u∥e,h2≥0.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

A finite-grid Poincare inequality for zero endpoint values

Statement

Let N≥2, h>0, L=Nh, and let w=(w0,…,wN) be a complex grid function with w0=wN=0. Then ∥w∥h≤L∥D+w∥e,h.

Facts & Assumptions

Given: A complex grid function w on j=0,…,N with zero endpoint values.

[F1]

The weighted interior and edge norms are those of Uniform periodic, infinite, and Dirichlet grid conventions.

Proof

1.1givenF1algebra

For each 1≤j≤N−1, put di=wi+1−wi for i=0,…,j−1. Expanding both expressions shows j∑i=0j−1∣di∣2−∣∑i=0j−1di∣2=∑0≤i<r<j∣di−dr∣2, since each side equals (j−1)∑i∣di∣2−∑i<r(didr‾+drdi‾). The right side is nonnegative. Since w0=0, wj=∑i=0j−1di, so ∣wj∣2≤j∑i=0j−1∣wi+1−wi∣2≤N∑i=0N−1∣wi+1−wi∣2.

2.1step 1.1F1algebra∎

Sum the step 1.1 bound over j=1,…,N−1 and multiply by h. Since (N−1)Nh≤N2h and ∥D+w∥e,h2=h−1∑i=0N−1∣wi+1−wi∣2, we obtain ∥w∥h2≤N2h2∥D+w∥e,h2=L2∥D+w∥e,h2. Taking nonnegative square roots proves the claim.

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

Smooth consistency orders for the five periodic advection stencils

Statement

Fix a∈R∖{0}. Let u:R2→R be a C6 solution of ut+aux=0 that is periodic in x with period P>0, so u(x+P,t)=u(x,t), and whose derivatives through order six are bounded. Let h,k→0 with 0<c−≤k/h≤c+<∞, and put ν=∣a∣k/h. For a stencil S, define its local residual by τS(x,t)=u(x,t+k)−S(u(⋅,t))(x)k. Then, for the sign-selected stencils of Periodic advection schemes and the finite-interval upwind row, the upwind, downwind, centered, and Lax--Friedrichs residuals are O(h) uniformly in (x,t), while the Lax--Wendroff residual is O(h2). Here a remainder R=O(η(h,k)) uniformly means ∣R(x,t;h,k)∣≤Cη(h,k) for all x,t and sufficiently small h,k, with C independent of x,t,h,k under the stated ratio bounds. These are smooth-solution consistency statements and imply no convergence result at discontinuities.

Facts & Assumptions

Given: The stated smooth solution, fixed nonzero speed a, and two-sided mesh ratio c−≤k/h≤c+.

[F1]

The five periodic stencils use the stated sign convention for a>0 and are reflected by j↦−j for a<0, with ν=∣a∣k/h (Periodic advection schemes and the finite-interval upwind row).

[F2]

If derivatives through order m+1 are bounded on the segment, the order-m Taylor polynomial has a remainder bounded by the derivative bound times the corresponding power divided by (m+1)! (A uniform derivative bound gives a uniform Taylor remainder bound).

[F3]

For a function on an open subset of R2, C6 means that every iterated partial derivative of total order at most six exists and is continuous (Ck maps and multi-index derivative notation in Euclidean space).

[F4]

For a Ck function, iterated partial derivatives of order k are unchanged by permuting the coordinate differentiations (Continuous mixed partials of order k are invariant under permutations).

Proof

1.1givenF1F3constructalgebra

If a<0, set A=−a>0 and u~(x,t)=u(−x,t). For fixed x, its time difference quotient is that of u at (−x,t), so u~t(x,t)=ut(−x,t). In its spatial difference quotient, substitute s=−h to get u~x(x,t)=−ux(−x,t). Repeating these coordinate calculations gives ∂xp∂tqu~(x,t)=(−1)p(∂xp∂tqu)(−x,t), so the period and derivative bounds are preserved. The PDE gives u~t+Au~x=ut(−x,t)−Aux(−x,t)=0. The definition's reflection j↦−j identifies each negative-speed stencil residual with the corresponding positive-speed residual of u~ at the reflected point. If a>0, take A=a and u~=u. It is therefore enough to derive the estimates for positive speed A.

2.1givenF2F3F4step 1.1algebra

For this positive-speed solution, differentiating u~t=−Au~x in t and x, then using [F4] to commute the order-two mixed partials, gives u~tt=−Au~xt=−Au~tx=A2u~xx. Differentiating this identity in t and the PDE twice in x, then using [F4] to commute the order-three partials, gives u~ttt=A2u~xxt=A2u~txx=−A3u~xxx. By [F3] these derivatives exist, and the bounded derivatives in the hypotheses make the Taylor remainders uniform. Taylor's formula from [F2] yields u~(x,t+k)−u~(x,t)k=u~t+k2u~tt+k26u~ttt+O(k3), u~(x+h,t)−u~(x−h,t)2h=u~x+h26u~xxx+O(h4),u~(x+h,t)−2u~(x,t)+u~(x−h,t)h2=u~xx+h212u~xxxx+O(h4). The one-sided expansions are (u~(x,t)−u~(x−h,t))/h=u~x−h2u~xx+O(h2) and (u~(x+h,t)−u~(x,t))/h=u~x+h2u~xx+O(h2).

3.1F1step 1.1step 2.1algebra

Substituting the step 2.1 expansions into [F1] with speed A=∣a∣ and using u~t+Au~x=0 gives τup=k2u~tt−Ah2u~xx+O(k2+h2),τdown=k2u~tt+Ah2u~xx+O(k2+h2),τcentered=k2u~tt+O(k2+h2). For Lax--Friedrichs the symmetric average contributes −h2u~xx/(2k) to the residual, so τLF=k2u~tt−h22ku~xx+O(k2+h2+h4/k). For Lax--Wendroff the ku~tt/2 term cancels the second-difference term by u~tt=A2u~xx, leaving τLW=k26u~ttt+Ah26u~xxx+O(k3+h4+kh2). Reflection in step 1.1 transfers these residual bounds to the negative-speed branch.

4.1givenstep 1.1step 3.1algebra∎

The mesh ratio bounds imply k=O(h) and h2/k=O(h). Thus the first four residuals are uniformly O(h), and every displayed Lax--Wendroff term is O(h2) or smaller. By step 1.1 the same estimates hold for either velocity sign. The conclusion concerns only the sampled smooth solution in the stated periodic setting.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

Coercive discrete energy for the Dirichlet leapfrog wave scheme

Statement

For the homogeneous Dirichlet recurrence of Centered leapfrog wave recurrence with Dirichlet and periodic rows, let 0<ν=ck/h<1, Vn=(Un+1−Un)/k, and Uˉn=(Un+1+Un)/2. Define En+1/2=12∥Vn∥h2+c22⟨D+Un+1,D+Un⟩e,h. Then En+1/2 is independent of n and En+1/2≥1−ν22∥Vn∥h2+c22∥D+Uˉn∥e,h2. Consequently it is a positive quadratic form on adjacent zero-boundary states. For mesh families with fixed wave speed c>0, fixed interval length L, and ν≤ν0<1, it controls the interior state and its discrete velocity with constants independent of h.

Facts & Assumptions

Given: A fixed wave speed c>0, mesh sizes h,k>0, homogeneous Dirichlet endpoint values, and the source-free centered leapfrog recurrence.

[F1]

The recurrence is δt2Un=c2ΔhUn, with U0n=UNn=0 (Centered leapfrog wave recurrence with Dirichlet and periodic rows).

[F2]

For zero endpoint values, ⟨u,−Δhv⟩h=⟨D+u,D+v⟩e,h; this is symmetric in u,v (One-dimensional discrete summation by parts with boundary terms).

[F3]

If w0=wN=0 on length L=Nh, then ∥w∥h≤L∥D+w∥e,h (A finite-grid Poincare inequality for zero endpoint values).

Proof

1.1F1algebra

In the quadratic term, D+Un+1=D+Uˉn+k2D+Vn and D+Un=D+Uˉn−k2D+Vn. Expanding their real edge inner product gives En+1/2=12∥Vn∥h2+c22∥D+Uˉn∥e,h2−c2k28∥D+Vn∥e,h2.

2.1givenstep 1.1algebra

For any zero-endpoint grid function v, (vj+1−vj)2≤2vj+12+2vj2 and summing over edges gives ∥D+v∥e,h2=1h∑j=0N−1(vj+1−vj)2≤4h2∥v∥h2. Apply this to Vn, and use ν=ck/h, in step 1.1 to obtain the asserted lower bound. Since 1−ν2>0, zero energy forces Vn=0 and D+Uˉn=0.

3.1F3step 2.1algebra

A zero-endpoint grid function with D+w=0 is constant across all edges and therefore zero. Hence step 2.1 shows En+1/2=0 only when Vn=0 and Uˉn=0, equivalently Un+1=Un=0. For uniform state control, [F3] bounds ∥Uˉn∥h by L∥D+Uˉn∥e,h, and Un+1,Un=Uˉn±(k/2)Vn; when ν≤ν0<1, the lower-bound coefficients and k≤ν0L/(Nc)≤ν0L/c are uniform in the mesh.

4.1F1F2step 1.1algebra∎

Let δt0Un=(Un+1−Un−1)/(2k). Taking the interior inner product of δt2Un+c2(−Δh)Un=0 with δt0Un, the first term is (∥Vn∥h2−∥Vn−1∥h2)/(2k). By [F2], the second is c22k(⟨D+Un+1,D+Un⟩e,h−⟨D+Un,D+Un−1⟩e,h). Their sum is (En+1/2−En−1/2)/k=0. Thus the energy is conserved.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

Amplification symbols for periodic scalar advection stencils

Statement

On an N-point periodic grid let zℓ=exp⁡(2πiℓ/N), Cℓ=Re⁡zℓ, Sℓ=Im⁡zℓ, and ν=ak/h with a>0. The Fourier vector j↦zℓj is multiplied in one step by gup=1−ν+νzℓ−1,gdown=1+ν−νzℓ,gcentered=1−iνSℓ,gLF=Cℓ−iνSℓ,gLW=1−ν2(1−Cℓ)−iνSℓ. Their squared moduli, in the same order, are 1−2ν(1−ν)(1−Cℓ),1+2ν(1+ν)(1−Cℓ),1+ν2Sℓ2,1−(1−ν2)Sℓ2,1−ν2(1−ν2)(1−Cℓ)2. The N Fourier vectors form an orthogonal basis under the periodic inner product of Uniform periodic, infinite, and Dirichlet grid conventions, and each has squared norm Nh.

Facts & Assumptions

Given: N≥2, a,h,k>0, and the periodic stencils of Periodic advection schemes and the finite-interval upwind row.

[F1]

The five one-step formulas and periodic wrap are defined in Periodic advection schemes and the finite-interval upwind row.

[F2]

The finite root-of-unity sum ∑j=0N−1exp⁡(2πi(ℓ−r)j/N) equals N if ℓ≡r(modN) and 0 otherwise (Orthogonality of the characters x↦e2πikx/N on Z/NZ).

[F3]

The displayed periodic Fourier modes form a basis of the complexified grid space (Periodic heat-stencil eigenvalues and θ amplification factor).

[F4]

For complex numbers, zˉ=Re⁡z−iIm⁡z and zzˉ=∣z∣2; conjugation is multiplicative and modulus obeys the field laws (Real and imaginary parts, complex conjugation, and modulus, Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F5]

The periodic grid inner product and norm are ⟨p,q⟩2,h=h∑jpjqj‾ and ∥p∥2,h2=h∑j∣pj∣2 (Uniform periodic, infinite, and Dirichlet grid conventions).

Proof

1.1F1F4algebra

Write ϕj=zℓj. Then ϕj+1=zℓϕj, ϕj−1=zℓ−1ϕj, and zℓ−1=zˉℓ. Substitution into each update in [F1] gives, respectively, 1−ν+νzℓ−1,1+ν−νzℓ,1−ν2(zℓ−zℓ−1),zℓ+zℓ−12−ν2(zℓ−zℓ−1),1−ν2(zℓ−zℓ−1)+ν22(zℓ+zℓ−1−2). Since zℓ−1=Cℓ−iSℓ, these are the displayed factors.

2.1F4step 1.1algebra

The identity ∣zℓ∣=1 gives Cℓ2+Sℓ2=1. Multiplying each factor in step 1.1 by its conjugate and simplifying with this identity gives the five displayed squared-modulus formulas.

3.1F2F3F5step 1.1∎

By [F2] the distinct Fourier modes are mutually orthogonal; by [F3] they form a basis. By [F5], each has squared norm Nh, so the normalized modes are an orthonormal basis. Every update is diagonal in this basis with the factors from step 1.1, which therefore describe the full periodic updates.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

Periodic leapfrog amplification, finite-time bounds, and the Nyquist endpoint

Statement

On a periodic grid of length L=Nh, let ν=ck/h>0, V0=(U1−U0)/k, and write Un=∑ℓ=0N−1wℓnϕℓ in the discrete Fourier basis; write V^ℓ0 for the coefficient of V0 in the same basis. Then wℓn+1−2(1−2ν2sℓ)wℓn+wℓn−1=0,sℓ=sin⁡2(πℓ/N). For 0<ν≤ν0<1, the nonconstant roots are distinct and have modulus one, and ∥Un∥2,h≤(1+ν01−ν02)∥U0∥2,h+tn∥V0∥2,h. The mean mode is w0n=w00+tnV^00. At ν=1 and even N, the Nyquist mode has the repeated root −1 and solution wN/2n=(−1)n(A+nB), where B=0 exactly when wN/21=−wN/20. Thus arbitrary starting pairs do not have a uniform endpoint power bound.

Facts & Assumptions

Given: N≥2, fixed L=Nh, c,h,k>0, and the periodic centered leapfrog scheme.

[F1]

The periodic branch obeys Ujn+1−2Ujn+Ujn−1=ν2(Uj+1n−2Ujn+Uj−1n) (Centered leapfrog wave recurrence with Dirichlet and periodic rows).

[F2]

The one-dimensional specialization of the periodic heat symbol lemma with unit diffusivity gives −Δhϕℓ=4h−2sℓϕℓ (Periodic heat-stencil eigenvalues and θ amplification factor).

[F3]

The displayed periodic Fourier modes form a basis of the complexified grid space (Periodic heat-stencil eigenvalues and θ amplification factor).

[F4]

The finite root-of-unity sum gives orthogonality of distinct periodic Fourier modes (Orthogonality of the characters x↦e2πikx/N on Z/NZ).

[F6]

The periodic grid norm is ∥v∥2,h2=h∑j∣vj∣2 (Uniform periodic, infinite, and Dirichlet grid conventions).

Proof

1.1F1F2algebra

Substituting one mode from [F2] into [F1] uses −Δhϕℓ=4h−2sℓϕℓ and gives the displayed scalar recurrence, whose characteristic polynomial is pℓ(r)=r2−2(1−2ν2sℓ)r+1.

2.1F5step 1.1algebra

For ℓ=0, s0=0, so successive first differences are constant and w0n=w00+n(w01−w00)=w00+tnV^00. For ℓ≠0 and ν<1, put q=1−2ν2sℓ; then −1<q<1, and ρ=q+i1−q2 and ρˉ are distinct roots with modulus one.

2.2step 1.1F5algebra

For a nonconstant mode the recurrence solution matching wℓ0,wℓ1 is wℓn=wℓ0ρn+ρˉn2+(wℓ1−qwℓ0)ρn−ρˉnρ−ρˉ. Indeed both sequences solve the recurrence and the right side equals wℓ0,wℓ1 at n=0,1. The quotient is ∑r=0n−1ρn−1−rρˉr, so its modulus is at most n. Also ∣(ρn−ρˉn)/(ρ−ρˉ)∣≤1/1−q2 since ∣ρn−ρˉn∣≤2 and ∣ρ−ρˉ∣=21−q2.

3.1F2step 2.2algebra

Since wℓ1−qwℓ0=kV^ℓ0+(1−q)wℓ0 and 1−q1−q2=νsℓ1−ν2sℓ≤ν01−ν02, step 2.2 gives ∣wℓn∣≤(1+ν0/1−ν02)∣wℓ0∣+tn∣V^ℓ0∣. The same bound holds for the mean mode.

4.1F3F4F5F6step 3.1algebra

The modes are a basis by [F3] and orthogonal by [F4]. By [F6], each has squared norm Nh, so Parseval's identity holds in ∥⋅∥2,h. Squaring the coefficient bounds, summing, and using (∑ℓaℓbℓ)2≤(∑ℓaℓ2)(∑ℓbℓ2), which follows by expanding ∑ℓ<r(aℓbr−arbℓ)2≥0, yields the stated weighted-grid norm estimate.

5.1F1step 1.1algebra∎

If ν=1, N is even, and ℓ=N/2, then sℓ=1 and pℓ(r)=(r+1)2. Its solutions are (−1)n(A+nB); the initial values give B=−wℓ1−wℓ0, so B=0 exactly when wℓ1=−wℓ0. For B≠0 the mode grows linearly in n, proving the endpoint caveat.

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

Scheme-specific periodic power stability for scalar advection

Statement

For the periodic schemes of Periodic advection schemes and the finite-interval upwind row with a>0, upwind powers are contractions in ∥⋅∥2,h for 0≤ν≤1 and grow for ν>1. Lax--Friedrichs and Lax--Wendroff powers are contractions for ∣ν∣≤1; when ∣ν∣>1, Lax--Wendroff grows for N≥2 and Lax--Friedrichs grows for N≥3 (the N=2 Lax--Friedrichs stencil aliases its nonconstant mode). Downwind powers grow for every ν>0 and N≥2. Centered powers grow for every ν≠0 when N≥3, while the N=2 centered stencil aliases to the identity. Reflection gives the same assertions for a<0 with ∣ν∣.

Facts & Assumptions

Given: A finite periodic grid with N≥2, fixed a>0, h,k>0, and the exact amplification formulas.

[F1]

The N periodic Fourier vectors form an orthogonal basis (Amplification symbols for periodic scalar advection stencils).

[F2]

The five amplification factors and squared moduli are those of Amplification symbols for periodic scalar advection stencils.

[F3]

The five periodic updates and their indexing are defined in Periodic advection schemes and the finite-interval upwind row.

[F4]

For a bounded linear map, its operator norm is the supremum of ∥Tx∥ over the unit ball (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F5]

For z=C+iS with ∣z∣=1, one has C2+S2=1 and hence 1−C≥0, 0≤S2≤1; complex conjugation and modulus obey their field laws (Real and imaginary parts, complex conjugation, and modulus, Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

Proof

1.1F2F3F5algebra

By [F5], 1−Cℓ≥0 and 0≤Sℓ2≤1. Thus for 0≤ν≤1, the upwind formula gives ∣gup∣2≤1; for ∣ν∣≤1, the Lax--Friedrichs formula gives ∣gLF∣2≤1, and the Lax--Wendroff formula gives ∣gLW∣2≤1.

1.2F2F3F5algebra

If ν>1, every nonconstant mode has Cℓ<1, so ∣gup∣2=1+2ν(ν−1)(1−Cℓ)>1. If ∣ν∣>1 and N≥2, the Lax--Wendroff mode ℓ=1 has Cℓ<1 and ∣gLW∣2=1+ν2(ν2−1)(1−Cℓ)2>1. For Lax--Friedrichs with ∣ν∣>1 and N≥3, some mode has Sℓ≠0, so ∣gLF∣2=1+(ν2−1)Sℓ2>1. Downwind has ∣gdown∣2>1 for each nonconstant mode whenever ν>0. Centered has ∣gcentered∣2>1 on any mode with Sℓ≠0, which exists exactly when N≥3.

2.1F1F2F3F4F5step 1.1step 1.2∎

Write an arbitrary vector as v=∑ℓcℓψℓ in the orthonormal Fourier basis [F1]. The m-step update sends it to ∑ℓcℓgℓmψℓ, so ∥Tmv∥2,h2=∑ℓ∣cℓ∣2∣gℓ∣2m≤(max⁡ℓ∣gℓ∣m)2∥v∥2,h2. Since the finite set of modes has an index attaining this maximum and its basis vector is nonzero, equality is attained there; [F4] therefore gives ∥Tm∥=max⁡ℓ∣gℓ∣m. The bounds and growing modes in steps 1.1 and 1.2 now give the claimed contraction and instability statements, including the N=2 aliasing cases.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passOpen item page →

The nearest-neighbor CFL condition is necessary but not sufficient

Statement

Fix a,T>0. The following two claims hold.

Strict domain-of-dependence obstruction. Suppose hm,km→0 and along a subsequence akm/hm≥1+ε for some fixed ε>0, and put R=aTε/(4(1+ε)). Consider any homogeneous linear nearest-neighbor explicit update on the infinite grid whose value after n steps depends only on initial indices j−n,…,j+n. Fix a real-valued datum u0∈Cc∞((−R,R);R) with u0(0)=1 and initialize each mesh by Uj0=u0(jhm). The exact samples u0(jhm−atm) and numerical values fail to converge in the sampled maximum error sup⁡j∈Z∣Ujnm−u0(jhm−atm)∣ at tm=nmkm→T, where nm=⌊T/km⌋.

CFL insufficiency for centered advection. For any fixed period P>0, set Nq=4q, hq=P/Nq, and kq=hq/(2a) for q≥1. Let Qq be the centered advection update on this periodic grid and rq=⌊T/kq⌋. Then 0<akq/hq=1/2<1, but max⁡r∈N0≤rkq≤T∥Qqr∥2,hq→2,hq≥∥Qqrq∥2,hq→2,hq≥(5/2)rq⟶∞. Thus a fixed strict violation of ak/h≤1 prevents convergence for the nearest-neighbor family, while the domain-of-dependence bound does not suffice for uniform finite-time power stability of every periodic nearest-neighbor scheme.

Facts & Assumptions

Given: Fixed a,T>0; for the first claim, an infinite-grid homogeneous linear nearest-neighbor update and a mesh subsequence with ak/h≥1+ε; and, independently, for the second claim, the fixed-period centered periodic family with Nq=4q.

[F1]

The centered advection stencil in Periodic advection schemes and the finite-interval upwind row is a homogeneous explicit nearest-neighbor update.

[F2]

For a real-valued C1 function on an open subset of R2, the first coordinate partial derivatives exist and are continuous; a classical solution on a neighborhood of a characteristic segment is continuous on that segment (Ck maps and multi-index derivative notation in Euclidean space).

[F3]

Finite induction on the natural-number step count is valid (The principle of mathematical induction).

[F4]

There is a real cutoff χ∈Cc∞(R) with χ=1 for ∣x∣≤1 and χ=0 for ∣x∣≥2 (Explicit compactly supported smooth cutoffs).

[F5]

For constant velocity a, the characteristic ODE is X′(s)=a with terminal value X(t)=x, and the transport equation is ut+aux=0 (Linear transport equations and their characteristic flow).

[F7]

For every real y there is a unique integer m=⌊y⌋ with m≤y<m+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

[F8]

For an open interval I, Cc∞(I;C) consists of smooth functions whose support is a compact subset of I; its real-valued functions form the real test-function subspace (Test function space d of an open set).

[F9]

On a periodic grid, the centered advection factor is gcentered=1−iνSℓ, where zℓ=e2πiℓ/N and Sℓ=Im⁡zℓ; the modes form an orthogonal basis (Amplification symbols for periodic scalar advection stencils).

[F10]

The operator norm is the supremum of ∥Qv∥ over the unit ball in the given norm (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F11]

The periodic grid has indices modulo N and norm ∥v∥2,h2=h∑j=0N−1∣vj∣2 (Uniform periodic, infinite, and Dirichlet grid conventions).

Proof

1.1givenF4F8algebra

Put R=aTε/(4(1+ε)) and take χ from [F4]. Set u0(x)=χ(3x/R). Then u0 is smooth, equals 1 at zero, and is supported in [−2R/3,2R/3], a compact subset of (−R,R); by [F8] it is an admissible real-valued datum.

1.2givenF3induction

By finite induction [F3], the value at index j after zero steps depends only on j. If every value after n steps depends only on initial indices j−n,…,j+n, then the next update reads indices j−1,j,j+1 at time n, whose initial dependence intervals have union [j−(n+1),j+(n+1)]. Thus after n steps only initial indices j−n,…,j+n can affect the value.

2.1givenF7step 1.1step 1.2algebra

Along the violating subsequence put nm=⌊T/km⌋ and jm=⌊aT/hm+1/2⌋. By [F7], jm≤aT/hm+1/2<jm+1, so ∣jmhm−aT∣≤hm/2. Since nmhm≤Thm/km≤aT/(1+ε), the left edge of the numerical dependence interval obeys jmhm−nmhm≥aTε1+ε−hm2. For all sufficiently large m, this exceeds R. Hence every sampled initial value on which Ujmnm depends is zero, so Ujmnm=0.

3.1F2F5F6step 1.1step 2.1algebra

The constant-velocity characteristic is X(s;t,x)=x+a(s−t): it has derivative a and terminal value x, and any other solution agrees by [F6] applied to its difference from X. The explicit function u∗(y,s)=u0(y−as) has partial derivatives uy∗=u0′(y−as) and us∗=−au0′(y−as) by one-variable difference quotients, so it solves ut+aux=0 with initial data u0. To verify uniqueness, let u be any classical solution on an open neighborhood of this characteristic segment with the same initial data, fix (x,t), and set v(s)=u(x+a(s−t),s) on [0,t]. For interior s and small nonzero δ whose coordinate segments remain in the solution domain, applying [F6] separately in the first and second coordinates gives v(s+δ)−v(s)δ=aux(ξδ,s+δ)+ut(x+a(s−t),ηδ), where ξδ lies between x+a(s−t) and x+a(s+δ−t), and ηδ lies between s and s+δ. As δ→0, these intermediate points tend to (x+a(s−t),s), so continuity of the partials in [F2] yields v′(s)=aux(x+a(s−t),s)+ut(x+a(s−t),s)=0. Then [F6] makes v constant, hence u(x,t)=u0(x−at). Since 0≤T−nmkm<km and km→0, the exact characteristic foot jmhm−anmkm tends to aT−aT=0. By continuity and u0(0)=1, the exact sample tends to 1, while step 2.1 gives numerical value zero. Thus the sampled maximum error does not tend to zero.

4.1givenF1F7F9F10F11algebra∎

For the separate centered-family claim, fix P>0 and use Nq=4q, hq=P/(4q), kq=hq/(2a), and rq=⌊T/kq⌋. Then [F1] gives the centered update with akq/hq=1/2, and the Fourier index ℓ=q is admissible with zℓ=exp⁡(2πiq/(4q))=i. By [F9] its multiplier is g=1−i/2, so ∣g∣=5/2>1. Repeated application gives Qqrqϕq=grqϕq. The mode is nonzero, and the finite Fourier basis in [F9] diagonalizes Qqrq with finitely many finite multipliers, so this operator is bounded. By [F10] its norm is at least ∣g∣rq. Since [F7] gives rq≥T/kq−1=8aTq/P−1→∞, these norms are unbounded while all time levels satisfy rqkq≤T. Thus the domain-of-dependence bound is not sufficient for uniform finite-time power stability.

5 · Examples, counterexamples and false statements

None yet.

Sources