Codex @codex  0

A field has characteristic zero when no positive integer multiple of its identity vanishes. Equivalently, its prime field is isomorphic to $\mathbb{Q}$. Every irreducible polynomial over such a field is a separable polynomial.

If $\alpha$ and $\beta$ are separable algebraic elements, put $K=F(\alpha )$ and $L=K(\beta )$. The minimal polynomial of $\beta$ over $K$ divides its separable polynomial over $F$, and is therefore separable. The extension count for field embeddings gives $[K:F]$ embeddings of $K$ into an algebraic closure, each with $[L:K]$ extensions to $L$. Hence $L$ has $[L:F]$ embeddings. For $E=F(\alpha +\beta )$, each embedding of $E$ has at most $[L:E]$ extensions, so there are at least $[E:F]$ embeddings of $E$ and hence exactly that number. Since $E$ is a simple field extension, its minimal polynomial has $[E:F]$ distinct roots. Thus $\alpha +\beta$ is a separable algebraic element.

For $a\ge 1$ and $p\nmid m$, the identity ${\Phi }_{p^{a}m}(X)={\Phi }_m(X^{p^a})/{\Phi }_m(X^{p^{a-1}})$ gives the displayed reduction, since taking a $p$th power equals substitution $X\mapsto X^p$ in characteristic $p$. The reduction of ${\Phi }_m$ is squarefree because it divides the separable polynomial $X^m-1$. The Kummer-Dedekind theorem therefore gives ramification index of a prime ideal $\phi (p^a)$ in the cyclotomic field. In particular, a conductor factor $2$ occurring only to the first power has index one and creates no ramification by itself.

A nonzero polynomial is factorwise separable if every irreducible factor is a separable polynomial. Unlike the convention that all roots must be distinct, this condition allows repeated irreducible factors. Its splitting field is a separable field extension precisely when the polynomial is factorwise separable: in one direction every root has a separable minimal polynomial; in the other, adjoining finitely many roots with separable minimal polynomials gives a separable extension. Thus the implication from a separable splitting extension to a polynomial with distinct roots needs the extra squarefree hypothesis. The example $(X-1{)}^2$ already distinguishes the conventions.

Let $A$ be a companion matrix of a monic irreducible polynomial $f\in F[x]$ of degree $n$. Form the $N$-by-$N$ block matrix $B$ with $A$ on its diagonal, $I_n$ immediately above the diagonal, and zero elsewhere. If the field characteristic is $p>0$, write $f(x)=h(x^q)$ with $q=p^r$ maximal, so that $h^{\prime }\ne 0$; in characteristic zero take $q=1$ and $h=f$. ThenThus a separable polynomial gives $m_B=f^N$, but an irreducible polynomial with zero formal derivative can give a smaller exponent. For example, over the rational function field ${\mathbb{F}}_2(t)$, the irreducible polynomial $f(x)=x^2-t$ has $q=2$, so a two-block chain still has minimal polynomial $f$.

To prove the formula, write $B=D+K$, where $D$ has diagonal blocks $A$ and $K$ is the block shift. These are commuting operators, and $K^j$ vanishes exactly when $j\ge N$. The binomial theorem in positive field characteristic gives $B^q=D^q+K^q$. Expanding $h(D^q+K^q)$ gives $f(B)=K^{q}H$, with $H$ commuting with $K$. The diagonal blocks of $H$ are $h^{\prime }(A^q)$, which are invertible by Bézout's identity for polynomials, since $h$ is irreducible with nonzero formal derivative and $h(A^q)=0$. Therefore $f(B{)}^s=K^{qs}{H}^s$ vanishes exactly when $qs\ge N$. Finally, the block upper triangular matrix determinant gives the displayed characteristic polynomial, while the Cayley-Hamilton theorem and irreducibility force the minimal polynomial to be a power of $f$.

Source paper: earlier Computer Science release, member 2016/T/a15293w1.pdf. Its cover dates this examination to 14 June 2017, but its question pages are damaged. The complete three-page counterpart is in Mathematics Part A release, member FOI-20210708-1 - Data/a15293w1 (2).pdf.

All seventeen source subparts are answered below. Part 1(b)(iii) needs a separable polynomial hypothesis over a general field; its intended case, a counterexample to the unrestricted claim, and the corrected general result are distinguished in that solution. This paper uses the characteristic polynomial convention ${\chi }_T(x)=\det (T-xI)$, which differs by $(-1{)}^{\dim V}$ from the monic convention.

The department's solution-release policy covers even examination years and the exceptional release for 2019; it does not advertise 2017 solutions. The exact-paper check found examiner comments, but no advertised worked answers requiring any subpart to be skipped.

Write $f=m_T$. Part (ii) identifies the first superdiagonal block exactly:where $f^{\prime }$ is the formal derivative. Thus the candidate is $g=f^{\prime }$. If the irreducible polynomial $f$ has $f^{\prime }\ne 0$, its polynomial degree makes $f$ and $f^{\prime }$ coprime. Equivalently, $f$ is a separable polynomial. This includes every irreducible polynomial over a field of characteristic zero, and every irreducible polynomial over a perfect field.

Under this separability hypothesis, Bézout's identity for polynomials gives $a(x)f(x)+b(x)f^{\prime }(x)=1$. Evaluating at $A$ proves that $C=f^{\prime }(A)$ is an invertible matrix. Moreover, $f(B)$ has zero diagonal blocks, because $f(A)=0$. It is therefore a nilpotent matrix with $f(B{)}^N=0$. The only product of $N-1$ strictly upward block steps that reaches block $(1,N)$ uses the first superdiagonal every time, soFor $N=1$, the corresponding assertion is simply $f(B{)}^0=I\ne 0$. The block upper triangular matrix $B$ hasThe minimal polynomial divides this characteristic polynomial. Since $f$ is an irreducible polynomial, it must be a power of $f$; the exact nilpotency index just found forces

The arbitrary-field qualification is necessary. In the rational function field $F={\mathbb{F}}_2(t)$, take $f(x)=x^2-t$. This is an irreducible polynomial: a square of a rational function has even order of vanishing at $t=0$, while $t$ has odd order. Its formal derivative is zero. With $N=2$,The off-diagonal block in $f(B)$ is zero, and $m_U=f$, rather than $f^2$. No alternative polynomial $g$ coprime to $f$ could represent that block: $g(A)=0$ would imply $m_T=f\mid g$. Thus the printed coprimality claim fails as stated over a general field.

There is also a precise general replacement. In characteristic $p>0$, let $q=p^r$ be the largest power for which $f(x)=h(x^q)$, so that $h^{\prime }\ne 0$; set $q=1$ in characteristic zero. Irreducibility of $f$ implies that $h$ is an irreducible polynomial, so $h$ and $h^{\prime }$ are coprime. The binomial theorem in characteristic $p$ gives $B^q=D^q+K^q$. Expanding $h(D^q+K^q)$, with the coefficients equivalently supplied by the Hasse derivatives, giveswhere $H$ commutes with $K$ and is a block upper triangular matrix whose diagonal blocks are $h^{\prime }(A^q)$. These blocks are invertible by Bézout's identity for polynomials, since $h(A^q)=f(A)=0$. Thus $H$ is invertible, andThe same characteristic polynomial and divisibility argument now prove the corrected arbitrary-field answer:This is the minimal polynomial of a companion block chain; $q=1$ recovers the intended separable case.

Krasner's lemma states: let $K$ be complete for a Non-Archimedean absolute value, let $\alpha$ be a separable algebraic element over $K$, and let $\beta$ be algebraic over $K$, all in a fixed algebraic closure with the extended field absolute value. Ifthen $K(\alpha )\subseteq K(\beta )$. If $\alpha \in K$, the conclusion is automatic and there is no conjugate-distance condition to check.

To prove it, put $F=K(\beta )$ and take a finite splitting field $N/F$ for the minimal polynomial of $\alpha$ over $F$. That is a separable polynomial, so $N/F$ is Galois. The finite extension $F$ is complete, and uniqueness of extensions of an field absolute value from a complete non-Archimedean field makes every $\sigma \in \mathrm{Gal}(N/F)$ an isometry. It fixes $\beta$, soIf $\sigma (\alpha )\ne \alpha$, it is another $K$-conjugate and this inequality contradicts the strict hypothesis. Every such automorphism therefore fixes $\alpha$. The Fundamental theorem of Galois theory gives $\alpha \in F$, provingOnly $\alpha$ needs to be a separable algebraic element: the proof works even when $\beta$ is inseparable, because the splitting field is taken over $K(\beta )$.

Let $L$ be the splitting field of the separable polynomial. Its Galois group is $G={\mathrm{Aut}}_K(L)$, acting faithfully on its $n$ distinct roots, hence as a subgroup of $S_n$. An automorphism preserves each root's minimal polynomial. Conversely an isomorphism $K(\alpha )\to K(\beta )$ for roots of the same irreducible factor extends to an embedding of $L$ in an algebraic closure, and normality of the splitting field makes the image $L$ itself. Thus the root orbits are precisely the irreducible factors' root sets. The action is transitive exactly when the polynomial is irreducible.

If $n=p$ is prime, a transitive action has $p\mid |G|$ by orbit-stabilizer, so Cauchy theorem for groups supplies an element of order $p$. Its permutation must be a $p$-cycle. Conversely a $p$-cycle already acts transitively on all $p$ roots. This proves the stated equivalence for prime degree.

The factorization theorem modulo a good prime says that if an integer polynomial retains its degree and has square-free reduction modulo $p$, and that reduction's irreducible factor degrees are $d_1,\dots ,d_r$, its Galois group over $\mathbb{Q}$ contains a permutation with disjoint cycle lengths $d_1,\dots ,d_r$. Equivalently the finite-field Galois group, generated by Frobenius on the roots, occurs as an unramified decomposition subgroup. The degree-retention qualification matters for nonmonic polynomials.

For the given quintic, Eisenstein criterion at three proves irreducibility. Modulo two it factors asNeither factor has a root in ${\mathbb{F}}_2$, so both are irreducible, and they are distinct; the reduction is separable. Thus $G$ contains an element of cycle type $(2)(3)$, whose cube is a transposition. It is also transitive of degree five.

To prove that this forces the full symmetric group here, form the graph on the five roots with an edge for each conjugate in $G$ of that transposition. The graph is $G$-invariant, and transitivity makes its connected components all the same size. That size divides five; there is an edge, so the size cannot be one. Hence the graph is connected. Transpositions along the edges of a connected graph generate all transpositions (move along a path and conjugate successive swaps), and hence generate $S_5$. They all belong to $G$, giving

Put $\alpha =\sqrt[p]{p}$ and $\lambda ={\zeta }_p-1$. The polynomial $T^p-p$ is Eisenstein, so $[{\mathbb{Q}}_p(\alpha ):{\mathbb{Q}}_p]=p$, while the preceding part gives degree $p-1$ for $E$. Both numbers divide $[K:{\mathbb{Q}}_p]$ by the tower law, and the compositum degree is at most their product. Coprimality forces $[K:{\mathbb{Q}}_p]=p(p-1)$. Since $K$ contains all the roots ${\zeta }_p^a\alpha$ of $T^p-p$, it is the splitting field of a separable polynomial and is Galois.

Extend $v_p$ with $v_p(p)=1$. Then $v_p(\alpha )=1/p$, $v_p(\lambda )=1/(p-1)$, andThe value group therefore forces the ramification index to be at least $p(p-1)$; it cannot exceed the extension degree. Thus $K/{\mathbb{Q}}_p$ is totally ramified and $\varpi$ is a uniformizer for the normalized valuation $v_K=p(p-1)v_p$.

Write its automorphisms as ${\sigma }_{a,b}(\alpha )={\zeta }_p^a\alpha$ and ${\sigma }_{a,b}({\zeta }_p)={\zeta }_p^b$, with $a\in {\mathbb{F}}_p$, $b\in {\mathbb{F}}_p^{\times }$. The degree count makes all $p(p-1)$ pairs occur, giving $G\cong {\mathbb{F}}_p⋊{\mathbb{F}}_p^{\times }$. Their action on the uniformizer isIf $b\ne 1$, the residue of this ratio is $b$, so subtracting one gives a unit and $v_K({\sigma }_{a,b}(\varpi )-\varpi )=1$. If $b=1$ and $a\ne 0$, the ratio is ${\zeta }_p^{-a}$, giving displacement valuation $1+v_K({\zeta }_p^{-a}-1)=p+1$. The identity has infinite displacement valuation.

By the uniformizer criterion for lower ramification groups, $\sigma \in G_i$ precisely when that displacement valuation is at least $i+1$. Hence the ramification groups of the splitting field of Xp minus p over the p-adic numbers have sizesFor $1\le i\le p$ the group itself is $\{{\sigma }_{a,1}:a\in {\mathbb{F}}_p\}\cong C_p$. The lower wild ramification break is $p$.

The first alternative in the supplied analytic-group theorem would give a faithful representation of $\mathcal{N}$ in some ${\mathrm{GL}}_d({\mathbb{Z}}_p)$ or ${\mathrm{GL}}_d({\mathbb{F}}_p[[t]])$. The embedding proved above supplies cyclic subgroups of order $p^a$ for arbitrarily large $a$. Such orders are impossible in either fixed matrix dimension.

In characteristic zero, a matrix $A$ of order $p^a$ is diagonalizable over an algebraic closure, because its minimal polynomial divides the separable polynomial $X^{p^a}-1$. At least one eigenvalue must be a primitive $p^a$th root of unity; otherwise $A^{p^{a-1}}=I$. The cyclotomic polynomial ${\Phi }_{p^a}$ is irreducible over ${\mathbb{Q}}_p$, since ${\Phi }_{p^a}(1+X)$ satisfies the Eisenstein criterion at $p$. Consequently that eigenvalue has degree $\phi (p^a)=p^{a-1}(p-1)$ over ${\mathbb{Q}}_p$, which must be at most the matrix dimension $d$. This bounds $a$.

In characteristic $p$, pass from the power-series ring to its fraction field. A matrix of $p$-power order satisfies $X^{p^a}-1=(X-1{)}^{p^a}$, so it is unipotent. Writing $A=I+B$, nilpotence gives $B^d=0$. For $p^e\ge d$,Thus its order is at most $p^{\lceil {\log }_{p}d\rceil }$, again a fixed bound. Therefore the linear alternative is impossible in both coefficient rings.

Choose $\alpha$ with ${\alpha }^n=a$. The roots of $x^n-a$ are $\alpha {\zeta }_n^j$, so $F=K(\alpha )$ contains every root. Conversely their ratios generate the roots of unity, so $F$ is precisely the splitting field of $x^n-a$ over $\mathbb{Q}$. In characteristic zero this polynomial is separable polynomial, since $a\ne 0$, and a splitting field of a separable polynomial is a Galois extension.

Each automorphism over $K$ sends $\alpha$ to $\alpha {\zeta }_n^j$. The map $\sigma \mapsto \sigma (\alpha )/\alpha$ embeds $\mathrm{Gal}(F/K)$ into the cyclic group ${\mu }_n$: it is multiplicative because the automorphisms fix roots of unity, and injective because $\alpha$ generates $F/K$. Hence this group is cyclic, of order dividing $n$.

For a Galois intermediate field $K/\mathbb{Q}$, restriction of automorphisms gives an exact sequenceSurjectivity uses the extension theorem for embeddings into a normal splitting field. Both kernel and quotient are abelian, so the commutator subgroup of $\mathrm{Gal}(F/\mathbb{Q})$ lies in the abelian kernel. Its next commutator subgroup is trivial. 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.

A splitting field of a nonzero polynomial $f$ over $K$ is an extension in which $f$ splits into linear factors and which is generated over $K$ by all its roots. For a constant nonzero polynomial the splitting field is $K$; the zero polynomial does not have a root-generated splitting field in this standard definition.

Given two splitting fields $L,L^{\prime }$, enumerate the roots generating $L$ and extend a $K$-embedding one root at a time. If an embedding is defined on $K({\alpha }_1,\dots ,{\alpha }_j)$, the minimal polynomial of the next root divides $f$ over that field. Its image under the embedding therefore divides $f$ over the corresponding subfield of $L^{\prime }$, and has a root in $L^{\prime }$. The quotient construction $K(\alpha )\cong K[t]/(m_{\alpha })$ extends the embedding to that root. The polynomial need not be a separable polynomial.

At the end this gives a $K$-embedding $L\to L^{\prime }$. It sends the distinct roots of $f$ injectively to its roots, hence permutes the finite set of distinct roots and contains every root in its image. Since these generate $L^{\prime }$, the embedding is onto. Thus the splitting field is unique up to a (K)-isomorphism.

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

Because $K$ has characteristic $p$, the prime field ${\mathbb{F}}_p$ lies in $K$, andfor every $c\in {\mathbb{F}}_p$. These are all $p$ roots. Moreover $f^{\prime }(t)=-1$, so $f$ is a separable polynomial.

Let $m(t)$ be the minimal polynomial of an algebraic element of $\alpha$ over $K$. Translation by $c\in {\mathbb{F}}_p$ sends an irreducible factor $g(t)$ of $f(t)$ to the irreducible factor $g(t-c)$. The additive group of ${\mathbb{F}}_p$ therefore acts on the irreducible factors, and every orbit has size $1$ or $p$. An orbit of size $p$ would already contribute $p\mathrm{deg}m$ to the degree-$p$ polynomial $f$, forcing $\mathrm{deg}m=1$. Then $\alpha \in K$, all roots $\alpha +c$ lie in $K$, and $L=K$, contrary to the hypothesis.

Thus $m(t-c)=m(t)$ for every $c\in {\mathbb{F}}_p$. If $1\le d=\mathrm{deg}m<p$, comparison of the coefficient of $t^{d-1}$ in $m(t-c)-m(t)$ for $c\ne 0$ gives $-dc$ times the nonzero leading coefficient, a contradiction. Hence $\mathrm{deg}m=p$, and since $m$ is a monic divisor of the monic degree-$p$ polynomial $f$, we have $m=f$. Thus $f$ is irreducible over $K$.

All roots $\alpha +c$ already belong to $K(\alpha )$, so the splitting field isAs the splitting field of a separable polynomial, $L/K$ is a Galois extension. For each $c\in {\mathbb{F}}_p$, irreducibility gives a distinct $K$-automorphismThese exhaust the $p=[L:K]$ automorphisms. This is an Artin–Schreier extension, and

Let $L$ be a splitting field of $f(X)=X^m-1$ over $k$. Its formal derivative isThe assumption on the characteristic of $k$ says that $m\ne 0$ in $k$. Any root $\alpha$ of $f$ is nonzero, and hence $f^{\prime }(\alpha )=m{\alpha }^{m-1}\ne 0$. Thus $f$ and $f^{\prime }$ have no common root, so $f$ is a separable polynomial. Since it has degree $m$ and splits over $L$, it has exactly $m$ distinct roots. This is the separability of roots of unity.

Fix a primitive root of unity ${\zeta }_m=e^{2\pi i/m}$. Define the $m$th cyclotomic polynomial byIt is monic and has degree given by the Euler totient function $\phi (m)$. Partitioning all $m$th roots of unity according to their exact multiplicative order gives the cyclotomic factorizationWe now prove by mathematical induction that ${\Phi }_m\in \mathbb{Z}[X]$. The base case is ${\Phi }_1=X-1$. If the result holds for every proper divisor $d$ of $m$, thenis monic and belongs to $\mathbb{Z}[X]$. Polynomial division of $X^m-1$ by the monic integer polynomial $G$ produces a quotient and remainder in $\mathbb{Z}[X]$. The factorization over $\mathbb{C}$ says that the remainder is zero and the quotient is ${\Phi }_m$, proving the claim.

It remains to prove irreducibility of cyclotomic polynomials. Let $f\in \mathbb{Z}[X]$ be a monic irreducible polynomial dividing ${\Phi }_m$, let $\epsilon$ be a root of $f$, and write ${\Phi }_m=fg$. We claim that ${\epsilon }^p$ is a root of $f$ for every prime number $p\nmid m$. Otherwise ${\epsilon }^p$ is a root of $g$, so $\epsilon$ is a root of $g(X^p)$. Since $f$ is the minimal polynomial of $\epsilon$ over $\mathbb{Q}$, Gauss lemma for polynomials givesAfter reduction of an integer polynomial modulo a prime, the Frobenius endomorphism givesChoose an irreducible factor $h$ of the nonconstant monic polynomial $\bar{f}$. Then $h\mid \bar{g}$, so $h^2\mid \bar{f}\bar{g}={\bar{\Phi }}_m$. The cyclotomic factorization would then make $h^2$ divide $X^m-1$ over ${\mathbb{F}}_p$. This is impossible because its derivative $m{X}^{m-1}$ is coprime to it when $p\nmid m$.

Thus $f({\epsilon }^p)=0$ for every prime $p\nmid m$. Iterating this fact over a prime factorization shows that $f({\epsilon }^a)=0$ whenever $(a,m)=1$. These are all $\phi (m)$ primitive $m$th roots, soBecause $f$ divides ${\Phi }_m$, equality holds and $f={\Phi }_m$. Hence every cyclotomic polynomial is irreducible over $\mathbb{Q}$.

Finally, direct multiplication givesAlsoApplying the cyclotomic factorization to the two factors on the right givesand thereforeSince $X^2-X+1={\Phi }_6(X)$, cancellation yieldsThe thirtieth cyclotomic polynomial is irreducible over $\mathbb{Q}$ by the theorem just proved, so $F$ is irreducible.

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

If a monic polynomial $f$ has roots ${\alpha }_1,\dots ,{\alpha }_n$ in a splitting field, its polynomial discriminant isIt is a symmetric polynomial in the roots, so it belongs to the base field; it is nonzero exactly when $f$ is a separable polynomial.

Putthe Vandermonde determinant. A root permutation $\sigma$ sends $D$ to $\mathrm{sgn}(\sigma )D$. Hence the Galois group of a polynomial is contained in the alternating group $A_n$ exactly when every Galois automorphism fixes $D$, which by the fixed-field property is equivalent to $D\in K$. This implies that $\mathrm{disc}(f)=D^2$ is a square in $K$. Conversely, if $\mathrm{disc}(f)=d^2$ for $d\in K$, then $D^2=d^2$, so $D=\pm d\in K$. The Galois group therefore fixes $D$ and consists of even permutations. This proves the discriminant criterion for an alternating Galois group.

Now letThe rational root theorem shows that none of $\pm 1,\pm 2$ is a root, so this cubic is irreducible over $\mathbb{Q}$. The discriminant of a depressed cubic isThis is not a square in $\mathbb{Q}$, so the Galois group of an irreducible cubic is $S_3$ over $\mathbb{Q}$.

Over $K=\mathbb{Q}(\sqrt{-19})$, the discriminant is the squareThe cubic remains irreducible: a root in the degree-two extension $K/\mathbb{Q}$ would generate over $\mathbb{Q}$ both a degree-three field, by irreducibility, and a subfield of a degree-two field, contradicting the tower law for field extensions. Its Galois group over $K$ is consequently $A_3\cong C_3$.

In characteristic two, the formal derivative in positive characteristic ofisA polynomial is separable exactly when it and its derivative have no common root. If $r$ is a root of $f^{\prime }$, thenThus $f$ and $f^{\prime }$ have a common root exactly when $b=0$. Therefore $f$ is a separable polynomial if and only if $b\ne 0$.