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 , , and let be a reference finite element whose polynomial space contains . Assume its degrees of freedom are bounded on for an integer , let , and let be its interpolant. Thus for . On a shape-regular affine mesh as in Matching affine simplicial meshes and shape regularity, for each cell with its orientation-preserving reference map define For every such cell, if and , then for , If and , then for , 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 , 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 ; unisolvence of a particular node set remains a separate hypothesis.
Facts & Assumptions
Given: A shape-regular affine simplex family, finite , a unisolvent reference element, Countable Choice, and the stated degree-of-freedom boundedness on .
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)
On the fixed reference polynomial space, every derivative norm is bounded by its coefficient or cell 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)
For real-valued , Bramble–Hilbert supplies a polynomial of degree at most with when , and for with , when . (Bramble–Hilbert approximation on a reference simplex)
Under affine pullback/pushforward, order- seminorms acquire or factors. (Affine pullback of weak derivatives and Sobolev seminorms)
Shape regularity gives , and . (Shape regularity controls affine simplex geometry)
Under the additional Axiom of Choice and the existing dimension restriction , Lagrange point evaluations are bounded when . (Sobolev threshold for Lagrange point evaluations on a reference simplex) The generic estimate takes bounded degrees of freedom as a hypothesis.
The Bramble–Hilbert supplier [F3] assumes Countable Choice through the reference Poincare–Wirtinger inequality. (The Axiom of Countable Choice ())
For complex-valued Sobolev functions, real and imaginary parts and their weak derivatives are taken componentwise; the pointwise inequalities 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
On the reference cell, write as the finite sum of its degree-of-freedom values times the dual shape functions. The assumed boundedness of each functional and [F2] bound . For any reproduced , linearity gives so For the automatic Lagrange application, under the additional Axiom of Choice, , and , [F6] verifies nodal-functional boundedness. For the generic estimate, boundedness is the explicit hypothesis, so this additional choice assumption is not used.
If and is real-valued, choose the Bramble–Hilbert polynomial from [F3]. If is complex-valued, apply the first clause of [F3] to and separately, obtaining , and set . In either case is reproduced by . Since and , [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 .
If and is real-valued, choose the Bramble–Hilbert polynomial from [F3]. If is complex-valued, apply the second clause of [F3] with , to its real and imaginary parts, obtaining , and set . In either case is reproduced by . Then [F3] bounds the norm of by ; because , the same controls its norm. For complex , [F8] combines the component estimates with at most a fixed change in . Step 1.1 gives
For , use [F4] to transform the physical error to the reference cell and the reference derivatives of back to the physical cell. The product of the two determinant factors cancels; the remaining matrix factors are bounded by by [F5]. This gives the first physical estimate from step 2.1.
In the second case, apply the same transformation separately to each order in step 2.2. Its matrix factor is bounded by by [F5]; summing over 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
- The Axiom of Choice
- Matching affine simplicial meshes and shape regularity
- Reference finite elements and unisolvent degrees of freedom
- Unisolvent degrees of freedom define a unique reference interpolant
- Polynomial derivative and face norms are controlled on a reference simplex
- Shape regularity controls affine simplex geometry
- Bramble–Hilbert approximation on a reference simplex
- Sobolev threshold for Lagrange point evaluations on a reference simplex
- Affine pullback of weak derivatives and Sobolev seminorms
- Integer-order Sobolev spaces and their norms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 11 (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 4 (standard reference, not scraped)