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.
The Crouzeix–Raviart method for the homogeneous Poisson problem
Definition
Assume Countable Choice. Let and be as in The global homogeneous Crouzeix–Raviart space, let , let , and let . The exact Poisson form and load are An exact solution is a satisfying for every . For , define the broken form and discrete load by The discrete problem is to find such that for every .
Put . For each cell facet , let denote the trace supplied by Fractional face traces and cellwise Green identity on a simplex. For and , define the comparison-space extension Each restriction belongs to , and this extension agrees with when .
On an interior facet choose either ordering and define ; on a boundary facet of set . The mesh-dependent comparison expression is The next items prove the required definiteness, stability, and consistency properties; this definition makes no assertion that .
Depends on
Used by
- Consistency bounds for the Crouzeix–Raviart Poisson method Lemma
- The broken comparison expression is a norm Lemma
- Energy error estimate for the Crouzeix–Raviart Poisson method Theorem
- L2 error estimate under a Dirichlet Poisson smoothing index Theorem
- Well-posedness of the homogeneous Poisson and CR problems Theorem
Dependency tree · two levels
42 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)