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-measure Gaussian quadrature moment data
Definition
Let be real numbers, let be an integer, and let . A Gaussian quadrature moment datum of order is a finite positive measure on the relative Borel sigma-algebra (The Borel sigma-algebra of a topological space, Measure spaces, Measures on sigma-algebras, Finite, sigma-finite, and semifinite measures) such that , and whose relative support contains at least distinct points. For every integer , require to be integrable with respect to (Integrable real and complex functions, and their integrals) and put . Powers use the natural-exponent recursion of Integer powers , with for every real , including ; thus is the integral of the constant function .
The branch supplies all moments used to construct the monic degree- orthogonal polynomial and prove rule exactness. The stronger branch also defines its squared norm and is used for the remainder formula. Because is bounded and is finite, these absolute-moment integrability conditions follow from finiteness; they are stated to make the two moment interfaces explicit.
Depends on
Used by
- Certified Gaussian nodes and weights by Golub–Welsch Algorithm
- Coordinatewise product-moment functional for tensor polynomials Definition
- The Gauss–Jacobi quadrature rule Definition
- The m-node Gaussian quadrature rule for a positive measure Definition
- The polynomial moment pairing Definition
- Weighted orthogonal-polynomial Galerkin spaces and spectral scale Definition
- A two-node Gaussian Nyström rule solves a rank-two separable equation exactly 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
- 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 is exact through degree three but not for x to the fourth Example
- A residual and spectral gap bound a Gaussian weight error Lemma
- Gauss–Jacobi nodes and weights are well-defined Lemma
- Lebesgue measure on the unit interval supplies Gaussian moment data Lemma
- Monic orthogonal polynomials satisfy a three-term recurrence Lemma
- One-node Gauss data are midpoint data Lemma
- Tensor product moments equal integration against the finite product measure Lemma
- The Gaussian nodes, cardinal polynomials and weights are well-defined Lemma
- A tensor product of two positive Gaussian rules has a derivative error bound Theorem
- Certified Golub–Welsch intervals contain the Gaussian nodes and weights Theorem
- Consecutive Gaussian orthogonal polynomials and Jacobi truncations strictly interlace Theorem
- Gaussian quadrature exactly assembles the orthogonal Galerkin mass matrix Theorem
- Gaussian quadrature has the Hermite mean-value remainder Theorem
- Gaussian quadrature is exact through degree 2m−1 and has positive weights Theorem
- M-node Gauss collocation has local defect order 2M Theorem
- Monic orthogonal polynomials exist uniquely through the quadrature order Theorem
- The Gauss orthogonal polynomial has simple roots inside the interval Theorem
- The Jacobi matrix spectrum is the set of Gauss nodes Theorem
- The polynomial moment pairing is a real inner product Theorem
Dependency tree · two levels
26 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)