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.

Céa and Aubin–Nitsche error estimates

1 · Prerequisites

2 · Summary

For a common bounded coercive form and a conforming finite-dimensional subspace, Lax–Milgram gives the continuous and discrete solutions, Galerkin orthogonality gives Céa's M/α quasi-optimality bound, and Hermitian symmetry improves this to exact best approximation in the energy norm.

For an L2 error, the adjoint equation turns the squared error into a form pairing with the primal error. Orthogonality then leaves only the adjoint approximation error. If primal and dual approximation orders are r and s, the resulting rate is hr+s; the hr+1 case requires the full s=1 dual regularity and matching interpolation hypotheses. The global H2 supplier used here has a bounded C2 domain and coefficient assumptions, retains an L2 solution term, and does not assert H2 regularity on arbitrary Lipschitz domains.

The affine finite-element interpolation estimate assumes an exactly fitted matching affine simplicial mesh and a globally conforming, boundary-preserving interpolant. This page does not infer such an affine mesh approximation for a curved C2 boundary; consumers must supply a compatible geometry argument.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Galerkin orthogonality for conforming approximations

Statement

Let V be a vector space over K∈{R,C}, let Vh⊆V be a subspace, let a be linear in its first argument and conjugate-linear in its second, and let F:V→K be conjugate-linear. If u∈V and uh∈Vh satisfy a(u,v)=F(v)(v∈V),a(uh,vh)=F(vh)(vh∈Vh), then a(u−uh,vh)=0for every vh∈Vh.

Facts & Assumptions

Given: The common form and functional, the inclusion Vh⊆V, and the two displayed variational equations.

Proof

1.1givenchoose

Fix vh∈Vh. Since Vh⊆V, the continuous equation is valid at vh, so a(u,vh)=F(vh).

2.1givenstep 1.1algebra∎

The discrete equation gives a(uh,vh)=F(vh). Subtracting the two equalities and using the stated linearity of a in its first slot yields a(u−uh,vh)=0.

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

Well-posedness of the adjoint variational problem

Statement

Assume Countable Choice. Let V be a real or complex Hilbert space and let a:V×V→K be linear in the first slot, conjugate-linear in the second, bounded by M, and coercive with constant α>0: ∣a(u,v)∣≤M∥u∥V∥v∥V. Re⁡a(u,u)≥α∥u∥V2. For every bounded linear functional G:V→K, there is a unique z∈V such that a(v,z)=G(v)(v∈V), and α∥z∥V≤∥G∥V∗. In the real case conjugation is the identity and both forms and functionals are linear over R.

Facts & Assumptions

Given: Countable Choice, a Hilbert space V, the stated bounds for a, and a bounded linear functional G.

[F1]

A bounded coercive sesquilinear form is linear in the first slot, conjugate-linear in the second, and satisfies the displayed M,α bounds (Bounded, coercive and symmetric sesquilinear forms).

[F2]

On a Hilbert space, a bounded coercive sesquilinear form with a bounded conjugate-linear right-hand side has a unique solution and the estimate α∥z∥≤∥F∥ (The Lax--Milgram theorem).

[F3]

Countable Choice is the axiom required by the imported Lax–Milgram theorem (The Axiom of Countable Choice (ACω)).

Proof

1.1F1givenalgebra

Define the adjoint form by a†(z,v):=a(v,z)‾. The sesquilinearity of a shows that a† is linear in z and conjugate-linear in v. Also ∣a†(z,v)∣=∣a(v,z)∣≤M∥z∥V∥v∥V, and Re⁡a†(z,z)=Re⁡a(z,z)≥α∥z∥V2.

1.2givenalgebra

Set G†(v):=G(v)‾. Since G is linear, G† is conjugate-linear, and ∣G†(v)∣=∣G(v)∣≤∥G∥V∗∥v∥V; hence ∥G†∥V∗=∥G∥V∗.

2.1F2F3step 1.1step 1.2∎

Apply [F2] to a† and G†. It gives a unique z∈V with a†(z,v)=G†(v) and α∥z∥V≤∥G†∥V∗. Conjugating the equation gives a(v,z)=G(v) for every v, and the norm equality in step 1.2 gives the claimed estimate and uniqueness.

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

A global H² bound for the Poisson adjoint on a C² domain

Statement

Assume Countable Choice. Let n≥2, let Ω⊂Rn be a bounded C2 domain, let g∈L2(Ω), and let z∈H01(Ω) be a weak solution of −Δz=g with zero Dirichlet data. Suppose a Poincaré constant CP is specified such that ∥v∥L2(Ω)≤CP∥∇v∥L2(Ω)(v∈H01(Ω)). Then z∈H2(Ω) and ∥z∥H2(Ω)≤Creg(1+CP2)∥g∥L2(Ω), where Creg is the constant from the global H² Dirichlet regularity theorem for the coefficient matrix I and zero lower-order coefficients. The Poincaré inequality is an explicit hypothesis here; this item does not import a stronger domain or axiom branch for it.

Facts & Assumptions

Given: Countable Choice; the bounded C2 domain; g∈L2(Ω); the zero-trace weak equation ∫Ω∇z⋅∇v‾ dx=∫Ωgv‾ dx(v∈H01(Ω)); and the displayed Poincaré inequality with constant CP.

[F1]

A zero-trace weak solution of a divergence-form problem is an H01 class satisfying the variational equation for every H01 test function (Weak Dirichlet solutions for a divergence-form operator).

[F2]

For a bounded C2 domain, coefficients aij∈W1,∞, bi,c∈L∞, ellipticity, g∈L2, and a zero-trace weak solution, the global theorem gives ∥z∥H2≤C(∥g∥L2+∥z∥L2); its statement retains the second term (Global H2 Dirichlet regularity).

[F3]

On real or complex L2, the corresponding integral inner product is well defined and satisfies Cauchy–Schwarz, so ∣∫gz‾∣≤∥g∥L2∥z∥L2 (The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz).

[A1]

The Poincaré inequality with constant CP is assumed exactly as displayed in Given.

Proof

1.1F1F3A1algebra

Test the weak equation with v=z and take real parts. By [F3] and [A1], ∥∇z∥L22=Re⁡∫Ωgz‾ dx≤∥g∥L2∥z∥L2≤CP∥g∥L2∥∇z∥L2. If ∥∇z∥L2=0, [A1] gives z=0 in L2; otherwise divide by ∥∇z∥L2. In either case ∥∇z∥L2≤CP∥g∥L2 and ∥z∥L2≤CP2∥g∥L2.

2.1F2step 1.1algebra∎

The operator −Δ has principal matrix aij=δij, ellipticity constant 1, coefficients in W1,∞, and zero lower order coefficients. Thus [F2] applies to the given weak solution and yields ∥z∥H2≤Creg(∥g∥L2+∥z∥L2). Insert the bound from step 1.1 to obtain the asserted estimate.

Remarks

The estimate uses the global theorem only for the symmetric Poisson operator on its stated bounded C2 domain branch. It does not extend that supplier to general Lipschitz domains or nonsymmetric adjoints.

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

The two-cell hat and quadratic functions belong to H¹₀

Statement

Assume Countable Choice. Let I=(0,1) and define ϕ(x)={2x,0≤x≤12,2(1−x),12≤x≤1,p(x)=12x(1−x). Then ϕ∣I,p∣I∈H01(I)=W01,2(I), the closure of Cc∞(I) in W1,2(I) (Zero-boundary Sobolev space as a norm closure).

Facts & Assumptions

Given: Countable Choice; I=(0,1), the piecewise linear hat function ϕ, and the quadratic p displayed in Statement.

[F1]

A W1,2 function is an L2 class with an L2 weak derivative, defined by integration against compactly supported smooth tests (Integer-order Sobolev spaces and their norms).

[F2]

W01,2(I) is the closure of Cc∞(I) in the W1,2 norm (Zero-boundary Sobolev space as a norm closure).

[F3]

A smooth function and each of its classical derivatives are weak derivatives under Countable Choice (Classical derivatives agree with weak derivatives).

[F4]

The smooth step σ is smooth, equals 0 on (−∞,0] and 1 on [1,∞), takes values in [0,1], and is given by σ(t)=β(t)/(β(t)+β(1−t)) (The standard smooth step function).

[F6]

A C1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue-measurable integrands when Countable Choice holds (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions).

[F8]

For complex L2 functions, ∫∣fg∣≤∥f∥2∥g∥2, so these products are integrable and the pairing is bounded (Complex Holder, Minkowski, and the quotient norm).

[F9]

For an integrable real function f, ∫f=∫f+−∫f− (Integrable real and complex functions, and their integrals).

[A1]

Countable Choice is assumed by the Sobolev, zero-boundary, classical weak derivative and C1 integral-change suppliers used here (The Axiom of Countable Choice (ACω)).

Proof

1.1F4F5F6F9F10givenA1algebra

Put ζ(t)=1−2σ(t). Formula [F4] gives σ(1−t)=1−σ(t) on [0,1], hence ζ(1−t)=−ζ(t). Let T(t)=1−t on I; it is a C1 diffeomorphism with ∣T′(t)∣=1. The continuous functions ζ+=max⁡(ζ,0) and ζ−=max⁡(−ζ,0) satisfy 0≤ζ±≤1, and [F10] gives ∫Iζ±≤∫I1I=λ1(I)=1, so both are integrable. Applying [F6] separately to these nonnegative functions gives ∫Iζ+=∫Iζ+(1−t)=∫Iζ−, where the last equality uses antisymmetry. By [F9], ∫Iζ=∫Iζ+−∫Iζ−=0. For 0<ε<1/6, define gε(x)=2ζ((x−1/2+ε)/(2ε)) and qε(x)=∫0xgε(t) dt. By [F4]–[F5], gε is smooth, equals 2 for x≤1/2−ε and −2 for x≥1/2+ε. Applying [F6] separately to ζ+ and ζ− under x=1/2−ε+2εt, and subtracting by [F9], gives the transition integral 4ε∫01ζ=0; the two constant pieces cancel, so ∫01gε=0. For h≠0 with x+h∈[0,1], the difference quotient of qε is the average of gε between x and x+h; its difference from gε(x) is bounded by sup⁡∣t−x∣≤∣h∣∣gε(t)−gε(x)∣, which tends to zero by continuity. Thus qε′=gε and qε is smooth. It vanishes at both endpoints and agrees with ϕ outside (1/2−ε,1/2+ε). On that interval, ∣qε′−ϕ′∣≤4 almost everywhere, so ∥qε′−ϕ′∥22≤32ε. Also ∣qε−ϕ∣≤8ε there and the difference vanishes outside, so ∥qε−ϕ∥22≤128ε3.

2.1F1F3F8A1givenstep 1.1algebra

By [F3], each qε has weak derivative gε. The convergence estimates in step 1.1 and [F8] allow passage to the limit in ∫Iqεψ′=−∫Igεψ for every ψ∈Cc∞(I), giving ∫Iϕψ′=−∫Iϕ′ψ, where ϕ′=2 on the left half and ϕ′=−2 on the right half. Thus ϕ∈W1,2(I). The polynomial p is smooth with p′=1/2−x and both p,p′∈L2(I), so [F1] and [F3] give p∈W1,2(I).

2.2F2F4F5F7A1step 1.1algebra

Let Cσ=sup⁡[0,1]∣σ′∣<∞ by [F7], and define ηε(x)=σ(x/ε−1)σ((1−x)/ε−1). By [F4]–[F5], this smooth cutoff vanishes for x≤ε and x≥1−ε, equals 1 on [2ε,1−2ε], and ∣ηε′∣≤2Cσ/ε. For the same ε, qε=2x on (0,2ε) and qε=2(1−x) on (1−2ε,1). Thus ηεqε∈Cc∞(I), ∣qε∣≤4ε and ∣qε′∣=2 on Eε=(0,2ε)∪(1−2ε,1). The function error has squared norm at most 64ε3. For the derivative difference (ηε−1)qε′+ηε′qε, the first term has squared norm at most 16ε; the second has modulus at most 8Cσ on a set of length 2ε, so its squared norm is at most 128Cσ2ε. Therefore ηεqε−qε→0 in W1,2(I). Together with step 1.1 this gives ηεqε→ϕ.

3.1F2F4F5F7A1step 2.2algebra

Using the cutoff ηε from step 2.2, its product with p lies in Cc∞(I). Since ∣p(x)∣≤min⁡(x,1−x)/2 and ∣p′(x)∣≤1/2, ∥ηεp−p∥22≤4ε3. The derivative difference is (ηε−1)p′+ηε′p; the first term has squared norm at most ε, and the second is supported on two intervals of total length 2ε with modulus at most 2Cσ, so its squared norm is at most 8Cσ2ε. Hence ηεp→p in W1,2(I).

4.1F2A1step 3.1step 2.2algebra∎

Take the explicit sequence εn=1/(10(n+1)), which lies in (0,1/6) and tends to zero. Steps 3.1 and 2.2 approximate p and ϕ by members of Cc∞(I) along this sequence. By the closure definition [F2], both classes belong to W01,2(I), as claimed.

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

Céa quasi-optimality for coercive conforming Galerkin problems

Statement

Assume Countable Choice. Let V be a real or complex Hilbert space and let a:V×V→K be linear in its first argument, conjugate-linear in its second, bounded by M, and coercive with constant α>0: ∣a(v,w)∣≤M∥v∥V∥w∥V,Re⁡a(v,v)≥α∥v∥V2. Let F:V→K be bounded and conjugate-linear, and let Vh⊆V be finite-dimensional. Then there are unique u∈V and uh∈Vh with a(u,v)=F(v)(v∈V). a(uh,vh)=F(vh)(vh∈Vh). The solutions satisfy ∥u−uh∥V≤Mαinf⁡vh∈Vh∥u−vh∥V. The real bilinear case uses linear functionals and reads Re⁡ as the identity.

Facts & Assumptions

Given: Countable Choice; the Hilbert space V; the bounds M,α for a; a bounded conjugate-linear F; and a finite-dimensional subspace Vh⊆V.

[F1]

Boundedness and coercivity mean the two displayed inequalities, with a linear in the first slot and conjugate-linear in the second (Bounded, coercive and symmetric sesquilinear forms).

[F2]

A Hilbert space is complete in its induced norm (Hilbert space).

[F3]

A finite-dimensional normed subspace, including the zero subspace, is closed in its ambient normed space (A finite-dimensional normed subspace is closed).

[F4]

Under Countable Choice, Lax–Milgram gives a unique solution for a bounded coercive form and bounded conjugate-linear data (The Lax--Milgram theorem, The Axiom of Countable Choice (ACω)).

[F5]

For a conforming subspace, the continuous and restricted discrete variational equations imply a(u−uh,vh)=0 for every vh∈Vh (Galerkin orthogonality for conforming approximations).

Proof

1.1F1F2F4given

Apply [F4] on V; its hypotheses are exactly the boundedness, coercivity, Hilbert, and datum assumptions in Given. This gives a unique u∈V with a(u,v)=F(v) for all v∈V.

1.2F2F3given

Fix a finite ordered basis of Vh. By [F3], Vh is closed in V. A Cauchy sequence in Vh is Cauchy in V, so [F2] gives a limit in V; the closedness puts the limit in Vh. The restricted inner product is complete, so Vh is Hilbert, also when Vh={0}.

2.1F1F2F4step 1.2given

The restrictions of a and F to Vh retain the same bounds M and α, and F∣Vh is bounded. Apply [F4] on the Hilbert space from step 1.2. This gives a unique uh∈Vh satisfying the discrete equations.

3.1F5step 1.1step 2.1

By [F5], with e:=u−uh, we have a(e,wh)=0 for every wh∈Vh.

4.1F1F5step 3.1algebra

Fix any vh∈Vh. Since u−vh=e+(uh−vh) and uh−vh∈Vh, [F5] gives a(e,e)=a(e,u−vh)−a(e,uh−vh)=a(e,u−vh). Coercivity and boundedness therefore give α∥e∥V2≤Re⁡a(e,e)≤∣a(e,u−vh)∣≤M∥e∥V∥u−vh∥V.

5.1step 4.1algebra∎

If e=0, the claimed estimate is immediate. Otherwise divide step 4.1 by α∥e∥V and then take the infimum over all vh∈Vh. This proves Céa's estimate.

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

Hermitian Galerkin solutions are best in the energy norm

Statement

Assume the hypotheses and notation of Céa quasi-optimality for coercive conforming Galerkin problems, and suppose additionally that a is Hermitian: a(v,w)=a(w,v)‾. Then ∥v∥a:=a(v,v) is the energy norm and the Galerkin solution is its best approximation: ∥u−uh∥a=inf⁡vh∈Vh∥u−vh∥a.

Facts & Assumptions

Given: The bounded coercive Galerkin setting of the cited Céa theorem and the additional Hermitian identity for a.

[F1]

The Céa theorem supplies unique continuous and discrete solutions (Céa quasi-optimality for coercive conforming Galerkin problems).

[F2]

The error u−uh is orthogonal to Vh in the form a (Galerkin orthogonality for conforming approximations).

[F3]

A bounded coercive form is Hermitian exactly when a(v,w)=a(w,v)‾; coercivity gives Re⁡a(v,v)≥α∥v∥V2 (Bounded, coercive and symmetric sesquilinear forms).

Proof

1.1F3given

Hermitian symmetry makes a(v,v) real, and coercivity makes it positive for every nonzero v. Thus a is an inner product and ∥⋅∥a is its induced norm.

1.2F2F3given

Put e=u−uh and, for arbitrary vh∈Vh, put ηh=uh−vh. By [F2], a(e,ηh)=0; Hermitian symmetry gives a(ηh,e)=a(e,ηh)‾=0.

2.1F2F3step 1.2algebra

Since u−vh=e+ηh, sesquilinearity and step 1.2 give ∥u−vh∥a2=a(e+ηh,e+ηh)=∥e∥a2+∥ηh∥a2≥∥e∥a2. Therefore ∥u−uh∥a≤∥u−vh∥a for every vh∈Vh.

3.1F1step 2.1algebra∎

Taking the infimum in step 2.1 gives one inequality. The choice vh=uh gives the reverse inequality, so equality holds.

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

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.

CorollaryStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Primal H¹ approximation on shape-regular affine finite-element meshes

Statement

Assume Countable Choice. Let d≥2, let Ω⊂Rd be a bounded polyhedral open set with a matching shape-regular affine simplicial mesh family {Th}, and set h:=max⁡K∈ThhK≤1. Fix an integer r≥1. On the reference simplex let (S^d,P^,Σ^) be an unisolvent real scalar finite element whose finite-dimensional local space P^ consists of polynomials and contains Pr. Assume each degree of freedom has a bounded linear extension to Wr+1,2(S^d), and let I^ be its interpolant. Suppose there is a global map Ih whose restriction to each cell is the affine pullback of I^, and that Ihu∈Vh for the conforming discrete space Vh⊂H01(Ω) whenever u∈Wr+1,2(Ω)∩H01(Ω), where H01(Ω) is the closure of Cc∞(Ω) in W1,2(Ω) (Zero-boundary Sobolev space as a norm closure). Then a constant C independent of h and u satisfies ∥u−Ihu∥H1(Ω)≤Chr∣u∣Wr+1,2(Ω). The global conformity and zero-boundary mapping property of Ih are explicit hypotheses; this estimate does not assert them for arbitrary degrees of freedom.

Facts & Assumptions

Given: Countable Choice; the exact matching affine mesh convention; a reference element with Pr⊆P^ and bounded degrees of freedom on Wr+1,2; the cellwise affine interpolation formula; and the stated global mapping property Ihu∈Vh.

[F1]

An unisolvent reference element has a unique linear interpolation operator that reproduces every polynomial in its finite-element space (Reference finite elements and unisolvent degrees of freedom, Unisolvent degrees of freedom define a unique reference interpolant).

[F2]

On the reference simplex, for real-valued w∈Wr+1,2 there is one q∈Pr with ∥w−q∥Wm,2≤C∣w∣Wr+1,2 for every integer 0≤m≤r+1: use polynomial parameter r+1 and s=r+1 in Bramble–Hilbert approximation on a reference simplex, whose derivative-mean polynomial is independent of s.

[F3]

Affine pullback and pushforward transform order-m Sobolev seminorms by the corresponding powers of A and A−1 and determinant factors (Affine pullback of weak derivatives and Sobolev seminorms).

[F4]

Shape regularity gives ∥AK∥≤ChK, ∥AK−1∥≤ChK−1, and det⁡AK≍hKd (Shape regularity controls affine simplex geometry).

[F5]

Countable Choice is assumed by the Sobolev and affine-change suppliers used in [F2]–[F4] and by the Lebesgue measure suppliers in [F6] (The Axiom of Countable Choice (ACω)).

Proof

1.1F1givenalgebra

On the reference cell write I^w=∑i=1Nσ^i(w)ϕ^i. Each degree of freedom is bounded on Wr+1,2 by Given, and each fixed polynomial shape function has finite W1,2 norm. Thus ∥I^w∥W1,2≤C∥w∥Wr+1,2. By [F1], I^q=q for every q∈Pr. For such q, w−I^w=(w−q)−I^(w−q), so ∥w−I^w∥Wm,2≤∥w−q∥Wm,2+C∥w−q∥Wr+1,2(m=0,1).

2.1F2step 1.1

Choose the polynomial q∈Pr supplied by [F2]. Since m≤1≤r+1, [F2] bounds both terms in step 1.1 by C∣w∣Wr+1,2. Hence the reference-cell interpolation error obeys ∥w−I^w∥Wm,2≤C∣w∣Wr+1,2 for m=0,1.

3.1F3F4F5step 2.1algebra

For a cell K with affine matrix AK, apply [F3] to transform the reference error and the order-(r+1) derivative seminorm back to K. The determinant factors cancel; the remaining factor is bounded by C∥AK−1∥m∥AK∥r+1≤ChKr+1−m by [F4]. Therefore ∥u−IKu∥L2(K)≤ChKr+1∣u∣Wr+1,2(K),∣u−IKu∣W1,2(K)≤ChKr∣u∣Wr+1,2(K).

4.1givenF4F5F6step 3.1algebra∎

Let Eh:=⋃K∈Th∂K, a finite union of simplex facets. Each facet lies in a bounded affine hyperplane; choose a coordinate with nonzero normal component and write that hyperplane as the graph of an affine function over a bounded box in Rd−1. Partition the base box into at most C0Nd−1 boxes of side 1/N. The affine function varies by at most C1/N on each, so each graph piece lies in a slightly enlarged half-open d-box of volume at most C2N−d. These elementary-set cover members have total volume at most C0C2/N; the outer-measure definition and box-volume formula give outer measure zero for the facet, and completeness makes it Lebesgue-null. Thus Eh is null, and Ω∖Eh is the disjoint union of the cell interiors by the mesh definition. Square and sum the estimates in step 3.1 over these interiors; the sums of squared Sobolev seminorms equal the corresponding global seminorms. Since hK≤h≤1, the order-zero contribution hKr+1 is at most hr. The global interpolation map in Given takes values in Vh, yielding ∥u−Ihu∥H1(Ω)≤Chr∣u∣Wr+1,2(Ω).

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

The h^(r+s) L² rate under primal and dual approximation

Statement

Assume Countable Choice. Assume the real scalar finite-element setting of Primal H¹ approximation on shape-regular affine finite-element meshes, and set V:=H01(Ω) with its usual H1 norm. Let Vh⊆V be the stated conforming discrete space, let a:V×V→R be the same bounded coercive form as in Céa quasi-optimality for coercive conforming Galerkin problems, and let u∈Wr+1,2(Ω)∩V and uh∈Vh solve the continuous and discrete equations for the same bounded linear datum F:V→R; assume also that Vh is finite-dimensional. The natural inclusion J:V→L2(Ω) obeys ∥Jv∥L2≤∥v∥H1. For e:=J(u−uh), let ze be the adjoint solution from Aubin–Nitsche L² error estimate from adjoint approximation. Suppose there are s∈(0,1], a normed regularity space Rs⊆V for ze, and constants CD,CR independent of h and e such that ∥ze∥Rs≤CR∥e∥L2(Ω). inf⁡wh∈Vh∥ze−wh∥H1(Ω)≤CDhs∥ze∥Rs. Then ∥u−uh∥L2(Ω)≤M2αCFECDCRhr+s∣u∣Wr+1,2(Ω). Here CFE is the primal interpolation constant and M,α are the boundedness and coercivity constants of a. In a full-adjoint Poisson branch, one may take R1=H2(Ω)∩H01(Ω) with the H2 norm, provided both displayed dual bounds hold. The hr+1 rate is conditional on those bounds and the primal approximation bound; no full-adjoint regularity is asserted on an arbitrary Lipschitz domain.

Facts & Assumptions

Given: Countable Choice; the shape-regular affine finite-element spaces and global interpolant of Primal H¹ approximation on shape-regular affine finite-element meshes, the same bounded coercive Galerkin form a and constants M,α, a bounded datum F:V→R, finite-dimensional Vh, the exponent r≥1, the adjoint problem, and the two dual regularity/approximation bounds in Statement. Here H01(Ω) is the zero-boundary Sobolev closure (Zero-boundary Sobolev space as a norm closure) and its usual H1 norm comes from Integer-order Sobolev spaces and their norms.

[F1]

The affine finite-element interpolant has the primal error bound ∥u−Ihu∥H1≤CFEhr∣u∣Wr+1,2 (Primal H¹ approximation on shape-regular affine finite-element meshes).

[F2]

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

[F3]

Under the two dual bounds in [A1], the Aubin–Nitsche estimate gives ∥u−uh∥L2≤MCDCRhs∥u−uh∥H1 (Aubin–Nitsche L² error estimate from adjoint approximation).

[F4]

Under Countable Choice, H1(Ω) is Hilbert in its usual Sobolev norm, and H01(Ω) is its closed Hilbert subspace with the restricted inner product and norm (The Sobolev space H1 is a Hilbert space).

[A1]

The dual regularity and interpolation constants CR,CD are uniform in h and satisfy the two displayed inequalities in Statement.

Proof

1.1F1given

Since Ihu∈Vh by the finite-element approximation hypotheses, inf⁡vh∈Vh∥u−vh∥H1≤∥u−Ihu∥H1≤CFEhr∣u∣Wr+1,2 by [F1].

1.2F3F4A1given

By [F4], V=H01(Ω) is a Hilbert space in its stated H1 norm. Apply the Aubin–Nitsche estimate [F3] with V=H01(Ω) in its H1 norm, CI=CD, and the two dual bounds [A1]. This gives ∥u−uh∥L2≤MCDCRhs∥u−uh∥H1.

2.1F2F4step 1.1

Apply [F2] on the Hilbert space supplied by [F4] to the best-approximation bound in step 1.1. This gives ∥u−uh∥H1≤MαCFEhr∣u∣Wr+1,2.

3.1step 2.1step 1.2algebra∎

Substitute the H1 bound from step 2.1 into step 1.2. This gives ∥u−uh∥L2≤(M2/α)CFECDCRhr+s∣u∣Wr+1,2, including zero error without division. Setting s=1 gives hr+1 under the stated full adjoint hypotheses.

Remarks

The hr+1 conclusion requires a dual approximation estimate of order one for the actual discrete spaces; the primal interpolation item alone does not establish that estimate for every degree and every degree-of-freedom family. A separate global regularity input must also match the actual domain and adjoint operator. The rate is not unconditional on every polyhedral or Lipschitz problem.

5 · Examples, counterexamples and false statements

None yet.

Sources