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.
An ordinary derivative controls the Legendre tail with a factorial ratio
Statement
Assume the Axiom of Choice for the branch. Let be the real Legendre polynomial normalized by , and let be the orthogonal projection onto . For every integer , every integer , and every real-valued ,
For , every integer , and , . For the repeated derivative orthogonality identity is
Facts & Assumptions
Given: The Axiom of Choice; integers in the stated ranges; and a real-valued Sobolev class .
The Axiom of Choice is assumed only for the branch. (The Axiom of Choice)
The Rodrigues Legendre polynomials are mutually orthogonal in , have norm squared , and have degree with nonzero leading coefficient. (Legendre polynomials have explicit norms and weighted derivative orthogonality)
Polynomials are uniformly dense in the continuous real functions on (Polynomials are uniformly dense in for every closed interval), and smooth compactly supported functions are dense in (Smooth compactly supported functions of an open set are dense in ). Thus polynomials are dense in .
Every one-dimensional class on a bounded interval has an absolutely continuous representative satisfying ; this theorem assumes Full Choice. Apply it to . (One-dimensional functions have unique absolutely continuous representatives)
Cauchy–Schwarz makes each displayed polynomial pairing finite. Expanding the norm after subtracting a finite orthogonal projection gives Bessel's inequality without any infinite-dimensional projection theorem. (Cauchy–Schwarz: , with equality exactly for dependent pairs)
Proof
Fix and put . For , the polynomial has degree . Integrating by parts times moves the outer derivative block onto a polynomial and gives ; all boundary terms vanish because derivatives of of orders below vanish at both endpoints. The final polynomial paired with has degree at most , so [F1] makes the integral zero. The leading coefficient of is times the leading coefficient of . Orthogonality and the degree statement in [F1] therefore give , where .
For , integrate by parts times and use step 1.1 to obtain The first identity in [F1] makes this zero for and equal to for , proving the repeated derivative orthogonality formula.
Write . The absolutely continuous representatives in [F3] justify integrations by parts; all boundary terms vanish because has endpoint zeros of order . Step 1.1 then gives The functions are mutually orthogonal by step 2.1 and have squared norms . Applying finite Bessel inequalities to and then increasing the finite index set yields
Density [F2] and the best-approximation property of finite orthogonal projections imply in : first approximate by a polynomial and then take at least its degree. Orthogonality [F1] and Pythagoras give . Since increases for , step 3.1 bounds this tail by , which is the stated factorial estimate. When , the same finite Pythagoras identity directly gives contraction.
Depends on
- Legendre polynomials have explicit norms and weighted derivative orthogonality
- Polynomials are uniformly dense in $C([a,b],\mathbb R)$ for every closed interval
- Smooth compactly supported functions of an open set are dense in $L^2$
- One-dimensional $W^{1,p}$ functions have unique absolutely continuous representatives
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- The Axiom of Choice
Used by
Dependency tree · two levels
63 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)