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.
Discrete summation by parts, Poincaré inequality and inverse bound
Statement
On the grid of Rectangular grid and Dirichlet flux stencil, put and . For any grid functions ,
In particular, if vanishes on the boundary, then . For every ,
If all horizontal and vertical face values satisfy , then the homogeneous Dirichlet matrix is invertible and
where is the norm on interior vectors. The constants are independent of .
Facts & Assumptions
Given: , integers , the grid, its real grid functions, the inner product, the flux operator , and edge energy defined in Rectangular grid and Dirichlet flux stencil.
Rectangular grid and Dirichlet flux stencil: is the negative horizontal and vertical flux divergence; is the weighted sum of the horizontal and vertical edge-gradient products; consists of grid functions vanishing on every boundary node.
Proof
Fix an interior row and write . Telescoping the horizontal contribution gives . Summing this identity over gives the horizontal energy and its two boundary terms.
Let . For each interior row, . Cauchy–Schwarz gives . Summing with weights and using proves the displayed discrete Poincaré inequality.
Applying the same telescoping sum in each column to the vertical flux gives the vertical energy minus the top and bottom boundary terms. Adding it to step 1.1 proves the displayed two-dimensional identity, with all four boundary contributions present.
If vanishes at every boundary node, both boundary sums in step 2.1 are zero, so .
Apply step 3.1 with . The face lower bound gives by step 1.2.
If for , step 4.1 forces , hence every interior value is zero; the boundary values already vanish, so . Thus the square finite-dimensional matrix is injective and therefore invertible.
For , steps 3.1 and 4.1 imply . If the claimed estimate is immediate; otherwise divide by to obtain , which is the asserted inverse-operator bound.
Remarks
No choice axiom is used: the proof uses finite sums, Cauchy–Schwarz, and finite-dimensional injectivity implying surjectivity.
Depends on
Used by
Dependency tree · one level
1 result within one dependency step 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, Numerical Solution of PDEs, complete lecture notes (standard reference, not scraped)
- Benjamin Seibold, MIT 18.336 Lecture 6: General Linear Second Order Equation (standard reference, not scraped)