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 be moment data as in Positive-measure Gaussian quadrature moment data, and let and be the rule and weights of The m-node Gaussian quadrature rule for a positive measure. For every real polynomial of degree at most , Moreover, for every and .
Facts & Assumptions
Given: Moment data, its -node Gaussian rule, and a real polynomial of degree at most .
Positive-measure Gaussian quadrature moment data: all moments through degree are finite.
Monic orthogonal polynomials exist uniquely through the quadrature order: is monic of degree and is orthogonal to all polynomials of degree less than .
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 , and the rule's weights and cardinal polynomials are defined.
Division by a monic polynomial over a commutative ring: with either or .
Cardinal-polynomial interpolation, Cardinal interpolation functions are polynomials of the stated degrees, and Existence and uniqueness of the cardinal-polynomial interpolant: every polynomial of degree at most satisfies .
The polynomial moment pairing is a real inner product: a nonzero polynomial of degree at most has strictly positive squared integral.
The Lebesgue integral is linear on : the integral distributes over the finite polynomial sums used below.
Proof
By [F4], write , where or . If , the leading term of has degree and cannot cancel against , so and . The moments in these polynomials are finite by [F1]. If , the integral of is zero; otherwise orthogonality [F2] gives . Thus by [F8].
At every node , , so and [F5] gives .
The cardinal interpolation identity [F6] gives . Integrating this finite sum and using [F5] and [F8] yields
Steps 1.1–1.3 give , proving exactness for every such .
For a fixed , has degree at most , so step 2.1 applied to this polynomial gives by the cardinal values in [F6]. The cardinal polynomial is nonzero because ; [F7] therefore gives .
Applying exactness to the constant polynomial and then [F9] gives .
Depends on
- The m-node Gaussian quadrature rule for a positive measure
- The Gaussian nodes, cardinal polynomials and weights are well-defined
- The polynomial moment pairing
- The polynomial moment pairing is a real inner product
- Monic orthogonal polynomials exist uniquely through the quadrature order
- The Gauss orthogonal polynomial has simple roots inside the interval
- Cardinal-polynomial interpolation
- Cardinal interpolation functions are polynomials of the stated degrees
- Existence and uniqueness of the cardinal-polynomial interpolant
- Division by a monic polynomial over a commutative ring
- The Lebesgue integral is linear on $L^1(\mu)$
- Positive-measure Gaussian quadrature moment data
- The integral of a nonnegative simple function
- The nonnegative integral agrees with the simple integral on simple functions
Used by
- A signed Simpson-Smolyak weight makes a nonnegative chaos coefficient estimate negative Example
- A two-node Gaussian Nyström rule solves a rank-two separable equation exactly Example
- Four two-node Gaussian rules give a sixteen-node tensor rule Example
- Gaussian and Simpson mass assembly give distinct exact and approximate checks Example
- The two-node Gauss–Legendre rule is exact through degree three Example
- Two Gaussian weights are the squared norms of the two cardinal polynomials Example
- Two-node Gauss collocation gives the exact endpoint for a nonstiff cubic IVP Example
- Two-node Gauss is exact through degree three but not for x to the fourth Example
- A Gaussian collocation defect has a high-order weighted endpoint bound Lemma
- A tensor product of two positive Gaussian rules has a derivative error bound Theorem
- Gauss–Jacobi exactness and the derivative remainder Theorem
- Gaussian quadrature exactly assembles the orthogonal Galerkin mass matrix Theorem
- Gaussian quadrature has the Hermite mean-value remainder Theorem
- Gaussian weights equal the total mass times a Jacobi eigenvector's first-coordinate square Theorem
- Tensor-product Gaussian quadrature preserves coordinatewise exactness Theorem
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
- John A. Gubner, Gaussian Quadrature and the Eigenvalue Problem, §§2–5, 2020 (standard reference, not scraped)
- MATH 373 Lecture Notes, Lecture 14: Gaussian Quadrature, §§10.2–10.5 (standard reference, not scraped)
- Walter Gautschi, The Interplay Between Classical Analysis and (Numerical) Linear Algebra, §2.1 (standard reference, not scraped)