Saturday, June 18, 2016

roots - A simple zeroes polynomial which constructs another one



Let P(X)=(Xx1)(XxN) be a complex polynomial with simple roots.



I define
Q(X)=P(Xa)bP(X),

with aC and b1 so that Q(X) is also a polynomial of degree N.



Let me note y1,,yN the roots of Q(X). I would like to prove that




  • Q has simple roots : i,j,yiyj

  • one cannot shifts from a root to another by the use of a : i,j,yiyj±a



I am not sure this is the case for all a and b, but in the context of my problem it seems Q has to verify these conditions.




I thought it would be a simple exercise, but I keep struggling on it.



Any help is much appreciated ! :)


Answer



It's not true.


As a counterexample, letting





  • P(x)=(x+2)(x2)
  • a=5
  • b=4


we get


Q(x)=5(x+1)2.


Staying with the case n=2, let P(x)=(xr)(xs) with rs.


Then for b1, the polynomial
Q(x)=P(xa)bP(x)
has simple roots if and only if eitherb=0or
a2(b1)2(rs)24b


Let's try an example with n=3 . . .


Let P(x)=(x1)x(x+1).



Then for b1, the polynomial
Q(x)=P(xa)bP(x)
has simple roots if and only if
4b4+(36a216)b3+(27a6+108a472a2+24)b2+(36a216)b+4
is nonzero.


The results of that example suggest that for the general case, trying to find usable necessary and sufficient conditions on a,b for Q(x) to have simple roots is not likely to succeed.



As a more reasonable goal, one might try to find sufficient conditions for Q(x) to have simple roots, expressed in terms of inequalities relating |a|,|b|.


For example, if a is fixed, then Q(x) will have simple roots if




  • bis sufficiently close to 0.


    or

  • |b|is sufficiently large.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...