Alphabeta Math
Pipeline-generated
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.

✓ 18 results · all verified · 11 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Finite element pde constrained optimization

1 · Prerequisites

2 · Summary

For a bounded coercive linear elliptic state equation with distributed L2 controls, this page defines a closed pointwise box and a quadratic tracking objective with regularization α∥q∥L22/2, α>0. The state space uses the full H1 norm, and its Hilbert property under Countable Choice is proved locally. The page proves state and adjoint well-posedness, differentiates the reduced objective, and gives existence, uniqueness, the variational inequality, and the pointwise clipping formula. The Hilbert-space existence argument states its Countable Choice and separability inputs explicitly.

The finite-element section distinguishes cellwise-constant control discretization from variational control discretization. The O(h) result assumes H1 control regularity, a uniform H1 bound for the projected adjoint, an adjoint-consistent finite-element reduced objective, and a complete first-Strang gradient-residual ledger. The conditional O(h2) result requires adjoint consistency for its discrete objective, actual primal and adjoint H2 regularity, matching dual approximation, uniform state/adjoint L2 errors, and every form, load, geometry, and quadrature defect at the stated order. It makes no rate claim on arbitrary Lipschitz or reentrant domains.

The finite-loop projected-gradient method optimizes the exact continuous PDE objective over a cellwise-constant control box while using finite-return state/adjoint and projection routines with explicit Strang bounds and exact projected cell values and residual; failure of either routine returns an inconclusive status. Its certified status bounds the exact projected-gradient residual; a separate theorem converts that residual to distance from the restricted optimum. The exhaustive active-set algorithm is an exact-arithmetic finite-dimensional reference. The SQP branch returns the QR-computed step and reports only a certified active linear-system residual unless feasibility, complementarity, conditioning, and the required local hypotheses are separately verified. The parabolic extension assumes a real evolution triple with separable energy space V. It is a separate energy-space result and does not inherit an elliptic finite-element rate.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Closed pointwise box of L2 controls

Definition

Let E⊂Rd be a bounded Lebesgue-measurable set. Let U=L2(E;R) with inner product

(q,r)U=∫Eq(x)r(x) dx

and the corresponding norm. This is a real Hilbert space by L2 with the integral pairing is a Hilbert space under Countable Choice The Axiom of Countable Choice (ACω).

For bounds qa,qb∈U with qa≤qb almost everywhere, define the admissible box

Qad(qa,qb)={q∈U:qa(x)≤q(x)≤qb(x) for almost every x∈E}.

Equalities and inequalities between controls are understood as almost-everywhere statements about their L2 classes. The box is nonempty because it contains qa. When a finite-element control space is used, its cellwise-constant admissible set is the intersection of this box with the stated piecewise-constant subspace; cellwise averaging preserves the box when both bounds are constant on each control cell.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A bounded sequence in a separable Hilbert space has a weakly convergent subsequence

Statement

Assume Countable Choice. Let H be a separable real Hilbert space and let (xn)n≥1 be a sequence with ∥xn∥H≤C for some finite C. Then there are a strictly increasing sequence of indices (nk) and x∈H such that xnk⇀x weakly in H.

Facts & Assumptions

Given: Countable Choice, a separable real Hilbert space H, and a sequence (xn) with ∥xn∥H≤C.

[F1]

Every nested sequence of nonempty closed bounded real intervals whose lengths tend to zero has a unique common point (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 0).

[F2]

Every bounded linear functional on a Hilbert space is represented by a unique vector under Countable Choice (Riesz representation for Hilbert spaces, The Axiom of Countable Choice (ACω)).

[F3]

Cauchy–Schwarz gives ∣⟨xn,v⟩H∣≤∥xn∥H∥v∥H (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F4]

A separable space has an at most countable dense subset, and “countable” means finite or countably infinite; such a nonempty subset can be listed as a sequence, repeating a finite list when necessary (Separability: the existence of an at most countable dense subset, Finite, countably infinite, countable, uncountable).

Proof

1.1F4givenchoose

By separability choose a dense subset D⊆H that is at most countable. It is nonempty because H contains 0. If D is finite, a finite listing from its bijection with a natural number, repeated periodically, gives a sequence; if D is countably infinite, a bijection with N gives a sequence. Thus [F4] supplies a dense sequence (vj)j≥1 without any choice principle beyond the witnesses in the definition of countability.

1.2F1givenconstruct

For any bounded real sequence (ak) in [−R,R], start with I0=[−R,R]. At each stage split the current interval into its two closed halves and choose the left half if it contains infinitely many terms of the current sequence, and otherwise choose the right half. At least one half contains infinitely many terms. Choose the least index later than the preceding selected index whose term lies in the chosen half. The resulting nested intervals have lengths tending to zero, so [F1] gives a common point, and the selected subsequence converges to it. Every choice in this construction is the least natural index or the leftmost of two alternatives, so the extraction is determined by its input sequence.

2.1F3step 1.1step 1.2givenconstruct

For each j, the scalar sequence ⟨xn,vj⟩H is bounded by C∥vj∥H by [F3]. Apply the deterministic extraction in step 1.2 successively to these coordinate sequences, each time inside the previously obtained subsequence. This recursive rule produces nested infinite subsequences N1⊇N2⊇⋯ on which the first, first two, and then first j pairings converge, respectively. Let nk be the kth index of Nk. Nestedness makes (nk) strictly increasing, and for each fixed j the sequence ⟨xnk,vj⟩H converges because its tail is a subsequence of Nj.

3.1F2F3step 1.1step 2.1givenalgebra∎

For any v∈H, choose vj arbitrarily close to v. For indices k,ℓ, [F3] gives ∣⟨xnk−xnℓ,v⟩H∣≤∣⟨xnk−xnℓ,vj⟩H∣+2C∥v−vj∥H. The first term tends to zero as k,ℓ→∞ for fixed j, and the second can be made arbitrarily small by density. Thus ⟨xnk,v⟩H converges for every v. Its limit L(v) is linear and satisfies ∣L(v)∣≤C∥v∥H, so L is a bounded linear functional. By [F2] there is a unique x∈H with L(v)=⟨x,v⟩H for all v. Therefore xnk⇀x.

Remarks

The subsequence extraction itself uses a deterministic interval bisection and no choice function. Countable Choice is stated because the Riesz representation supplier requires it.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite exhaustive active-set solve for a box-constrained positive quadratic

Definition

Let H∈Rn×n be symmetric positive definite, c∈Rn, and ℓ,u∈Rn with ℓi≤ui. For ϕ(x)=12xTHx+cTx, enumerate the finite set of status vectors σ∈{L,F,U}n in lexicographic order. For each status, set xi=ℓi if σi=L, set xi=ui if σi=U, and for the free indices F solve

HFFxF=−cF−HFAxA,

where A=L∪U. Skip a singular solve. Retain a candidate only if ℓi<xi<ui for i∈F, and the gradient g=Hx+c satisfies gi≥0 on L, gi=0 on F, and gi≤0 on U. Return the first retained candidate; if none is retained, return no-candidate. Computations in this definition are exact real arithmetic. If ℓi=ui, that coordinate may be assigned status L or U.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A pointwise L2 box is nonempty, bounded, closed, and convex

Statement

Let E be as in Closed pointwise box of L2 controls, and let qa,qb∈L2(E;R) satisfy qa≤qb almost everywhere. Then Qad(qa,qb) is nonempty, convex, norm closed, and bounded in L2(E).

Facts & Assumptions

Given: The finite-measure control domain E, bounds qa,qb∈L2(E) with qa≤qb almost everywhere, and the definition of Qad.

[A1]

Qad={q∈L2(E):qa≤q≤qb a.e.} (Closed pointwise box of L2 controls).

Proof

1.1A1givenalgebra

The control qa belongs to Qad because qa≤qa≤qb almost everywhere, so Qad is nonempty. If q,r∈Qad and 0≤t≤1, then qa≤tq+(1−t)r≤qb almost everywhere; hence the convex combination is in Qad. The pointwise inequality also gives ∣q∣≤∣qa∣+∣qb∣ almost everywhere for each q∈Qad, so ∥q∥L2≤∥qa∥L2+∥qb∥L2 and the box is bounded.

2.1A1givenalgebra∎

Suppose qn∈Qad and qn→q in L2(E). For almost every x, qn(x)≥qa(x), so (qa−q)+≤∣qn−q∣ almost everywhere, where s+=max⁡{s,0}. Therefore ∥(qa−q)+∥2≤∥qn−q∥2→0 and q≥qa almost everywhere. Similarly (q−qb)+≤∣q−qn∣ gives q≤qb almost everywhere. Thus q∈Qad and the box is norm closed.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

L2 controls on a bounded spatial region form a separable Hilbert space

Statement

Assume Countable Choice. Let E⊂Rd be bounded and Lebesgue measurable. Then U=L2(E;R) with its integral inner product is a separable real Hilbert space.

Facts & Assumptions

Given: Countable Choice; the bounded measurable domain E and the real L2(E) convention.

[F1]

Rational box-step functions form a countable dense subset of L2(Rd) under Countable Choice (Rational box-step functions form a countable dense subset of Lp(Rn) for 1≤p<∞).

[F2]

Extending a function on E by zero preserves its L2 norm; restriction from Rd to E cannot increase the L2 norm.

[F3]

L2(E;R) with its integral pairing is a real Hilbert space under Countable Choice (L2 with the integral pairing is a Hilbert space, The Axiom of Countable Choice (ACω)).

Proof

1.1givenconstruct

Define Z:L2(E)→L2(Rd) by zero extension and R:L2(Rd)→L2(E) by restriction. The maps are well-defined on almost-everywhere classes, RZ is the identity on L2(E), and ∥Rf∥L2(E)≤∥f∥L2(Rd).

2.1F1step 1.1given

Let S be the countable dense rational box-step family from [F1]. The set R(S) is countable. For q∈L2(E), choose any ε>0 and extend it by Zq. By density there is s∈S with ∥Zq−s∥L2(Rd)<ε; then ∥q−Rs∥L2(E)=∥R(Zq−s)∥2≤∥Zq−s∥2<ε. Thus R(S) is dense in L2(E), proving separability.

3.1F1F3step 2.1∎

The integral pairing makes L2(E) a real Hilbert space by [F3], so it is both separable and Hilbert. Countable Choice is the only stated choice principle in [F1] and [F3].

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Linear coercive elliptic PDE control problem and reduced objective

Definition

Let Ω⊂Rd be a bounded Lipschitz domain, V=H01(Ω;R), and H=L2(Ω;R). Use the real integral pairing on H. Equip V with the standard full Sobolev inner product and norm (v,w)V=(v,w)H+∑i=1d(Div,Diw)H,∥v∥V2=∥v∥H2+∑i=1d∥Div∥H2. Here H01=W01,2 is the closure of Cc∞(Ω;R) in the W1,2 norm of Zero-boundary Sobolev space as a norm closure. Under Countable Choice, H and V are real Hilbert spaces; the local proof of completeness of V is included in Well-posedness of elliptic control state and adjoint equations ↗. The inclusion J:V→H is continuous with ∥J∥≤1.

Let E⊆Ω be bounded and measurable, U=L2(E;R) with its real integral inner product, and let Qad⊂U be the pointwise box of Closed pointwise box of L2 controls. Under Countable Choice, U is a real Hilbert space by L2 with the integral pairing is a Hilbert space. Let a:V×V→R be bilinear, bounded with constant M, and coercive with constant β>0 in the stated V norm; symmetry is not assumed. Let B:U→V∗ be bounded and linear, and fix f∈V∗, ud∈H, and α>0.

For every q∈U, the state u(q)∈V is required to satisfy

a(u(q),v)=⟨f+Bq,v⟩V∗,V(v∈V).

The reduced objective, defined on all of U and minimized over Qad, is

J^(q)=12∥Ju(q)−ud∥H2+α2∥q∥U2.

A spatially varying coefficient, boundary control, variational crimes, finite-element control discretization, and parabolic evolution are separate hypotheses or branches; none is implicit in this definition. The state well-definedness is supplied by Well-posedness of elliptic control state and adjoint equations ↗.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The L2 projection onto a pointwise box is clipping

Statement

Let Qad=Qad(qa,qb)⊂L2(E;R) be as in Closed pointwise box of L2 controls, and let r∈L2(E). Define

PQadr(x)=min⁡{qb(x),max⁡{qa(x),r(x)}}a.e.

Then PQadr is the unique minimizer of ∥q−r∥L2(E) over q∈Qad. Equivalently, q=PQadr if and only if

(q−r,v−q)L2(E)≥0(v∈Qad).

Facts & Assumptions

Given: The finite-measure control domain, the bounds qa,qb∈L2(E) with qa≤qb almost everywhere, and r∈L2(E).

[F1]

The admissible set consists of the L2 functions satisfying qa≤q≤qb almost everywhere (Closed pointwise box of L2 controls).

Proof

1.1F1givenalgebra

Put q(x)=min⁡{qb(x),max⁡{qa(x),r(x)}}. This function is measurable and lies between qa and qb; therefore q∈Qad and q∈L2(E). For real numbers a≤b, the clipped value c=min⁡{b,max⁡{a,s}} satisfies (c−s)(t−c)≥0 for every t∈[a,b]: if s<a, then c=a and both factors are nonnegative; if a≤s≤b, then c=s and the product is zero; if s>b, then c=b and both factors are nonpositive. Applying this pointwise with s=r(x) and t=v(x) and integrating gives (q−r,v−q)L2≥0 for every v∈Qad.

2.1F1step 1.1givenalgebra∎

For any v∈Qad, ∥v−r∥22−∥q−r∥22=∥v−q∥22+2(q−r,v−q)2≥∥v−q∥22. Thus q minimizes the distance and equality can hold only when v=q in L2. Conversely, if q is a distance minimizer, then for any v∈Qad and 0<t≤1, q+t(v−q)∈Qad. Expanding ∥q+t(v−q)−r∥22≥∥q−r∥22, dividing by 2t, and letting t↓0 gives (q−r,v−q)2≥0.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The exhaustive box quadratic solve returns the unique minimizer in finite time

Statement

For a nonempty box [ℓ,u]⊂Rn and positive-definite H, the exact algorithm of Finite exhaustive active-set solve for a box-constrained positive quadratic returns the unique minimizer of ϕ(x)=12xTHx+cTx after at most 3n status checks.

Facts & Assumptions

Given: A finite-dimensional nonempty box, a symmetric positive-definite Hessian, and exact arithmetic for the stated algorithm.

[F1]

The algorithm enumerates all status vectors and retains precisely candidates with coordinates fixed at their assigned lower or upper bounds, free coordinates strictly between their bounds, and the lower/free/upper gradient signs stated in its definition (Finite exhaustive active-set solve for a box-constrained positive quadratic).

[F2]

The Euclidean extreme-value theorem gives a minimizer of a continuous function on a compact box (Semicontinuous extreme value theorem on compact Euclidean sets).

[A1]

The box is nonempty and all arithmetic and comparisons in the algorithm are exact.

Proof

1.1A1F2givenalgebra

The box is compact and ϕ is continuous, so [F2] supplies a minimizer x∗. If ℓi<ui and x∗,i=ℓi, the feasible right derivative is gi≥0; if x∗,i=ui, the feasible left derivative gives gi≤0; and if ℓi<x∗,i<ui, both signs of perturbation are feasible, so gi=0. For a fixed coordinate with ℓi=ui, assign lower status if gi≥0 and upper status if gi≤0 (either if gi=0).

2.1F1step 1.1givenalgebra

Assign each nonfixed coordinate of x∗ its lower, upper, or free status according as it is at the lower bound, at the upper bound, or strictly between them; assign fixed coordinates as in step 1.1. Every nonempty principal block HFF is positive definite: for 0≠y∈RF, extend y by zeros to x∈Rn to get yTHFFy=xTHx>0. Hence HFF is nonsingular; if F=∅, its system is vacuous. The free subsystem has the unique solution x∗,F by its zero free gradient. Thus the algorithm recovers x∗, whose free coordinates are strictly interior by their assignment and whose gradient signs hold by step 1.1. It is retained by [F1], so the algorithm terminates within 3n checks.

3.1F1step 2.1givenalgebra∎

Let x be a retained candidate and g=Hx+c. For any feasible y, the checked coordinate signs give gi(yi−xi)≥0 on lower-active coordinates, the same inequality on upper-active coordinates, and zero on free coordinates; hence gT(y−x)≥0. The exact expansion ϕ(y)−ϕ(x)=gT(y−x)+12(y−x)TH(y−x) is nonnegative, and is strictly positive when y≠x because H is positive definite. Thus every retained candidate is the unique minimizer, so the first one returned by the algorithm is.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The L2 projection onto a cellwise constant box clips cell averages

Statement

Assume Countable Choice. Let E be a bounded polyhedral open control domain and let Th be a finite matching affine simplicial mesh of E as in Matching affine simplicial meshes and shape regularity. Let Uh⊂L2(E) be the subspace of functions constant on each cell. Let the bounds qa,qb in Closed pointwise box of L2 controls be constant on each cell and satisfy qa≤qb. Put Qh=Uh∩Qad(qa,qb). For r∈L2(E) define

(PQhr)∣K=clip⁡[qa∣K,qb∣K](1∣K∣∫Kr(x) dx),K∈Th,

where clip⁡[a,b](s)=min⁡{b,max⁡{a,s}}. Then PQhr is the unique L2(E)-nearest point in Qh to r, and PQh is nonexpansive: ∥PQhr−PQhs∥L2(E)≤∥r−s∥L2(E).

Facts & Assumptions

Given: Countable Choice; the finite matching partition into nondegenerate simplices; r∈L2(E); and cellwise constant ordered bounds.

[F1]

The continuous box consists of the L2 functions between its bounds almost everywhere (Closed pointwise box of L2 controls); intersecting it with Uh gives independent closed intervals for the cell values.

[F2]

The mesh is a finite collection of nondegenerate cells with disjoint interiors covering E up to measure-zero facets (Matching affine simplicial meshes and shape regularity).

[F3]

Every facet lies in an affine hyperplane, and every affine hyperplane is Lebesgue null; hence the finite union of mesh facets is null (Every affine hyperplane of Rn, and hence every proper linear subspace, is Lebesgue null).

[F4]

Hölder with exponents 2,2 shows that each L2(K) function is integrable on a finite-measure cell, so the cell averages are finite (Holder's inequality for integrals, including the endpoint cases).

Proof

1.1F2F4givenalgebra

For a cell K, [F4] makes rˉK=∣K∣−1∫Kr finite. For any constant value zK, ∫K∣zK−r∣2=∣K∣∣zK−rˉK∣2+∫K∣r−rˉK∣2, because the cross term vanishes by ∫K(r−rˉK)=0. The second term is independent of zK.

2.1F1step 1.1algebra

Among real zK∈[qa∣K,qb∣K], the square ∣zK−rˉK∣2 is uniquely minimized by the clipped value: if rˉK is below the interval the nearest endpoint is the lower bound; if it is inside, it is itself; if it is above, the nearest endpoint is the upper bound. Thus the displayed cell value uniquely minimizes the cell integral, and it lies in the required interval by [F1].

3.1F1F2F3step 2.1algebra

The cell choices are independent, so summing the cellwise minima from step 2.1 over the partition up to its null facets [F3] proves that PQhr is the unique global minimizer. For v∈Qh, convexity makes p+t(v−p) feasible, where p=PQhr and 0<t≤1. Minimality gives ∥p+t(v−p)−r∥22−∥p−r∥22=2t(p−r,v−p)2+t2∥v−p∥22≥0. Divide by 2t and let t↓0 to obtain the projection variational inequality (p−r,v−p)2≥0.

4.1F4step 3.1algebra∎

Let p=PQhr and q=PQhs. Apply the variational inequality from step 3.1 with v=q and v=p, respectively. Adding gives ∥p−q∥22≤(r−s,p−q)2. Hölder with exponents 2,2 then yields ∥p−q∥2≤∥r−s∥2 when p≠q; if p=q the inequality is immediate.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A pointwise L2 box is weakly sequentially closed

Statement

Let E and Qad(qa,qb) be as in Closed pointwise box of L2 controls. If qn∈Qad and qn⇀q weakly in L2(E), then q∈Qad.

Facts & Assumptions

Given: A bounded measurable E, qa,qb∈L2(E) with qa≤qb almost everywhere, a sequence qn∈Qad, and weak convergence qn⇀q.

[F1]

Qad={r∈L2(E):qa≤r≤qb a.e.} (Closed pointwise box of L2 controls).

[F2]

On finite-measure E, Hölder with exponents 2,2 makes products of L2(E) functions integrable (Holder's inequality for integrals, including the endpoint cases).

[F3]

A nonnegative measurable function has integral zero exactly when it vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

Proof

1.1F1F2F3givenalgebra

Let A={x∈E:q(x)<qa(x)}. Since E is bounded, choose M≥1 with E⊂(−M,M)d. The single-box cover in the definition of Lebesgue outer measure gives μ(E)≤(2M)d<∞, so 1A∈L2(E). If A had positive measure, f=(qa−q)1A would be nonnegative, integrable by [F2], and positive on a set of positive measure. Thus [F3] gives ∫Ef>0. Weak convergence tested against 1A gives ∫A(q−qa)=lim⁡n→∞∫A(qn−qa)≥0, contradicting ∫A(q−qa)=−∫Ef<0. Therefore q≥qa almost everywhere.

2.1F1F2F3step 1.1givenalgebra∎

Let B={x∈E:q(x)>qb(x)}. As in step 1.1, 1B∈L2(E). If B had positive measure, f=(q−qb)1B would be nonnegative, integrable by [F2], and positive on a set of positive measure. Thus [F3] gives ∫Ef>0. Weak convergence tested against 1B gives ∫B(q−qb)=lim⁡n∫B(qn−qb)≤0, contradicting ∫B(q−qb)=∫Ef>0. Therefore q≤qb almost everywhere, and [F1] gives q∈Qad.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Well-posedness of elliptic control state and adjoint equations

Statement

Assume Countable Choice and the setting of Linear coercive elliptic PDE control problem and reduced objective. For every q∈U, there is a unique state u(q)∈V satisfying

a(u(q),v)=⟨f+Bq,v⟩(v∈V),

and

∥u(q)∥V≤β−1∥f+Bq∥V∗.

For every q∈U, there is also a unique adjoint p(q)∈V satisfying

a(v,p(q))=(Ju(q)−ud,Jv)H(v∈V),

with

∥p(q)∥V≤β−1∥J∥ ∥Ju(q)−ud∥H.

Facts & Assumptions

Given: Countable Choice, the normed spaces and data of Linear coercive elliptic PDE control problem and reduced objective, and the bounded real bilinear form and operator in that definition.

[F1]

The form satisfies ∣a(v,w)∣≤M∥v∥V∥w∥V and a(v,v)≥β∥v∥V2; symmetry is not assumed (Linear coercive elliptic PDE control problem and reduced objective, Bounded, coercive and symmetric sesquilinear forms).

[F2]

Lax–Milgram under Countable Choice gives a unique w for every bounded linear functional F with a(w,v)=F(v) and ∥w∥V≤∥F∥V∗/β (The Lax--Milgram theorem, The Axiom of Countable Choice (ACω)).

[F3]

Under Countable Choice, real L2(Ω) with its integral inner product is a Hilbert space (L2 with the integral pairing is a Hilbert space).

[F4]

W1,2(Ω;R) uses the norm with components v,D1v,…,Ddv and the weak-derivative test identity; H01(Ω) is its closed norm closure of Cc∞(Ω) (Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure). A weak derivative value is unique as an almost-everywhere class under Countable Choice (Uniqueness of a weak derivative as an almost-everywhere class).

[F5]

Compactly supported smooth tests and their first derivatives are in L2(Ω) because Ω is bounded and bounded Lebesgue measurable sets have finite measure. Every L2 class is locally integrable by Cauchy–Schwarz on compact subsets, and the L2 inner product obeys Cauchy–Schwarz (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

Proof

1.1F3F4givenconstructalgebra

The weak-derivative test identities are linear, and [F4] makes each derivative coordinate intrinsic, so W1,2(Ω;R) is a vector space with the inner product induced from L2(Ω)d+1; it induces the displayed full Sobolev norm and is definite because its zeroth coordinate is v. Let (vn) be Cauchy in this norm. Its function coordinates and each of its finitely many weak-derivative coordinates are Cauchy in L2(Ω) because each coordinate norm is bounded by the full W1,2 norm. By [F3], there are v,g1,…,gd∈L2(Ω) with vn→v and Divn→gi in L2 for each i.

2.1F3F4F5step 1.1algebra

For every φ∈Cc∞(Ω) and i, the weak-derivative identity for vn is ∫ΩvnDiφ=−∫Ω(Divn)φ. By [F5], both test functions are in L2; Cauchy–Schwarz lets both integrals pass to the limits in [F3], giving ∫ΩvDiφ=−∫Ωgiφ. Thus each gi is a weak derivative of v. By uniqueness in [F4], Div=gi as an L2 class, and the component convergences from step 1.1 give vn→v in the full W1,2 norm. Hence W1,2(Ω;R) is complete.

3.1F4step 2.1given

By [F4], V=H01(Ω;R) is the closure of the linear space Cc∞(Ω;R) in W1,2. It is therefore a closed linear subspace of that complete space, and the inherited inner product is exactly the one in Linear coercive elliptic PDE control problem and reduced objective. Thus V is a real Hilbert space under Countable Choice.

4.1F1F2step 3.1given

For fixed q, the functional Fq(v)=⟨f+Bq,v⟩ is bounded and linear, with ∥Fq∥V∗≤∥f+Bq∥V∗. Applying [F2] to a and Fq now gives the unique state and the stated bound.

5.1F1F2step 4.1givenalgebra

Define the adjoint form a∗(p,v):=a(v,p). It is bounded with the same constant M, and a∗(p,p)=a(p,p)≥β∥p∥V2, so it is coercive with the same β. The functional Gq(v)=(Ju(q)−ud,Jv)H is bounded by ∥J∥∥Ju(q)−ud∥H∥v∥V. Apply [F2] to a∗ and Gq; the result is the unique p(q) with a(v,p(q))=Gq(v) and the stated bound. No symmetry of a is used.

6.1F2F3step 1.1step 2.1step 3.1step 4.1step 5.1∎

Steps 1.1, 2.1, and 3.1 establish the real Hilbert structure required by [F2] using Countable Choice through the real L2 completeness result [F3]. Steps 4.1 and 5.1 give the state, adjoint, uniqueness, and both estimates.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Existence, uniqueness, and variational inequality for elliptic PDE control

Statement

Assume Countable Choice and the setting of Linear coercive elliptic PDE control problem and reduced objective. Then J^ has a unique minimizer q∗∈Qad. It is characterized by

(B∗p(q∗)+αq∗,v−q∗)U≥0(v∈Qad),

where p(q∗) is the adjoint from Well-posedness of elliptic control state and adjoint equations. Conversely, every q∈Qad satisfying this variational inequality is the unique minimizer.

Facts & Assumptions

Given: Countable Choice, the nonempty pointwise box Qad⊂U, the bounded coercive state problem, and the reduced objective J^.

[F1]

Qad is nonempty, bounded, norm closed, and weakly sequentially closed (A pointwise L2 box is nonempty, bounded, closed, and convex, A pointwise L2 box is weakly sequentially closed).

[F2]

Every bounded sequence in the separable real Hilbert control space U=L2(E) has a weakly convergent subsequence (A bounded sequence in a separable Hilbert space has a weakly convergent subsequence, L2 controls on a bounded spatial region form a separable Hilbert space).

[F3]

The state map is affine with bounded linear part S, and J^(q+h)−J^(q)=(B∗p(q)+αq,h)U+12∥Sh∥H2+α2∥h∥U2 (Reduced gradient and coercive Hessian for linear elliptic tracking control).

[F4]

A Fréchet minimizer over a convex set has nonnegative directional derivative along every feasible segment; here that derivative is (B∗p(q)+αq,v−q)U (Reduced gradient and coercive Hessian for linear elliptic tracking control).

[A1]

Countable Choice permits the indexed selection of a minimizing sequence from the nonempty sets {q∈Qad:J^(q)<m+1/(n+1)} for n∈N (The Axiom of Countable Choice (ACω)).

Proof

1.1A1F1F2givenconstruct

The box is nonempty by [F1], so m:=inf⁡q∈QadJ^(q) is finite: J^≥0 and J^(qa)<∞. For every n∈N, the defining property of the infimum makes the set in [A1] nonempty. By Countable Choice choose qn∈Qad with J^(qn)<m+1/(n+1). Since J^(qn)≥α∥qn∥U2/2 and 1/(n+1)≤1, the sequence is bounded. By [F2], applied to its positive-indexed tail, a subsequence converges weakly to some q∈U, and [F1] gives q∈Qad.

1.2F4givenalgebra

If q∗ minimizes, fix v∈Qad. Convexity gives q∗+t(v−q∗)∈Qad for 0≤t≤1. Minimality makes the right directional quotient nonnegative for every t>0; letting t↓0 and using [F4] proves the variational inequality.

2.1F1F3step 1.1algebra

Write Ju(qn)−ud=Ju(0)−ud+Sqn. Bounded linear maps preserve weak convergence, so along the subsequence this state residual converges weakly in H to Ju(q)−ud; the controls converge weakly in U. The Hilbert norm is weakly lower semicontinuous: if z≠0, then ∥zn∥≥∣(zn,z/∥z∥)∣→∥z∥, while the case z=0 is immediate. Applying this to both squared norms in J^ gives J^(q)≤lim inf⁡nJ^(qn)=m. Thus q attains the infimum.

3.1F1F3step 2.1algebra

The exact expansion in [F3] shows strict convexity: for distinct q,r∈U and 0<t<1, J^(tq+(1−t)r)=tJ^(q)+(1−t)J^(r)−t(1−t)2(∥S(q−r)∥H2+α∥q−r∥U2). The last subtracted term is positive, so two different minimizers in the convex box cannot exist.

4.1F3step 3.1step 1.2givenalgebra∎

Conversely, if q satisfies the variational inequality, then for every v∈Qad the exact expansion [F3] gives J^(v)−J^(q)=(B∗p(q)+αq,v−q)U+12∥S(v−q)∥H2+α2∥v−q∥U2≥0. Thus q is a minimizer; step 3.1 gives uniqueness.

Remarks

The existence proof uses Countable Choice to select a minimizing sequence and the stated separable-Hilbert weak subsequence lemma. It uses no Axiom of Choice, Hahn–Banach separation, or reflexive-space compactness theorem.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Cell averaging preserves constant box bounds and has an H1 error bound

Statement

Assume Countable Choice. Let E⊂Rd be a nonempty bounded polyhedral open control domain, and let {Th} be a family of matching affine simplicial meshes of E as in Matching affine simplicial meshes and shape regularity. Set h=max⁡K∈Thdiam⁡(K). For every q∈L2(E) define

(Πhq)∣K=∣K∣−1∫Kq.

Then Πh is the L2 orthogonal projection onto the cellwise-constant space. For every q∈H1(E),

∥q−Πhq∥L2(E)≤Ch ∣q∣H1(E),

where C depends only on dimension and the fixed reference simplex. If additionally the box bounds qa,qb are constant on each cell and q∈Qad, then Πhq∈Qad.

Facts & Assumptions

Given: Countable Choice; the affine simplex mesh convention; q∈L2(E) for orthogonal projection and q∈H1(E) for the error estimate; and, only for box preservation, cellwise-constant bounds with qa≤q≤qb almost everywhere.

[F1]

A cell map is an affine bijection from the fixed reference simplex, and the cells have disjoint interiors (Matching affine simplicial meshes and shape regularity).

[F2]

Affine pullback transports weak derivatives and Sobolev seminorms by the matrix and determinant factors (Affine pullback of weak derivatives and Sobolev seminorms).

[F3]

On the reference simplex, subtracting the cell mean leaves an L2 norm bounded by a constant times the H1 seminorm (Poincare–Wirtinger inequality on a reference simplex).

[F4]

Hölder with exponents 2,2 makes each L2(K) function integrable on the finite-measure cell, so its mean is finite (Holder's inequality for integrals, including the endpoint cases).

[F5]

Change of variables holds for nonnegative measurable integrands; applying it to the positive and negative parts gives the formula for the integrable real function q (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions).

[F6]

Every mesh facet lies in a Lebesgue-null affine hyperplane, so the finite union of facets is null (Every affine hyperplane of Rn, and hence every proper linear subspace, is Lebesgue null).

[A1]

Countable Choice is the stated hypothesis of [F2] and [F3] (The Axiom of Countable Choice (ACω)).

Proof

1.1F1F4F6givenalgebra

By [F4], the cell means are finite, and finitely many finite cell values define an element of the cellwise-constant subspace of L2(E). For every cellwise-constant c, ∫K(q−Πhq)c∣K=0 by the mean identity. Summing over cells, ignoring the null facets by [F6], gives (q−Πhq,c)U=0, proving the orthogonal-projection property for all q∈L2(E). If additionally qa∣K≤q≤qb∣K, integration and division by ∣K∣>0 place each mean in that interval; hence Πhq∈Qad.

1.2A1F1F2F3F4F5F6givenalgebra

Fix a cell K with affine map FK(x^)=bK+AKx^ and write q^=q∘FK. By [F5], change of variables applied to q+ and q− gives the signed integral formula; [F6] lets us ignore the cell facets. Hence (Πhq)∣K∘FK=q^S^d, the mean of q^ on the reference simplex. By [F3], ∥q−Πhq∥L2(K)=∣det⁡AK∣1/2∥q^−q^S^d∥L2(S^d)≤C∣det⁡AK∣1/2∣q^∣H1(S^d). By [F2], ∣q^∣H1(S^d)≤C∥AK∥∣det⁡AK∣−1/2∣q∣H1(K), and ∥AK∥≤CdhK from the fixed reference simplex geometry. Thus ∥q−Πhq∥L2(K)≤ChK∣q∣H1(K).

2.1F1F6step 1.2algebra∎

Square the cell estimates in step 1.2 and sum over cells; the interiors are disjoint and their omitted facets are null by [F6]. Since hK≤h, the sum is at most C2h2∣q∣H1(E)2. Taking square roots proves the global bound.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

State and adjoint Strang bounds give a reduced-gradient error certificate

Statement

Assume the continuous problem of Linear coercive elliptic PDE control problem and reduced objective, Countable Choice, and a finite-dimensional conforming subspace Vh⊂V. Let u=u(q) and p=p(q) be the exact state and adjoint. Let u~,p~∈Vh be computed state and adjoint, where p~ uses u~ in its right-hand side. Suppose the primal and transposed discrete variational problems meet the form-linearity, load-linearity, boundedness and coercivity hypotheses of First Strang estimate for conforming perturbed Galerkin problems. Let εu be the first-Strang right-hand side for the primal problem, and let εp be that right-hand side for the adjoint problem when its load defect includes the additional term ∥J∥2εu. Then

∥u−u~∥V≤εu,∥p−p~∥V≤εp,∥∇J^(q)−(B∗p~+αq)∥U≤∥B∥ εp.

The Strang terms retain best-approximation, quadrature/geometry form defects, and load defects; no defect is silently set to zero.

Facts & Assumptions

Given: The exact state and adjoint; the perturbed conforming state and adjoint equations; uniform discrete coercivity; and the primal/adjoint Strang bounds defined in the Statement.

[F2]

The first Strang estimate is ∥w−wh∥V≤inf⁡vh((1+M/βh)∥w−vh∥V+δa,h(vh)+δF,hβh) for each bounded coercive real bilinear exact form and its bounded coercive conforming real bilinear discrete form, with bounded linear loads (First Strang estimate for conforming perturbed Galerkin problems).

[F3]

The reduced gradient is B∗p+αq and ∥B∗∥≤∥B∥ (Reduced gradient and coercive Hessian for linear elliptic tracking control).

Proof

1.1F1F2givenalgebra

Apply [F2] to the exact state equation and the computed state equation. By the definition of εu, this gives ∥u−u~∥V≤εu. The adjoint load formed with u~ differs from the exact adjoint load by the functional v⟼(J(u~−u),Jv)H, whose norm is at most ∥J∥2∥u~−u∥V≤∥J∥2εu. Including this term in the adjoint load defect and applying [F2] to the transposed form gives ∥p−p~∥V≤εp.

2.1F3step 1.1algebra∎

The exact reduced gradient is B∗p+αq by [F3], and the computed one is B∗p~+αq. Therefore ∥∇J^(q)−(B∗p~+αq)∥U=∥B∗(p−p~)∥U≤∥B∥ ∥p−p~∥V≤∥B∥ εp. The displayed certificate includes every Strang approximation and consistency term used to form εp.

Remarks

For exact conforming Galerkin equations, the form and load defects vanish and the Strang bounds reduce to the matching Céa estimates. For quadrature or geometry approximations, the corresponding defects remain in εu and εp.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

The optimal elliptic control is the clipped negative adjoint

Statement

For the unique minimizer q∗ in Existence, uniqueness, and variational inequality for elliptic PDE control, with adjoint p(q∗), one has

q∗(x)=min⁡{qb(x),max⁡{qa(x),−B∗p(q∗)(x)α}}for almost every x∈E.

Facts & Assumptions

Given: The linear-quadratic reduced objective, the nonempty closed convex box Qad, its unique minimizer q∗, and α>0.

[F1]

The minimizer is characterized by (B∗p(q∗)+αq∗,v−q∗)U≥0 for every v∈Qad (Existence, uniqueness, and variational inequality for elliptic PDE control).

[F2]

The unique L2 projection onto Qad is pointwise clipping and is characterized by its variational inequality (The L2 projection onto a pointwise box is clipping).

Proof

1.1F1F2givenalgebra

Divide the variational inequality in [F1] by α>0 and rewrite it as (q∗−(−B∗p(q∗)/α),v−q∗)U≥0(v∈Qad). This is exactly the projection variational inequality in [F2] for projecting −B∗p(q∗)/α onto Qad.

2.1F2step 1.1∎

By the explicit formula in [F2], the projection is pointwise clipping to [qa(x),qb(x)] almost everywhere. Substitution gives the displayed formula.

AlgorithmAlgorithm: AI-adaptedProof: Not applicableOpen item page →

Finite-budget projected-gradient loop with state-adjoint residual certificates

Definition

Assume Countable Choice. Let E⊂Rd, d≥2, be a bounded polyhedral open control domain with a finite matching affine simplicial mesh as used in The L2 projection onto a cellwise constant box clips cell averages. Let Uh⊂U=L2(E) be the finite-dimensional space of cellwise-constant controls on this mesh, and let Qh=Uh∩Qad be nonempty with bounds constant on each control cell. The target is the exact continuous reduced objective J^ of Linear coercive elliptic PDE control problem and reduced objective, restricted to Qh; write Ju(q)=c+Sq and g(q)=∇J^(q)=B∗p(q)+αq. Choose finite certified bounds βB≥∥B∥ and Lh≥∥S∣Uh∥2+α>0. Given a finite budget N≥1, tolerance τ≥0, and initial q0∈Qh, repeat for k=0,…,N−1:

Fix a finite-dimensional conforming state space Vh⊂V and the discrete primal and transposed adjoint equations satisfying the first-Strang hypotheses in State and adjoint Strang bounds give a reduced-gradient error certificate at each queried control. An additional input is a residual-evaluation routine C. For every queried qk, it must return in finite time either a valid tuple (u~k,p~k,εu,k,εp,k) or failure. A valid tuple has u~k,p~k∈Vh solving the specified discrete primal and transposed adjoint equations, with the adjoint right-hand side formed using u~k, and nonnegative finite bounds that dominate the complete primal and adjoint first-Strang right-hand sides. Those bounds retain all form, geometry, quadrature, and load defects, including the adjoint load contribution ∥J∥2εu,k from the state error. The finite-return condition is part of the algorithm's admissible input contract; if the backend cannot certify the equations and bounds, it returns failure.

A second input is a projection-evaluation routine P. Write qk,K:=qk∣K. For every queried (qk,p~k,Lh) it must return in finite time either failure or finite real cell values zk,K and a finite real rk≥0 satisfying zk,K=clip⁡[qa∣K,qb∣K](qk,K−αqk,K+∣K∣−1∫KB∗p~kLh),rk2=∑K∈Th∣K∣ ∣qk,K−zk,K∣2. Thus the returned cellwise function is exactly PQh(qk−g~k/Lh) and rk is its exact step norm by The L2 projection onto a cellwise constant box clips cell averages. Computing the required cell averages, clipped values and norm is part of this finite-return backend contract; it is not inferred from boundedness of B, and no finite representation of the entire function B∗p~k is assumed. Unavailable exact values must be reported as failure, not left pending.

  1. Call C(qk). If it returns failure or no valid bounds, return (qk,inconclusive,+∞). Otherwise use its conforming finite-element state and adjoint approximations u~k,p~k and complete Strang bounds εu,k,εp,k. Set δk=βBεp,k and g~k=B∗p~k+αqk.
  2. Call P(qk,p~k,Lh). If it returns failure or no valid cell values and norm, return (qk,inconclusive,+∞). Otherwise set q~k+1∣K=zk,K and ρ~k=rk from its valid return.
  3. If ρ~k+δk/Lh≤τ, return (qk,certified,ρ~k+δk/Lh).
  4. Otherwise set qk+1=q~k+1 and continue.

If all N iterations finish without that test, return the last evaluated iterate (qN−1,budget-exhausted,ρ~N−1+δN−1/Lh). Both routines' finite-return contracts ensure that an unavailable state/adjoint bound or projection/residual value is reported as failure rather than left pending. The reported number certifies a projected-gradient residual for the exact continuous PDE objective restricted to Qh; it is not a continuous-control discretization error bound.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Piecewise-constant control with shape-regular finite elements has O(h) error

Statement

Assume Countable Choice and the elliptic control problem of Linear coercive elliptic PDE control problem and reduced objective on a shape-regular affine simplicial mesh family, with cellwise-constant box bounds and P1 conforming state and adjoint spaces. Let Uh⊂U be the cellwise-constant control space and Qh=Uh∩Qad. For each q∈U, let uh(q)∈Vh be the chosen affine finite-element state map, and define the finite-element reduced objective on U by

J^h(q)=12∥Juh(q)−ud∥H2+α2∥q∥U2.

Let ph(q)∈Vh be its associated discrete adjoint. Require adjoint consistency for this same state map and objective, namely

DJ^h(q)[r]=(B∗ph(q)+αq,r)U(q,r∈U).

Write gh(q)=B∗ph(q)+αq and g(q)=∇J^(q). Let q∗ be the continuous minimizer and qh the minimizer of J^h over Qh. Assume q∗∈H1(E), the projected adjoints satisfy ∥B∗ph(qh)∥H1(E)≤Cp uniformly in h, and the exact state/adjoint finite-element gradient error obeys

sup⁡q∈Qh∥gh(q)−g(q)∥U≤Cgh.

The last bound is supplied by State and adjoint Strang bounds give a reduced-gradient error certificate when its state and adjoint approximations are the same uh and ph used in J^h and the stated primal/adjoint P1 approximation errors and every Strang form/load defect are O(h) uniformly over Qh. Then there is a constant C independent of h such that

∥qh−q∗∥L2(E)≤Ch.

Facts & Assumptions

Given: The unique continuous minimizer and its variational inequality; the discrete objective and adjoint-consistency identity in the Statement; its minimizer on Qh; the cell-average projection Πh; q∗∈H1(E); the uniform projected-adjoint H1 bound; and the gradient error bound in the Statement.

[F1]

The continuous gradient g(q)=∇J^(q) is strongly monotone: (g(q)−g(r),q−r)U=∥S(q−r)∥H2+α∥q−r∥U2≥α∥q−r∥U2 (Reduced gradient and coercive Hessian for linear elliptic tracking control).

[F2]

The continuous minimizer satisfies (g(q∗),v−q∗)U≥0 for all v∈Qad (Existence, uniqueness, and variational inequality for elliptic PDE control). Since qh minimizes the differentiable objective J^h on the convex set Qh, the adjoint-consistency identity gives (gh(qh),vh−qh)U≥0 for every vh∈Qh.

[F3]

Πhq∗∈Qh, ∥q∗−Πhq∗∥U≤CΠh∥q∗∥H1(E), and q∗−Πhq∗ is orthogonal to every element of Qh (Cell averaging preserves constant box bounds and has an H1 error bound).

[F4]

The adjoint-consistency identity gives gh(q)=B∗ph(q)+αq for the same objective. Its error obeys ∥gh(qh)−g(qh)∥U≤Cgh, and ∥B∗ph(qh)−Πh(B∗ph(qh))∥U≤CΠhCp (State and adjoint Strang bounds give a reduced-gradient error certificate, Cell averaging preserves constant box bounds and has an H1 error bound).

[A1]

The dual regularity, uniform primal/adjoint approximation, and Strang defects are such that the two bounds in [F4] hold uniformly as h↓0.

Proof

1.1F1F2F3F4givenalgebra

Put e=qh−q∗. By [F1], α∥e∥U2≤(g(qh)−g(q∗),e)U. Replace g(qh) by gh(qh) at a cost at most Cgh∥e∥U by [F4]. The continuous variational inequality in [F2] gives −(g(q∗),e)U≤0. The discrete variational inequality with the feasible test Πhq∗ gives (gh(qh),e)U≤(gh(qh),Πhq∗−q∗)U. Since gh(qh)=B∗ph(qh)+αqh and qh∈Qh, orthogonality in [F3] cancels the regularization term. Orthogonality also lets us subtract Πh(B∗ph(qh)) from the remaining factor. Hence α∥e∥U2≤CΠ2Cp∥q∗∥H1h2+Cgh∥e∥U.

2.1step 1.1algebra∎

Since every mesh cell is a nondegenerate simplex, h>0. Let t=∥e∥U/h and divide the inequality in step 1.1 by h2 to obtain αt2−Cgt−CΠ2Cp∥q∗∥H1≤0. Thus t is at most the positive root Cg+Cg2+4αCΠ2Cp∥q∗∥H12α, which is independent of h. The resulting upper bound for t is independent of h, proving the O(h) estimate.

Remarks

The finite-element contribution is carried by the exact gradient residual bound. For exact geometry and Galerkin forms it reduces to the matching primal and adjoint energy estimates; a variational crime contributes its full Strang form and load defects. The H1 control regularity is essential to the cell-average term.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Parabolic linear-quadratic control has an energy adjoint and reduced gradient

Statement

Assume Countable Choice. Let T>0 and let E⊂Rd be bounded and Lebesgue measurable. Let V↪H≅H∗↪V∗ be a real Gelfand triple with V separable, and let W={w∈L2(0,T;V):w′∈L2(0,T;V∗)} have the continuous H-valued trace supplied by The evolution-space energy identity and continuous H trace. Let a(t;⋅,⋅) be measurable, uniformly bounded and coercive as in Well-posedness for measurable coercive parabolic forms. Let U=L2(E×(0,T)), let B:U→L2(0,T;V∗) be bounded and linear, and let Qad={q∈U:qa≤q≤qb a.e.} for qa,qb∈U, qa≤qb. For fixed u0∈H, f∈L2(0,T;V∗), and ud∈L2(0,T;H), define the unique state by

u′(t)+A(t)u(t)=f(t)+Bq(t),u(0)=u0,

where ⟨A(t)v,w⟩=a(t;v,w) and ⟨A(t)∗p,v⟩=a(t;v,p), and define

J^(q)=12∥u(q)−ud∥L2(0,T;H)2+α2∥q∥U2,α>0.

Then for every q∈U the adjoint p∈W uniquely solves

−p′(t)+A(t)∗p(t)=u(q)(t)−ud(t),p(T)=0,

and J^ is Fr'echet differentiable with

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

Define B∗p∈U by (B∗p,r)U=∫0T⟨Br,p⟩V∗,Vdt for every r∈U; boundedness of B and Hilbert-space Riesz representation make it well-defined. The formula requires the terminal/initial traces and time-dependent form hypotheses above; it asserts no finite-element error rate. For the separate finite-element error splitting, assume additionally u∈H1(0,T;V), Vh⊂V is finite-dimensional, and Ph∈C1([0,T];L(V,Vh)) in operator norm. Then its residual derivative is ρ′=Ph′(t)u+Ph(t)u′−u′, including the Ph′(t)u term.

Facts & Assumptions

Given: Countable Choice; the real Gelfand triple with separable V and its energy space; the stated bounded, coercive, measurable form; bounded linear B; fixed initial and desired data; and α>0.

[A1]

Countable Choice is the stated axiom for parabolic solvability and Hilbert-space Riesz representation (The Axiom of Countable Choice (ACω), Riesz representation for Hilbert spaces).

[F1]

On the stated separable real evolution triple, for every right-hand side in L2(0,T;V∗) and initial trace in H, the parabolic equation has a unique energy solution in W (Well-posedness for measurable coercive parabolic forms).

[F2]

Elements of W have continuous H traces, and for v,w∈W the energy pairing obeys integration by parts, including the endpoint terms (Evolution triples and the parabolic energy space, The evolution-space energy identity and continuous H trace).

[F3]

Time reversal preserves measurability, boundedness, and coercivity for the transposed form; applying [F1] to the reversed equation gives the terminal adjoint.

[F4]

Apply Closed pointwise box of L2 controls to the bounded measurable space-time domain E×(0,T). It supplies the pointwise box and the real Hilbert structure on U=L2(E×(0,T)) under Countable Choice, so Hilbert-space Riesz representation defines B∗p.

[F5]

For the stated separable V, if u∈H1(0,T;V) and Ph∈C1([0,T];L(V,Vh)) in operator norm, then (Phu)′=Ph′u+Phu′ and the parabolic residual contains Ph′u (Time derivatives of fixed and differentiable comparison projections, Semidiscrete Ritz error splitting and energy estimate).

Proof

1.1A1F1givenalgebra

For a direction r∈U, the state difference z=u(q+r)−u(q) satisfies z′+A(t)z=Br and z(0)=0. By [A1, F1] and linearity, z=Sr for a bounded linear solution map S:U→L2(0,T;H). Expanding the two squared norms gives J^(q+r)−J^(q)=(u−ud,z)L2(0,T;H)+α(q,r)U+12∥z∥L2(0,T;H)2+α2∥r∥U2. The last two terms are quadratic in r, so the first two terms give the Fr'echet derivative once the observation residual is paired with z.

2.1A1F1F2F3step 1.1algebra

Set g=u−ud and reverse time: with s=T−t, p~(s)=p(T−s), g~(s)=g(T−s), and a~∗(s;x,y)=a(T−s;y,x), the backward equation becomes the forward equation ⟨p~′,v⟩+a~∗(s;p~,v)=(g~,v)H with initial value p~(0)=0. The transposed reversed form is measurable, bounded, and coercive with the same constants, so [A1, F1] supplies its unique energy solution; reflecting back proves [F3] and gives p∈W. Its weak equation is ⟨−p′,v⟩+a(t;v,p)=(g,v)H. By the energy integration-by-parts identity [F2], testing with the state variation z and using z(0)=0 and p(T)=0 gives ∫0T(g,z)Hdt=∫0T(⟨z′,p⟩+a(t;z,p))dt=∫0T⟨Br,p⟩dt=(B∗p,r)U. Therefore the linear term in step 1.1 is (B∗p,r)U, and the derivative is B∗p+αq.

3.1A1F4step 1.1step 2.1algebra

Boundedness of S makes the remainder in step 1.1 bounded by 12∥S∥2∥r∥U2+α2∥r∥U2, which is o(∥r∥U). Therefore the derivative is Fr'echet; Riesz representation in [A1] gives the stated gradient.

4.1F5givenalgebra∎

In the additional finite-element setting of [F5], differentiate ρ(t)=Ph(t)u(t)−u(t) in the weak time sense. The product rule gives ρ′=Ph′(t)u(t)+Ph(t)u′(t)−u′(t). Thus the comparison residual contains the full displayed derivative, including Ph′u; the reduced-gradient formula does not authorize dropping it.

Remarks

The proof uses the terminal condition on p and the zero initial value of a state variation; omitting either endpoint term would invalidate the adjoint identity.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A certified projected-gradient residual bounds distance to the control-mesh optimum

Statement

Assume Countable Choice. Let Uh be a finite-dimensional cellwise-constant control space with nonempty box Qh, and restrict the exact reduced objective J^ of Linear coercive elliptic PDE control problem and reduced objective to Qh. Let qh∗ be its minimizer and let Lh≥∥S∣Uh∥2+α, where S is the linear part of the continuous state-to-observation map and α>0. Assume the residual- and projection-evaluation routines satisfy the finite-return admissibility conditions in Finite-budget projected-gradient loop with state-adjoint residual certificates. Then that finite-budget algorithm terminates in finite time after at most N iterations and at most N calls to each routine, returning \texttt{inconclusive}, \texttt{budget-exhausted}, or \texttt{certified}. Every \texttt{certified} return at q∈Qh with reported bound ρ=ρ~+δ/Lh satisfies ∥q−PQh(q−∇J^(q)/Lh)∥U≤ρ≤τ, and consequently ∥q−qh∗∥U≤(Lh/α)ρ=(Lh/α)ρ~+δ/α. This bounds distance to the control-mesh minimizer of the exact PDE objective; it is not an error estimate between that minimizer and the unrestricted PDE optimum.

Facts & Assumptions

Given: Countable Choice; a nonempty finite-dimensional cellwise-constant box Qh; the exact reduced objective; α>0; a valid Lh; and residual- and projection-evaluation routines satisfying the finite-return admissibility conditions in the algorithm definition.

[F1]

The FE state and adjoint residuals give ∥g(qk)−g~k∥U≤∥B∥εp,k (State and adjoint Strang bounds give a reduced-gradient error certificate).

[F2]

The projection onto the cellwise box clips cell averages and is nonexpansive (The L2 projection onto a cellwise constant box clips cell averages).

[F3]

The exact reduced objective has gradient g=∇J^ and Hessian S∗S+αI (Reduced gradient and coercive Hessian for linear elliptic tracking control).

[F4]

The Hessian bound in [F3] implies α-strong convexity of J^ (Reduced gradient and coercive Hessian for linear elliptic tracking control).

[F5]

A continuous function on a compact finite-dimensional box attains its minimum (Semicontinuous extreme value theorem on compact Euclidean sets).

[F6]

A self-adjoint endomorphism of a finite-dimensional real-inner-product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).

[F7]

The algorithm issues \texttt{certified} only when the computed residual plus the adjoint-gradient error bound is at most τ (Finite-budget projected-gradient loop with state-adjoint residual certificates).

[F8]

The algorithm performs at most N iterations; its admissible residual and projection routines each return in finite time with either their exact valid outputs or failure, and the definition returns the stated failure or exhaustion status when certification does not succeed (Finite-budget projected-gradient loop with state-adjoint residual certificates).

[A2]

The algorithm supplies a certified bound βB≥∥B∥ (Finite-budget projected-gradient loop with state-adjoint residual certificates).

[A3]

The algorithm sets δk=βBεp,k (Finite-budget projected-gradient loop with state-adjoint residual certificates).

[A1]

Countable Choice is used through the state-adjoint well-posedness and Hilbert-space Riesz results in [F1] and [F3] (The Axiom of Countable Choice (ACω)).

Proof

1.1A1A2A3F1F2givenalgebra

Put g=∇J^, T(q)=PQh(q−g(q)/Lh), and T~k=PQh(qk−g~k/Lh). By [F1], [A2], and [A3], ∥g(qk)−g~k∥U≤∥B∥εp,k≤δk. Nonexpansiveness [F2] gives ∥T(qk)−T~k∥U≤δk/Lh. Since ρ~k=∥qk−T~k∥U, the triangle inequality gives ∥qk−T(qk)∥U≤ρ~k+δk/Lh=ρk.

1.2A1F2F3F6givenalgebra

Let PUh be the orthogonal projection onto cellwise constants. The clipped-cell-average formula [F2] gives PQh(w)=PQh(PUhw). For x,y∈Uh, [F3] yields g(x)−g(y)=(S∗S+αI)(x−y), so applying PUh gives Hh(x−y), where Hh=PUh(S∗S+αI)∣Uh. Its Rayleigh quotients lie in [α,Lh]; [F6] therefore implies ∥I−Hh/Lh∥≤1−α/Lh. Nonexpansiveness now gives ∥T(x)−T(y)∥U≤(1−α/Lh)∥x−y∥U.

1.3A1F3F4F5givenalgebra

Since Qh is a nonempty compact box in finite-dimensional Uh, [F5] gives a minimizer, and α-strong convexity [F4] makes it unique. For any v∈Qh, the feasible segment from qh∗ to v and differentiability imply (g(qh∗),v−qh∗)U≥0. Set w=qh∗−g(qh∗)/Lh. Then ∥w−v∥U2−∥w−qh∗∥U2=∥v−qh∗∥U2+(2/Lh)(g(qh∗),v−qh∗)U≥0. Thus qh∗ is the unique nearest point in Qh to w, so T(qh∗)=qh∗.

2.1F7F8step 1.1givenalgebra

By [F7], a \texttt{certified} return is issued only when ρk≤τ, so step 1.1 proves the reported bound for the exact mapping residual. By [F8], each residual and projection call returns in finite time, and each is called at most N times; the projection routine supplies the exact cell values and step norm used in step 1.1, and all remaining steps are finite scalar arithmetic and comparisons, so the algorithm terminates with one of its stated statuses.

2.2step 1.2step 1.3algebra

For r=∥q−T(q)∥U, steps 1.2–1.3 and the triangle inequality imply ∥q−qh∗∥U≤r+∥T(q)−T(qh∗)∥U≤r+(1−α/Lh)∥q−qh∗∥U. Rearranging yields ∥q−qh∗∥U≤(Lh/α)r.

3.1step 1.1step 2.2algebra∎

On a \texttt{certified} return, step 1.1 gives r≤ρ=ρ~+δ/Lh; substituting into step 2.2 proves both displayed distance bounds.

Remarks

The objective in this theorem uses the exact continuous PDE state map and optimizes only over the finite-dimensional control box. Its finite-element state/adjoint solves are gradient approximations certified by the full Strang ledger in State and adjoint Strang bounds give a reduced-gradient error certificate.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Conditional O(h2) variational control error under H2 regularity and full uniform L2 estimates

Statement

Assume Countable Choice. Let q∗ minimize the continuous distributed-control objective of Linear coercive elliptic PDE control problem and reduced objective with E=Ω, U=H=L2(Ω), Bq(v)=(q,v)L2, and observation J=I. Assume exact affine geometry and conforming P1 Galerkin state and adjoint spaces on a shape-regular mesh family. Let uh:U→Vh be the affine finite-element state map and define the finite-element reduced objective on U by

J^h(q)=12∥uh(q)−ud∥L2(Ω)2+α2∥q∥L2(Ω)2.

Let ph(q)∈Vh be the associated discrete adjoint. Require adjoint consistency for this same state map and objective, namely

DJ^h(q)[r]=(ph(q)+αq,r)L2(Ω)(q,r∈U).

This identity is the condition that the discrete adjoint represents the derivative of the stated objective; it must be checked for any perturbed state, form, or load implementation. Set gh(q)=ph(q)+αq and g(q)=∇J^(q), and let qhv minimize J^h over the same infinite-dimensional box Qad (variational control discretization). Assume the actual primal and adjoint problems have uniform H2 regularity and the matching primal and dual interpolation bounds of The h^(r+s) L² rate under primal and dual approximation with r=s=1. Assume also that the full state and adjoint error bounds, including every Strang form/load defect and the state-error contribution to the adjoint load, satisfy

sup⁡q∈Qad(∥uh(q)−u(q)∥L2+∥ph(q)−p(q)∥L2)≤Ch2.

The displayed uniform L2 state/adjoint estimate is an explicit hypothesis here; a concrete PDE family must verify it from its actual H2 regularity, matching dual approximation, and complete Strang/geometry/quadrature/load ledger. An energy error of order h alone does not imply this L2 bound. Then

∥qhv−q∗∥L2(E)≤Ch2,

where C is independent of h. No such rate is asserted on a domain or coefficient class lacking the stated primal, adjoint, and defect estimates.

Facts & Assumptions

Given: The continuous minimizer and variational inequality; the finite-element reduced objective, its adjoint-consistency identity and its minimizer on Qad; uniform control bounds; the P1 shape-regular mesh; primal and adjoint H2 regularity; the matching Aubin–Nitsche hypotheses; and the full Strang defect estimates.

[F1]

The continuous gradient is g(q)=p(q)+αq; the stated adjoint-consistency identity gives gh(q)=ph(q)+αq, so gh(q)−g(q)=ph(q)−p(q). The uniform state/adjoint L2 premise therefore supplies sup⁡q∈Qad∥gh(q)−g(q)∥L2≤Ch2 (Reduced gradient and coercive Hessian for linear elliptic tracking control, with the explicit error assumption in the Statement).

[F5]

The continuous reduced gradient is strongly monotone with constant α (Reduced gradient and coercive Hessian for linear elliptic tracking control).

[A1]

The primal and adjoint L2 errors are O(h2) uniformly over Qad, including the adjoint-load perturbation caused by the primal state error.

Proof

1.1A1F1givenalgebra

The adjoint-consistency identity and the continuous gradient formula give gh(q)−g(q)=ph(q)−p(q). The explicit uniform L2 premise [A1], including the state-error contribution to the adjoint load and every form/load defect, therefore gives sup⁡q∈Qad∥gh(q)−g(q)∥U≤Cgh2. The actual H2, dual-approximation, and defect hypotheses must be used to verify [A1] for the PDE family; this proof does not infer it from an energy estimate of order h alone.

2.1F5step 1.1givenalgebra∎

Put e=qhv−q∗. Strong monotonicity [F5] gives α∥e∥U2≤(g(qhv)−g(q∗),e)U. The continuous variational inequality gives (g(q∗),e)U≥0. Since qhv minimizes the differentiable J^h on the convex set Qad, its derivative identity gives (gh(qhv),e)U≤0 along the feasible segment toward q∗. Replacing g(qhv) by gh(qhv) costs at most Cgh2∥e∥U by step 1.1. Thus α∥e∥U2≤Cgh2∥e∥U. If e=0 the claim is immediate; otherwise divide by α∥e∥U to get ∥e∥U≤(Cg/α)h2.

Remarks

The H2 primal and adjoint assumptions must match the actual operator, boundary, and domain. In particular, a full-adjoint estimate is not inferred on an arbitrary Lipschitz or reentrant polygonal domain, an energy estimate of order h does not replace the explicit L2 estimate, and unresolved geometry or quadrature defects cannot be discarded.

[F2] Under the matching primal and dual approximation bounds with r=s=1, the conforming state error obeys the Aubin–Nitsche L2 estimate with order h2 (The h^(r+s) L² rate under primal and dual approximation, Aubin–Nitsche L² error estimate from adjoint approximation).

[F3] Céa and the shape-regular P1 approximation supply the primal H1 rate used in [F2] (Céa quasi-optimality for coercive conforming Galerkin problems, Primal H¹ approximation on shape-regular affine finite-element meshes).

[F4] The Strang estimate retains every form and load defect for perturbed state and adjoint solves (First Strang estimate for conforming perturbed Galerkin problems).

AlgorithmAlgorithm: AI-adaptedProof: Not applicableOpen item page →

Finite-budget active-set SQP with a certified KKT-system residual status

Definition

Let a finite-dimensional C2 reduced FE control program have a fixed list of m inequality constraints. Its exact objective, constraint, gradient, and Hessian evaluators, and its active-row rank and reduced-curvature checks, must terminate on every query or return failure. For each active set A⊆{1,…,m}, use the active KKT map FA and exact-Hessian Jacobian JA=DFA specified by Full-step exact-Hessian SQP after active-set identification, with inactive inequality multipliers set to zero. Given an initial primal vector x0, equality multiplier ν0, and full inequality multiplier vector λ0∈Rm with entries outside A0 zero when R>0, an ordered finite list of proposed active sets A0,…,AR−1, maximum budget N≥1, residual tolerance τ≥0, a terminating exact-storage routine satisfying the input contract of Finite-precision reduced-QR KKT solve with certified residual status, and its floating-point hypotheses, process at most min⁡(R,N) candidates. If R=0, return inconclusive immediately. At candidate j, first set λj,i=0 for i∉Aj, then let zj=(xj,νj,λj,Aj) be the active KKT variable.

  1. Evaluate FAj(zj) and Kj=JAj(zj). Write Gj=DcAj(xj) for the stacked equality and active-inequality rows, and Hj=∇xx2L(zj) for the Lagrangian Hessian block. Verify that Gj has full row rank and dTHjd>0 for every nonzero d∈ker⁡Gj, as required by Finite-precision reduced-QR KKT solve with certified residual status. If an evaluation fails or either condition is false or cannot be verified, mark this candidate numerical-failure, set (xj+1,νj+1,λj+1)=(xj,νj,λj), and continue to the next candidate.

  2. Otherwise set bj=−FAj(zj) and call Finite-precision reduced-QR KKT solve with certified residual status exactly once on the intended system Kjs=bj, supplying the terminating exact-storage routine. Before factorization or residual evaluation, that call must verify that the stored entries equal the intended Kj,bj. An unavailable or unverified admission is a failed QR solve with no residual certificate. On a failed QR solve, record numerical-failure, set (xj+1,νj+1,λj+1)=(xj,νj,λj), and continue.

  3. On a successful QR return, write its vector as s^j=(p^j,δ^νj,δ^λj,Aj) and let ηj be its residual bound. Set xj+1=xj+p^j, νj+1=νj+δ^νj, and, for each inequality index i, set λj+1,i=λj,i+δ^λj,i if i∈Aj and λj+1,i=0 otherwise. Thus the next candidate has a full, dimensionally fixed multiplier vector; newly active multipliers start at zero. The QR vector is the only step used by this wrapper. If ηj≤τ, return (zj+,Aj,active-kkt-residual-certified,ηj), where zj+=(xj+1,νj+1,λj+1,Aj); otherwise continue.

For each successful solve, retain the tuple with the smallest computed ηj. If the finite list or budget is exhausted, return budget-exhausted with that tuple, or inconclusive if no solve succeeded. The active-kkt-residual-certified status concerns only the linearized active KKT equation residual ∥Kjs^j+FAj(zj)∥2. A nonlinear next-point KKT residual, box feasibility, multiplier signs, global optimality, and forward accuracy require separate validated checks; none follows from a small linear-system residual alone.

Remarks

For an exact quadratic reduced objective and affine active constraints, including every equality constraint, FA is affine and its Jacobian is constant, so the next-point active KKT residual equals the linear solve residual in the algorithm. For a nonlinear active KKT map, a certified step-equation residual is not by itself a certificate for FA(zj+); the local OPT6 convergence theorem additionally requires identified active set, LICQ, strict complementarity, positive reduced curvature, locally Lipschitz Jacobian, and a sufficiently close start. The exact-Hessian algorithm supplies the map/Jacobian convention; the QR algorithm supplies the rank and curvature input conditions. The exact solve is not run by this finite-precision wrapper.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Finite SQP status is sound and the exact local branch inherits OPT6 conditions

Statement

Every active-kkt-residual-certified return of Finite-budget active-set SQP with a certified KKT-system residual status with reported bound η satisfies the exact active linear solve residual bound ∥Ks+FA(z)∥2≤η≤τ. For a quadratic FE reduced objective with affine equality constraints and affine active inequalities, in particular a program constrained only by a box, this also bounds the exact active KKT residual of the returned next point. On a nonlinear reduced problem, if the true active set is identified and the OPT6 hypotheses hold, exact-arithmetic full steps started sufficiently close converge quadratically to the active KKT pair. The finite-precision residual bound alone does not imply forward error, box optimality, or an SQP accuracy rate.

Facts & Assumptions

Given: A returned finite-budget status and its active set, computed residual upper bound, and, for the separate local convergence statement, a nonlinear program satisfying the stated OPT6 conditions.

[F1]

The finite algorithm returns the finite-precision QR vector as its step and reports active-kkt-residual-certified only after checking η≤τ; it does not label box feasibility or global optimality (Finite-budget active-set SQP with a certified KKT-system residual status).

[F2]

The OPT6 QR certificate bounds the exact residual of its active KKT linear system; the corresponding solution error additionally depends on ∥K−1∥ (The computed KKT residual certificate bounds the exact linear-system residual).

[F3]

The exact Hessian/local branch has quadratic convergence under identified active set, LICQ, strict complementarity, positive reduced curvature, locally Lipschitz Jacobian, and a sufficiently close start (Exact-Hessian SQP converges quadratically on the identified active KKT system).

[A1]

The QR residual certificate’s floating-point assumptions and no-overflow checks hold on any returned certified branch.

Proof

1.1A1F1F2givenalgebra

By [F1], a certified return contains a computed linear solve residual bound η≤τ. Applying [F2] gives the exact inequality ∥Ks+FA(z)∥2≤η≤τ. The theorem supplies no smaller bound unless the reported η is smaller.

2.1F1step 1.1givenalgebra

Write the quadratic objective as ϕ(x)=12xTQx+cTx+c0 with symmetric Q, and stack all equalities and active inequalities as cA(x)=Gx−d. With their stacked multiplier μ, the algorithm's convention gives FA(x,μ)=(Qx+c+GTμ,Gx−d) and K=[QGTG0]. Thus FA is affine in the combined primal-dual variable and FA(z+s)=FA(z)+Ks. Step 1.1 therefore bounds the returned point's active KKT residual. Affine box inequalities alone do not give this identity when an equality constraint is nonlinear.

3.1F3givenalgebra∎

In the separate exact local branch, the hypotheses listed in [F3] imply the active KKT Jacobian is nonsingular and locally Lipschitz. The cited OPT6 Newton theorem then applies to the exact full-step active-system iteration started sufficiently near its root and gives quadratic convergence. This conclusion is conditional on those hypotheses and is independent of finite-budget status.

Remarks

The exact local convergence conclusion remains conditional on the OPT6 hypotheses and is independent of this finite-budget residual status. No exact-solve status implies a small forward error without a bound on the inverse active KKT matrix.

5 · Examples, counterexamples and false statements

None yet.

Sources