Let $P_n : \mathbb R \to \mathbb R $ , $n\in \mathbb N$ be defined by
$P_n(x)=\frac{\displaystyle1}{\displaystyle2^n n!}\frac{\displaystyle d^n}{\displaystyle dx^n}[(x^2-1)^n]$
I need to show that $P_n(x)$ has exactly $n$ distinct roots in $(-1,1)$
I think it is important to use induction and Rolle's theorem.
To use induction, $P_1(x)=x$ and it is trivial that the root is $x=0$ in $(-1,1)$
, but the inductivity is problem.
I assumed that $P_n(x)$ has $n$ distinct roots, and yet I can't advance further.
Asked
Active
Viewed 1,246 times
4
Andreas Caranti
- 68,873
Math-Nerd
- 219
-
Try binomial theorem. – Math.StackExchange May 28 '14 at 14:47
-
How to utilize binomial theorem? Please just give me a piece of hint – Math-Nerd May 28 '14 at 14:54
-
If you proof that your polynomials are orthogonal you could use this http://math.stackexchange.com/questions/527140/proof-the-legendre-polynomial-p-n-has-n-distinct-real-zeros/528150#528150 – rlartiga May 28 '14 at 14:57
-
For a proof based on Rolle's theorem, see my answer to a similar question. – achille hui May 28 '14 at 15:00
-
Ah! It was Legendre polynomial! I didn't know that. Thanks! – Math-Nerd May 28 '14 at 15:00
1 Answers
0
Try to make a statement about $\frac{\displaystyle d^k}{\displaystyle dx^k}[(x^2-1)^n]$, i.e. show by induction on $k$ that $x=1$ and $x=-1$ are roots of multiplicity $n-k$ and tehre are $k$ simple roots in $(-1,1)$.
Math-Nerd
- 219
Hagen von Eitzen
- 374,180
-
Could you please give a little bit more details about the part of using Roll's Thereom in your proof? – noam Azulay Jan 12 '20 at 23:12