MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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

Let $p$ be a prime number, $K$ a finite extension of $\mathbb{Q}_p$, $\mathfrak{o}$ its ring of integers, $\mathfrak{p}$ the unique maximal ideal of $\mathfrak{o}$, $k=\mathfrak{o}/\mathfrak{p}$ the residue field, and $q=\operatorname{Card} k$.

Recall that a polynomial $\varphi=T^n+c_{n-1}T^{n-1}+\cdots+c_1T+c_0$ ($n>0$) in $K[T]$ is said to be Eisenstein if $c_i\in\mathfrak{p}$ for $i\in[0,n[$ and if $c_0\notin\mathfrak{p}^2$.

Question. When is the extension $L_\varphi$ defined by $\varphi$ galoisian (resp. abelian, resp. cyclic) over $K$ ?

Background. Every Eisenstein polymonial $\varphi$ is irreducible, the extension $L_\varphi=K[T]/\varphi K[T]$ is totally ramified over $K$, and every root of $\varphi$ in $L_\varphi$ is a uniformiser of $L_\varphi$. There is a converse.

If the degree $n$ of $\varphi$ is prime to $p$, then the extension $L_\varphi|K$ is tamely ramified and can be defined by the polynomial $T^n-\pi$ for some uniformiser $\pi$ of $K$. Thus $L_\varphi|K$ is galoisian if and only if $n|q-1$, and, when such is the case, $L_\varphi|K$ is actually cyclic.

Real question. Is there a similar criterion, in case $n=p^m$ is a power of $p$, for deciding if $L_\varphi|K$ is galoisian (resp. abelian, resp. cyclic) ?

share|cite|improve this question
Do you mean [0,n-1]? – S. Carnahan Feb 3 '10 at 6:25
Definition. $\mathbb{N}$ is the free monoid on one generator, namely 1. Corollary. $0\in\mathbb{N}$. – Chandan Singh Dalawat Feb 3 '10 at 9:50
@Chandan, my understanding is that 0 tends to be in N in several European countries, but not in America. I have been told to use the notation Z_{\ge 0} to avoid ambiguity. (Personally I agree with you, but for a slightly different reason - the non-negative integers are precisely the set of cardinalities of finite sets.) – Qiaochu Yuan Mar 6 '10 at 16:20
@Chandan: And what part of the $SACRED_BOOK says that one should not define $\mathbb N$ as the free semigroup on one generator? :) – Mariano Suárez-Alvarez Mar 6 '10 at 16:57
The notation $(a,b)$ is used for the ordered pair, for the open interval, and for the gcd. I prefer to use $(a,b)$ , $]a,b[$, and $\operatorname{gcd}(a,b)$. If you want to exclude 0 from $\mathbb{N}$, use $\mathbb{N}^*$. – Chandan Singh Dalawat Mar 7 '10 at 5:09
up vote 2 down vote accepted

In the case where the ground field $K$ is $\mathbb{Q}_p$, some old work of Lbekkouri has recently been published here. In particular, for that case, i.e. for finite totally wildly ramified extensions of $\mathbb{Q}_p$, normality is equivalent to cyclicity. Furthermore:

When $n=p$, this was answered by Ore in the 30's: the extension is normal if and only if $p^2|c_j$ for $1\leq j\leq p-2$ and $p^2|(c_0+c_{p-1})$.

When $n=p^2$, Lbekkouri gives a list of necessary and sufficent congruence conditions on the coefficients $c_j$.

More generally for $n=p^m$, he gives some necessary conditions but since the methods require detailed computations with the ramification filtration, it seems unlikely that one could extend the sufficient conditions much beyond the $p^2$ case.

share|cite|improve this answer
Many thanks, dke. Nice to know that the degree-p case was considered by Ore in the 30s, and that the degree-p^2 case was settled only last year. So it appears that the general case is an open problem. – Chandan Singh Dalawat Mar 7 '10 at 3:54

I happen to have come across an early paper of Jean-Marc Fontaine --- apparently his first paper --- in which he treats a special case of the problem: Proposition 3 gives a criterion for the (totally ramified) extension defined by an Eisenstein polynomial of $p$-power degree to be galoisian with a unique ramification break ($>0$).

share|cite|improve this answer

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.