math.wiki
Abstract algebra › Galois theory › Field automorphisms and the Galois group
Sign in

Field automorphisms and the Galois group

A polynomial’s roots can be relabeled in many ways. Which relabelings respect every equation the roots satisfy over the base field, and what structure do those symmetries form?

Where you are 4 in Galois theory

Why this exists

Splitting fields counted the isomorphisms E \to E fixing F for a splitting field E of f over F: at most [E : F], and exactly that many when the roots of f are distinct. These maps compose and invert, so they form a group, and the group records which roots no equation over F can tell apart. Questions about the fields between F and E, and in the end about solving equations by radicals, become questions about subgroups. Whether the group is as large as the degree turns on separability.

Definition

In plain words: an automorphism of a field relabels its elements keeping sums and products; the Galois group of E over F collects the automorphisms of E that leave every element of F alone.

  • An automorphism of a field E is a ring isomorphism \sigma : E \to E. They form the set \operatorname{Aut}(E).
  • For an extension E/F, the Galois group \operatorname{Gal}(E/F) is the set of \sigma \in \operatorname{Aut}(E) with \sigma(a) = a for every a \in F. If E is a splitting field of a nonconstant f \in F[x], it is also called the Galois group of f over F. Up to isomorphism it does not depend on the choice: two splitting fields are related by an isomorphism \psi fixing F (Corollary 5 of Splitting fields), and \sigma \mapsto \psi\sigma\psi^{-1} matches their groups.
  • The formal derivative of f = \sum_{k=0}^n a_kx^k \in F[x] is f' = \sum_{k=1}^n ka_kx^{k-1}, where ka_k is a_k added k times. It is additive and obeys (gh)' = g'h + gh' (check on monomials).
  • A polynomial of degree n \ge 1 is separable if it has n distinct roots in a splitting field (any splitting field gives the same answer, by Corollary 5 of Splitting fields). An algebraic \alpha is separable over F if m_\alpha is, and E/F is separable if every element of E is algebraic and separable over F.

The identity lies in every \operatorname{Gal}(E/F); complex conjugation lies in \operatorname{Gal}(\mathbb{C}/\mathbb{R}) (Example 1).

Intuition

An automorphism fixing F cannot tell \alpha from \sigma(\alpha): any equation over F that \alpha satisfies, \sigma(\alpha) satisfies too. So \sigma moves each root of a polynomial over F to another root of it, and as the roots generate a splitting field, the permutation of the roots determines \sigma. Not every permutation occurs. In Example 3 one root is \beta = \alpha^2 - 2\alpha - 2, so \sigma(\alpha) determines \sigma(\beta), and only 3 of the 6 permutations survive: the group keeps every relation among the roots.

x y
\alpha
\sigma(\alpha)
\sigma^2(\alpha)
Figure 1Example 3: the roots of x^3 - x^2 - 4x - 1. The automorphism \sigma with \sigma(\alpha) = \alpha^2 - 2\alpha - 2 moves each root to the next one to the left, and the smallest back to \alpha.

Results

Throughout, F \subseteq E are fields. The prime subfield of E is the set of quotients (m \cdot 1)(n \cdot 1)^{-1} with m, n \in \mathbb{Z} and n \cdot 1 \ne 0: a copy of \mathbb{Q} or of \mathbb{Z}_p.

Theorem 1 (the groups). (a) \operatorname{Aut}(E) is a group under composition. (b) \operatorname{Gal}(E/F) is a subgroup of it. (c) Every automorphism of E fixes the prime subfield P elementwise, so \operatorname{Aut}(E) = \operatorname{Gal}(E/P). (d) If E/F is finite, every ring homomorphism \sigma : E \to E fixing F elementwise is onto, so it lies in \operatorname{Gal}(E/F).

Theorem 2 (permuting roots). Let f \in F[x] be nonconstant and \sigma \in \operatorname{Gal}(E/F). (a) If \alpha \in E is a root of f, so is \sigma(\alpha). An algebraic \alpha and \sigma(\alpha) have the same minimal polynomial over F. (b) If E is a splitting field of f over F and R is the set of its r distinct roots, then \sigma \mapsto \sigma|_R is an injective homomorphism \operatorname{Gal}(E/F) \to \operatorname{Sym}(R). So \operatorname{Gal}(E/F) is isomorphic to a subgroup of S_r, and its order divides r!.

Lemma 3 (counting extensions). Let E/F be finite, L a field and \theta : F \to L a ring homomorphism. At most [E : F] ring homomorphisms E \to L agree with \theta on F.

Theorem 4 (the bound). If E/F is finite, then |\operatorname{Gal}(E/F)| \le [E : F].

Lemma 5 (repeated roots). A polynomial f \in F[x] of degree n \ge 1 has a repeated root in a splitting field if and only if \gcd(f, f') \ne 1 in F[x].

Theorem 6 (separability). If \operatorname{char} F = 0 or F is finite, every irreducible polynomial in F[x] is separable, so every algebraic extension of F is separable.

Corollary 7 (the count). Let \operatorname{char} F = 0 or F be finite, and let E be a splitting field over F of a nonconstant f \in F[x]. Then |\operatorname{Gal}(E/F)| = [E : F].

Theorem 8 (primitive element theorem). If \operatorname{char} F = 0 or F is finite, every finite extension E/F has a primitive element: some \gamma \in E with E = F(\gamma).

Later lessons keep to such fields unless separability itself is the point.

Why it is true

“SF” refers to Splitting fields, “AE” to Algebraic elements and minimal polynomials and “FE” to Field extensions and degree.

Proof of Theorem 1. (a) Composition is associative with identity \mathrm{id}_E, and composites and inverses of bijective ring homomorphisms are again such: applying \sigma to \sigma^{-1}(a) + \sigma^{-1}(b) gives a + b, so \sigma^{-1} preserves sums, and likewise products. (b) If \sigma, \tau fix a \in F, so do \sigma\tau and \sigma^{-1}, as \sigma^{-1}(a) = \sigma^{-1}(\sigma(a)) = a. (c) \sigma(1) = 1 and additivity give \sigma(m \cdot 1) = m \cdot 1 for every integer m; products and inverses do the rest. (d) If \sigma(a) = 0 with a \ne 0, then 1 = \sigma(aa^{-1}) = 0; so \sigma is injective. It is F-linear, and an injective linear map carries a basis of E over F to [E : F] independent vectors, a basis (FE), so \sigma is onto. \square

Proof of Theorem 2. (a) With f = \sum a_kx^k, \sigma preserves sums and products and fixes each a_k, so f(\sigma(\alpha)) = \sigma(f(\alpha)) = 0. For f = m_\alpha, \sigma(\alpha) is a root of the monic irreducible m_\alpha, which is therefore m_{\sigma(\alpha)} (AE Theorem 1(d)). (b) By (a), the injective map \sigma sends the finite set R into itself, so \sigma|_R \in \operatorname{Sym}(R), and (\sigma\tau)|_R = \sigma|_R \circ \tau|_R. If \sigma|_R = \mathrm{id}_R, then \sigma fixes F and the generators of E = F(R), so \sigma = \mathrm{id}_E (SF Exercise 13). An injective homomorphism is an isomorphism onto a subgroup (Isomorphisms); numbering R identifies \operatorname{Sym}(R) with S_r (Permutation groups and cycle notation), and Lagrange's theorem gives the divisibility. \square

Proof of Lemma 3. By induction on [E : F], for all F, L and \theta at once. If [E : F] = 1, only \theta qualifies. Otherwise pick \alpha \in E \setminus F, with p = m_{\alpha, F} of degree d = [F(\alpha) : F] \ge 2. An extension \psi of \theta sends \alpha to a root of p^\theta (SF’s notation: \theta applied to each coefficient), as p^\theta(\psi(\alpha)) = \psi(p(\alpha)) = 0, and p^\theta has at most d roots in L (The remainder and factor theorems). As F(\alpha) = F[\alpha] (AE Theorem 1(e)) and \psi(g(\alpha)) = g^\theta(\psi(\alpha)) for g \in F[x], the value \psi(\alpha) determines \psi on F(\alpha): at most d restrictions \tau occur. Since [E : F(\alpha)] = [E : F]/d < [E : F] (tower law, FE Theorem 6), induction lets each \tau extend to E in at most [E : F]/d ways: at most [E : F] in all. \square

Proof of Theorem 4. Each \sigma \in \operatorname{Gal}(E/F) is a ring homomorphism E \to E agreeing on F with the inclusion F \to E. Apply Lemma 3 with L = E. \square

Proof of Lemma 5. Let E be a splitting field. If f = (x - \alpha)^2g in E[x], then f' = 2(x - \alpha)g + (x - \alpha)^2g' vanishes at \alpha. Conversely, if f = (x - \alpha)g and f'(\alpha) = 0, then f' = g + (x - \alpha)g' gives g(\alpha) = 0, so (x - \alpha)^2 \mid f. So f has a repeated root exactly when f and f' share a root in E. Their monic greatest common divisor d comes from the Euclidean algorithm (Euclidean domains and principal ideal domains), whose steps are the same in F[x] and in E[x]. A shared root \alpha gives (x - \alpha) \mid d. A nonconstant d divides f, so by unique factorization in E[x] (Unique factorization domains) it is a product of factors x - \alpha_i, and it has a root shared by f and f'. \square

Proof of Theorem 6. Let g = \sum_{k=0}^n a_kx^k be irreducible, n \ge 1, a_n \ne 0, and not separable. By Lemma 5, \gcd(g, g') is nonconstant and divides the irreducible g, so g \mid g'; as \deg g' < \deg g, g' = 0. Its coefficient of x^{n-1} is (n \cdot 1)a_n, nonzero in characteristic 0: a contradiction. If F is finite, its characteristic is a prime p (Rings and integral domains), and g' = 0 says (k \cdot 1)a_k = 0 for all k, so a_k = 0 unless p \mid k, and g = \sum_j b_jx^{jp}. The map a \mapsto a^p preserves products, and sums too, as p \mid \binom{p}{i} for 0 < i < p; it is injective, so on the finite set F it is onto. Choosing c_j with c_j^p = b_j, the same binomial fact in F[x] gives g = \big(\sum_j c_jx^j\big)^p, the p-th power of a nonconstant polynomial, so g is reducible: a contradiction. The second sentence holds because minimal polynomials are irreducible (AE Theorem 1). \square

Proof of Corollary 7. Let h = p_1\cdots p_k, the product of the distinct monic irreducible factors of f in F[x]. By unique factorization in E[x] each p_i splits over E, as f does, and h has the same roots as f; so E is a splitting field of h. Each p_i has distinct roots (Theorem 6), and p_i \ne p_j share none, as a common root \alpha would make both equal to m_\alpha (AE Theorem 1(d)). So h has distinct roots, and SF Corollary 5 gives exactly [E : F] isomorphisms E \to E fixing F: the elements of \operatorname{Gal}(E/F). \square

Proof of Theorem 8. If F is finite, so is E, and E^\times is cyclic (Finite fields); a generator \gamma gives E = F(\gamma). Otherwise F is infinite (characteristic 0 puts a copy of \mathbb{Q} inside). As E = F(\gamma_1, \dots, \gamma_k) with each \gamma_j algebraic (AE Corollary 6), induction on k reduces the claim to showing F(\alpha, \beta) = F(\gamma) for some \gamma.

In a splitting field L of m_\alpha m_\beta over F(\alpha, \beta), m_\alpha has distinct roots \alpha = \alpha_1, \dots, \alpha_r and m_\beta distinct roots \beta = \beta_1, \dots, \beta_s (Theorem 6). For j \ge 2, \beta_j \ne \beta, so at most one c makes \alpha + c\beta = \alpha_i + c\beta_j. Choose c \in F, c \ne 0, avoiding these finitely many values, and put \gamma = \alpha + c\beta and K = F(\gamma). The polynomial h(x) = m_\alpha(\gamma - cx) \in K[x] has degree r, vanishes at \beta since h(\beta) = m_\alpha(\alpha), and vanishes at no \beta_j with j \ge 2, since \gamma - c\beta_j is no \alpha_i. So the monic greatest common divisor of h and m_\beta = \prod_j (x - \beta_j) in L[x] is x - \beta. The Euclidean algorithm computes it inside K[x], so \beta \in K; then \alpha = \gamma - c\beta \in K, and F(\alpha, \beta) = F(\gamma). \square

Worked examples

Example 1

Complex conjugation

Prove that \operatorname{Gal}(\mathbb{C}/\mathbb{R}) = \{\mathrm{id}_{\mathbb{C}}, \tau\}, where \tau(z) = \bar z.

Solution

Proof. Conjugation is its own inverse, hence a bijection; \overline{z + w} = \bar z + \bar w and \overline{zw} = \bar z\,\bar w (Complex roots come in pairs), and \bar a = a for real a. So \tau \in \operatorname{Gal}(\mathbb{C}/\mathbb{R}). Conversely, for \sigma in the group, \sigma(i) is a root of x^2 + 1 by Theorem 2(a), so \sigma(i) = \pm i, and \sigma(a + bi) = a + b\sigma(i) for real a, b. The sign + gives \mathrm{id}_{\mathbb{C}} and - gives \tau. \square

Its order 2 = [\mathbb{C} : \mathbb{R}] is as Corollary 7 predicts.

Example 2

Fewer automorphisms than the degree

Find \operatorname{Gal}(E/\mathbb{Q}) for \displaystyle E = \mathbb{Q}(\sqrt[4]{7}).

Solution

Let \displaystyle a = \sqrt[4]{7}. As x^4 - 7 is Eisenstein at 7 (Irreducible polynomials and Eisenstein's criterion), it is m_a, and [E : \mathbb{Q}] = 4 with basis 1, a, a^2, a^3. Each \sigma in the group sends a to a root of x^4 - 7 in E \subseteq \mathbb{R} (Theorem 2(a)); a real root has \displaystyle x^2 = \sqrt{7}, so \sigma(a) = \pm a, and \sigma(a) determines \sigma on every c_0 + c_1a + c_2a^2 + c_3a^3. Both signs occur: -a is a root of m_a with \mathbb{Q}(-a) = E, so SF Lemma 3 gives \sigma fixing \mathbb{Q} with \sigma(a) = -a. So the group is \{\mathrm{id}_E, \sigma\} \cong \mathbb{Z}_2, of order 2 < 4 = [E : \mathbb{Q}]: Theorem 4 is strict because E, missing the roots \pm ai, is not a splitting field. The elements \sigma fixes are those with c_1 = c_3 = 0, the field \displaystyle \mathbb{Q}(a^2) = \mathbb{Q}(\sqrt{7}), larger than \mathbb{Q}.

Example 3

A cubic whose roots are expressions in one root

Let f = x^3 - x^2 - 4x - 1 and \alpha a root. Show that \mathbb{Q}(\alpha) is a splitting field of f, that \operatorname{Gal}(\mathbb{Q}(\alpha)/\mathbb{Q}) \cong \mathbb{Z}_3, and find how it permutes the roots.

Solution

By the The rational root theorem the only candidate rational roots are \pm 1, and f(1) = -5, f(-1) = 1. A cubic with no rational root is irreducible, so [\mathbb{Q}(\alpha) : \mathbb{Q}] = 3, and u = 1 + \alpha \ne 0. Expanding f(u - 1) gives u^3 - 4u^2 + u + 1 = 0, and for \beta = -1/u,

\begin{aligned} u^3 f(\beta) &= -1 - u + 4u^2 - u^3 \\ &= -(u^3 - 4u^2 + u + 1) = 0. \end{aligned}

From u(u^2 - 4u + 1) = -1 we get \beta = u^2 - 4u + 1 = \alpha^2 - 2\alpha - 2 in \mathbb{Q}(\alpha), and \beta \ne \alpha, as otherwise \alpha^2 + \alpha + 1 = 0 and \alpha would have degree 2. The roots sum to 1, so the third is \gamma = 1 - \alpha - \beta = -\alpha^2 + \alpha + 3 in \mathbb{Q}(\alpha). Hence \mathbb{Q}(\alpha) is a splitting field, and by Corollary 7 its Galois group has order 3, so it is cyclic (Lagrange's theorem). As \beta is a root of m_\alpha = f, SF Lemma 3 gives a homomorphism \mathbb{Q}(\alpha) \to \mathbb{Q}(\beta) \subseteq \mathbb{Q}(\alpha) fixing \mathbb{Q} with \alpha \mapsto \beta, an element \sigma of the group by Theorem 1(d). It is not the identity, so it generates, and an element of order 3 permuting three roots is the 3-cycle (\alpha\ \beta\ \gamma). Numerically \alpha \approx 2.651, \beta \approx -0.274, \gamma \approx -1.377.

Example 4

A cubic with two non-real roots

Find the Galois group of f = x^3 + 4x + 2 over \mathbb{Q}.

Solution

f is Eisenstein at 2, and f' = 3x^2 + 4 > 0, so f is strictly increasing on \mathbb{R} with one real root r; the others are z and \bar z with z \notin \mathbb{R} (Complex roots come in pairs). Let E = \mathbb{Q}(r, z, \bar z) and G = \operatorname{Gal}(E/\mathbb{Q}). By Corollary 7 and the tower law, |G| = [E : \mathbb{Q}] is a multiple of [\mathbb{Q}(r) : \mathbb{Q}] = 3. Complex conjugation permutes the roots, so it maps E, whose elements are polynomial expressions in them, into E; there it is a ring homomorphism fixing \mathbb{Q}, so it lies in G (Theorem 1(d)), and it swaps z and \bar z, so it has order 2. Thus 6 divides |G|, and Theorem 2(b) puts G inside S_3: G \cong S_3 and [E : \mathbb{Q}] = 6.

Re Im
r
z
\bar z
Figure 2Example 4: complex conjugation fixes the real root r of x^3 + 4x + 2 and swaps z with \bar z, a transposition in the Galois group.
Example 5

Squaring over \mathbb{Z}_2

Writing k for [k], let f = x^5 + x^3 + 1 \in \mathbb{Z}_2[x] and K = \mathbb{Z}_2[x]/\langle f \rangle with root \alpha = x + \langle f \rangle. Show that K is a splitting field of f and that \operatorname{Gal}(K/\mathbb{Z}_2) is cyclic of order 5, generated by \sigma(a) = a^2.

Solution

f(0) = f(1) = 1, so f has no linear factor. A reducible quintic would have a factor of degree 1 or 2, and the only irreducible quadratic over \mathbb{Z}_2 is x^2 + x + 1; modulo it x^3 \equiv 1, so f \equiv x^2 + 1 + 1 = x^2, which x^2 + x + 1 does not divide. So f is irreducible and K is a field of degree 5 (FE Theorem 3). In characteristic 2, (a + b)^2 = a^2 + b^2 as 2ab = 0, so \sigma is a ring homomorphism; it fixes 0 and 1, so \sigma \in \operatorname{Gal}(K/\mathbb{Z}_2) by Theorem 1(d), and \alpha, \alpha^2, \alpha^4, \alpha^8, \alpha^{16} are roots of f by Theorem 2(a). From f(\alpha) = 0, \alpha^5 = \alpha^3 + 1, so \alpha^6 = \alpha^4 + \alpha,

\alpha^8 = \alpha^3\alpha^5 = \alpha^6 + \alpha^3 = \alpha^4 + \alpha^3 + \alpha,
\alpha^{16} = (\alpha^8)^2 = \alpha^8 + \alpha^6 + \alpha^2 = \alpha^3 + \alpha^2.

In the basis 1, \alpha, \dots, \alpha^4 these five roots are distinct, so f splits over K = \mathbb{Z}_2(\alpha), a splitting field, and Corollary 7 gives a group of order 5. As 5 is prime and \sigma(\alpha) = \alpha^2 \ne \alpha, \sigma generates (Lagrange's theorem): the group is \mathbb{Z}_5, acting on the roots as the 5-cycle (\alpha\ \alpha^2\ \alpha^4\ \alpha^8\ \alpha^{16}).

Boundaries

  • Not a splitting field. Theorem 4 is only a bound: Example 2 has a group of order 2 and degree 4.
  • Inseparable polynomials. Corollary 7 needs separability. Over \mathbb{Z}_3(t), the polynomial x^3 - t is irreducible with one repeated root, and its splitting field has degree 3 but a trivial group (Exercise 13).
  • Infinite extensions. \mathbb{R} has only the identity automorphism (Exercise 9), though [\mathbb{R} : \mathbb{Q}] is infinite.
  • Not every permutation. Theorem 2(b) often gives a proper subgroup of S_r: Example 3 gets only the even permutations.

Where this goes next

Example 2’s automorphism fixed exactly \displaystyle \mathbb{Q}(\sqrt{7}), a field between \mathbb{Q} and E. The The fundamental theorem of Galois theory makes this a correspondence: for a splitting field E over F of a separable polynomial, subgroups of \operatorname{Gal}(E/F) match the fields between F and E, with the order reversed. Theorem 2(b) puts the group of a quintic inside S_5; a transposition from complex conjugation, as in Example 4, together with a 5-cycle (Exercise 11) gives all of S_5, which is not solvable (Solvable groups); Why the quintic has no formula draws the conclusion for formulas in radicals.

Exercises

Galois groups over \mathbb{Q}

  1. Find \displaystyle \operatorname{Gal}(\mathbb{Q}(\sqrt[3]{17})/\mathbb{Q}).
  2. Let \displaystyle E = \mathbb{Q}(\sqrt{2}, \sqrt{11}). Show that [E : \mathbb{Q}] = 4 and write each element of \operatorname{Gal}(E/\mathbb{Q}) as a permutation of the roots of (x^2 - 2)(x^2 - 11), numbered \displaystyle 1 = \sqrt{2}, \displaystyle 2 = -\sqrt{2}, \displaystyle 3 = \sqrt{11}, \displaystyle 4 = -\sqrt{11}. Which elements form \displaystyle \operatorname{Gal}(E/\mathbb{Q}(\sqrt{22}))?
  3. Show that the Galois group of x^3 - 2x + 2 over \mathbb{Q} is S_3.
  4. Let \alpha be a root of f = x^3 - 2x^2 - 5x - 1. Show that -1/(1 + \alpha) is a root, write it as a polynomial in \alpha, and conclude that \operatorname{Gal}(\mathbb{Q}(\alpha)/\mathbb{Q}) \cong \mathbb{Z}_3.

Over a finite field

  1. Writing k for [k], let \alpha be a root of x^3 + x^2 + 2 in K = \mathbb{Z}_5[x]/\langle x^3 + x^2 + 2 \rangle. Show the polynomial is irreducible over \mathbb{Z}_5, write \alpha^5 and \alpha^{25} in the basis 1, \alpha, \alpha^2, and find \operatorname{Gal}(K/\mathbb{Z}_5).

Separability and primitive elements

  1. Decide with \gcd(f, f') which of these has a repeated root in a splitting field: (a) x^3 - 7x^2 + 16x - 12 over \mathbb{Q}; (b) x^3 - 4x + 1 over \mathbb{Q}; (c) x^3 + 2 over \mathbb{Z}_3.
  2. Show that \displaystyle \mathbb{Q}(\sqrt{2}, \sqrt{11}) = \mathbb{Q}(\sqrt{2} + \sqrt{11}) and find the minimal polynomial of \displaystyle \sqrt{2} + \sqrt{11}.

Proofs

  1. Sofia notes that \displaystyle \mathbb{Q}(\sqrt{2}) and \displaystyle \mathbb{Q}(\sqrt{3}) both have degree 2 over \mathbb{Q}; Diego asks whether they are isomorphic as fields. Prove that they are not.
  2. Prove that the only automorphism of \mathbb{R} is the identity. (Show first that an automorphism sends nonnegative numbers to nonnegative numbers.)
  3. Let \operatorname{char} F = 0 or F be finite, f \in F[x] irreducible of degree n, and E a splitting field of f. Prove that for any roots \alpha, \beta of f in E some \sigma \in \operatorname{Gal}(E/F) has \sigma(\alpha) = \beta, and that n divides |\operatorname{Gal}(E/F)|.
  4. In Exercise 10, let n = p be prime. Prove that \operatorname{Gal}(E/F) contains an element acting on the p roots as a p-cycle.
  5. In Exercise 10, suppose \operatorname{Gal}(E/F) is abelian. Prove that E = F(\alpha) for every root \alpha, so [E : F] = n.
  6. Let F = \mathbb{Z}_3(t), the rational functions over \mathbb{Z}_3, and E = F(s) a splitting field of x^3 - t with s^3 = t. Prove that x^3 - t is irreducible over F and equals (x - s)^3 in E[x], and that \operatorname{Gal}(E/F) is trivial although [E : F] = 3.
Answers
  1. The trivial group. x^3 - 17 is Eisenstein at 17, so the degree is 3, but an automorphism sends \displaystyle \sqrt[3]{17} to a root of x^3 - 17 in \displaystyle \mathbb{Q}(\sqrt[3]{17}) \subseteq \mathbb{R}, and as x \mapsto x^3 is strictly increasing on \mathbb{R}, \displaystyle \sqrt[3]{17} is the only one. An automorphism fixing the generator is the identity.
  2. If \displaystyle \sqrt{11} = a + b\sqrt{2} with a, b \in \mathbb{Q}, then \displaystyle 11 = a^2 + 2b^2 + 2ab\sqrt{2} forces ab = 0; b = 0 makes \displaystyle \sqrt{11} rational and a = 0 makes \displaystyle 2b = \pm\sqrt{22} rational. So [E : \mathbb{Q}] = 2 \cdot 2 = 4, and by Corollary 7 the group has 4 elements; as each sends \displaystyle \sqrt{2} \mapsto \pm\sqrt{2} and \displaystyle \sqrt{11} \mapsto \pm\sqrt{11}, every sign choice occurs: e, (1\ 2), (3\ 4), (1\ 2)(3\ 4), a copy of \mathbb{Z}_2 \times \mathbb{Z}_2. As \displaystyle \sqrt{22} = \sqrt{2}\sqrt{11}, the elements fixing \displaystyle \sqrt{22} change both signs or neither: \{e, (1\ 2)(3\ 4)\}.
  3. It is Eisenstein at 2. Its derivative 3x^2 - 2 vanishes at \displaystyle \pm\sqrt{2/3}, and the local minimum value \displaystyle f(\sqrt{2/3}) = 2 - \frac{4}{3}\sqrt{2/3} is positive, so f > 0 on \displaystyle [-\sqrt{2/3}, \infty), while f increases on \displaystyle (-\infty, -\sqrt{2/3}]: exactly one real root. As in Example 4, 3 divides the order, conjugation gives an element of order 2, and the group, inside S_3, is S_3.
  4. f(\pm 1) = -7, 1, so f is irreducible and u = 1 + \alpha \ne 0. Expanding, f(u - 1) = u^3 - 5u^2 + 2u + 1, and u^3f(-1/u) = -1 - 2u + 5u^2 - u^3 = 0. From u(u^2 - 5u + 2) = -1, -1/u = u^2 - 5u + 2 = \alpha^2 - 3\alpha - 2. It is not \alpha (else \alpha^2 + \alpha + 1 = 0), and as the roots sum to 2 the third root is -\alpha^2 + 2\alpha + 4. So \mathbb{Q}(\alpha) is a splitting field of degree 3, and its group has order 3: \mathbb{Z}_3.
  5. At 0, 1, 2, 3, 4 the cubic takes 2, 4, 4, 3, 2, so it has no root and is irreducible: [K : \mathbb{Z}_5] = 3. Using \alpha^3 = 4\alpha^2 + 3: \alpha^5 = 2\alpha^2 + 2\alpha + 3 and \alpha^{25} = 3\alpha^2 + 2\alpha + 1. The map a \mapsto a^5 is an automorphism (as in Example 5), so these are roots, distinct from \alpha and from each other, and K is a splitting field. The group has order 3: it is \mathbb{Z}_3, generated by a \mapsto a^5.
  6. (a) f' = 3x^2 - 14x + 16 = (3x - 8)(x - 2) with f(2) = 0 and f(8/3) \ne 0, so \gcd(f, f') = x - 2: a repeated root, and f = (x - 2)^2(x - 3). (b) f' = 3x^2 - 4 and \displaystyle f = \frac{x}{3}f' - \frac{8}{3}x + 1; at \displaystyle x = \frac{3}{8}, f' is \displaystyle -\frac{229}{64} \ne 0, so \gcd(f, f') = 1: no repeated root. (c) f' = 3x^2 = 0, so \gcd(f, f') = f: a repeated root; indeed x^3 + 2 = (x - 1)^3 in \mathbb{Z}_3[x].
  7. By Exercise 2 the four group elements send \displaystyle \sqrt{2} + \sqrt{11} to the distinct numbers \displaystyle \pm\sqrt{2} \pm \sqrt{11}, all roots of its minimal polynomial, so its degree is 4 = [E : \mathbb{Q}] and it generates E. The minimal polynomial is the product of the four factors \displaystyle x - (\pm\sqrt{2} \pm \sqrt{11}); pairing the two with \displaystyle +\sqrt{2} gives \displaystyle (x - \sqrt{2})^2 - 11, and the product is (x^2 - 9)^2 - 8x^2, that is, x^4 - 26x^2 + 81.
  8. Proof. An isomorphism \displaystyle \psi : \mathbb{Q}(\sqrt{2}) \to \mathbb{Q}(\sqrt{3}) sends 1 to 1, so it fixes \mathbb{Q}, as in Theorem 1(c). Then \displaystyle \psi(\sqrt{2}) is a square root of 2 in \displaystyle \mathbb{Q}(\sqrt{3}), say \displaystyle a + b\sqrt{3}, and \displaystyle 2 = a^2 + 3b^2 + 2ab\sqrt{3} forces ab = 0. But b = 0 gives a^2 = 2 and a = 0 gives (3b)^2 = 6, neither possible in \mathbb{Q}. \square
  9. Proof. Let \sigma \in \operatorname{Aut}(\mathbb{R}). If x \ge 0, then x = y^2 and \sigma(x) = \sigma(y)^2 \ge 0; so a \le b implies \sigma(a) \le \sigma(b). By Theorem 1(c), \sigma fixes \mathbb{Q}. If \sigma(x) < x, pick q \in \mathbb{Q} with \sigma(x) < q < x; then q \le x gives q = \sigma(q) \le \sigma(x), a contradiction. The case \sigma(x) > x is the same, so \sigma = \mathrm{id}. \square
  10. Proof. SF Lemma 3 gives an isomorphism F(\alpha) \to F(\beta) fixing F with \alpha \mapsto \beta. By SF Lemma 2(c), E is a splitting field of f over both F(\alpha) and F(\beta), so SF Theorem 4(a) extends it to an isomorphism \sigma : E \to E, which fixes F. By the tower law n = [F(\alpha) : F] divides [E : F], which is |\operatorname{Gal}(E/F)| by Corollary 7. \square
  11. Proof. By Exercise 10, p divides |\operatorname{Gal}(E/F)|, so a Sylow p-subgroup is nontrivial (The Sylow theorems), and a suitable power of one of its nonidentity elements has order p. The p roots are distinct (Theorem 6), and by Theorem 2(b) this element permutes them with order p. The order of a permutation is the least common multiple of its cycle lengths (Permutation groups and cycle notation), each at most p, so one cycle has length p and uses all p roots. \square
  12. Proof. Let \sigma \in \operatorname{Gal}(E/F(\alpha)). Each root \beta is \tau(\alpha) for some \tau (Exercise 10), and \sigma(\beta) = \sigma\tau(\alpha) = \tau\sigma(\alpha) = \beta. So \sigma fixes every root and is the identity (Theorem 2(b)). As E is a splitting field of f over F(\alpha) (SF Lemma 2(c)), of characteristic 0 or finite, Corollary 7 gives [E : F(\alpha)] = 1. \square
  13. Proof. A reducible cubic has a root g/h with g, h \in \mathbb{Z}_3[t], h \ne 0; then g^3 = th^3, and comparing degrees gives 3\deg g = 1 + 3\deg h, impossible. So [E : F] = 3. In characteristic 3 the middle coefficients vanish, so (x - s)^3 = x^3 - s^3, which is x^3 - t. Each \sigma \in \operatorname{Gal}(E/F) sends s to a root of x^3 - t in E, and s is the only one, so \sigma = \mathrm{id}. \square
math.wiki · updated 2026-11-18 · CC-BY-SA-4.0