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.
Certified inverse bounds turn finite-element solve residuals into state and adjoint error bounds
Statement
Let and be invertible finite-element state and adjoint system matrices. Let and be the exact solutions, and let be computed vectors. Suppose certified residual upper bounds and certified operator bounds satisfy
Then the exact state and adjoint errors satisfy
The inverse-norm bounds are separate inputs; a residual bound alone gives no state or adjoint error estimate.
Statement references
Facts & Assumptions
Given: Invertible state and adjoint matrices, exact and computed vectors, certified residual upper bounds, and certified upper bounds for both inverse norms.
The state and adjoint residual upper bounds are the certified norms of the finite-dimensional equations defined by the model contract (Finite-element PDE solver admissibility and certificate contract).
The operator norm satisfies for each bounded linear map (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
Proof
Since , we have . Apply and then [F2] to obtain .
Likewise, . Applying and [F2] gives . Together with step 1.1, this proves both bounds.
Remarks
This finite-dimensional estimate is choice-free. It does not provide or ; the model must certify them separately. For a nonlinear state equation or a continuous-to-discrete comparison, another stability argument is required.
Depends on
Used by
Dependency tree · two levels
24 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
- Fernando Gaspoz, Christian Kreuzer, Andreas Veeser, and Winnifried Wollner, A Posteriori Error Analysis for Optimization with PDE Constraints, §3.1 (standard reference, not scraped)
- Michael Hinze, A Variational Discretization Concept in Control Constrained Optimization: The Linear-Quadratic Case, §§2–3 (standard reference, not scraped)