Alphabeta Math
TheoremStatement: 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.

Gaussian quadrature is exact through degree 2m−1 and has positive weights

Statement

Let (a,b,m,2m−1,μ) be moment data as in Positive-measure Gaussian quadrature moment data, and let Qm and wi be the rule and weights of The m-node Gaussian quadrature rule for a positive measure. For every real polynomial f of degree at most 2m−1, ∫[a,b]f(x) dμ(x)=Qm(f)=∑i=1mwif(xi). Moreover, wi>0 for every i and ∑iwi=μ([a,b]).

Facts & Assumptions

Given: Moment data, its m-node Gaussian rule, and a real polynomial f of degree at most 2m−1.

[F1]

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

[F2]

Monic orthogonal polynomials exist uniquely through the quadrature order: pm is monic of degree m and is orthogonal to all polynomials of degree less than m.

[F3]

The Gauss orthogonal polynomial has simple roots inside the interval and The Gaussian nodes, cardinal polynomials and weights are well-defined: the nodes are the distinct roots of pm, and the rule's weights and cardinal polynomials are defined.

[F4]

Division by a monic polynomial over a commutative ring: f=pms+t with either t=0 or deg⁡t<m.

[F5]

The m-node Gaussian quadrature rule for a positive measure: wi=∫ℓi dμ and Qm(f)=∑iwif(xi).

[F6]

Cardinal-polynomial interpolation, Cardinal interpolation functions are polynomials of the stated degrees, and Existence and uniqueness of the cardinal-polynomial interpolant: every polynomial t of degree at most m−1 satisfies t(x)=∑it(xi)ℓi(x).

[F7]

The polynomial moment pairing is a real inner product: a nonzero polynomial of degree at most m−1 has strictly positive squared integral.

[F8]

The Lebesgue integral is linear on L1(μ): the integral distributes over the finite polynomial sums used below.

Proof

1.1givenF1F2F4F8algebra

By [F4], write f=pms+t, where t=0 or deg⁡t<m. If s≠0, the leading term of pms has degree m+deg⁡s and cannot cancel against t, so m+deg⁡s=deg⁡f≤2m−1 and deg⁡s<m. The moments in these polynomials are finite by [F1]. If s=0, the integral of pms=0 is zero; otherwise orthogonality [F2] gives ∫pms dμ=0. Thus ∫f dμ=∫t dμ by [F8].

1.2F2F3F4F5algebra

At every node xi, pm(xi)=0, so f(xi)=t(xi) and [F5] gives Qm(f)=Qm(t).

1.3F5F6F8algebra

The cardinal interpolation identity [F6] gives t(x)=∑it(xi)ℓi(x). Integrating this finite sum and using [F5] and [F8] yields ∫t dμ=∑it(xi)∫ℓi dμ=∑iwit(xi)=Qm(t).

2.1step 1.1step 1.2step 1.3

Steps 1.1–1.3 give ∫f dμ=∫t dμ=Qm(t)=Qm(f), proving exactness for every such f.

3.1F6F7step 2.1algebra

For a fixed i, ℓi2 has degree at most 2m−2, so step 2.1 applied to this polynomial gives ∫ℓi2 dμ=Qm(ℓi2)=∑jwjℓi(xj)2=wi by the cardinal values in [F6]. The cardinal polynomial is nonzero because ℓi(xi)=1; [F7] therefore gives wi>0.

4.1givenF9step 2.1∎

Applying exactness to the constant polynomial 1 and then [F9] gives ∑iwi=∫1 dμ=μ([a,b]).

Depends on

Used by

Dependency tree · two levels

53 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