Proposition23.1
The set of all automorphisms of a field is a group under composition of functions.
📚 The CoCalc Library - books, templates and other resources
Important: to view this notebook properly you will need to execute the cell above, which assumes you have an Internet connection. It should already be selected, or place your cursor anywhere above to select. Then press the "Run" button in the menu bar above (the right-pointing arrowhead), or press Shift-Enter on your keyboard.
ParseError: KaTeX parse error: \newcommand{\lt} attempting to redefine \lt; use \renewcommand
Our first task is to establish a link between group theory and field theory by examining automorphisms of fields.
The set of all automorphisms of a field is a group under composition of functions.
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.
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 of over to be the group of automorphisms of that fix elementwise; that is,
If is a polynomial in and is the splitting field of over then we define the Galois group of to be
Complex conjugation, defined by is an automorphism of the complex numbers. Since
the automorphism defined by complex conjugation must be in
Consider the fields Then for
is an automorphism of leaving fixed. Similarly,
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
We may also regard the field as a vector space over that has basis It is no coincidence that
Let be a field extension of and be a polynomial in Then any automorphism in defines a permutation of the roots of that lie in
Let
and suppose that is a zero of Then for
therefore, is also a zero of
Let be an algebraic extension of a field Two elements are 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
A converse of the last proposition exists. The proof follows directly from Lemma 21.32.
If and are conjugate over there exists an isomorphism such that is the identity when restricted to
Let be a polynomial in and suppose that is the splitting field for over If has no repeated roots, then
We will use mathematical induction on the degree of If the degree of is 0 or 1, then and there is nothing to show. Assume that the result holds for all polynomials of degree with Suppose that the degree of is Let be an irreducible factor of of degree Since all of the roots of are in we can choose one of these roots, say so that Then
If is any other root of then By Lemma 21.32, there exists a unique isomorphism for each such that fixes elementwise. Since is a splitting field of there are exactly such isomorphisms. For each of these automorphisms, we can use our induction hypothesis on to conclude that
Consequently, there are
possible automorphisms of that fix or
Let be a finite field with a finite extension such that Then is cyclic of order
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
Let us compute the Galois group of
over We know that is irreducible by Exercise 17.4.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
the 's must be all of Therefore, since is a generator for the Galois group.
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 of a root of to be A root with multiplicity 1 is called a . Recall that a polynomial of degree is 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 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.
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 . We already know that primitive elements exist for certain extensions. For example,
and
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
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 1, 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,