# RUDIMENTARY GALOIS THEORY

Size: px
Start display at page:

Transcription

1 RUDIMENTARY GALOIS THEORY JACK LIANG Abstract. This paper introduces basic Galois Theory, primarily over fields with characteristic 0, beginning with polynomials and fields and ultimately relating the two with the Fundamental Theorem of Galois Theory. This paper then applies Galois Theory to prove Galois s Theorem, describing the relationship between the Galois groups of polynomials and their solvability by radicals. Contents 1. Introduction 1 2. Basic Algebra and Polynomials 2 3. Fields and Field Extensions 4 4. Galois Theory 7 5. An Application of Galois Theory 12 Acknowledgements 15 References Introduction In this paper, we will explore Galois Theory in an attempt to relate field extensions with groups. This will ultimately be used to find the connection between the solvability of polynomials and the solvability of their Galois groups. We will assume a basic knowledge of algebra, primarily in the areas of groups and fields, however, not much beyond the basic definitions is necessary for the purposes of this paper. Much of the beginning sections of this paper is useful for developing intuition about polynomials and fields- while some of the early theorems may not directly be necessary for understanding Galois Theory, such theorems were included because it makes the application of some of the later theorems easier. The middle section of this paper is devoted to proving the Fundamental Theorem of Galois Theory, which I have broken into two parts because of its length. The final section is a very useful application of Galois Theory. I have chosen to include several fairly lengthy examples because I believe that reading the theorems is not sufficient for understanding Galois Theory, rather, it is the worked out examples that are the greatest learning tool. Note that some lemmas necessary to prove certain theorems are asserted, particularly in the final section of the paper. Whenever an assertion was made, I was sure to include a note explaining why the assertion was necessary. 1

2 2 JACK LIANG 2. Basic Algebra and Polynomials Definition 2.1 (Primitive and Monic Polynomials): A polynomial with coefficients in a unique factorization domain is primitive if the greatest common divisor of its coefficients is 1, and a polynomial is monic if its leading coefficient is 1. Definition 2.2 (Irreducible and Separable Polynomial): Given a field F, a polynomial p(x) with coefficients in F of degree d 1 is irreducible if there exists no factorization p(x) = f(x)g(x) for nonconstant f, g F [x]. A polynomial with coefficients is separable if its roots are distinct and in the algebraic closure of F. Theorem 2.3 (Gauss Lemma): The product of two primitive polynomials is itself primitive. Proof: Proof by contradiction: Suppose f and g are primitive, but their product fg is not. This implies that there exists a prime p that divides all of the coefficients of fg. Because f and g are primitive, not all their coefficients are divisible by p. Let a r x r and b s x s be the terms of greatest power in f and g respectively that have coefficients not divisible by p. Consider the coefficient of the x r+s term in fg. Its value is given by a i b j. r+s=i+j Note that for i = r and j = s that a i b j is not divisible by p, as neither a r or b s are divisible by p. However, as a r x r and b s x s are the first terms in f and g respectively not divisible by p, for i > r we have that p divides a i and thus divides a i b j and for i < r we have that j > s and thus that p divides b j, implying that p divides a i b j. Thus, every other term in the sum is divisible by p, so the sum cannot be divisible by p. This contradicts the fact that every coefficient in fg is divisible by p. Thus, fg must be primitive. Lemma 2.4: Every polynomial f Q[x] can be uniquely factored up to a unit in Z as f = cf 0, where c Q and f 0 is a primitive integer polynomial. Proof: We can see that mf Z[x] if we set m equal to the least common multiple of the denominators of the coefficients of f. If we now factor out the greatest common divisor of the remaining coefficients we can see that mf = nf 0, with f 0 being primitive. Thus, f = m n f 0, which proves existence. Now suppose that cf 0 = df 1, with c, d Q and f 0, f 1 primitive. Multiply by the least common multiple of the denominators of c and d to get c f 0 = d f 1, with c, d Z. It must be true that c is the greatest common divisor of the coefficients of c f 0, analogously, d is the greatest common divisor of the coefficients in d f 1. This implies that c = ±d, which implies that f 0 = ±f 1, which proves uniqueness up to a unit of Z. Theorem 2.5 (Corollary to Gauss Lemma): If a primitive polynomial p(x) Z[x] cannot be factored as a product of two nonconstant polynomials, then p(x) cannot be factored as such in Q[x].

3 RUDIMENTARY GALOIS THEORY 3 Proof: Proof by contradiction. Assume that a primitive polynomial f Z[x] cannot be factored as a product of two nonconstant polynomials in Z but can be written f = gh, where g, h Q[x] and both g and h are greater than zero. By the previous lemma, we can see that g = c 1 g 0 and h = c 2 h 0, with c 1, c 2 Q and g 0, h 0 primitive in Z. By Gauss s Lemma, we can see that g 0 h 0 is primitive in Z. Thus, f = c 1 c 2 g 0 h 0. However, it must be true that c 1 c 2 is equal to the greatest common denominator of the coefficients of f, which is 1 because f is primitive. Thus, we can see that g 0 h 0 = f is a nonconstant factorization of f in Z[x], a contradiction. Thus, f is irreducible in Q. The Corollary to Gauss Lemma results in the following, which is a useful way to determine whether or not polynomials are irreducible in Q. Theorem 2.6 (Eisenstein s Criterion): Let polynomial f Z[x] be f(x) = a 0 + a 1 x a n x n. If there exists a prime p such that p divides a 0, a 1...a n 1, p 2 does not divide a 0, and p does not divide a n, then f is irreducible over Q. Proof: Proof by contradiction. Assume that f satisfies the named criteria, but is reducible in Q[x]. It follows from the contrapositive of the Corollary to Gauss Lemma that f can be factored as the product of two nonconstant polynomials in Z[x]. Let f = gh = (b 0 + b 1 x b j x j )(c 0 + c 1 x c k x k ). By assumption, p divides a 0, so p divides b 0 c 0. However, because p 2 does not divide b 0 c 0, p divides either b 0 or c 0, but not both. Without loss of generality, let p divide c 0. The leading coefficient a n is not divisible by p, so p does not divide either b j or c k. Consider the first coefficient not divisible by p in h, and denote it c i. If i < n, then p divides a i. Consider a i = b 0 c i +b 1 c i b i c 0. This makes b 0 c i = a i (b 1 c i b i c 0 ). However, each c 0...c i 1 must be divisible by p, and a i is also divisible by p, so b 0 c i is divisible by p. This is a contradiction, as neither b 0 nor c i is divisible by p. Definition 2.7 (Ideals): An ideal I of ring R is a subset such that if a, b I then a b I and ab I. An ideal is a proper ideal if I R. An ideal is a prime ideal if ab I implies that a I or b I. A principal ideal is an ideal generated by one element, i.e., the prinicple ideal for an element a R is the set {ra r R} and is typically denoted (a). Definition 2.8 (Quotient Rings): The cosets of an ideal I in a ring R are sets in the form r + I = {r + s s I}. A quotient ring is the set of equivalence classes between cosets. Example 2.9: The quotient ring R[x]/(x 2 + 1) we have that x , or, that x ±i. In this way, the set of equivalence classes for this ring is naturally isomorphic to C, as they are all written in the form [a + bi]. The previous example leads us to think about fields similar to {a + bi a, b R} = C. Note that we did not need to let a and b be in R, we could have just

4 4 JACK LIANG as easily let them be in Q and gotten a comparable result. This brings us to the following definition. Definition 2.10 (Field Extensions): A field E is known as a field extension of another field F if F is a subfield of E. We write E/F to indicate that E is a field extension of F. We can create a field extensions from a given field by adjoining an element, which is denoted by F (α) (read F adjoin α ). Here, F (α) is the smallest extension of F that contains α. Note that we can also adjoin lists of elements, for example, F (α 1, α 2 ) is the smallest extension of F that contains both α 1 and α 2. We call an extension simple if it is generated by one element. Example 2.11: Consider the field Q[x]/(x 2 2). Following a similar process as before, we can see that this field is isomorphic to Q( 2) = {a+b 2 a, b Q} R. Here, we see that Q Q( 2) R C. In this case, R and C are field extensions of Q( 2) whereas Q is a subfield of Q( 2). Visually: C R Q( 2) Q 3. Fields and Field Extensions Definition 3.1 (Algebraic and Transcendental): Let E/F be a field extension and let α E. We call α algebraic over F if α is a root of some polynomial in F [x]. If α is not a root of any polynomial, we call α transcendental. We call the field extension E/F algebraic if every α E is algebraic over F. Definition 3.2 (Degree): The degree of a field extension E/F is equal to the dimension of E viewed as a vector space over F. If the degree of E/F, denoted by [E : F ], is finite, then E/F is considered to be a finite field extension. Example 3.3: Returning to our previous example of the field created by Q( 2), we can see that when viewing Q( 2) as a vector space over Q the dimension of such a vector space is 2 (because 1 and 2 form a basis). Thus, [Q( 2) : Q] = 2. However, we know that there exist infinitely many transcendentals in R over Q, thus, [R : Q] is not finite. Finally, we can see that C as a vector space over R has a dimension of 2 (as 1 and i form a basis), thus, [C : R] = 2.

5 RUDIMENTARY GALOIS THEORY 5 We will now attempt to gain some intuition about the degree of a field extension. The following lemma and theorem connect degrees of field extensions to degrees of polynomials. Lemma 3.4: If F is a field, then F [x] is a principal ideal domain (all ideals are generated by a single element). Proof: Let I F [x] be an ideal. We wish to show that I is generated by one element. If I = 0, clearly, I is generated by the element 0. If I 0, then let p F [x] be a non-zero polynomial of minimal degree; we will prove that p generates I i.e., I = (p). Consider some g I. We can divide g by p using the division algorithm to yield g = qp + r, for a particular quotient q and remainder r of degree strictly less than that of p. However, we can see that r = g qp I, so making p minimal forces r to be 0. Thus, g = qp (p). Because g I was arbitrary, I = (p). Lemma 3.5: Let E/F be a field extension and let p(x) F [x] be a monic irreducible polynomial with α E as a root. Then p f for every f(x) F [x] with α as a root and p(x) is, up to factors of constants, the only polynomial in F [x] with degree p that has α as a root. Note that this p(x) is known as the minimal polynomial for α. Proof: By Lemma 3.4, F [x] is a principal ideal domain. Let I be the set defined by I = {f(x) F [x] f(α) = 0}. It is trivial to show that I is an ideal. Let f be an element of I. We can see that because p is irreducible, its only monic divisors are 1 and p. However, 1 I, as α is not a solution to the polynomial 1, so the generator for the ideal must be p. Thus, p divides f, so p f. Now let q(x) be a monic polynomial in I such that q = q. We can see that p q is a polynomial in I with degree less than p. However, if p q 0, then we would have a polynomial of degree less than the degree of p with α as a solution, contradicting the first part of the proof. Thus, p q = 0, or, all polynomials with degree equal to p that have α as a root are equal to p. Theorem 3.6: Let p(x) F [x] be an irreducible polynomial of degree d. Then the field E = F [x]/(p(x)) is a field extension of F with degree d. Proof: Consider the ideal generated by p(x), which we will call I and some α E which is a root of p. We will prove that {1, α, α 2...α d 1 } is a basis for the vector space E with respect to F. To prove linear independence, suppose that c 0 + c 1 α c d 1 α d 1 = 0. This means that there exists a polynomial of degree d 1 with alpha as a root, contradicting the lemma. Thus, it must be true that all such c are 0, thus, {1, α...α d 1 } are linearly independent. To prove that {1, α,...α d 1 } span E, note that every g E has the form f + I. By the division algorithm for polynomials, we see that f(x) = q(x)p(x)+r(x), with r < p. Thus, f(x) + I = r(x) + I. Evaluating at α, we can see that {1, α...α d 1 } spans r(α) + I. Thus, every polynomial in E is in the span of {1, α,...α d 1 }.

6 6 JACK LIANG Because {1, α,...α d 1 } are linearly independent and span E, they form a basis for E. Thus, the degree of E/F = {1, α...α d 1 } = d. Theorem 3.7 (Tower Theorem): If F E D are fields and [D : E] and [E : F ] are finite, then [D : F ] is also finite with degree equal to [E : F ] [D : E]. Proof: Let the degree of [E : F ] = n N and [D : E] = m N. Consider bases a 1...a n for E over F and b 1...b m for D over E. We will demonstrate that the basis a i b j for 1 i n and 1 j m form a basis of n m elements for D over F. To prove linear independence, suppose there exist α ij such that n m α ij a i b j = 0. i=1 j=1 We will prove that all α ij must be equal to zero. However, we can write this as ( m n ) α ij a i b j. j=1 i=1 Because all b j are linearly independent (because they form a basis for D over E), we know that each coefficient of each b j term is equal to zero, or, that n α ij a i = 0 for all 1 i n. i=1 However, we know that all a i are linearly independent as they form a basis for E over F, so it must be true that all such α ij = 0. Thus, the elements of our set {a i b j 1 i n and 1 i m} are linearly independent. To prove that our chosen set spans D, consider some d D. Because b 1...b m span D as a vector space over E, we can write m d = β 1 b β m b m = β j b j. Because a 1...a n span E as a vector space over F, we can write each β j as n β j = α 1j a 1 + α 2j a α nj a n = α ij a i. Substituting, we see that ( m n ) d = α ij a i b j = j=1 i=1 n j=1 i=1 j=1 i=1 m α ij a i b j, which is a linear combination of our basis vectors. Thus, D is spanned by our set. Thus, the set {a i b j 1 i n and 1 i m} is linearly independent and spans D, so the dimension of D as a vector space over F is n m. Thus, [D : F ] = n m = [E : F ] [D : E].

7 RUDIMENTARY GALOIS THEORY 7 4. Galois Theory Definition 4.1 (Galois Group): Let E/F be a finite field extension. Then the Galois Group denoted by Gal(E/F ) is the set {σ : E E σ is an automorphism with σ(a) = a for all a F }. As suggested, the Galois Group is a group under the operation given by composition and is a finite group. Example 4.2: Consider the field extension Q( 2)/Q. Trivially, we see that the identity map i Q( 2), which maps a + b 2 to a + b 2 is a member of the Galois Group. Furthermore, we see that the map σ which maps a + b 2 to a b 2 is also in the Galois Group, as all σ(x) = x for all x Q. We can also see that the set of automorphisms that fix x Q need to map 2 to ± 2, thus, these are the only two elements in the Galois Group. So Gal(Q( 2)/Q) = {i Q( 2), σ}. Definition 4.3 (Splitting Fields and Fixed Fields): A splitting field of f(x) F [x] is the smallest field extension E/F in which f(x) can decompose into linear factors. Let a subset of automorphisms on a field E be called G. Then the fixed field E G is defined by all elements fixed by every automorphism in G, i.e., E G = {α E σ(α) = α for all σ G}. The following theorem will demonstrate that finite separable extensions are generated by one element, which in turn will help prove a theorem useful for developing some primary intuition about the Galois Group and its relation with fields between E and F, where E/F is a field extension. Such fields K with F K E are called intermediate fields. Theorem 4.4 (Theorem of the Primitive Element): Let F E = F (α 1...α n ) be a finite extension, with each α i being separable over F. Then there exists γ E that has the property that F (γ) = E. This γ is called the primitive element. Note that for the sake of simplicity, this proof will be written for fields of characteristic 0, however, this theorem applies for finite fields as well. Proof: Let E = F (α 1...α n ), with each α i being separable over F. We will inductively prove that there exist a 1...a n F such that F (a 1 α a n α n ) = E. Base case: n=2. Let E = F (α 1, α 2 ), and consider the minimal polynomials f, g F [x] for α 1 and α 2 respectively. Note that f and g are both separable over F. Let the degree of f be f = n and the degree of g be g = m. Because f and g are separable, there exist distinct roots f 1...f n of f and g 1...g m of g. Let α 1 = f 1 and α 2 = g 1. Because F is infinite by assumption, we can see that there exists k F such that α 1 + kα 2 f i + kg j for 1 i n and 2 j m. We will prove that F (α 1 + kα 2 ) = E. Obviously, F (α 1 + kα 2 ) E. To prove the other direction, we must show that α 1 and α 2 are both contained in F (α 1 + kα 2 ), which will be sufficient to

8 8 JACK LIANG show that F (α 2 + kα 2 ) generates E. First consider α 2. Note that the greatest common divisor of g and f(α 1 + kα 2 kx) F (α 1 + kα 2 )[x] must be a polynomial of degree of at least one. This is true, because else, there would exist polynomials f, g F (α 1 +kα 2 )[x] such that gg +f f(α 1 +kα 2 kx) = 1. However, evaluating this at x = α 2 yields (0)g + (0)f = 1, or, 0 = 1, clearly a contradiction. So there exists h = gcd(f(α 1 + kα 2 kx), g) such that h 1. We can see that if h > 1, we have that there exists some root of g not equal to α 2 that is also a root of f(α 1 + kα 2 kx), however, this contradicts our construction of k above. Thus, h = 1. In particular, h = x α 2, as it must have α 2 as a root. We know that h F (α 1 + kα 2 )[x], so α 2 F (α 1 + kα 2 ). Thus, we can clearly also see that α 1 = (α 1 + kα 2 ) k α 2 F (α 1 + kα 2 ), so we have that F (α 1 + kα 2 ) = F (α 1, α 2 ). Inductive step: Let n = m > 2. By the inductive hypothesis, we can see that E = F (α 1...α m ). By assumption, we can find some γ 0 such that F (α 1...α m 1 ) = F (γ 0 ). Thus, we see that E = F (γ 0, α m ). However, for the n = 2 case we have already demonstrated that a field generated by two elements can be generated by a primitive element, γ. Thus, we have found the desired primitive element by the base case. By the inductive hypothesis, our proof is complete. Theorem 4.5: If E is the splitting field of a separable polynomial f in F [x], then the Galois group of F E has cardinality Gal(E/F ) = [E : F ]. Proof: First, we will prove that E = F (α 1...α n ), with α 1...α n being the roots of f. We have that E is the smallest field with F (α 1...α n ) E because F splits in E. Each α i is clearly separable over F. By the Theorem of the Primitive Element, there exists γ E that is separable over F such that E = F (γ). Let g be the minimal polynomial for γ. By Theorem 3.5, because g is the minimal polynomial for γ and E = F (γ), we can see that [E : F ] = g d. We must now demonstrate that Gal(E/F ) has d elements. Because g is the minimal polynomial for γ with degree d, there exists γ = γ 1, γ 2...γ d distinct roots of g contained in E. Because E is the splitting field over F, there exist automorphisms σ i such that σ i (γ) = γ i for 1 i d. Note that in this case, σ 1 is the identity, while each of the others simply permutes the roots of g. Thus, there exist at least d elements in the Galois group. To show that there exist no other such elements in the Galois group, we can see that any σ in the Galois group must send γ to one of the other roots. This is equivalent to the permutations listed above. Thus, there are no additional elements in the Galois group, so Gal(E/F ) = d = [E : F ]. Theorem 4.6: The following conditions are equivalent for a finite field extension E/F with Galois group G = Gal(E/F ).

9 RUDIMENTARY GALOIS THEORY 9 (1) F = E Gal(E/F ). (2) Every irreducible polynomial p(x) F [x] with one root in E is separable and has all its roots in E. (3) E is a splitting field of some separable polynomial f(x) F [x]. A finite extension E/F is called Galois if it satisfies any of the previous equivalent conditions. Proof: We will prove that the first statement implies the second, the second implies the third, and the third implies the first, demonstrating equivalence. 1 = 2: Consider an irreducible polynomial p such that there exists α E with p(α) = 0. Then, F (α) is isomorphic to the quotient field of F [x]/(p(x)). Thus, there must be exactly e embeddings from F (α) into the algebraic closure of F, where e is the number of distinct roots of p in the algebraic closure of F. Suppose that there exist e embeddings with image inside E. Then [E : F ] = Gal(E/F ) e [E : F (α)]. Thus, [F (α) : F ] e by the Tower Theorem, so the degree of p e. However, it must be true that e p, because p has at most p distinct roots and thus can have at most p embeddings. Thus, p = e. Thus, we can see that e = e and e = p, which implies that p is separable and has all of its roots in E. 2 = 3: Consider some α 1 E such that α 1 F. Because E/F is finite, α 1 must be algebraic over F, thus, there exists an irreducible polynomial p 1 (x) F [x] with α 1 as a root. By assumption, p 1 is separable; let K 1 be its splitting field. If K 1 = E, the third condition is satisfied. If not, consider another α 2 E with α 2 F. Repeating the process above, find irreducible p 2 F [x] with α 2 as a root. The new polynomial p 1 p 2 F [x] will have both α 1 and α 2 as roots, let K 2 be the splitting field of p 1 p 2, again, if K 2 = E we have satisfied the third condition. This process will terminate after a finite number of iterations because the degree of E/F is finite, thus, repeating this process a total of [E : F ] = n times will produce a polynomial p 1 p 2...p n F [x] whose splitting field is E. 3 = 1: By Theorem 4.5, Gal(E/F ) = [E : F ]. We will now prove that that Gal(E/F ) = [E : E Gal(E/F ) ]. Consider σ 1...σ n Gal(E/F ). Clearly, [E : E Gal(E/F ) ] n = Gal(E/F ). Furthermore, each authomorphism in the Galois group will fix exactly one such field, resulting in a vector space of exactly n dimensions for E over E Gal(E/F ). Thus, Gal(E/F ) = [E : E Gal(E/F ) ]. This implies that [E : F ] = [E : E Gal(E/F ) ]. By definition, F E Gal(E/F ), so we must have that F = E Gal(E/F ).

10 10 JACK LIANG Corollary 4.7: If E/F is Galois, and there exists K such that F K E, then E/K is also Galois. Proof: If F E is Galois, then E is the splitting field of a particular separable polynomial f F [x]. Because F K, when we consider f K[x], we can see that E must still be the splitting field of f. Thus, E/K is also Galois. Theorem 4.8 (Fundamental Theorem of Galois Theory, part 1): Let F E be a normal extension. Then for any intermediate field F K E, we have that E/K is Galois and its Galois group Gal(E/K) is a subgroup of Gal(E/F ). Also, [Gal(E/F ) : Gal(E/K)] = [K : F ]. Proof: We can see that if F E is Galois, then K E is also Galois by Theorem 4.6. We have that K = E Gal(E/K) by Theorem 4.6. Because K E and F E are both Galois, we can see by Theorem 4.5 that Gal(E/K) = [E : K] and Gal(E/F ) = [E : F ]. Using the Tower Theorem, we see that [E : F ] = [K : F ] [E : K]. Thus [K : F ] = [E : F ] Gal(E : F ) = = [Gal(E/F ) : Gal(E/K)]. [E : K] Gal(E : K) Theorem 4.9 (Fundamental Theorem of Galois Theory, part 2): Let F E be a Galois extension. Then the maps between the set of intermediate fields F K L and the set of subgroups H Gal(E/F ) given by K Gal(E/K) and H E H are one to one and are inverses of each other. This correspondence reverses inclusions. Furthermore, if a subfield K corresponds to a subgroup H under these maps, then K is Galois over F if and only if H is normal in Gal(E/F ), and when this happens, there is a natural isomorphism Gal(E/F )/H = Gal(K/F ). Proof: To prove that the maps are inverses of eacth other and reverse inclusions, consider the compositions of the maps. First, we have that K Gal(E/K) E Gal(E/K), however, because E/K is Galois by Corollary 4.7, we have that E Gal(E/K) = K. Thus: K Gal(E/K) K. Analogously, we have that H E H Gal(E/E H ), however, again, by the Fundamental Theorem of Galois Theory we have that Gal(E/E H ) = H. Thus: H E H H. This demonstrates that the two maps are inverses of each other. We can also see that the fixed field generated by a larger H is smaller than the fixed field generated

11 RUDIMENTARY GALOIS THEORY 11 by a smaller H because a larger subfield of the Galois group fixes less elements in F. Thus, we can see that these inverses reverse inclusions, i.e., K 1 K 2 E = Gal(E/K 1 ) Gal(E/K 2 ). Note that the final portion of the previous proof was omitted because it relied on two lengthy lemmas- for complete proofs consult Galois Theory by David A. Cox under the section Normal Subgroups and Normal Extensions. The proof should follow naturally from the theorems in this section. Example 4.10: Consider the polynomial x 3 2 Q[x]. Clearly, the splitting field for this polynomial is Q(ω, 3 2), where ω is the third root of unity. We construct the following field diagram to illustrate the relationship between Q and its extension: Q(ω, 3 2) Q(ω) Q( 3 2) Q(ω 3 2) Q(ω 2 3 2) Q We can see that any element σ Gal(Q(ω, 3 2)/Q) has the following properties: σ(ω) {ω, ω 2 } and σ( 3 2) { 3 2, ω 3 2, ω 2 3 2}. This thus shows us explicitly the 6 elements in our Galois group. We know that there must be six elements because [Q(ω, 3 2) : Q] = 6. Consider σ 1 : Q(ω, 3 2) Q(ω, 3 2) such that σ 1 (ω) = ω and σ 1 ( 3 2) = ω 3 2. Now consider σ 2 : Q(ω, 3 2) Q(ω, 3 2) such that σ 2 (ω) = ω 2 and σ 2 ( 3 2) = 3 2. Note that these two automorphisms characterize all permutations of the roots of x 3 2 in that σ 1 sends 3 2 to ω 3 2 to ω and back, while σ 2 sends ω 3 2 to ω and back. Now, note that σ 1 and σ 2 generate subgroups of the Galois group Gal(Q(ω, 3 2)/Q). For instance, compositions of σ 1 form a cycle with three elements, the identity, σ 1, and σ 2 1, while compositions of σ 2 form a cycle of two elements, the identity and σ 2. Composing both σ 1 and σ 2, we see that σ 1 σ 2 forms a cycle with 2 elements similar to σ 2, as does σ 2 1σ 2. Each of these is a cyclic group (the group itself is denoted by σ ) and is isomorphic to Z/nZ, for n = 3 for σ 1 and n = 2 for the rest.

12 12 JACK LIANG {identity} σ 1 σ 2 σ 2 1σ 2 σ 1 σ 2 Gal(Q(ω, 3 2)/Q) Now notice the correspondence between Q(ω) and σ 1 ; when a + b cω + d eω 3 2+fω gω hω undergoes the permutation σ 1, the only terms that remain fixed are a and cω. The field generated by {a + cω a, c Q} is clearly Q(ω). If we repeat this process, we see that Q( 3 2) corresponds with σ 2, Q(ω 3 2) corresponds with σ 2 1σ 2, and Q(ω 2 3 2) corresponds with σ 1 σ 2. This demonstrates the Fundamental Theorem of Galois Theory, as we have established a connection between subgroups of Gal(Q(ω, 3 2)/Q) and the intermediate fields between Q and Q(ω, 3 2). 5. An Application of Galois Theory We will now apply Galois Theory to the solvability of polynomials by radicals, that is to say, determining whether or not the roots to a polynomial can be written using only some combination of +,,, and n. To answer this question simply, no, in general polynomials of degree greater than 4 cannot be written in this way; the proof of this is perhaps one of the most important applications of Galois Theory. In the following section, all fields will have characteristic 0. Definition 5.1 (Galois Closure): Let E be a field extension of F. A field L E is a Galois Closure of E/F if L/F is Galois and no proper subfield of L containing E is Galois over F. We will now introduce the idea of solvable groups and radical extensions. In general, we will apply solvable groups to Galois groups and radical extensions to the fields with which the Galois groups are related to by the Fundamental Theorem of Galois Theory. Definition 5.2 (Solvable Groups): A finite group G is solvable if there exist subgroups {e} = G n G n 1... G 0 = G such that, for 1 i n we have that G i is normal in G i 1 and [G i 1 : G i ] is prime. Example 5.3: Consider the groups {e} {e, (123)(132)} {e, (12)(13)(23)(123)(132)}, perhaps better known as {e} A 3 S 3. Each subgroup is clearly normal in the next, and [A 3 : {e}] = 3 and [S 3 : A 3 ] = 2, which are both primes. Thus, the group S 3 is solvable. Furthermore, all finite Abelian groups are solvable- the proof of this has been excluded for space purposes but follows from Cauchy s Theorem.

14 14 JACK LIANG The Galois Closure of F contained in K, which we will call M, is also radical over F by Fact 1. Note that if Gal(M/F ) is solvable, then by Fact 2 there exists an isomorphism between Gal(E/F ) and Gal(M/F )/Gal(M/E). By Fact 3 we would then get that, Gal(E/F ) is solvable. Thus, we must only prove that Gal(M/F ) is solvable, which allows us to assume that F E is radical and Galois. If we assume that F E is radical and Galois, adjoining the m th primitive root of unity ω to both F and E would mean that the resulting extension F (ω) E(ω) is also radical by Fact 4. By Fact 5 this extension is also Galois. Thus, if we can show that Gal(E(ω)/F (ω)) is solvable, then by Fact 5 we will have shown that Gal(E/F ) is solvable. Thus, we now assume that F contains any m th root of unity. We will now prove that Gal(E/F ) is solvable, thus completing the first direction of this proof. Because, by assumption, F E is radical, there exists subfields F = F 0 F 1... F n = E such that, for 1 i n we get that F i = F i 1 ( m i ki ), with k i F i 1. By the above, we can also say that F i contains a primitive m th i root of unity, which we will call ω i. Note that 1, ω i, ωi 2...ωmi 1 i roots of unity. Thus, we can see that the solutions to the polynomial are x m1 k i F i 1 [x] 1 mi ki, ω i mi ki... ω m 1 i mi ki. Because ω i F F i 1, we can see that F i 1 (1 mi ki, ω i mi ki... ω m 1 i mi ki ) = F i 1 ( m i ki ) are distinct m th i which demonstrates that F i 1 is Galois. We can also clearly see that the Galois Group for the extension F i 1 F i is cyclic, as the group is generated by the element that maps 1 mi ki ω i mi ki. Thus, we have proven that F i 1 F i is Galois and has a cyclic Galois Group. Now consider the subgroups G i = Gal(E/F i ) Gal(E/F ). By the fundamental theorem of Galois Theory, the Galois correspondence is inclusion-reversing, thus, we get that {identity} = Gal(E/E) = G n G n 1... G 1 G 0 = Gal(E/F ). Because F i 1 is an intermediate field of the Galois extension F E, we see that F i 1 E must be Galois. By our previous proof, we can see that F i 1 F i is also Galois. Thus, by Fact 2, we see that G i is normal in G i 1, which means that G i 1 /G i is Abelian. Because Abelian groups are solvable, we know by induction on i we can see that it must be true that Gal(F n /F 0 ) = Gal(E/F ) is solvable. Gal(E/F ) is solvable = F E is solvable: Let ω be the m th root of unity, where m = Gal(E/F ). By Fact 5, Gal(E(ω)/F (ω)) G is solvable. By Fact 2, we can construct an isomorphism between Gal(E/F ) and Gal(E(ω)/F )/Gal(E(ω)/E), which stems from the homomorphism Gal(E(ω)/F ) to Gal(E/F ) which restricts some automorphism of E(ω) to just E. Because G Gal(E(ω)/F ), there exists a homomorphism G Gal(E/F ) with the same restriction on E(ω). Obviously, the kernel of this map is the identity (as elements

15 RUDIMENTARY GALOIS THEORY 15 of the kernel must be the identity on both E and F (ω), which cannot occur unless the element itself is the identity), thus, the map is injective. To prove surjectivity, suppose σ maps E to E and fixes F. Define σ, which maps E(ω) to E(ω) and sends ω to itself. This would imply that σ/e = σ, so σ G. Thus, the map is bijective. Let p be a prime that divides m. Because ω is the m th primitive root of unity, ω m/p F (ω) must be the primitive p th root of unity. Thus, we can see that F (ω) has a primitive p th root of unity for every prime p dividing q, as p is arbitrary. Because G is solvable, there exist subgroups {identity} G n 1... G 1 G that satisfy the definition of solvable groups. Because the Galois correspondence is inclusion reversing, there exist fields F (ω) = E G F (ω) 1... F (ω) n 1 E. Because G i is normal in G i 1, we can say that there exists an isomorphism between G i 1 /G i and Gal(F (ω) i /F (ω) i 1 ). Because by the definition of a solvable group [G i 1 : G i ] is prime, we can see that there exists an isomorphism between Gal(F (ω) i /F (ω) i 1 ) and a cyclic group with Gal(F (ω) i /F (ω) i 1 ) elements. We can thus see that F (ω) i 1 F (ω) i is a Galois extension that has a Galois group that is isomorphic to a cyclic group with a prime number p of elements and contains the p th root of unity. By Fact 6, F (ω) i = F (ω) i 1 ( p x) for some x F (ω) i 1 ). Thus, we can see that F (ω) E(ω) is radical. We also can see that F F (ω) is radical (as ω m = 1), and as E E(ω) is radical for the same reason, we can conclude that F E is radical. Thus, F E is solvable by radicals. This result demonstrates to us that there cannot exist a generalized quintic (or above) formula because S 5, or any greater symmetric group, do not have solvable Galois groups. Note that the Galois groups of quintics are subgroups of S 5, thus, any quintic with a Galois group equal to S 5 (among many others) cannot be solved using only +,,,, and n because S 5 is not solvable. Acknowledgements. I would like to thank my mentor Yiwen Zhou for his guidance and his help with developing an intuition regarding group theory and Galois groups. His help made it possible for me not only to learn the material but also to work with it in a way that helped me understand it. I would also like to thank my other mentor, Sergei Sagatov, as well as Peter May and the other organizers of the REU for this opportunity to study interesting and advanced mathematics. References [1] Cox, David A. Galois Theory. John Wiley and Sons INC [2] Rotman, Joseph. Galois Theory. Springer [3] Lang, Serge. Graduate Texts in Mathematics: Algebra. Springer

### 1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism

1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials

### Galois Theory, summary

Galois Theory, summary Chapter 11 11.1. UFD, definition. Any two elements have gcd 11.2 PID. Every PID is a UFD. There are UFD s which are not PID s (example F [x, y]). 11.3 ED. Every ED is a PID (and

### Notes on Galois Theory

Notes on Galois Theory Math 431 04/28/2009 Radford We outline the foundations of Galois theory. Most proofs are well beyond the scope of the our course and are therefore omitted. The symbols and in the

### School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information

MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon

### Contradiction. Theorem 1.9. (Artin) Let G be a finite group of automorphisms of E and F = E G the fixed field of G. Then [E : F ] G.

1. Galois Theory 1.1. A homomorphism of fields F F is simply a homomorphism of rings. Such a homomorphism is always injective, because its kernel is a proper ideal (it doesnt contain 1), which must therefore

### ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008

ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely

### Fields and Galois Theory. Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory.

Fields and Galois Theory Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory. This should be a reasonably logical ordering, so that a result here should

### The Galois group of a polynomial f(x) K[x] is the Galois group of E over K where E is a splitting field for f(x) over K.

The third exam will be on Monday, April 9, 013. The syllabus for Exam III is sections 1 3 of Chapter 10. Some of the main examples and facts from this material are listed below. If F is an extension field

### FIELD THEORY. Contents

FIELD THEORY MATH 552 Contents 1. Algebraic Extensions 1 1.1. Finite and Algebraic Extensions 1 1.2. Algebraic Closure 5 1.3. Splitting Fields 7 1.4. Separable Extensions 8 1.5. Inseparable Extensions

### but no smaller power is equal to one. polynomial is defined to be

13. Radical and Cyclic Extensions The main purpose of this section is to look at the Galois groups of x n a. The first case to consider is a = 1. Definition 13.1. Let K be a field. An element ω K is said

### Galois Theory and the Insolvability of the Quintic Equation

Galois Theory and the Insolvability of the Quintic Equation Daniel Franz 1. Introduction Polynomial equations and their solutions have long fascinated mathematicians. The solution to the general quadratic

### Field Theory Qual Review

Field Theory Qual Review Robert Won Prof. Rogalski 1 (Some) qual problems ˆ (Fall 2007, 5) Let F be a field of characteristic p and f F [x] a polynomial f(x) = i f ix i. Give necessary and sufficient conditions

### AN INTRODUCTION TO GALOIS THEORY

AN INTRODUCTION TO GALOIS THEORY STEVEN DALE CUTKOSKY In these notes we consider the problem of constructing the roots of a polynomial. Suppose that F is a subfield of the complex numbers, and f(x) is

### Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.

5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field

### Part II Galois Theory

Part II Galois Theory Theorems Based on lectures by C. Birkar Notes taken by Dexter Chua Michaelmas 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after

### Notes on graduate algebra. Robert Harron

Notes on graduate algebra Robert Harron Department of Mathematics, Keller Hall, University of Hawai i at Mānoa, Honolulu, HI 96822, USA E-mail address: rharron@math.hawaii.edu Abstract. Graduate algebra

### Extension fields II. Sergei Silvestrov. Spring term 2011, Lecture 13

Extension fields II Sergei Silvestrov Spring term 2011, Lecture 13 Abstract Contents of the lecture. Algebraic extensions. Finite fields. Automorphisms of fields. The isomorphism extension theorem. Splitting

### GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS

GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions

### Factorization in Polynomial Rings

Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,

### GALOIS THEORY. Contents

GALOIS THEORY MARIUS VAN DER PUT & JAAP TOP Contents 1. Basic definitions 1 1.1. Exercises 2 2. Solving polynomial equations 2 2.1. Exercises 4 3. Galois extensions and examples 4 3.1. Exercises. 6 4.

### Algebraic Cryptography Exam 2 Review

Algebraic Cryptography Exam 2 Review You should be able to do the problems assigned as homework, as well as problems from Chapter 3 2 and 3. You should also be able to complete the following exercises:

### Galois Theory. This material is review from Linear Algebra but we include it for completeness.

Galois Theory Galois Theory has its origins in the study of polynomial equations and their solutions. What is has revealed is a deep connection between the theory of fields and that of groups. We first

### RINGS: SUMMARY OF MATERIAL

RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered

### MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions

MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions Basic Questions 1. Give an example of a prime ideal which is not maximal. In the ring Z Z, the ideal {(0,

### Course 311: Abstract Algebra Academic year

Course 311: Abstract Algebra Academic year 2007-08 D. R. Wilkins Copyright c David R. Wilkins 1997 2007 Contents 3 Introduction to Galois Theory 41 3.1 Field Extensions and the Tower Law..............

### A PROOF OF BURNSIDE S p a q b THEOREM

A PROOF OF BURNSIDE S p a q b THEOREM OBOB Abstract. We prove that if p and q are prime, then any group of order p a q b is solvable. Throughout this note, denote by A the set of algebraic numbers. We

### Math 121 Homework 2 Solutions

Math 121 Homework 2 Solutions Problem 13.2 #16. Let K/F be an algebraic extension and let R be a ring contained in K that contains F. Prove that R is a subfield of K containing F. We will give two proofs.

### Galois Theory TCU Graduate Student Seminar George Gilbert October 2015

Galois Theory TCU Graduate Student Seminar George Gilbert October 201 The coefficients of a polynomial are symmetric functions of the roots {α i }: fx) = x n s 1 x n 1 + s 2 x n 2 + + 1) n s n, where s

Graduate Preliminary Examination Algebra II 18.2.2005: 3 hours Problem 1. Prove or give a counter-example to the following statement: If M/L and L/K are algebraic extensions of fields, then M/K is algebraic.

### GALOIS THEORY I (Supplement to Chapter 4)

GALOIS THEORY I (Supplement to Chapter 4) 1 Automorphisms of Fields Lemma 1 Let F be a eld. The set of automorphisms of F; Aut (F ) ; forms a group (under composition of functions). De nition 2 Let F be

### Course 311: Hilary Term 2006 Part IV: Introduction to Galois Theory

Course 311: Hilary Term 2006 Part IV: Introduction to Galois Theory D. R. Wilkins Copyright c David R. Wilkins 1997 2006 Contents 4 Introduction to Galois Theory 2 4.1 Polynomial Rings.........................

### Module MA3411: Abstract Algebra Galois Theory Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents 1 Basic Principles of Group Theory 1 1.1 Groups...............................

### NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

### MT5836 Galois Theory MRQ

MT5836 Galois Theory MRQ May 3, 2017 Contents Introduction 3 Structure of the lecture course............................... 4 Recommended texts..................................... 4 1 Rings, Fields and

### Page Points Possible Points. Total 200

Instructions: 1. The point value of each exercise occurs adjacent to the problem. 2. No books or notes or calculators are allowed. Page Points Possible Points 2 20 3 20 4 18 5 18 6 24 7 18 8 24 9 20 10

### Algebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...

Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2

### arxiv: v1 [math.gr] 3 Feb 2019

Galois groups of symmetric sextic trinomials arxiv:1902.00965v1 [math.gr] Feb 2019 Alberto Cavallo Max Planck Institute for Mathematics, Bonn 5111, Germany cavallo@mpim-bonn.mpg.de Abstract We compute

### IUPUI Qualifying Exam Abstract Algebra

IUPUI Qualifying Exam Abstract Algebra January 2017 Daniel Ramras (1) a) Prove that if G is a group of order 2 2 5 2 11, then G contains either a normal subgroup of order 11, or a normal subgroup of order

### 55 Separable Extensions

55 Separable Extensions In 54, we established the foundations of Galois theory, but we have no handy criterion for determining whether a given field extension is Galois or not. Even in the quite simple

### AN INTRODUCTION TO THE THEORY OF FIELD EXTENSIONS

AN INTRODUCTION TO THE THEORY OF FIELD EXTENSIONS SAMUEL MOY Abstract. Assuming some basic knowledge of groups, rings, and fields, the following investigation will introduce the reader to the theory of

### Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille

Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is

### Solutions of exercise sheet 8

D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra

### 1 The Galois Group of a Quadratic

Algebra Prelim Notes The Galois Group of a Polynomial Jason B. Hill University of Colorado at Boulder Throughout this set of notes, K will be the desired base field (usually Q or a finite field) and F

### Galois theory of fields

1 Galois theory of fields This first chapter is both a concise introduction to Galois theory and a warmup for the more advanced theories to follow. We begin with a brisk but reasonably complete account

### AN INTRODUCTION TO GALOIS THEORY

AN INTRODUCTION TO GALOIS THEORY JULIAN MANASSE-BOETANI Abstract. This paper explores Galois Theory over the complex numbers, building up from polynomials to corresponding field extensions and examining

### GALOIS THEORY AT WORK: CONCRETE EXAMPLES

GALOIS THEORY AT WORK: CONCRETE EXAMPLES KEITH CONRAD 1. Examples Example 1.1. The field extension Q(, 3)/Q is Galois of degree 4, so its Galois group has order 4. The elements of the Galois group are

### MAIN THEOREM OF GALOIS THEORY

MAIN THEOREM OF GALOIS THEORY Theorem 1. [Main Theorem] Let L/K be a finite Galois extension. and (1) The group G = Gal(L/K) is a group of order [L : K]. (2) The maps defined by and f : {subgroups of G}!

### MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0

### List of topics for the preliminary exam in algebra

List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.

### ALGEBRA QUALIFYING EXAM SPRING 2012

ALGEBRA QUALIFYING EXAM SPRING 2012 Work all of the problems. Justify the statements in your solutions by reference to specific results, as appropriate. Partial credit is awarded for partial solutions.

### Math Introduction to Modern Algebra

Math 343 - Introduction to Modern Algebra Notes Field Theory Basics Let R be a ring. M is called a maximal ideal of R if M is a proper ideal of R and there is no proper ideal of R that properly contains

### be any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore

### ABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK

ABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK 1. Practice exam problems Problem A. Find α C such that Q(i, 3 2) = Q(α). Solution to A. Either one can use the proof of the primitive element

### Galois Theory of Cyclotomic Extensions

Galois Theory of Cyclotomic Extensions Winter School 2014, IISER Bhopal Romie Banerjee, Prahlad Vaidyanathan I. Introduction 1. Course Description The goal of the course is to provide an introduction to

### MATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11

MATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11 3. Examples I did some examples and explained the theory at the same time. 3.1. roots of unity. Let L = Q(ζ) where ζ = e 2πi/5 is a primitive 5th root of

### GALOIS THEORY BRIAN OSSERMAN

GALOIS THEORY BRIAN OSSERMAN Galois theory relates the theory of field extensions to the theory of groups. It provides a powerful tool for studying field extensions, and consequently, solutions to polynomial

### Polynomial Rings. i=0. i=0. n+m. i=0. k=0

Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients

### ALGEBRA 11: Galois theory

Galois extensions Exercise 11.1 (!). Consider a polynomial P (t) K[t] of degree n with coefficients in a field K that has n distinct roots in K. Prove that the ring K[t]/P of residues modulo P is isomorphic

### Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going

### Lecture Notes on Fields (Fall 1997)

Lecture Notes on Fields (Fall 1997) By George F. Seelinger Last Revised: December 7, 2001 NOTE: All references here are either made to Hungerford or to Beachy/Blair (2nd Edition). The references to Hungerford

### Part II Galois Theory

Part II Galois Theory Definitions Based on lectures by C. Birkar Notes taken by Dexter Chua Michaelmas 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

### Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009

Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Directions: Solve 10 of the following problems. Mark which of the problems are to be graded. Without clear indication which problems are to be graded

### Finite Fields. [Parts from Chapter 16. Also applications of FTGT]

Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory

### CSIR - Algebra Problems

CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com

### Identify F inside K and K. Then, by the claim, we have an embedding σ : K K such that σ F = id F. Since σ(k)/f and K/F are isomorphic extensions, the

11. splitting field, Algebraic closure 11.1. Definition. Let f(x) F [x]. Say that f(x) splits in F [x] if it can be decomposed into linear factors in F [x]. An extension K/F is called a splitting field

### MATH 361: NUMBER THEORY TENTH LECTURE

MATH 361: NUMBER THEORY TENTH LECTURE The subject of this lecture is finite fields. 1. Root Fields Let k be any field, and let f(x) k[x] be irreducible and have positive degree. We want to construct a

### 1 Finite abelian groups

Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Each Problem is due one week from the date it is assigned. Do not hand them in early. Please put them on the desk in front of the room

### Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018

Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018 Do 6 problems with at least 2 in each section. Group theory problems: (1) Suppose G is a group. The

### Homework 4 Algebra. Joshua Ruiter. February 21, 2018

Homework 4 Algebra Joshua Ruiter February 21, 2018 Chapter V Proposition 0.1 (Exercise 20a). Let F L be a field extension and let x L be transcendental over F. Let K F be an intermediate field satisfying

### Polynomial Rings. (Last Updated: December 8, 2017)

Polynomial Rings (Last Updated: December 8, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from Chapters

### Solutions of exercise sheet 6

D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 6 1. (Irreducibility of the cyclotomic polynomial) Let n be a positive integer, and P Z[X] a monic irreducible factor of X n 1

### where c R and the content of f is one. 1

9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.

### Math 201C Homework. Edward Burkard. g 1 (u) v + f 2(u) g 2 (u) v2 + + f n(u) a 2,k u k v a 1,k u k v + k=0. k=0 d

Math 201C Homework Edward Burkard 5.1. Field Extensions. 5. Fields and Galois Theory Exercise 5.1.7. If v is algebraic over K(u) for some u F and v is transcendental over K, then u is algebraic over K(v).

### Lecture 7: Polynomial rings

Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules

### 1. Group Theory Permutations.

1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7

### THROUGH THE FIELDS AND FAR AWAY

THROUGH THE FIELDS AND FAR AWAY JONATHAN TAYLOR I d like to thank Prof. Stephen Donkin for helping me come up with the topic of my project and also guiding me through its various complications. Contents

### Math 553 Qualifying Exam. In this test, you may assume all theorems proved in the lectures. All other claims must be proved.

Math 553 Qualifying Exam January, 2019 Ron Ji In this test, you may assume all theorems proved in the lectures. All other claims must be proved. 1. Let G be a group of order 3825 = 5 2 3 2 17. Show that

### Finite Fields. Sophie Huczynska. Semester 2, Academic Year

Finite Fields Sophie Huczynska Semester 2, Academic Year 2005-06 2 Chapter 1. Introduction Finite fields is a branch of mathematics which has come to the fore in the last 50 years due to its numerous applications,

### Chapter 11: Galois theory

Chapter 11: Galois theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 410, Spring 014 M. Macauley (Clemson) Chapter 11: Galois theory

### φ(xy) = (xy) n = x n y n = φ(x)φ(y)

Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =

### Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

### Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter

### 3 Galois Theory. 3.1 Definitions and Examples

3 Galois Theory 3.1 Definitions and Examples This section of notes roughly follows Section 14.1 in Dummit and Foote. Let F be a field and let f (x) 2 F[x]. In the previous chapter, we proved that there

### M3P11/M4P11/M5P11. Galois Theory

BSc and MSci EXAMINATIONS (MATHEMATICS) May-June 2014 This paper is also taken for the relevant examination for the Associateship of the Royal College of Science. M3P11/M4P11/M5P11 Galois Theory Date:

Algebra Qualifying Exam August 2001 Do all 5 problems. 1. Let G be afinite group of order 504 = 23 32 7. a. Show that G cannot be isomorphic to a subgroup of the alternating group Alt 7. (5 points) b.

### Automorphisms and bases

Chapter 5 Automorphisms and bases 10 Automorphisms In this chapter, we will once again adopt the viewpoint that a finite extension F = F q m of a finite field K = F q is a vector space of dimension m over

### NOTES FOR DRAGOS: MATH 210 CLASS 12, THURS. FEB. 22

NOTES FOR DRAGOS: MATH 210 CLASS 12, THURS. FEB. 22 RAVI VAKIL Hi Dragos The class is in 381-T, 1:15 2:30. This is the very end of Galois theory; you ll also start commutative ring theory. Tell them: midterm

### 18. Cyclotomic polynomials II

18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients

### Fundamental Theorem of Galois Theory. The Theorem (Dummit & Foote Version):

Fundamental Theorem of Galois Theory Introduction: Previously we worked through an example illustrating many of the components of Galois Theory including the Fundamental Theorem. Here I will state and

### Galois theory. Philippe H. Charmoy supervised by Prof Donna M. Testerman

Galois theory Philippe H. Charmoy supervised by Prof Donna M. Testerman Autumn semester 2008 Contents 0 Preliminaries 4 0.1 Soluble groups........................... 4 0.2 Field extensions...........................

### Algebra Exam Topics. Updated August 2017

Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have

### 1 Spring 2002 Galois Theory

1 Spring 2002 Galois Theory Problem 1.1. Let F 7 be the field with 7 elements and let L be the splitting field of the polynomial X 171 1 = 0 over F 7. Determine the degree of L over F 7, explaining carefully

### Galois theory (Part II)( ) Example Sheet 1

Galois theory (Part II)(2015 2016) Example Sheet 1 c.birkar@dpmms.cam.ac.uk (1) Find the minimal polynomial of 2 + 3 over Q. (2) Let K L be a finite field extension such that [L : K] is prime. Show that

### INTRODUCTION TO GALOIS THEORY. 1. Introduction and History. one of the most interesting and dramatic tales in the history of mathematics.

INTRODUCTION TO GALOIS THEORY JASON PRESZLER 1. Introduction and History The life of Évariste Galois and the historical development of polynomial solvability is one of the most interesting and dramatic

### Notes on Field Extensions

Notes on Field Extensions Ryan C. Reich 16 June 2006 1 Definitions Throughout, F K is a finite field extension. We fix once and for all an algebraic closure M for both and an embedding of F in M. When

### A BRIEF INTRODUCTION TO LOCAL FIELDS

A BRIEF INTRODUCTION TO LOCAL FIELDS TOM WESTON The purpose of these notes is to give a survey of the basic Galois theory of local fields and number fields. We cover much of the same material as [2, Chapters

### Algebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001

Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,

### Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.

Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is