Legendre Polynomials -- Jackson Derivation

In summary: solving for a_{j+2} we get a_{j+2} = a_0 + a_1*x^1+a_2*x^2+... since x^1+x^2+... is an infinite series.
  • #1
Reverend Shabazz
19
1
Hello all,

I'm reading through Jackson's Classical Electrodynamics book and am working through the derivation of the Legendre polynomials. He uses this ##\alpha## term that seems to complicate the derivation more and is throwing me for a bit of a loop. Jackson assumes the solution is of the form:

upload_2017-2-27_9-43-10.png


Inserting this into the differential equation we need to solve,
upload_2017-2-27_9-44-5.png
,
we obtain:
upload_2017-2-27_9-44-27.png


He then says:
upload_2017-2-27_9-47-36.png
,
which I agree with. The issue I'm having is with the next statement:

upload_2017-2-27_9-49-31.png


First, in saying the two relations are equivalent, I assume he means that if ##a_0 \neq 0## then we have ##P(x)_{a_0 \neq 0} = P_{\alpha=0}(x) + P_{\alpha=1}(x)##
##= a_0 +a_1*x^1+a_2*x^2 +...## ##+## ##a_0'*x^1+a_1'*x^2+a_2'*x^3 +...##

whereas if ##a_1 \neq 0## then we have ##P(x)_{a_1 \neq 0} = P_{\alpha=0}(x) + P_{\alpha=-1}(x)##
##= a_0 +a_1*x^1+a_2*x^2 +...## ##+## ##a_0''*x^{-1}+a_1''+a_2''*x^1+...##

and, setting ##a''##=0 to avoid the potential blowing up at x=0, ##P(x)_{a_0 \neq 0}## is basically the same as ##P(x)_{a_1 \neq 0}##, since each can be expressed as an infinite series in the form of ##c_0+c_1*x^1+c_2*x^2+...##. Therefore, we can choose either ##a_0 \neq 0## or ##a_1 \neq 0##.

But then he says we can't have both ##a_0 \neq 0## and ##a_1 \neq 0##, which I don't quite follow. If they were both 0, we'd need ##\alpha \equiv 0 ## (to satisfy his eq 3.13) and the solution would be of the form ##a_0+a_1*x^1+a_2*x^2+...##. What's wrong with that at this point in the derivation?

I recognize that eventually we will see that either ##a_0## (and ##a_1'## ) or ##a_1 ##(and ##a_0'##) must equal 0 for the solution to be finite, but that's at a later stage in the derivation. At this stage in the derivation, what's wrong with still assuming ##a_0 \neq 0## and ##a_1 \neq 0##??

I also recognize that I may be mucking things up due to staring at this for far too long..

Thanks!
 
Physics news on Phys.org
  • #2
I don't think it was meant to be over-analyzed. If ## a_1 \neq 0 ## then there is a possibility that ## \alpha=-1 ##, but if ## a_o \neq 0 ##, this possibility does not exist. ## \\ ## Editing... I don't quite follow J.D. Jackson's logic either, because what about ## \alpha=0 ## ? I'm going to need to study it further...
 
Last edited:
  • #3
An additional look at these formulas shows that when multiple terms are included in these polynomials, for the different integer values of ## l ##, they only contain even or odd terms. That seems to be the purpose of assuming ## a_0 \neq 0 ## or ## a_1 \neq 0 ## but not both at the same time. The actual solution can contain both even and odd terms, but there are no constraints between the even and odd terms of the series solutions.
 
Last edited:
  • #4
Reverend Shabazz said:
Hello all,

I'm reading through Jackson's Classical Electrodynamics book and am working through the derivation of the Legendre polynomials. He uses this ##\alpha## term that seems to complicate the derivation more and is throwing me for a bit of a loop. Jackson assumes the solution is of the form:

View attachment 113833

Inserting this into the differential equation we need to solve,
View attachment 113834,
we obtain:
View attachment 113836

He then says:
View attachment 113837,
which I agree with. The issue I'm having is with the next statement:

View attachment 113838

First, in saying the two relations are equivalent, I assume he means that if ##a_0 \neq 0## then we have ##P(x)_{a_0 \neq 0} = P_{\alpha=0}(x) + P_{\alpha=1}(x)##
##= a_0 +a_1*x^1+a_2*x^2 +...## ##+## ##a_0'*x^1+a_1'*x^2+a_2'*x^3 +...##

whereas if ##a_1 \neq 0## then we have ##P(x)_{a_1 \neq 0} = P_{\alpha=0}(x) + P_{\alpha=-1}(x)##
##= a_0 +a_1*x^1+a_2*x^2 +...## ##+## ##a_0''*x^{-1}+a_1''+a_2''*x^1+...##

and, setting ##a''##=0 to avoid the potential blowing up at x=0, ##P(x)_{a_0 \neq 0}## is basically the same as ##P(x)_{a_1 \neq 0}##, since each can be expressed as an infinite series in the form of ##c_0+c_1*x^1+c_2*x^2+...##. Therefore, we can choose either ##a_0 \neq 0## or ##a_1 \neq 0##.

But then he says we can't have both ##a_0 \neq 0## and ##a_1 \neq 0##, which I don't quite follow. If they were both 0, we'd need ##\alpha \equiv 0 ## (to satisfy his eq 3.13) and the solution would be of the form ##a_0+a_1*x^1+a_2*x^2+...##. What's wrong with that at this point in the derivation?

I recognize that eventually we will see that either ##a_0## (and ##a_1'## ) or ##a_1 ##(and ##a_0'##) must equal 0 for the solution to be finite, but that's at a later stage in the derivation. At this stage in the derivation, what's wrong with still assuming ##a_0 \neq 0## and ##a_1 \neq 0##??

I also recognize that I may be mucking things up due to staring at this for far too long..

Thanks!

Let's start by considering the case [itex] a_0 \neq 0 [/itex]. In this case we have [itex] \alpha = 0 [/itex] or [itex] \alpha = 1 [/itex]. Let's consider what happens when [itex] \alpha = 0 [/itex]

In this case the expression for general [itex] a_{j+2} [/itex] is
[itex] a_{j+2} = \frac{j\left(j+1 \right)-l\left(l+1\right)}{\text{not zero}}a_j[/itex]
we are looking for a polynomial where [itex] a_j =0 [/itex] for all [itex] j>j_{max}[/itex]. There are two ways that this can happen. The first is that the seed coefficient [itex]a_0[/itex] or [itex]a_1[/itex] is equal to zero. Or in the second case the numerator [itex] j\left(j+1 \right)-l\left(l+1\right)[/itex] has to equal zero for some values of [itex] j[/itex]. In our case the numerator only equals zero if [itex] j = l [/itex] or [itex] j = -l -1 [/itex]. Note that the two solutions have opposite signs. This implies that there is only 1 positive j for a given l for which the numerator will be zero. If l is even then the coefficients for the even series will be zero ([itex]a_n=0[/itex]) for [itex] j>l[/itex] but the coefficients for the odd series will never zero unless [itex] a_1= 0 [/itex] . Thus if [itex] a_0 \neq 0 [/itex] and [itex] \alpha = 0 [/itex] then we need [itex] a_1= 0 [/itex].

If you repeat this analysis for [itex] a_0 \neq 0 [/itex] but [itex] \alpha = 1 [/itex] you will see that [itex] a_1= 0 [/itex] by the same logic. This gives us two linearly independent solutions. One solution is odd in x (this is the [itex] \alpha = 0 [/itex] case) and a second solution that is even in x (this is the [itex] \alpha = 1 [/itex] case).

If you consider the case [itex] a_1 \neq 0 [/itex], then by the same logic you will find that [itex] a_0 = 0 [/itex] and you will get an even and an odd solution. The even and odd solution that you find will be the same solutions you found for [itex] a_0 \neq 0 [/itex] but the indices will be shifted by one.

For Jackson the above explanation is a "moment's thought."
 
  • #5
Thank you both for your replies!
 
  • Like
Likes Charles Link
  • #6
the_wolfman said:
Let's start by considering the case [itex] a_0 \neq 0 [/itex]. In this case we have [itex] \alpha = 0 [/itex] or [itex] \alpha = 1 [/itex]. Let's consider what happens when [itex] \alpha = 0 [/itex]

In this case the expression for general [itex] a_{j+2} [/itex] is
[itex] a_{j+2} = \frac{j\left(j+1 \right)-l\left(l+1\right)}{\text{not zero}}a_j[/itex]
we are looking for a polynomial where [itex] a_j =0 [/itex] for all [itex] j>j_{max}[/itex]. There are two ways that this can happen. The first is that the seed coefficient [itex]a_0[/itex] or [itex]a_1[/itex] is equal to zero. Or in the second case the numerator [itex] j\left(j+1 \right)-l\left(l+1\right)[/itex] has to equal zero for some values of [itex] j[/itex]. In our case the numerator only equals zero if [itex] j = l [/itex] or [itex] j = -l -1 [/itex]. Note that the two solutions have opposite signs. This implies that there is only 1 positive j for a given l for which the numerator will be zero. If l is even then the coefficients for the even series will be zero ([itex]a_n=0[/itex]) for [itex] j>l[/itex] but the coefficients for the odd series will never zero unless [itex] a_1= 0 [/itex] . Thus if [itex] a_0 \neq 0 [/itex] and [itex] \alpha = 0 [/itex] then we need [itex] a_1= 0 [/itex].

If you repeat this analysis for [itex] a_0 \neq 0 [/itex] but [itex] \alpha = 1 [/itex] you will see that [itex] a_1= 0 [/itex] by the same logic. This gives us two linearly independent solutions. One solution is odd in x (this is the [itex] \alpha = 0 [/itex] case) and a second solution that is even in x (this is the [itex] \alpha = 1 [/itex] case).

If you consider the case [itex] a_1 \neq 0 [/itex], then by the same logic you will find that [itex] a_0 = 0 [/itex] and you will get an even and an odd solution. The even and odd solution that you find will be the same solutions you found for [itex] a_0 \neq 0 [/itex] but the indices will be shifted by one.

For Jackson the above explanation is a "moment's thought."
Why are we looking for a polynomial (not a power series)?
 
  • #7
This is just the usual Frobenius method. I'd not do it this way, because it's complicated compared to the elegant algebraic method used in quantum theory (I'd teach electromagnetism after QM, but that's another subject).

So you make the ansatz
$$P(x)=\sum_{j=0}^{\infty} a_j x^{j+\alpha},$$
where ##\alpha## has to be determined as well as the ##a_j## from the differential equation. It's now clear that you can without restricting generality that ##a_0 \neq 0##, because if ##a_0=0## you just have to redefine ##\alpha## to get the same series.

If you choose ##a_0 \neq 0## then you get either ##\alpha=0## or ##\alpha=1##. So you can set ##a_1=0##, because you get all solutions, because the case ##a_1 \neq 0## and ##a_0=0## with ##\alpha=0## leads to the same series as choosing ##a_0 \neq 0## and ##\alpha=1##.
 

FAQ: Legendre Polynomials -- Jackson Derivation

What are Legendre polynomials?

Legendre polynomials are a set of mathematical functions that are used to represent solutions to certain differential equations. They are named after French mathematician Adrien-Marie Legendre and are commonly used in fields such as physics and engineering.

What is the Jackson derivation of Legendre polynomials?

The Jackson derivation is a method used to derive Legendre polynomials, named after American physicist John David Jackson. It involves using the generating function of Legendre polynomials to derive a recurrence relation, which is then used to calculate the coefficients of the polynomials.

Why is the Jackson derivation useful?

The Jackson derivation provides a systematic way to calculate Legendre polynomials, which can be difficult to find using other methods. It also allows for the calculation of higher order polynomials, which may be necessary for certain applications.

What are some applications of Legendre polynomials?

Legendre polynomials have many applications in physics and engineering, including in the study of electromagnetism, quantum mechanics, and fluid dynamics. They are also used in statistics and signal processing.

Are there any limitations to the Jackson derivation of Legendre polynomials?

While the Jackson derivation is a useful method for calculating Legendre polynomials, it has limitations. It can only be used for polynomials with a finite number of terms, and it may not be the most efficient method for calculating higher order polynomials.

Similar threads

Replies
4
Views
66
Replies
1
Views
2K
Replies
7
Views
860
Replies
1
Views
1K
Replies
1
Views
2K
Replies
4
Views
2K
Back
Top