Homepage › Solution manuals › David A. Cox › Galois Theory › Exercise 14.2.13
Exercise 14.2.13
Let be irreducible, where has characteristic different from 2 or 3. We will study the size of the Galois group of over .
- (a)
- Show that is separable. So we can think of the Galois group as a subgroup of .
- (b)
- Show that is imprimitive and that its Galois group lies in . Also show that . Thus the Galois group has order .
- (c)
- Let be the splitting field of over . Use the Tower Theorem to show that . Hence the Galois group has order at most .
Using Maple or Sage, one can show that the Galois group of over has order and hence is as large as possible.
Answers
Proof. (a) Since has characteristic different from 2 or 3, . By hypothesis, is irreducible, thus any factor of is associate to or . Since , divides , thus , and is a factor of , which cannot be associate to , therefore . This proves that is separable. (b) If is a root of in , then is a root of . Let . Then is a root of :
Moreover , otherwise , and , where , so that would not be irreducible over . Therefore
Write . Then is an intermediate field which is a splitting field of over . If , then and would not be irreducible over . Therefore , is irreducible over . is the splitting field of the separable polynomial , thus is a Galois extension, where .
Moreover,
where . Therefore three roots of are the roots of , and three other roots of are the roots of :
This gives the blocks
If , then , thus : fixes , or exchanges . Since are the roots of , are the roots of , thus or , and similarly or . This proves that is imprimitive, with blocks , and is isomorphic to a subgroup of (Corollary 14.2.10), whose order is (see Ex. 6 (c)). (c) We don’t know if or contains the cubic roots of unity, but does: since are two distinct roots of (where , otherwise ), then . If we write , then and , thus are three distinct roots of , and , so that or .
Then the six roots of are
Therefore
Consider the chain of fields
Since are the roots of the irreducible polynomial , is a quadratic extension of , so .
Since , .
Since , where , .
Since , where , .
By the Tower Theorem,
Therefore,
□
Note : Some permutations of can’t lie in the Galois group of , for instance if the transposition corresponds to , given by
then and show that , and implies . This contradiction proves that (but ). More generally, all odd permutations are impossible, so that is a subgroup of .