Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 ρj be one factor law with admissible degree pj as in Finite product-law polynomial-chaos input data. The monomial classes 1,y,…,ypj are linearly independent in L2(ρj). Applying the finite Gram–Schmidt recursion to this ordered list gives real orthonormal polynomials ϕj,0,…,ϕj,pj, where ϕj,k has degree k, positive leading coefficient, and ϕj,0=1.

Facts & Assumptions

Given: A probability law ρj with finite 2pj moment and positive-definite monomial Gram matrix.

[F1]

Finite product-law polynomial-chaos input data states that for every nonzero coefficient vector c, the quadratic form cTGjc is strictly positive.

[F2]

The finite 2pj moment makes every monomial of degree at most 2pj integrable: for 0≤q≤2pj, ∣y∣q≤1+∣y∣2pj.

[F3]

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.

[F4]

The norm ∥v∥=⟨v,v⟩ induced by a real or complex inner product defines normalization by the positive norm of each nonzero residual.

Proof

1.1givenF1F2algebra

Let Ppj be the real vector space spanned by the formal monomials 1,y,…,ypj. For q,r∈Ppj define ⟨q,r⟩ρj:=∫q(y)r(y) dρj(y). Every product qr has degree at most 2pj and is integrable by [F2], so the pairing is finite; linearity of the integral makes it bilinear and symmetric. If q(y)=∑r=0pjcryr, then ⟨q,q⟩ρj=cTGjc, which is positive for each nonzero formal polynomial by [F1]. Thus this is an inner product on Ppj.

2.1step 1.1F1F2F3algebra

Every q∈Ppj has finite squared integral by [F2], so it defines an L2(ρj) class. If that class is zero, then q=0 almost everywhere and ∫q2 dρj=0; 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 Ppj. Its residual at stage k is yk minus a polynomial of degree at most k−1, so it has degree k and leading coefficient 1.

3.1givenF3F4step 2.1algebra∎

Each residual is nonzero in Ppj 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 k=0, the residual is 1 and its norm is ∫1 dρj=1 because ρj is a probability law; hence ϕj,0=1. This proves the stated finite orthonormal family.

Depends on

Used by

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