Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This is a follow-up to this question.

Let $\mathcal{O}$ be a Dedekind domain and $f=X^n+a_{n-1}X^{n-1}+\dots+a_1X+a_0 \in \mathcal{O}[X]$ be a $\mathfrak{p}$-Eisenstein polynomial; that is, $\mathfrak{p}$ is a prime ideal of $\mathcal{O}$ such that $a_i\in \mathfrak{p}$ for all $i$ and $a_0\not\in \mathfrak{p}^2$.

$f$ is irreducible in $\mathcal{O}[X]$ by the Eisenstein criterion. Is it irreducible in $K[X]$, where $K$ is the field of fractions of $\mathcal{O}$?

share|cite|improve this question
If $f(x)$ were reducible in $K[x]$ then $f(x) = g(x)h(x)$ where $g$ and $h$ are nonconstant in $K[x]$. Then without loss of generality we can make $g$ and $h$ monic. Any root of $g$ or $h$ is a root of $f$ and thus is integral over ${\mathcal O}$. A monic polynomial factors over a splitting field as a product of $x - r$ as $r$ runs over the roots, so the coefficients of $g$ and $h$ are integral over ${\mathcal O}$. Those coefficients are in $K$, and ${\mathcal O}$ is integrally closed, so $g$ and $h$ are in ${\mathcal O}[x]$. This contradicts irreducibility of $f(x)$ over ${\mathcal O}$. – KCd Nov 16 '12 at 22:01
up vote 5 down vote accepted

You can easily reduced to the case of a PID: consider $R=\mathcal O_\mathfrak p$. Then $f(X)\in R[X]$ is Eisenstein in the usual sense. Hence it is irreducible in $L[X]$ where $L=\mathrm{Frac}(R)=K$.

share|cite|improve this answer
Thanks, that is really slick. I never know when it is useful to localize... – user46225 Nov 16 '12 at 22:39
@user46225: it is useful to localize at a prime if your task is about a single prime ideal, or more generally if your task can be reduced to checking something one prime at a time (e.g., that the norm of the different is the discriminant). – KCd Nov 17 '12 at 3:06
@KCd: Thank you for your insight, I'll keep it in mind. – user46225 Nov 17 '12 at 10:09
Also you can localize away from a finite set of prime ideals and still get a PID (by the approximation lemma) – edo arad Jul 22 '13 at 12:10

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.