Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 S:U→H be the linear part of the state map, so Ju(q)=Ju(0)+Sq. Then J^ is Fréchet differentiable on U, with

∇J^(q)=B∗p(q)+αq,

where p(q) is the adjoint from Well-posedness of elliptic control state and adjoint equations and B∗:V→U is defined by

(B∗p,h)U=⟨Bh,p⟩V∗,V.

Its Hessian is the bounded self-adjoint operator S∗S+αI, and for every h∈U,

α∥h∥U2≤((S∗S+αI)h,h)U≤(∥S∥2+α)∥h∥U2.

Consequently ∇J^ is Lipschitz with constant L=∥S∥2+α, and J^ is α-strongly convex.

Facts & Assumptions

Given: The bounded coercive state equation, B:U→V∗, J:V→H, the data, Countable Choice, and the state and adjoint solutions.

[F1]

The state and adjoint exist uniquely; a(w,p)=(Ju(q)−ud,Jw)H when w is the state variation (Well-posedness of elliptic control state and adjoint equations).

[F2]

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 (ACω)).

[F3]

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

1.1F1F2givenalgebra

For h∈U, let wh=u(q+h)−u(q). Subtracting the two state equations gives a(wh,v)=⟨Bh,v⟩ for all v, so wh depends linearly and boundedly on h by the state estimate in [F1]. Thus Sh=Jwh is a bounded linear map from U to H. The functional h↦⟨Bh,p(q)⟩ is bounded, so [F2] gives the unique B∗p(q)∈U in the displayed definition.

2.1F1F2step 1.1givenalgebra

Expanding the two squared norms in J^(q+h) yields J^(q+h)−J^(q)=(Ju(q)−ud,Jwh)H+α(q,h)U+12∥Sh∥H2+α2∥h∥U2. The adjoint equation with v=wh and the state variation equation with test p(q) give (Ju(q)−ud,Jwh)H=a(wh,p(q))=⟨Bh,p(q)⟩=(B∗p(q),h)U. The last two terms are bounded by a constant times ∥h∥U2, so the Fréchet derivative is B∗p(q)+αq.

3.1F3step 2.1givenalgebra∎

Since the state map is affine with linear part S, the same exact expansion at any q shows the second derivative is D2J^[h,k]=(Sh,Sk)H+α(h,k)U, represented by S∗S+αI. Hence ((S∗S+αI)h,h)=∥Sh∥H2+α∥h∥U2≥α∥h∥U2 and ∥S∗S+αI∥≤∥S∥2+α. 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

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