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.
Face averages are unisolvent for the local Crouzeix–Raviart element
Statement
For the element of The local P1 Crouzeix–Raviart element, the face-average functionals form an isomorphism . In particular, so every has the unique expansion .
Facts & Assumptions
Given: A nondegenerate affine -simplex , its facets , barycentric coordinates , and the face-average functionals and candidate shape polynomials of The local P1 Crouzeix–Raviart element.
The barycentric coordinates are affine, satisfy , and sum to one on . (The local P1 Crouzeix–Raviart element)
The average of an affine function over a simplex facet equals its value at that facet's barycenter; this follows by integrating each affine coordinate in the affine parametrization of the facet. (The local P1 Crouzeix–Raviart element)
Proof
Let be the barycenter of . By [F2], the face average of an affine polynomial on is . At , the barycentric coordinates of the vertices of are all , while the coordinate opposite is zero. Therefore if and if . Hence , which proves the displayed duality identities.
The polynomials are linearly independent: applying to gives by step 1.1. Since has dimension , they form a basis. Applying the same functionals to gives zero for every face; expansion in this basis then gives zero coefficients. This proves existence and uniqueness of the stated expansion.
Depends on
Used by
Dependency tree · two levels
3 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)