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.
Fractional Sobolev regularity on a simplex
Definition
Assume Countable Choice. Let be a bounded open set, , and let be a measurable real function on . Define with the diagonal integrand set to zero, and , using almost-everywhere classes and norm . For , write when each weak derivative belongs to , and define For vector fields, use the sum of the componentwise squared norms. Use these definitions on each cell and on the full domain , with . At , set , interpret , and set with the integer-order membership of Integer-order Sobolev spaces and their norms, retaining the displayed full-norm rule. Thus . This Hessian convention counts mixed derivatives twice: its full norm is equivalent to, rather than identical with, the ordinary multi-index norm, with . The local seminorm is the restriction of the Slobodeckij convention in The Gagliardo--Slobodeckij space on Euclidean space to .
Depends on
Used by
- A zero-boundary solution below the CR trace regularity threshold Counterexample
- A Dirichlet Poisson smoothing index Definition
- Consistency bounds for the Crouzeix–Raviart Poisson method Lemma
- Fractional face traces and cellwise Green identity on a simplex Lemma
- Local approximation by the face-average Crouzeix–Raviart interpolant Lemma
- Energy error estimate for the Crouzeix–Raviart Poisson method Theorem
- L2 error estimate under a Dirichlet Poisson smoothing index Theorem
Dependency tree · two levels
18 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)