The total reducibility order of a polynomial in two variables (Q752765)

Let \(K\) be an algebraically closed field of characteristic zero and let \(P\in K[x,y]\), \(\deg P>0\). \(P\) is called a composite polynomial if there exist \(R\in K[z]\), \(\deg R>1\) and \(Q\in K[x,y]\) such that \(P=R(Q)\). For \(A\in K[x,y]\) let \(\sigma (A)=\{\lambda \in K : A-\lambda\) is reducible\(\}\). For \(\lambda\in \sigma (A)\) let \(A-\lambda =\prod^{n(\lambda)}_{i=1}A_{i\lambda}^{k_{i\lambda}}\) where \(A_{i\lambda}\) are distinct primes. Let \(\rho_{\lambda}(A)=n(\lambda)-1\) and let \(\rho (A)=\sum_{\lambda \in \sigma (A)}\rho_{\lambda}(A)\). The following theorem is proved: If \(A\in K[x,y]\) is not a composite polynomial then \(\rho (A)<\deg A.\) The author also deals with the solutions of the equation \[ \frac{\partial P}{\partial x}\frac{\partial F}{\partial y}- \frac{P}{\partial y}\frac{F}{\partial x}=TF, \] where \(P\in K[x,y]\setminus K\) and \(T\in K[x,y]\) are given polynomials and \(F\in K(x,y)\) is an unknown rational function. It is proved that those polynomials \(T\) for which the equation has nontrivial solutions \(F\) form a free \(\mathbb Z\)-module of finite rank. If \(Q\) is not a composite polynomial such that \(P\in K[Q]\), then the rank of this module is \(\rho(Q)\).