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.
Local approximation by the face-average Crouzeix–Raviart interpolant
Statement
Assume Countable Choice and the setup of The face-average Crouzeix–Raviart interpolant, a shape-regular affine mesh, and . The face-average interpolant is defined for every by the traces of Fractional face traces and cellwise Green identity on a simplex and reproduces . Uniformly over all cells, For each facet , If , then the global interpolant has matching interior face means and zero boundary face means, so .
Facts & Assumptions
Given: Countable Choice, a shape-regular affine simplex, the local and global face-average interpolants, and the Slobodeckij regularity convention of Fractional Sobolev regularity on a simplex.
Countable Choice is required by the simplex trace, reference Poincare, and affine shape-scaling suppliers. (The Axiom of Countable Choice ())
For a cell or face of positive measure, write .
The face mean of a continuous affine polynomial is its value at the face barycenter, and the face-average interpolant reproduces every affine polynomial. (Face averages are unisolvent for the local Crouzeix–Raviart element)
Face traces on a simplex are bounded on ; for they satisfy the face-mean estimate in the preceding item. (Fractional face traces and cellwise Green identity on a simplex)
The mean-zero Poincare–Wirtinger inequality holds on the reference simplex. (Poincare–Wirtinger inequality on a reference simplex)
Shape regularity gives , , , and . (Shape regularity controls affine simplex geometry)
Proof
On the reference simplex, each face mean of is bounded by by [F2]. The interpolant is a finite sum of these means times fixed affine shape polynomials, so it is bounded from to . The trace-defined formula of The face-average Crouzeix–Raviart interpolant is therefore continuous on .
First work on the reference simplex. Choose an affine polynomial with and . For , applying the fractional Poincare estimate proved in step 1.1 of Fractional face traces and cellwise Green identity on a simplex to each component of gives . The mean-zero Poincare–Wirtinger inequality [F3] then gives . At , apply [F3] to the mean-zero first derivatives, then again to , obtaining .
Since is affine, reproduction [F1] gives . The reference stability from step 1.1 and the estimates of step 2.1 bound the reference error by . Under the affine map , each face surface Jacobian is constant, so face averages and the interpolant commute with pullback. The fractional gradient seminorm obeys : substitute in the double integral, use and from [F4], and include the factor in the pulled-back gradient. The physical gradient and error scaling factors are respectively and , yielding the two stated powers.
Apply the scaled trace bound [F2] to : Substituting step 3.1 gives the stated face estimate. On an interior facet, both adjacent restrictions of have the same Sobolev trace because ; on a boundary facet the trace of is zero. The global interpolant therefore has matching interior face means and zero boundary means.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The face-average Crouzeix–Raviart interpolant
- Fractional Sobolev regularity on a simplex
- Face averages are unisolvent for the local Crouzeix–Raviart element
- Fractional face traces and cellwise Green identity on a simplex
- Shape regularity controls affine simplex geometry
- Poincare–Wirtinger inequality on a reference simplex
Used by
Dependency tree · two levels
37 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)