Let be a field of characteristic and . In this post we discuss the Galois group of a cubic polynomial over . The process is not very hard but there are some quite non-trivial observations.
Let be an arbitrary field and suppose is separable and, i.e., has no multiple roots in an algebraic closure, and of degree . Let
be its factorisation in a splitting field . Put . We say that is the Galois group of over . Let be a root of and pick any . By definition of Galois group, we see is still a root of (consider the map induced by naturally; it is the identity when restricted to ). This is to say, elements of permutes the roots of .
For example, consider , , . The Galois group contains two elements and is generated by complex conjugation . A root of is , and is another root.
Based on this fact, we can consider as a subgroup of , where is the degree of . The structure of can be extremely complicated, but for now we assume that they are well-known. The question is, what subgroup is inside . Let’s take a look into the case when .
To begin with we note that we can assume that the quadratic term is . Let be a polynomial, then
and as a result is cancelled. A translation does not change any property of a polynomial except the value of its roots. Therefore we can reduce our study to polynomials in the depressed form
In fact, for all , we can cancel out by a substitution .
Irreducibility
Now back to our main story. First of all we study irreducibility. If is irreducible, then clearly it has no root in . On the other hand, if has no root in , does that mean is irreducible over ? This does not hold in general for all polynomials. For example, the polynomial is not irreducible yet it has no root in or . But fortunately, is a beautiful number and we can proceed. Were irreducible, there would be a factorisation
with each being a proper factor of . However, this is to say, at least one of has degree . A contradiction. We therefore have a result as follows:
Proposition 1. Let be a cubic polynomial in where , then is irreducible over if and only if has no root in .
The Galois group
Notation being above, we assume that is irreducible. Let be the splitting field of . We claim that is separable. Before proving the claim, one should notice that the characteristic matters a lot. For example, is irreducible over but over and we therefore have a triple root.
is separable if and only if . The derivative of , which should be simplified because has been, is given by
It is not equal to because the characteristic of is not . We will show carefully that is separable by working on these two polynomials.
The first question is the value of and . If some of them is then things may be easier or harder. Note first we must have because if not then and this is not irreducible. If , then and because . It follows that because either or divides .
Now there only remains the most general case: and . This is where the Euclidean Algorithm kicks in. Recall that for any three polynomials in , we have
This is how the Euclidean Algorithm works. Note we can write
It follows that . We next work on and .
However, and has common divisor , which implies that and has common divisor . Whichever the case is, we have and therefore is separable. Note the fact that the characteristic of is not or is frequently used here, otherwise there are a lot of equations making no sense.
Where we are at? We want to ensure that is separable so that working with the Galois group of is not that troublesome. And is. We now back to the study of the Galois group , where is the splitting field of . Let , , be the roots of and pick one of them as . We see .
Since permutes three elements, has to be a subgroup of . Therefore , which implies that or . In the first case, , the alternating group. In the second case, and is not normal over because, there is an irreducible polynomial which has a root in that does not split into linear factors in . This is the definition of normal extension.
The question now is, when is and when it is ? We get a good chance to review finite group theory. This is answered by the sign of elements in . To be precise, if and only if has an odd element. If not then . To work with this, we recall how the sign function work. Put
For any , we have , where is the sign of . If we put , which is the discriminant, we see . Therefore . But wait, since , the sign is not guaranteed, we see is not guaranteed to be in . This is where we crack the problem.
If , or more precisely, , then and it follows that for all . This can only happen if .
If , then is not fixed by . There is some such that , which is to say that . This can only happen when .
We have the following conclusion.
Proposition 2. Notation being above. Assume that is irreducible. Then the Galois group of is if and only if . The group is if and only if .
A dirty calculation shows that . One can show this using Vieta’s formulas. You shan’t feel this to be strange because in the quadratic case we have and we did care if , which amounts to whether .
Let’s conclude this post by a handy but nontrivial example. Consider
The discriminant is , which lies in and therefore the Galois group over it is . However, when the base field is a subfield, for example, , then the Galois group is .
Comments