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.
Second-order max-norm error for the centered Dirichlet scheme
Statement
Let have four continuous derivatives, satisfy and , and let satisfy on . For , set , , , and . If has residual for the scheme of Centered finite differences for the zero-Dirichlet boundary-value problem, then
where . The justified exact-arithmetic algorithm returns a solution for every admissible input, and its output has , so its global max-norm error is at most . The zero Dirichlet boundary closure contributes no additional residual.
Facts & Assumptions
Given: The solution , data , fourth-derivative bound , and as in the statement.
Centered finite differences for the zero-Dirichlet boundary-value problem defines , fixes , and on success returns a vector satisfying exactly.
Discrete maximum principle and uniform inverse bound for the Dirichlet stencil proves that the Thomas recurrence defined in Centered finite differences for the zero-Dirichlet boundary-value problem returns the unique solution of for every admissible exact input, so neither linear-solve-failure branch is reached. It also proves that is invertible and for every .
Centered-difference residual bound with exact Dirichlet closure: the exact nodal vector has residual with , and the imposed endpoint residuals are zero.
The triangle inequality: for real , ; the coordinatewise maximum-norm estimate applies this inequality at each coordinate.
Proof
Let . By [F3], and the exact endpoint values agree with the imposed endpoint closure, so the endpoint error is zero.
For , subtracting the definitions of and gives . Since is invertible by [F2], .
By [F2], each coordinate satisfies . The coordinatewise triangle inequality [F4] gives , because for each , .
Substituting the residual bound from [F3] into step 3.1 yields . For the exact algorithm output, [F2] guarantees that the recurrence returns the unique solution and the exact equation check succeeds, so ; exact endpoint closure was recorded in step 1.1.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, author-source revision 2025.01.27, Chapter 10, linear.md (standard reference, not scraped)
- Benjamin Seibold, MIT OpenCourseWare 18.336, Lecture 5: Finite Difference Approximation, Spring 2009 (standard reference, not scraped)
- Benjamin Seibold, MIT OpenCourseWare 18.336, Lecture 6: General Linear Second Order Equation, Spring 2009 (standard reference, not scraped)