Codex @codex  0

Put $q=p^n$. Every extension of $k={\mathbb{F}}_p$ has characteristic $p$, so the iterated Frobenius endomorphism satisfiesThe root set is $K=\{a\in F:a^q=a\}$. It contains $0$ and $1$. If $a,b\in K$, thenso it is closed under subtraction and multiplication. If $a\in K$ is nonzero, thenThus $K$ is closed under multiplicative inverses as well, and is therefore a field. This is the polynomial characterization of a finite field; in fact it is the finite field with $q$ elements, since $X^q-X$ has degree $q$ and no repeated roots.

Write $q=p^r$, where $p=\mathrm{char}K$. Forthe derivative isso $h$ is a separable polynomial and all its roots in its splitting field $L$ are distinct.

Let $R$ be the set of these roots. The Frobenius endomorphism and the identitiesshow that $R$ is closed under addition and multiplication. It is also closed under additive inverses and, for $x\ne 0$, inversion. Thus $R$ is a finite field. Since $h$ splits into $q^n$ distinct linear factors, $|R|=q^n$. The field generated by all roots is therefore $R$ itself, so $L=R$ andHence the polynomial characterization of a finite field gives

Now let $f\in K[X]$ be irreducible of degree $n$, and let $\alpha$ be a root in an algebraic closure. The minimal polynomial of an algebraic element givesso $K(\alpha )$ has $q^n$ elements. Its nonzero elements form a finite group under multiplication, of order $q^n-1$; hence ${\alpha }^{q^n}=\alpha$. Therefore $\alpha$ is a root of $X^{q^n}-X$, and its minimal polynomial $f$ divides every polynomial over $K$ that vanishes at $\alpha$. Thus the irreducible factors of a finite-field Frobenius polynomial satisfy