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.
Boundary-preserving quasi-interpolation is stable and strongly approximating
Statement
Assume Countable Choice. Use either mesh branch and the nodal space defined in Quasi-uniform finite-element mass inverses have summable graph decay. For , assume is a bounded polyhedral open set whose boundary is locally a graph of a Lipschitz function with on one side; for , use a bounded nonempty interval or a finite nonempty union of bounded intervals with pairwise disjoint closures. Let . There is a linear map
with the following construction. Fix a nonnegative with , let be extension by zero, and set with . The degree- coefficient of at every interior node is ; every boundary-node coefficient is zero. For all sufficiently fine meshes, Consequently in for each . Constants are uniform over the fixed mesh family and may depend on and . The operator is not asserted to be a projector.
Facts & Assumptions
Given: Countable Choice, one mesh branch of Quasi-uniform finite-element mass inverses have summable graph decay, its nodal space , a fixed , and .
On each cell, the Lagrange coefficient estimates scale like in and like for gradients; the local basis reproduces constants and affine polynomials. Globally the coefficient estimates scale like ; graph balls have polynomial growth and the mesh families have the stated bounds (Quasi-uniform finite-element mass inverses have summable graph decay).
For every open , zero extension maps into and preserves the function and weak-gradient norms (Zero extension of W_0^{1,p} has no boundary derivative).
On a matching simplex mesh, a continuous piecewise polynomial with zero polynomial trace on every boundary facet belongs to for finite (Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare). The one-dimensional interval case is proved locally below.
A unit-mass smooth bump generates a smooth convolution and derivatives pass under the integral; its mollifier family is an approximate identity, and convolution by it converges in every finite (Convolution with a mollifier is smooth, and derivatives pass under the integral sign, Interior mollification commutes with weak derivatives, The mollifier family generated by a unit-mass smooth bump, A unit-mass smooth bump generates an approximate identity, Every approximate identity converges to the identity in for ).
Hölder's inequality bounds convolution evaluation against an function by the norm of the kernel (Holder's inequality for integrals, including the endpoint cases).
A differentiable curve on a compact interval satisfies its integral fundamental theorem, and compactly supported functions can be approximated by compactly supported smooth functions (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz, Compactly supported smooth functions are dense in W^{k,p}(R^n)).
The support of a convolution is contained in the closure of the sum of the supports (The support of a convolution lies in the closure of the support sumset).
is the norm closure of and its norm uses the function and first weak derivatives (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).
The smooth bump lemma supplies a nonnegative compactly supported equal to one on an inner ball; its integral is finite and positive because its support is bounded and it is one on a ball containing a box of positive volume. Thus is an admissible unit-mass bump (A smooth bump between concentric Euclidean balls, A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included).
Countable Choice is assumed in the zero-extension, mollification, Sobolev-closure, and approximation interfaces cited above (The Axiom of Countable Choice ()).
Proof
The coefficients define a linear map into the algebraic conforming piecewise-polynomial space: shared-face nodes coincide, so the face polynomials have identical nodal data and hence identical traces; all boundary coefficients are zero, so each boundary-facet polynomial vanishes. For , [F3] therefore gives . For , write a mesh function as , let bound its finitely many piecewise derivatives, and extend it by zero. It is continuous at every mesh node and at every component endpoint. Integrating the derivative on each of the finitely many subintervals between two points using the fundamental theorem in [F6] shows on ; integration by parts on those subintervals shows that the zero extension has the piecewise derivative as its weak derivative. Thus it is compactly supported in .
Let . For a cell , choose a cube of side centered at an interior point of , where the fixed is large enough that , every radius- ball centered at one of its nodes, and every radius- ball centered at a point of lie in . The cubes have bounded overlap: if , then ; the cells have disjoint interiors and volume at least , so only uniformly many can meet that ball. For smooth on a cube , the segment fundamental theorem, Hölder, Jensen's inequality, and a change of variables on the two ranges and give Indeed, Jensen's inequality and give For change the variable, and for change the variable; both inverse Jacobians are at most and the images stay in . This proves the displayed Poincaré estimate. Since is compactly supported in , [F6] approximates it by smooth functions in that norm, so the same cube estimate holds for .
In the one-dimensional branch, for in a component interval choose the nearer endpoint; integrating the derivative from that endpoint by [F6] gives . Because there are finitely many distinct endpoints, choose smaller than one quarter of their minimum separation. Translate and rescale the bump from [F9] at each endpoint to obtain equal to one within of and zero outside distance . The endpoint supports are disjoint; the product is smooth, vanishes within distance of each endpoint, equals one at distance at least , and satisfies . Thus and its weak derivative are supported in a boundary layer of measure and bounded there by . On each partition interval is smooth times polynomial, is continuous at nodes, and vanishes near component endpoints; integration by parts on the finitely many intervals cancels all interior endpoint terms. Its zero extension therefore belongs to with derivative on the pieces. Hence in . Each cutoff product has compact support a positive distance from ; convolving it with a sufficiently small mollifier gives a function in by [F4] and [F7], and the convolution converges in by [F4]. This proves by [F8] and completes the range assertion in .
If has no boundary node, put . If it has a boundary node, put . In , compactness of the boundary gives a finite subcover of its Lipschitz graph charts; taking the largest chart Lipschitz constant and the smallest chart radius yields uniform such that each boundary point and have an exterior cone sector in of measure at least : in a chart with Lipschitz constant , the cone is exterior, and a fixed smaller cone has that volume. For sufficiently small , a boundary node of therefore gives . In , at a boundary endpoint the exterior interval inside has a fixed positive fraction of its length; for finitely many separated components take smaller than their minimum gap divided by . In the boundary case on , so The cube estimate of step 1.2 then gives, in either case,
Fix and let . For , is zero on every cell with a boundary node: every point of such a cell is within distance of the boundary, while the convolution samples only a radius- ball. Thus on those cells. Every other cell has only interior nodes, so is the ordinary nodal interpolant of there. Since , this interpolant reproduces affine polynomials. Taylor's formula about a cell vertex and the local coefficient estimates in [F1] give The nonnegative unit-mass kernel gives in and . Summing cell bounds proves in .
For each interior node of , Hölder [F5] gives At a boundary node both the coefficient and are zero in the boundary case. If has no boundary node, every local node is interior and the local nodal basis reproduces the constant . Applying the local coefficient estimate of [F1] to the coefficients of , and using step 2.2, gives The boundary-node case uses ; the no-boundary-node case uses .
Since on , step 2.2 and the first estimate of step 3.1 imply Raise this and the gradient estimate of step 3.1 to the th power, sum over cells, and use the bounded overlap from step 1.2 and the norm preservation in [F2]. This proves both global estimates in the Statement. Also for every and all sufficiently small , by the gradient bound and .
For arbitrary and , [F8] provides with . The uniform bound in step 4.1 and the smooth convergence in step 2.3 imply Letting proves strong convergence for every .
Depends on
- Quasi-uniform finite-element mass inverses have summable graph decay
- Integer-order Sobolev spaces and their norms
- Zero-boundary Sobolev space as a norm closure
- Zero extension of W_0^{1,p} has no boundary derivative
- Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare
- Convolution with a mollifier is smooth, and derivatives pass under the integral sign
- Interior mollification commutes with weak derivatives
- Holder's inequality for integrals, including the endpoint cases
- If $f : [a,b] \to \mathbb{R}^m$ is differentiable with integrable $f'$ then $\int_a^b f' = f(b)-f(a)$; and a bounded derivative makes $f$ Lipschitz
- Compactly supported smooth functions are dense in W^{k,p}(R^n)
- The mollifier family generated by a unit-mass smooth bump
- A smooth bump between concentric Euclidean balls
- A unit-mass smooth bump generates an $L^1$ approximate identity
- Every $L^1$ approximate identity converges to the identity in $L^p$ for $1 \le p < \infty$
- The support of a convolution lies in the closure of the support sumset
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
108 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
- Lars Diening, Johannes Storn, and Tabea Tscherpel, On the Sobolev and Lp-Stability of the L2-Projection, arXiv:2008.01801v2 (standard reference, not scraped)
- Christian Clason, Introduction to Finite Element Methods, arXiv:1709.08618v2 (standard reference, not scraped)