Basically all such criteria boil down to some argument involving the Newton polygon as Kevin Buzzard mentions in the comments. While something as general as your statement has trivial counter examples the following generalization holds:
Let $R$ be a unique factorization domain and $f(x) =a_nx^n+cdots +a_0in R[x]$ with $a_0a_nneq 0$. If the Newton polygon of $f$ with
respect to some prime $pin R$ consists of the only line segment from $(0,m)$ to $(n, 0)$
and if $gcd(n,m) = 1$ then $f$ is irreducible in $R[X]$.
I've heard this called the Eisenstein-Dumas criterion of irreducibility (it also proves the example given in the comments). Another generalization of Eisenstein's criterion is the following:
If $p|a_0,a_1,dots,a_k$ but $p^2not | a_0$ then $f(x)$ has an irreducible factor of degree $geq k+1$
(This is how you prove for example, that a polynomial like $x^n+5x^{n-1}+3$ is irreducible, after checking that it has no linear factors.) If not answering your question, at least I hope that this refreshes your memory of the statement you claim above. :)
No comments:
Post a Comment