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 — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Approximation and Compactness in C(K)
- 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
- Complexification, Realification and Real Structures
- 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
- Hyperbolic finite-difference methods
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear scheme stability and Lax equivalence
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- 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
- Normed and Banach Spaces
- 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
- Strongly Continuous Semigroups and Hille Yosida
- Suprema and Infima
- The Baire Principles of Functional Analysis
- 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
These examples compute the upwind and downwind multipliers on a four-point periodic grid, then use the mode across a fixed-period centered-advection refinement to show unbounded finite-time powers at despite consistency on each fixed smooth solution. They also isolate the leapfrog Nyquist double root at the CFL endpoint. Beyond the wave CFL threshold, the same modified quadratic form takes both positive and negative values. The final example explains why grid-norm Fourier stability on varying finite-dimensional spaces is not itself a common-space Lax-equivalence premise.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The Nyquist mode at and beyond the leapfrog CFL endpoint
Example
Let be even and consider the periodic centered leapfrog wave scheme. At , its Nyquist mode has a repeated root and admits linear-in-time growth unless the starting coefficient satisfies . The usual modified quadratic energy is semidefinite there and is indefinite for .
Facts & Assumptions
Given: An even periodic grid of real-valued states, , and a Nyquist mode .
The periodic wave recurrence is defined in Centered leapfrog wave recurrence with Dirichlet and periodic rows.
At and even , the periodic wave theorem gives the Nyquist root and compatibility condition (Periodic leapfrog amplification, finite-time bounds, and the Nyquist endpoint).
The one-dimensional heat symbol with unit diffusivity gives (Periodic heat-stencil eigenvalues and θ amplification factor).
The finite root-of-unity sum gives orthogonality of distinct Fourier modes (Orthogonality of the characters on ).
The periodic grid norm is (Uniform periodic, infinite, and Dirichlet grid conventions).
The periodic forward-difference inner product is (Uniform periodic, infinite, and Dirichlet grid conventions).
Verification
For the Nyquist mode, , so the recurrence polynomial is . At this is , with solution ; the coefficient vanishes exactly when .
If , then . The roots of are real and negative because the discriminant is , their product is , and their sum is . Hence one root has modulus greater than one.
Define the periodic modified energy of adjacent states , by For one normalized Fourier mode with coefficients , put and . Reindexing the finite periodic sum gives . Thus [F3] gives , while [F4] gives orthogonality; the nonzero orthogonal vectors form a basis of the -dimensional space . By [F5] they are normalized by . Since and , . Summing these diagonal contributions using [F6] gives the modal energy At , , so every modal term is nonnegative, while the Nyquist velocity coefficient is zero. Orthogonal Fourier decomposition makes semidefinite.
Set the real amplitude and take and . Then , , and , so It is zero at and negative at .
The state has . Together with step 1.4, this shows that the form is indefinite for .
Upwind damping versus downwind growth on a periodic grid
Example
On a four-point periodic grid take and the Fourier mode . Its upwind multiplier has modulus , while its downwind multiplier has modulus .
Facts & Assumptions
Given: , , and .
The upwind and downwind factors are and (Amplification symbols for periodic scalar advection stencils).
A Fourier multiplier of modulus less than one decays under powers, while a multiplier of modulus greater than one grows under powers (Scheme-specific periodic power stability for scalar advection).
Verification
Since , the upwind factor is , whose squared modulus is .
The downwind factor is , whose squared modulus is .
Taking powers multiplies this mode by the corresponding factor to the same power. Thus the upwind component decays and the downwind component grows geometrically.
Centered advection is consistent and unstable under the CFL bound
Example
Fix . For , use periodic grids , , and , so . Every fixed smooth -periodic solution in the hypotheses of Smooth consistency orders for the five periodic advection stencils has centered residual . Nevertheless the mode has and multiplier , and the centered family has no uniform finite-time power bound, as proved in The nearest-neighbor CFL condition is necessary but not sufficient.
Facts & Assumptions
Given: Fixed and periodic grids , , , with Fourier index .
The centered residual is under the two-sided mesh-ratio and hypotheses of Smooth consistency orders for the five periodic advection stencils.
The centered amplification factor is (Amplification symbols for periodic scalar advection stencils).
For this centered periodic family with , the finite-time power norms are unbounded as (The nearest-neighbor CFL condition is necessary but not sufficient).
Verification
Since , , and the centered factor is . Its squared modulus is , while is constant and .
By [F1], each fixed smooth solution satisfying the theorem's regularity and periodicity hypotheses has residual . By [F3], for every fixed the centered update powers are not uniformly bounded over time levels . Thus this family is consistent on fixed smooth data but fails finite-time power stability because of mesh-dependent high-frequency modes.
Grid Fourier stability alone does not instantiate Lax equivalence
Example
For periodic upwind updates at fixed , every individual grid family is power stable in its grid norm. The family on the varying spaces is not, as stated, an instance of the common-space Lax theorem.
Facts & Assumptions
Given: The periodic upwind updates on for varying , with fixed .
A common-space time-scheme family consists of bounded maps on one Banach space (Common Banach-space interface for a linear IVP and its time schemes).
Consistency, stability, and convergence in that interface use the same norm of (Common Banach-space interface for a linear IVP and its time schemes).
Under Dependent Choice, a consistent scheme in that common-space interface is convergent on finite time intervals if and only if it is stable there (Lax equivalence for a common Banach-space scheme).
For each N-point periodic grid, the upwind update is power stable when (Scheme-specific periodic power stability for scalar advection).
Dependent Choice is the axiom assumed by [F3] (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Verification
By [F4], each N-point upwind update has for all when .
The declared operators have domains and codomains , which vary with N; no fixed Banach space or projection/reconstruction lift is supplied in this example. Thus they do not meet [F1]'s fixed-space interface, and no same-space norm for comparing their errors is supplied under [F2].
The theorem [F3] has the common-space interface and consistency among its hypotheses. Since step 1.2 shows that this example supplies no such interface, the grid power bounds alone do not imply convergence by [F3]. A separate common-space lift and its norm/consistency checks would be needed; this example makes no claim that such a lift cannot be constructed.