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.
Constructive ordinary Sobolev polynomial approximation on triangles
Statement
Assume the Axiom of Choice. Let , let be an integer, let be an integer, and put and
There is a bounded linear map , where is the restriction of real polynomials in of total degree at most . It is explicitly defined in the proof from the reference-simplex extension, a unique moment polynomial, and finite Legendre projections, and satisfies
Here is independent of and is the product of a fixed reference extension bound, the reference moment-projection bound, and an absolute tensor-projection constant; no useful growth bound in is asserted. For a shape-regular affine triangle of diameter , affine transport gives
If , then . This is a conservative ordinary Sobolev rate; it is neither an optimal estimate nor an analytic growth estimate for .
Facts & Assumptions
Given: Full Choice; the reference triangle ; integers , ; and with weak derivatives and Sobolev norms as in Integer-order Sobolev spaces and their norms.
Full Choice is used by the reference-simplex extension and by the one-dimensional Sobolev representative supplier. (The Axiom of Choice)
The ordinary Legendre projection obeys the factorial derivative-tail estimate for every integer derivative order. The endpoint-anchored operator used below is defined locally from this projection. (An ordinary derivative controls the Legendre tail with a factorial ratio)
The reference simplex has a bounded linear extension ; write . (A reference simplex is an integer-order Sobolev extension domain)
The unique polynomial whose derivative moments through order match those of satisfies . (Bramble–Hilbert approximation on a reference simplex)
Smooth functions on are dense in , and one-dimensional weak derivatives through order have absolutely continuous representatives on the interval. (Compactly supported smooth functions are dense in W^{k,p}(R^n), One-dimensional functions have unique absolutely continuous representatives)
Fubini and Cauchy–Schwarz justify the tensor-section norms and primitive bounds. (Fubini's theorem for L^1 functions on a sigma-finite product, Cauchy–Schwarz: , with equality exactly for dependent pairs)
Affine pullback derivatives and Sobolev seminorms scale with the singular values, determinant, and shape-regularity bound. (Shape regularity controls affine simplex geometry)
The finite-dimensional tensor polynomial space is closed in . (A finite-dimensional normed subspace is closed)
Proof
On define where is the ordinary Legendre projection. Here implies . For , the endpoint values are those of its absolutely continuous representatives from [F4]. The polynomial has degree at most and matches at . Its second derivative is an contraction; integrating twice and using the one-dimensional endpoint estimate gives with absolute . For every integer with , the error has and . Apply the Legendre tail estimate to with derivative order and projection degree ; the factorial ratio is Two integrations of , with Cauchy–Schwarz [F5], give . The same inequality holds for each derivative of order at most two.
Put , apply in each coordinate on , and write . For smooth , Let . For the first term choose , so , , , and . Step 1.1 on the sections of bounds by . For the second term, the uniform bound in step 1.1 bounds its norm by . For each such , choose ; then , , and . Apply the error estimate of step 1.1 to ; it bounds every derivative of order in this sum by . Because , all terms are bounded by . Fubini [F5] and addition over give For the inputs used below, namely restrictions of extensions, choose smooth whole-space approximants by [F4]. The estimate on their differences makes a well-defined limit. Every smooth approximant has image in , so closedness [F7] gives and the same bound for the limit.
Let and . By [F3], . Set and define This map is linear. The first summand has degree at most ; the second lies in . Since on , step 2.1 and [F2]–[F3] yield This identifies the constant as the absolute tensor constant times the fixed extension and moment bounds; no growth in is asserted.
Transport step 3.1 to a shape-regular affine triangle . For and , two-dimensional affine pullback gives for , and by [F6]. This proves the displayed full scaled estimate. Finally, is a product of consecutive integers beginning with . If and , then ; taking square roots yields .
Depends on
- An ordinary derivative controls the Legendre tail with a factorial ratio
- Integer-order Sobolev spaces and their norms
- A reference simplex is an integer-order Sobolev extension domain
- Compactly supported smooth functions are dense in W^{k,p}(R^n)
- Bramble–Hilbert approximation on a reference simplex
- Shape regularity controls affine simplex geometry
- One-dimensional $W^{1,p}$ functions have unique absolutely continuous representatives
- Fubini's theorem for L^1 functions on a sigma-finite product
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- A finite-dimensional normed subspace is closed
- The Axiom of Choice
Used by
Dependency tree · two levels
87 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
- Shen and Tang, Spectral and High-Order Methods with Applications (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 30: hp Finite Elements (standard reference, not scraped)