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.
Hyperbolic finite-difference methods
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Elliptic finite-difference methods
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fourier Analysis and the Fast Fourier Transform
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Parabolic finite-difference methods
- Partial Differential Equations and Characteristics
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Suprema and Infima
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 . For the centered leapfrog wave recurrence, the page proves the discrete Dirichlet summation identity, a conserved coercive energy for , 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
Uniform periodic, infinite, and Dirichlet grid conventions
Definition
Use for the natural-number index set (including zero) (The natural numbers (von Neumann)), for the real scalar field (The real numbers), and with its real embedding and modulus (The complex numbers as , with the real embedding and imaginary unit , Real and imaginary parts, complex conjugation, and modulus).
Let , , , and . For the finite periodic grid put and reduce every shifted index modulo . A periodic grid function is a map , with weighted norm The infinite uniform grid has indices and positions . On the periodic and infinite grids define Use the inner product linear in its first entry, where the indices in are reduced periodically, and set . The same definitions apply to real-valued grid functions.
For a finite interval of length , use physical nodes with indices . On its edges define , and on interior nodes use . At the right endpoint define . For interior-node arrays indexed by and edge arrays indexed by , define Set . For nodal grid functions, interior pairings and norms mean restriction to the interior nodes. Thus 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.
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: , , or reduced modulo in the periodic case. Fix , , and . The target equation is the one-dimensional constant-velocity transport equation , the constant-coefficient case of Linear transport equations and their characteristic flow. Set and define, for , On a periodic grid, every index in these formulas is reduced modulo ; no physical boundary data are present. For , reflect the stencil by and replace by .
For a finite interval with , the inflow boundary is . The upwind initial/boundary rows are for , with , and The outflow node 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.
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 , an interval length with , and a time step . Write . The target model is the real scalar wave equation , and grid states are real-valued. Prescribe a real initial displacement row and discrete initial-velocity row , and set . For smooth Dirichlet data with , the corresponding sample rows are and ; for smooth periodic data, take real -periodic and sample them at . In both cases the discrete initial velocity equals the sampled . The centered leapfrog recurrence is For the finite Dirichlet interval, require and impose the recurrence for , with for every . For the periodic branch, use , reduce indices modulo , 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.
One-dimensional discrete summation by parts with boundary terms
Statement
Let , , and let and be complex grid functions. With the finite-interval inner products and differences of Uniform periodic, infinite, and Dirichlet grid conventions, In particular, if , the two boundary terms vanish. On the subspace of grid functions with zero endpoints, is self-adjoint and nonnegative in the interior grid inner product, with .
Facts & Assumptions
Given: , , and complex grid values on .
The interior and edge inner products and differences are defined in Uniform periodic, infinite, and Dirichlet grid conventions.
Proof
Put for . Expanding the second difference gives Shift the index in the sum and telescope: Dividing by identifies the edge sum and boundary terms in the displayed identity.
When , step 1.1 reduces to . Applying this identity after exchanging and taking complex conjugates gives , so is self-adjoint on the zero-endpoint subspace. Setting gives .
A finite-grid Poincare inequality for zero endpoint values
Statement
Let , , , and let be a complex grid function with . Then
Facts & Assumptions
Given: A complex grid function on with zero endpoint values.
The weighted interior and edge norms are those of Uniform periodic, infinite, and Dirichlet grid conventions.
Proof
For each , put for . Expanding both expressions shows since each side equals . The right side is nonnegative. Since , , so
Sum the step 1.1 bound over and multiply by . Since and , we obtain . Taking nonnegative square roots proves the claim.
Smooth consistency orders for the five periodic advection stencils
Statement
Fix . Let be a solution of that is periodic in with period , so , and whose derivatives through order six are bounded. Let with , and put . For a stencil , define its local residual by 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 uniformly in , while the Lax--Wendroff residual is . Here a remainder uniformly means for all and sufficiently small , with independent of 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 , and two-sided mesh ratio .
The five periodic stencils use the stated sign convention for and are reflected by for , with (Periodic advection schemes and the finite-interval upwind row).
If derivatives through order are bounded on the segment, the order- Taylor polynomial has a remainder bounded by the derivative bound times the corresponding power divided by (A uniform derivative bound gives a uniform Taylor remainder bound).
For a function on an open subset of , means that every iterated partial derivative of total order at most six exists and is continuous ( maps and multi-index derivative notation in Euclidean space).
For a function, iterated partial derivatives of order are unchanged by permuting the coordinate differentiations (Continuous mixed partials of order are invariant under permutations).
Proof
If , set and . For fixed , its time difference quotient is that of at , so . In its spatial difference quotient, substitute to get . Repeating these coordinate calculations gives , so the period and derivative bounds are preserved. The PDE gives . The definition's reflection identifies each negative-speed stencil residual with the corresponding positive-speed residual of at the reflected point. If , take and . It is therefore enough to derive the estimates for positive speed .
For this positive-speed solution, differentiating in and , then using [F4] to commute the order-two mixed partials, gives . Differentiating this identity in and the PDE twice in , then using [F4] to commute the order-three partials, gives . By [F3] these derivatives exist, and the bounded derivatives in the hypotheses make the Taylor remainders uniform. Taylor's formula from [F2] yields The one-sided expansions are and .
Substituting the step 2.1 expansions into [F1] with speed and using gives For Lax--Friedrichs the symmetric average contributes to the residual, so . For Lax--Wendroff the term cancels the second-difference term by , leaving . Reflection in step 1.1 transfers these residual bounds to the negative-speed branch.
The mesh ratio bounds imply and . Thus the first four residuals are uniformly , and every displayed Lax--Wendroff term is 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.
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 , , and . Define Then is independent of and Consequently it is a positive quadratic form on adjacent zero-boundary states. For mesh families with fixed wave speed , fixed interval length , and , it controls the interior state and its discrete velocity with constants independent of .
Facts & Assumptions
Given: A fixed wave speed , mesh sizes , homogeneous Dirichlet endpoint values, and the source-free centered leapfrog recurrence.
The recurrence is , with (Centered leapfrog wave recurrence with Dirichlet and periodic rows).
For zero endpoint values, ; this is symmetric in (One-dimensional discrete summation by parts with boundary terms).
If on length , then (A finite-grid Poincare inequality for zero endpoint values).
Proof
In the quadratic term, and . Expanding their real edge inner product gives
For any zero-endpoint grid function , and summing over edges gives Apply this to , and use , in step 1.1 to obtain the asserted lower bound. Since , zero energy forces and .
A zero-endpoint grid function with is constant across all edges and therefore zero. Hence step 2.1 shows only when and , equivalently . For uniform state control, [F3] bounds by , and ; when , the lower-bound coefficients and are uniform in the mesh.
Let . Taking the interior inner product of with , the first term is . By [F2], the second is Their sum is . Thus the energy is conserved.
Amplification symbols for periodic scalar advection stencils
Statement
On an -point periodic grid let , , , and with . The Fourier vector is multiplied in one step by Their squared moduli, in the same order, are The Fourier vectors form an orthogonal basis under the periodic inner product of Uniform periodic, infinite, and Dirichlet grid conventions, and each has squared norm .
Facts & Assumptions
Given: , , and the periodic stencils of Periodic advection schemes and the finite-interval upwind row.
The five one-step formulas and periodic wrap are defined in Periodic advection schemes and the finite-interval upwind row.
The finite root-of-unity sum equals if and otherwise (Orthogonality of the characters on ).
The displayed periodic Fourier modes form a basis of the complexified grid space (Periodic heat-stencil eigenvalues and θ amplification factor).
For complex numbers, and ; conjugation is multiplicative and modulus obeys the field laws (Real and imaginary parts, complex conjugation, and modulus, Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
The periodic grid inner product and norm are and (Uniform periodic, infinite, and Dirichlet grid conventions).
Proof
Write . Then , , and . Substitution into each update in [F1] gives, respectively, Since , these are the displayed factors.
The identity gives . Multiplying each factor in step 1.1 by its conjugate and simplifying with this identity gives the five displayed squared-modulus formulas.
By [F2] the distinct Fourier modes are mutually orthogonal; by [F3] they form a basis. By [F5], each has squared norm , 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.
Periodic leapfrog amplification, finite-time bounds, and the Nyquist endpoint
Statement
On a periodic grid of length , let , , and write in the discrete Fourier basis; write for the coefficient of in the same basis. Then For , the nonconstant roots are distinct and have modulus one, and The mean mode is . At and even , the Nyquist mode has the repeated root and solution , where exactly when . Thus arbitrary starting pairs do not have a uniform endpoint power bound.
Facts & Assumptions
Given: , fixed , , and the periodic centered leapfrog scheme.
The periodic branch obeys (Centered leapfrog wave recurrence with Dirichlet and periodic rows).
The one-dimensional specialization of the periodic heat symbol lemma with unit diffusivity gives (Periodic heat-stencil eigenvalues and θ amplification factor).
The displayed periodic Fourier modes form a basis of the complexified grid space (Periodic heat-stencil eigenvalues and θ amplification factor).
The finite root-of-unity sum gives orthogonality of distinct periodic Fourier modes (Orthogonality of the characters on ).
Complex conjugation and modulus have their coordinate, multiplication, and triangle laws (Real and imaginary parts, complex conjugation, and modulus, Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
The periodic grid norm is (Uniform periodic, infinite, and Dirichlet grid conventions).
Proof
Substituting one mode from [F2] into [F1] uses and gives the displayed scalar recurrence, whose characteristic polynomial is
For , , so successive first differences are constant and . For and , put ; then , and and are distinct roots with modulus one.
For a nonconstant mode the recurrence solution matching is Indeed both sequences solve the recurrence and the right side equals at . The quotient is , so its modulus is at most . Also since and .
Since and step 2.2 gives . The same bound holds for the mean mode.
The modes are a basis by [F3] and orthogonal by [F4]. By [F6], each has squared norm , so Parseval's identity holds in . Squaring the coefficient bounds, summing, and using which follows by expanding , yields the stated weighted-grid norm estimate.
If , is even, and , then and . Its solutions are ; the initial values give , so exactly when . For the mode grows linearly in , proving the endpoint caveat.
Scheme-specific periodic power stability for scalar advection
Statement
For the periodic schemes of Periodic advection schemes and the finite-interval upwind row with , upwind powers are contractions in for and grow for . Lax--Friedrichs and Lax--Wendroff powers are contractions for ; when , Lax--Wendroff grows for and Lax--Friedrichs grows for (the Lax--Friedrichs stencil aliases its nonconstant mode). Downwind powers grow for every and . Centered powers grow for every when , while the centered stencil aliases to the identity. Reflection gives the same assertions for with .
Facts & Assumptions
Given: A finite periodic grid with , fixed , , and the exact amplification formulas.
The periodic Fourier vectors form an orthogonal basis (Amplification symbols for periodic scalar advection stencils).
The five amplification factors and squared moduli are those of Amplification symbols for periodic scalar advection stencils.
The five periodic updates and their indexing are defined in Periodic advection schemes and the finite-interval upwind row.
For a bounded linear map, its operator norm is the supremum of over the unit ball (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
For with , one has and hence , ; complex conjugation and modulus obey their field laws (Real and imaginary parts, complex conjugation, and modulus, Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Proof
By [F5], and . Thus for , the upwind formula gives ; for , the Lax--Friedrichs formula gives , and the Lax--Wendroff formula gives .
If , every nonconstant mode has , so . If and , the Lax--Wendroff mode has and . For Lax--Friedrichs with and , some mode has , so . Downwind has for each nonconstant mode whenever . Centered has on any mode with , which exists exactly when .
Write an arbitrary vector as in the orthonormal Fourier basis [F1]. The -step update sends it to , so . 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 . The bounds and growing modes in steps 1.1 and 1.2 now give the claimed contraction and instability statements, including the aliasing cases.
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.
5 · Examples, counterexamples and false statements
None yet.