Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Monic orthogonal polynomials satisfy a three-term recurrence

Statement

Let (a,b,m,r,μ) be moment data from Positive-measure Gaussian quadrature moment data with r≥2m−1, and let p0,…,pm be the monic orthogonal polynomials of Monic orthogonal polynomials exist uniquely through the quadrature order. For 0≤j<m put hj:=∫[a,b]pj(x)2 dμ(x),αj:=∫[a,b]x pj(x)2 dμ(x)hj. For 1≤j<m put βj:=hj/hj−1. These numbers are defined, hj>0, and βj>0. The recurrence is xp0=p1+α0p0 and, for 1≤j<m, xpj=pj+1+αjpj+βjpj−1. Only moments through degree 2m−1 are used.

Facts & Assumptions

Given: The stated moment data and monic orthogonal family.

[F1]

Positive-measure Gaussian quadrature moment data: moments through degree 2m−1 are finite.

[F2]

The polynomial moment pairing is a real inner product: the moment pairing is symmetric, bilinear, and positive definite on each such space.

[F3]

Monic orthogonal polynomials exist uniquely through the quadrature order: each pj is monic of degree j and orthogonal to every polynomial of smaller degree.

[F4]

Degree inequalities for sums and products over a commutative ring: a sum with cancellation of top coefficients has degree bounded by the largest remaining degree; the leading coefficient of a product is the product of leading coefficients.

[F5]

The Lebesgue integral is linear on L1(μ) and The reals form a field: the displayed polynomial integrals are linear and real division by a nonzero norm is defined.

Proof

1.1F1F2F3F5algebra

For j<m, pj2 and xpj2 have degrees at most 2j and 2j+1, both at most 2m−1. Thus the moments in hj and αj are finite by [F1]. Since pj is nonzero, [F2] gives hj>0, so αj is defined; for j≥1, the same positivity for pj−1 gives βj>0.

1.2F3F4construct

The polynomials p0,…,pj form a basis for the polynomials of degree at most j: their distinct degrees and unit leading coefficients permit successive subtraction of the top term. Because xpj−pj+1 has degree at most j by cancellation of the leading term, write it in this basis.

2.1F2F3step 1.2algebra

For k≤j−2, symmetry of the real pairing gives ⟨xpj,pk⟩μ=⟨pj,xpk⟩μ=0, since xpk has degree at most j−1. As the basis in step 1.2 is orthogonal and each squared norm is positive by [F2], the expansion has no pk term for k≤j−2. Its pj coefficient is ⟨xpj,pj⟩μ/hj=αj.

2.2F2F3step 1.1algebra

For j≥1, the pj−1 coefficient is ⟨xpj,pj−1⟩μhj−1=⟨pj,xpj−1⟩μhj−1=hjhj−1=βj. Indeed, xpj−1−pj has degree at most j−1, so it is orthogonal to pj by [F3].

3.1step 1.2step 2.1step 2.2algebra∎

The expansion in step 1.2 therefore has only the displayed pj and, when j≥1, pj−1 terms. Rearranging it yields the stated recurrence for every 0≤j<m.

Depends on

Used by

Dependency tree · two levels

39 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