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.
Parabolic finite-difference methods — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- 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
- 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
- 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
- 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
- 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 ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The examples isolate the forward-Euler endpoint and instability above its CFL bound, contrast backward-Euler damping with Crank–Nicolson's weak damping of the highest mode, and compare the continuous and discrete maximum bounds on a smooth heat solution. Fourier conclusions are stated on periodic grids; the continuous and discrete boundary bounds use their own hypotheses.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Forward Euler at and above the parabolic CFL threshold
Example
Take the one-dimensional periodic heat equation with on an even -point grid, and let . The alternating initial data keep their magnitude when and grow geometrically when under forward Euler.
Verification
Given: An even integer , periodic spacing , , and the forward-Euler scheme with diffusivity .
[F1] Fully discrete θ heat finite-difference scheme: the periodic update is when and the source is zero.
[F2] Periodic heat-stencil eigenvalues and θ amplification factor: mode has eigenvalue and multiplier .
[F3] Forward Euler heat CFL stability and sharp Nyquist instability: on even periodic grids gives nonexpansion, while makes the Nyquist multiplier less than .
The vector is the mode , so [F2] gives its multiplier .
At , , and hence has unchanged norm; [F3] shows all other Fourier modes are also nonexpansive. If , then , so grows geometrically.
Remarks
The endpoint is stable but not damping for the Nyquist mode. This example is periodic and does not assert a finite-boundary result.
Backward Euler strongly damps high periodic modes
Example
Fix and consider even periodic one-dimensional grids with . Backward Euler multiplies the Nyquist mode by , which tends to zero, while its weighted grid norm never increases.
Verification
Given: , a fixed , and an even periodic grid with spacing .
[F1] Fully discrete θ heat finite-difference scheme: backward Euler is the θ update with and zero source.
[F2] Periodic heat-stencil eigenvalues and θ amplification factor: the Nyquist eigenvalue is , and its multiplier is .
Setting and in [F2] gives .
As with fixed, the denominator tends to infinity, so . Thus this high-frequency mode is strongly damped.
For every mode , the backward-Euler factor is , so the periodic Fourier basis gives nonincrease of the full weighted grid norm.
Crank–Nicolson is stable but does not strongly damp the highest mode
Example
Fix and consider even periodic one-dimensional grids with . Crank–Nicolson is weighted-L2 stable, but its Nyquist multiplier tends to and its magnitude tends to one, so the highest mode is not strongly damped.
Verification
Given: , a fixed , and an even periodic grid with spacing .
[F1] Fully discrete θ heat finite-difference scheme: Crank–Nicolson is the θ update with and zero source.
[F2] Periodic heat-stencil eigenvalues and θ amplification factor: the Nyquist eigenvalue is , and its multiplier is .
Substituting and into [F2] gives .
As with fixed, the numerator and denominator have leading terms and , so and .
For any , , so the factor in [F2] has magnitude at most one. Thus the mode is stable at each mesh while its high-frequency damping vanishes in the limit.
Continuous and discrete heat maximum bounds on sampled data
Example
On , the function
solves the unit-diffusivity heat equation with zero Dirichlet data and initial values in . It remains in continuously. On an equal-spacing grid, forward Euler also remains in provided .
Verification
Given: , , , , with , and the exact sampled initial and zero Dirichlet boundary data for the forward-Euler heat scheme with .
[F1] Fully discrete θ heat finite-difference scheme: the centered Dirichlet update imposes the specified boundary rows at every time level.
[F2] A boundary-aware discrete maximum principle for the θ scheme: for the zero-source Dirichlet θ scheme, if , all grid values lie between the initial and boundary extrema.
Direct differentiation gives and , so . Also on the four sides and .
On , , and for the factor lies in . The explicit formula therefore gives throughout the closed cylinder.
The sampled initial values lie in and the boundary rows are zero. With and , the condition in [F2] is exactly . Therefore [F2] gives at every grid node and time level.
Remarks
The continuous supplier is used only for unit diffusivity on a bounded rectangle with smooth exact data. The discrete conclusion follows from the separately proved finite-grid boundary condition.