Galois Theory
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
APPLICATIONS of GALOIS THEORY 1. Finite Fields Let F Be a Finite Field
CHAPTER IX APPLICATIONS OF GALOIS THEORY 1. Finite Fields Let F be a finite field. It is necessarily of nonzero characteristic p and its prime field is the field with p r elements Fp.SinceFis a vector space over Fp,itmusthaveq=p elements where r =[F :Fp]. More generally, if E ⊇ F are both finite, then E has qd elements where d =[E:F]. As we mentioned earlier, the multiplicative group F ∗ of F is cyclic (because it is a finite subgroup of the multiplicative group of a field), and clearly its order is q − 1. Hence each non-zero element of F is a root of the polynomial Xq−1 − 1. Since 0 is the only root of the polynomial X, it follows that the q elements of F are roots of the polynomial Xq − X = X(Xq−1 − 1). Hence, that polynomial is separable and F consists of the set of its roots. (You can also see that it must be separable by finding its derivative which is −1.) We q may now conclude that the finite field F is the splitting field over Fp of the separable polynomial X − X where q = |F |. In particular, it is unique up to isomorphism. We have proved the first part of the following result. Proposition. Let p be a prime. For each q = pr, there is a unique (up to isomorphism) finite field F with |F | = q. Proof. We have already proved the uniqueness. Suppose q = pr, and consider the polynomial Xq − X ∈ Fp[X]. As mentioned above Df(X)=−1sof(X) cannot have any repeated roots in any extension, i.e. -
MATH5725 Lecture Notes∗ Typed by Charles Qin October 2007
MATH5725 Lecture Notes∗ Typed By Charles Qin October 2007 1 Genesis Of Galois Theory Definition 1.1 (Radical Extension). A field extension K/F is radical if there is a tower of ri field extensions F = F0 ⊆ F1 ⊆ F2 ⊆ ... ⊆ Fn = K where Fi+1 = Fi(αi), αi ∈ Fi for some + ri ∈ Z . 2 Splitting Fields Proposition-Definition 2.1 (Field Homomorphism). A map of fields σ : F −→ F 0 is a field homomorphism if it is a ring homomorphism. We also have: (i) σ is injective (ii) σ[x]: F [x] −→ F 0[x] is a ring homomorphism where n n X i X i σ[x]( fix ) = σ(fi)x i=1 i=1 Proposition 2.1. K = F [x]/hp(x)i is a field extension of F via composite ring homomor- phism F,−→ F [x] −→ F [x]/hp(x)i. Also K = F (α) where α = x + hp(x)i is a root of p(x). Proposition 2.2. Let σ : F −→ F 0 be a field isomorphism (a bijective field homomorphism). Let p(x) ∈ F [x] be irreducible. Let α and α0 be roots of p(x) and (σp)(x) respectively (in appropriate field extensions). Then there is a field extensionσ ˜ : F (α) −→ F 0(α0) such that: (i)σ ˜ extends σ, i.e.σ ˜|F = σ (ii)σ ˜(α) = α0 Definition 2.1 (Splitting Field). Let F be a field and f(x) ∈ F [x]. A field extension K/F is a splitting field for f(x) over F if: ∗The following notes were based on Dr Daniel Chan’s MATH5725 lectures in semester 2, 2007 1 (i) f(x) factors into linear polynomials over K (ii) K = F (α1, α2, . -
Lecture Notes in Galois Theory
Lecture Notes in Galois Theory Lectures by Dr Sheng-Chi Liu Throughout these notes, signifies end proof, and N signifies end of example. Table of Contents Table of Contents i Lecture 1 Review of Group Theory 1 1.1 Groups . 1 1.2 Structure of cyclic groups . 2 1.3 Permutation groups . 2 1.4 Finitely generated abelian groups . 3 1.5 Group actions . 3 Lecture 2 Group Actions and Sylow Theorems 5 2.1 p-Groups . 5 2.2 Sylow theorems . 6 Lecture 3 Review of Ring Theory 7 3.1 Rings . 7 3.2 Solutions to algebraic equations . 10 Lecture 4 Field Extensions 12 4.1 Algebraic and transcendental numbers . 12 4.2 Algebraic extensions . 13 Lecture 5 Algebraic Field Extensions 14 5.1 Minimal polynomials . 14 5.2 Composites of fields . 16 5.3 Algebraic closure . 16 Lecture 6 Algebraic Closure 17 6.1 Existence of algebraic closure . 17 Lecture 7 Field Embeddings 19 7.1 Uniqueness of algebraic closure . 19 Lecture 8 Splitting Fields 22 8.1 Lifts are not unique . 22 Notes by Jakob Streipel. Last updated December 6, 2019. i TABLE OF CONTENTS ii Lecture 9 Normal Extensions 23 9.1 Splitting fields and normal extensions . 23 Lecture 10 Separable Extension 26 10.1 Separable degree . 26 Lecture 11 Simple Extensions 26 11.1 Separable extensions . 26 11.2 Simple extensions . 29 Lecture 12 Simple Extensions, continued 30 12.1 Primitive element theorem, continued . 30 Lecture 13 Normal and Separable Closures 30 13.1 Normal closure . 31 13.2 Separable closure . 31 13.3 Finite fields . -
Determining the Galois Group of a Rational Polynomial
Determining the Galois group of a rational polynomial Alexander Hulpke Department of Mathematics Colorado State University Fort Collins, CO, 80523 [email protected] http://www.math.colostate.edu/˜hulpke JAH 1 The Task Let f Q[x] be an irreducible polynomial of degree n. 2 Then G = Gal(f) = Gal(L; Q) with L the splitting field of f over Q. Problem: Given f, determine G. WLOG: f monic, integer coefficients. JAH 2 Field Automorphisms If we want to represent automorphims explicitly, we have to represent the splitting field L For example as splitting field of a polynomial g Q[x]. 2 The factors of g over L correspond to the elements of G. Note: If deg(f) = n then deg(g) n!. ≤ In practice this degree is too big. JAH 3 Permutation type of the Galois Group Gal(f) permutes the roots α1; : : : ; αn of f: faithfully (L = Spl(f) = Q(α ; α ; : : : ; α ). • 1 2 n transitively ( (x α ) is a factor of f). • Y − i i I 2 This action gives an embedding G S . The field Q(α ) corresponds ≤ n 1 to the subgroup StabG(1). Arrangement of roots corresponds to conjugacy in Sn. We want to determine the Sn-class of G. JAH 4 Assumption We can calculate “everything” about Sn. n is small (n 20) • ≤ Can use table of transitive groups (classified up to degree 30) • We can approximate the roots of f (numerically and p-adically) JAH 5 Reduction at a prime Let p be a prime that does not divide the discriminant of f (i.e. -
Infinite Galois Theory
Infinite Galois Theory Haoran Liu May 1, 2016 1 Introduction For an finite Galois extension E/F, the fundamental theorem of Galois Theory establishes an one-to-one correspondence between the intermediate fields of E/F and the subgroups of Gal(E/F), the Galois group of the extension. With this correspondence, we can examine the the finite field extension by using the well-established group theory. Naturally, we wonder if this correspondence still holds if the Galois extension E/F is infinite. It is very tempting to assume the one-to-one correspondence still exists. Unfortu- nately, there is not necessary a correspondence between the intermediate fields of E/F and the subgroups of Gal(E/F)whenE/F is a infinite Galois extension. It will be illustrated in the following example. Example 1.1. Let F be Q,andE be the splitting field of a set of polynomials in the form of x2 p, where p is a prime number in Z+. Since each automorphism of E that fixes F − is determined by the square root of a prime, thusAut(E/F)isainfinitedimensionalvector space over F2. Since the number of homomorphisms from Aut(E/F)toF2 is uncountable, which means that there are uncountably many subgroups of Aut(E/F)withindex2.while the number of subfields of E that have degree 2 over F is countable, thus there is no bijection between the set of all subfields of E containing F and the set of all subgroups of Gal(E/F). Since a infinite Galois group Gal(E/F)normally have ”too much” subgroups, there is no subfield of E containing F can correspond to most of its subgroups. -
A Second Course in Algebraic Number Theory
A second course in Algebraic Number Theory Vlad Dockchitser Prerequisites: • Galois Theory • Representation Theory Overview: ∗ 1. Number Fields (Review, K; OK ; O ; ClK ; etc) 2. Decomposition of primes (how primes behave in eld extensions and what does Galois's do) 3. L-series (Dirichlet's Theorem on primes in arithmetic progression, Artin L-functions, Cheboterev's density theorem) 1 Number Fields 1.1 Rings of integers Denition 1.1. A number eld is a nite extension of Q Denition 1.2. An algebraic integer α is an algebraic number that satises a monic polynomial with integer coecients Denition 1.3. Let K be a number eld. It's ring of integer OK consists of the elements of K which are algebraic integers Proposition 1.4. 1. OK is a (Noetherian) Ring 2. , i.e., ∼ [K:Q] as an abelian group rkZ OK = [K : Q] OK = Z 3. Each can be written as with and α 2 K α = β=n β 2 OK n 2 Z Example. K OK Q Z ( p p [ a] a ≡ 2; 3 mod 4 ( , square free) Z p Q( a) a 2 Z n f0; 1g a 1+ a Z[ 2 ] a ≡ 1 mod 4 where is a primitive th root of unity Q(ζn) ζn n Z[ζn] Proposition 1.5. 1. OK is the maximal subring of K which is nitely generated as an abelian group 2. O`K is integrally closed - if f 2 OK [x] is monic and f(α) = 0 for some α 2 K, then α 2 OK . Example (Of Factorisation). -
GALOIS THEORY for ARBITRARY FIELD EXTENSIONS Contents 1
GALOIS THEORY FOR ARBITRARY FIELD EXTENSIONS PETE L. CLARK Contents 1. Introduction 1 1.1. Kaplansky's Galois Connection and Correspondence 1 1.2. Three flavors of Galois extensions 2 1.3. Galois theory for algebraic extensions 3 1.4. Transcendental Extensions 3 2. Galois Connections 4 2.1. The basic formalism 4 2.2. Lattice Properties 5 2.3. Examples 6 2.4. Galois Connections Decorticated (Relations) 8 2.5. Indexed Galois Connections 9 3. Galois Theory of Group Actions 11 3.1. Basic Setup 11 3.2. Normality and Stability 11 3.3. The J -topology and the K-topology 12 4. Return to the Galois Correspondence for Field Extensions 15 4.1. The Artinian Perspective 15 4.2. The Index Calculus 17 4.3. Normality and Stability:::and Normality 18 4.4. Finite Galois Extensions 18 4.5. Algebraic Galois Extensions 19 4.6. The J -topology 22 4.7. The K-topology 22 4.8. When K is algebraically closed 22 5. Three Flavors Revisited 24 5.1. Galois Extensions 24 5.2. Dedekind Extensions 26 5.3. Perfectly Galois Extensions 27 6. Notes 28 References 29 Abstract. 1. Introduction 1.1. Kaplansky's Galois Connection and Correspondence. For an arbitrary field extension K=F , define L = L(K=F ) to be the lattice of 1 2 PETE L. CLARK subextensions L of K=F and H = H(K=F ) to be the lattice of all subgroups H of G = Aut(K=F ). Then we have Φ: L!H;L 7! Aut(K=L) and Ψ: H!F;H 7! KH : For L 2 L, we write c(L) := Ψ(Φ(L)) = KAut(K=L): One immediately verifies: L ⊂ L0 =) c(L) ⊂ c(L0);L ⊂ c(L); c(c(L)) = c(L); these properties assert that L 7! c(L) is a closure operator on the lattice L in the sense of order theory. -
ON R-EXTENSIONS of ALGEBRAIC NUMBER FIELDS Let P Be a Prime
ON r-EXTENSIONS OF ALGEBRAIC NUMBER FIELDS KENKICHI IWASAWA1 Let p be a prime number. We call a Galois extension L of a field K a T-extension when its Galois group is topologically isomorphic with the additive group of £-adic integers. The purpose of the present paper is to study arithmetic properties of such a T-extension L over a finite algebraic number field K. We consider, namely, the maximal unramified abelian ^-extension M over L and study the structure of the Galois group G(M/L) of the extension M/L. Using the result thus obtained for the group G(M/L)> we then define two invariants l(L/K) and m(L/K)} and show that these invariants can be also de termined from a simple formula which gives the exponents of the ^-powers in the class numbers of the intermediate fields of K and L. Thus, giving a relation between the structure of the Galois group of M/L and the class numbers of the subfields of L, our result may be regarded, in a sense, as an analogue, for L, of the well-known theorem in classical class field theory which states that the class number of a finite algebraic number field is equal to the degree of the maximal unramified abelian extension over that field. An outline of the paper is as follows: in §1—§5, we study the struc ture of what we call T-finite modules and find, in particular, invari ants of such modules which are similar to the invariants of finite abelian groups. -
Pseudo Real Closed Field, Pseudo P-Adically Closed Fields and NTP2
Pseudo real closed fields, pseudo p-adically closed fields and NTP2 Samaria Montenegro∗ Université Paris Diderot-Paris 7† Abstract The main result of this paper is a positive answer to the Conjecture 5.1 of [15] by A. Chernikov, I. Kaplan and P. Simon: If M is a PRC field, then T h(M) is NTP2 if and only if M is bounded. In the case of PpC fields, we prove that if M is a bounded PpC field, then T h(M) is NTP2. We also generalize this result to obtain that, if M is a bounded PRC or PpC field with exactly n orders or p-adic valuations respectively, then T h(M) is strong of burden n. This also allows us to explicitly compute the burden of types, and to describe forking. Keywords: Model theory, ordered fields, p-adic valuation, real closed fields, p-adically closed fields, PRC, PpC, NIP, NTP2. Mathematics Subject Classification: Primary 03C45, 03C60; Secondary 03C64, 12L12. Contents 1 Introduction 2 2 Preliminaries on pseudo real closed fields 4 2.1 Orderedfields .................................... 5 2.2 Pseudorealclosedfields . .. .. .... 5 2.3 The theory of PRC fields with n orderings ..................... 6 arXiv:1411.7654v2 [math.LO] 27 Sep 2016 3 Bounded pseudo real closed fields 7 3.1 Density theorem for PRC bounded fields . ...... 8 3.1.1 Density theorem for one variable definable sets . ......... 9 3.1.2 Density theorem for several variable definable sets. ........... 12 3.2 Amalgamation theorems for PRC bounded fields . ........ 14 ∗[email protected]; present address: Universidad de los Andes †Partially supported by ValCoMo (ANR-13-BS01-0006) and the Universidad de Costa Rica. -
Techniques for the Computation of Galois Groups
Techniques for the Computation of Galois Groups Alexander Hulpke School of Mathematical and Computational Sciences, The University of St. Andrews, The North Haugh, St. Andrews, Fife KY16 9SS, United Kingdom [email protected] Abstract. This note surveys recent developments in the problem of computing Galois groups. Galois theory stands at the cradle of modern algebra and interacts with many areas of mathematics. The problem of determining Galois groups therefore is of interest not only from the point of view of number theory (for example see the article [39] in this volume), but leads to many questions in other areas of mathematics. An example is its application in computer algebra when simplifying radical expressions [32]. Not surprisingly, this task has been considered in works from number theory, group theory and algebraic geometry. In this note I shall give an overview of methods currently used. While the techniques used for the identification of Galois groups were known already in the last century [26], the involved calculations made it almost imprac- tical to do computations beyond trivial examples. Thus the problem was only taken up again in the last 25 years with the advent of computers. In this note we will restrict ourselves to the case of the base field Q. Most methods generalize to other fields like Q(t), Qp, IFp(t) or number fields. The results presented here are the work of many mathematicians. I tried to give credit by references wherever possible. 1 Introduction We are given an irreducible polynomial f Q[x] of degree n and asked to determine the Galois group of its splitting field2 L = Spl(f). -
Arxiv:2010.01281V1 [Math.NT] 3 Oct 2020 Extensions
CONSTRUCTIONS USING GALOIS THEORY CLAUS FIEKER AND NICOLE SUTHERLAND Abstract. We describe algorithms to compute fixed fields, minimal degree splitting fields and towers of radical extensions using Galois group computations. We also describe the computation of geometric Galois groups and their use in computing absolute factorizations. 1. Introduction This article discusses some computational applications of Galois groups. The main Galois group algorithm we use has been previously discussed in [FK14] for number fields and [Sut15, KS21] for function fields. These papers, respectively, detail an algorithm which has no degree restrictions on input polynomials and adaptations of this algorithm for polynomials over function fields. Some of these details are reused in this paper and we will refer to the appropriate sections of the previous papers when this occurs. Prior to the development of this Galois group algorithm, there were a number of algorithms to compute Galois groups which improved on each other by increasing the degree of polynomials they could handle. The lim- itations on degree came from the use of tabulated information which is no longer necessary. Galois Theory has its beginning in the attempt to solve polynomial equa- tions by radicals. It is reasonable to expect then that we could use the computation of Galois groups for this purpose. As Galois groups are closely connected to splitting fields, it is worthwhile to consider how the computa- tion of a Galois group can aid the computation of a splitting field. In solving a polynomial by radicals we compute a splitting field consisting of a tower of radical extensions. We describe an algorithm to compute splitting fields in general as towers of extensions using the Galois group. -
Solvability by Radicals Rodney Coleman, Laurent Zwald
Solvability by radicals Rodney Coleman, Laurent Zwald To cite this version: Rodney Coleman, Laurent Zwald. Solvability by radicals. 2020. hal-03066602 HAL Id: hal-03066602 https://hal.archives-ouvertes.fr/hal-03066602 Preprint submitted on 15 Dec 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Solvability by radicals Rodney Coleman, Laurent Zwald December 10, 2020 Abstract In this note we present one of the fundamental theorems of algebra, namely Galois’s theorem concerning the solution of polynomial equations. We will begin with a study of cyclic extensions, before moving onto radical extensions. 1 Cyclic extensions We say that a finite extension E of a field F is cyclic if the Galois group Gal(E=F ) is cyclic. In this section we aim to present some elementary properties of such extensions. We begin with a preliminary result known as Hilbert’s theorem 90. EXTSOLVcycth1 Theorem 1 Let E=F be a finite cyclic Galois extension of degree n. We suppose that σ is a generator of the Galois group Gal(E=F ). If α 2 E, then NE=F (α) = 1 if and only if there exists ∗ β β 2 E such that α = σ(β) .