Suppose that $P(x) = a_m x^m + \dots + a_0$ and $Q(x) = b_n x^n + \dots + b_0$ are two polynomials, with $m > n > 1$ and $a_m > b_n > 0$. Suppose that $P$ has $m$ distinct real roots $y_1<\dots<y_m$ and $Q$ has $n$ distinct real roots $z_1<\dots<z_n$.
Is the following claim true: $P(x) - Q(x)$ is strictly increasing for all $x \geq \max \{y_m, z_n\}$.
Note: I have a missing step in a larger proof, which would be fixed by a result like this. In my particular application, I have a bit more specific polynomials and with every numerical example I can come up with the result seems to hold, but I think this result should be more general.