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.
The Gauss orthogonal polynomial has simple roots inside the interval
Statement
Let be moment data from Positive-measure Gaussian quadrature moment data, with , and let be the monic orthogonal polynomial from Monic orthogonal polynomials exist uniquely through the quadrature order. Then has exactly distinct roots , each simple, and
Facts & Assumptions
Given: The stated moment data and its degree- monic orthogonal polynomial .
Positive-measure Gaussian quadrature moment data: the relative support of contains at least distinct points and all moments through degree are finite.
Monic orthogonal polynomials exist uniquely through the quadrature order: is monic of degree and for every polynomial of degree less than .
A nonzero real polynomial of degree has no more than distinct real roots: a nonzero degree- polynomial has at most distinct real roots.
Monotonicity and nonnegative homogeneity of the nonnegative integral, The nonnegative integral agrees with the simple integral on simple functions, and The integral of a nonnegative simple function: if a nonnegative integrable function is bounded below by on a Borel set , its integral is at least .
The Lebesgue integral is linear on : the integral is linear on integrable real functions.
A finite product of monic linear factors is monic and Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials: the product of the linear factors at distinct real numbers is monic of degree .
The image of an interval under a continuous real function is order-convex, hence an interval, and the image of a closed bounded interval is a closed bounded interval: the image of an interval under a continuous real function is an interval.
The reals form a totally ordered field: the real order is total, so an interval in that avoids lies wholly on one side of .
Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials: formal polynomials are their coefficient lists, so cancellation of equal top coefficients leaves degree at most one less.
Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function: polynomial functions and their finite sums and products are continuous.
Proof
Call an interior root sign-changing if has opposite nonzero signs on the two adjacent intervals containing no root. Let be the set of such roots; it is finite by [F3]. Suppose, for contradiction, that has elements, and put , with the empty product equal to . Between consecutive roots of , the product is continuous and nonzero, so its image is an interval avoiding and its sign is constant by [F7]–[F8]. Crossing a root in flips both factors; crossing any other root of flips neither product sign. Thus has one weak sign on .
Since , orthogonality [F2] gives .
The polynomial has at most distinct roots by [F3]. The support condition [F1] therefore supplies a support point with ; as every root of is a root of , also . Continuity of gives a relative open neighborhood of on which for some and the sign of is unchanged. This neighborhood is Borel and by the definition of support.
If on , [F4] gives . If , apply [F4] to and use [F5] to obtain . Both contradict step 2.1, so .
By [F3], has at most distinct roots, and step 3.1 gives at least , so . Write them as and let . Both and are monic of degree by [F2, F6]. Their degree- coefficients cancel, so their difference is zero or has degree at most by [F9]. It vanishes at all distinct ; if nonzero, [F3] is contradicted. Thus , so each root occurs as exactly one linear factor and is simple.
Depends on
- Positive-measure Gaussian quadrature moment data
- Monic orthogonal polynomials exist uniquely through the quadrature order
- A nonzero real polynomial of degree $n$ has no more than $n$ distinct real roots
- The Lebesgue integral is linear on $L^1(\mu)$
- Monotonicity and nonnegative homogeneity of the nonnegative integral
- The nonnegative integral agrees with the simple integral on simple functions
- The integral of a nonnegative simple function
- A finite product of monic linear factors is monic
- The image of an interval under a continuous real function is order-convex, hence an interval, and the image of a closed bounded interval is a closed bounded interval
- Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
- The reals form a totally ordered field
Used by
- Certified Gaussian nodes and weights by Golub–Welsch Algorithm
- The m-node Gaussian quadrature rule for a positive measure Definition
- Four two-node Gaussian rules give a sixteen-node tensor rule Example
- The Gaussian nodes, cardinal polynomials and weights are well-defined Lemma
- Certified Golub–Welsch intervals contain the Gaussian nodes and weights Theorem
- Consecutive Gaussian orthogonal polynomials and Jacobi truncations strictly interlace Theorem
- Gaussian quadrature is exact through degree 2m−1 and has positive weights Theorem
- Tensor-product Gaussian quadrature preserves coordinatewise exactness Theorem
- The Jacobi matrix spectrum is the set of Gauss nodes Theorem
Dependency tree · two levels
63 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)