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

Energy error estimate for the Crouzeix–Raviart Poisson method

Statement

Assume Countable Choice. Let 1/2<r≤1, and let u∈H01(Ω)∩H1+r(Ω) solve −Δu=f∈L2(Ω) on a bounded connected Lipschitz polyhedral domain. On any finite matching shape-regular mesh, the solution uh of the Crouzeix–Raviart method satisfies ∥u−uh∥♯,h≤Chr∣u∣H1+r(Ω). In particular, ∥∇h(u−uh)∥L2(Ω) obeys the same bound. The constant is independent of the mesh size and may depend on Ω, d, the shape-regularity bound, and r.

Facts & Assumptions

Given: Countable Choice; the Poisson method of The Crouzeix–Raviart method for the homogeneous Poisson problem; a finite shape-regular mesh; and the regular exact solution u and datum f in the Statement.

[F1]

The exact and discrete solutions exist uniquely; the exact branch uses Countable Choice, while the finite discrete branch is solved by a face-basis matrix. (Well-posedness of the homogeneous Poisson and CR problems)

[F2]

The comparison expression is induced by an inner product on Xh=H01(Ω)+VhCR,0, and it restricts to the gradient norm on H01(Ω). (The broken comparison expression is a norm)

[F3]

The local face-average interpolant has ∥∇h(u−IhCRu)∥2≤Chr∣u∣H1+r and its facet trace errors are bounded by hF−1/2∥u−IKCRu∥L2(F)≤ChKr∣u∣H1+r(K). (Local approximation by the face-average Crouzeix–Raviart interpolant)

[F4]

The scaled CR face-jump norm is bounded by the broken gradient. (Face jumps are controlled by the broken gradient)

[F5]

The consistency residual obeys ∣a~h(u,wh)−Fh(wh)∣≤Chr∣u∣H1+r∥∇hwh∥2. (Consistency bounds for the Crouzeix–Raviart Poisson method)

[F6]

The second Strang estimate for a nonconforming method with bounded form extension is ∥u−uh∥h≤(1+Mh/αh)inf⁡vh∥u−vh∥h+δhnc(u)/αh. Its hypotheses include Countable Choice, a Hilbert exact space, a finite-dimensional test space, a common comparison norm, bounded extension, coercivity, and bounded loads. (Second Strang estimate with a bounded extension to the comparison space)

[F7]

The discrete space is finite-dimensional with the explicit face basis, and its L2 norm is controlled by the broken-gradient norm. (Interior face means form the global Crouzeix–Raviart degrees of freedom, Discrete Poincare inequality for homogeneous Crouzeix–Raviart functions)

[F8]

H01(Ω) is Hilbert in the H1 norm, and the continuous Poincare inequality makes the gradient norm equivalent to that norm, hence complete. (The Sobolev space H1 is a Hilbert space, A Poincare bound on a slab-bounded domain)

[F9]

A finite-dimensional real inner-product space is complete: in the explicit face basis its positive-definite Gram matrix makes the induced norm equivalent to the Euclidean coefficient norm. The comparison norm supplies this inner product on Vh. (Interior face means form the global Crouzeix–Raviart degrees of freedom, The broken comparison expression is a norm)

[F10]

Holder's inequality with exponents 2,2 bounds all displayed L2 pairings. (Holder's inequality for integrals, including the endpoint cases)

Proof

1.1F3givenalgebra

The interpolant IhCRu belongs to VhCR,0. Summing the local gradient estimates in [F3] over cells gives ∑K∥∇(u−IKCRu)∥L2(K)2≤Ch2r∑K∣u∣H1+r(K)2≤Ch2r∣u∣H1+r(Ω)2, since the cell-pair domains K×K are disjoint subsets of Ω×Ω for each gradient component.

1.2F2F6F7F8F9F10givenalgebra

The exact space V=H01(Ω) is Hilbert in the gradient norm: it is Hilbert in H1 by [F8], and continuous Poincare gives ∥v∥H12≤(1+CP2)∥∇v∥22, so the equivalent gradient norm is complete. In that norm a is bounded and coercive with constants M=α=1. The discrete space Vh has its explicit finite face basis [F7]; the common comparison inner product restricts to its norm by [F2], and [F9] makes Vh Hilbert. Thus the two Hilbert-space hypotheses of [F6] hold. By [F10], the exact load satisfies ∣F(v)∣≤CP∥f∥2∥v∥♯,h, and the discrete load satisfies ∣Fh(wh)∣≤CD∥f∥2∥∇hwh∥2≤CD∥f∥2∥wh∥♯,h using [F7]. Finally, Holder gives ∣a~h(z,wh)∣≤∥∇hz∥2∥∇hwh∥2≤∥z∥♯,h∥wh∥♯,h, so the bounded-extension constant is Mh=1.

1.3F2F4algebra

By [F4], choose a constant CJ such that ∥vh∥♯,h2=∥∇hvh∥22+∑FhF−1∥[vh]F∥22≤(1+CJ)∥∇hvh∥22=(1+CJ)ah(vh,vh). Thus ah is coercive in the comparison norm with αh=(1+CJ)−1>0, uniformly in the mesh.

1.4F2F5F6algebra

If Vh={0}, [F6] defines δhnc(u)=0, which satisfies the required bound. Otherwise, the residual in [F6] is δhnc(u)=sup⁡wh≠0∣Fh(wh)−a~h(u,wh)∣∥wh∥♯,h≤Chr∣u∣H1+r(Ω), because [F5] gives the numerator bound and ∥wh∥♯,h≥∥∇hwh∥2.

2.1F2F3F6step 1.1algebra

On an interior facet, [u−IhCRu]=−[IhCRu] because u has a common trace; on a boundary facet its trace is −IhCRu because u has zero trace. The face terms in [F3], squared and summed over facets with each cell incident to at most d+1 facets, give ∑FhF−1∥[u−IhCRu]F∥L2(F)2≤Ch2r∣u∣H1+r(Ω)2. Together with step 1.1, this proves ∥u−IhCRu∥♯,h≤Chr∣u∣H1+r(Ω), hence the same upper bound for the infimum in [F6].

3.1F1F2F6step 2.1step 1.2step 1.3step 1.4algebra∎

Apply [F6] using steps 2.1, 1.2, 1.3, and 1.4. The constants Mh=1 and αh=(1+CJ)−1 are uniform, so its estimate gives ∥u−uh∥♯,h≤Chr∣u∣H1+r(Ω). The interpolation and consistency constants depend only on d, shape regularity, and r, and the jump constant CJ has the same dependence. The Poincare constants CP,CD in step 1.2 establish Hilbert-space/load hypotheses but do not enter the Strang error bound. Thus this proof yields an error constant depending only on d, shape regularity, and r (and is compatible with the weaker dependence stated above). The broken-gradient term is one of the nonnegative terms in the squared comparison norm, yielding the final assertion.

Depends on

Used by

Dependency tree · two levels

64 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