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

Legendre-Gauss-Lobatto nodes are distinct and interior critical points are simple

Statement

For every integer p≥1, the Legendre polynomial Pp has exactly p simple roots in (−1,1), and Pp′ has exactly p−1 simple roots in (−1,1), one between each consecutive pair of roots of Pp. Consequently, the p+1 nodes consisting of −1, 1, and the roots of Pp′ are pairwise distinct.

Facts & Assumptions

Given: An integer p≥1 and the Legendre polynomials Pn.

[F1]
[F2]

Legendre polynomials have explicit norms and weighted derivative orthogonality: Pp is orthogonal in unweighted L2(−1,1) to every polynomial of degree less than p.

Proof

1.1F1F2givenalgebra

Suppose Pp has only m<p sign-changing roots r1,…,rm in (−1,1) and set q(x)=∏j=1m(x−rj), with q=1 if m=0. At each sign-changing root both Pp and q change sign, while at every other real root Pp does not change sign; therefore Ppq has one constant sign on (−1,1) and is not identically zero. It is continuous and nonzero on some open interval, so its integral is nonzero. But deg⁡q=m<p, and [F2] gives ∫−11Ppq=0, a contradiction. Thus Pp has at least p sign-changing roots in the open interval.

2.1F1F3step 1.1givenalgebra∎

A degree-p polynomial cannot have more than p distinct roots. The p roots obtained in step 1.1 therefore exhaust its degree; each has multiplicity one and there are no other roots. Rolle's theorem [F3] between consecutive roots gives p−1 distinct roots of Pp′ in (−1,1). Since Pp′ has degree p−1, these are all its roots and each is simple. None equals an endpoint, so adjoining −1 and 1 gives p+1 distinct nodes, including the case p=1 where there are no interior critical points.

Depends on

Used by

Dependency tree · two levels

24 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