Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 d≥2, assume Ω is a bounded polyhedral open set whose boundary is locally a graph of a Lipschitz function with Ω on one side; for d=1, use a bounded nonempty interval or a finite nonempty union of bounded intervals with pairwise disjoint closures. Let 1≤p<∞. There is a linear map

Qh:W01,p(Ω)⟶Vh

with the following construction. Fix a nonnegative ρ∈Cc∞(B(0,1)) with ∫ρ=1, let E0 be extension by zero, and set Shv=ρh∗E0v with ρh(x)=h−dρ(x/h). The degree-k coefficient of Qhv at every interior node z is Shv(z); every boundary-node coefficient is zero. For all sufficiently fine meshes, ∥v−Qhv∥Lp(Ω)≤Ch∥∇v∥Lp(Ω),∥∇Qhv∥Lp(Ω)≤C∥∇v∥Lp(Ω). Consequently Qhv→v in W1,p(Ω) for each v∈W01,p(Ω). Constants are uniform over the fixed mesh family and may depend on d,k,p,Ω,θ,σ and ρ. The operator Qh 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 Vh, a fixed 1≤p<∞, and v∈W01,p(Ω).

[F1]

On each cell, the Lagrange coefficient estimates scale like hKd/p in Lp and like hKd/p−1 for gradients; the local basis reproduces constants and affine polynomials. Globally the coefficient estimates scale like hd/p; graph balls have polynomial growth and the mesh families have the stated θ,σ bounds (Quasi-uniform finite-element mass inverses have summable graph decay).

[F2]

For every open Ω, zero extension maps W01,p(Ω) into W1,p(Rd) and preserves the function and weak-gradient norms (Zero extension of W_0^{1,p} has no boundary derivative).

[F3]

On a matching simplex mesh, a continuous piecewise polynomial with zero polynomial trace on every boundary facet belongs to W01,p for finite p (Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare). The one-dimensional interval case is proved locally below.

[F5]

Hölder's inequality bounds convolution evaluation against an Lp function by the Lp′ norm of the kernel (Holder's inequality for integrals, including the endpoint cases).

[F6]

A differentiable curve on a compact interval satisfies its integral fundamental theorem, and compactly supported W1,p(Rd) functions can be approximated by compactly supported smooth functions (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz, Compactly supported smooth functions are dense in W^{k,p}(R^n)).

[F7]

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).

[F8]

W01,p is the norm closure of Cc∞(Ω) 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).

[F9]

The smooth bump lemma supplies a nonnegative compactly supported ρ0 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 ρ=ρ0/∫ρ0 is an admissible unit-mass bump (A smooth bump between concentric Euclidean balls, A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included).

[A1]

Countable Choice is assumed in the zero-extension, mollification, Sobolev-closure, and approximation interfaces cited above (The Axiom of Countable Choice (ACω)).

Proof

1.1A1F1F3F6F8givenconstruct

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 d≥2, [F3] therefore gives Vh⊂W01,p(Ω). For d=1, write a mesh function as w, let M 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 ∣w(x)−w(y)∣≤M∣x−y∣ on R; 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 W1,p(R).

1.2A1F6givenalgebra

Let u=E0v. For a cell K, choose a cube CK of side Rh centered at an interior point of K, where the fixed R is large enough that K, every radius-h ball centered at one of its nodes, and every radius-2h ball centered at a point of K lie in CK. The cubes have bounded overlap: if x∈CK, then K⊂B(x,CRh); the cells have disjoint interiors and volume at least chd, so only uniformly many can meet that ball. For smooth u on a cube C, the segment fundamental theorem, Hölder, Jensen's inequality, and a change of variables on the two ranges t≤1/2 and t≥1/2 give ∥u−uC∥Lp(C)≤Cddiam⁡(C)∥∇u∥Lp(C),uC=∣C∣−1∫Cu. Indeed, Jensen's inequality and u(x)−u(y)=∫01∇u(tx+(1−t)y)⋅(x−y) dt give ∥u−uC∥Lp(C)p≤diam⁡(C)p∣C∣∫C∫C∫01∣∇u(tx+(1−t)y)∣p dt dy dx. For t≥1/2 change the x variable, and for t≤1/2 change the y variable; both inverse Jacobians are at most 2d and the images stay in C. This proves the displayed Poincaré estimate. Since u=E0v is compactly supported in W1,p(Rd), [F6] approximates it by smooth functions in that norm, so the same cube estimate holds for u.

2.1A1F4F6F7F8F9step 1.1givenalgebra

In the one-dimensional branch, for x in a component interval choose the nearer endpoint; integrating the derivative from that endpoint by [F6] gives ∣w(x)∣≤Mdist⁡(x,R∖Ω). 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 χa,ε equal to one within ε of a and zero outside distance 2ε. The endpoint supports are disjoint; the product ηε=∏a∈∂Ω(1−χa,ε) is smooth, vanishes within distance ε of each endpoint, equals one at distance at least 2ε, and satisfies ∣ηε′∣≤C/ε. Thus w−ηεw and its weak derivative are supported in a boundary layer of measure OΩ(ε) and bounded there by CΩM. On each partition interval ηεw 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 W1,p(R) with derivative ηε′w+ηεw′ on the pieces. Hence ηεw→w in W1,p(R). Each cutoff product has compact support a positive distance from R∖Ω; convolving it with a sufficiently small mollifier gives a function in Cc∞(Ω) by [F4] and [F7], and the convolution converges in W1,p by [F4]. This proves w∈W01,p(Ω) by [F8] and completes the range assertion in d=1.

2.2A1step 1.2givenalgebra

If K has no boundary node, put cK=uCK. If it has a boundary node, put cK=0. In d≥2, 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 η,r0>0 such that each boundary point z and 0<r≤r0 have an exterior cone sector in B(z,r) of measure at least ηrd: in a chart xd>g(x′) with Lipschitz constant L, the cone xd<g(z′)−L∣x′−z′∣ is exterior, and a fixed smaller cone has that volume. For sufficiently small h, a boundary node z of K therefore gives ∣CK∖Ω∣≥η′∣CK∣. In d=1, at a boundary endpoint the exterior interval inside CK has a fixed positive fraction of its length; for finitely many separated components take h smaller than their minimum gap divided by 2R. In the boundary case u=0 on CK∖Ω, so ∣uCK∣ ∣CK∖Ω∣1/p≤∥u−uCK∥Lp(CK∖Ω). The cube estimate of step 1.2 then gives, in either case, ∥u−cK∥Lp(CK)≤Ch∥∇u∥Lp(CK).

2.3F1F4step 1.1givenalgebra

Fix ψ∈Cc∞(Ω) and let δ=dist⁡(supp⁡ψ,∂Ω)>0. For h<δ/2, Shψ is zero on every cell with a boundary node: every point of such a cell is within distance h of the boundary, while the convolution samples only a radius-h ball. Thus Qhψ=0=Shψ on those cells. Every other cell has only interior nodes, so Qhψ is the ordinary nodal interpolant of Shψ there. Since k≥1, this interpolant reproduces affine polynomials. Taylor's formula about a cell vertex and the local coefficient estimates in [F1] give ∥Qhψ−Shψ∥Lp(K)≤Ch2∣K∣1/p∥D2ψ∥∞,∥∇(Qhψ−Shψ)∥Lp(K)≤Ch∣K∣1/p∥D2ψ∥∞. The nonnegative unit-mass kernel gives Shψ→ψ in W1,p(Ω) and ∥D2Shψ∥∞≤∥D2ψ∥∞. Summing cell bounds proves Qhψ→ψ in W1,p.

3.1F1F5step 2.2givenalgebra

For each interior node z of K, Hölder [F5] gives ∣Shv(z)−cK∣≤∥ρh∥Lp′(Rd)∥u−cK∥Lp(B(z,h))≤Ch−d/p∥u−cK∥Lp(CK). At a boundary node both the coefficient and cK are zero in the boundary case. If K has no boundary node, every local node is interior and the local nodal basis reproduces the constant cK. Applying the local coefficient estimate of [F1] to the coefficients of Qhv−cK, and using step 2.2, gives ∥Qhv−cK∥Lp(K)≤Ch∥∇u∥Lp(CK),∥∇Qhv∥Lp(K)≤C∥∇u∥Lp(CK). The boundary-node case uses cK=0; the no-boundary-node case uses ∑z∈Kϕz=1.

4.1F1F2step 1.2step 3.1givenalgebra

Since v=u on K, step 2.2 and the first estimate of step 3.1 imply ∥v−Qhv∥Lp(K)≤Ch∥∇u∥Lp(CK). Raise this and the gradient estimate of step 3.1 to the pth 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 ∥Qhw∥W1,p≤C∥w∥W1,p for every w∈W01,p and all sufficiently small h, by the gradient bound and ∥Qhw∥p≤∥w∥p+Ch∥∇w∥p.

5.1F8step 4.1step 2.3givenalgebra∎

For arbitrary v∈W01,p(Ω) and ε>0, [F8] provides ψ∈Cc∞(Ω) with ∥v−ψ∥W1,p<ε. The uniform bound in step 4.1 and the smooth convergence in step 2.3 imply lim sup⁡h→0∥Qhv−v∥W1,p≤(C+1)∥v−ψ∥W1,p<(C+1)ε. Letting ε↓0 proves strong convergence for every v∈W01,p(Ω).

Depends on

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