Though your question is a bit more specific, it is worth mentioning some general results about persistence of divisibility that often prove useful in such contexts.
A characteristic property of univariate polynomial rings over a field is that they are the only nontrivial rings with division-with-remainder, such that the quotient and remainder are unique.
Using said uniqueness it is very simple to prove that extending the coefficient field doesn't change divisibility results. So, e.g. if $\,f,g\in \Bbb Q[x],\,$ and $\,f\,$ divides $\,g\,$ in $\Bbb R[x]\,$ then $\,f\,$ divides $\, g\,$ in $\,\Bbb Q[x],\,$ i.e. the quotient $\,g/f\,$ lies in $\Bbb Q[x],\,$ i.e. its coefficients remain rational.
Another way to deduce such persistence of quotient (and remainder) is to start with the observation that the operations of the division algorithm are all rational over the coefficient field, so remain there. The advantage of the above view is that it sets it in the general context of deducing equalities from uniqueness theorems - a widely applicable method.
See said answer for further discussion and literature references.