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.
A boundary-aware discrete maximum principle for the θ scheme
Statement
On the finite two-dimensional rectangular Dirichlet grid of Fully discrete θ heat finite-difference scheme, suppose , the source is zero, and
Then every numerical interior value at every time level lies between the minimum and maximum of all initial and prescribed boundary values. In particular, with homogeneous boundary rows and , this maximum-principle condition is , a stricter sufficient condition than the unconditional weighted stability for the same homogeneous problem proved in Unconditional weighted L2 stability for θ at least one half.
Facts & Assumptions
Given: A finite two-dimensional rectangular Dirichlet grid, , , , zero source, initial values, and prescribed boundary rows at every time level as in Fully discrete θ heat finite-difference scheme.
Fully discrete θ heat finite-difference scheme defines the exact Dirichlet neighbor rows and the centered θ update. Put , .
Unique solvability of an implicit θ heat step: each implicit interior step has a unique solution for its known right-hand side and prescribed boundary data.
Unconditional weighted L2 stability for θ at least one half: for and homogeneous Dirichlet data, the θ step is weighted-L2 contractive for every positive time step.
Proof
Put and let denote the full grid values, equal to in the interior and on the boundary. At each interior node the zero-source update is . The right side is known; its center coefficient is nonnegative by the stated condition, and its neighbor coefficients are nonnegative because and . Thus it is nonnegative whenever the old interior and boundary values are nonnegative.
Let be the unique interior solution of the implicit system with nonnegative right-hand side and nonnegative future boundary data, whose existence is [F2]. If an interior value attained a negative minimum , then every adjacent interior or boundary value would be at least , so . This is the corresponding component of the nonnegative right-hand side, a contradiction. Hence ; for the same inequality reduces to and gives the contradiction directly.
The zero-source scheme is linear. Let and be respectively the maximum and minimum of the finite collection of initial and prescribed boundary values at all time levels. The constant grid with interior and boundary values solves the zero-source scheme with constant boundary rows , since every centered second difference of a constant is zero. Subtracting the numerical solution gives a solution with initial values and boundary rows . Induction using steps 1.1–1.2 gives . Likewise, subtracting the constant grid with interior and boundary values from gives initial values and boundary rows , so induction gives . Thus at every interior node and time level; the prescribed boundary nodes satisfy the same bounds by definition.
In the homogeneous-boundary case at , the stated sufficient maximum-principle restriction reduces to . By [F3] weighted stability holds for every under the same zero-boundary setup. Thus the maximum-principle condition is a stricter sufficient condition; this comparison makes no claim that the maximum principle fails outside it.
Remarks
For the restriction is automatic; the precise comparison with weighted stability is proved in step 3.1. This theorem is specific to the centered rectangular Dirichlet rows stated above. No choice axiom is used.
Depends on
Used by
Dependency tree · two levels
5 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: A brief introduction to the theory of finite difference approximation of PDEs (standard reference, not scraped)
- Benjamin Seibold, MIT 18.336, Lecture 14: Von Neumann Stability Analysis (Spring 2009) (standard reference, not scraped)
- Martin Krosche, Hermann G. Matthies, and Oliver Kayser-Herold, Lecture Notes: Introduction to PDEs and Numerical Methods, Technical University Braunschweig, Revision 1.1 (2008), hosted by University of Jyväskylä (standard reference, not scraped)