Legendre polynomial - recurrence relations

Click For Summary
The discussion focuses on the recurrence relations of Legendre polynomials, specifically the formula for P_{n+1}(x) in terms of P_n(x) and the derivative of P_{n-1}(x). Participants are seeking guidance on using mathematical induction to prove this relation. The induction process requires proving the base case for n=1 and then showing that if the relation holds for n=m, it must also hold for n=m+1. The initial step is often straightforward, and contributors encourage sharing progress to address challenges encountered in the proof. The conversation emphasizes the importance of structured reasoning in mathematical proofs.
Joe20
Messages
53
Reaction score
1
Homework Statement
As attached
Relevant Equations
As attached
Note: $P_n (x)$ is legendre polynomial

$$P_{n+1}(x) = (2n+1)P_n(x) + P'_{n-1}(x) $$
$$\implies P_{n+1}(x) = (2n+1)P_n(x) + \sum_{k=0}^{\lfloor\frac{n}{2}\rfloor} (2(n-1-2k)+1)P_{n-1-2k}(x))$$

How can I continue to use induction to prove this? Help appreciated.
 

Attachments

  • 1.png
    1.png
    8.4 KB · Views: 205
Last edited:
Physics news on Phys.org
To prove something by induction, you need to do two things:
Prove it's true for n=1.

Prove that if it's true for n=m, that implies it's true for n=m+1.

The first part at least is usually pretty easy. Why don't you try to get as far as you can and post your work where you get stuck?
 
  • Like
Likes vanhees71 and Greg Bernhardt

Similar threads

  • · Replies 16 ·
Replies
16
Views
4K
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
3
Views
2K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K