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.
Unique solvability of an implicit θ heat step
Statement
For every finite two-dimensional rectangular Dirichlet grid, , , and interior right-hand side (including the known source and boundary contributions), the θ step of Fully discrete θ heat finite-difference scheme has a unique interior solution. Its implicit matrix is , where is the zero-boundary operator.
Facts & Assumptions
Given: A finite rectangular interior grid, , , and the θ update of Fully discrete θ heat finite-difference scheme.
Fully discrete θ heat finite-difference scheme writes the Dirichlet step with unknown terms ; all source and prescribed boundary rows are known right-hand-side terms.
Symmetry and positivity of the rectangular Dirichlet heat operator: for every zero-boundary interior vector .
Proof
If , the implicit matrix in [F1] is the identity, so for every right-hand side there is exactly one solution, namely that right-hand side.
Suppose and . Taking the weighted inner product with gives . By [F2] the second term is nonnegative, so and .
The interior vector space is finite dimensional and the matrix is square. Its zero kernel from step 1.2 means its rank equals the dimension by rank-nullity; hence its range is the whole space. Thus every right-hand side has exactly one solution.
Remarks
This is finite-dimensional solvability only; it makes no condition-number or mesh-uniform iterative-solver claim. No choice axiom is used.
Depends on
Used by
Dependency tree · two levels
4 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)