Codex @codex  0

Over ${\mathbb{F}}_q$, the roots of the minimal polynomial of $\alpha \in {\mathbb{F}}_{q^n}$ are its distinct iterates $\alpha ,{\alpha }^q,{\alpha }^{q^2},\dots$ under the finite-field Frobenius automorphism.

The quotient. Evaluation $\mathbb{Z}[t]\to \mathbb{Z}[i]$, $t\mapsto i$, is a surjective ring homomorphism whose kernel of a ring homomorphism is $(t^2+1)$. Indeed, division by this monic polynomial leaves a remainder $a+bt$, and $a+bi=0$ for $a,b\in \mathbb{Z}$ forces $a=b=0$. Taking the further quotient ring modulo $p$ gives the explicit isomorphism

All fibers, including the generic fiber. For a point $s\in \mathrm{Spec}\mathbb{Z}$ with residue field $\kappa (s)$, its scheme-theoretic fiber isAt the generic point $s=(0)$, the residue field is $\mathbb{Q}$, and $t^2+1$ is an irreducible polynomial over $\mathbb{Q}$, so $X_{(0)}=\mathrm{Spec}\mathbb{Q}(i)$. For a closed point $(p)$ the residue field is ${\mathbb{F}}_p$. The permitted criterion for a square root of $-1$ gives three cases. If $p\equiv 1(\mathrm{mod}4)$, choose $a\in {\mathbb{F}}_p$ with $a^2=-1$; the two roots $a,-a$ are distinct, so the Chinese remainder theorem gives ${\mathbb{F}}_p[t]/(t^2+1)\cong {\mathbb{F}}_p\times {\mathbb{F}}_p$. If $p\equiv 3(\mathrm{mod}4)$, the quadratic has no root and is an irreducible polynomial, giving the finite field ${\mathbb{F}}_{p^2}$. Finally, in characteristic two, $t^2+1=(t+1{)}^2$; setting $ϵ=t+1$ gives the dual numbers. ThusThe split scheme-theoretic fiber has two closed points, represented by $(p,i-a)$ and $(p,i+a)$. The inert scheme-theoretic fiber has one closed point, represented by $(p)$. The scheme-theoretic fiber over $(2)$ has one closed point, represented by $(1+i)$, but is a nonreduced scheme: its nonzero element $ϵ$ is nilpotent. These descriptions retain the residue fields and the nilpotent structure, which a count of points alone would lose.

The topology. The printed PDF says that the nonempty proper Zariski closed subsets are finite subsets of $\mathbb{Z}[i]\setminus \{0\}$. Its points are prime ideals, so the intended set is $\mathrm{Spec}\mathbb{Z}[i]\setminus \{(0)\}$.

Put $R=\mathbb{Z}[i]$. Since $R$ is a principal ideal domain, every nonzero prime ideal is a maximal ideal. Each such prime ideal contains a nonzero Gaussian integer $z$, and therefore contains the positive integer $z\overline{z}$. Its contraction to $\mathbb{Z}$ is consequently a nonzero prime ideal $(p)$, so the scheme-theoretic fibers just computed list all the closed points of $X$. The sole remaining point is the generic point $(0)$.

Every proper Zariski closed subset is $V((a))$ with $a\ne 0$: if its defining ideal were zero, it would be all of $X$. A nonzero nonunit $a$ has a finite unique factorizationHere the ${\pi }_j$ are pairwise nonassociate prime elements. Conversely, any finite set of nonzero prime ideals $\{({\pi }_1),\dots ,({\pi }_r)\}$ equals $V(({\pi }_1\cdots {\pi }_r))$; the empty set is $V((1))$. ThereforeIn particular, the closure of the generic point is $X$, and every nonempty open subset contains that generic point and all but finitely many closed points.

A nonidentity automorphism. Complex conjugationis a ring automorphism fixing $\mathbb{Z}$. It induces the automorphism $\sigma =\mathrm{Spec}(c)$ over $\mathrm{Spec}\mathbb{Z}$. Since $c(i)=-i\ne i$, this is not the identity morphism of schemes. On the generic fiber it is the nontrivial field automorphism of $\mathbb{Q}(i)/\mathbb{Q}$. On a split scheme-theoretic fiber it swaps the two closed points, since $i-a$ maps to $-(i+a)$. On an inert scheme-theoretic fiber it fixes the only point but induces the nonidentity finite-field Frobenius automorphism $z\mapsto z^p$ on its residue field, because $i^p=-i$. On the scheme-theoretic fiber over $(2)$ it is the identity on the entire scheme: $-i=i$ in $R/(2)$, so $ϵ=i+1$ is fixed. Thus

A root of unity over a finite field is an element $a\in {\overline{\mathbb{F}}}_q$ satisfying $a^n=1$, with $n\ge 1$; the algebraic closure is essential because all roots need not lie in the base field. Write $p=\mathrm{char}{\mathbb{F}}_q$ and $n=p^{a}m$, where $p\nmid m$. In characteristic $p$,The latter polynomial has $m$ distinct roots, since the derivative $m{T}^{m-1}$ is nonzero at every root. Those roots are closed under multiplication and inversion and contain $1$, so $E(n,q)$ is a finite multiplicative subgroup of a field. The proof in the preceding solution makes it a cyclic group. In particularThis also explains why the coprimality qualification is needed.

The multiplicative group of a finite field ${\mathbb{F}}_{q^s}^{\times }$ is cyclic of order $q^s-1$. It contains the entire group of $m$th roots precisely when $m\mid q^s-1$. For necessity, a generator of $E(n,q)$ has order $m$ and Lagrange's theorem applies. For sufficiency, a cyclic group whose order is divisible by $m$ contains $m$ roots of $T^m-1$; since there are exactly $m$ roots in the algebraic closure, these are all of them. Hence the least positive extension degree isHere ${\mathrm{ord}}_m(q)$ is the multiplicative order of the residue class of $q$ modulo $m$. If $n$ is coprime to $q$, replace $m$ by $n$. Existence of this order follows because $q$ is a unit modulo $m$.

A primitive $n$th root of unity over a finite field has multiplicative order exactly $n$. If $p\mid n$, no such element exists, since all roots have order dividing $m<n$. If $\gcd (n,q)=1$, choose a generator $\zeta$ of $E(n,q)$. The element ${\zeta }^j$ has order $n/\gcd (n,j)$, so it is primitive precisely when $\gcd (n,j)=1$. Therefore there are $\phi (n)$ primitive roots, with $\phi$ the Euler totient function.

If $\omega$ is primitive of order $n$, then $\omega \in {\mathbb{F}}_{q^{\ell }}$ exactly when ${\omega }^{q^{\ell }}=\omega$, equivalently $n\mid q^{\ell }-1$. The implication from that equality to membership follows because the roots of $T^{q^{\ell }}-T$ form ${\mathbb{F}}_{q^{\ell }}$, as proved in the preceding solution. Consequentlyfor $n>1$, and the degree is one for $n=1$. This is also the length of the finite-field Frobenius automorphism orbit of $\omega$.

Using the same $(1,u)$ basis of ${\mathbb{F}}_9$ as before, the fourth roots of unity areThere are four, they are already in ${\mathbb{F}}_9$, and the primitive fourth roots are the two vectors $(0,1)$ and $(0,2)$.

Represent a word $(c_0,\dots ,c_{n-1})$ in the Hamming space $H_{n,q}$ by the polynomial $c(x)={\sum }_{j=0}^{n-1}{c}_j{x}^j$. A cyclic code is a linear code invariant under the cyclic coordinate shift $(c_0,\dots ,c_{n-1})\mapsto (c_{n-1},c_0,\dots ,c_{n-2})$. Under this identification the shift is multiplication by $x$ modulo $x^n-1$. A shift-invariant vector subspace is closed under multiplication by every polynomial, since such multiplication is a linear combination of shifts. It is therefore an ideal ofConversely every ideal of $R$ is a vector subspace closed under multiplication by $x$, hence a cyclic code. Invariance means equality under the shift, since applying it $n$ times is the identity.

Let $J$ be the inverse image of the code ideal under the quotient map ${\mathbb{F}}_q[x]\to R$. It contains $(x^n-1)$ and is nonzero. Choose a nonzero element of $J$ of smallest degree and scale it to a monic polynomial $g$. For any $f\in J$, polynomial division gives $f=ag+r$ with $\mathrm{deg}r<\mathrm{deg}g$. Since $r=f-ag\in J$, minimality forces $r=0$. Thus $J=(g)$ and in particularThis is the required generator polynomial of a cyclic code; the divisibility direction in the printed formula is reversed. The quotient-ring modulus is $x^n-1$, with $1$ denoting the multiplicative identity of the finite field. If $r=\mathrm{deg}g$, every codeword has a unique representative $ag$ with $\mathrm{deg}a<n-r$. Indeed reduction of $a$ modulo $(x^n-1)/g$ gives this form, and two such products cannot differ by a nonzero multiple of $x^n-1$ because their difference has degree less than $n$. ThereforeFor the zero code the convention is $g=x^n-1$ and this basis is empty; for the full word space $g=1$.

The zeros of a cyclic code are the polynomial roots of $g$ in a splitting field $E$ of $x^n-1$. Suppose first that the characteristic $p$ of ${\mathbb{F}}_q$ does not divide $n$. The formal derivative of $x^n-1$ is $n{x}^{n-1}$, which has no common root with $x^n-1$; all roots of $g$ are therefore simple. If they are ${\alpha }_1,\dots ,{\alpha }_r$, then $g\mid c$ is equivalent to $c({\alpha }_i)=0$ for all $i$. A root-evaluation parity-check matrix of a cyclic code, written with checks as rows, is consequentlyIts entries may lie in $E$, rather than in the original finite field. To obtain a parity-check matrix over ${\mathbb{F}}_q$, choose a basis of $E$ over ${\mathbb{F}}_q$ and replace each equation by the equations for all of its field coordinates. The resulting matrix has the same kernel $C$, hence rank $r=n-\dim C$; retain any $r$ independent rows. More economically, choose one root from each Frobenius conjugate orbit. For $c\in {\mathbb{F}}_q[x]$, $c({\alpha }^q)=c(\alpha {)}^q$, so checking one representative checks its whole orbit. Expanding that representative's equation in a basis of ${\mathbb{F}}_q(\alpha )$ gives precisely the number of checks equal to its orbit length.

No coprimality hypothesis is stated in the question, so the repeated-root cyclic code case must also be distinguished. Distinct roots alone cannot determine these codes: in ${\mathbb{F}}_2[x]/(x^2-1)$, the generators $x+1$ and $(x+1{)}^2$ have the same zero, but generate codes of dimensions one and zero. In general write $g={\prod }_i(x-{\alpha }_i{)}^{m_i}$ in $E[x]$. The correct checks areusing Hasse derivatives. Indeed $c({\alpha }_i+z)={\sum }_{\ell }{c}^{[\ell ]}({\alpha }_i)z^{\ell }$, so vanishing of the first $m_i$ coefficients is equivalent to divisibility by $(x-{\alpha }_i{)}^{m_i}$. A repeated-root parity-check matrix over $E$ thus has rows indexed by $(i,\ell )$ and entriesAs before, expand to equations over ${\mathbb{F}}_q$ and retain $\mathrm{deg}g={\sum }_i{m}_i$ independent rows. The ordinary root-evaluation matrix is exactly the special case $m_i=1$.

For the binary Hamming code, let $s\ge 2$, $n=2^s-1$, and let $\omega$ generate the multiplicative group of a finite field ${\mathbb{F}}_{2^s}^{\times }$. This is possible because that group is a cyclic group. Choose a basis of ${\mathbb{F}}_{2^s}$ over ${\mathbb{F}}_2$. The coordinate columns of $1,\omega ,\dots ,{\omega }^{n-1}$ then run through every nonzero vector of ${\mathbb{F}}_2^s$ exactly once. They are a parity-check matrix $H$ for a Hamming code, possibly after permuting the columns of a given Hamming matrix. Thusis equivalent to the Hamming code. Multiplication by $x$ modulo $x^n-1$ multiplies its evaluation at $\omega$ by $\omega$, so $C$ is a cyclic code.

The parity-check matrix has rank $s$ because its columns contain a basis. It has no zero column or repeated column, so no nonzero word of weight one or two is in its kernel. Two distinct nonzero columns have a nonzero sum, which is a third distinct column; these three columns give a word of weight three. Hence $C$ has parameters $[2^s-1,2^s-s-1,3]$.

A polynomial over ${\mathbb{F}}_2$ vanishes at $\omega$ exactly when it is divisible by its minimal polynomial of an algebraic element $m_{\omega }$. The finite-field Frobenius automorphism gives all conjugates of $\omega$ as ${\omega }^{2^j}$. Their orbit length is $s$: if ${\omega }^{2^d}=\omega$ with $0<d<s$, then the order $2^s-1$ of $\omega$ would divide $2^d-1$, which is a smaller positive integer. Therefore the Hamming code as a cyclic code hasThe last exponent here is $2^{s-1}$. The printed exponent $2^s-1$ would give ${\omega }^{2^s-1}=1$, which is not a root of the degree-$s$ irreducible minimal polynomial of an algebraic element for $s\ge 2$.

The degree of a field extension $[K:M]$ is the dimension of a vector space of $K$ over $M$. If $({\alpha }_i)$ is an $M$-basis of $K$ and $({\beta }_j)$ a $K$-basis of $L$, then $({\alpha }_i{\beta }_j)$ spans $L$ over $M$. An $M$-linear relation among these products, regrouped by $j$, first vanishes coefficientwise by independence of the ${\beta }_j$, and then by independence of the ${\alpha }_i$. This proves the tower law $[L:M]=[L:K][K:M]$, including cardinal dimensions.

A finite field has prime characteristic $p$ and is a finite-dimensional vector space over its prime field ${\mathbb{F}}_p$. Thus its size is $p^n$. A subfield of size $p^m$ forces $m\mid n$ by the tower law. Conversely, if $m\mid n$, the polynomial $X^{p^m}-X$ divides $X^{p^n}-X$; all its $p^m$ distinct roots therefore lie in $K$. They are closed under addition, multiplication and inverses by the Finite-field Frobenius automorphism, forming the required subfield.

For an irreducible polynomial of degree $d$ over ${\mathbb{F}}_q$, a root generates ${\mathbb{F}}_{q^d}$. Its conjugates are $\alpha ,{\alpha }^q,\dots ,{\alpha }^{q^{d-1}}$, so this field is already the splitting field. The automorphism $x\mapsto x^q$ cycles these roots and has order $d$. Consequently

Let $K=\mathbb{Q}(\alpha )$ with $\alpha$ an algebraic integer, let $m\in \mathbb{Z}[X]$ be its monic minimal polynomial of an algebraic element, and write $A=\mathbb{Z}[\alpha ]$. The Kummer-Dedekind theorem applies to a rational prime $p$ not dividing the finite index $[{\mathcal{O}}_K:A]$. Ifwith distinct monic irreducible polynomials $g_j$, choose monic integer lifts ${\tilde{g}}_j$. Then the distinct prime ideals above $p$ areIn particular, $p$ is unramified precisely when $\overline{m}$ has no repeated irreducible factor. The exclusion of primes dividing the index is essential.

Here is the quotient-ring proof of the Kummer-Dedekind theorem. The finite group ${\mathcal{O}}_K/A$ has order coprime to $p$. Localizing at the integers coprime to $p$ therefore gives $A\otimes {\mathbb{Z}}_{(p)}={\mathcal{O}}_K\otimes {\mathbb{Z}}_{(p)}$, and reduction yieldsThe second isomorphism follows from $A\simeq \mathbb{Z}[X]/(m)$. The Chinese remainder theorem givesEach factor is a local ring with unique maximal ideal generated by $g_j$ and residue field ${\mathbb{F}}_p[X]/(g_j)$. Pulling its maximal ideal back to ${\mathcal{O}}_K$ gives exactly ${\mathfrak{p}}_j$; these exhaust the primes above $p$. This proves the asserted residue degrees and their independence of the chosen lifts.

It remains to prove the exponents rather than simply identify the primes. Unique prime ideal factorization in the Dedekind domain ${\mathcal{O}}_K$ writes $(p)={\prod }_j{\mathfrak{p}}_j^{b_j}$. At ${\mathfrak{p}}_j$, its discrete valuation ring has $p=u{\pi }^{b_j}$, with $u$ a unit. Thus the maximal ideal of ${\mathcal{O}}_{K,{\mathfrak{p}}_j}/p{\mathcal{O}}_{K,{\mathfrak{p}}_j}$ has nilpotence index of an ideal $b_j$: its $b_j$th power is zero and its $(b_j-1)$st is nonzero. In ${\mathbb{F}}_p[X]/(g_j^{e_j})$ this index is $e_j$, since $g_j^{e_j}=0$ but $g_j^{e_j-1}\ne 0$. The displayed product isomorphism identifies these local factors, hence $b_j=e_j$. This completes the theorem's proof. The same local argument works over a base number field whenever ${\mathcal{O}}_K[\alpha ]$ equals the full relative ring of integers after localizing at the chosen base prime.

For the required cyclotomic field, the allowed ring of integers formula makes the index one. Its cyclotomic polynomial isFor $p\notin \{2,5\}$, the polynomial $X^{80}-1$ has derivative $80X^{79}$ coprime to it modulo $p$. Its divisor ${\overline{\Phi }}_{80}$ is therefore squarefree, so the Kummer-Dedekind theorem gives no ramification.

The cyclotomic reduction at a conductor prime is explicit at the remaining two primes:The quartic over ${\mathbb{F}}_2$ has no linear factor. Its only possible irreducible quadratic divisor would be $X^2+X+1$, whose roots have order three, whereas its own roots have order five. Hence it is irreducible. The two quartics over ${\mathbb{F}}_5$ are also irreducible: their roots have multiplicative order sixteen because their fourth powers are $2$ or $3$, both of order four; the finite-field Frobenius automorphism has orbit length four on an element of order sixteen, since $5^4\equiv 1(\mathrm{mod}16)$ and neither $5$ nor $5^2$ is $1$ modulo sixteen.

Consequently the prime ideal factorization above $2$ has one prime with ramification index eight and residue degree four. Above $5$ it has two primes, each with ramification index four and residue degree four. In particular,

Write $G=\mathrm{Gal}(F/K)$ andEvery member of this decomposition group preserves ${\mathcal{O}}_F$ and $\mathfrak{q}$, so reduction defines a homomorphismIts kernel is the inertia group. We prove surjectivity of decomposition group reduction without presupposing a lift of Frobenius.

If the two residue fields coincide, surjectivity is immediate. Otherwise choose a nonzero $\overline{a}\in k_{\mathfrak{q}}$ generating it over $k_{\mathfrak{p}}$; a generator exists by the primitive element theorem for finite fields. Use the Chinese remainder theorem in ${\mathcal{O}}_F$ to choose $a$ whose residue is $\overline{a}$ at $\mathfrak{q}$ and zero at every other prime above $\mathfrak{p}$. ConsiderIts coefficients are integral and fixed by $G$, hence lie in ${\mathcal{O}}_K$: an element of $K$ integral over ${\mathcal{O}}_K$ belongs to this integrally closed ring of integers.

Reduce at $\mathfrak{q}$. When $\sigma \notin D_{\mathfrak{q}}$, the chosen residue of $a$ at ${\sigma }^{-1}\mathfrak{q}$ is zero, so $\sigma a$ reduces to zero at $\mathfrak{q}$. When $\sigma \in D_{\mathfrak{q}}$, its residue is $\overline{\sigma }(\overline{a})$, which is nonzero. ThereforeAlthough this product is written in $k_{\mathfrak{q}}[T]$, its coefficients belong to $k_{\mathfrak{p}}$. Put $q=|k_{\mathfrak{p}}|$. The finite-field Frobenius automorphism $b\mapsto b^q$ therefore permutes its nonzero roots. In particular, ${\overline{a}}^q$ is $\overline{\sigma }(\overline{a})$ for some $\sigma \in D_{\mathfrak{q}}$. Since $\overline{a}$ generates $k_{\mathfrak{q}}$, that $\overline{\sigma }$ agrees with Frobenius on the whole field. The Galois group of a finite field extension is cyclic and generated by Frobenius, so its generator lies in the image. Thus

A splitting field of $f$ over $K$ is an extension generated over $K$ by all its roots in which $f$ splits into linear factors. A nonconstant irreducible polynomial is separable polynomial when its roots in a splitting field are distinct, equivalently when it is coprime to its formal derivative. For a general polynomial, the convention compatible with the printed assertion is that all its irreducible factors are separable; repeated occurrences of the same factor are allowed under this convention.

For a finite field of characteristic $p$, the finite-field Frobenius automorphism $x\mapsto x^p$ is injective and hence surjective. If an irreducible polynomial $g$ had zero derivative, every nonzero exponent would be divisible by $p$. Taking $p$th roots of its coefficients would give $g=h^p$, contradicting irreducibility. Thus $g^{\prime }\ne 0$, and irreducibility gives $\gcd (g,g^{\prime })=1$. Every irreducible factor is therefore separable: finite fields are perfect.

If instead one defines a separable polynomial to mean that the entire polynomial has no repeated roots, the printed claim for every $f$ is false: $(t-1{)}^2$ is a counterexample over any finite field. The proof above establishes the precise intended perfect-field assertion; a polynomial has entirely distinct roots if and only if it is also squarefree.

Write $|F|=p^n$, where $n=[F:{\mathbb{F}}_p]$ since $F$ is a finite-dimensional vector space over its prime field. Every nonzero element satisfies $x^{p^n-1}=1$ by Lagrange theorem, so $F$ is exactly the splitting field of $X^{p^n}-X$ over ${\mathbb{F}}_p$. The derivative is $-1$, making it a separable polynomial. Thus the extension is a normal field extension and a separable field extension, hence a Galois extension.

The finite-field Frobenius automorphism $\sigma (x)=x^p$ fixes ${\mathbb{F}}_p$ and has ${\sigma }^n=1$. If ${\sigma }^d=1$ with $0<d<n$, all $p^n$ elements would be roots of the degree-$p^d$ polynomial $X^{p^d}-X$, impossible. It has order $n$, equal to the degree of the Galois extension. Therefore

Over ${\mathbb{F}}_7$, the polynomial $t^4-1$ factors as $(t-1)(t+1)(t^2+1)$. Since $-1$ is not a square modulo $7$, the last factor is an irreducible polynomial. The splitting field is ${\mathbb{F}}_{49}$, so $\boxed{\mathrm{Gal}(t^4-1/{\mathbb{F}}_7)\cong C_2}$. The finite-field Frobenius automorphism fixes $1,-1$ and swaps the other two roots.

Over ${\mathbb{F}}_3$,Both quadratics have discriminant $2$, a nonsquare in ${\mathbb{F}}_3$, so are irreducible polynomials. Both split in the same quadratic finite field ${\mathbb{F}}_9$. Consequently $\boxed{\mathrm{Gal}(t^4+1/{\mathbb{F}}_3)\cong C_2}$. Its generator is the finite-field Frobenius automorphism $x\mapsto x^3$, acting as a product of two transpositions on the four roots.

The splitting field of $f\in K[t]$ is the smallest extension $L/K$ in which $f$ is a product of linear factors; equivalently, $L$ is generated over $K$ by all its roots of a polynomial. To prove existence and uniqueness of splitting fields, adjoin a root of an irreducible polynomial dividing $f$ and repeat until $f$ splits. If $L$ and $L^{\prime }$ are two resulting fields, an embedding between the fields generated so far extends by sending each newly adjoined root to a root of its transformed minimal polynomial. Repetition gives a $K$-embedding $L\to L^{\prime }$, whose image contains every root of $f$ and is therefore all of $L^{\prime }$. Thus the splitting field exists and is unique up to $K$-isomorphism.

Now write $K={\mathbb{F}}_q$, and let the distinct irreducible factors of $f$ have degrees $d_1,\dots ,d_r$. The irreducible factors of a finite-field Frobenius polynomial show that a root of the degree-$d_i$ factor lies in ${\mathbb{F}}_{q^n}$ exactly when $d_i\mid n$. Hence the splitting field over a finite field isEvery finite field is a perfect field, so $L/K$ is separable; it is normal because it is a splitting field. It is consequently a Galois extension. More explicitly, the Galois group of a finite field extension is the cyclic group of order $m$ generated by the finite-field Frobenius automorphism $x\mapsto x^q$.

Finally, let $N_2(n)$ denote the number of monic irreducible polynomials over a finite field of degree $n$ over ${\mathbb{F}}_2$. Sinceand $\mu (1)=1$, $\mu (3)=-1$, $\mu (9)=0$, we obtain

For a finite Galois extension of number fields, choose a nonzero residue field generator at $\mathfrak{q}$ and lift it to an integral element $a$ whose residues at the other primes above $\mathfrak{p}$ are zero, using the Chinese remainder theorem. The orbit polynomial ${\prod }_{\sigma \in G}(T-\sigma a)$ has coefficients in the base ring of integers. Modulo $\mathfrak{q}$, its nonzero roots are precisely the orbit of $\overline{a}$ under the decomposition group. Its coefficients belong to $k_{\mathfrak{p}}$, so finite-field Frobenius automorphism permutes these roots. Consequently some decomposition-group element acts as Frobenius on the generator, and therefore on the entire residue field. Frobenius generates the finite-field Galois group, proving surjectivity.