Legendre polynomials

From HandWiki
Short description: System of complete and orthogonal polynomials

The first six Legendre polynomials

In mathematics, Legendre polynomials, named after Adrien-Marie Legendre (1782), are a system of complete and orthogonal polynomials with a vast number of mathematical properties and numerous applications. They can be defined in many ways, and the various definitions highlight different aspects as well as suggest generalizations and connections to different mathematical structures and physical and numerical applications.

Closely related to the Legendre polynomials are associated Legendre polynomials, Legendre functions, Legendre functions of the second kind, and associated Legendre functions.

Definition by construction as an orthogonal system

In this approach, the polynomials are defined as an orthogonal system with respect to the weight function [math]\displaystyle{ w(x) = 1 }[/math] over the interval [math]\displaystyle{ [-1,1] }[/math]. That is, [math]\displaystyle{ P_n(x) }[/math] is a polynomial of degree [math]\displaystyle{ n }[/math], such that [math]\displaystyle{ \int_{-1}^1 P_m(x) P_n(x) \,dx = 0 \quad \text{if } n \ne m. }[/math]

With the additional standardization condition [math]\displaystyle{ P_n(1) = 1 }[/math], all the polynomials can be uniquely determined. We then start the construction process: [math]\displaystyle{ P_0(x) = 1 }[/math] is the only correctly standardized polynomial of degree 0. [math]\displaystyle{ P_1(x) }[/math] must be orthogonal to [math]\displaystyle{ P_0 }[/math], leading to [math]\displaystyle{ P_1(x) = x }[/math], and [math]\displaystyle{ P_2(x) }[/math] is determined by demanding orthogonality to [math]\displaystyle{ P_0 }[/math] and [math]\displaystyle{ P_1 }[/math], and so on. [math]\displaystyle{ P_n }[/math] is fixed by demanding orthogonality to all [math]\displaystyle{ P_m }[/math] with [math]\displaystyle{ m \lt n }[/math]. This gives [math]\displaystyle{ n }[/math] conditions, which, along with the standardization [math]\displaystyle{ P_n(1) = 1 }[/math] fixes all [math]\displaystyle{ n+1 }[/math] coefficients in [math]\displaystyle{ P_n(x) }[/math]. With work, all the coefficients of every polynomial can be systematically determined, leading to the explicit representation in powers of [math]\displaystyle{ x }[/math] given below.

This definition of the [math]\displaystyle{ P_n }[/math]'s is the simplest one. It does not appeal to the theory of differential equations. Second, the completeness of the polynomials follows immediately from the completeness of the powers 1, [math]\displaystyle{ x, x^2, x^3, \ldots }[/math]. Finally, by defining them via orthogonality with respect to the most obvious weight function on a finite interval, it sets up the Legendre polynomials as one of the three classical orthogonal polynomial systems. The other two are the Laguerre polynomials, which are orthogonal over the half line [math]\displaystyle{ [0,\infty) }[/math], and the Hermite polynomials, orthogonal over the full line [math]\displaystyle{ (-\infty,\infty) }[/math], with weight functions that are the most natural analytic functions that ensure convergence of all integrals.

Definition via generating function

The Legendre polynomials can also be defined as the coefficients in a formal expansion in powers of [math]\displaystyle{ t }[/math] of the generating function[1]

[math]\displaystyle{ \frac{1}{\sqrt{1-2xt+t^2}} = \sum_{n=0}^\infty P_n(x) t^n \,. }[/math]






The coefficient of [math]\displaystyle{ t^n }[/math] is a polynomial in [math]\displaystyle{ x }[/math] of degree [math]\displaystyle{ n }[/math] with [math]\displaystyle{ |x| \leq 1 }[/math]. Expanding up to [math]\displaystyle{ t^1 }[/math] gives [math]\displaystyle{ P_0(x) = 1 \,,\quad P_1(x) = x. }[/math] Expansion to higher orders gets increasingly cumbersome, but is possible to do systematically, and again leads to one of the explicit forms given below.

It is possible to obtain the higher [math]\displaystyle{ P_n }[/math]'s without resorting to direct expansion of the Taylor series, however. Equation 2 is differentiated with respect to t on both sides and rearranged to obtain [math]\displaystyle{ \frac{x-t}{\sqrt{1-2xt+t^2}} = \left(1-2xt+t^2\right) \sum_{n=1}^\infty n P_n(x) t^{n-1} \,. }[/math] Replacing the quotient of the square root with its definition in Eq. 2, and equating the coefficients of powers of t in the resulting expansion gives Bonnet’s recursion formula [math]\displaystyle{ (n+1) P_{n+1}(x) = (2n+1) x P_n(x) - n P_{n-1}(x)\,. }[/math] This relation, along with the first two polynomials P0 and P1, allows all the rest to be generated recursively.

The generating function approach is directly connected to the multipole expansion in electrostatics, as explained below, and is how the polynomials were first defined by Legendre in 1782.

Definition via differential equation

A third definition is in terms of solutions to Legendre's differential equation:

[math]\displaystyle{ (1 - x^2) P_n''(x) - 2 x P_n'(x) + n (n + 1) P_n(x) = 0. }[/math]






This differential equation has regular singular points at x = ±1 so if a solution is sought using the standard Frobenius or power series method, a series about the origin will only converge for |x| < 1 in general. When n is an integer, the solution Pn(x) that is regular at x = 1 is also regular at x = −1, and the series for this solution terminates (i.e. it is a polynomial). The orthogonality and completeness of these solutions is best seen from the viewpoint of Sturm–Liouville theory. We rewrite the differential equation as an eigenvalue problem, [math]\displaystyle{ \frac{d}{dx} \left( \left(1-x^2\right) \frac{d}{dx} \right) P(x) = -\lambda P(x) \,, }[/math] with the eigenvalue [math]\displaystyle{ \lambda }[/math] in lieu of [math]\displaystyle{ n(n+1) }[/math]. If we demand that the solution be regular at [math]\displaystyle{ x = \pm 1 }[/math], the differential operator on the left is Hermitian. The eigenvalues are found to be of the form n(n + 1), with [math]\displaystyle{ n = 0, 1, 2, \ldots }[/math] and the eigenfunctions are the [math]\displaystyle{ P_n(x) }[/math]. The orthogonality and completeness of this set of solutions follows at once from the larger framework of Sturm–Liouville theory.

The differential equation admits another, non-polynomial solution, the Legendre functions of the second kind [math]\displaystyle{ Q_n }[/math]. A two-parameter generalization of (Eq. 1) is called Legendre's general differential equation, solved by the Associated Legendre polynomials. Legendre functions are solutions of Legendre's differential equation (generalized or not) with non-integer parameters.

In physical settings, Legendre's differential equation arises naturally whenever one solves Laplace's equation (and related partial differential equations) by separation of variables in spherical coordinates. From this standpoint, the eigenfunctions of the angular part of the Laplacian operator are the spherical harmonics, of which the Legendre polynomials are (up to a multiplicative constant) the subset that is left invariant by rotations about the polar axis. The polynomials appear as [math]\displaystyle{ P_n(\cos\theta) }[/math] where [math]\displaystyle{ \theta }[/math] is the polar angle. This approach to the Legendre polynomials provides a deep connection to rotational symmetry. Many of their properties which are found laboriously through the methods of analysis — for example the addition theorem — are more easily found using the methods of symmetry and group theory, and acquire profound physical and geometrical meaning.

Orthogonality and completeness

The standardization [math]\displaystyle{ P_n(1) = 1 }[/math] fixes the normalization of the Legendre polynomials (with respect to the L2 norm on the interval −1 ≤ x ≤ 1). Since they are also orthogonal with respect to the same norm, the two statements[clarification needed] can be combined into the single equation, [math]\displaystyle{ \int_{-1}^1 P_m(x) P_n(x)\,dx = \frac{2}{2n + 1} \delta_{mn}, }[/math] (where δmn denotes the Kronecker delta, equal to 1 if m = n and to 0 otherwise). This normalization is most readily found by employing Rodrigues' formula, given below.

That the polynomials are complete means the following. Given any piecewise continuous function [math]\displaystyle{ f(x) }[/math] with finitely many discontinuities in the interval [−1, 1], the sequence of sums [math]\displaystyle{ f_n(x) = \sum_{\ell=0}^n a_\ell P_\ell(x) }[/math] converges in the mean to [math]\displaystyle{ f(x) }[/math] as [math]\displaystyle{ n \to \infty }[/math], provided we take [math]\displaystyle{ a_\ell = \frac{2\ell + 1}{2} \int_{-1}^1 f(x) P_\ell(x)\,dx. }[/math]

This completeness property underlies all the expansions discussed in this article, and is often stated in the form [math]\displaystyle{ \sum_{\ell=0}^\infty \frac{2\ell + 1}{2} P_\ell(x)P_\ell(y) = \delta(x-y), }[/math] with −1 ≤ x ≤ 1 and −1 ≤ y ≤ 1.

Rodrigues' formula and other explicit formulas

An especially compact expression for the Legendre polynomials is given by Rodrigues' formula: [math]\displaystyle{ P_n(x) = \frac{1}{2^n n!} \frac{d^n}{dx^n} (x^2 -1)^n \,. }[/math]

This formula enables derivation of a large number of properties of the [math]\displaystyle{ P_n }[/math]'s. Among these are explicit representations such as [math]\displaystyle{ \begin{align} P_n(x) & = [t^n] \frac{((t+x)^2-1)^n}{2^n} = [t^n] \frac{(t+x+1)^n(t+x-1)^n}{2^n}, \\ P_n(x)&= \frac{1}{2^n} \sum_{k=0}^n \binom{n}{k}^2 (x-1)^{n-k}(x+1)^k, \\ P_n(x)&=\sum_{k=0}^n \binom{n}{k} \binom{n+k}{k} \left( \frac{x-1}{2} \right)^k, \\ P_n(x)&=\frac1{2^n}\sum_{k=0}^{\left\lfloor\frac n2\right\rfloor}(-1)^k\binom nk\binom{2n-2k}n x^{n-2k},\\ P_n(x)&= 2^n \sum_{k=0}^n x^k \binom{n}{k} \binom{\frac{n+k-1}{2}}{n}. \end{align} }[/math] In the fourth representation, ⌊n/2⌋ stands for the largest integer less than or equal to n/2. The last representation, which is also immediate from the recursion formula, expresses the Legendre polynomials by simple monomials and involves the generalized form of the binomial coefficient.

The first few Legendre polynomials are:

[math]\displaystyle{ n }[/math] [math]\displaystyle{ P_n(x) }[/math]
0 [math]\displaystyle{ 1 }[/math]
1 [math]\displaystyle{ x }[/math]
2 [math]\displaystyle{ \tfrac12 \left(3x^2-1\right) }[/math]
3 [math]\displaystyle{ \tfrac12 \left(5x^3-3x\right) }[/math]
4 [math]\displaystyle{ \tfrac18 \left(35x^4-30x^2+3\right) }[/math]
5 [math]\displaystyle{ \tfrac18 \left(63x^5-70x^3+15x\right) }[/math]
6 [math]\displaystyle{ \tfrac1{16} \left(231x^6-315x^4+105x^2-5\right) }[/math]
7 [math]\displaystyle{ \tfrac1{16} \left(429x^7-693x^5+315x^3-35x\right) }[/math]
8 [math]\displaystyle{ \tfrac1{128} \left(6435x^8-12012x^6+6930x^4-1260x^2+35\right) }[/math]
9 [math]\displaystyle{ \tfrac1{128} \left(12155x^9-25740x^7+18018x^5-4620x^3+315x\right) }[/math]
10 [math]\displaystyle{ \tfrac1{256} \left(46189x^{10}-109395x^8+90090x^6-30030x^4+3465x^2-63\right) }[/math]

The graphs of these polynomials (up to n = 5) are shown below:

Plot of the six first Legendre polynomials.

Applications of Legendre polynomials

Expanding a 1/r potential

The Legendre polynomials were first introduced in 1782 by Adrien-Marie Legendre[2] as the coefficients in the expansion of the Newtonian potential [math]\displaystyle{ \frac{1}{\left| \mathbf{x}-\mathbf{x}' \right|} = \frac{1}{\sqrt{r^2+{r'}^2-2r{r'}\cos\gamma}} = \sum_{\ell=0}^\infty \frac{{r'}^\ell}{r^{\ell+1}} P_\ell(\cos \gamma), }[/math] where r and r are the lengths of the vectors x and x respectively and γ is the angle between those two vectors. The series converges when r > r. The expression gives the gravitational potential associated to a point mass or the Coulomb potential associated to a point charge. The expansion using Legendre polynomials might be useful, for instance, when integrating this expression over a continuous mass or charge distribution.

Legendre polynomials occur in the solution of Laplace's equation of the static potential, 2 Φ(x) = 0, in a charge-free region of space, using the method of separation of variables, where the boundary conditions have axial symmetry (no dependence on an azimuthal angle). Where is the axis of symmetry and θ is the angle between the position of the observer and the axis (the zenith angle), the solution for the potential will be [math]\displaystyle{ \Phi(r,\theta) = \sum_{\ell=0}^\infty \left( A_\ell r^\ell + B_\ell r^{-(\ell+1)} \right) P_\ell(\cos\theta) \,. }[/math]

Al and Bl are to be determined according to the boundary condition of each problem.[3]

They also appear when solving the Schrödinger equation in three dimensions for a central force.

Legendre polynomials in multipole expansions

Diagram for the multipole expansion of electric potential.

Legendre polynomials are also useful in expanding functions of the form (this is the same as before, written a little differently): [math]\displaystyle{ \frac{1}{\sqrt{1 + \eta^2 - 2\eta x}} = \sum_{k=0}^\infty \eta^k P_k(x), }[/math] which arise naturally in multipole expansions. The left-hand side of the equation is the generating function for the Legendre polynomials.

As an example, the electric potential Φ(r,θ) (in spherical coordinates) due to a point charge located on the z-axis at z = a (see diagram right) varies as [math]\displaystyle{ \Phi (r, \theta ) \propto \frac{1}{R} = \frac{1}{\sqrt{r^2 + a^2 - 2ar \cos\theta}}. }[/math]

If the radius r of the observation point P is greater than a, the potential may be expanded in the Legendre polynomials [math]\displaystyle{ \Phi(r, \theta) \propto \frac{1}{r} \sum_{k=0}^\infty \left( \frac{a}{r} \right)^k P_k(\cos \theta), }[/math] where we have defined η = a/r < 1 and x = cos θ. This expansion is used to develop the normal multipole expansion.

Conversely, if the radius r of the observation point P is smaller than a, the potential may still be expanded in the Legendre polynomials as above, but with a and r exchanged. This expansion is the basis of interior multipole expansion.

Legendre polynomials in trigonometry

The trigonometric functions cos , also denoted as the Chebyshev polynomials Tn(cos θ) ≡ cos , can also be multipole expanded by the Legendre polynomials Pn(cos θ). The first several orders are as follows: [math]\displaystyle{ \begin{align} T_0(\cos\theta)&=1 &&=P_0(\cos\theta),\\[4pt] T_1(\cos\theta)&=\cos \theta&&=P_1(\cos\theta),\\[4pt] T_2(\cos\theta)&=\cos 2\theta&&=\tfrac{1}{3}\bigl(4P_2(\cos\theta)-P_0(\cos\theta)\bigr),\\[4pt] T_3(\cos\theta)&=\cos 3\theta&&=\tfrac{1}{5}\bigl(8P_3(\cos\theta)-3P_1(\cos\theta)\bigr),\\[4pt] T_4(\cos\theta)&=\cos 4\theta&&=\tfrac{1}{105}\bigl(192P_4(\cos\theta)-80P_2(\cos\theta)-7P_0(\cos\theta)\bigr),\\[4pt] T_5(\cos\theta)&=\cos 5\theta&&=\tfrac{1}{63}\bigl(128P_5(\cos\theta)-56P_3(\cos\theta)-9P_1(\cos\theta)\bigr),\\[4pt] T_6(\cos\theta)&=\cos 6\theta&&=\tfrac{1}{1155}\bigl(2560P_6(\cos\theta)-1152P_4(\cos\theta)-220P_2(\cos\theta)-33P_0(\cos\theta)\bigr). \end{align} }[/math]

Another property is the expression for sin (n + 1)θ, which is [math]\displaystyle{ \frac{\sin (n+1)\theta}{\sin\theta}=\sum_{\ell=0}^n P_\ell(\cos\theta) P_{n-\ell}(\cos\theta). }[/math]

Legendre polynomials in recurrent neural networks

A recurrent neural network that contains a d-dimensional memory vector, [math]\displaystyle{ \mathbf{m} \in \R^d }[/math], can be optimized such that its neural activities obey the linear time-invariant system given by the following state-space representation: [math]\displaystyle{ \theta \dot{\mathbf{m}}(t) = A\mathbf{m}(t) + Bu(t), }[/math] [math]\displaystyle{ \begin{align} A &= \left[ a \right]_{ij} \in \R^{d \times d} \text{,} \quad && a_{ij} = \left(2i + 1\right) \begin{cases} -1 & i \lt j \\ (-1)^{i-j+1} & i \ge j \end{cases},\\ B &= \left[ b \right]_i \in \R^{d \times 1} \text{,} \quad && b_i = (2i + 1) (-1)^i . \end{align} }[/math]

In this case, the sliding window of [math]\displaystyle{ u }[/math] across the past [math]\displaystyle{ \theta }[/math] units of time is best approximated by a linear combination of the first [math]\displaystyle{ d }[/math] shifted Legendre polynomials, weighted together by the elements of [math]\displaystyle{ \mathbf{m} }[/math] at time [math]\displaystyle{ t }[/math]: [math]\displaystyle{ u(t - \theta') \approx \sum_{\ell=0}^{d-1} \widetilde{P}_\ell \left(\frac{\theta'}{\theta} \right) \, m_{\ell}(t) , \quad 0 \le \theta' \le \theta . }[/math]

When combined with deep learning methods, these networks can be trained to outperform long short-term memory units and related architectures, while using fewer computational resources.[4]

Additional properties of Legendre polynomials

Legendre polynomials have definite parity. That is, they are even or odd,[5] according to [math]\displaystyle{ P_n(-x) = (-1)^n P_n(x) \,. }[/math]

Another useful property is [math]\displaystyle{ \int_{-1}^1 P_n(x)\,dx = 0 \text{ for } n\ge1, }[/math] which follows from considering the orthogonality relation with [math]\displaystyle{ P_0(x) = 1 }[/math]. It is convenient when a Legendre series [math]\displaystyle{ \sum_i a_i P_i }[/math] is used to approximate a function or experimental data: the average of the series over the interval [−1, 1] is simply given by the leading expansion coefficient [math]\displaystyle{ a_0 }[/math].

Since the differential equation and the orthogonality property are independent of scaling, the Legendre polynomials' definitions are "standardized" (sometimes called "normalization", but the actual norm is not 1) by being scaled so that [math]\displaystyle{ P_n(1) = 1 \,. }[/math]

The derivative at the end point is given by [math]\displaystyle{ P_n'(1) = \frac{n(n+1)}{2} \,. }[/math]

The Askey–Gasper inequality for Legendre polynomials reads [math]\displaystyle{ \sum_{j=0}^n P_j(x) \ge 0 \quad \text{for }\quad x\ge -1 \,. }[/math]

The Legendre polynomials of a scalar product of unit vectors can be expanded with spherical harmonics using [math]\displaystyle{ P_\ell \left(r \cdot r'\right) = \frac{4\pi}{2\ell + 1} \sum_{m=-\ell}^\ell Y_{\ell m}(\theta,\varphi) Y_{\ell m}^*(\theta',\varphi')\,, }[/math] where the unit vectors r and r have spherical coordinates (θ, φ) and (θ′, φ′), respectively.

Recurrence relations

As discussed above, the Legendre polynomials obey the three-term recurrence relation known as Bonnet's recursion formula given by [math]\displaystyle{ (n+1) P_{n+1}(x) = (2n+1) x P_n(x) - n P_{n-1}(x) }[/math] and [math]\displaystyle{ \frac{x^2-1}{n} \frac{d}{dx} P_n(x) = xP_n(x) - P_{n-1}(x) }[/math] or, with the alternative expression, which also holds at the endpoints [math]\displaystyle{ \frac{d}{dx} P_{n+1}(x) = (n+1)P_n(x) + x \frac{d}{dx}P_{n}(x) \,. }[/math]

Useful for the integration of Legendre polynomials is [math]\displaystyle{ (2n+1) P_n(x) = \frac{d}{dx} \bigl( P_{n+1}(x) - P_{n-1}(x) \bigr) \,. }[/math]

From the above one can see also that [math]\displaystyle{ \frac{d}{dx} P_{n+1}(x) = (2n+1) P_n(x) + \bigl(2(n-2)+1\bigr) P_{n-2}(x) + \bigl(2(n-4)+1\bigr) P_{n-4}(x) + \cdots }[/math] or equivalently [math]\displaystyle{ \frac{d}{dx} P_{n+1}(x) = \frac{2 P_n(x)}{\left\| P_n \right\|^2} + \frac{2 P_{n-2}(x)}{\left\| P_{n-2} \right\|^2} + \cdots }[/math] where ||Pn|| is the norm over the interval −1 ≤ x ≤ 1 [math]\displaystyle{ \| P_n \| = \sqrt{\int_{-1}^1 \bigl(P_n(x)\bigr)^2 \,dx} = \sqrt{\frac{2}{2 n + 1}} \,. }[/math]


Asymptotically, for [math]\displaystyle{ \ell \to \infty }[/math], the Legendre polynomials can be written as [6] [math]\displaystyle{ \begin{align} P_\ell (\cos \theta) &= \sqrt{\frac{\theta}{\sin \theta}} \, J_0((\ell+1/2)\theta) + \mathcal{O}\left(\ell^{-1}\right) \\ &= \frac{2}{\sqrt{2\pi \ell\sin\theta}}\cos\left(\left(\ell + \tfrac12\right)\theta - \frac{\pi}{4}\right) + \mathcal{O}\left(\ell^{-3/2}\right), \quad \theta \in (0,\pi), \end{align} }[/math] and for arguments of magnitude greater than 1[7] [math]\displaystyle{ \begin{align} P_\ell \left(\cosh\xi\right) &= \sqrt{\frac{\xi}{\sinh\xi}} I_0\left(\left(\ell+\frac{1}{2}\right)\xi\right)\left(1+\mathcal{O}\left(\ell^{-1}\right)\right)\,,\\ P_\ell \left(\frac{1}{\sqrt{1-e^2}}\right) &= \frac{1}{\sqrt{2\pi\ell e}} \frac{(1+e)^\frac{\ell+1}{2}}{(1-e)^\frac{\ell}{2}} + \mathcal{O}\left(\ell^{-1}\right) \end{align} }[/math] where J0 and I0 are Bessel functions.


All [math]\displaystyle{ n }[/math] zeros of [math]\displaystyle{ P_n(x) }[/math] are real, distinct from each other, and lie in the interval [math]\displaystyle{ (-1,1) }[/math]. Furthermore, if we regard them as dividing the interval [math]\displaystyle{ [-1,1] }[/math] into [math]\displaystyle{ n+1 }[/math] subintervals, each subinterval will contain exactly one zero of [math]\displaystyle{ P_{n+1} }[/math]. This is known as the interlacing property. Because of the parity property it is evident that if [math]\displaystyle{ x_k }[/math] is a zero of [math]\displaystyle{ P_n(x) }[/math], so is [math]\displaystyle{ -x_k }[/math]. These zeros play an important role in numerical integration based on Gaussian quadrature. The specific quadrature based on the [math]\displaystyle{ P_n }[/math]'s is known as Gauss-Legendre quadrature.

From this property and the facts that [math]\displaystyle{ P_n(\pm 1) \ne 0 }[/math], it follows that [math]\displaystyle{ P_n(x) }[/math] has [math]\displaystyle{ n-1 }[/math] local minima and maxima in [math]\displaystyle{ (-1,1) }[/math]. Equivalently, [math]\displaystyle{ dP_n(x)/dx }[/math] has [math]\displaystyle{ n -1 }[/math] zeros in [math]\displaystyle{ (-1,1) }[/math].

Pointwise evaluations

The parity and normalization implicate the values at the boundaries [math]\displaystyle{ x=\pm 1 }[/math] to be [math]\displaystyle{ P_n(1) = 1 \,, \quad P_n(-1) = (-1)^n }[/math] At the origin [math]\displaystyle{ x=0 }[/math] one can show that the values are given by [math]\displaystyle{ P_{2n}(0) = \frac{(-1)^{n}}{4^n} \binom{2n}{n} = \frac{(-1)^{n}}{2^{2n}} \frac{(2n)!}{\left(n!\right)^2} }[/math][math]\displaystyle{ P_{2n+1}(0) = 0 }[/math]

Legendre polynomials with transformed argument

Shifted Legendre polynomials

The shifted Legendre polynomials are defined as [math]\displaystyle{ \widetilde{P}_n(x) = P_n(2x-1) \,. }[/math] Here the "shifting" function x ↦ 2x − 1 is an affine transformation that bijectively maps the interval [0, 1] to the interval [−1, 1], implying that the polynomials n(x) are orthogonal on [0, 1]: [math]\displaystyle{ \int_0^1 \widetilde{P}_m(x) \widetilde{P}_n(x)\,dx = \frac{1}{2n + 1} \delta_{mn} \,. }[/math]

An explicit expression for the shifted Legendre polynomials is given by [math]\displaystyle{ \widetilde{P}_n(x) = (-1)^n \sum_{k=0}^n \binom{n}{k} \binom{n+k}{k} (-x)^k \,. }[/math]

The analogue of Rodrigues' formula for the shifted Legendre polynomials is [math]\displaystyle{ \widetilde{P}_n(x) = \frac{1}{n!} \frac{d^n}{dx^n} \left(x^2 -x \right)^n \,. }[/math]

The first few shifted Legendre polynomials are:

[math]\displaystyle{ n }[/math] [math]\displaystyle{ \widetilde{P}_n(x) }[/math]
0 [math]\displaystyle{ 1 }[/math]
1 [math]\displaystyle{ 2x-1 }[/math]
2 [math]\displaystyle{ 6x^2-6x+1 }[/math]
3 [math]\displaystyle{ 20x^3-30x^2+12x-1 }[/math]
4 [math]\displaystyle{ 70x^4-140x^3+90x^2-20x+1 }[/math]
5 [math]\displaystyle{ 252x^5 -630x^4 +560x^3 - 210 x^2 + 30 x - 1 }[/math]

Legendre rational functions

Main page: Legendre rational functions

The Legendre rational functions are a sequence of orthogonal functions on [0, ∞). They are obtained by composing the Cayley transform with Legendre polynomials.

A rational Legendre function of degree n is defined as: [math]\displaystyle{ R_n(x) = \frac{\sqrt{2}}{x+1}\,P_n\left(\frac{x-1}{x+1}\right)\,. }[/math]

They are eigenfunctions of the singular Sturm–Liouville problem: [math]\displaystyle{ (x+1)\partial_x(x\partial_x((x+1)v(x)))+\lambda v(x)=0 }[/math] with eigenvalues [math]\displaystyle{ \lambda_n=n(n+1)\,. }[/math]

See also


  1. Arfken & Weber 2005, p.743
  2. Legendre, A.-M. (1785). "Recherches sur l'attraction des sphéroïdes homogènes" (in fr). Mémoires de Mathématiques et de Physique, présentés à l'Académie Royale des Sciences, par divers savans, et lus dans ses Assemblées. X. Paris. pp. 411–435. http://edocs.ub.uni-frankfurt.de/volltexte/2007/3757/pdf/A009566090.pdf. 
  3. Jackson, J. D. (1999). Classical Electrodynamics (3rd ed.). Wiley & Sons. p. 103. ISBN 978-0-471-30932-1. https://archive.org/details/classicalelectro00jack_449. 
  4. Voelker, Aaron R.; Kajić, Ivana; Eliasmith, Chris (2019). "Legendre Memory Units: Continuous-Time Representation in Recurrent Neural Networks". Advances in Neural Information Processing Systems. http://compneuro.uwaterloo.ca/files/publications/voelker.2019.lmu.pdf. 
  5. Arfken & Weber 2005, p.753
  6. Szegő, Gábor (1975). Orthogonal polynomials (4th ed.). Providence: American Mathematical Society. pp. 194 (Theorem 8.21.2). ISBN 0821810235. OCLC 1683237. 
  7. "DLMF: 14.15 Uniform Asymptotic Approximations". https://dlmf.nist.gov/14.15.E13. 


External links