Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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 face-average P1 interpolation

Statement

Assume Countable Choice. Let D be a bounded connected Lipschitz polygonal/polyhedral domain with a conforming shape-regular simplicial mesh, d=2 or 3, mesh size h=max⁡KhK. For each interior mesh vertex z, choose any incident facet Fz; for each boundary vertex choose an incident boundary facet. Let ψz,Fz∈P1(Fz) be the unique dual affine function satisfying ∫Fzψz,Fzφy=δzy for the facet's P1 nodal basis. Define Ihv=∑z(∫Fzψz,Fztr⁡v)φz. This is a linear face-average interpolant H1(D)→Sh, where Sh is the continuous piecewise P1 space. It maps H01(D) into Sh∩H01(D), is uniformly H1-seminorm stable, and for each element patch ωK has ∥v−Ihv∥L2(K)≤ChK∥∇v∥L2(ωK). If v∈H2(D), then ∥∇(v−Ihv)∥L2(K)≤ChK∥D2v∥L2(ωK). Constants depend only on dimension, the fixed domain, and the mesh shape-regularity bound. No point evaluation is used.

Facts & Assumptions

Given: A conforming affine mesh of a bounded connected Lipschitz polygon/polyhedron, its shape-regularity bound, and the Sobolev spaces on its cells.

[A1]

Countable Choice is inherited through the H0 closure interface used to identify zero boundary traces. (The Axiom of Countable Choice (ACω))

[F1]

Matching affine simplices and conforming P1 spaces have shared facet traces; continuous piecewise polynomials with zero boundary facet trace belong to H01(D). (Matching affine simplicial meshes and shape regularity, Broken and conforming polynomial spaces on a matching mesh, Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare)

[F2]

Shape regularity gives uniform affine scaling between each simplex and the reference simplex. (Shape regularity controls affine simplex geometry)

[F3]

The reference simplex has a bounded trace map and a Poincare–Wirtinger inequality; Bramble–Hilbert gives affine approximation with the stated derivative-order scaling. (Sobolev face traces and Gauss–Green on a reference simplex, Poincare–Wirtinger inequality on a reference simplex, Bramble–Hilbert approximation on a reference simplex)

[F4]

H01(D) is the closure of compactly supported smooth functions, so its trace on every boundary facet is zero by continuity of the face trace. (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms, Sobolev face traces and Gauss–Green on a reference simplex)

[F5]

On a finite-dimensional real normed space, all norms are equivalent. (Finite dimensional norm equivalence over a complete valued field)

[F6]

Affine pullback transports H1 norms and face traces between a simplex and its reference simplex; the trace bound then follows from [F3]. (Affine pullback of weak derivatives and Sobolev seminorms, Sobolev face traces and Gauss–Green on a reference simplex)

Proof

1.1A1F1F2F3F4F6construct

On each reference facet, the P1 facet mass matrix is positive definite because ∫Fp2>0 for every nonzero affine polynomial. Its inverse defines the dual functions ψ^z; affine scaling in [F2] gives ∥ψz,F∥L2(F)≤ChF−(d−1)/2. The trace map in [F3] therefore makes every coefficient of Ihv a bounded linear functional on the H1 trace of an adjacent cell. Shared coefficients define a continuous P1 function. If v∈H01, [F4] makes all selected boundary-facet averages zero, so Ihv has zero boundary nodal values and belongs to H01 by [F1].

1.2F1F2construct

The coefficients reproduce every global affine polynomial: on the selected facet its trace is P1 and the dual moment equals its value at z. Shape regularity bounds the number of cells at each vertex: each simplex's vertex solid angle has a positive lower bound, while the total angle is at most 2π in dimension two or 4π in dimension three. The vertex-star graph is connected as follows. Choose a small chart cylinder meeting only cells incident to the vertex. At an interior vertex, a small ball lies in D. At a boundary vertex, the Lipschitz chart represents this local part of D as the region above a Lipschitz graph; within a smaller base ball, vertical paths to a common height above the graph and a horizontal segment at that height connect any two points. Hence this local part is path connected. Join interior points of any two incident cells by a polygonal path there and perturb its finitely many segments to avoid the finite mesh skeleton of codimension at least two. The path then crosses only facet interiors and gives a facet-adjacency chain among cells incident to the vertex. Adjacent cell diameters are comparable by [F2]. Thus vertex-patch diameters and overlap are uniformly bounded.

2.1A1F2F3step 1.2

Let ωK be the union of cells meeting a vertex of K. Shape regularity bounds the number of cells at each vertex: each has a solid angle bounded below by the reference-cell shape bound, whereas the total angle is at most 2π in dimension two and 4π in dimension three. Each vertex-star graph is connected by step 1.2, and all stars of vertices of K contain K, so their union is connected; neighboring cell diameters are comparable by [F2]. For adjacent cells T,T′ with common facet F, let mT,mT′ be their volume means. Cell Poincare and trace in [F3] give ∥w−mT∥L2(F)≤ChK1/2∥∇w∥L2(T) and the analogous bound on T′. Since ∣F∣1/2≍hK(d−1)/2, it follows that ∣mT−mT′∣≤ChK(2−d)/2∥∇w∥L2(T∪T′). A path of bounded length through the patch graph then compares all cell means to one fixed cK and proves ∥w−cK∥L2(ωK)≤ChK∥∇w∥L2(ωK). Applying the scaled trace estimate of [F3] and ∥ψz,Fz∥L2(Fz)≤ChK−(d−1)/2 gives ∣∫Fzψz,Fz(w−cK)∣≤ChK1−d/2∥∇w∥L2(ωK) for every vertex of K.

2.2A1F2F3F5algebrastep 1.2

Suppose v∈H2(D). On each cell T⊂ωK, Bramble--Hilbert and affine scaling in [F2, F3] give pT∈P1(T) with ∥v−pT∥L2(T)≤ChT2∥D2v∥L2(T) and ∥∇(v−pT)∥L2(T)≤ChT∥D2v∥L2(T). For adjacent cells T,T′ sharing a facet F, the scaled trace estimate applied to v−pT and its first derivatives gives ∥pT−pT′∥L2(F)≤ChK3/2∥D2v∥L2(T∪T′) and ∣F∣1/2∣∇pT−∇pT′∣≤ChK1/2∥D2v∥L2(T∪T′). The second bound controls the full gradient difference, and the first then controls its constant part. Normalize both cell diameters by hK. Shape regularity and comparability across the shared facet bound the normalized affine maps and their inverses; there are only finitely many vertex-orderings. Their closure is a compact set of nondegenerate reference-pair configurations. Finite-dimensional norm equivalence [F5] varies continuously on this compact set, so its constants are uniform; affine scaling then gives ∥pT−pT′∥H1(T)≤ChK∥D2v∥L2(T∪T′). A bounded path through the connected cell-star graph lets one fixed cell polynomial p∈P1 satisfy ∥v−p∥L2(ωK)≤ChK2∥D2v∥L2(ωK) and ∥∇(v−p)∥L2(ωK)≤ChK∥D2v∥L2(ωK). This uses only local approximation and does not impose boundary values on v.

3.1A1F2algebrastep 2.1

The reference P1 basis satisfies ∥φz∥L2(K)≤ChKd/2 and ∥∇φz∥L2(K)≤ChKd/2−1. Since Ih reproduces constants, step 2.1 bounds ∥Ihw−cK∥L2(K)≤ChK∥∇w∥L2(ωK) and ∥∇Ihw∥L2(K)≤C∥∇w∥L2(ωK). Together with the patch Poincare bound for w−cK, these prove the L2 approximation and local H1 stability. Summing and using bounded overlap proves global H1-seminorm stability.

4.1A1F1algebrastep 3.1step 2.2∎

Facet duality reproduces every affine polynomial at every vertex, so Ihp=p on K. Apply the local H1 stability from step 3.1 to v−p and use step 2.2 to get ∥∇(v−Ihv)∥L2(K)≤ChK∥D2v∥L2(ωK). Summing over cells and using the bounded patch overlap from step 3.1 proves the global H1 approximation estimate.

Depends on

Used by

Dependency tree · two levels

46 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