Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 (a,b,m,r,μ) be moment data from Positive-measure Gaussian quadrature moment data, with r≥2m−1, and let pm be the monic orthogonal polynomial from Monic orthogonal polynomials exist uniquely through the quadrature order. Then pm has exactly m distinct roots a<x1<⋯<xm<b, each simple, and pm(X)=∏i=1m(X−xi).

Facts & Assumptions

Given: The stated moment data and its degree-m monic orthogonal polynomial pm.

[F1]

Positive-measure Gaussian quadrature moment data: the relative support of μ contains at least m+1 distinct points and 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 ∫pmq dμ=0 for every polynomial q of degree less than m.

[F3]

A nonzero real polynomial of degree n has no more than n distinct real roots: a nonzero degree-d polynomial has at most d distinct real roots.

[F4]

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 c>0 on a Borel set U, its integral is at least cμ(U).

[F5]

The Lebesgue integral is linear on L1(μ): the integral is linear on integrable real functions.

[F6]

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 m distinct real numbers is monic of degree m.

[F8]

The reals form a totally ordered field: the real order is total, so an interval in R that avoids 0 lies wholly on one side of 0.

[F9]

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.

Proof

1.1F2F3F6F7F8F10assume-contraalgebraconstruct

Call an interior root sign-changing if pm has opposite nonzero signs on the two adjacent intervals containing no root. Let R be the set of such roots; it is finite by [F3]. Suppose, for contradiction, that R has k<m elements, and put q(X)=∏s∈R(X−s), with the empty product equal to 1. Between consecutive roots of pm, the product h=pmq is continuous and nonzero, so its image is an interval avoiding 0 and its sign is constant by [F7]–[F8]. Crossing a root in R flips both factors; crossing any other root of pm flips neither product sign. Thus h has one weak sign on [a,b].

2.1F2step 1.1

Since deg⁡q=k<m, orthogonality [F2] gives ∫h dμ=0.

2.2F1F3F6F10step 1.1choose

The polynomial pm has at most m distinct roots by [F3]. The support condition [F1] therefore supplies a support point y with pm(y)≠0; as every root of q is a root of pm, also h(y)≠0. Continuity of h gives a relative open neighborhood U of y on which ∣h∣≥c for some c>0 and the sign of h is unchanged. This neighborhood is Borel and μ(U)>0 by the definition of support.

3.1F4F5step 2.1step 2.2algebra

If h≥0 on [a,b], [F4] gives ∫h dμ≥cμ(U)>0. If h≤0, apply [F4] to −h and use [F5] to obtain ∫h dμ<0. Both contradict step 2.1, so k≥m.

4.1F2F3F6F9step 3.1discharge-contradictionalgebra∎

By [F3], pm has at most m distinct roots, and step 3.1 gives at least m, so k=m. Write them as x1,…,xm∈(a,b) and let s(X)=∏i=1m(X−xi). Both s and pm are monic of degree m by [F2, F6]. Their degree-m coefficients cancel, so their difference is zero or has degree at most m−1 by [F9]. It vanishes at all m distinct xi; if nonzero, [F3] is contradicted. Thus pm=s, so each root occurs as exactly one linear factor and is simple.

Depends on

Used by

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