0

Reading this Wikipedia page while learning about polynomials over finite fields, I came upon the following lemma:

For $i ≥ 1$ the polynomial $x^{q^i}-x \in \mathbf{F}_q[x]$ is the product of all monic irreducible polynomials in $\mathbf{F}_q[x]$ whose degree divides $i$.

What is this lemma properly called, and how is it proved?

Mints97
  • 125

2 Answers2

1

Hints:

Denoting by $\;k:=\overline{\Bbb F_q}\;$ an algebraic closure of $\;\Bbb F_q\;$ , prove that for any $\;n\in\Bbb N\;$ we have that

$$\Bbb F_{q^n}=\left\{\;\alpha\in k\;:\;\;\alpha^{q^n}-\alpha=0\;\right\}$$

and now use/prove that $\;\Bbb F_{q^m}\le\Bbb F_{q^n}\;$ (the left field is a subfield of the right field) iff $\;m\le n\;,\;\;m,n\in\Bbb N$

Timbuc
  • 34,191
  • I'm so sorry, but I cannot understand your answer. When would $α^{q^n}$ equal $α$? – Mints97 Feb 02 '15 at 14:03
  • @Mints97 Precisely when $;\alpha\in\Bbb F_{q^n};$ . What part you didn't understand? First, you have to prove that the given set is a field wrt the operations modulo $;q;$, and then you must prove it has precisely $;q^n;$ elements. For this you could use things you know about roots of polynomials over a field. The second part is a more or less straightforward application of the multiplicativity degree of a tower of fields, together with the first part perhaps, or in some other way. – Timbuc Feb 02 '15 at 14:24
  • I'm... sorry... I probably shouldn't have asked this question yet... I just don't know enough yet to understand your answer. I haven't learned about multiplicativity degrees or about towers of fields... But I guess I could try to understand it again when I get comfortable with all these concepts. – Mints97 Feb 02 '15 at 15:04
  • This is wrong. You should replace$m \leq n$ by $m \mid n$. – Watson Feb 23 '21 at 12:26
0

See: Irreducible Polynomials over a Finite Field (search "splits" there)

With q prime, let $g(x)=x(x^{{q^i-1}}−1)$ , why every element of $F_{q^i}$ is a root of g(x) ?
My hint:
a) 0 is easy
b) $F_{q^i}-\{0\}$ is a cyclic multiplicative group of order ${q^i-1}$ so its elements satisfy $x^{{q^i-1}}−1=0$
c) g(x) has now every root it can afford !

The rest of the proof uses Galois theory (that's why "degree divides i" in your post and why the algorithm in the wiki you gave is fast enough).
I would like to say thanks to you : your post and the algorithm motivate me to learn more about Galois theory.

The proof is found in: https://www.jmilne.org/math/CourseNotes/FT.pdf
You should save that file and use Foxit to read it, then search for "Each monic irreducible polynomial f of degree" in the PDF.
PS: on SEP1993 (Fermat's Year), in the mad rush to Fermat's Last, after studying math for ca 70 days, I directly read the chapter "Galois theory" in Serge Lang book ("Algebra") using TOP-DOWN method : I went back to previous chapters if necessary. The method worked thanks to this legendary book which I borrowed from a layman-library!! Now a SEARCHable e-version can be had for < 20 USD, I think.
Hint for graduates: free PDFs : https://www.jmilne.org/math/CourseNotes/

exactzen
  • 9
  • 3