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

Primal H¹ approximation on shape-regular affine finite-element meshes

Statement

Assume Countable Choice. Let d≥2, let Ω⊂Rd be a bounded polyhedral open set with a matching shape-regular affine simplicial mesh family {Th}, and set h:=max⁡K∈ThhK≤1. Fix an integer r≥1. On the reference simplex let (S^d,P^,Σ^) be an unisolvent real scalar finite element whose finite-dimensional local space P^ consists of polynomials and contains Pr. Assume each degree of freedom has a bounded linear extension to Wr+1,2(S^d), and let I^ be its interpolant. Suppose there is a global map Ih whose restriction to each cell is the affine pullback of I^, and that Ihu∈Vh for the conforming discrete space Vh⊂H01(Ω) whenever u∈Wr+1,2(Ω)∩H01(Ω), where H01(Ω) is the closure of Cc∞(Ω) in W1,2(Ω) (Zero-boundary Sobolev space as a norm closure). Then a constant C independent of h and u satisfies ∥u−Ihu∥H1(Ω)≤Chr∣u∣Wr+1,2(Ω). The global conformity and zero-boundary mapping property of Ih are explicit hypotheses; this estimate does not assert them for arbitrary degrees of freedom.

Facts & Assumptions

Given: Countable Choice; the exact matching affine mesh convention; a reference element with Pr⊆P^ and bounded degrees of freedom on Wr+1,2; the cellwise affine interpolation formula; and the stated global mapping property Ihu∈Vh.

[F1]

An unisolvent reference element has a unique 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 reference simplex, for real-valued w∈Wr+1,2 there is one q∈Pr with ∥w−q∥Wm,2≤C∣w∣Wr+1,2 for every integer 0≤m≤r+1: use polynomial parameter r+1 and s=r+1 in Bramble–Hilbert approximation on a reference simplex, whose derivative-mean polynomial is independent of s.

[F3]

Affine pullback and pushforward transform order-m Sobolev seminorms by the corresponding powers of A and A−1 and determinant factors (Affine pullback of weak derivatives and Sobolev seminorms).

[F4]

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

[F5]

Countable Choice is assumed by the Sobolev and affine-change suppliers used in [F2]–[F4] and by the Lebesgue measure suppliers in [F6] (The Axiom of Countable Choice (ACω)).

Proof

1.1F1givenalgebra

On the reference cell write I^w=∑i=1Nσ^i(w)ϕ^i. Each degree of freedom is bounded on Wr+1,2 by Given, and each fixed polynomial shape function has finite W1,2 norm. Thus ∥I^w∥W1,2≤C∥w∥Wr+1,2. By [F1], I^q=q for every q∈Pr. For such q, w−I^w=(w−q)−I^(w−q), so ∥w−I^w∥Wm,2≤∥w−q∥Wm,2+C∥w−q∥Wr+1,2(m=0,1).

2.1F2step 1.1

Choose the polynomial q∈Pr supplied by [F2]. Since m≤1≤r+1, [F2] bounds both terms in step 1.1 by C∣w∣Wr+1,2. Hence the reference-cell interpolation error obeys ∥w−I^w∥Wm,2≤C∣w∣Wr+1,2 for m=0,1.

3.1F3F4F5step 2.1algebra

For a cell K with affine matrix AK, apply [F3] to transform the reference error and the order-(r+1) derivative seminorm back to K. The determinant factors cancel; the remaining factor is bounded by C∥AK−1∥m∥AK∥r+1≤ChKr+1−m by [F4]. Therefore ∥u−IKu∥L2(K)≤ChKr+1∣u∣Wr+1,2(K),∣u−IKu∣W1,2(K)≤ChKr∣u∣Wr+1,2(K).

4.1givenF4F5F6step 3.1algebra∎

Let Eh:=⋃K∈Th∂K, a finite union of simplex facets. Each facet lies in a bounded affine hyperplane; choose a coordinate with nonzero normal component and write that hyperplane as the graph of an affine function over a bounded box in Rd−1. Partition the base box into at most C0Nd−1 boxes of side 1/N. The affine function varies by at most C1/N on each, so each graph piece lies in a slightly enlarged half-open d-box of volume at most C2N−d. These elementary-set cover members have total volume at most C0C2/N; the outer-measure definition and box-volume formula give outer measure zero for the facet, and completeness makes it Lebesgue-null. Thus Eh is null, and Ω∖Eh is the disjoint union of the cell interiors by the mesh definition. Square and sum the estimates in step 3.1 over these interiors; the sums of squared Sobolev seminorms equal the corresponding global seminorms. Since hK≤h≤1, the order-zero contribution hKr+1 is at most hr. The global interpolation map in Given takes values in Vh, yielding ∥u−Ihu∥H1(Ω)≤Chr∣u∣Wr+1,2(Ω).

Depends on

Used by

Dependency tree · two levels

53 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