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.
Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare
Statement
Assume Countable Choice. Let be a bounded polyhedral open set with a finite matching affine simplicial mesh, let , and let be a real-valued conforming piecewise polynomial whose polynomial trace vanishes on every boundary facet. Then Here is the norm closure of ; no C1 trace characterization is used.
Facts & Assumptions
Given: Countable Choice, the finite matching mesh, the conforming and zero-boundary conditions, bounded , and finite .
On each simplex, a vector field satisfies the cellwise Gauss–Green formula. (Gauss–Green formula on an affine simplex)
The mesh is the interior of the union of its cells, so each boundary component of a local simplicial link reaches an exterior facet. Equal polynomial traces and opposite facet orientations cancel interior fluxes; the zero-boundary condition makes every exterior facet trace zero. (Matching affine simplicial meshes and shape regularity, Broken and conforming polynomial spaces on a matching mesh, Interior facet orientations cancel in a matching mesh)
The zero-boundary space is precisely the norm closure of in . (Zero-boundary Sobolev space as a norm closure)
If is bounded in one direction, every satisfies for a slab of width and . (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction)
Compactly supported Sobolev functions extend by zero, and compactly supported functions can be approximated by smooth compactly supported functions. Smooth cutoffs and the weak product rule are available. (Compactly supported Sobolev functions extend by zero in every integer order, Compactly supported smooth functions are dense in W^{k,p}(R^n), Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor)
A decreasing sequence of measurable subsets of a finite-measure set has measures tending to the measure of its intersection. (Continuity from above when one set has finite measure)
The Sobolev class and its norm use the weak-derivative and conventions of Integer-order Sobolev spaces and their norms.
Standard smooth mollifiers turn a Lipschitz cutoff into a smooth one; convolution with a unit-mass mollifier is smooth, and its Lipschitz bound does not exceed that of the original function. (The mollifier family generated by a unit-mass smooth bump, Convolution with a mollifier is smooth, and derivatives pass under the integral sign, Explicit compactly supported smooth cutoffs)
The Sobolev and zero-boundary suppliers used above assume Countable Choice. (The Axiom of Countable Choice ())
Proof
If , then and the conclusion is immediate. Assume henceforth . Extend by zero to on and define to be its cellwise derivative on mesh cells and zero outside . On each cell apply the simplex Green formula to for an arbitrary . Fact [F1] gives the cell identity. Interior facet terms cancel by [F2]; boundary facet terms vanish by the zero-boundary clause of [F2]. Summing the finitely many cell identities gives Both functions are in , so [F7] gives with gradient .
Put , which is -Lipschitz. Choose a smooth scalar step with for , for , and . For set and convolve it with a nonnegative smooth mollifier of integral one supported in the ball of radius , obtaining . Then is smooth, supported in , equals zero where , equals one where , and . Since is bounded, its support is compact in .
Let be the maximum of the cellwise suprema of . Across every interior facet the polynomial traces agree; on every boundary facet they agree with zero. For a point in the mesh skeleton, its minimal mesh face is the unique mesh face whose relative interior contains ; the local star of that face means the union of the cells containing it. If the minimal face is a facet, there are exactly two incident cells at an interior facet and exactly one at a boundary facet. In the interior case their values at agree by the matching polynomial traces; in the boundary case the single cell value agrees with exterior zero by the zero boundary trace. For the remaining faces, let be their codimension. The incident simplicial cones in their local star cut a small sphere in the normal space of the face, of dimension , into a finite face-to-face triangulation of the local directions in . Within each connected component, top-dimensional pieces are connected by facet adjacency: perturb a path in that open component to avoid the finite union of codimension-two faces. At an interior point the direction set is the whole sphere, which is connected because , so matching traces make all incident polynomial values agree. At a boundary point every component has a boundary direction; following facet adjacencies reaches a boundary facet, where the polynomial value is zero, so all cell limits in that component are zero. Thus in all cases the cellwise continuous representatives and the exterior zero fit continuously on the whole finite polyhedral partition. Restrict this continuous function to any line segment. The segment is divided by the finitely many cell facets into finitely many intervals; on each cell interval its derivative along the segment has magnitude at most , and on exterior intervals it is zero. Continuity at the interval endpoints then gives for all . Thus .
The difference and its weak gradient are supported in . On this layer, step 2.1 gives , and step 1.2 gives . Also . For , the sets decrease to the empty set and , so [F6] gives . These bounds show for finite .
Each has compact support in . By [F5] extend it by zero to and approximate there by . Choose a smooth cutoff equal to one near the compact support of . Then and, by the weak product rule, in . A diagonal choice with step 3.1 proves by [F3].
A bounded set lies in a slab of finite width . Apply [F4] to the membership from step 4.1, obtaining the displayed inequality with for the fixed exponent .
Depends on
- Matching affine simplicial meshes and shape regularity
- Broken and conforming polynomial spaces on a matching mesh
- Gauss–Green formula on an affine simplex
- Interior facet orientations cancel in a matching mesh
- Zero-boundary Sobolev space as a norm closure
- The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction
- Test function cutoffs and euclidean localization
- Compactly supported Sobolev functions extend by zero in every integer order
- Compactly supported smooth functions are dense in W^{k,p}(R^n)
- Integer-order Sobolev spaces and their norms
- Continuity from above when one set has finite measure
- The mollifier family generated by a unit-mass smooth bump
- Convolution with a mollifier is smooth, and derivatives pass under the integral sign
- Explicit compactly supported smooth cutoffs
- Weak Leibniz rule with a smooth factor
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Periodic FE-HMM with simplicial macro and periodic P1 micro meshes Algorithm
- Residual indicators and data oscillation for P1 AFEM Definition
- The conforming P1-bubble/P1 mini element Definition
- A conforming P1 Dirichlet discretization gives a first Ritz upper bound Example
- An exact polynomial Poisson solution has a zero residual certificate Example
- Direct derivation of the semidiscrete Ritz residual Example
- The L2 projection and Ritz projection give different initial data Example
- Boundary-preserving face-average P1 interpolation Lemma
- Boundary-preserving quasi-interpolation is stable and strongly approximating Lemma
- Element and edge residual representation for P1 Galerkin errors Lemma
- Local and global dimensions of the mini element Lemma
- Localized energy estimate for nested Galerkin solutions Lemma
- The nodal P1 interpolant preserves homogeneous boundary values Lemma
- Well-posedness of the finite FE-HMM micro solves Lemma
- FE-HMM macro, micro, and sampling error separation Theorem
- Galerkin energy error with local h, trace degree and Sobolev regularity Theorem
- L2 projections are uniformly W1p-stable on quasi-uniform conforming meshes Theorem
- Local approximation and reproduction of the P1 moment interpolant Theorem
- Residual reliability and local efficiency for P1 AFEM Theorem
- Semidiscrete Ritz error splitting and energy estimate Theorem
- Stable two-level P1 decomposition for structured Poisson meshes Theorem
- Well-posedness and energy stability of the semidiscrete FEM system Theorem
- Zero-boundary fractional interpolation in the Nitsche comparison norm Theorem
Dependency tree · two levels
70 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)