Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 1≤p<∞, and let v be a real-valued conforming piecewise polynomial whose polynomial trace vanishes on every boundary facet. Then v∈W01,p(Ω),∥v∥Lp(Ω)≤CΩ∥∇v∥Lp(Ω). Here W01,p is the norm closure of Cc∞(Ω); no C1 trace characterization is used.

Facts & Assumptions

Given: Countable Choice, the finite matching mesh, the conforming and zero-boundary conditions, bounded Ω, and finite p.

[F1]

On each simplex, a C1 vector field satisfies the cellwise Gauss–Green formula. (Gauss–Green formula on an affine simplex)

[F2]

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)

[F3]

The zero-boundary space is precisely the norm closure of Cc∞(Ω) in W1,p(Ω). (Zero-boundary Sobolev space as a norm closure)

[F4]

If Ω is bounded in one direction, every w∈W01,p(Ω) satisfies ∥w∥Lp≤C(p)(b−a)∥∇w∥Lp for a slab of width b−a and 1≤p<∞. (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction)

[F5]

Compactly supported Sobolev functions extend by zero, and compactly supported W1,p(Rd) 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)

[F6]

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)

[F7]

The Sobolev class and its norm use the weak-derivative and Lp conventions of Integer-order Sobolev spaces and their norms.

[F8]

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)

[F9]

The Sobolev and zero-boundary suppliers used above assume Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F1F2F7given

If Ω=∅, then v=0 and the conclusion is immediate. Assume henceforth Ω≠∅. Extend v by zero to v~ on Rd and define gi to be its cellwise derivative on mesh cells and zero outside Ω‾. On each cell apply the simplex Green formula to vφei for an arbitrary φ∈Cc∞(Rd). 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 ∫Rdv~ ∂iφ=−∫Rdgiφ. Both functions are in Lp, so [F7] gives v~∈W1,p(Rd) with gradient g.

1.2F5F8givenalgebra

Put dΩ(x)=dist⁡(x,Rd∖Ω), which is 1-Lipschitz. Choose a smooth scalar step θ with θ(s)=0 for s≤1, θ(s)=1 for s≥2, and 0≤θ≤1. For ϵ>0 set ζϵ(x)=θ(dΩ(x)/ϵ) and convolve it with a nonnegative smooth mollifier of integral one supported in the ball of radius ϵ/4, obtaining ηϵ. Then ηϵ is smooth, supported in Ω, equals zero where dΩ≤3ϵ/4, equals one where dΩ≥9ϵ/4, and ∥∇ηϵ∥∞≤∥θ′∥∞/ϵ. Since Ω is bounded, its support is compact in Ω.

2.1F2step 1.1given

Let M be the maximum of the cellwise suprema of ∣∇v∣. Across every interior facet the polynomial traces agree; on every boundary facet they agree with zero. For a point x in the mesh skeleton, its minimal mesh face is the unique mesh face whose relative interior contains x; 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 x 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 c≥2 be their codimension. The incident simplicial cones in their local star cut a small sphere in the normal space of the face, of dimension c−1, 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 c≥2, 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 M, and on exterior intervals it is zero. Continuity at the interval endpoints then gives ∣v~(x)−v~(y)∣≤M∣x−y∣ for all x,y. Thus ∣v(x)∣≤Mdist⁡(x,Rd∖Ω).

3.1F5F6step 2.1step 1.2

The difference v−ηϵv and its weak gradient are supported in Eϵ={x∈Ω:dΩ(x)<9ϵ/4}. On this layer, step 2.1 gives ∣v∣≤(9/4)Mϵ, and step 1.2 gives ∣v∇ηϵ∣≤(9/4)M∥θ′∥∞. Also ∣∇v∣≤M. For n∈N0, the sets E1/(n+1) decrease to the empty set and ∣E1∣≤∣Ω∣<∞, so [F6] gives ∣E1/(n+1)∣→0. These bounds show ∥v−η1/(n+1)v∥W1,p(Ω)→0 for finite p.

4.1F3F5F9step 3.1

Each η1/(n+1)v has compact support in Ω. By [F5] extend it by zero to W1,p(Rd) and approximate there by ϕj∈Cc∞(Rd). Choose a smooth cutoff χ∈Cc∞(Ω) equal to one near the compact support of η1/(n+1)v. Then χϕj∈Cc∞(Ω) and, by the weak product rule, χϕj→η1/(n+1)v in W1,p(Ω). A diagonal choice with step 3.1 proves v∈W01,p(Ω) by [F3].

5.1F4F9step 4.1∎

A bounded set lies in a slab of finite width b−a. Apply [F4] to the membership from step 4.1, obtaining the displayed inequality with CΩ=C(p)(b−a) for the fixed exponent p.

Depends on

Used by

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