14

I have a question, I think it concerns with field theory.

Why the polynomial $$x^{p^n}-x+1$$ is irreducible over ${\mathbb{F}_p}$ only when $n=1$ or $n=p=2$?

Thanks in advance. It bothers me for several days.

user26857
  • 52,094
Ken How
  • 141

2 Answers2

20

We will use fairly liberally the result that if $q(x)\in\mathbb F_p[x]$ is irreducible, then, for any $k$, $q(x)\mid x^{p^k}-x$ if and only if $\deg q\mid k$.

If $q_n(x)=x^{p^n}-x+1$ is irreducible, then there is a automorphism, $\phi$ of the field $\mathbb F_p[x]/\left<q_n(x)\right>$ which sends $\bar x$ to $\bar x-1$, namely:

$$\phi(\alpha)=\alpha^{p^n}$$

for any element $\alpha$. (Where $\bar x$ is the image of $x$ from $\mathbb F_p[x]$ in this field.)

Then, $\phi(\bar x)=\bar x^{p^n}=\bar x-1$. So that automorphism must have order $p$: $\phi^p = 1$, the identity automorphism.

Now, $\phi^k(\alpha)=\alpha^{p^{kn}}$, so, in particular, $\bar x=\phi^p(\bar x)=\bar x^{p^{pn}}$, and therefore we know $0=\bar x^{p^{pn}}-\bar x$, and therefore that the polynomial $x^{p^{pn}}-x$ is divisible by $q_n(x)$.

Using the result above, we therefore see that $p^n=\deg q_n(x)\mid pn$. But $p^n\mid pn$ can only happen if $n=1$ or $n=2$ and $p=2$.

I think you can show that $q_1(x)\mid x^{p^p}-x$ pretty straight-forwardly, therefore showing that it must factor as elements of degree $p$ and degree $1$. But clearly it has no factors of degree $1$ since it has no roots in $\mathbb F_p$, so, since $\deg q_n=p$, $q_1(x)$ must be prime.

Then you have the last case, $x^4-x+1$ over $\mathbb F_2$, which you can brute force.

Thomas Andrews
  • 177,126
  • If $n=1$, then this argument shows that any irreducible factor has degree dividing $p$. But by Fermat's theorem there are no linear factors. For $n=p=2$, again there are no linear factors, and the only irreducible quadratic mod $2$ is $x^2+x+1$, which is also not a factor. – Chris Eagle Mar 19 '12 at 23:08
  • Dear Thomas, your answer is quite difficult to read because your $x$ refers both to an indeterminate and a generator of a finite field. Also, polynomials have degrees, not dimensions. – Georges Elencwajg Mar 19 '12 at 23:23
  • I never once talk about a generator of the field. @GeorgesElencwajg. Not sure if I mis-wrote dimension before, but somewhere in my edits, I managed to remove the word. I have fixed it so that $\bar x$ is used in the field as the image of $x$ in the polynomial ring, for some clarity. – Thomas Andrews Mar 19 '12 at 23:32
  • Dear Thomas, I meant that $\bar x$ , your old $x$, was a generator of the field $\mathbb F_p[x]/\left<q_n(x)\right>$ i.e. that that field can be written $\mathbb F_p[\bar x]$. But notations are perfectly clear now and we can see how nice your proof is ! – Georges Elencwajg Mar 19 '12 at 23:43
  • Ah, I thought you meant multiplicative generator of the units of the field, not algebraic generator. @GeorgesElencwajg – Thomas Andrews Mar 19 '12 at 23:45
  • @ThomasAndrews Im not getting why is $\phi$ a automorphism of field $\mathbb F_p[x]/\left<q_n(x)\right>?$ .Here $\phi(x)= x-1$ that mean $\phi(a+b) \neq \phi(a) +\phi(b)$ contradict the definition of automorphism – wasiu Jun 28 '22 at 17:47
  • 1
    Well, $\phi(a)\neq a-1$ for all $a.$ I was very careful in my notation. $\phi(\overline x)=\overline x-1,$ where $\overline x$ is the image of $x$ in the quotient map. In general, $\phi(a)=a^{p^n},$ and this is a standard automorphism on a finite field of characteristic $p.$ But $\overline x^{p^n}=\overline x-1.$ @wasiu – Thomas Andrews Jun 28 '22 at 18:18
  • okay thanks you @ThomasAndrews – wasiu Jun 28 '22 at 18:21
3

I have another solution that might be easier to follow.

Let $\alpha$ be a root of $q(x)=x^{p^n}-x+1$. Note that $\alpha + a$ is also a root of $q(x)$ for all $a \in \mathbb{F}_{p^n}$. Consider cyclic muplicative group $\mathbb{F}_{p^n}^{\times} = \mathbb{F}_{p}(\theta)$ for some generator $\theta$, then $\alpha + \theta$ and $\alpha$ are roots of $q(x)$, so they belong to $\mathbb{F}_{p}(\alpha)$ which shows that $\theta \in \mathbb{F}_{p}(\alpha)$, hence $\mathbb{F}_{p^n} \subset \mathbb{F}_{p}(\alpha)$. We have $\mathbb{F}_{p} \subset \mathbb{F}_{p^n} \subset \mathbb{F}_{p}(\alpha)$.

If $p(x)$ is irreducible over $\mathbb{F}_p$, then $[\mathbb{F}_{p}(\alpha):\mathbb{F}_{p}] = p^n$, hence $|\mathbb{F}_{p}(\alpha)|=p^{pn}$. Consider the endomorphism $\sigma$: $\mathbb{F}_{p}(\alpha) \to \mathbb{F}_{p}(\alpha)$ which sends $\alpha \to \alpha^{p^n}$ (why it is a endomorphism?). Consider subgroup of automorphism $H = \langle \sigma \rangle$. $H$ fixes $\mathbb{F}_{p^n}$ (Why?), so we have $[\mathbb{F}_{p}(\alpha): \mathbb{F}_{p^n}]=|H|=p$ ($\sigma^p$ is identity map). Then $[\mathbb{F}_{p}(\alpha):\mathbb{F}_{p}] = [\mathbb{F}_{p}(\alpha): \mathbb{F}_{p^n}][\mathbb{F}_{p^n}:\mathbb{F}_{p}]$ which means $p^{n}=pn$ and this only happens when $n=1$ or $n=p=2$.

Hoang Nguyen
  • 570
  • 3
  • 10