Alphabeta Math
TheoremStatement: 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.

Local approximation and reproduction of the P1 moment interpolant

Statement

Assume Countable Choice, as in the Sobolev, affine-scaling and trace suppliers.

Let T be a shape-regular conforming triangular mesh and let IT be the moment interpolant from A local moment interpolant for conforming P1 meshes. For each cell K, let ωK be the union of vertex stars of its vertices. There is a constant C depending only on shape regularity such that for every v∈H01(Ω), ∥v−ITv∥L2(K)≤ChK∥∇v∥L2(ωK),∥∇ITv∥L2(K)≤C∥∇v∥L2(ωK), and, for every interior edge E⊂∂K, ∥v−ITv∥L2(E)≤ChE1/2∥∇v∥L2(ωK∪ωK′), where K′ is the other incident cell. The operator maps into V(T) and reproduces every member of V(T).

Facts & Assumptions

[A1]

Countable Choice is assumed in the cited Sobolev and reference-simplex suppliers (The Axiom of Countable Choice (ACω)).

Given: Countable Choice, a shape-regular conforming triangular mesh, v∈H01(Ω), the moment interpolant of A local moment interpolant for conforming P1 meshes, and the patch inequalities of Uniform Poincare inequalities on vertex and cell patches.

[F1]

On each reference triangle, the three barycentric coordinates form a basis of P1 and their Gram matrix is positive definite; affine scaling transfers the dual moments and polynomial norm bounds to every shape-regular cell (A local moment interpolant for conforming P1 meshes, Polynomial derivative and face norms are controlled on a reference simplex, Shape regularity controls affine simplex geometry).

[F2]

Matching continuous piecewise-affine functions belong to W1,2, and a continuous piecewise-affine function with zero boundary nodal values belongs to W01,2 (Continuous matching piecewise polynomials belong to W1p, Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare).

[F3]

Vertex stars have bounded overlap and uniformly bounded valence on a shape-regular conforming mesh (Uniform Poincare inequalities on vertex and cell patches).

Proof

1.1A1F1F2given

The definition gives finitely many coefficients, each an integral against a bounded affine polynomial, hence a linear functional on L2(Kz); the resulting finite sum is continuous piecewise affine. Its boundary nodal coefficients are zero, so [F2] places it in V(T). If v∈V(T), then on the selected cell Kz its affine restriction is a linear combination of the three local hats. The dual moment identities recover its nodal coefficient at z, so cz(v)=v(z) at every interior vertex; at boundary vertices both the coefficient and the P1 trace value are zero. Therefore ITv=v.

1.2A1F1F3givenalgebra

For a cell K not meeting the boundary, set c=vωK; for a boundary cell set c=0. The patch Poincaré estimate gives ∥v−c∥L2(ωK)≤ChK∥∇v∥L2(ωK). For each interior vertex z of K, put az=cz(v)−c=∫Kz(v−c)ψz,Kz; this equality follows from the dual identities, which give ∫Kzψz,Kz=1. These are local integrals of an L2(Kz) function, with no application of IT to v−c. The scaled dual bound gives ∣az∣≤ChK−1∥v−c∥L2(Kz), since Kz⊂ωK and its diameter is comparable to hK. At a boundary vertex of K, necessarily c=0 and the corresponding coefficient difference is zero. The three barycentric hats on K sum to one, so (ITv−c)∣K=∑z∈V(K), z interiorazφz∣K. Each hat has L2(K) norm at most ChK and gradient norm at most C. Thus ∥ITv−c∥L2(K)≤C∥v−c∥L2(ωK) and ∥∇ITv∥L2(K)≤ChK−1∥v−c∥L2(ωK). The patch inequality and v−ITv=(v−c)−(ITv−c) prove the first two bounds. This argument uses only that each selected Kz is incident to z, so its constants are uniform over all such selections.

2.1A1F1F3step 1.2algebra∎

Apply the scaled trace inequality to v−ITv on K. The first two bounds from step 1.2 control the cell L2 term and its gradient; the neighboring patch gives the same estimates on K′. Since hE and hK are comparable by shape regularity, this yields the asserted edge bound.

Depends on

Used by

Dependency tree · two levels

48 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