Definition:Legendre Polynomial

From ProofWiki
Jump to navigation Jump to search


This page has been identified as a candidate for refactoring of advanced complexity.
Until this has been finished, please leave {{Refactor}} in the code.

New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only.

Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{Refactor}} from the code.



This article needs to be linked to other articles.
In particular: Some integral derivations
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{MissingLinks}} from the code.


Definition

The Legendre polynomials are the solutions to Legendre's differential equation.


This page or section has statements made on it that ought to be extracted and proved in a Theorem page.
In particular: The below needs a result page
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by creating any appropriate Theorem pages that may be needed.
To discuss this page in more detail, feel free to use the talk page.


These solutions form a polynomial sequence of orthogonal polynomials on the interval $\closedint {-1} 1$.


This article, or a section of it, needs explaining.
In particular: Is there a specific concept which is identified by the term "polynomial sequence", or is the word "polynomial" redundant here?
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by explaining it.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{Explain}} from the code.



Examples

The first five Legendre polynomials are:

\(\ds \map {P_0} x\) \(=\) \(\ds 1\)
\(\ds \map {P_1} x\) \(=\) \(\ds x\)
\(\ds \map {P_2} x\) \(=\) \(\ds \dfrac 1 2 \paren {3 x^2 - 1}\)
\(\ds \map {P_3} x\) \(=\) \(\ds \dfrac 1 2 \paren {5 x^3 - 3 x}\)
\(\ds \map {P_4} x\) \(=\) \(\ds \dfrac 1 8 \paren {35 x^4 - 30 x^2 + 3}\)


Bonnet's Recursion Formula

Legendre polynomials can be found using Bonnet's Recursion Formula.

$\paren {n + 1} \map {P_{n + 1} } x = \paren {2 n + 1} x \map {P_n} x - n \map {P_{n - 1} } x$


Length of Legendre Polynomial


This page has been identified as a candidate for refactoring of medium complexity.
In particular: This should be set up both as a definition page and a proof of its value.
Until this has been finished, please leave {{Refactor}} in the code.

New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only.

Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{Refactor}} from the code.


$\ds \norm {\map {P_n} x} = \sqrt {\int_{-1}^1 \paren {\map {P_n} X}^2 \rd x} = \sqrt {\frac 2 {2 n + 1} }$


Proof of Length

Applying Bonnet's Recursion Formula for $n - 1$:

$n \map {P_n} x = \paren {2 n - 1} x \map {P_{n - 1} } x - \paren {n - 1} \map {P_{n - 2} } x$

so:

$\map {P_n} x = \dfrac {2 n - 1} n x \map {P_{n - 1} } x - \dfrac {n - 1} n \map {P_{n - 2} } x$


Substituting for $\map {P_n} x$:

\(\ds \norm {\map {P_n} x}^2\) \(=\) \(\ds \int_{-1}^1 \map {P_n} x \map {P_n} x \rd x\)
\(\ds \) \(=\) \(\ds \int_{-1}^1 \map {P_n} x \paren {\frac {2 n - 1} n x \map {P_{n - 1} } x - \frac {n - 1} n \map {P_{n - 2} } x} \rd x\)
\(\ds \) \(=\) \(\ds \frac {2 n - 1} n \int_{-1}^1 x \map {P_n} x \map {P_{n - 1} } x \rd x - \frac {n - 1} n \int_{-1}^1 \map {P_n} x \map {P_{n - 2} } x \rd x\) Linear Combination of Definite Integrals


From Orthogonality of Legendre Polynomials:

$\ds \int_{-1}^1 \map {P_n} x \map {P_m} x \rd x = 0 \iff n \ne m$

so:

$\ds (1): \quad \norm {\map {P_n} x}^2 = \frac {2 n - 1} n \int_{-1}^1 x \map {P_n} x \map {P_{n - 1} } x \rd x$


From Bonnet's Recursion Formula:

$x \map {P_n} x = \dfrac {n + 1} {2 n + 1} \map {P_{n + 1} } x + \dfrac n {2 n + 1} \map {P_{n - 1} } x$


Substituting for $x \map {P_n} x$ in $(1)$:

\(\ds \norm {\map {P_n} x}^2\) \(=\) \(\ds \frac {2 n - 1} n \frac {n + 1} {2 n + 1} \int_{-1}^1 \map {P_{n + 1} } x \map {P_{n - 1} } x \rd x + \frac {2 n - 1} {2 n + 1} \int_{-1}^1 \map {P_{n - 1} } x \map {P_{n - 1} } x \rd x\)
\(\ds \) \(=\) \(\ds \frac{2 n - 1} {2 n + 1} \int_{-1}^1 \map {P_{n - 1} } x \map {P_{n - 1} } x \rd x\)
\(\ds \) \(=\) \(\ds \frac {2 n - 1} {2 n + 1} \norm {\map {P_{n - 1} } x}^2\)


Thus:


\(\ds \norm {\map {P_n} x}^2\) \(=\) \(\ds \frac {2 n - 1} {2 n + 1} \norm {\map {P_{n - 1} } x}^2\)
\(\ds \) \(=\) \(\ds \frac {2 n - 1} {2 n + 1} \frac {2 n - 3} {2 n - 1} \norm {\map {P_{n - 2} } x}^2\)
\(\ds \) \(=\) \(\ds \cdots\)
\(\ds \) \(=\) \(\ds \frac {2 n - 1} {2 n + 1} \frac {2 n - 3} {2 n - 1} \frac {2 n - 5} {2 n - 3} \dotsm \frac 3 5 \frac 1 3 \norm {\map {P_0} x}^2\)


Most of this cancels out, leaving:

$\norm {\map {P_n} x}^2 = \dfrac {\norm {\map {P_0} x}^2} {2 n + 1}$


It remains to compute the length of the first Legendre polynomial:

\(\ds \norm {\map {P_0} x}^2\) \(=\) \(\ds \int_{-1}^1 1 \rd x\)
\(\ds \) \(=\) \(\ds \bigintlimits x {-1} 1\) Primitive of Constant
\(\ds \) \(=\) \(\ds 2\)


Thus:

$\norm {\map {P_n} x}^2 = \dfrac 2 {2 n + 1}$

and so taking the square root:

$\norm {\map {P_n} x} = \sqrt {\dfrac 2 {2 n + 1} }$

$\blacksquare$


Source of Name

This entry was named for Adrien-Marie Legendre.


Sources

Retrieved from "https://proofwiki.org/w/index.php?title=Definition:Legendre_Polynomial&oldid=598349"