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.
Backward Euler stability, first-order error for exact initial data, and reconstruction bounds
Statement
Let be a finite-dimensional conforming subspace of a real evolution triple. Let be real bilinear and measurable in for each fixed pair. Assume there is one null set outside which, with common constants and , Let . Let be the semidiscrete solution from Finite-dimensional parabolic Galerkin ODEs with measurable coefficients. On a finite partition , put and . For the interval-averaged backward Euler values from Backward Euler FEM with interval-averaged forms and load, define and let be the affine reconstruction, with on . Every step has a unique solution. With the separate maximum and cumulative bounds are The reconstruction satisfies where . For the nodal error, define Then the error obeys the separate bounds Thus exact initial projection gives first-order maximum nodal error. The reconstruction estimates provide bounds for later compactness arguments; they do not themselves assert compactness.
Facts & Assumptions
Given: A finite-dimensional conforming subspace , the measurable bounded/coercive form, , the semidiscrete trajectory , a finite time partition, and .
Instantiate backward Euler with the algorithm's form and load . It uses the corresponding interval-average forms and load, and its step equation is the displayed variational equation (Backward Euler FEM with interval-averaged forms and load).
The exact finite-dimensional semidiscrete trajectory exists in and satisfies the variational equation (Finite-dimensional parabolic Galerkin ODEs with measurable coefficients).
The form is bounded by and coercive by (Bounded, coercive and symmetric sesquilinear forms).
Proof
Fix a finite basis of and write the th variational step as a square linear system for the coefficients of . If its homogeneous system has solution , testing by gives . Coercivity [F4] implies . Thus the square matrix has zero kernel and is invertible, proving a unique solution at each step without a choice axiom.
With the instantiation in [F1], for all ; changing the form on its common null set does not change this average. Integrate the semidiscrete equation [F2] over and subtract it from the backward Euler step. With , this gives where The fundamental theorem of calculus in finite-dimensional yields . Cauchy–Schwarz gives .
Test the step equation with , multiply by , use [F3], and bound by . Summing and applying Jensen's inequality gives, for every , Taking the maximum of the endpoint term over proves the maximum bound; setting proves the cumulative bound.
On , and the step equation gives in , where is the averaged form operator. Its norm is at most , proving the derivative bound by squaring and integrating. Also with ; integrating gives . Since has norm at most , this proves the reconstruction difference bound.
Test the error equation from step 1.2 with , multiply by , use [F3], and absorb by . Summing to any and using the residual estimate in step 1.2 gives, for every , Taking the maximum of the endpoint term and setting for the cumulative term prove the two asserted bounds.
Depends on
Used by
Nothing in the library uses this result yet.
Cited to discharge well-definedness by Backward Euler FEM with interval-averaged forms and load.
Dependency tree · two levels
13 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
- Christian Clason, Introduction to Finite Element Methods, lecture notes (standard reference, not scraped)
- Long Chen, Finite Element Methods for Parabolic Equations (standard reference, not scraped)