Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-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.

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 Vh⊆V be a finite-dimensional conforming space. Let aθ,h and ℓθ,h be operator-norm C1 in θ, uniformly coercive on Vh, and define the discrete state by aθ,h(uh,vh)=ℓθ,h(vh). Let Jh:Vh×Θ→R be C1, and let ph∈Vh solve aθ,h(vh,ph)=DuJh(uh,θ)[vh]. Suppose the parameter derivatives of the discrete forms and loads have specified bounded extensions to V that agree with their values on Vh. Let u,p be the exact state and adjoint, and let uh,ph∈Vh be their discrete counterparts, with certified energy bounds ∥u−uh∥V≤Eu,∥p−ph∥V≤Ep. 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 g[η]=DθJ(u,θ)[η]+ℓθ′[η](p)−aθ′[η](u,p),gh[η]=DθJh(uh,θ)[η]+ℓθ,h′[η](ph)−aθ,h′[η](uh,ph). Assume for ∥η∥2≤1 that ∥ℓθ′[η]∥V∗≤Mℓ, ∥aθ′[η]∥L(V,V∗)≤Ma, the direct-objective defect satisfies ∣DθJh(uh,θ)[η]−DθJ(u,θ)[η]∣≤εJ, and the derivative-data defects obey ∥ℓθ,h′[η]−ℓθ′[η]∥V∗≤εℓ,∥aθ,h′[η]−aθ′[η]∥L(V,V∗)≤εa. Put U∗=max⁡(∥u∥V,∥uh∥V) and P∗=max⁡(∥p∥V,∥ph∥V). Then ∥gh−g∥Θ∗≤εJ+MℓEp+εℓP∗+Ma(EuP∗+U∗Ep)+εaU∗P∗. 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 Eu,Ep, and the derivative-data bounds in the Statement.

[F1]

The reduced gradient is Jθ[η]+ℓθ′[η](p)−aθ′[η](u,p) (The elliptic adjoint gives the reduced parameter gradient).

[F2]

Céa's estimate bounds a conforming Galerkin error by M/α times its best energy approximation (Céa quasi-optimality for coercive conforming Galerkin problems).

[F3]

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).

[F4]

The derivative of a C1 composition is given by the chain rule (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

[A1]

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 (ACω)) is used through those suppliers.

Proof

1.1A1F2F3

Apply [F2] to an exact conforming Galerkin state and its adjoint, or [F3] to each conforming perturbed equation, using the transposed form a†(v,w)=a(w,v) for the adjoint. Transposition preserves boundedness and coercivity constants. Under [A1], the resulting two bounds are Eu,Ep, with all applicable form and load defects, including geometry and quadrature contributions, retained as specified by [F3].

1.2F1F4givenalgebra

Choose a basis of Vh. Coercivity makes the discrete state matrix Kh(θ) invertible, and its entries and the load coordinates are C1. Uniform coercivity makes Kh(θ+z)−1 locally bounded. The identity Kh(θ+z)−1−Kh(θ)−1=−Kh(θ+z)−1(Kh(θ+z)−Kh(θ))Kh(θ)−1 first gives continuity of the inverse. Using Kh(θ+z)−Kh(θ)=DKh(θ)[z]+o(∥z∥2) in that identity gives D(Kh−1)(θ)[z]=−Kh(θ)−1DKh(θ)[z]Kh(θ)−1; this derivative is continuous, so Kh−1 and hence uh(θ) are C1. Differentiating the state equation gives aθ,h(wh,vh)=ℓθ,h′[η](vh)−aθ,h′[η](uh,vh). By [F4], Djh[η]=Jθ,h′[η]+DuJh[wh]; use the discrete adjoint equation with vh=wh, then the differentiated state equation with vh=ph, to obtain the formula for gh in the Statement. The continuous formula is supplied by [F1].

2.1F1step 1.2givenalgebra

Fix η with ∥η∥2≤1. Subtract the continuous and discrete formulas. The direct-objective term is bounded by εJ. Add and subtract ℓθ′[η](ph); then ∣ℓθ,h′[η](ph)−ℓθ′[η](p)∣≤εℓ∥ph∥V+Mℓ∥ph−p∥V≤εℓP∗+MℓEp.

3.1givenstep 2.1algebra

Add and subtract aθ′[η](uh,ph). The derivative-form data defect contributes at most εaU∗P∗. The remaining perturbation equals aθ′[η](u−uh,ph)+aθ′[η](u,p−ph) up to an overall sign, so ∣aθ′[η](u−uh,ph)+aθ′[η](u,p−ph)∣≤Ma(EuP∗+U∗Ep). Thus for every unit η, ∣gh[η]−g[η]∣ is bounded by the displayed constant.

4.1step 3.1algebra∎

Taking the supremum over all ∥η∥2≤1 gives the asserted dual norm bound. The separate ε terms show why state error alone does not certify a reduced-gradient error.

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