DOCSLIB.ORG

Fields and Galois Theory Fall 2004 Professor Yu-Ru Liu

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Fields and Galois Theory Fall 2004 Professor Yu-Ru Liu Fields and Galois Theory Fall 2004 Professor Yu-Ru Liu CHRIS ALMOST Contents 1 Introduction 3 1.1 Motivation.......................................................3 1.2 Brief Review of Ring Theory............................................3 2 Field extensions 4 2.1 Degree of a Field Extention.............................................4 2.2 Algebraic and Transcendental Numbers.....................................5 2.3 Simple Extensions...................................................5 2.4 Algebraic Extensions.................................................6 3 Splitting Fields 7 3.1 Existence of splitting fields.............................................7 3.2 Uniqueness of the splitting field..........................................8 4 Separable Polynomials 9 4.1 Prime Fields......................................................9 4.2 Formal Derivative and Repeated Roots......................................9 4.3 Separable Polynomials................................................ 10 4.4 Perfect Fields...................................................... 11 5 Automorphism Groups 12 5.1 Automorphism Groups................................................ 12 5.2 Automorphism Groups of Polynomials...................................... 12 5.3 Fixed Fields....................................................... 13 6 Galois Extensions 13 6.1 Separable Extensions................................................. 13 6.2 Normal extensions.................................................. 14 6.3 Conjugates....................................................... 16 6.4 Galois Extensions................................................... 16 6.5 Artin’s Theorem.................................................... 17 1 2 CONTENTS 7 The Galois Correspondence 19 7.1 The Fundemental Theorem............................................. 19 7.2 Applications...................................................... 21 7.3 Brief Review of Group Theory........................................... 21 7.4 The Primitive Element Theorem.......................................... 23 8 Ruler and Compass Constructions 24 8.1 Constructible Points.................................................. 24 8.2 Constructible Numbers................................................ 25 8.3 Applications...................................................... 25 9 Cyclotomic Extensions 27 9.1 Cyclotomic Polynomials............................................... 27 9.2 Cyclotomic Fields................................................... 28 9.3 Abelian Extensions.................................................. 28 9.4 Constructible n-gons................................................. 30 10 Galois Groups of Polynomials 30 10.1 Discriminant...................................................... 30 10.2 Cubic Polynomials................................................... 31 10.3 Quartic Polynomials................................................. 31 11 Solvability by Radicals 33 11.1 Cardano’s Formula.................................................. 33 11.2 Solvable groups.................................................... 35 11.3 Cyclic Extensions................................................... 37 11.4 Radical Extensions.................................................. 38 11.5 Solving polynomials by Radicals.......................................... 39 11.6 Probabilistic Galois Theory............................................. 40 INTRODUCTION 3 1 Introduction Galois Theory is the interplay between fields and groups. 1.1 Motivation Consider the following historical problems. Construct an arbitrary regular n-gon using only a ruler and a compass. We know how to construct a triangle • and square, but what about 5-gon, etc.? Square the circle using only a ruler and compass (i.e. construct a square of area π). • Solve an arbirary polynomial using only algebraic means (i.e. plus, minus, times, divides, and nthroot). • The quadratic formula gives a solution for quadratic equations. Cubic and quartic equations can be solved 3 similarily. e.g. if x + px = q then È È r 3 2 r 3 2 3 q p q 3 q p q x = + + + + 2 27 4 2 − 27 4 For which quintic equations do we have radical solutions? If we know there is such a solution, what does • the solution look like? How can we solve these problems? The main steps in applying the theory that we develope in this course are as follows: 1. Associate the solution of interest, say α = pπ or α = the root of some quintic, with the field Q(α). 2. Associate α with the group of isomorphisms of α that fix , Aut α . If α is algebraic then Q( ) Q( ) Q Q(Q( )) Aut α is finite. If α is constructable then the order of Aut α is in certain forms. Q(Q( )) Q(Q( )) Hard Question: How many intermediate fields between Q and Q(α)? There is a 1-1 correspondence between the intermediate fields and the subgroups of Aut α (this is the Fundemental Theorem of Galois theory.) Q(Q( )) 1.2 Brief Review of Ring Theory For this course we will be dealing with commutative rings with identity. 1.1 Example. Let R be a ring. We denote by R[x] the polynomial ring over R in indeterminant x. The degree of a polynomial is the exponent on the leading term. By convention, deg 0 = . If a polynomial has leading coefficient 1 then it is called “monic”. −∞ A ring R is called a domain if it has no zero divisors. An element u R is called a unit if it is invertible. A field is a commutative ring in which each non-zero element is a unit and 0 2= 1. 6 1.2 Example. If F is a field, then F[x] is a domain (it is sufficient that F be a domain) and for f , g F[x], deg(f g) = deg(f ) + deg(g). This degree function actually makes F[x] into a Euclidean domain. 2 The rational (function) field over a field F is denoted F(x) and consists of all quotients of polynomials (with non-zero denominator) from F[x]. It is the smallest field that contains F[x]. An ideal I of a ring R is a (not necessarily unital) subring of R that is absorbing with respect to multiplication by elements of R. We can now construct R=I, the quotient ring modulo I. I is said to be maximal if I = R and for any ideal J we have I J R I = J J = R. I is said to be prime if I = R and ab I a I b6 I. Notice that every maximal ideal⊆ ⊆ is prime,) and_ in PIDs every prime ideal is maximal.6 Fields2 have) only2 trivial_ 2 ideals. 4 FIELDSAND GALOIS 1.3 Theorem. Let I be a proper ideal of R. Then 1. R=I is a field if and only if I is maximal 2. R=I is a domain if and only if I is prime 1.4 Theorem. (First Isomorphism Theorem) If ' : R S is a ring homomorphism and ker ' = I then there is an isomorphism ! α : R=I Im ' : r + I '(r) ! 7! 2 Field extensions 2.1 Definition. If E is a field containing another field F then E is said to be a field extension of F, denoted by E=F 2.1 Degree of a Field Extention If E=F is a field extension then we can view E as a vector space over F. Addition is given to agree with the field addition • Scalar multiplication is given to agree with the field multiplication • 2.2 Definition. The dimension of E viewed as a vector space over F is called the degree of E over F and is denoted [E : F]. If this quantity happens to be finite, then E=F is said to be a finite extension, otherwise it is an infinite extension. 2.3 Example. 1. C = R iR, so [C : R] = 2 ∼ ⊕ 2. [R : Q] = 1 1 2 3. Let F be a field. The rational field is an infinite extension. An infinite linearly independent set is ..., x − , 1, x, x ,... f g 2.4 Theorem. If E=K and K=F are finite field extensions, then E=F is finite and [E : F] = [E : K][K : F] PROOF: Let a1,..., am be a basis for E over K and b1,..., bn be a basis for K over F. It suffices to prove f g f g α := ai bj 1 i m, 1 j n is a basis for E over F. Every element of E is a linear combination of elements of α fsincej each≤ element≤ ≤ of E≤isg a linear combination of elements of a1,..., am , and each of the ai’s (being elements of K) can be written as a linear combination of elements fromf b1,..., gbn . α is linearly independent Pm Pn f g Pn over F, for otherwise if i 1 j 1 ci,j bj ai = 0, then a1,..., am a basis implies that j 1 ci,j bj = 0 for all i. = = f g = Since b1,..., bn is also a basis, we get that ci,j = 0 for all i and j. f g 2.5 Definition. Let E=F be a field extension. If K is a subfield of E that contains F then we say that K is an intermediate field of E=F. 2.6 Corollary. If E=F is a finite extension and K is an intermediate field then [E : K] and [K : F] are divisors of [E : F]. FIELDEXTENSIONS 5 2.2 Algebraic and Transcendental Numbers 2.7 Definition. Let E=F be a field extension and α E. We say that α is algebraic over F if there is f (x) F[x] such that f = 0 and f (α) = 0. Otherwise α is said to2 be transcendental over F. 2 6 In particular, for α C and α algebraic (transcendental) over Q, we say that α is an algebraic (transcendental) 3 number. For example,2 all rational numbers are algebraic, as are p2, p2 + i, etc. The real numbers e (Hermite 1873) and π (Lindemann 1882) are transcendental numbers. 2.8 Theorem. (Liouville 1884) Let α R Q be a root of a polynomial f (x) Q[x] of degree n. Then there exists a constant c > 0 such that for any2 rationaln number p with q > 0 2 q p c α > n − q q p PROOF: Without loss of generality, we can assume α < 1 and that f x x and f is irreducible. Then q ( ) Z[ ] p j − pj p 2 p f α 0 and f 0. By the Mean Value theorem, f f α f M α , where M sup f x ( ) = ( q ) = ( q ) = ( ) ( q ) q = 0( ) 6 j j j − j ≤p j − j p j j for x α < 1. Since α is irrational, deg f 2 and M 0. Furthermore, f 1=qn, and thus α 1 1 , ( ) = ( q ) q M qn j − j ≥ 6 j j ≥ j − j ≥ so take c 1 . = M Remark. Liouville’s Theorem says that algebraic numbers are “harder” to approximate by rational numbers than transcendental numbers.
Load more

Recommended publications
  • K-Quasiderivations
    K-QUASIDERIVATIONS CALEB EMMONS, MIKE KREBS, AND ANTHONY SHAHEEN Abstract. A K-quasiderivation is a map which satisfies both the Product Rule and the Chain Rule. In this paper, we discuss sev- eral interesting families of K-quasiderivations. We first classify all K-quasiderivations on the ring of polynomials in one variable over an arbitrary commutative ring R with unity, thereby extend- ing a previous result. In particular, we show that any such K- quasiderivation must be linear over R. We then discuss two previ- ously undiscovered collections of (mostly) nonlinear K-quasiderivations on the set of functions defined on some subset of a field. Over the reals, our constructions yield a one-parameter family of K- quasiderivations which includes the ordinary derivative as a special case. 1. Introduction In the middle half of the twientieth century|perhaps as a reflection of the mathematical zeitgeist|Lausch, Menger, M¨uller,N¨obauerand others formulated a general axiomatic framework for the concept of the derivative. Their starting point was (usually) a composition ring, by which is meant a commutative ring R with an additional operation ◦ subject to the restrictions (f + g) ◦ h = (f ◦ h) + (g ◦ h), (f · g) ◦ h = (f ◦ h) · (g ◦ h), and (f ◦ g) ◦ h = f ◦ (g ◦ h) for all f; g; h 2 R. (See [1].) In M¨uller'sparlance [9], a K-derivation is a map D from a composition ring to itself such that D satisfies Additivity: D(f + g) = D(f) + D(g) (1) Product Rule: D(f · g) = f · D(g) + g · D(f) (2) Chain Rule D(f ◦ g) = [(D(f)) ◦ g] · D(g) (3) 2000 Mathematics Subject Classification.
    [Show full text]
  • 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.
    [Show full text]
  • Algorithmic Factorization of Polynomials Over Number Fields
    Rose-Hulman Institute of Technology Rose-Hulman Scholar Mathematical Sciences Technical Reports (MSTR) Mathematics 5-18-2017 Algorithmic Factorization of Polynomials over Number Fields Christian Schulz Rose-Hulman Institute of Technology Follow this and additional works at: https://scholar.rose-hulman.edu/math_mstr Part of the Number Theory Commons, and the Theory and Algorithms Commons Recommended Citation Schulz, Christian, "Algorithmic Factorization of Polynomials over Number Fields" (2017). Mathematical Sciences Technical Reports (MSTR). 163. https://scholar.rose-hulman.edu/math_mstr/163 This Dissertation is brought to you for free and open access by the Mathematics at Rose-Hulman Scholar. It has been accepted for inclusion in Mathematical Sciences Technical Reports (MSTR) by an authorized administrator of Rose-Hulman Scholar. For more information, please contact [email protected]. Algorithmic Factorization of Polynomials over Number Fields Christian Schulz May 18, 2017 Abstract The problem of exact polynomial factorization, in other words expressing a poly- nomial as a product of irreducible polynomials over some field, has applications in algebraic number theory. Although some algorithms for factorization over algebraic number fields are known, few are taught such general algorithms, as their use is mainly as part of the code of various computer algebra systems. This thesis provides a summary of one such algorithm, which the author has also fully implemented at https://github.com/Whirligig231/number-field-factorization, along with an analysis of the runtime of this algorithm. Let k be the product of the degrees of the adjoined elements used to form the algebraic number field in question, let s be the sum of the squares of these degrees, and let d be the degree of the polynomial to be factored; then the runtime of this algorithm is found to be O(d4sk2 + 2dd3).
    [Show full text]
  • 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).
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • Galois Theory on the Line in Nonzero Characteristic
    BULLETIN (New Series) OF THE AMERICANMATHEMATICAL SOCIETY Volume 27, Number I, July 1992 GALOIS THEORY ON THE LINE IN NONZERO CHARACTERISTIC SHREERAM S. ABHYANKAR Dedicated to Walter Feit, J-P. Serre, and e-mail 1. What is Galois theory? Originally, the equation Y2 + 1 = 0 had no solution. Then the two solutions i and —i were created. But there is absolutely no way to tell who is / and who is —i.' That is Galois Theory. Thus, Galois Theory tells you how far we cannot distinguish between the roots of an equation. This is codified in the Galois Group. 2. Galois groups More precisely, consider an equation Yn + axY"-x +... + an=0 and let ai , ... , a„ be its roots, which are assumed to be distinct. By definition, the Galois Group G of this equation consists of those permutations of the roots which preserve all relations between them. Equivalently, G is the set of all those permutations a of the symbols {1,2,...,«} such that (t>(aa^, ... , a.a(n)) = 0 for every «-variable polynomial (j>for which (j>(a\, ... , an) — 0. The co- efficients of <f>are supposed to be in a field K which contains the coefficients a\, ... ,an of the given polynomial f = f(Y) = Y" + alY"-l+--- + an. We call G the Galois Group of / over K and denote it by Galy(/, K) or Gal(/, K). This is Galois' original concrete definition. According to the modern abstract definition, the Galois Group of a normal extension L of a field K is defined to be the group of all AT-automorphisms of L and is denoted by Gal(L, K).
    [Show full text]
  • On the Discriminant of a Certain Quartinomial and Its Totally Complexness
    ON THE DISCRIMINANT OF A CERTAIN QUARTINOMIAL AND ITS TOTALLY COMPLEXNESS SHUICHI OTAKE AND TONY SHASKA Abstract. In this paper, we compute the discriminant of a quartinomial n 2 of the form f(b;a;1)(t; x) = x + t(x + ax + b) by using the Bezoutian. Then, by using this result and another theorem of our previous paper, we construct a family of totally complex polynomials of the form f(b;a;1)(ξ; x) (ξ 2 R; (a; b) 6= (0; 0)). 1. Introduction The discriminant of a polynomial has been a major objective of research in algebra because of its importance. For example, the discriminant of a polynomial allows us to know whether the polynomial has multiple roots or not and it also plays an important role when we compute the discriminant of a number field. Moreover the discriminant of a polynomial also tells us whether the Galois group of the polynomial is contained in the alternating group or not. This is why there are so many papers focusing on studying the discriminant of a polynomial ([B-B-G], [D-S], [Ked], [G-D], [Swa]). In the last two papers, the authors concern the computation of the discriminant of a trinomial and it has been carried out in different ways. n In this paper, we compute the discriminant of a quartinomial f(b;a;1)(t; x) = x + t(x2 + ax + b) by using the Bezoutian (Theorem2). Let F be a field of characteristic zero and f1(x), f2(x) be polynomials over F . Then, for any integer n such that n ≥ maxfdegf1; degf2g, we put n f1(x)f2(y) − f1(y)f2(x) X B (f ; f ) : = = α xn−iyn−j 2 F [x; y]; n 1 2 x − y ij i;j=1 Mn(f1; f2) : = (αij)1≤i;j≤n: 0 The n × n matrix Mn(f1; f2) is called the Bezoutian of f1 and f2.
    [Show full text]
  • Kronecker Classes of Algebraic Number Fields WOLFRAM
    JOURNAL OF NUMBER THFDRY 9, 279-320 (1977) Kronecker Classes of Algebraic Number Fields WOLFRAM JEHNE Mathematisches Institut Universitiit Kiiln, 5 K&I 41, Weyertal 86-90, Germany Communicated by P. Roquette Received December 15, 1974 DEDICATED TO HELMUT HASSE INTRODUCTION In a rather programmatic paper of 1880 Kronecker gave the impetus to a long and fruitful development in algebraic number theory, although no explicit program is formulated in his paper [17]. As mentioned in Hasse’s Zahlbericht [8], he was the first who tried to characterize finite algebraic number fields by the decomposition behavior of the prime divisors of the ground field. Besides a fundamental density relation, Kronecker’s main result states that two finite extensions (of prime degree) have the same Galois hull if every prime divisor of the ground field possesses in both extensions the same number of prime divisors of first relative degree (see, for instance, [8, Part II, Sects. 24, 251). In 1916, Bauer [3] showed in particular that, among Galois extensions, a Galois extension K 1 k is already characterized by the set of all prime divisors of k which decompose completely in K. More generally, following Kronecker, Bauer, and Hasse, for an arbitrary finite extension K I k we consider the set D(K 1 k) of all prime divisors of k having a prime divisor of first relative degree in K; we call this set the Kronecker set of K 1 k. Obviously, in the case of a Galois extension, the Kronecker set coincides with the set just mentioned. In a counterexample Gassmann [4] showed in 1926 that finite extensions.
    [Show full text]
  • Uwe Krey · Anthony Owen Basic Theoretical Physics Uwe Krey · Anthony Owen
    Uwe Krey · Anthony Owen Basic Theoretical Physics Uwe Krey · Anthony Owen Basic Theoretical Physics AConciseOverview With 31 Figures 123 Prof. Dr. Uwe Krey University of Regensburg (retired) FB Physik Universitätsstraße 31 93053 Regensburg, Germany E-mail: [email protected] Dr. rer nat habil Anthony Owen University of Regensburg (retired) FB Physik Universitätsstraße 31 93053 Regensburg, Germany E-mail: [email protected] Library of Congress Control Number: 2007930646 ISBN 978-3-540-36804-5 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable for prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2007 The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting and production: LE-TEX Jelonek, Schmidt & Vöckler GbR, Leipzig Cover design: eStudio Calamar S.L., F. Steinen-Broo, Pau/Girona, Spain Printed on acid-free paper SPIN 11492665 57/3180/YL - 5 4 3 2 1 0 Preface This textbook on theoretical physics (I-IV) is based on lectures held by one of the authors at the University of Regensburg in Germany.
    [Show full text]
  • Section 14.2. Let K/F Be a Galois Extension. the Main Goal of This
    Section 14.2. Let K=F be a Galois extension. The main goal of this lecture is to prove the Funda- mental Theorem of Galois Theory, which makes precise the relation between the subgroups H ⊂ Gal(K=F ) and the subfields F ⊂ E ⊂ K. Let us do some preparatory work first. Lemma 1. A finite-dimensional vector space over an infinite field can not be presented as a union of a finite number of its proper subspaces. s Proof. Let V = [i=1Vs, where Vs are proper subspaces of the vector space V . For every Vi let us choose a non-zero linear function li on V , which turns into zero on Vi. Now, let us Qs consider a polynomial p = i=1 li. Then for any v 2 V we must have p(v) = 0 which would imply that p is constantly zero, and we arrive at a contradiction. Theorem 2. Let K=F be a field extension of degree n, and G ⊂ Aut(K=F ) be a subgroup of Aut(K=F ). Denote by KG the fixed field of G. Then KG = F if and only if jGj = n. Moreover, if KG = F then for any fields P and Q such that F ⊂ P ⊂ Q ⊂ K, any homomorphism ': P ! K extends to a homomorphism : Q ! K in precisely jQ : P j ways. Proof. By the definition of a fixed field, we have G ⊂ Aut(K=KG). Therefore, G jGj 6 jK : K j 6 jK : F j = n: Then jGj = n implies KG = F . Conversely, let KG = F .
    [Show full text]
  • Inverse Galois Problem and Significant Methods
    Inverse Galois Problem and Significant Methods Fariba Ranjbar*, Saeed Ranjbar * School of Mathematics, Statistics and Computer Science, University of Tehran, Tehran, Iran. [email protected] ABSTRACT. The inverse problem of Galois Theory was developed in the early 1800’s as an approach to understand polynomials and their roots. The inverse Galois problem states whether any finite group can be realized as a Galois group over ℚ (field of rational numbers). There has been considerable progress in this as yet unsolved problem. Here, we shall discuss some of the most significant results on this problem. This paper also presents a nice variety of significant methods in connection with the problem such as the Hilbert irreducibility theorem, Noether’s problem, and rigidity method and so on. I. Introduction Galois Theory was developed in the early 1800's as an approach to understand polynomials and their roots. Galois Theory expresses a correspondence between algebraic field extensions and group theory. We are particularly interested in finite algebraic extensions obtained by adding roots of irreducible polynomials to the field of rational numbers. Galois groups give information about such field extensions and thus, information about the roots of the polynomials. One of the most important applications of Galois Theory is solvability of polynomials by radicals. The first important result achieved by Galois was to prove that in general a polynomial of degree 5 or higher is not solvable by radicals. Precisely, he stated that a polynomial is solvable by radicals if and only if its Galois group is solvable. According to the Fundamental Theorem of Galois Theory, there is a correspondence between a polynomial and its Galois group, but this correspondence is in general very complicated.
    [Show full text]