Let $Q(x, y)$ be a bivariate polynomial over some field $\mathbb{F}$, and $P(x)$ a univariate polynomial over $\mathbb{F}$ such that $Q(P(x), x) = 0$ for every $x$.
Show that then, $Q(x, y) = (y - P(x))A(x, y)$ for some polynomial $A(x, y)$.
This is a self-exercice from Arora & Barak "Computational complexity", Chapter 19. I am stuck.
[EDIT : this might be a mistake in the statement. See comments.]