Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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.

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.

Depends on

Used by

Dependency tree · two levels

54 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