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.

✓ 6 results · all verified · 2 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 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Variational crimes and Strang lemmas

1 · Prerequisites

2 · Summary

The first Strang estimate treats conforming Galerkin spaces with perturbed forms and loads. Its discrete coercivity is a separate hypothesis, and its form and load defects remain explicit; the load term includes source approximation and data oscillation. The second estimate uses the common comparison space V+Vh and requires a bounded extension of the discrete form there. That extension is not assumed to exist for every penalty or discontinuous Galerkin method.

For curved-domain lifts, the transformed diffusion tensor records the Jacobian and inverse-map factors. Cellwise tensor discrepancies give a form-defect bound. Stability follows only after a separate quantitative smallness condition and on a Hilbert trial space whose norm is the gradient norm; a lift alone gives no geometry rate. The one-dimensional midpoint P1 result combines a direct quadrature defect with interpolation and obtains coercivity from the positive sampled coefficient. The shape-regular affine P1 result assumes bounded reference nodal functionals and keeps the interpolation contribution separate from geometry, quadrature and load defects. Quadrature exactness by itself is not used as a mesh-uniform stability argument.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Variational-crime settings and consistency defects

Definition

Let K∈{R,C}. In the exact variational problem, V is a Hilbert space, a:V×V→K is a bounded coercive sesquilinear form (bilinear when K=R), linear in its first argument and conjugate-linear in its second when K=C, and F:V→K is bounded and has the same linearity in its test argument as the second argument of a. Exact solutions satisfy a(u,v)=F(v) for every v∈V. Boundedness and coercivity have the meanings in Bounded, coercive and symmetric sesquilinear forms.

For a conforming perturbed Galerkin problem, Vh⊆V is a finite-dimensional subspace, ah:Vh×Vh→K and Fh:Vh→K are the discrete form and load, and uh∈Vh solves ah(uh,wh)=Fh(wh). Its discrete coercivity constant is any αh>0 such that Re⁡ah(wh,wh)≥αh∥wh∥V2 for every wh∈Vh. For vh∈Vh, define

δa,h(vh):=sup⁡wh∈Vh∖{0}∣a(vh,wh)−ah(vh,wh)∣∥wh∥V,δF,h:=sup⁡wh∈Vh∖{0}∣F(wh)−Fh(wh)∣∥wh∥V.

If Vh={0}, both defects are defined to be zero. The load defect δF,h includes any source approximation or data oscillation; it is not assumed small or zero without a separate bound.

For a nonconforming problem, the exact space V and finite-dimensional trial space Vh need not satisfy Vh⊆V. Put Xh:=V+Vh and equip it with a norm ∥⋅∥h whose restrictions to V and Vh are norms. The discrete form ah is defined on Vh×Vh, and a bounded extension a~h:Xh×Vh→K means a~h=ah on Vh×Vh and ∣a~h(z,wh)∣≤Mh∥z∥h∥wh∥h. For an exact solution u∈V, define the nonconforming consistency defect

δhnc(u):=sup⁡wh∈Vh∖{0}∣Fh(wh)−a~h(u,wh)∣∥wh∥h,

with value zero if Vh={0}. This residual need not vanish: the exact weak equation is only asserted for tests in V.

Geometry and quadrature defects are components of the appropriate form defect when the implemented form is compared with the pulled-back exact form. No exact Galerkin orthogonality is asserted after replacing the form or test space.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

A bounded form defect preserves discrete coercivity

Statement

Let V be a Hilbert space and let Vh⊆V be a subspace. Suppose the exact form a is coercive with constant α>0 in the norm ∥⋅∥V. Let ah be a discrete form on Vh and suppose

∣ah(vh,vh)−a(vh,vh)∣≤ηh∥vh∥V2(vh∈Vh)

for some ηh≥0. Then ah is coercive with constant at least α−ηh whenever ηh<α. In particular, if ηh≤α/2, then its coercivity constant is at least α/2.

Facts & Assumptions

Given: A Hilbert space V, a subspace Vh, a coercive form a with constant α>0, a discrete form ah, and the diagonal defect bound with constant ηh.

[F1]

Bounded, coercive and symmetric sesquilinear forms: coercivity means Re⁡a(v,v)≥α∥v∥V2; symmetry is not required.

[A1]

For every vh∈Vh, ∣ah(vh,vh)−a(vh,vh)∣≤ηh∥vh∥V2.

Proof

1.1givenF1A1algebra

Fix vh∈Vh. By coercivity [F1] and the defect hypothesis [A1], Re⁡ah(vh,vh)=Re⁡a(vh,vh)+Re⁡(ah(vh,vh)−a(vh,vh))≥(α−ηh)∥vh∥V2.

2.1step 1.1algebra∎

If ηh<α, then α−ηh>0, so the inequality in step 1.1 is precisely coercivity with that constant. If ηh≤α/2, then α−ηh≥α/2.

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

First Strang estimate for conforming perturbed Galerkin problems

Statement

Assume Countable Choice. Let V be a real or complex Hilbert space, a:V×V→K a bounded coercive form with boundedness constant M and coercivity constant α>0, and F:V→K a bounded functional linear in the real case and conjugate-linear in the complex test argument. Let Vh⊆V be finite-dimensional, and let ah:Vh×Vh→K and Fh:Vh→K be bounded, with Fh having the same test-linearity as F, and ah coercive with constant αh>0 in the inherited norm. Both a and ah are sesquilinear (bilinear over R), linear in their first argument and conjugate-linear in their second over C. There are unique exact and discrete solutions u and uh, and

∥u−uh∥V≤inf⁡vh∈Vh((1+M/αh)∥u−vh∥V+δa,h(vh)+δF,hαh),

where the defects are those of Variational-crime settings and consistency defects. For a family of meshes this is a uniform estimate whenever inf⁡hαh>0 and the displayed approximation and defect terms are uniformly controlled. The term δF,h retains source approximation and data oscillation.

Facts & Assumptions

Given: Countable Choice; V,a,F,Vh,ah,Fh with the Hilbert, boundedness, coercivity, and finite-dimensional hypotheses of the Statement.

[F1]

Bounded, coercive and symmetric sesquilinear forms: ∣a(v,w)∣≤M∥v∥V∥w∥V and Re⁡a(v,v)≥α∥v∥V2; the real bilinear case does not require symmetry.

[F2]

The Lax--Milgram theorem under The Axiom of Countable Choice (ACω): a bounded coercive form on a Hilbert space with a bounded functional has a unique solution to its variational equation.

[F3]

A finite-dimensional normed subspace is closed: a finite-dimensional subspace of a normed space is closed; therefore Vh with the inherited inner product is a Hilbert space.

[F4]

Variational-crime settings and consistency defects: δa,h(vh) and δF,h are the indicated suprema of the form and load defects against nonzero tests in Vh.

[A1]

ah is sesquilinear (bilinear over R), with the stated first- and second-argument conventions; it is bounded and Re⁡ah(vh,vh)≥αh∥vh∥V2 on Vh; Fh is bounded.

Proof

1.1F1F2given

The hypotheses on V,a,F are exactly those of [F2], so [F2] gives a unique u∈V satisfying a(u,v)=F(v) for every v∈V.

1.2F2F3A1given

By [F3], Vh is closed in V, hence complete in its inherited Hilbert norm. The restriction of ah is bounded and coercive by [A1], and Fh is bounded; applying [F2] on Vh gives a unique uh∈Vh with ah(uh,wh)=Fh(wh) for every wh∈Vh.

2.1A1step 1.2choose

Fix any vh∈Vh and put eh:=uh−vh. Discrete coercivity and the discrete equation give αh∥eh∥V2≤Re⁡ah(eh,eh)=Re⁡(Fh(eh)−ah(vh,eh)).

3.1F1F4givenstep 2.1algebra

Since eh∈Vh⊆V, the exact equation gives F(eh)=a(u,eh), and Fh(eh)−ah(vh,eh)=[Fh(eh)−F(eh)]+a(u−vh,eh)+[a(vh,eh)−ah(vh,eh)]. The boundedness of a [F1] and the defect definitions [F4] therefore imply αh∥eh∥V2≤(δF,h+M∥u−vh∥V+δa,h(vh))∥eh∥V.

4.1step 3.1algebra∎

If eh=0 the comparison is immediate; otherwise divide step 3.1 by αh∥eh∥V and use ∥u−uh∥V≤∥u−vh∥V+∥eh∥V. This proves the displayed bound for each vh, and taking the infimum proves the theorem.

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

Second Strang estimate with a bounded extension to the comparison space

Statement

Assume Countable Choice. Let V be a real or complex Hilbert space, a:V×V→K a bounded coercive sesquilinear form (bilinear over R), and F a bounded functional with the test-linearity required by a. Let Vh be a finite-dimensional Hilbert space with norm ∥⋅∥h, not necessarily a subspace of V. Suppose the algebraic sum Xh=V+Vh is equipped with a norm extending these norms, and a~h:Xh×Vh→K is a bounded sesquilinear extension of a discrete form ah with bound Mh. Over C, both forms are linear in the first argument and conjugate-linear in the second; over R, they are bilinear. Assume ah is coercive on Vh with constant αh>0, and let Fh be bounded on Vh with the matching test-linearity. The exact and discrete equations have unique solutions u and uh, and

∥u−uh∥h≤(1+Mh/αh)inf⁡vh∈Vh∥u−vh∥h+δhnc(u)/αh,

where δhnc(u)=sup⁡wh∈Vh∖{0}∣Fh(wh)−a~h(u,wh)∣/∥wh∥h when Vh≠{0}, and δhnc(u):=0 when Vh={0}. The estimate requires the bounded extension and does not assert that every nonconforming, penalty, or discontinuous Galerkin form has one.

For a family of these problems, suppose Mh≤M‾<∞ and αh≥α‾>0 uniformly. Writing Eh=inf⁡vh∈Vh∥u−vh∥h, the uniform bound is ∥u−uh∥h≤(1+M‾/α‾)Eh+δhnc(u)/α‾. Thus uniform control of Eh and δhnc(u) gives a uniform error budget; if both tend to zero, the errors tend to zero, and if both are O(hp) for a fixed p>0, the error is O(hp). No rate is inferred without those approximation, residual, and stability bounds.

Facts & Assumptions

Given: Countable Choice; the exact Hilbert problem on V; the nonconforming space Vh and common comparison norm on Xh; a bounded extension a~h; discrete coercivity αh>0; and a bounded discrete load.

[F1]

The Lax--Milgram theorem under The Axiom of Countable Choice (ACω): the exact bounded coercive Hilbert problem has a unique solution.

[F2]

By hypothesis, a~h is sesquilinear with the stated slot conventions (bilinear over R). By definition, a~h agrees with ah on Vh×Vh and ∣a~h(z,wh)∣≤Mh∥z∥h∥wh∥h on Xh×Vh (Variational-crime settings and consistency defects).

[A1]

Re⁡ah(vh,vh)≥αh∥vh∥h2 for every vh∈Vh.

[A2]

δhnc(u) is the consistency residual at the exact solution, as defined in Variational-crime settings and consistency defects.

Proof

1.1F1given

Apply [F1] on V to obtain the unique exact solution u.

1.2F1A1given

The finite-dimensional Hilbert problem on Vh has bounded coercive form ah and bounded load Fh, so the same Lax–Milgram theorem [F1] gives a unique uh∈Vh.

2.1A1step 1.2choose

Fix vh∈Vh and set eh:=uh−vh. Then eh∈Vh, and [A1] gives αh∥eh∥h2≤Re⁡ah(eh,eh)=Re⁡(Fh(eh)−a~h(vh,eh)).

3.1F2A1A2step 2.1algebra

By the discrete equation and extension identity, ah(eh,eh)=a~h(u−vh,eh)+Fh(eh)−a~h(u,eh). The extension bound [F2] and residual definition [A2] therefore give αh∥eh∥h2≤(Mh∥u−vh∥h+δhnc(u))∥eh∥h.

4.1step 3.1givenalgebra∎

If eh=0 there is nothing to divide by; otherwise divide step 3.1 by αh∥eh∥h. The triangle inequality gives ∥u−uh∥h≤(1+Mh/αh)∥u−vh∥h+δhnc(u)/αh. Taking the infimum over vh proves the per-mesh bound. For the stated family, replace Mh/αh by M‾/α‾ and 1/αh by 1/α‾. The resulting constants are independent of h, yielding the stated uniform, convergence and rate consequences when the two explicit error terms have the corresponding control.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Geometry lift and transformed elliptic tensor

Definition

Assume Countable Choice. Let Ωh,Ω⊆Rd be open, and let Φh:Ωh→Ω be a C1 diffeomorphism. Write Jh(y):=∣det⁡DΦh(y)∣>0. Let A:Ω→Rd×d be Lebesgue measurable, real symmetric almost everywhere, and satisfy λI⪯A(x)⪯ΛI almost everywhere, for constants 0<λ≤Λ<∞. The physical exact form on real-valued functions with square-integrable gradients is a(U,W):=∫Ω∇U(x)TA(x)∇W(x) dx. The pulled-back exact tensor and form are

Bh(y):=Jh(y)DΦh(y)−1A(Φh(y))DΦh(y)−T,ahlift(v,w):=∫Ωh∇v(y)TBh(y)∇w(y) dy.

The lifted form is defined for real-valued v,w with measurable gradients and finite pulled-back energies ∫Ωh∇vTBh∇v<∞ and ∫Ωh∇wTBh∇w<∞. The pointwise Cauchy–Schwarz inequality for the positive tensor Bh bounds the absolute cross density by the product of the square roots of these energy densities, which is integrable by Holder's inequality for integrals, including the endpoint cases. Square-integrability of ∇v,∇w alone does not guarantee these energy conditions for an arbitrary diffeomorphism.

The geometry tensor discrepancy of an implemented tensor B~h on a cell K⊂Ωh is ηG,K:=∥Bh−B~h∥L∞(K;op), where ∥⋅∥op is the Euclidean operator norm. The geometry-lifted form defect is the difference between ahlift and the form using B~h, on pairs for which both displayed cross densities are absolutely integrable. No meshwise approximation rate is part of this definition.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Cellwise geometry tensor gaps bound form error and stability loss

Statement

Assume the geometry setting of Geometry lift and transformed elliptic tensor, and suppose Ωh has a nonempty finite measurable partition into bounded cells {K}, with hK:=diam⁡(K) and h:=max⁡KhK. For real-valued U,W∈C1(Ω) with ∇U,∇W∈L2(Ω), put v:=U∘Φh and w:=W∘Φh, and assume their gradients are square-integrable on each cell. Then the physical exact form a(U,W) pulled back by Φh is ahlift(v,w). Suppose the implemented tensors B~h are real symmetric and measurable, with ηG,K<∞. The form a~h(v,w):=∑K∫K∇vTB~h∇w satisfies

∣ahlift(v,w)−a~h(v,w)∣≤∑KηG,K∥∇v∥L2(K)∥∇w∥L2(K)≤ηG∥∇v∥L2(Ωh)∥∇w∥L2(Ωh),

where ηG:=max⁡KηG,K. If ηG,K≤CGhKs for s>0, the form defect is at most CGhs∥∇v∥2∥∇w∥2. Moreover, if Jh≥j−>0, 0<L, and ∥DΦh∥L∞,op≤L, then Bh⪰βI with β=j−λ/L2. For the stability conclusion, let Zh be a real Hilbert space of pullback functions with inner product ∫Ωh∇v⋅∇w, so its norm is ∥∇v∥L2(Ωh). Restrict the exact and implemented forms to Zh. If ηG≤β/2, the implemented form is coercive on Zh with constant at least β/2. The rate assumption is separate from the lift; neither it nor completeness of the gradient-norm space follows from a lift alone.

Facts & Assumptions

Given: Countable Choice; the geometry definition; a nonempty finite measurable cell partition; physical functions U,W and their pullbacks v,w as stated; a real symmetric measurable tensor A with λI⪯A⪯ΛI; a C1 diffeomorphism with positive Jacobian; measurable symmetric implemented tensors B~h with finite cell discrepancies; and, for the coercivity conclusion, the real Hilbert space Zh with the gradient inner product specified in the Statement.

[F1]

Geometry lift and transformed elliptic tensor: Bh=JhDΦh−1(A∘Φh)DΦh−T and ηG,K=∥Bh−B~h∥L∞(K;op).

[F2]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): differentiating U∘Φh gives ∇(U∘Φh)=DΦhT(∇U∘Φh), so ∇U∘Φh=DΦh−T∇(U∘Φh).

[F3]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: under Countable Choice, a C1 diffeomorphism changes variables by the positive factor Jh for every nonnegative measurable integrand.

[F5]

A bounded form defect preserves discrete coercivity: a diagonal perturbation bounded by η∥v∥2 lowers a coercivity constant by at most η.

[F6]

Bounded, coercive and symmetric sesquilinear forms: coercivity in a real Hilbert space means a(v,v)≥α∥v∥2 for every vector.

[F7]

Nonnegative Lebesgue integration over measurable sets is a measure (The indefinite integral of a nonnegative measurable function is a measure), and the integral is linear on L1 (The Lebesgue integral is linear on L1(μ)). Finite products and sums of measurable real functions are measurable (Arithmetic and lattice operations preserve measurability whenever they are defined).

[A3]

Countable Choice is the explicit assumption of the change-of-variables supplier [F3] (The Axiom of Countable Choice (ACω)).

[A1]

Jh≥j−>0, 0<L, and ∥DΦh∥L∞,op≤L.

[A2]

On each cell K, ηG,K≤CGhKs for the stated optional rate conclusion.

Proof

1.1F1F2F3A3givenalgebra

Set v=U∘Φh and w=W∘Φh. By [F2], ∇U∘Φh=DΦh−T∇v and likewise for W. Under the Countable Choice hypothesis [A3], apply [F3] to the nonnegative measurable energy density ∇UTA∇U to obtain a(U,U)=ahlift(v,v); the same applies to W and U+W. The physical energies are finite since A⪯ΛI and all three physical gradients are in L2. Their nonnegative pulled-back energy densities therefore have finite integrals. The pointwise polarization identity expresses the pulled-back cross density as half the difference of these three integrable nonnegative densities, hence makes that cross density absolutely integrable. The physical cross density is integrable by the same argument. Since A and Bh are symmetric, the real polarization identity 2a(U,W)=a(U+W,U+W)−a(U,U)−a(W,W) yields a(U,W)=ahlift(v,w).

1.2F1F3A1givenalgebra

For every vector ξ, [A1] and A⪰λI imply ξTBhξ=Jh(DΦh−Tξ)TA(Φh)(DΦh−Tξ)≥j−λ∥DΦh−Tξ∥2≥(j−λ/L2)∥ξ∥2. Thus Bh⪰βI. The change-of-variables supplier [F3] carries the null exceptional set in the a.e. coefficient bounds to a null set under Φh, so these estimates hold almost everywhere after pullback. These same bounds also make the lifted forms finite on every Zh vector with an L2 gradient: all singular values of DΦh are at most L and their product is Jh≥j−, so ∥DΦh−1∥op≤Ld−1/j− almost everywhere; also Jh≤Ld. Hence ∥Bh∥L∞,op≤ΛL3d−2/j−2, and the finite cellwise discrepancies make B~h essentially bounded as well.

2.1F1F4F7A2step 1.1algebra

The finite measurable partition and the assumed finite cellwise squared-gradient integrals give global square integrability: apply the measure property [F7] to ∣∇v∣2 and ∣∇w∣2 to obtain ∥∇v∥22=∑K∥∇v∥L2(K)2 and the analogous identity for w. The tensor and gradient entries are measurable, so the defect density q=∇vT(Bh−B~h)∇w is measurable by [F7]. On each cell ∣q∣≤ηG,K∣∇v∣∣∇w∣ almost everywhere; [F4] makes this an integrable majorant, and the finite sum makes q globally L1. Step 1.1 has established that the exact lifted cross density is L1. Thus the implemented cross density, the exact cross density minus q, is also L1. Their finite indicator decompositions over the partition and L1 linearity [F7] justify subtracting and summing cell integrals. The operator-norm estimate and integral Cauchy–Schwarz [F4] then give ∣∫K∇vT(Bh−B~h)∇w∣≤ηG,K∥∇v∥L2(K)∥∇w∥L2(K). Summing over cells and using ηG,K≤ηG together with finite Cauchy–Schwarz [F4] proves both displayed form-defect bounds; under [A2], ηG≤CGhs.

3.1F5F6givenstep 2.1step 1.2algebra∎

The diagonal estimate in step 2.1 has constant ηG. On Zh, the exact lifted form is coercive with constant β by step 1.2 and [F6]. Apply [F5] with V=Vh=Zh to obtain coercivity of the implemented form with constant at least β−ηG≥β/2.

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

Perturbed conforming solves are controlled by the exact Galerkin baseline

Statement

Assume Countable Choice and the exact conforming Galerkin hypotheses of Hermitian Galerkin solutions are best in the energy norm, with Hermitian form a bounded by M in ∥⋅∥V. Let uhG be the exact Galerkin solution. Let ah be a bounded discrete form on the same Vh, coercive in ∥⋅∥V with constant αh>0, and let Fh be a bounded discrete load with the matching test-linearity. Its unique perturbed solution u~h satisfies

∥u−u~h∥a≤inf⁡vh∈Vh∥u−vh∥a+Mαhρh,

where ρh:=sup⁡wh≠0∣Fh(wh)−ah(uhG,wh)∣/∥wh∥V, defined as zero if Vh={0}. This uses the exact Galerkin solution as a baseline; ρh must be bounded from the actual form and load defects.

Facts & Assumptions

Given: The Countable-Choice bounded coercive Hermitian Galerkin setting, its exact Galerkin solution uhG, and a bounded coercive perturbed form/load with the stated residual ρh, including its zero-space convention.

[F1]

Hermitian Galerkin solutions are best in the energy norm: ∥u−uhG∥a=inf⁡vh∈Vh∥u−vh∥a.

[F2]

The Lax--Milgram theorem under The Axiom of Countable Choice (ACω): the perturbed bounded coercive form on the finite-dimensional Hilbert space has a unique solution u~h.

[F3]

Bounded, coercive and symmetric sesquilinear forms: boundedness gives ∥z∥a2=a(z,z)≤M∥z∥V2 and discrete coercivity gives Re⁡ah(z,z)≥αh∥z∥V2.

[A1]

ρh is the residual supremum in the Statement, with the stated value zero when Vh={0}.

Proof

1.1F2given

The perturbed form and load are bounded and coercive on Vh, so [F2] gives a unique u~h∈Vh satisfying ah(u~h,wh)=Fh(wh) for all wh∈Vh.

2.1F3A1step 1.1algebra

Put eh:=u~h−uhG. Use the discrete equation with test eh and the residual definition [A1] to obtain αh∥eh∥V2≤Re⁡ah(eh,eh)=Re⁡(Fh(eh)−ah(uhG,eh))≤ρh∥eh∥V.

3.1F3step 2.1algebra

If eh=0 the claim is immediate; otherwise divide step 2.1 by αh∥eh∥V and use [F3] to get ∥eh∥a≤Mρh/αh.

4.1F1step 3.1algebra∎

The triangle inequality and [F1] now give ∥u−u~h∥a≤∥u−uhG∥a+∥eh∥a≤inf⁡vh∈Vh∥u−vh∥a+Mρh/αh, as required.

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

One-dimensional P1 interpolation has a first-derivative error bound

Statement

Assume Countable Choice. Let 0=x0<x1<⋯<xN=1 be a finite interval partition, h:=max⁡j(xj+1−xj), and u∈C2([0,1]). Let Ihu be the continuous piecewise-linear function with nodal values Ihu(xj)=u(xj). Then

∥(u−Ihu)′∥L2(0,1)≤h∥u′′∥L∞(0,1).

If u(0)=u(1)=0, then Ihu also vanishes at both endpoints.

Facts & Assumptions

Given: Countable Choice, a finite interval partition, h its maximum cell length, and u∈C2([0,1]).

[F1]

The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): if a differentiable function has an integrable derivative, its increment is the integral of that derivative.

[F2]

If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a): for an integrable function bounded in absolute value by C, the integral over an interval of length ℓ has absolute value at most Cℓ.

[F3]

Under Countable Choice, for every nonnegative measurable q the map E↦∫Eq is a measure, hence finitely additive on disjoint measurable cells (The indefinite integral of a nonnegative measurable function is a measure). Nonnegative Lebesgue integrals preserve bounds (Monotonicity and nonnegative homogeneity of the nonnegative integral); a constant bound integrates as that constant times the interval length by the simple-integral formula and the box-measure theorem (The nonnegative integral agrees with the simple integral on simple functions, A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included), whose interval-measure statement assumes Countable Choice (The Axiom of Countable Choice (ACω)).

[F4]

Extreme value theorem: a continuous real function on a nonempty compact subset of R attains a greatest and a least value: a continuous function on the compact interval [0,1] has a finite maximum and minimum.

Proof

1.1givenF1construct

Fix a cell K=[a,b]=[xj,xj+1] of length hK. Its interpolant slope is sK=(u(b)−u(a))/hK=hK−1∫abu′(t) dt by [F1].

2.1givenF1F2step 1.1algebra

For every x∈K, u′(x)−sK=hK−1∫ab(u′(x)−u′(t)) dt. A second use of [F1] and then [F2] gives ∣u′(x)−u′(t)∣≤∥u′′∥∞∣x−t∣≤hK∥u′′∥∞, hence ∣u′(x)−sK∣≤hK∥u′′∥∞.

3.1F3F4givenstep 2.1algebra∎

The continuous function ∣u′′∣ has a finite maximum by [F4]. On each open cell K∘=(xj,xj+1), q=∣u′−sK∣2 is continuous and hence measurable; define q=0 at the finitely many nodes. This gives a nonnegative measurable representative of the squared derivative error, bounded by the finite cell bounds in step 2.1. The Lebesgue interval-measure and monotonicity facts in [F3] give ∫K∣(u−Ihu)′∣2≤hK3∥u′′∥∞2. The open cells are disjoint and their complement consists of finitely many nodes of Lebesgue measure zero. Finite additivity of the measure E↦∫Eq from [F3], with zero contribution from the nodes where q=0, therefore identifies the global Lebesgue squared norm with the sum of these cell integrals. Using hK≤h and ∑KhK=1 gives ∥(u−Ihu)′∥22≤h2∥u′′∥∞2. Taking nonnegative square roots proves the estimate; endpoint values follow from the nodal definition.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Zero-boundary Poincaré inequality on the unit interval

Statement

Assume Countable Choice. For every real v∈H01(0,1),

∥v∥L2(0,1)≤∥v′∥L2(0,1).

Consequently ∥v∥H1(0,1)≤2 ∥v′∥L2(0,1).

Facts & Assumptions

Given: Countable Choice and v in the closure of Cc∞(0,1) in the H1 norm.

[F1]

Zero-boundary Sobolev space as a norm closure: for every ε>0, some φ∈Cc∞(0,1) satisfies ∥v−φ∥H1<ε.

[F3]

On [0,1], Countable Choice gives λ1([0,1])=λ1((0,1))=1 (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included, The Axiom of Countable Choice (ACω)). Hence Holder gives ∫01∣g∣≤∥g∥L2 and ∥1∥L2=1 (Holder's inequality for integrals, including the endpoint cases).

[F4]

Integer-order Sobolev spaces and their norms: for k=1,p=2, ∥v∥H12=∥v∥22+∥v′∥22.

[F5]

The nonnegative Lebesgue integral is monotone (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F6]

Continuous functions on closed intervals are bounded and Riemann integrable (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion). Under Countable Choice their Riemann and Lebesgue integrals agree (A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral).

Proof

1.1F2F3F5F6givenalgebra

Extend φ∈Cc∞(0,1) smoothly by zero to [0,1]. Its derivative is continuous on every [0,x] with 0<x≤1, so [F6] makes it Riemann integrable and identifies its Riemann integral with its Lebesgue integral. Thus [F2] gives φ(x)=∫0xφ′(t) dt; at x=0 both sides are zero. Hence ∣φ(x)∣≤∫01∣φ′(t)∣ dt≤∥φ′∥2 by [F3]. Monotonicity [F5] and λ1((0,1))=1 give ∥φ∥22=∫01∣φ∣2≤∥φ′∥22, so ∥φ∥2≤∥φ′∥2.

2.1F1F4step 1.1algebra∎

Given ε>0, choose φ by [F1]. The triangle inequality and step 1.1 give ∥v∥2≤∥φ∥2+ε≤∥φ′∥2+ε≤∥v′∥2+2ε. Since this holds for every positive ε, ∥v∥2≤∥v′∥2. By [F4], squaring and adding the derivative norm proves the H1 estimate.

LemmaStatement: Literature-sourcedProof: AI-generatedOpen item page →

Midpoint quadrature defect for one-dimensional P1 stiffness

Statement

Assume Countable Choice. Let 0=x0<⋯<xN=1 be a finite partition with cells K=[xj−1,xj], cell lengths hK, and maximum h. Let A∈C2([0,1]), and let vh,wh be continuous piecewise-linear functions. Write vK′,wK′ for their constant cell slopes and take their a.e. derivatives as L2 representatives. Define the exact and midpoint stiffness forms by

a(vh,wh):=∫(0,1)A(x)vh′(x)wh′(x) dλ1(x),ah(vh,wh):=∑KhKA(mK)vK′wK′,

where mK is the cell midpoint and the cell derivatives are constant. Then

∣a(vh,wh)−ah(vh,wh)∣≤h224∥A′′∥L∞(0,1)∥vh′∥L2(0,1)∥wh′∥L2(0,1).

Moreover, ∥vh′∥L2(0,1)2=∑KhK∣vK′∣2, and likewise for wh′.

The midpoint rule is exact for this stiffness integrand when A is affine; for a general C2 coefficient the displayed defect is retained. The bound is exact-arithmetic quadrature error, separate from roundoff.

Facts & Assumptions

Given: Countable Choice, the finite partition, A∈C2([0,1]), and continuous piecewise-linear vh,wh.

[F1]

Composite midpoint rule on a uniform grid: on one cell K, the midpoint value times hK is the one-panel midpoint quadrature rule.

[F2]

Composite midpoint error bound for a twice continuously differentiable function: for g∈C2(K), the one-panel error is at most hK3∥g′′∥L∞(K)/24.

[F4]

Triangle inequality for finite sums: the absolute value of the sum of cell errors is bounded by their absolute values' sum.

[F6]

Extreme value theorem: a continuous real function on a nonempty compact subset of R attains a greatest and a least value: the continuous function ∣A′′∣ attains a finite maximum on [0,1]. Because every relative interval has positive Lebesgue measure by [F8], this maximum is its essential supremum (The essential supremum of a measurable function with respect to a measure, The space L∞(μ) of essentially bounded measurable functions).

[F7]

The L2 norm is the square root of the integral of the square (The function space Lp(μ) for 0<p<∞, The space Lp(μ) as the quotient by null functions). A finite-valued measurable function has simple integral ∑jcjλ1(Ej) (Nonnegative simple measurable functions, The integral of a nonnegative simple function), and its nonnegative Lebesgue integral agrees with that value (The nonnegative integral agrees with the simple integral on simple functions).

[F8]

Under Countable Choice, every interval in [0,1] has Lebesgue measure equal to its length; in particular each open cell K∘=(xj−1,xj) has measure hK and each mesh node is null (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included, The Axiom of Countable Choice (ACω)).

[F9]

Under Countable Choice, a bounded Riemann-integrable function on [0,1] has the same Riemann and Lebesgue integrals (A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral, The Axiom of Countable Choice (ACω)).

[F10]

A continuous function on a closed interval is Riemann integrable, and changing its values at finitely many points preserves its integral (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion, Changing an integrable function at finitely many points changes neither its integrability nor its integral).

Proof

1.1givenF7F8construct

For each cell, define gv=vK′ and gw=wK′ on K∘, and set both representatives to 0 at the finitely many mesh nodes. Their squares are nonnegative simple functions. By [F7] and [F8], ∥vh′∥22=∑K∣vK′∣2λ1(K∘)=∑KhK∣vK′∣2, and the same identity holds for wh′ and for the cell-restricted norms.

1.2givenF1F2construct

On a cell K, vK′ and wK′ are constants, so gK(x):=A(x)vK′wK′ is C2; the discrete sample is the one-panel midpoint rule [F1]. Also ∥gK′′∥∞≤∥A′′∥∞∣vK′∣∣wK′∣. Applying [F2] with n=1 bounds the cell error by hK3∥A′′∥∞∣vK′∣∣wK′∣/24.

2.1step 1.1step 1.2algebra

By step 1.1, the cell error in step 1.2 is at most hK2∥A′′∥∞∥vh′∥L2(K)∥wh′∥L2(K)/24.

3.1F3F4F5F6F8F9F10step 1.1step 2.1algebra∎

The global integrand Avh′wh′ is bounded. On each cell its representative differs at most at the endpoints from the continuous function gK(x)=A(x)vK′wK′, so [F10] makes each cell restriction Riemann integrable with the same cell integral as gK. Repeated application of [F3] then makes the global integrand Riemann integrable and expresses its integral as the sum of the cell integrals. By [F9], its Lebesgue integral on [0,1] equals this Riemann integral; the endpoints are null by [F8], so this is also a(vh,wh). Thus a(vh,wh)−ah(vh,wh) is the sum of the cell errors. The finite-sum triangle inequality [F4] and step 2.1 bound its absolute value by h2∥A′′∥∞/24 times ∑K∥vh′∥L2(K)∥wh′∥L2(K). Cauchy–Schwarz [F5] and the norm decompositions in step 1.1 give the displayed global estimate.

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

A midpoint-quadrature P1 solve has an explicit Strang error budget

Statement

Assume Countable Choice. Put V:=H01(0,1;R) with its H1 norm, and let Vh⊆V be a finite-dimensional conforming piecewise-linear space on an interval partition with maximum cell width h. Let u∈C2([0,1])∩V and assume its nodal interpolant Ihu belongs to Vh. Let A∈C2([0,1]) satisfy 0<α≤A(x)≤M, and write CA:=∥A′′∥L∞(0,1). Define a(v,w)=∫01Av′w′ and let ah use one midpoint quadrature sample per cell. Let F and Fh be bounded real linear exact and discrete loads, with F(v)=a(u,v) for every v∈V, and put δF,h:=sup⁡wh≠0∣F(wh)−Fh(wh)∣/∥wh∥H1, with δF,h=0 if Vh={0}. Then the exact and discrete solutions satisfy

∥u−uh∥H1≤(1+2M/α)2h∥u′′∥∞+2α(CAh224(∥u′∥2+h∥u′′∥∞)+δF,h).

The explicit δF,h is the data/source oscillation term; no rate or vanishing of it is asserted without an additional load approximation hypothesis. Here coercivity follows directly because every sampled coefficient satisfies A(mK)≥α; this special argument does not infer stability from quadrature exactness.

Facts & Assumptions

Given: Countable Choice; V=H01(0,1); a conforming finite-dimensional P1 space Vh; u∈C2∩V with Ihu∈Vh; A∈C2 with α≤A≤M; and bounded loads F,Fh.

[F1]

The Sobolev space H1 is a Hilbert space and Zero-boundary Sobolev space as a norm closure: under Countable Choice, H01(0,1) is a Hilbert space for its H1 inner product.

[F2]

Zero-boundary Poincaré inequality on the unit interval: ∥v∥2≤∥v′∥2 for v∈H01(0,1).

[F3]

One-dimensional P1 interpolation has a first-derivative error bound: ∥(u−Ihu)′∥2≤h∥u′′∥∞.

[F4]

Midpoint quadrature defect for one-dimensional P1 stiffness: ∣a(vh,wh)−ah(vh,wh)∣≤CAh2∥vh′∥2∥wh′∥2/24, with ∥vh′∥22=∑KhK∣vh′∣K2 and the analogous identity for every wh∈Vh.

[F5]

First Strang estimate for conforming perturbed Galerkin problems: error is bounded by best approximation plus the form and load defects divided by discrete coercivity.

[A1]

The exact and discrete equations are a(u,v)=F(v) and ah(uh,wh)=Fh(wh), and δF,h is as in the Statement.

Proof

1.1F1F2F6givenalgebra

By [F2], ∥v∥H12=∥v∥22+∥v′∥22≤2∥v′∥22. Holder [F6] gives ∣a(v,w)∣≤M∥v′∥2∥w′∥2≤M∥v∥H1∥w∥H1, while a(v,v)≥α∥v′∥22≥(α/2)∥v∥H12. Thus a is bounded and coercive in the inherited H1 norm.

1.2F2F4F6givenalgebra

The norm identity in [F4] and finite Cauchy–Schwarz [F6] give, for vh,wh∈Vh, ∣ah(vh,wh)∣≤M∑KhK∣vh′∣K∣wh′∣K≤M∥vh′∥2∥wh′∥2≤M∥vh∥H1∥wh∥H1, so ah is bounded. Also A(mK)≥α on each cell, so ah(vh,vh)=∑KhKA(mK)∣vh′∣K2≥α∥vh′∥22. By [F2], ∥vh∥H12≤2∥vh′∥22, hence ah(vh,vh)≥(α/2)∥vh∥H12 and αh≥α/2.

1.3F2F3givenalgebra

By [F3] and [F2], ∥u−Ihu∥H1≤2∥(u−Ihu)′∥2≤2h∥u′′∥∞. Also the triangle inequality gives ∥(Ihu)′∥2≤∥u′∥2+h∥u′′∥∞.

2.1F4F5A1step 1.3

Apply [F5] with comparison function Ihu. Its best-approximation term is bounded by step 1.3; [F4] bounds its form defect by CAh2(∥u′∥2+h∥u′′∥∞)/24 because ∥wh′∥2≤∥wh∥H1. The load defect is exactly δF,h by [A1].

3.1step 1.1step 1.2step 2.1algebra∎

Substitute M from step 1.1 and αh≥α/2 from step 1.2 into the first-Strang bound in step 2.1. This gives the displayed estimate and retains the full load defect.

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

Shape-regular affine finite elements supply the Strang approximation term

Statement

Assume Countable Choice and let d∈{2,3}. Let Th be a matching shape-regular affine simplicial mesh as in Matching affine simplicial meshes and shape regularity. Set h:=max⁡({0}∪{diam⁡(K):K∈Th}), so h=0 for an empty mesh. Let Vh be a conforming zero-boundary P1 Lagrange subspace of a Hilbert space V, with Vh⊆V, and let Ihu∈Vh be the global nodal interpolant of u∈H2(Ω)∩C(Ω‾) whose boundary nodal values vanish. Assume ∥z∥V≤CV∣z∣H1(Ω) for z=u−Ihu. The reference nodal functionals are bounded on W2,2, and the exact/discrete variational problems satisfy the hypotheses of First Strang estimate for conforming perturbed Galerkin problems, with exact solution u and discrete coercivity αh>0. Then a constant CI depending only on the reference P1 element and shape-regularity bound satisfies

∥u−uh∥V≤(1+M/αh)CVCIh∣u∣H2(Ω)+δa,h(Ihu)+δF,hαh.

If αh≥α∗>0 uniformly, the displayed approximation contribution is O(h); the geometry, quadrature, and load defects remain separate terms and require their own estimates.

Facts & Assumptions

Given: Countable Choice; d=2 or 3; a matching shape-regular affine simplicial mesh with h=max⁡({0}∪{hK:K∈Th}); a conforming P1 Lagrange family in V; u∈H2∩C(Ω‾) with zero boundary nodal values; a global interpolant Ihu∈Vh; and the bounded/coercive exact and discrete forms and loads of the first Strang theorem.

[F1]

Matching affine simplicial meshes and shape regularity: cells are nondegenerate affine simplices, their interiors are disjoint, and intersections are whole matching faces; shape regularity bounds diameter divided by inradius.

[F2]

Reference finite elements and unisolvent degrees of freedom: an unisolvent reference element defines its interpolation operator from its degrees of freedom.

[F3]

Broken and conforming polynomial spaces on a matching mesh: conformity means matching polynomial traces on each interior facet, and the zero-boundary subspace has zero polynomial trace on every boundary facet.

[F4]

Local interpolation estimates on shape-regular affine meshes: for the P1 Lagrange element, p=2, ℓ=r=2, m=1, and ℓ>d/p, ∣u−IKu∣H1(K)≤ChK∣u∣H2(K) uniformly on the shape-regular affine mesh.

[F5]

First Strang estimate for conforming perturbed Galerkin problems: the conforming error is bounded by its best-approximation term and the actual discrete form/load defects.

[F6]

Under Countable Choice, a bounded piece of an affine hyperplane is contained in the graph of an affine function over a closed nondegenerate rectangle. Such a graph has Jordan content zero (The graph of a continuous function on a closed nondegenerate rectangle in Rm has content zero in Rm+1) and is Lebesgue measurable of measure zero (Lebesgue outer measure is at most Jordan outer content, and a bounded Jordan measurable set is Lebesgue measurable with Lebesgue measure equal to its Jordan content, Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume); its subsets are measurable null sets by completeness. Finite unions of facets are null by finite subadditivity (Finite and countable subadditivity of measures).

[F7]

For every nonnegative measurable q, E↦∫Eq dλ is a measure and its integral over a null set is zero (The indefinite integral of a nonnegative measurable function is a measure, A nonnegative integral over a null set vanishes).

[A1]

The global nodal interpolant has matching traces and zero boundary nodal values, and it belongs to Vh⊆V as stipulated in the Statement.

[A2]

The reference P1 nodal functionals are bounded on W2,2, as assumed in the Statement; no point-evaluation theorem or stronger choice principle is used to infer this hypothesis here.

Proof

1.1A2F1F2F4given

By [A2], the reference nodal degrees of freedom are bounded on W2,2; together with unisolvence [F2], this gives the local Lagrange interpolants required by [F4]. Unisolvence also identifies each restriction Ihu∣K with the local interpolant IKu. Apply [F4] with p=2, ℓ=r=2, m=1, and ℓ>d/p on every cell K.

1.2F1F2F3A1algebra

On a shared facet, both neighboring P1 traces are affine and have the same values at every facet vertex, so the traces agree. Every boundary facet has zero values at all its vertices, so its affine trace is zero. Thus the assembled function has the conformity and boundary traces in [F3]; its membership in V is the explicit hypothesis [A1].

1.3F1F6F7givenconstruct

Let Σ be the union of the mesh facets. Each facet lies in an affine hyperplane; choosing a coordinate with nonzero normal coefficient writes that hyperplane as the graph of an affine function over the other coordinates. A closed nondegenerate rectangle containing the facet's projection gives a bounded graph containing the facet, so [F6] makes each facet, and hence Σ, a Lebesgue null set. By [F7], for every nonnegative measurable q the integral over Ω is the sum of its integrals over the disjoint cell interiors K∘, since Ω∖Σ=⨆KK∘ and ∫Σq=0. Applying this to the squared first derivatives of u−Ihu and the squared second derivatives of u gives the global seminorm decompositions used next.

2.1F4step 1.3givenalgebra

Square the cell estimate in [F4] and sum over the cells using step 1.3. Their interiors are disjoint and hK≤h, so ∣u−Ihu∣H1(Ω)2≤CI2h2∣u∣H2(Ω)2, hence ∣u−Ihu∣H1(Ω)≤CIh∣u∣H2(Ω).

3.1F5step 2.1givenalgebra∎

Apply [F5] with vh=Ihu and use ∥u−Ihu∥V≤CV∣u−Ihu∣H1 from the stated norm bound and step 2.1. This gives the displayed error estimate without absorbing the form, geometry, quadrature, or load defects.

5 · Examples, counterexamples and false statements

None yet.

Sources