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 , and let solve on a bounded connected Lipschitz polyhedral domain. On any finite matching shape-regular mesh, the solution of the Crouzeix–Raviart method satisfies In particular, obeys the same bound. The constant is independent of the mesh size and may depend on , , the shape-regularity bound, and .
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 and datum in the Statement.
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)
The comparison expression is induced by an inner product on , and it restricts to the gradient norm on . (The broken comparison expression is a norm)
The local face-average interpolant has and its facet trace errors are bounded by . (Local approximation by the face-average Crouzeix–Raviart interpolant)
The scaled CR face-jump norm is bounded by the broken gradient. (Face jumps are controlled by the broken gradient)
The consistency residual obeys . (Consistency bounds for the Crouzeix–Raviart Poisson method)
The second Strang estimate for a nonconforming method with bounded form extension is 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)
The discrete space is finite-dimensional with the explicit face basis, and its 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)
is Hilbert in the norm, and the continuous Poincare inequality makes the gradient norm equivalent to that norm, hence complete. (The Sobolev space is a Hilbert space, A Poincare bound on a slab-bounded domain)
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 . (Interior face means form the global Crouzeix–Raviart degrees of freedom, The broken comparison expression is a norm)
Holder's inequality with exponents bounds all displayed pairings. (Holder's inequality for integrals, including the endpoint cases)
Proof
The interpolant belongs to . Summing the local gradient estimates in [F3] over cells gives since the cell-pair domains are disjoint subsets of for each gradient component.
The exact space is Hilbert in the gradient norm: it is Hilbert in by [F8], and continuous Poincare gives , so the equivalent gradient norm is complete. In that norm is bounded and coercive with constants . The discrete space has its explicit finite face basis [F7]; the common comparison inner product restricts to its norm by [F2], and [F9] makes Hilbert. Thus the two Hilbert-space hypotheses of [F6] hold. By [F10], the exact load satisfies , and the discrete load satisfies using [F7]. Finally, Holder gives , so the bounded-extension constant is .
By [F4], choose a constant such that Thus is coercive in the comparison norm with , uniformly in the mesh.
If , [F6] defines , which satisfies the required bound. Otherwise, the residual in [F6] is because [F5] gives the numerator bound and .
On an interior facet, because has a common trace; on a boundary facet its trace is because has zero trace. The face terms in [F3], squared and summed over facets with each cell incident to at most facets, give Together with step 1.1, this proves , hence the same upper bound for the infimum in [F6].
Apply [F6] using steps 2.1, 1.2, 1.3, and 1.4. The constants and are uniform, so its estimate gives . The interpolation and consistency constants depend only on , shape regularity, and , and the jump constant has the same dependence. The Poincare constants 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 , shape regularity, and (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
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Fractional Sobolev regularity on a simplex
- The face-average Crouzeix–Raviart interpolant
- The Crouzeix–Raviart method for the homogeneous Poisson problem
- The broken comparison expression is a norm
- Discrete Poincare inequality for homogeneous Crouzeix–Raviart functions
- Face jumps are controlled by the broken gradient
- Interior face means form the global Crouzeix–Raviart degrees of freedom
- Local approximation by the face-average Crouzeix–Raviart interpolant
- Consistency bounds for the Crouzeix–Raviart Poisson method
- Well-posedness of the homogeneous Poisson and CR problems
- Second Strang estimate with a bounded extension to the comparison space
- The Sobolev space $H^1$ is a Hilbert space
- A Poincare bound on a slab-bounded domain
- Holder's inequality for integrals, including the endpoint cases
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
- Jean-Luc Guermond, MATH 661 Fall 2025, Part VIII, Chapter 36, Crouzeix–Raviart approximation (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 25, Non-conforming Finite Element Methods (standard reference, not scraped)