The set of all automorphisms of a field is a group under composition of functions.
Proof.
If and are automorphisms of , then so are and . The identity is certainly an automorphism; hence, the set of all automorphisms of a field is indeed a group.
Let be a field extension of . Then the set of all automorphisms of that fix elementwise is a group; that is, the set of all automorphisms such that for all is a group.
Proof.
We need only show that the set of automorphisms of that fix elementwise is a subgroup of the group of all automorphisms of . Let and be two automorphisms of such that and for all . Then and . Since the identity fixes every element of , the set of automorphisms of that leave elements of fixed is a subgroup of the entire group of automorphisms of .
Let be a field extension of . We will denote the full group of automorphisms of by . We define the Galois group of over to be the group of automorphisms of that fix elementwise; that is,
is an automorphism of leaving fixed. The automorphism moves both and . It will soon be clear that is the Galois group of over . The following table shows that this group is isomorphic to .
Let be an algebraic extension of a field . Two elements are conjugate over if they have the same minimal polynomial. For example, in the field the elements and are conjugate over since they are both roots of the irreducible polynomial .
Let be a polynomial in and suppose that is the splitting field for over . If has no repeated roots, then
.
Proof.
We will use mathematical induction on . If , then and there is nothing to show. If , let , where is irreducible of degree . We may assume that ; otherwise, splits over and . Let be a root of . If is any injective homomorphism, then is a root of , and is a field automorphism. Since has no repeated roots, has exactly roots . By Proposition 23.5, there are exactly isomorphisms that fix , one for each root of (see Figure 23.8).
Since is a splitting field of over , it is also a splitting field over . Similarly, is a splitting field of over . Since , induction shows that each of the isomorphisms has exactly extensions, , and we have constructed isomorphisms that fix . Finally, suppose that is any automorphism fixing . Then restricted to is for some .
Let be a finite field with a finite extension such that . Then is cyclic of order .
Proof.
Let be the characteristic of and and assume that the orders of and are and , respectively. Then . We can also assume that is the splitting field of over a subfield of order . Therefore, must also be the splitting field of over . Applying Theorem 23.7, we find that .
To prove that is cyclic, we must find a generator for . Let be defined by . We claim that is the element in that we are seeking. We first need to show that is in . If and are in ,
by Lemma 22.3. Also, it is easy to show that . Since is a nonzero homomorphism of fields, it must be injective. It must also be onto, since is a finite field. We know that must be in , since is the splitting field of over the base field of order . This means that leaves every element in fixed. Finally, we must show that the order of is . By Theorem 23.7, we know that
is the identity of . However, cannot be the identity for ; otherwise, would have roots, which is impossible.
We can now confirm that the Galois group of over in Example 23.4 is indeed isomorphic to . Certainly the group is a subgroup of ; however, must be all of , since
over . We know that is irreducible by Exercise 17.5.20 in Chapter 17. Furthermore, since , we can use DeMoivre’s Theorem to determine that the roots of are , where and
Hence, the splitting field of must be . We can define automorphisms of by for . It is easy to check that these are indeed distinct automorphisms in . Since
Many of the results that we have just proven depend on the fact that a polynomial in has no repeated roots in its splitting field. It is evident that we need to know exactly when a polynomial factors into distinct linear factors in its splitting field. Let be the splitting field of a polynomial in . Suppose that factors over as
We define the multiplicity of a root of to be . A root with multiplicity 1 is called a simple root. Recall that a polynomial of degree is separable if it has distinct roots in its splitting field . Equivalently, is separable if it factors into distinct linear factors over . An extension of is a separable extension of if every element in is the root of a separable polynomial in . Also recall that is separable if and only if (Lemma 22.5).
Let be an irreducible polynomial over . If the characteristic of is , then is separable. If the characteristic of is and for some in , then is also separable.
Proof.
First assume that . Since and is irreducible, the only way is if is the zero polynomial; however, this is impossible in a field of characteristic zero. If , then can be the zero polynomial if every coefficient of is a multiple of . This can happen only if we have a polynomial of the form .
Certainly extensions of a field of the form are some of the easiest to study and understand. Given a field extension of , the obvious question to ask is when it is possible to find an element such that . In this case, is called a primitive element. We already know that primitive elements exist for certain extensions. For example,
Corollary 22.12 tells us that there exists a primitive element for any finite extension of a finite field. The next theorem tells us that we can often find a primitive element.
Let be a finite separable extension of a field . Then there exists an such that .
Proof.
We already know that there is no problem if is a finite field. Suppose that is a finite extension of an infinite field. We will prove the result for . The general case easily follows when we use mathematical induction. Let and be the minimal polynomials of and , respectively. Let be the field in which both and split. Suppose that has zeros in and has zeros in . All of these zeros have multiplicity , since is separable over . Since is infinite, we can find an in such that
for all and with . Therefore, . Let . Then
hence, for all with . Define by . Then . However, for . Hence, and have a single common factor in ; that is, the minimal polynomial of over must be linear, since is the only zero common to both and . So and is in . Hence, .