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 . The following two claims hold.
Strict domain-of-dependence obstruction. Suppose and along a subsequence for some fixed , and put . Consider any homogeneous linear nearest-neighbor explicit update on the infinite grid whose value after steps depends only on initial indices . Fix a real-valued datum with and initialize each mesh by . The exact samples and numerical values fail to converge in the sampled maximum error at , where .
CFL insufficiency for centered advection. For any fixed period , set , , and for . Let be the centered advection update on this periodic grid and . Then , but Thus a fixed strict violation of 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 ; for the first claim, an infinite-grid homogeneous linear nearest-neighbor update and a mesh subsequence with ; and, independently, for the second claim, the fixed-period centered periodic family with .
The centered advection stencil in Periodic advection schemes and the finite-interval upwind row is a homogeneous explicit nearest-neighbor update.
For a real-valued function on an open subset of , the first coordinate partial derivatives exist and are continuous; a classical solution on a neighborhood of a characteristic segment is continuous on that segment ( maps and multi-index derivative notation in Euclidean space).
Finite induction on the natural-number step count is valid (The principle of mathematical induction).
There is a real cutoff with for and for (Explicit compactly supported smooth cutoffs).
For constant velocity , the characteristic ODE is with terminal value , and the transport equation is (Linear transport equations and their characteristic flow).
A real differentiable function with zero derivative on an interval is constant there, by the mean value theorem (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
For every real there is a unique integer with (Integer part: for every real there is exactly one integer with ).
For an open interval , consists of smooth functions whose support is a compact subset of ; its real-valued functions form the real test-function subspace (Test function space d of an open set).
On a periodic grid, the centered advection factor is , where and ; the modes form an orthogonal basis (Amplification symbols for periodic scalar advection stencils).
The operator norm is the supremum of over the unit ball in the given norm (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
The periodic grid has indices modulo and norm (Uniform periodic, infinite, and Dirichlet grid conventions).
Proof
Put and take from [F4]. Set . Then is smooth, equals at zero, and is supported in , a compact subset of ; by [F8] it is an admissible real-valued datum.
By finite induction [F3], the value at index after zero steps depends only on . If every value after steps depends only on initial indices , then the next update reads indices at time , whose initial dependence intervals have union . Thus after steps only initial indices can affect the value.
Along the violating subsequence put and . By [F7], , so . Since , the left edge of the numerical dependence interval obeys For all sufficiently large , this exceeds . Hence every sampled initial value on which depends is zero, so .
The constant-velocity characteristic is : it has derivative and terminal value , and any other solution agrees by [F6] applied to its difference from . The explicit function has partial derivatives and by one-variable difference quotients, so it solves with initial data . To verify uniqueness, let be any classical solution on an open neighborhood of this characteristic segment with the same initial data, fix , and set on . For interior and small nonzero whose coordinate segments remain in the solution domain, applying [F6] separately in the first and second coordinates gives where lies between and , and lies between and . As , these intermediate points tend to , so continuity of the partials in [F2] yields . Then [F6] makes constant, hence . Since and , the exact characteristic foot tends to . By continuity and , the exact sample tends to , while step 2.1 gives numerical value zero. Thus the sampled maximum error does not tend to zero.
For the separate centered-family claim, fix and use , , , and . Then [F1] gives the centered update with , and the Fourier index is admissible with . By [F9] its multiplier is , so . Repeated application gives . The mode is nonzero, and the finite Fourier basis in [F9] diagonalizes with finitely many finite multipliers, so this operator is bounded. By [F10] its norm is at least . Since [F7] gives , these norms are unbounded while all time levels satisfy . Thus the domain-of-dependence bound is not sufficient for uniform finite-time power stability.
Depends on
- Periodic advection schemes and the finite-interval upwind row
- Uniform periodic, infinite, and Dirichlet grid conventions
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- Amplification symbols for periodic scalar advection stencils
- Linear transport equations and their characteristic flow
- The mean value theorem, as the case $g(x) = x$ of Cauchy's: for $f$ continuous on $[a,b]$ with $a < b$ and differentiable on $(a,b)$ there is $c \in (a,b)$ with $f(b) - f(a) = f'(c)(b-a)$
- The principle of mathematical induction
- Explicit compactly supported smooth cutoffs
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
- Test function space d of an open set
- $C^k$ maps and multi-index derivative notation in Euclidean space
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
- Endre Süli, B6.1 Numerical Solution of Partial Differential Equations (standard reference, not scraped)
- Benjamin Seibold, MIT 18.336 Lecture 15, Finite Difference Methods for the One-Way Wave Equation (standard reference, not scraped)