Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Aubin–Nitsche L² error estimate from adjoint approximation

Statement

Assume Countable Choice and the conforming Galerkin setting of Céa quasi-optimality for coercive conforming Galerkin problems. Let H=L2(Ω;K) with inner product linear in the first slot, and let J:V→H be a continuous linear inclusion with ∥Jv∥H≤CE∥v∥V. Put e:=J(u−uh). The adjoint solution ze is the unique element of V satisfying a(v,ze)=(Jv,e)H(v∈V); it exists by Well-posedness of the adjoint variational problem. Let s∈(0,1], and let Rs⊆V be a specified normed space of adjoint-regular functions. Assume constants CR,CI independent of h and the error satisfy ∥ze∥Rs≤CR∥e∥H,inf⁡wh∈Vh∥ze−wh∥V≤CIhs∥ze∥Rs. Then ∥u−uh∥L2(Ω)≤MCICRhs∥u−uh∥V. The symbol Rs means exactly the chosen regularity norm space in the two displayed assumptions; no fractional Sobolev interpolation estimate is asserted unless it verifies the second inequality. The integer endpoint may be instantiated with R1=H2(Ω)∩V, using the H2(Ω)=W2,2(Ω) norm. If H2(Ω)⊆V, this is simply R1=H2(Ω).

Facts & Assumptions

Given: Countable Choice; the bounded coercive conforming Galerkin data and unique solutions; the continuous inclusion J:V→L2(Ω;K); an exponent s∈(0,1]; and the two dual regularity and approximation inequalities in Statement.

[F1]

The Céa theorem gives unique u and uh in the continuous and discrete spaces (Céa quasi-optimality for coercive conforming Galerkin problems).

[F2]

A bounded linear functional G has a unique adjoint solution z with a(v,z)=G(v), under Countable Choice (Well-posedness of the adjoint variational problem).

[F3]

Galerkin orthogonality gives a(u−uh,wh)=0 for every wh∈Vh (Galerkin orthogonality for conforming approximations).

[F4]

On real or complex L2, the corresponding integral pairing is a well-defined inner product, linear in the first slot, and obeys ∣(f,g)L2∣≤∥f∥L2∥g∥L2 (The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz).

Proof

1.1F1F2F4given

Define Ge(v):=(Jv,e)H. By [F4] and the assumed continuity of J, ∣Ge(v)∣≤CE∥v∥V∥e∥H, so Ge is a bounded linear functional. Fact [F2] gives the unique ze with a(v,ze)=Ge(v).

2.1F3step 1.1givenalgebra

Set v=u−uh in the adjoint equation. Then ∥e∥H2=(J(u−uh),e)H=a(u−uh,ze). For any wh∈Vh, [F3] gives a(u−uh,wh)=0, hence a(u−uh,ze)=a(u−uh,ze−wh).

3.1givenstep 2.1algebra

Since the scalar in step 2.1 equals the nonnegative real number ∥e∥H2, boundedness of a gives ∥e∥H2=∣a(u−uh,ze−wh)∣≤M∥u−uh∥V∥ze−wh∥V for every wh∈Vh. Taking the infimum and using the approximation and regularity assumptions yields ∥e∥H2≤MCICRhs∥u−uh∥V∥e∥H.

4.1step 3.1algebra∎

If ∥e∥H=0, the conclusion is immediate. Otherwise divide step 3.1 by ∥e∥H to obtain the asserted Aubin–Nitsche estimate.

Depends on

Used by

Dependency tree · two levels

40 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