Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Shape-regular affine finite elements supply the Strang approximation term

Statement

Assume Countable Choice and let d∈{2,3}. Let Th be a matching shape-regular affine simplicial mesh as in Matching affine simplicial meshes and shape regularity. Set h:=max⁡({0}∪{diam⁡(K):K∈Th}), so h=0 for an empty mesh. Let Vh be a conforming zero-boundary P1 Lagrange subspace of a Hilbert space V, with Vh⊆V, and let Ihu∈Vh be the global nodal interpolant of u∈H2(Ω)∩C(Ω‾) whose boundary nodal values vanish. Assume ∥z∥V≤CV∣z∣H1(Ω) for z=u−Ihu. The reference nodal functionals are bounded on W2,2, and the exact/discrete variational problems satisfy the hypotheses of First Strang estimate for conforming perturbed Galerkin problems, with exact solution u and discrete coercivity αh>0. Then a constant CI depending only on the reference P1 element and shape-regularity bound satisfies

∥u−uh∥V≤(1+M/αh)CVCIh∣u∣H2(Ω)+δa,h(Ihu)+δF,hαh.

If αh≥α∗>0 uniformly, the displayed approximation contribution is O(h); the geometry, quadrature, and load defects remain separate terms and require their own estimates.

Facts & Assumptions

Given: Countable Choice; d=2 or 3; a matching shape-regular affine simplicial mesh with h=max⁡({0}∪{hK:K∈Th}); a conforming P1 Lagrange family in V; u∈H2∩C(Ω‾) with zero boundary nodal values; a global interpolant Ihu∈Vh; and the bounded/coercive exact and discrete forms and loads of the first Strang theorem.

[F1]

Matching affine simplicial meshes and shape regularity: cells are nondegenerate affine simplices, their interiors are disjoint, and intersections are whole matching faces; shape regularity bounds diameter divided by inradius.

[F2]

Reference finite elements and unisolvent degrees of freedom: an unisolvent reference element defines its interpolation operator from its degrees of freedom.

[F3]

Broken and conforming polynomial spaces on a matching mesh: conformity means matching polynomial traces on each interior facet, and the zero-boundary subspace has zero polynomial trace on every boundary facet.

[F4]

Local interpolation estimates on shape-regular affine meshes: for the P1 Lagrange element, p=2, ℓ=r=2, m=1, and ℓ>d/p, ∣u−IKu∣H1(K)≤ChK∣u∣H2(K) uniformly on the shape-regular affine mesh.

[F5]

First Strang estimate for conforming perturbed Galerkin problems: the conforming error is bounded by its best-approximation term and the actual discrete form/load defects.

[F6]

Under Countable Choice, a bounded piece of an affine hyperplane is contained in the graph of an affine function over a closed nondegenerate rectangle. Such a graph has Jordan content zero (The graph of a continuous function on a closed nondegenerate rectangle in Rm has content zero in Rm+1) and is Lebesgue measurable of measure zero (Lebesgue outer measure is at most Jordan outer content, and a bounded Jordan measurable set is Lebesgue measurable with Lebesgue measure equal to its Jordan content, Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume); its subsets are measurable null sets by completeness. Finite unions of facets are null by finite subadditivity (Finite and countable subadditivity of measures).

[F7]

For every nonnegative measurable q, E↦∫Eq dλ is a measure and its integral over a null set is zero (The indefinite integral of a nonnegative measurable function is a measure, A nonnegative integral over a null set vanishes).

[A1]

The global nodal interpolant has matching traces and zero boundary nodal values, and it belongs to Vh⊆V as stipulated in the Statement.

[A2]

The reference P1 nodal functionals are bounded on W2,2, as assumed in the Statement; no point-evaluation theorem or stronger choice principle is used to infer this hypothesis here.

Proof

1.1A2F1F2F4given

By [A2], the reference nodal degrees of freedom are bounded on W2,2; together with unisolvence [F2], this gives the local Lagrange interpolants required by [F4]. Unisolvence also identifies each restriction Ihu∣K with the local interpolant IKu. Apply [F4] with p=2, ℓ=r=2, m=1, and ℓ>d/p on every cell K.

1.2F1F2F3A1algebra

On a shared facet, both neighboring P1 traces are affine and have the same values at every facet vertex, so the traces agree. Every boundary facet has zero values at all its vertices, so its affine trace is zero. Thus the assembled function has the conformity and boundary traces in [F3]; its membership in V is the explicit hypothesis [A1].

1.3F1F6F7givenconstruct

Let Σ be the union of the mesh facets. Each facet lies in an affine hyperplane; choosing a coordinate with nonzero normal coefficient writes that hyperplane as the graph of an affine function over the other coordinates. A closed nondegenerate rectangle containing the facet's projection gives a bounded graph containing the facet, so [F6] makes each facet, and hence Σ, a Lebesgue null set. By [F7], for every nonnegative measurable q the integral over Ω is the sum of its integrals over the disjoint cell interiors K∘, since Ω∖Σ=⨆KK∘ and ∫Σq=0. Applying this to the squared first derivatives of u−Ihu and the squared second derivatives of u gives the global seminorm decompositions used next.

2.1F4step 1.3givenalgebra

Square the cell estimate in [F4] and sum over the cells using step 1.3. Their interiors are disjoint and hK≤h, so ∣u−Ihu∣H1(Ω)2≤CI2h2∣u∣H2(Ω)2, hence ∣u−Ihu∣H1(Ω)≤CIh∣u∣H2(Ω).

3.1F5step 2.1givenalgebra∎

Apply [F5] with vh=Ihu and use ∥u−Ihu∥V≤CV∣u−Ihu∣H1 from the stated norm bound and step 2.1. This gives the displayed error estimate without absorbing the form, geometry, quadrature, or load defects.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

78 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