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.

Local interpolation estimates on shape-regular affine meshes

Statement

Assume Countable Choice. Let k≥0, 1≤p<∞, and let (S^d,P^,Σ^) be a reference finite element whose polynomial space contains Pk. Assume its degrees of freedom are bounded on Wℓ,p(S^d) for an integer ℓ≥1, let r,m∈N0, and let I^ be its interpolant. Thus I^q=q for q∈Pk. On a shape-regular affine mesh as in Matching affine simplicial meshes and shape regularity, for each cell K with its orientation-preserving reference map FK define IKv=(I^(v∘FK))∘FK−1. For every such cell, if ℓ≤r≤k+1 and 0≤m≤r, then for v∈Wr,p(K), ∣v−IKv∣Wm,p(K)≤ChKr−m∣v∣Wr,p(K). If ℓ>k+1 and 0≤m≤k+1, then for v∈Wℓ,p(K), ∣v−IKv∣Wm,p(K)≤C∑n=k+1ℓhKn−m∣v∣Wn,p(K). The constants are uniform over the mesh family and depend on the stated reference element, exponents and shape-regularity bound. For Lagrange elements in the existing mesh dimension range d≥2, assume additionally the Axiom of Choice for the automatic nodal-boundedness application. Then Sobolev threshold for Lagrange point evaluations on a reference simplex supplies the boundedness hypothesis when ℓ>d/p; unisolvence of a particular node set remains a separate hypothesis.

Facts & Assumptions

Given: A shape-regular affine simplex family, finite p, a unisolvent reference element, Countable Choice, and the stated degree-of-freedom boundedness on Wℓ,p(S^d).

[F1]

Unisolvent degrees of freedom define a linear interpolation operator that reproduces every polynomial in its finite-element space. (Reference finite elements and unisolvent degrees of freedom, Unisolvent degrees of freedom define a unique reference interpolant)

[F2]

On the fixed reference polynomial space, every derivative norm is bounded by its coefficient or cell Lp norm; hence bounded degrees of freedom give a bounded interpolant into every polynomial derivative norm. (Polynomial derivative and face norms are controlled on a reference simplex)

[F3]

For real-valued v, Bramble–Hilbert supplies a polynomial q of degree at most r−1 with ∥v−q∥Wm,p≤C∣v∣Wr,p when m≤r, and for q∈Pk with v∈Wℓ,p, ∥v−q∥Wℓ,p≤C∑n=k+1ℓ∣v∣Wn,p when ℓ>k+1. (Bramble–Hilbert approximation on a reference simplex)

[F4]

Under affine pullback/pushforward, order-s seminorms acquire ∥A∥s∣det⁡A∣−1/p or ∥A−1∥s∣det⁡A∣1/p factors. (Affine pullback of weak derivatives and Sobolev seminorms)

[F5]

Shape regularity gives ∥AK∥≍hK, ∥AK−1∥≍hK−1 and det⁡AK≍hKd. (Shape regularity controls affine simplex geometry)

[F6]

Under the additional Axiom of Choice and the existing dimension restriction d≥2, Lagrange point evaluations are bounded when ℓ>d/p. (Sobolev threshold for Lagrange point evaluations on a reference simplex) The generic estimate takes bounded degrees of freedom as a hypothesis.

[F7]

The Bramble–Hilbert supplier [F3] assumes Countable Choice through the reference Poincare–Wirtinger inequality. (The Axiom of Countable Choice (ACω))

[F8]

For complex-valued Sobolev functions, real and imaginary parts and their weak derivatives are taken componentwise; the pointwise inequalities ∣Re⁡z∣,∣Im⁡z∣≤∣z∣≤∣Re⁡z∣+∣Im⁡z∣ combine the real-valued Sobolev estimates into the corresponding complex-valued estimates, with at most a fixed factor in the constant. (Integer-order Sobolev spaces and their norms)

Proof

1.1F1F2F6given

On the reference cell, write I^w as the finite sum of its degree-of-freedom values times the dual shape functions. The assumed boundedness of each functional and [F2] bound ∣I^w∣Wm,p≤C∥w∥Wℓ,p. For any reproduced q, linearity gives v^−I^v^=(v^−q)−I^(v^−q), so ∣v^−I^v^∣Wm,p≤∣v^−q∣Wm,p+C∥v^−q∥Wℓ,p. For the automatic Lagrange application, under the additional Axiom of Choice, d≥2, and ℓ>d/p, [F6] verifies nodal-functional boundedness. For the generic estimate, boundedness is the explicit hypothesis, so this additional choice assumption is not used.

2.1F3F7F8step 1.1

If ℓ≤r≤k+1 and v^ is real-valued, choose the Bramble–Hilbert polynomial q∈Pr−1⊆Pk from [F3]. If v^ is complex-valued, apply the first clause of [F3] to Re⁡v^ and Im⁡v^ separately, obtaining qR,qI∈Pr−1, and set q=qR+iqI. In either case q is reproduced by I^. Since m≤r and ℓ≤r, [F3] bounds both terms in step 1.1 for the real case; for the complex case, [F8] combines the two real estimates and changes only the constant. Thus ∣v^−I^v^∣Wm,p≤C∣v^∣Wr,p.

2.2F3F7F8step 1.1

If ℓ>k+1 and v^ is real-valued, choose the Bramble–Hilbert polynomial q∈Pk from [F3]. If v^ is complex-valued, apply the second clause of [F3] with r=k+1, s=ℓ to its real and imaginary parts, obtaining qR,qI∈Pk, and set q=qR+iqI. In either case q is reproduced by I^. Then [F3] bounds the Wℓ,p norm of v^−q by C∑n=k+1ℓ∣v^∣Wn,p; because m≤k+1<ℓ, the same controls its Wm,p norm. For complex v^, [F8] combines the component estimates with at most a fixed change in C. Step 1.1 gives ∣v^−I^v^∣Wm,p≤C∑n=k+1ℓ∣v^∣Wn,p.

3.1F4F5F7step 2.1algebra

For v^=v∘FK, use [F4] to transform the physical error to the reference cell and the reference derivatives of v back to the physical cell. The product of the two determinant factors cancels; the remaining matrix factors are bounded by C∥AK−1∥m∥AK∥r≤ChKr−m by [F5]. This gives the first physical estimate from step 2.1.

4.1F2F4F5F7step 2.2algebra∎

In the second case, apply the same transformation separately to each order n in step 2.2. Its matrix factor is bounded by C∥AK−1∥m∥AK∥n≤ChKn−m by [F5]; summing over k+1≤n≤ℓ gives the second physical estimate. The constants in [F2]–[F7] are uniform over the fixed reference element and the shape-regular family, proving uniformity.

Depends on

Used by

Dependency tree · two levels

33 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