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.
Consistency bounds for the Crouzeix–Raviart Poisson method
Statement
Assume Countable Choice. Let , let solve distributionally, and let be the maximum cell diameter of a finite matching shape-regular mesh. With the method of The Crouzeix–Raviart method for the homogeneous Poisson problem, define where is the cellwise extension in The Crouzeix–Raviart method for the homogeneous Poisson problem. Then If also and , then The constants depend only on , the shape-regularity bound, , and .
Facts & Assumptions
Given: Countable Choice, a bounded connected Lipschitz polyhedral domain, a finite matching shape-regular simplicial mesh, as in the Statement, and the definitions of The Crouzeix–Raviart method for the homogeneous Poisson problem and The face-average Crouzeix–Raviart interpolant.
Countable Choice is assumed by the trace/Green, jump, interpolation, and CR-method interfaces used below. (The Axiom of Countable Choice (), Fractional face traces and cellwise Green identity on a simplex, Face jumps are controlled by the broken gradient, Local approximation by the face-average Crouzeix–Raviart interpolant, The Crouzeix–Raviart method for the homogeneous Poisson problem)
Cellwise Green's identity holds for and every test, and traces of global functions vanish on boundary facets. (Fractional face traces and cellwise Green identity on a simplex)
The normal traces of agree across shared facets; all CR interior jumps and boundary traces have zero face mean. (Fractional face traces and cellwise Green identity on a simplex, The global homogeneous Crouzeix–Raviart space)
The mean fluctuation of a normal trace of on a facet is bounded by . (Fractional face traces and cellwise Green identity on a simplex)
The scaled face-jump norm of is bounded by . (Face jumps are controlled by the broken gradient)
The face-average interpolant has matching interior face means, zero boundary face means, and . (Local approximation by the face-average Crouzeix–Raviart interpolant)
Holder's inequality with exponents makes the volume and facet products below integrable and bounds their integrals by the product of the norms. (Holder's inequality for integrals, including the endpoint cases)
Proof
Apply [F1] on each cell and sum. The volume products are integrable by [F6] because on each cell. For an interior facet , [F2] identifies both traces of , and the two outward normals are opposite. Their normal traces and the jumps are in , so [F6] also makes each boundary product integrable. The boundary terms therefore combine to The sign follows from in the Green identity.
Write . On an interior facet the common trace of gives . On a boundary facet, because has zero trace. Applying [F5], summing over the at most facets of each cell, and using nonnegativity of the local fractional seminorm integrals gives The face mean of each such jump is zero by [F5].
Each jump in step 1.1 has zero face mean by [F2], so subtract the mean of its normal-gradient factor. Regard the finitely many facets as a disjoint union with surface measure on each component; Holder [F6] with the component functions and gives where denotes the corresponding outward normal trace (and the boundary jump is ). By [F3], the first factor is at most : each cell contributes at most facet terms, and the sum of the cell Gagliardo seminorms is bounded by the global seminorm because the integrands are nonnegative and . The second factor is at most by [F4]. This proves the general bound.
Use the same face representation as step 1.1 with . Subtract the normal-trace means as in step 2.1. Holder [F6] on the disjoint union of facets bounds the product of the first weighted factor, at most by [F3], and the second, at most by step 1.2. Their product is the sharper asserted bound.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Fractional Sobolev regularity on a simplex
- The face-average Crouzeix–Raviart interpolant
- The global homogeneous Crouzeix–Raviart space
- The Crouzeix–Raviart method for the homogeneous Poisson problem
- Fractional face traces and cellwise Green identity on a simplex
- Face jumps are controlled by the broken gradient
- Local approximation by the face-average Crouzeix–Raviart interpolant
- Holder's inequality for integrals, including the endpoint cases
Used by
Dependency tree · two levels
48 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)