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.
Conforming elliptic finite-element reduced gradients have an energy-norm error budget
Statement
Assume Countable Choice and the elliptic state/adjoint setting of The elliptic adjoint gives the reduced parameter gradient. Let be a finite-dimensional conforming space. Let and be operator-norm in , uniformly coercive on , and define the discrete state by . Let be , and let solve . Suppose the parameter derivatives of the discrete forms and loads have specified bounded extensions to that agree with their values on . Let be the exact state and adjoint, and let be their discrete counterparts, with certified energy bounds For an exact conforming Galerkin solve these bounds may be supplied by Céa quasi-optimality for coercive conforming Galerkin problems; for a conforming perturbed solve they may be supplied by First Strang estimate for conforming perturbed Galerkin problems, with all load, form, geometry and quadrature defects retained as in Variational-crime settings and consistency defects. Define exact and discrete reduced gradients by Assume for that , , the direct-objective defect satisfies , and the derivative-data defects obey Put and . Then The derivative-data defects are separate obligations: ordinary state and adjoint Strang bounds do not by themselves bound derivative defects.
Facts & Assumptions
Given: The exact elliptic reduced-gradient formula, the conforming discrete state and adjoint equations, their energy error bounds , and the derivative-data bounds in the Statement.
The reduced gradient is (The elliptic adjoint gives the reduced parameter gradient).
Céa's estimate bounds a conforming Galerkin error by times its best energy approximation (Céa quasi-optimality for coercive conforming Galerkin problems).
For conforming perturbed forms, the first Strang estimate includes best approximation and form/load defects; the variational-crime framework identifies geometry, data and quadrature contributions to those defects (First Strang estimate for conforming perturbed Galerkin problems, Variational-crime settings and consistency defects).
The derivative of a C1 composition is given by the chain rule (The chain rule for total derivatives: ).
Both state and adjoint equations satisfy the hypotheses of either [F2] or [F3], with their own right-hand sides, defects, and coercivity constants. Countable Choice (The Axiom of Countable Choice ()) is used through those suppliers.
Proof
Apply [F2] to an exact conforming Galerkin state and its adjoint, or [F3] to each conforming perturbed equation, using the transposed form for the adjoint. Transposition preserves boundedness and coercivity constants. Under [A1], the resulting two bounds are , with all applicable form and load defects, including geometry and quadrature contributions, retained as specified by [F3].
Choose a basis of . Coercivity makes the discrete state matrix invertible, and its entries and the load coordinates are . Uniform coercivity makes locally bounded. The identity first gives continuity of the inverse. Using in that identity gives ; this derivative is continuous, so and hence are . Differentiating the state equation gives . By [F4], ; use the discrete adjoint equation with , then the differentiated state equation with , to obtain the formula for in the Statement. The continuous formula is supplied by [F1].
Fix with . Subtract the continuous and discrete formulas. The direct-objective term is bounded by . Add and subtract ; then .
Add and subtract . The derivative-form data defect contributes at most . The remaining perturbation equals up to an overall sign, so Thus for every unit , is bounded by the displayed constant.
Taking the supremum over all gives the asserted dual norm bound. The separate terms show why state error alone does not certify a reduced-gradient error.
Depends on
- The elliptic adjoint gives the reduced parameter gradient
- Variational-crime settings and consistency defects
- Céa quasi-optimality for coercive conforming Galerkin problems
- First Strang estimate for conforming perturbed Galerkin problems
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
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
- Hannes Meinlschmidt, Optimization with Partial Differential Equations, complete lecture notes, §§1.6 and 3.2 (standard reference, not scraped)
- Michael B. Giles and Niles A. Pierce, An Introduction to the Adjoint Approach to Design, §§2.4–3 (standard reference, not scraped)
- Christian Clason, Introduction to Finite Element Methods, complete lecture notes, §§1.2 and 6.1 (standard reference, not scraped)