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.
Reduced gradient and coercive Hessian for linear elliptic tracking control
Statement
Assume the setting of Linear coercive elliptic PDE control problem and reduced objective and Countable Choice. Let be the linear part of the state map, so . Then is Fréchet differentiable on , with
where is the adjoint from Well-posedness of elliptic control state and adjoint equations and is defined by
Its Hessian is the bounded self-adjoint operator , and for every ,
Consequently is Lipschitz with constant , and is -strongly convex.
Facts & Assumptions
Given: The bounded coercive state equation, , , the data, Countable Choice, and the state and adjoint solutions.
The state and adjoint exist uniquely; when is the state variation (Well-posedness of elliptic control state and adjoint equations).
Every bounded linear functional on a Hilbert space has a unique Riesz representative under Countable Choice (Riesz representation for Hilbert spaces, The Axiom of Countable Choice ()).
A bounded linear map between Hilbert spaces has a unique bounded Hilbert adjoint, defined by the inner-product identity (A bounded linear operator between normed spaces, Riesz representation for Hilbert spaces).
Proof
For , let . Subtracting the two state equations gives for all , so depends linearly and boundedly on by the state estimate in [F1]. Thus is a bounded linear map from to . The functional is bounded, so [F2] gives the unique in the displayed definition.
Expanding the two squared norms in yields The adjoint equation with and the state variation equation with test give . The last two terms are bounded by a constant times , so the Fréchet derivative is .
Since the state map is affine with linear part , the same exact expansion at any shows the second derivative is , represented by . Hence and . The constant Hessian gives the stated Lipschitz-gradient bound; the exact quadratic expansion gives strong convexity.
Remarks
This is a local proof of the elliptic adjoint derivative interface. Related parameter-dependent adjoint and gradient-error results are collected on the discrete-continuous-and-pde-adjoint-sensitivities page.
Depends on
Used by
- Finite-budget projected-gradient loop with state-adjoint residual certificates Algorithm
- The optimal elliptic control is the clipped negative adjoint Corollary
- State and adjoint Strang bounds give a reduced-gradient error certificate Lemma
- A certified projected-gradient residual bounds distance to the control-mesh optimum Theorem
- Conditional O(h2) variational control error under H2 regularity and full uniform L2 estimates Theorem
- Existence, uniqueness, and variational inequality for elliptic PDE control Theorem
- Piecewise-constant control with shape-regular finite elements has O(h) error Theorem
Dependency tree · two levels
30 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
- Eduardo Casas and Fredi Tröltzsch, Error estimates for linear-quadratic elliptic control problems (standard reference, not scraped)