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.
Weighted simplex polynomial projection has explicit p-rates
Statement
Let be the reference simplex of Matching affine simplicial meshes and shape regularity, let have nonnegative real entries, and let , where are its barycentric coordinates. Give polynomials the inner product . Put and let in this weighted inner product. For a finite sum , , define
and define as the completion of these finite sums. If , its orthogonal degree truncation obeys
For , . These are estimates in the explicitly coefficient-defined scale ; they do not identify that scale with ordinary unweighted .
Facts & Assumptions
Given: A dimension , , real exponents , and degree .
The reference simplex is a bounded nondegenerate simplex with barycentric coordinates; its matching-mesh and reference-map conventions are fixed by Matching affine simplicial meshes and shape regularity.
is finite-dimensional, and is positive in the open simplex and integrable. Thus its weighted inner product is positive definite on polynomials.
Proof
Since in the interior, a nonzero polynomial cannot have weighted square integral zero: continuity gives a ball on which its absolute value is bounded below by a positive number. Integrability follows from on the bounded simplex. Hence the weighted inner product is positive definite on each finite-dimensional polynomial space. Orthogonal projection onto therefore gives the finite-dimensional orthogonal decomposition . The scale in the Statement is the completion of this orthogonal-sum norm, so its coefficient description and truncation are well-defined.
For a finite sum , orthogonality gives , because is increasing for . Taking square roots proves the tail estimate for finite sums.
Truncation is contractive in every coefficient norm , and finite sums are dense by the definition of the completion. The finite-sum estimate in step 2.1 therefore passes to every . If , each degree layer has , so term by term; summing proves the inverse estimate. Neither argument invokes a derivative norm, which is why neither implies an unweighted Sobolev estimate.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · one level
1 result within one dependency step 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
- Matthias Braess and Christoph Schwab, Approximation on polyhedral domains with geometric meshes (standard reference, not scraped)
- Leszek F. Demkowicz, Mathematical Theory of Finite Elements (standard reference, not scraped)