imported>Paul Wormer |
imported>Paul Wormer |
Line 169: |
Line 169: |
| It is possible to demonstrate their orthogonality using principles associated with operator calculus. Let us write | | It is possible to demonstrate their orthogonality using principles associated with operator calculus. Let us write |
| :<math> | | :<math> |
| P^m_{l}(x) = w(x)^{1/2} \; \nabla^m_x P_l(x) | | P^m_{l}(x) = w(x)^{1/2} \; \nabla^m P_l(x) |
| </math> | | </math> |
| where | | where |
| :<math> | | :<math> |
| \nabla_x \equiv \frac{d}{dx} \quad \hbox{and}\quad w(x) \equiv (1-x^2)^m. | | \nabla \equiv \frac{d}{dx} \quad \hbox{and}\quad w(x) \equiv (1-x^2)^m. |
| </math> | | </math> |
| Clearly, the case ''m'' = 0 is, | | Clearly, the case ''m'' = 0 is, |
| :<math> | | :<math> |
| P^{0}_l(x) = (1-x^2)^{0/2}\; \nabla^0_x P_l(x) = P_l(x). | | P^{0}_l(x) = (1-x^2)^{0/2}\; \nabla^0 P_l(x) = P_l(x). |
| </math> | | </math> |
|
| |
|
Line 183: |
Line 183: |
| Indeed, noting that ''w(x)'' is a function with ''w''(1) = ''w''(−1) = 0 for ''m'' ≠ 0, it follows from partial integration that | | Indeed, noting that ''w(x)'' is a function with ''w''(1) = ''w''(−1) = 0 for ''m'' ≠ 0, it follows from partial integration that |
| :<math> | | :<math> |
| \langle\; w\, g \;|\; \nabla_x f\; \rangle \equiv \int\limits_{-1}^1\; w(x)\,g(x)\;\big(\nabla_x f(x)\big) \; dx | | \langle\; w\, g \;|\; \nabla f\; \rangle \equiv \int\limits_{-1}^1\; w(x)\,g(x)\;\big(\nabla f(x)\big) \; dx |
| = \left. w(x)\;g(x)f(x) \right|_{-1}^{1} - \int\limits_{-1}^1 \Big(\nabla_x w(x)\,g(x)\Big) \, f(x)\; dx | | = \left. w(x)\;g(x)f(x) \right|_{-1}^{1} - \int\limits_{-1}^1 \Big(\nabla w(x)\,g(x)\Big) \, f(x)\; dx |
| = - \langle\; \nabla_x (w g) \;|\; f\;\rangle | | = - \langle\; \nabla (w g) \;|\; f\;\rangle |
| </math> | | </math> |
| Hence | | Hence |
| :<math> | | :<math> |
| \nabla_x^\dagger = - \nabla_x \;\Longrightarrow\; \left(\nabla_x^\dagger\right)^{m} = (-1)^{m} \nabla_x^{m}. | | \nabla^\dagger = - \nabla \;\Longrightarrow\; \left(\nabla^\dagger\right)^{m} = (-1)^{m} \;\nabla^{m}. |
| </math> | | </math> |
|
| |
|
Line 200: |
Line 200: |
| \int\limits_{-1}^{1}P_{l}^{m} \left( x\right) P_{k}^{m} \left( x\right) | | \int\limits_{-1}^{1}P_{l}^{m} \left( x\right) P_{k}^{m} \left( x\right) |
| dx \equiv | | dx \equiv |
| \langle\; w\, \nabla_x^m P_k \;|\; \nabla_x^m P_l\;\rangle = | | \langle\; w\, \nabla^m P_k \;|\; \nabla^m P_l\;\rangle = |
| (-1)^m \langle\; \nabla_x^m (w\, \nabla_x^m P_k) \;|\; P_l\;\rangle . | | (-1)^m \langle\; \nabla^m \{w\, \nabla^m P_k\} \;|\; P_l\;\rangle . |
| </math> | | </math> |
| The bra is a polynomial of order ''k'', because | | The bra is a polynomial of order ''k'', because |
| :<math> | | :<math> |
| O\left[\nabla_x^m P_k\right] = k-m, \quad O\left[w(x)\right] = 2m \; \Longrightarrow\; | | O\left[\nabla^m P_k\right] = k-m, \quad O\left[w(x)\right] = 2m \; \Longrightarrow\; |
| O\left[w(x)\, \nabla_x^m P_k(x) \right] = k+m \; \Longrightarrow\; O\left[ \nabla_x^m \{w(x)\, \nabla_x^m P_k(x)\}\right] = k, | | O\left[w(x)\, \nabla^m P_k(x) \right] = k+m \; \Longrightarrow\; O\left[ \nabla^m \{w(x)\, \nabla^m P_k(x)\}\right] = k, |
| </math> | | </math> |
| where it was used that ''m'' times differentiation of a polynomial lowers its order by ''m'' and that the order of a product of polynomials is the product of the orders. Since we assumed that ''k'' ≤ ''l'', the bracket is non-zero only if ''k'' = ''l''. Hence it follows readily that the associated Legendre polynomials of equal superscripts and non-equal subscripts are orthogonal. | | where it was used that ''m'' times differentiation of a polynomial lowers its order by ''m'' and that the order of a product of polynomials is the product of the orders. Since we assumed that ''k'' ≤ ''l'', the integral is non-zero only if ''k'' = ''l''. Hence it follows readily that the associated Legendre polynomials of equal superscripts and non-equal subscripts are orthogonal. |
| However, the hard work (given above) of computing the normalization for the case ''k'' = ''l'' remains to be done. | | However, the hard work (given above) of computing the normalization for the case ''k'' = ''l'' remains to be done. |
It will be demonstrated that the associated Legendre functions are orthogonal and their normalization constant will be derived.
Theorem
where:
Proof
The associated Legendre functions are regular solutions to the associated Legendre differential equation:
where the primes indicate differentiation with respect to x.
This equation is an example of a more general class of equations
known as the Sturm-Liouville equations. Using Sturm-Liouville
theory, one can show the orthogonality of functions with same superscript m and different subscripts:
In the case k = l it remains to find the normalization factor of the associated Legendre functions such that the "overlap" integral
One can evaluate the overlap integral directly from the definition of the associated Legendre polynomials given in the main article, whether or not k = l. Indeed, insert twice the definition:
Since k and l occur symmetrically, one can without loss of generality assume
that l ≥ k. Use the well-known integration-by-parts equation
l + m times, where the curly brackets in the integral indicate the factors, the first being
u and the second v’. For each of the first m integrations by parts,
u in the term contains the factor (1−x2),
so the term vanishes. For each of the remaining l integrations,
v in that term contains the factor (x2−1)
so the term also vanishes. This means:
Expand the second factor using Leibnitz' rule:
The leftmost derivative in the sum is non-zero only when r ≤ 2m
(remembering that m ≤ l). The other derivative is non-zero only when k + l + 2m − r ≤ 2k, that is, when r ≥ 2m + l − k. Because l ≥ k these two conditions imply that the only non-zero term in the sum occurs when r = 2m and l = k.
So:
where δkl is the Kronecker delta that shows the orthogonality of functions with l ≠ k.
To evaluate the differentiated factors, expand (1−x²)k
using the binomial theorem:
The only term that survives differentiation 2k
times is the x2k
term, which after differentiation gives
Therefore:
Evaluate
by a change of variable:
Thus,
where we recall that
The limits were switched from
- ,
which accounts for one minus sign and further for integer l: (−1)2l =1 .
A table of standard trigonometric integrals[1] shows:
Since
-
for n ≥ 2.
Applying this result to
and changing the variable back to x
yields:
for l ≥ 1.
Using this recursively:
Applying this result to equation (1):
Clearly, if we define new associated Legendre functions by a constant times the old ones,
then the overlap integral becomes,
that is, the new functions are normalized to unity.
Note
The orthogonality of the associated Legendre functions can be demonstrated in different ways. The proof presented above assumes only that the reader is familiar with basic calculus and it is therefore accessible to the widest possible audience. However, as mentioned, their orthogonality also follows from the fact that the associated Legendre equation belongs to a family known as the Sturm-Liouville equations.
It is possible to demonstrate their orthogonality using principles associated with operator calculus. Let us write
where
Clearly, the case m = 0 is,
The proof given above starts out by implicitly proving the anti-Hermiticity of ∇.
Indeed, noting that w(x) is a function with w(1) = w(−1) = 0 for m ≠ 0, it follows from partial integration that
Hence
To demonstrate orthogonality of the associated Legendre polynomials, we use a result from the theory of orthogonal polynomials. Namely, a Legendre polynomial of order l is orthogonal to any polynomial Πp of order p lower than l. In bra-ket notation
Knowing this,
The bra is a polynomial of order k, because
where it was used that m times differentiation of a polynomial lowers its order by m and that the order of a product of polynomials is the product of the orders. Since we assumed that k ≤ l, the integral is non-zero only if k = l. Hence it follows readily that the associated Legendre polynomials of equal superscripts and non-equal subscripts are orthogonal.
However, the hard work (given above) of computing the normalization for the case k = l remains to be done.