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.
Positive moment Gram matrices produce orthonormal polynomial families
Statement
Let be one factor law with admissible degree as in Finite product-law polynomial-chaos input data. The monomial classes are linearly independent in . Applying the finite Gram–Schmidt recursion to this ordered list gives real orthonormal polynomials , where has degree , positive leading coefficient, and .
Facts & Assumptions
Given: A probability law with finite moment and positive-definite monomial Gram matrix.
Finite product-law polynomial-chaos input data states that for every nonzero coefficient vector , the quadratic form is strictly positive.
The finite moment makes every monomial of degree at most integrable: for , .
On a real inner-product space, Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans constructs the finite orthonormal list by recursive subtraction and normalization, preserving each successive span.
The norm induced by a real or complex inner product defines normalization by the positive norm of each nonzero residual.
Proof
Let be the real vector space spanned by the formal monomials . For define . Every product has degree at most and is integrable by [F2], so the pairing is finite; linearity of the integral makes it bilinear and symmetric. If , then , which is positive for each nonzero formal polynomial by [F1]. Thus this is an inner product on .
Every has finite squared integral by [F2], so it defines an class. If that class is zero, then almost everywhere and ; by [F1] its coefficient vector must be zero. Thus the class map is injective and the monomial classes are linearly independent. The formal monomials are also independent by uniqueness of their coefficient lists, so [F3] applies to this list in . Its residual at stage is minus a polynomial of degree at most , so it has degree and leading coefficient .
Each residual is nonzero in by its degree and leading coefficient, so [F4] makes its norm strictly positive. The normalized residual is orthogonal to the preceding polynomials and has positive leading coefficient. At , the residual is and its norm is because is a probability law; hence . This proves the stated finite orthonormal family.
Depends on
- Finite product-law polynomial-chaos input data
- Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans
- The norm $\lVert v\rVert=\sqrt{\langle v,v\rangle}$ induced by a real or complex inner product
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Orthogonal vectors and subspaces, orthogonal and orthonormal sets, and orthonormal bases
- Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials
Used by
- A Cauchy input has no L2 degree-one polynomial chaos Counterexample
- Finite support can make a higher-degree moment Gram matrix singular Counterexample
- Finite orthonormal polynomial tensor basis Definition
- A two-state uncertain reaction rate has an exact degree-one chaos expansion Example
- Polynomial-chaos coefficients group by variable support Example
- Independent polynomial-chaos tensor products are orthonormal Theorem
Dependency tree · two levels
22 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
- Dongbin Xiu and George Em Karniadakis, The Wiener–Askey Polynomial Chaos for Stochastic Differential Equations, §4 (standard reference, not scraped)
- Bruno Sudret, Polynomial Chaos Expansions and Stochastic Finite Element Methods, §§3.2.1–3.2.2 (standard reference, not scraped)