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 angular completeness
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let be the Legendre polynomials of Legendre Rodrigues equation and the associated functions of Associated Legendre function normalization, and let with inner product linear in the first argument (The space as the quotient by null functions, Complex Lp classes and Euclidean test-function conventions). Then, for each fixed :
(a) for every the polynomial has degree and nonzero leading coefficient, and for every the polynomials form a basis of the space of polynomial functions of degree at most on ;
(b) the family has dense linear span in : if satisfies for every , then almost everywhere; consequently the orthogonal family is complete in and its normalization is a Hilbert basis of , so every has with the finite-subset-net convergence of Orthonormal families, complete orthonormal systems and Hilbert bases;
(c) for every fixed the orthogonal projection of onto the one-dimensional span of is , and .
Facts & Assumptions
Given: ; the Legendre polynomials ; the functions ; the complex Hilbert space .
is a polynomial of degree with nonzero leading coefficient (Legendre Rodrigues equation). Iterating the monomial derivative rule (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term) and factorial recursion (The factorial and the falling factorial , defined by recursion in ) gives, for , leading term in ; lower-degree terms either vanish or have smaller degree. Thus its degree is , and .
is continuous on , the family is orthogonal in , and (Associated Legendre function normalization).
The real polynomial functions are uniformly dense in the real continuous functions on : for every continuous and every there is a polynomial with (Real Stone–Weierstrass theorem for compact Hausdorff spaces).
Under Countable Choice, for every bounded interval the complex continuous functions on are dense in complex for , in particular in (Continuous functions are dense in of finite tori and of bounded intervals (2)). For continuous , integrating over gives , hence by the defining norm (The space as the quotient by null functions, Complex Lp classes and Euclidean test-function conventions).
For a family that is orthonormal and complete in a Hilbert space, the expansion, Parseval identity and coefficient formulas hold with finite-subset-net convergence (Orthonormal families, complete orthonormal systems and Hilbert bases, Parseval equivalences for an orthonormal family).
Proof
[(a)] By [F1], has degree and nonzero leading coefficient for each . Hence in the ordered list the -th polynomial has degree , : the leading-degree matrix is triangular with nonzero diagonal, so the polynomials are linearly independent; they are vectors in the -dimensional space of polynomials of degree at most , hence a basis.
[(b), first reduction] Let satisfy for all , and put . Since is continuous and bounded on , and ; moreover for every , by [F2]. By step 1.1, every polynomial of degree at most is a linear combination of , so for every polynomial .
[(b), density step] Polynomials are dense in : given and , [F4] supplies a continuous on with , and apply [F3] separately to the real and imaginary parts of , obtaining real polynomials whose respective uniform errors are below , and put ; then , so by [F4] (applied to the interval length ), whence . Applying this to the complex-valued componentwise (real and imaginary parts) gives polynomials with ; since for all polynomials, Cauchy–Schwarz [F5] gives , so almost everywhere. On the factor is strictly positive, so almost everywhere.
[(b), completeness and expansion] By [F2] the family is orthogonal with all norms nonzero, so is orthonormal; if a vector of is orthogonal to the whole family, it is orthogonal to every and vanishes by step 3.1, so the orthonormal family is complete in the sense of [F6]; the expansion, normalization and coefficient formulas follow from [F6].
[(c)] The orthogonal projection onto the span of a unit vector is , and for an unnormalized nonzero vector it is ; with and the inner product linear in the first argument this is the displayed formula. Indeed its value lies in the span of , and its residual has zero inner product with , uniquely determining the orthogonal projection; Cauchy–Schwarz bounds its norm by . The explicit value of follows from (the leading coefficient of times ) inserted into the definition of .
Depends on
Legendre Rodrigues equation
Associated Legendre function normalization
Real Stone–Weierstrass theorem for compact Hausdorff spaces
Continuous functions are dense in of finite tori and of bounded intervals
Cauchy-Schwarz inequality for
The space as the quotient by null functions
Complex Lp classes and Euclidean test-function conventions
Orthonormal families, complete orthonormal systems and Hilbert bases
Parseval equivalences for an orthonormal family
The factorial and the falling factorial , defined by recursion in
For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term
The natural numbers (von Neumann)
The Axiom of Countable Choice ()
Dependency tree · 2 levels
Sources
- S. Axler, P. Bourdon, W. Ramey, Harmonic Function Theory, 2nd edition, author-hosted full text, Chapter 5, printed pp. 77-83 (Spherical Harmonic Decomposition of L2(S); Stone-Weierstrass density step in the proof of Theorem 5.12)
- NIST Digital Library of Mathematical Functions, §18.2(viii), 'Uniqueness of Orthogonality Measure and Completeness' (completeness criterion and bounded-interval conclusion for orthogonal polynomial systems)
- NIST Digital Library of Mathematical Functions, §18.3, Table 18.3.1 (Legendre orthogonality, weight, and standardization)