4

Prove that if all the roots of a polynomial in $\mathbb{Q}[x]$ are integers, then polynomial is in $\mathbb{Z}[x]$

Efforts:

Let $p(x)=a_0+a_1x +\dots a_nx^n$ be a polynomial in $Q[x]$

We are given that $p(x)$ has all roots in $Z$ so $$p(x)=(x-b_1)(x-b_2)(x-b_3)\dots (x-b_n).$$

Expanding it we get $p(x)=x^n-(\sum b_i )x^{n-1}+(\sum b_ib_j)x^{n-2}+\dots (-1)^nb_1\dots b_n$

Comparing the coefficient we have $a_n=1$, $a_{n-1}=-\sum b_i, \dots, a_0=(-1)^n b_1b_2\dots b_n$ and so on.

Since $b_i$ are integers so is their product. Hence we are done.

Is the proof correct?

Thanks for reading and help!

Robert Z
  • 145,942
Shweta Aggrawal
  • 5,501
  • 2
  • 15
  • 48

1 Answers1

5

If the given polynomial in $\mathbb{Q}[x]$ is monic, or more generally if its leading coefficient is an integer, then the statement is correct. Note that, in your proof the factorization of $p$ should be $$p(x)=a_n(x-b_1)\dots(x-b_n).$$

Otherwise we have counterexamples: take a monic polynomial with all the roots in $\mathbb{Z}$ and divide it by an integer number greater than $1$.

Robert Z
  • 145,942