0

I was reading Dummit and Foote. On page 551 of the book, there is an example mentioned about irreducibile inseparable polynomials. I am facing difficulty in proving the irreducibility of polynomials.

How I can show this : - The polynomial $p(x) = x^{2^m} - t$ over $F = \mathbb{F}_2(t)$ is irreducible. For small $m$ like 2 or 4 one can enumerate cases and get done but what about a general m?

1 Answers1

1

At least two simple ways of getting there:

  1. If $u$ is a zero of your polynomial in an extension field $K$ of $F$ then $u^{2^m}=t$ and, by Freshman's dream, $$p(x)=(x-u)^{2^m}=x^{2^m}-u^{2^m}=x^{2^m}-t.$$ So, by uniqueness of polynomial factorization, any eventual factor of $p(x)$ in $F[x]$ must be of the form $(x-u)^i$ for some $i,0<i<2^m$. But the constant term $u^i$ is in $F$ only when $i=0$ or $i=2^m$, and we are done.
  2. You can apply Eisenstein's criterion to the prime $t$, irreducible in $\Bbb{F}_2[t]$. All the coefficients of $p(x)$, save the leading $1$, are divisible by $t$, and the constant coefficient is not divisible by $t^2$. Therefore Eisenstein applies.
Jyrki Lahtonen
  • 133,153