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.
Bramble–Hilbert approximation on a reference simplex
Statement
Assume Countable Choice. Let , integer , integer , and real-valued . There is a polynomial , chosen by matching all means for , such that:
- if , then ;
- if , then .
The second clause assumes ; constants depend only on .
Facts & Assumptions
Given: , integers and , and .
The mean-zero Poincare–Wirtinger inequality holds on the reference simplex for every finite . (Poincare–Wirtinger inequality on a reference simplex)
Sobolev classes provide all weak derivatives up to the specified integer order, and their norms are finite sums of derivative norms. (Integer-order Sobolev spaces and their norms)
The mean-zero Poincare supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice ())
Holder's inequality on the finite-volume simplex sends derivatives into for finite . (Holder's inequality for integrals, including the endpoint cases)
Proof
The monomials with form a basis of . Thus if is the number of these multi-indices, then . Define the linear moment map by . If every component is zero, take the largest degree of a nonzero homogeneous part of . For each , is the constant times the coefficient of in that highest homogeneous part; its zero mean forces that coefficient to vanish. This contradicts the choice of . Repeating downward shows , so is injective and, since its domain and codomain have the same finite dimension, bijective.
The vector of means of , , is defined because each derivative is in on the finite-measure simplex and therefore in by [F4]. By bijectivity in step 1.1 there is a unique with those moments. For , each derivative , , has zero mean; and every derivative of of order at least is zero.
Apply [F1] to every mean-zero derivative of order in step 2.1; its norm is bounded by the norms of derivatives of order of , since . Apply [F1] successively to derivatives of orders , each of which also has zero mean; at each stage its norm is bounded by the next derivative order already controlled. Thus all derivatives of of order at most are bounded by . If , retaining only orders through proves the first clause.
If , the same argument controls all derivative orders at most by . For each , because . Adding the finitely many derivative bounds through order gives , proving the second clause.
Depends on
Used by
- Primal H¹ approximation on shape-regular affine finite-element meshes Corollary
- Boundary-preserving face-average P1 interpolation Lemma
- Constructive ordinary Sobolev polynomial approximation on triangles Theorem
- Galerkin energy error with local h, trace degree and Sobolev regularity Theorem
- Local interpolation estimates on shape-regular affine meshes Theorem
Dependency tree · two levels
32 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 12 (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 4 (standard reference, not scraped)