Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

A local moment interpolant for conforming P1 meshes

Definition

Assume Countable Choice for the H01 convention of The Axiom of Countable Choice (ACω).

Fix a finite conforming triangular mesh T. For each interior vertex z, choose the incident triangle with least fixed mesh index and denote it Kz. On the reference triangle K^, let λ^1,λ^2,λ^3 be its barycentric coordinates. The Gram matrix Gij=∫K^λ^iλ^j is positive definite because ∫K^p2>0 for every nonzero p∈P1(K^). Thus there are unique dual affine polynomials ψ^i∈P1(K^) with ∫K^λ^jψ^i=δij. Pull them to Kz by the affine map using the normalized measure so ∫Kzφyψz,Kz=δzy for its three local nodal hats.

For v∈H01(Ω) set cz(v)=∫Kzvψz,Kz at interior vertices and cz(v)=0 at boundary vertices. Define ITv=∑z interiorcz(v)φz, where φz is the continuous piecewise-affine nodal hat. The sum is finite and belongs to the conforming zero-boundary P1 space. This is a moment quasi-interpolant; it is not a point-evaluation operator on arbitrary Sobolev classes.

Interface

The Sobolev spaces and zero-boundary closure use Integer-order Sobolev spaces and their norms and Zero-boundary Sobolev space as a norm closure. The mesh and finite-element conventions use Matching affine simplicial meshes and shape regularity and Broken and conforming polynomial spaces on a matching mesh. Reproduction and bounds are established by a separate theorem on this page.

Depends on

Used by

Dependency tree · two levels

19 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