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.
Continuous matching piecewise polynomials belong to W1p
Statement
Assume Countable Choice. Let be a finite matching affine simplicial mesh of a bounded polyhedral open set , let , and let be a real-valued scalar member of the conforming piecewise-polynomial space in Broken and conforming polynomial spaces on a matching mesh. Then . Its weak gradient agrees almost everywhere on each cell with the ordinary cellwise polynomial gradient.
Facts & Assumptions
Given: Countable Choice, a finite matching mesh, polynomial on each cell with equal polynomial traces across every interior facet, , and .
The conforming condition is equality of the two polynomial traces on each whole interior facet. (Broken and conforming polynomial spaces on a matching mesh)
A field on a simplex satisfies the cellwise Gauss–Green formula. (Gauss–Green formula on an affine simplex)
The two outward normals on an interior matching facet are opposite, so its oriented contributions cancel when cell boundaries are summed. (Interior facet orientations cancel in a matching mesh)
A weak first derivative is characterized by integration against compactly supported smooth tests, and consists of classes whose weak first derivatives lie in . (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)
Countable Choice is the explicit background assumption in the Sobolev-space definition. (The Axiom of Countable Choice ())
Proof
If , then by the mesh definition; is the unique zero class in and the cellwise-gradient assertion has no cells. Assume now . The mesh is finite and each cellwise polynomial and its ordinary first derivatives are bounded on the closed cell. Thus and the piecewise function belong to for every . Fix a coordinate and a test function . On each cell apply [F2] to to obtain
Sum these finitely many identities over . On an interior facet, [F1] gives a common trace for and [F3] gives opposite outward normals, so the two flux integrals cancel. On a boundary facet, because its support is compact in . Therefore By [F4], is the weak th derivative. This holds for every coordinate ; all are in , so with the stated cellwise gradient.
Depends on
Used by
- Periodic FE-HMM with simplicial macro and periodic P1 micro meshes Algorithm
- Residual indicators and data oscillation for P1 AFEM Definition
- Symmetric and nonsymmetric Nitsche boundary forms Definition
- Contact nodal coordinates are independently attainable Lemma
- Element and edge residual representation for P1 Galerkin errors Lemma
- Localized energy estimate for nested Galerkin solutions Lemma
- Matching variable-degree polynomial traces give an H1 function Lemma
- Well-posedness of the finite FE-HMM micro solves Lemma
- FE-HMM macro, micro, and sampling error separation Theorem
- Local approximation and reproduction of the P1 moment interpolant Theorem
- Residual reliability and local efficiency for P1 AFEM Theorem
- Uniform Fortin stability of the mini element Theorem
- Zero-boundary fractional interpolation in the Nitsche comparison norm Theorem
Dependency tree · two levels
26 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 2019, Chapter 32 (standard reference, not scraped)
- Luca Heltai, Numerical Methods for Partial Differential Equations, Lecture 2 (standard reference, not scraped)