COMPUTING GALOIS GROUPS WITH GENERIC RESOLVENT POLYNOMIALS
|
|
- James Lucas
- 5 years ago
- Views:
Transcription
1 COMPUTING GALOIS GROUPS WITH GENERIC RESOLVENT POLYNOMIALS JOHN KOPPER 1. Introduction Given an arbitrary irreducible polynomial f with rational coefficients it is difficult to determine the Galois group of the splitting field of that polynomial. When the roots of f are easy to calculate, there are a number of tricks that can be employed to calculate this Galois group. If the roots of f are solvable by radicals, for example, it is often easy to calculate by hand the Q-fixing automorphisms of Q that permute the roots of f. In the general case, though, this calculation can be very difficult. Indeed one hopes for an algorithm for computing Galois groups using only the coefficients of the given polynomial. Such algorithms exist; in these notes we will examine one developed by Staduhar [3] and Soicher-McKay[5]. In Section 2 we will describe the algorithm in full generality. Sections 3-5 deal with particular cases and have many examples of the relevant computations. The appendix describes methods of performing the computations in Mathematica. For the purposes of this document we will usually assume our fields have characteristic 0 unless we make an explicit exception. In fact, little will be lost by assuming all fields are extensions of Q. If f k[x] is an irreducible polynomial, we use the phrase the Galois group of f to refer to the Galois group of the extension F/k, where F is the splitting field of f. We will use the shorthand x to mean the ordered n-tuple (x 1,..., x n ). Hopefully the number n will be clear from context. We will get a lot of mileage out of the following standard theorem from algebra: Theorem 1.1. If k is a field and f k[x] an irreducible polynomial of degree n then the Galois group of f is a transitive subgroup of the symmetric group S n. As a final caution, we will engage in the surprisingly common abuse of language in which we will call the Galois group G of a polynomial a subgroup of H for some group H any time G is isomorphic to a subgroup of H. This is worth thinking about in the context of Galois theory. Indeed if f = (x r 1 ) (x r n ) with the r i k then the Galois group of f is some subgroup of S n which acts on the roots r i by permuting the indices. A different choice of labeling the roots of f yields a conjugate subgroup of S n ; we can therefore only make distinctions up to conjugacy. This fact weakens, for example, the conclusion of Theorem Generic resolvent polynomials Let k be a field and k(x 1, x 2,..., x n ) = k(x) (i.e. the field of rational functions in n variables). Consider the polynomial P n (t) = (t x 1 )(t x 2 ) (t x n ) = t n x i t n ( 1) n x i. 1
2 2 JOHN KOPPER Definition 2.1. The coefficients of P n (t) are called the elementary symmetric functions and are denoted s 1,..., s n so that P n (x) = t n + s 1 (x 1,..., x n )t n ( 1) n s n (x 1,..., x n ). Lemma 2.2. The extension k(s) = k(s 1,..., s n ) k(x) is finite and Galois with Galois group S n Notice that the action of the Galois group S n = Gal(k(x 1,..., x n )/k(s 1,..., s n )) is precisely what you would expect it to be. That is, if σ is an automorphism of F which fixes K, then σ(a 0 + a 1 x a n x n ) = a 0 + a 1 x σ(1) + + a n x σ(n). where a 0,..., a n K. Suppose now H S n is a subgroup. Then the elements of F fixed by H form a finite separable extension of K with Galois group H (as a consequence of basic Galois theory). Lemma 2.3. If K F is a finite separable extension, then F = K(α) for some α F. Applying this to our situation, we get some α F = k(x 1,..., x n ) with k(x 1,..., x n ) = k(s 1,..., s n )(α). Definition 2.4. The element α above is called the generic resolvent for H. Suppose now we have an irreducible separable polynomial f k[x]. Then in the algebraic closure of k we may write f(x) = (x r 1 )(x r 2 ) (x r n ) where r 1,..., r n are the (distinct) roots of f(x). Then the coefficients of f(x) are given by symmetric functions on the r i. This is a trivial but crucial remark so it bears repeating: the coefficients of f are elementary symmetric polynomials in its roots. Explicitly, if f(x) = x n + a n 1 x n a 0 then a i = s i (r 1,..., r n ). Let H be a subgroup of S n and let α be the generic resolvent for H. Then α has a minimal polynomial m α whose coefficients are in k(s 1,..., s n ). That is, the coefficients of m α are polynomials in k and the elementary symmetric functions. Thus if we evaluate the symmetric functions at r 1,..., r n we obtain a polynomial m k[x] (recall that s i (r 1,..., r n ) = a i k). Let us study the roots of m α. This is the minimal polynomial of α k(x 1,..., x n ) over the field k(s 1,..., s n ). Since α generates the fixed field of H, we have σ S n fixes α if and only if σ H. The roots of m α are precisely the Galois conjugates of α. Here s the point: Theorem 2.5. With notation as above, the polynomial m has a root in k if and only if the Galois group of f is contained in a conjugate of H in S n. Proof. Suppose the Galois group of f is contained in a conjugate σhσ 1 of H. Then the Galois group of f fixes σα(r 1,..., r n ), hence σα(r) k. Thus σα(r) is a k-rational root of m. Conversely if m has a root β k then β = σα(r 1,..., r n ) for some σ. Further, β is fixed by every element of the Galois group. But by design α is fixed only by H, so the Galois group is contained in σhσ 1. This theorem gives a wonderful tool to work with, but is not constructive. The next proposition shows that it is not difficult to construct polynomials with the property described in Theorem 2.5. However, it can be difficult to construct useful
3 COMPUTING GALOIS GROUPS WITH GENERIC RESOLVENT POLYNOMIALS 3 polynomials whose coefficients are easy to compute. Ultimately, we care about finding polynomials that satisfy the properties of the theorem and aren t particularly concerned with whether the are the minimal polynomials of a primitive element. Definition 2.6. Let f k[x] be an irreducible, separable polynomial. Let r 1,... r n be the roots of f in its splitting field. Let H be a subgroup of the symmetric group S n. Then a polynomial R H k[x] is called a resolvent polynomial for the group H if R H has a root in k if and only if the Galois group of f is contained in H. As we mentioned, coming up with useful resolvent polynomials can be difficult. It can, though, always be done. Proposition 2.7. Given a subgroup H S n, define θ H = σ H x 1 x 2 2 x n n. Let R H k(s)[x] be the k(s)-minimal polynomial of θ H. Let σ 1,..., σ r be representatives of the (right) cosets of H in S n. Then R H (t) = r (t σ i (θ H )). i=1 Further, if f k[x] is a degree n irreducible separable polynomial with roots r 1,..., r n then the specialization of R H to the r i is a resolvent polynomial for the group H. Proof. See [3]. Generically, R H has degree [S n : H] and involves computing some very long products. In Sections 4 and 5 we will show some more usable resolvent polynomials whose roots contain a small number of sums. 3. Discriminants Perhaps the most important invariant of any polynomial is its discriminant. In this section we will construct the discriminant and show that it is a resolvent of the alternating group. This will give us an easy way to detect when the Galois group of a polynomial is contained in A n. Definition 3.1. Let k be a field of characteristic not 2, and let f k[x] a separable polynomial. If the roots of f in the algebraic closure of k are r 1,..., r n, then let = (r i r j ). 1 i<j n The discriminant of f is defined to be D = 2. The discriminant polynomial of f is the polynomial x 2 D. Proposition 3.2. With notation as in the definition (and char k 2), (i) The polynomial x 2 D is in k[x] (ii) An element σ S n fixes if and only if σ S n.
4 4 JOHN KOPPER Proof. Any permutation of fixes it up to sign, thus every permutation fixes D = 2. Thus D is in the fixed field of the Galois group of f, i.e. D k. This gives (i). Further, if σ S n then σ = (r σ(i) r σ(j) ) = ( 1) σ (r i r j ). 1 i<j n Since ( 1) σ = 1 if and only if σ A n, (ii) follows. 1 i<j n The proposition shows that the discriminant is always a resolvent for the alternating group. We won t go into detail here, but the discriminant can be computed quite easily (both from a computer science standpoint and an emotional standpoint). In fact it can be easily computed from the determinant of a particular matrix. See [4, p. 621]. The discriminant is of particular strength when considering polynomials of degree 3. Indeed, the only transitive subgroups of S 3 are S 3 and A 3 = Z/3Z. We can therefore use the discriminant to compute the Galois group of a cubic. Proposition 3.3. Let k be a field with char k 2, and let f be an irreducible cubic polynomial in k[x]. Then f has Galois group S 3 if and only if its discriminant polynomial x 2 D is irreducible over k, if and only if D is not a square in k. Otherwise, the Galois group of f is A 3. Example 3.4. Let f(x) = x 3 + 3x + 1. Notice this is irreducible because it has no integer roots, hence no roots, hence cannot be factored. Its discriminant is D = 135 which is not a square, hence the Galois group of f is S n. Another nice use of the discriminant is in determining when a polynomial is not solvable by radicals. It is a standard result from field theory that a polynomial is solvable by radicals if and only if its Galois group is a solvable group. Since A n is simple for n 5 we have a criterion for non-solvability by radicals. Proposition 3.5. Suppose f Q[x] is a polynomial of degree n 5. Suppose further that the discriminant of f is a square in Q. Then f is not solvable by radicals. In Section 5 we will see a (much) better way of detecting solvability of quintics. 4. Quartics Recall that the Galois group of a degree d polynomial must be a transitive subgroup of the symmetric group S d. In this section we study quartic polynomials, and our first task is to enumerate the transitive subgroups of S 4. They are, up to isomorphism: Name Order Number of conjugates Contained in A 4 S No A Yes D No Z/2Z Z/2Z 4 4 Yes Z/4Z 4 3 No In Section 3 we saw that the discriminant R A4 (x) = x 2 D is a resolvent polynomial for A 4 in S 4. The next transitive subgroup we ll consider is the dihedral group
5 COMPUTING GALOIS GROUPS WITH GENERIC RESOLVENT POLYNOMIALS 5 D 8 = (1234), (13). The resolvent polynomial should have order 24/8 = 3. It is not hard to guess that α(x 1, x 2, x 3, x 4 ) = x 1 x 3 + x 2 x 4 is a resolvent for D 8. The Galois conjugates of this are the other possible permutations under the action of S 4 : β = x 1 x 2 + x 3 x 4 γ = x 1 x 4 + x 2 x 3. Notice that β and γ correspond to the resolvents for the other copies of D 8 in S 4. It is not difficult to show (cf. [2, p. 5]) that if f(x) = x 4 + ax 3 + bx 2 + cx + d with roots r 1, r 2, r 3, r 4 then: R D8 (x) = (x (r 1 r 2 + r 3 r 4 ))(x (r 1 r 3 + r 2 r 4 ))(x (r 1 r 4 + r2r 3 )) = x 3 b 2 x + (ac 4d)x (a 2 d + c 2 4bd). Let s try our hand with a few examples. Example 4.1. Let f(x) = x 4 + 2x + 2 over the field Q. Certainly f is irreducible by Eisenstein s Criterion. We compute our resolvents: R A4 (x) = x R D8 (x) = x 3 8x 4. Since 1616 is not a square, we conclude that the Galois group of f is not contained in A n. Since R D8 has no rational root, the Galois group is not contained in D 8. This leaves us still with a number of possibilities. However, since R D8 is irreducible (it has no integer roots, hence no rational ones), its splitting field is a Galois subextension of the splitting field of f. Since R D8 has degree 3, we conclude that the Galois group of f is divisible by 3. Thus f must have Galois group S 4. Example 4.2. Let f(x) = x 4 +8x+12 over the field Q. We compute our resolvents: R A4 (x) = x = x R D8 (x) = x 3 48x 64. Since is a square, we conclude that the Galois group of f is contained in A n. A similar analysis as above shows that the Galois group of f must be divisible by 3, hence must be A 4. Example 4.3. It is worth noting that the D 8 resolvent doesn t do everything for us. Let f(x) = x 4 6x over the field Q. This is irreducible because f(x+1) = x 4 +4x 3 8x+2 is irreducible by Eisenstein s Criterion. The resolvents: R A4 (x) = x R D8 (x) = x 3 + 6x 2 28x 168. In this case, R A4 has no rational root but R D8 does. Thus the Galois group of f is contained in D 8. In fact, R D8 (x) = x 3 + 6x 2 28x 168 = (x + 6)(x 2 28). This clearly only has one root in Q. Recalling our construction of R D8, we see that all three generic roots α, β, γ are fixed by Z/2Z Z/2Z. Thus the Galois group of f is a subgroup of D 8 not equal to Z/2Z Z/2Z, hence is either D 8 or Z/4Z. We are now in need of more machinery. We could either define a resolvent for Z/4Z (hard), or use some more elementary machinery, e.g. [4, p. 615].
6 6 JOHN KOPPER We won t work out the entire calculation here, but it s interesting to see how quickly things get out of hand. Fortunately, we don t need a polynomial quite as bad as the one constructed in Proposition 2.7. For example, we may use θ Z/4Z = x 1 x x 2 x x 3 x x 4 x 2 1 ([3]) as a resolvent for the subgroup Z/4Z. Computing the corresponding polynomial in terms of symmetric functions is an appropriate use of Mathematica. Indeed if our quartic is given by f(x) = x 4 + ax 3 + bx 2 + cx + d then the constant term of the resolvent polynomial is: a 10 d 2 11a 8 bd 2 2a 8 c 2 d + a 7 b 2 cd + 15a 7 cd a 6 b 2 d a 6 bc 2 d + a 6 c 4 5a 6 d 3 12a 5 b 3 cd 133a 5 bcd 2 22a 5 c 3 d + a 4 b 5 d 76a 4 b 3 d 2 6a 4 b 2 c 2 d 12a 4 bc a 4 bd a 4 c 2 d a 3 b 4 cd + 2a 3 b 3 c a 3 b 2 cd a 3 bc 3 d + 16a 3 c 5 48a 3 cd 3 4a 2 b 6 d + 32a 2 b 4 d 2 134a 2 b 3 c 2 d + 36a 2 b 2 c 4 64a 2 b 2 d 3 648a 2 bc 2 d 2 48a 2 c 4 d + 16ab 5 cd 12ab 4 c 3 128ab 3 cd ab 2 c 3 d 96abc abcd ac 3 d 2 + b 6 c 2 28b 4 c 2 d + 16b 3 c b 2 c 2 d 2 224bc 4 d + 64c 6 320c 2 d 3. Needless to say, it is not very instructive to try to compute these things by hand. See the Appendix for details on this computation. Staduhar [3] provides a nice table of resolvents for a great many transitive subgroups of S n for n = 4, 5, 6, 7. Incidentally, the Galois group of x 4 6x is D 8, though this can be seen by more direct methods. 5. Quintics Our Pavlovian response drives us to first list all transitive subgroups of S 5 : Name Order Contained in A 5 S No A 5 60 Yes F No D Yes Z/5Z 5 Yes The group F 20 is sometimes referred to as the Frobenius group. This particular group has an important feature: Theorem 5.1. An irreducible polynomial f of degree 5 is solvable by radicals if and only if its Galois group is contained in the Frobenius group F 20. A consequence of Theorem 5.1 is a method of detecting solvable quintics: we need only produce a resolvent polynomial for the group F 20 and determine whether it has a root in k. Of course, our general construction doesn t offer a very useful resolvent polynomial (if you read Example 4.3 you don t need to be convinced of this). Dummit [1] has a remarkably simple resolvent for F 20. Let θ =x 2 1x 2 x 5 + x 2 1x 3 x 4 + x 2 2x 1 x 3 + x 2 2x 4 x 5 + x 2 3x 1 x 5 + x 2 3x 2 x 4 + x 2 4x 1 x 2 + x 2 4x 3 x 5 + x 2 5x 1 x 4 + x 2 5x 2 x 3,
7 COMPUTING GALOIS GROUPS WITH GENERIC RESOLVENT POLYNOMIALS 7 then the stabilizer of θ is evidently F 20. This resolvent has a much more usable minimal polynomial. In fact, if f(x) = x 5 + ax + b then the resolvent polynomial simplifies to R F20 (x) =x 6 + 8ax a 2 x a 3 x a 4 x 2 + (512a b 4 )x + (256a 6 937ab 4 ). Appendix A. Doing These Things in Mathematica The techniques we ve described obviously generalize to allow one to detect solvable polynomials of arbitrary degree. Of course, the computational complexity increases quite quickly (what are the solvable subgroups of S 118?) The curious reader should read [6] to see solvable sextics. The adventurous reader should try the case n = 7. W conclude by providing the reader with a brief overview of one of many ways to carry out these computations in practice. Most of our computations, including those of Example 4.3, were performed in Mathematica. Here s a couple of useful commands: Permute[expr, perm] Applies a permutation to the given expression. SymmetricReduction[f, {x1, x2,...,xn}, {s1, s2,...,sn}] Writes the polynomial f in terms of symmetric functions in the variables x1, x2,..., xn (and labels the symmetric functions s1, s2,..., sn). TeXForm[expr] Puts the expression into a format your TeX compiler can parse. In order to apply permutations to a given polynomial, I used the following homebrewed command (thanks to StackExchange user Daniel Lichtblau [7]): groupelementaction[expr_, vars_, perm_] /; Length[perm] == Length[vars] && PermutationListQ[perm] := expr /. Thread[vars -> Permute[vars, perm]] References [1] D. S. Dummit. Solving Solvable Quintics. Mathematics of Computation. Vol. 57, No. 195 (Jul., 1991). [2] K. Conrad. Galois Groups of Cubics and Quartics (Not in Characteristic 2). [3] R. P. Staduhar. The Determination of Galois Groups. Mathematics of Computation. Vol. 27, No. 124 (Oct., 1973). [4] Dummit and Foote [5] L. Soicher and J. McKay. Computing Galois Groups Over the Rationals. Journal of Number Theory. Vol. 20, Issue 3 (Jun., 1985). [6] C. Boswell and M. L. Glasser. Solvable Sextic Equations. arxiv:math-ph/ , [7]
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over
More informationdisc f R 3 (X) in K[X] G f in K irreducible S 4 = in K irreducible A 4 in K reducible D 4 or Z/4Z = in K reducible V Table 1
GALOIS GROUPS OF CUBICS AND QUARTICS IN ALL CHARACTERISTICS KEITH CONRAD 1. Introduction Treatments of Galois groups of cubic and quartic polynomials usually avoid fields of characteristic 2. Here we will
More information1 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
More informationSOLVING SOLVABLE QUINTICS. D. S. Dummit
D. S. Dummit Abstract. Let f(x) = x 5 + px 3 + qx + rx + s be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if
More informationALGORITHMS FOR COMPUTING QUARTIC GALOIS GROUPS OVER FIELDS OF CHARACTERISTIC 0
ALGORITHMS FOR COMPUTING QUARTIC GALOIS GROUPS OVER FIELDS OF CHARACTERISTIC 0 CHAD AWTREY, JAMES BEUERLE, AND MICHAEL KEENAN Abstract. Let f(x) beanirreducibledegreefourpolynomialdefinedover afieldf and
More informationGalois Theory Overview/Example Part 1: Extension Fields. Overview:
Galois Theory Overview/Example Part 1: Extension Fields I ll start by outlining very generally the way Galois theory works. Then, I will work through an example that will illustrate the Fundamental Theorem
More informationSymmetries and Polynomials
Symmetries and Polynomials Aaron Landesman and Apurva Nakade June 30, 2018 Introduction In this class we ll learn how to solve a cubic. We ll also sketch how to solve a quartic. We ll explore the connections
More informationImplementation of Theorems in D.S. Dummit s Solving Solvable Quintics(1991)
Implementation of Theorems in D.S. Dummit s Solving Solvable Quintics(1991) Matthew Moore June 0, 005 Abstract In D.S. Dummit s 1991 paper, Solving Solvable Quintics, two theorems are introduced. The first
More informationMath 121. Fundamental Theorem and an example
Math 121. Fundamental Theorem and an example Let K/k be a finite Galois extension and G = Gal(K/k), so #G = [K : k] by the counting criterion for separability discussed in class. In this handout we will
More informationMAT 535 Problem Set 5 Solutions
Final Exam, Tues 5/11, :15pm-4:45pm Spring 010 MAT 535 Problem Set 5 Solutions Selected Problems (1) Exercise 9, p 617 Determine the Galois group of the splitting field E over F = Q of the polynomial f(x)
More informationGALOIS THEORY: LECTURE 20
GALOIS THEORY: LECTURE 0 LEO GOLDMAKHER. REVIEW: THE FUNDAMENTAL LEMMA We begin today s lecture by recalling the Fundamental Lemma introduced at the end of Lecture 9. This will come up in several places
More informationOverview: The short answer is no because there are 5 th degree polynomials whose Galois group is isomorphic to S5 which is not a solvable group.
Galois Theory Overview/Example Part 2: Galois Group and Fixed Fields I ll repeat the overview because it explains what I m doing with the example. Then I ll move on the second part of the example where
More informationABSTRACT INVESTIGATION INTO SOLVABLE QUINTICS. Professor Lawrence C. Washington Department of Mathematics
ABSTRACT Title of thesis: INVESTIGATION INTO SOLVABLE QUINTICS Maria-Victoria Checa, Master of Science, 2004 Thesis directed by: Professor Lawrence C. Washington Department of Mathematics Solving quintics
More informationGALOIS GROUPS AS PERMUTATION GROUPS
GALOIS GROUPS AS PERMUTATION GROUPS KEITH CONRAD 1. Introduction A Galois group is a group of field automorphisms under composition. By looking at the effect of a Galois group on field generators we can
More informationÈvariste Galois and the resolution of equations by radicals
Èvariste Galois and the resolution of equations by radicals A Math Club Event Department of Mathematical Sciences Florida Atlantic University Boca Raton, FL 33431 November 9, 2012 Outline 1 The Problem
More informationTheorems and Algorithms Associated with Solving the General Quintic
Theorems and Algorithms Associated with Solving the General Quintic Matthew Moore August 7, 005 Abstract This paper addresses two published works: D.S. Dummit s 1991 paper, Solving Solvable Quintics and
More informationChapter 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
More informationPart 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)
More informationRECOGNIZING GALOIS GROUPS S n AND A n
RECOGNIZING GALOIS GROUPS S n AND A n KEITH CONRAD 1. Introduction If f(x) K[X] is a separable irreducible polynomial of degree n and G f is its Galois group over K (the Galois group of the splitting field
More informationPart 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
More informationEFFICIENT COMPUTATION OF GALOIS GROUPS OF EVEN SEXTIC POLYNOMIALS
EFFICIENT COMPUTATION OF GALOIS GROUPS OF EVEN SEXTIC POLYNOMIALS CHAD AWTREY AND PETER JAKES Abstract. Let f(x) =x 6 + ax 4 + bx 2 + c be an irreducible sextic polynomial with coe cients from a field
More informationA 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
More informationMath 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.
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationGalois Theory and Some Applications
Galois Theory and Some Applications Aparna Ramesh July 19, 2015 Introduction In this project, we study Galois theory and discuss some applications. The theory of equations and the ancient Greek problems
More informationTheorem 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
More informationThe 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
More informationFields 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
More informationIRREDUCIBLE SEXTIC POLYNOMIALS AND THEIR ABSOLUTE RESOLVENTS
IRREDUCIBLE SEXTIC POLYNOMIALS AND THEIR ABSOLUTE RESOLVENTS CHAD AWTREY, ROBIN FRENCH, PETER JAKES, AND ALAN RUSSELL Abstract. We describe two new algorithms for determining the Galois group of an irreducible
More informationGalois 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
More informationMath 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).
More informationALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.
ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. KEVIN MCGERTY. 1. RINGS The central characters of this course are algebraic objects known as rings. A ring is any mathematical structure where you can add
More informationarxiv: 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
More informationComputing the Galois group of a polynomial
Computing the Galois group of a polynomial Curtis Bright April 15, 2013 Abstract This article outlines techniques for computing the Galois group of a polynomial over the rationals, an important operation
More informationFundamental 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
More informationMATH 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
More informationOn a Sequence of Nonsolvable Quintic Polynomials
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 1 (009), Article 09..8 On a Sequence of Nonsolvable Quintic Polynomials Jennifer A. Johnstone and Blair K. Spearman 1 Mathematics and Statistics University
More informationDetermining the Galois group of a rational polynomial
JAH 1 Determining the Galois group of a rational polynomial Alexander Hulpke Department of Mathematics Colorado State University Fort Collins, CO, 80523 hulpke@math.colostate.edu http://www.math.colostate.edu/
More informationPartial Fractions. June 27, In this section, we will learn to integrate another class of functions: the rational functions.
Partial Fractions June 7, 04 In this section, we will learn to integrate another class of functions: the rational functions. Definition. A rational function is a fraction of two polynomials. For example,
More information1 Separability and splitting fields
Supplementary field theory notes E/F is a finite field extension throughout. We also fix an algebraic closure F in which all our extensions live, although it will rarely be explicitly mentioned. Further
More information1. 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
More informationGalois 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
More informationRUDIMENTARY GALOIS THEORY
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
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationALGEBRA HW 9 CLAY SHONKWILER
ALGEBRA HW 9 CLAY SHONKWILER 1 Let F = Z/pZ, let L = F (x, y) and let K = F (x p, y p ). Show that L is a finite field extension of K, but that there are infinitely many fields between K and L. Is L =
More informationNOTES 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
More informationMATH 115, SUMMER 2012 LECTURE 12
MATH 115, SUMMER 2012 LECTURE 12 JAMES MCIVOR - last time - we used hensel s lemma to go from roots of polynomial equations mod p to roots mod p 2, mod p 3, etc. - from there we can use CRT to construct
More informationSolutions 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
More informationSelected exercises from Abstract Algebra by Dummit and Foote (3rd edition).
Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 14.2 Exercise 3. Determine the Galois group of (x 2 2)(x 2 3)(x 2 5). Determine all the subfields
More informationLecture 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
More informationARNOLD S ELEMENTARY PROOF OF THE INSOLVABILITY OF THE QUINTIC
ARNOLD S ELEMENTARY PROOF OF THE INSOLVABILITY OF THE QUINTIC LEO GOLDMAKHER ABSTRACT. We give a proof (due to Arnold) that there is no quintic formula. Somewhat more precisely, we show that any finite
More informationFIELD 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
More information1 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
More informationDETERMINING GALOIS GROUPS OF REDUCIBLE POLYNOMIALS VIA DISCRIMINANTS AND LINEAR RESOLVENTS
DETERMINING GALOIS GROUPS OF REDUCIBLE POLYNOMIALS VIA DISCRIMINANTS AND LINEAR RESOLVENTS CHAD AWTREY, TAYLOR CESARSKI, AND PETER JAKES Abstract. Let f(x) beapolynomialwithintegercoe cients of degree
More informationField 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
More informationExtension 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
More informationAM 106/206: Applied Algebra Madhu Sudan 1. Lecture Notes 11
AM 106/206: Applied Algebra Madhu Sudan 1 Lecture Notes 11 October 17, 2016 Reading: Gallian Chapters 9 & 10 1 Normal Subgroups Motivation: Recall that the cosets of nz in Z (a+nz) are the same as the
More information8.6 Partial Fraction Decomposition
628 Systems of Equations and Matrices 8.6 Partial Fraction Decomposition This section uses systems of linear equations to rewrite rational functions in a form more palatable to Calculus students. In College
More informationJean-Pierre Escofier. Galois Theory. Translated by Leila Schneps. With 48 Illustrations. Springer
Jean-Pierre Escofier Galois Theory Translated by Leila Schneps With 48 Illustrations Springer Preface v 1 Historical Aspects of the Resolution of Algebraic Equations 1 1.1 Approximating the Roots of an
More informationSOME FIFTH ROOTS THAT ARE CONSTRUCTIBLE BY MARKED RULER AND COMPASS
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 3, 2016 SOME FIFTH ROOTS THAT ARE CONSTRUCTIBLE BY MARKED RULER AND COMPASS ELLIOT BENJAMIN AND C. SNYDER ABSTRACT. We show that there are cubic
More informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationGALOIS THEORY: LECTURE 24
GALOIS THEORY: LECTURE 4 LEO GOLDMAKHER 1. CONSTRUCTING FINITE FIELDS Although most of the semester we stated and proved theorems about general field extensions L/K, in practice we ve barely touched the
More informationIsomorphisms and Well-definedness
Isomorphisms and Well-definedness Jonathan Love October 30, 2016 Suppose you want to show that two groups G and H are isomorphic. There are a couple of ways to go about doing this depending on the situation,
More information22M: 121 Final Exam. Answer any three in this section. Each question is worth 10 points.
22M: 121 Final Exam This is 2 hour exam. Begin each question on a new sheet of paper. All notations are standard and the ones used in class. Please write clearly and provide all details of your work. Good
More informationNOTES 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
More informationSolutions for Problem Set 6
Solutions for Problem Set 6 A: Find all subfields of Q(ζ 8 ). SOLUTION. All subfields of K must automatically contain Q. Thus, this problem concerns the intermediate fields for the extension K/Q. In a
More informationPage 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
More informationNotes 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
More informationCDM. Recurrences and Fibonacci
CDM Recurrences and Fibonacci Klaus Sutner Carnegie Mellon University 20-fibonacci 2017/12/15 23:16 1 Recurrence Equations Second Order The Fibonacci Monoid Recurrence Equations 3 We can define a sequence
More informationMathematical Focus 1 Complex numbers adhere to certain arithmetic properties for which they and their complex conjugates are defined.
Situation: Complex Roots in Conjugate Pairs Prepared at University of Georgia Center for Proficiency in Teaching Mathematics June 30, 2013 Sarah Major Prompt: A teacher in a high school Algebra class has
More informationAlgebra SEP Solutions
Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since
More informationCDM. Recurrences and Fibonacci. 20-fibonacci 2017/12/15 23:16. Terminology 4. Recurrence Equations 3. Solution and Asymptotics 6.
CDM Recurrences and Fibonacci 1 Recurrence Equations Klaus Sutner Carnegie Mellon University Second Order 20-fibonacci 2017/12/15 23:16 The Fibonacci Monoid Recurrence Equations 3 Terminology 4 We can
More informationKeywords and phrases: Fundamental theorem of algebra, constructible
Lecture 16 : Applications and Illustrations of the FTGT Objectives (1) Fundamental theorem of algebra via FTGT. (2) Gauss criterion for constructible regular polygons. (3) Symmetric rational functions.
More informationAN 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
More informationChapter V. Solvability by Radicals
Matematisk Institut Mat 3AL 5.1 Chapter V. Solvability by Radicals One of the oldest problems in algebra was to find roots of an equation. Already in the antiquity solutions of quadratic equations were
More informationYale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions
Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall 2015 Midterm Exam Review Solutions Practice exam questions: 1. Let V 1 R 2 be the subset of all vectors whose slope
More informationResultants, Resolvents and the Computation of Galois Groups
Resultants, Resolvents and the Computation of Galois Groups Alexander D. Healy ahealy@fas.harvard.edu Abstract We will develop the machinery of resultants and resolvent polynomials with the ultimate goal
More informationGalois 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
More informationSchool 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
More information22. Galois theory. G = Gal(L/k) = Aut(L/k) [L : K] = H. Gal(K/k) G/H
22. Galois theory 22.1 Field extensions, imbeddings, automorphisms 22.2 Separable field extensions 22.3 Primitive elements 22.4 Normal field extensions 22.5 The main theorem 22.6 Conjugates, trace, norm
More informationInsolvability of the Quintic (Fraleigh Section 56 Last one in the book!)
Insolvability of the Quintic (Fraleigh Section 56 Last one in the book!) [I m sticking to Freleigh on this one except that this will be a combination of part of the section and part of the exercises because
More informationALGEBRA 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
More informationbut 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
More informationbe 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
More informationProblems in Algebra. 2 4ac. 2a
Problems in Algebra Section Polynomial Equations For a polynomial equation P (x) = c 0 x n + c 1 x n 1 + + c n = 0, where c 0, c 1,, c n are complex numbers, we know from the Fundamental Theorem of Algebra
More informationHomework 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
More informationPractice problems for first midterm, Spring 98
Practice problems for first midterm, Spring 98 midterm to be held Wednesday, February 25, 1998, in class Dave Bayer, Modern Algebra All rings are assumed to be commutative with identity, as in our text.
More informationPractice Algebra Qualifying Exam Solutions
Practice Algebra Qualifying Exam Solutions 1. Let A be an n n matrix with complex coefficients. Define tr A to be the sum of the diagonal elements. Show that tr A is invariant under conjugation, i.e.,
More informationA Harvard Sampler. Evan Chen. February 23, I crashed a few math classes at Harvard on February 21, Here are notes from the classes.
A Harvard Sampler Evan Chen February 23, 2014 I crashed a few math classes at Harvard on February 21, 2014. Here are notes from the classes. 1 MATH 123: Algebra II In this lecture we will make two assumptions.
More informationSTEP Support Programme. Hints and Partial Solutions for Assignment 17
STEP Support Programme Hints and Partial Solutions for Assignment 7 Warm-up You need to be quite careful with these proofs to ensure that you are not assuming something that should not be assumed. For
More informationA linear resolvent for degree 14 polynomials
A linear resolvent for degree 14 polynomials Chad Awtrey and Erin Strosnider Abstract We discuss the construction and factorization pattern of a linear resolvent polynomial that is useful for computing
More informationCDM. Finite Fields. Klaus Sutner Carnegie Mellon University. Fall 2018
CDM Finite Fields Klaus Sutner Carnegie Mellon University Fall 2018 1 Ideals The Structure theorem Where Are We? 3 We know that every finite field carries two apparently separate structures: additive and
More information3 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
More informationAlgebra Ph.D. Preliminary Exam
RETURN THIS COVER SHEET WITH YOUR EXAM AND SOLUTIONS! Algebra Ph.D. Preliminary Exam August 18, 2008 INSTRUCTIONS: 1. Answer each question on a separate page. Turn in a page for each problem even if you
More informationGalois 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
More informationLecture 6.6: The fundamental theorem of Galois theory
Lecture 6.6: The fundamental theorem of Galois theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 410, Modern Algebra M. Macauley
More informationComputing complete lists of Artin representations given a group, character, and conductor bound
Computing complete lists of Artin representations given a group, character, and conductor bound John Jones Joint work with David Roberts 7/27/15 Computing Artin Representations John Jones SoMSS 1 / 21
More informationGALOIS 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.
More informationOCTIC 2-ADIC FIELDS JOHN W. JONES AND DAVID P. ROBERTS
OCTIC 2-ADIC FIELDS JOHN W. JONES AND DAVID P. ROBERTS Abstract. We compute all octic extensions of Q 2 and find that there are 1823 of them up to isomorphism. We compute the associated Galois group of
More informationChapter Five Notes N P U2C5
Chapter Five Notes N P UC5 Name Period Section 5.: Linear and Quadratic Functions with Modeling In every math class you have had since algebra you have worked with equations. Most of those equations have
More information