Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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 polynomials have explicit norms and weighted derivative orthogonality

Statement

For m,n≥0, the polynomials of Legendre polynomials by Rodrigues' formula and their unweighted pairing satisfy ∫−11Pn(x)Pm(x) dx=22n+1 δmn,∫−11(1−x2)Pn′(x)Pm′(x) dx=2n(n+1)2n+1 δmn, where δmn=1 if m=n and 0 otherwise. Each Pn has degree n and nonzero leading coefficient, so P0,…,PN form a basis of polynomials of degree at most N.

Facts & Assumptions

Given: Nonnegative integers m,n and the Rodrigues polynomials Pk.

[F1]

Legendre polynomials by Rodrigues' formula and their unweighted pairing: Pn=(2nn!)−1Dn(x2−1)n and ⟨p,q⟩L=∫−11pq.

[F2]

If u,v are differentiable on [a,b] with u′,v′ integrable, then ∫abuv′=u(b)v(b)−u(a)v(a)−∫abu′v: for differentiable factors with integrable derivatives on a closed interval, ∫uv′=[uv]−∫u′v.

Proof

1.1F1F2F3F4giveninduction

Write (x2−1)n=(x−1)n(x+1)n. For every j<n, its jth derivative vanishes at both endpoints: by the product rule, every term differentiates each factor at most j<n times and retains a positive power of the factor that vanishes at that endpoint. Thus n integrations by parts in [F2] give, for every polynomial q of degree less than n, ∫−11Pnq=(−1)n2nn!∫−11(x2−1)nq(n)=0, because q(n)=0 by [F3]. Hence Pn is orthogonal to every lower-degree polynomial.

2.1F1F3step 1.1algebra

The leading term of (x2−1)n is x2n; differentiating it n times gives (2n)!/n! times xn by [F3]. All other terms have lower degree after differentiation. Therefore Pn has degree n and leading coefficient κn=(2n)!/(2n(n!)2)>0. The distinct degrees imply the family P0,…,PN is linearly independent and spans every polynomial of degree at most N, by successive elimination of leading terms.

3.1F1F2F3step 1.1step 2.1algebra

Since Pn−κnxn has degree less than n, step 1.1 gives ∫−11Pn2=κn∫−11Pnxn. Apply [F2] n times to the Rodrigues formula against xn. The endpoint terms vanish as in step 1.1 and (xn)(n)=n!, so ∫−11Pnxn=12n∫−11(1−x2)n dx.

4.1F2F3F4step 1.1step 2.1step 3.1inductionalgebra

Put Jn=∫−11(1−x2)ndx. Then J0=2. For n≥1, the endpoint values of x(1−x2)n are zero, so integrating its derivative gives 0=Jn−2n(Jn−1−Jn),Jn=2n2n+1Jn−1. Induction yields Jn=22n+1(n!)2/(2n+1)!. Substituting this and κn from step 2.1 into step 3.1 gives ∫Pn2=2/(2n+1). Together with step 1.1 this proves the first orthogonality formula, including n=0.

5.1F1F2F3F4step 1.1step 2.1step 4.1algebra

When n=0, P0=1 and Q0=−((1−x2)P0′)′=0, so Q0=0⋅P0. Now take n≥1 and define Qn=−((1−x2)Pn′)′. Its leading term is n(n+1)κnxn, so Qn−n(n+1)Pn has degree less than n. For any polynomial q of degree less than n, two integrations by parts give ∫−11Qnq=∫−11(1−x2)Pn′q′=−∫−11Pn((1−x2)q′)′=0, where both boundary terms vanish because of the factor 1−x2, and the last polynomial paired with Pn has degree less than n, so step 1.1 applies. Therefore Qn−n(n+1)Pn is a lower-degree polynomial orthogonal to every lower-degree polynomial. Expand it in the basis from step 2.1; the first formula and the positive norms in step 4.1 force every coefficient to be zero. Thus Qn=n(n+1)Pn.

6.1F1F2step 1.1step 4.1step 5.1algebra∎

One integration by parts and step 5.1 give ∫−11(1−x2)Pn′Pm′=∫−11QnPm=n(n+1)∫−11PnPm. The first formula, already proved in step 4.1 and step 1.1, yields the displayed weighted derivative identity for every m,n≥0.

Depends on

Used by

Dependency tree · two levels

27 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