DOCSLIB.ORG

Noether's Problem

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Noether's Problem Noether’s problem Asher Auel Department of Mathematics Yale University Colloquium Dartmouth College May 11, 2018 Symmetric polynomials x + y xy x2 + y 2 x2y + xy 2 x3 + y 3 x4y 4 + 2x5y 2 + 2x2y 5 Symmetric polynomials x + y xy x2 + y 2 = (x + y)2 − 2xy x2y + xy 2 = (x + y)xy x3 + y 3 = (x + y)3 − 3x2y − 3xy 2 x4y 4 + 2x5y 2 + 2x2y 5 = (xy)4 + 2(xy)2(x3 + y 3) Symmetric polynomials x + y xy x2 + y 2 = (x + y)2 − 2xy x2y + xy 2 = (x + y)xy x3 + y 3 = (x + y)3 − 3(x2y + 3xy 2) x4y 4 + 2x5y 2 + 2x2y 5 = (xy)4 + 2(xy)2(x3 + y 3) Symmetric polynomials x + y xy x2 + y 2 = (x + y)2 − 2xy x2y + xy 2 = (x + y)xy x3 + y 3 = (x + y)3 − 3(x + y)xy x4y 4 + 2x5y 2 + 2x2y 5 = (xy)4 + 2(xy)2(x + y)3 − 3(x + y)xy Symmetric polynomials x + y = σ1 xy = σ2 2 2 2 x + y = σ1 − 2σ2 2 2 x y + xy = σ1σ2 3 3 3 x + y = σ1 − 3σ1σ2 4 4 5 2 2 5 4 3 2 3 x y + 2x y + 2x y = σ2 + 2σ1σ2 − 6σ1σ2 Fundamental Theorem Newton 1665, Waring 1770, Gauss 1815 Theorem. Any symmetric polynomial in variables x1;:::; xn can be uniquely expressed as a polynomial in the elementary symmetric polynomials σ1 = x1 + x2 + ··· + xn σ2 = x1x2 + x1x3 + ··· + xn−1xn . X σk = xi1 ··· xik 1≤i1<···<ik ≤n . σn = x1x2 ··· xn Newton–Girard formulas Girard 1629, Newton 1666 k k k pk = x1 + x2 + ··· + xn power sums p1 = σ1 2 p2 = σ1 − 2σ2 3 p3 = σ1 − 3σ1σ2 + 3σ3 4 2 2 p4 = σ1 − 4σ1σ2 + 2σ2 + 4σ1σ3 − 4σ4 0 1 σ1 1 0 ··· 0 B2σ2 σ1 1 ··· 0 C B C B3σ σ σ ··· 0 C pk = det B 3 2 1 C B . .. C @ . 1 A kσk σk−1 σk−2 ··· σ1 0 1 1 0 ··· 0 01 B−2 1 1 ··· 0 0C B C B .. C B 0 −1 1 . 1 0C B C B . .. C @ . 1 1A 0 0 0 · · · −1 1 Example. 2; 1; 3; 4; 7; 11; 18; 29; 47; 76; 123; 199;::: Ln = Ln−1 + Ln−2 Lucas numbers p p 1 + 5 1 − 5 φ = ; φ¯ = roots of x2 − x − 1 2 2 n n Ln = φ +φ¯ = det Vieta’a formula α1; α2; : : : ; αn roots of monic polynomial f (x) n n−1 n−1 n f (x) = x − σ1x + σ2x − · · · + (−1) σn 0 1 1 0 ··· 0 01 B−2 1 1 ··· 0 0C B C B .. C B 0 −1 1 . 1 0C B C B . .. C @ . 1 1A 0 0 0 · · · −1 1 Ln = Ln−1 + Ln−2 Lucas numbers p p 1 + 5 1 − 5 φ = ; φ¯ = roots of x2 − x − 1 2 2 n n Ln = φ +φ¯ = det Vieta’a formula α1; α2; : : : ; αn roots of monic polynomial f (x) n n−1 n−1 n f (x) = x − σ1x + σ2x − · · · + (−1) σn Example. 2; 1; 3; 4; 7; 11; 18; 29; 47; 76; 123; 199;::: 0 1 1 0 ··· 0 01 B−2 1 1 ··· 0 0C B C B .. C B 0 −1 1 . 1 0C B C B . .. C @ . 1 1A 0 0 0 · · · −1 1 Vieta’a formula α1; α2; : : : ; αn roots of monic polynomial f (x) n n−1 n−1 n f (x) = x − σ1x + σ2x − · · · + (−1) σn Example. 2; 1; 3; 4; 7; 11; 18; 29; 47; 76; 123; 199;::: Ln = Ln−1 + Ln−2 Lucas numbers p p 1 + 5 1 − 5 φ = ; φ¯ = roots of x2 − x − 1 2 2 0 1 σ1 1 0 ··· 0 0 B2σ σ 1 ··· 0 0 C B 2 1 C n ¯n B .. C Ln = φ +φ = det B3σ3 σ2 σ1 . 1 0 C B C B . .. C @ . σ1 1 A kσk σk−1 σk−2 ··· σ2 σ1 Vieta’a formula α1; α2; : : : ; αn roots of monic polynomial f (x) n n−1 n−1 n f (x) = x − σ1x + σ2x − · · · + (−1) σn Example. 2; 1; 3; 4; 7; 11; 18; 29; 47; 76; 123; 199;::: Ln = Ln−1 + Ln−2 Lucas numbers p p 1 + 5 1 − 5 φ = ; φ¯ = roots of x2 − x − 1 2 2 0 1 1 0 ··· 0 01 B−2 1 1 ··· 0 0C B C n ¯n B .. C Ln = φ +φ = det B 0 −1 1 . 1 0C B C B . .. C @ . 1 1A 0 0 0 · · · −1 1 Additive symmetric polynomial bases partition λ = (λ1; : : : ; λr ) of n monomial symmetric polynomials X λ1 λr mλ = xτ(1) ··· xτ(r) τ2Sr Schur polynomials X t1 tn sλ = x1 ··· xn T tableau λ Sn Fundamental Theorem. C[x1; x2;:::; xn] = C[σ1; σ2; : : : ; σn] Sn C(x1; x2;:::; xn) = C(σ1; σ2; : : : ; σn) Ring of symmetric polynomials Field of symmetric rational functions Algebra Sn symmetric group of permutations of f1; 2;:::; ng C[x1; x2;:::; xn] ring of polynomials in variables x1; x2;:::; xn Sn acts on C[x1; x2;:::; xn] by permuting the variables 2 2 Example. (1234) · (x1x2 + x3 ) = x2x3 + x4 Algebra Sn symmetric group of permutations of f1; 2;:::; ng C[x1; x2;:::; xn] ring of polynomials in variables x1; x2;:::; xn Sn acts on C[x1; x2;:::; xn] by permuting the variables 2 2 Example. (1234) · (x1x2 + x3 ) = x2x3 + x4 Sn Fundamental Theorem. C[x1; x2;:::; xn] = C[σ1; σ2; : : : ; σn] Sn C(x1; x2;:::; xn) = C(σ1; σ2; : : : ; σn) Ring of symmetric polynomials Field of symmetric rational functions Algebra Fundamental Theorem. Any symmetric polynomial can be uniquely expressed as a polynomial in the elementary symmetric polynomials. uniqueness () σ1; σ2; : : : ; σn algebraically independent Sn () C(x1; x2;:::; xn) = C(σ1; σ2; : : : ; σn) purely transcendental over C 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. 1 2 3 4 5 6 7 8 9 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. 4 7 8 5 3 1 9 2 6 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. Bubble sort 4 75831926 1 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. Bubble sort 4 7 5381926 2 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. Bubble sort 4 7 5 318926 3 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. Bubble sort 4 7 5 3 1 8296 4 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. Bubble sort 4 7 5 3 1 8 2695 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. Bubble sort 457318269 6 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. Bubble sort 4 53718269 7 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example. Bubble sort 4 5 3178269 8 4 7 8 5 3 1 9 2 6 even Parity of the number of swaps is an invariant of a permutation An Definition. Ring of alternating polynomials C[x1; x2;:::; xn] An Field of alternating rational functions C(x1; x2;:::; xn) Alternating polynomials An ⊂ Sn subgroups of even permutations Example.
Load more

Recommended publications
  • Inverse Galois Problem with Viewpoint to Galois Theory and It's Applications
    Vol-3 Issue-4 2017 IJARIIE-ISSN(O)-2395-4396 INVERSE GALOIS PROBLEM WITH VIEWPOINT TO GALOIS THEORY AND IT’S APPLICATIONS Dr. Ajay Kumar Gupta1, Vinod Kumar2 1 Associate Professor, Bhagwant Institute of Technology, Muzaffarnagar,Uttar Pradesh, India 2 Research Scholar, Deptt. Of Mathematics, Bhagwant University, Ajmer, Rajasthan, India ABSTRACT In this paper we are presenting a review of the inverse Galois Problem and its applications. In mathematics, more specifically in abstract algebra, Galois Theory, named after Évariste Galois, provides a connection between field theory and group theory. Using Galois Theory, certain problems in field theory can be reduced to group theory, which is, in some sense, simpler and better understood. Originally, Galois used permutation groups to describe how the various roots of a given polynomial equation are related to each other. Galois Theory is the algebraic study of groups that can be associated with polynomial equations. In this survey we outline the milestones of the Inverse Problem of Galois theory historically up to the present time. We summarize as well the contribution of the authors to the Galois Embedding Problem, which is the most natural approach to the Inverse Problem in the case of non-simple groups. Keyword : - Problem, Contribution, Field Theory, and Simple Group etc. 1. INTRODUCTION 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.
    [Show full text]
  • THE INVERSE GALOIS PROBLEM OVER C(Z)
    THE INVERSE GALOIS PROBLEM OVER C(z) ARNO FEHM, DAN HARAN AND ELAD PARAN Abstract. We give a self-contained elementary solution for the inverse Galois problem over the field of rational functions over the complex numbers. 1. Introduction Since the 19th century one of the foundational open questions of Galois theory is the inverse Galois problem, which asks whether every finite group occurs as the Galois group of a Galois extension of the field Q of rational numbers. In 1892 Hilbert proved his cele- brated irreducibility theorem and deduced that the inverse Galois problem has a positive answer provided that every finite group occurs as the Galois group of a Galois extension of the field Q(z) of rational functions over Q. It was known already back then that the analogous problem for the field C(z) of rational functions over the complex numbers indeed has a positive answer: Every finite group occurs as the Galois group of a Galois extension of C(z). The aim of this work is to give a new and elementary proof of this result which uses only basic complex analysis and field theory. The value of such a proof becomes clear when compared to the previously known ones: 1.1. Classical proof using Riemann's existence theorem. The classical proof (likely the one known to Hilbert) uses the fact that the finite extensions of C(z) correspond to compact Riemann surfaces realized as branched covers of the Riemann sphere C^, which ^ in turn are described by the fundamental group π1(D) of domains D = C r fz1; : : : ; zdg, where z1; : : : ; zd are the branch points.
    [Show full text]
  • Patching and Galois Theory David Harbater∗ Dept. of Mathematics
    Patching and Galois theory David Harbater∗ Dept. of Mathematics, University of Pennsylvania Abstract: Galois theory over (x) is well-understood as a consequence of Riemann's Existence Theorem, which classifies the algebraic branched covers of the complex projective line. The proof of that theorem uses analytic and topological methods, including the ability to construct covers locally and to patch them together on the overlaps. To study the Galois extensions of k(x) for other fields k, one would like to have an analog of Riemann's Existence Theorem for curves over k. Such a result remains out of reach, but partial results in this direction can be proven using patching methods that are analogous to complex patching, and which apply in more general contexts. One such method is formal patching, in which formal completions of schemes play the role of small open sets. Another such method is rigid patching, in which non-archimedean discs are used. Both methods yield the realization of arbitrary finite groups as Galois groups over k(x) for various classes of fields k, as well as more precise results concerning embedding problems and fundamental groups. This manuscript describes such patching methods and their relationships to the classical approach over , and shows how these methods provide results about Galois groups and fundamental groups. ∗ Supported in part by NSF Grants DMS9970481 and DMS0200045. (Version 3.5, Aug. 30, 2002.) 2000 Mathematics Subject Classification. Primary 14H30, 12F12, 14D15; Secondary 13B05, 13J05, 12E30. Key words and phrases: fundamental group, Galois covers, patching, formal scheme, rigid analytic space, affine curves, deformations, embedding problems.
    [Show full text]
  • Inverse Galois Problem for Totally Real Number Fields
    Cornell University Mathematics Department Senior Thesis Inverse Galois Problem for Totally Real Number Fields Sudesh Kalyanswamy Class of 2012 April, 2012 Advisor: Prof. Ravi Ramakrishna, Department of Mathematics Abstract In this thesis we investigate a variant of the Inverse Galois Problem. Namely, given a finite group G, the goal is to find a totally real extension K=Q, neces- sarily finite, such that Gal(K=Q) is isomorphic to G. Questions regarding the factoring of primes in these extensions also arise, and we address these where possible. The first portion of this thesis is dedicated to proving and developing the requisite algebraic number theory. We then prove the existence of totally real extensions in the cases where G is abelian and where G = Sn for some n ≥ 2. In both cases, some explicit polynomials with Galois group G are provided. We obtain the existence of totally real G-extensions of Q for all groups of odd order using a theorem of Shafarevich, and also outline a method to obtain totally real number fields with Galois group D2p, where p is an odd prime. In the abelian setting, we consider the factorization of primes of Z in the con- structed totally real extensions. We prove that the primes 2 and 5 each split in infinitely many totally real Z=3Z-extensions, and, more generally, that for primes p and q, p will split in infinitely many Z=qZ-extensions of Q. Acknowledgements I would like to thank Professor Ravi Ramakrishna for all his guidance and support throughout the year, as well as for the time he put into reading and editing the thesis.
    [Show full text]
  • Inverse Galois Problem Research Report in Mathematics, Number 13, 2017
    ISSN: 2410-1397 Master Dissertation in Mathematics Inverse Galois Problem University of Nairobi Research Report in Mathematics, Number 13, 2017 James Kigunda Kabori August 2017 School of Mathematics Submied to the School of Mathematics in partial fulfilment for a degree in Master of Science in Pure Mathematics Master Dissertation in Mathematics University of Nairobi August 2017 Inverse Galois Problem Research Report in Mathematics, Number 13, 2017 James Kigunda Kabori School of Mathematics College of Biological and Physical sciences Chiromo, o Riverside Drive 30197-00100 Nairobi, Kenya Master Thesis Submied to the School of Mathematics in partial fulfilment for a degree in Master of Science in Pure Mathematics Prepared for The Director Board Postgraduate Studies University of Nairobi Monitored by Director, School of Mathematics ii Abstract The goal of this project, is to study the Inverse Galois Problem. The Inverse Galois Problem is a major open problem in abstract algebra and has been extensive studied. This paper by no means proves the Inverse Galois Problem to hold or not to hold for all nite groups but we will, in chapter 4, show generic polynomials over Q satisfying the Inverse Galois Problem. Master Thesis in Mathematics at the University of Nairobi, Kenya. ISSN 2410-1397: Research Report in Mathematics ©Your Name, 2017 DISTRIBUTOR: School of Mathematics, University of Nairobi, Kenya iv Declaration and Approval I the undersigned declare that this dissertation is my original work and to the best of my knowledge, it has not been submitted in support of an award of a degree in any other university or institution of learning.
    [Show full text]
  • SPECIALIZATIONS of GALOIS COVERS of the LINE 11 It Is the Condition (Κ-Big-Enough) from Proposition 2.2 of [DG10] That Needs to Be Satisfied)
    SPECIALIZATIONS OF GALOIS COVERS OF THE LINE PIERRE DEBES` AND NOUR GHAZI Abstract. The main topic of the paper is the Hilbert-Grunwald property of Galois covers. It is a property that combines Hilbert’s irreducibility theorem, the Grunwald problem and inverse Galois theory. We first present the main results of our preceding paper which concerned covers over number fields. Then we show how our method can be used to unify earlier works on specializations of covers over various fields like number fields, PAC fields or finite fields. Finally we consider the case of rational function fields κ(x) and prove a full analog of the main theorem of our preceding paper. 1. Inroduction The Hilbert-Grunwald property of Galois covers over number fields was defined and studied in our previous paper [DG10]. It combines several topics: the Grunwald-Wang problem, Hilbert’s irreducibility theorem and the Regular Inverse Galois Problem (RIGP). Roughly speaking our main result there, which is recalled below as theorem 2.1 showed how, under certain conditions, a Galois cover f : X → P1 provides, by specialization, solutions to Grunwald problems. We next explained how to deduce an obstruction (possibly vacuous) for a finite group to be a regular Galois group over some number field K, i.e. the Galois group of some regular Galois extension E/K(T ) (corollary 1.5 of [DG10]). A refined form of this obstruction led us to some statements that question the validity of the Regular Inverse Galois Problem (RIGP) (corollaries 1.6 and 4.1 of [DG10]). The aim of this paper is threefold: - in §2: we present in more details the contents of [DG10].
    [Show full text]
  • The Inverse Galois Problem Over Formal Power Series Fields by Moshe Jarden, Tel Aviv University Israel Journal of Mathematics 85
    The inverse Galois problem over formal power series fields by Moshe Jarden, Tel Aviv University Israel Journal of Mathematics 85 (1994), 263–275. Introduction The inverse Galois problem asks whether every finite group G occurs as a Galois group over the field Q of rational numbers. We then say that G is realizable over Q. This problem goes back to Hilbert [Hil] who realized Sn and An over Q. Many more groups have been realized over Q since 1892. For example, Shafarevich [Sha] finished in 1958 the work started by Scholz 1936 [Slz] and Reichardt 1937 [Rei] and realized all solvable groups over Q. The last ten years have seen intensified efforts toward a positive solution of the problem. The area has become one of the frontiers of arithmetic geometry (see surveys of Matzat [Mat] and Serre [Se1]). Parallel to the effort of realizing groups over Q, people have generalized the inverse Galois problem to other fields with good arithmetical properties. The most distinguished field where the problem has an affirmative solution is C(t). This is a consequence of the Riemann Existence Theorem from complex analysis. Winfried Scharlau and Wulf-Dieter Geyer asked what is the absolute Galois group of the field of formal power series F = K((X1,...,Xr)) in r ≥ 2 variables over an arbitrary field K. The full answer to this question is still out of reach. However, a theorem of Harbater (Proposition 1.1a) asserts that each Galois group is realizable over the field of rational function F (T ). By a theorem of Weissauer (Proposition 3.1), F is Hilbertian.
    [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]
  • Arxiv:2011.12840V2 [Math.NT] 9 Apr 2021
    On the distribution of rational points on ramified covers of abelian varieties Pietro Corvaja Julian Lawrence Demeio Ariyan Javanpeykar∗ Davide Lombardo Umberto Zannier Abstract We prove new results on the distribution of rational points on ramified covers of abelian varieties over finitely generated fields k of characteristic zero. For example, given a ramified cover π : X → A, where A is an abelian variety over k with a dense set of k-rational points, we prove that there is a finite-index coset C ⊂ A(k) such that π(X(k)) is disjoint from C. Our results do not seem to be in the range of other methods available at present; they confirm predictions coming from Lang’s conjectures on rational points, and also go in the direction of an issue raised by Serre regarding possible applications to the Inverse Galois Problem. Finally, the conclusions of our work may be seen as a sharp version of Hilbert’s irreducibility theorem for abelian varieties. 1 Introduction Let X be a ramified cover of an abelian variety over a number field K. The aim of this paper is to prove novel results on the distribution of rational points on X. In this work we are guided by Lang’s conjectures on varieties of general type, and by a question of Serre on covers of abelian varieties. By Kawamata’s structure result for ramified covers of abelian varieties [Kaw81], for every ramified cover X A of an abelian variety A a number field K, there is a finite field → ′ ′ extension L/K and finite ´etale cover X XL such that X dominates a positive-dimensional variety of general type over L.
    [Show full text]
  • Inverse Galois Problem
    Inverse Galois Problem A Thesis submitted to Indian Institute of Science Education and Research Pune in partial fulfillment of the requirements for the BS-MS Dual Degree Programme by Abhishek Kumar Shukla Indian Institute of Science Education and Research Pune Dr. Homi Bhabha Road, Pashan, Pune 411008, INDIA. April, 2016 Supervisor: Steven Spallone c Abhishek Kumar Shukla 2016 All rights reserved Acknowledgments I would like to extend my sincere and heartfelt gratitude towards Dr. Steven Spallone for his constant encouragement and able guidance at every step of my project. He has invested a great deal of time and effort in my project, and this thesis would not have been possible without his mentorship. I would like to thank my thesis committee member Prof. Michael D.Fried for his guidance and valuable inputs throughout my project. I am grateful to Dr. Vivek Mallick, Dr. Krishna Kaipa and Dr. Supriya Pisolkar for patiently answering my questions. v vi Abstract In this thesis, motivated by the Inverse Galois Problem, we prove the occurence of Sn as Galois group over any global field. While Hilbert's Irreducibility Theorem, the main ingredient of this proof, can be proved(for Q) using elementary methods of complex analysis, we do not follow this approach. We give a general form of Hilbert's Irreducibility Theorem which says that all global fields are Hilbertian. Proving this takes us to Riemann hypothesis for curves and Chebotarev Density Theorem for function fields. In addition we prove the Chebotarev Density Theorem for Number Fields. The main reference for this thesis is [1] and the proofs are borrowed from the same.
    [Show full text]
  • The Inverse Galois Problem: the Rigidity Method
    The Inverse Galois Problem: The Rigidity Method Amin Saied Department of Mathematics, Imperial College London, SW7 2AZ, UK CID:00508639 June 24, 2011 Supervisor: Professor Martin Liebeck Abstract The Inverse Galois Problem asks which finite groups occur as Galois groups of extensions of Q, and is still an open problem. This project explores rigidity, a powerful method used to show that a given group G occurs as a Galois group over Q. It presents the relevant theory required to understand this approach, including Riemann's Existence Theorem and Hilbert's Irreducibility Theorem, and applies them to obtain specific conditions on the group G in question, which, if satisfied say that G occurs as a Galois group over the rationals. These ideas are then applied to a number of groups. Amongst other results it is explicitly shown that Sn;An and P SL2(q) for q 6≡ ±1 mod 24 occur as Galois groups over Q. The project culminates in a final example, highlighting the power of the rigidity method, as the Monster group is realised as a Galois group over Q. Contents 1 Introduction 2 1.1 Preliminary Results . 2 1.2 A Motivating Example . 4 2 Riemann's Existence Theorem 5 2.1 The Fundamental group . 5 2.2 Galois Coverings . 7 2.3 Coverings of the Punctured Sphere . 8 3 Hilbertian Fields 13 3.1 Regular Extensions . 13 3.2 Hilbertian Fields . 14 3.3 Galois Groups Over Hilbertian Fields . 19 3.3.1 Sn as a Galois group over k .......................... 20 4 Rigidity 21 4.1 Laurent Series Fields .
    [Show full text]
  • The Inverse Galois Problem for P-Adic Fields
    Counting Problem Enumeration Problem Algebraic Tori The inverse Galois problem for p-adic fields David Roe Department of Mathematics University of Pittsburgh November 13, 2017 Counting Problem Enumeration Problem Algebraic Tori Outline 1 Counting Problem 2 Enumeration Problem 3 Algebraic Tori Counting Problem Enumeration Problem Algebraic Tori Inverse Galois Problem Classic Problem: determine if a finite G is a Galois group. Depends on base field: every G is a Galois group over C(t). Most work focused on L/Q: S n and An, every solvable group, every sporadic group except possibly M23;::: Generic polynomials fG(t1;:::; tr; X) are known for some (G; K): every L/K with group G is a specialization. Computational Problems Given a finite group G, find algorithms for 1 Existence problem: exist L/Qp with Gal(L/Qp) G? 2 Counting problem: how many such L exist (always finite)? 3 Enumeration problem: list the L. Counting Problem Enumeration Problem Algebraic Tori Extensions of p-adic fields If L/K is an extension of p-adic fields, it decomposes: L Wild – totally ramified, degree a power of p. wild Tame – totally ramified, degreep relatively prime to p. Have L = L ( n π) for some Lt t u uniformizer π 2 Lu. tame Unramified – there is a unique unramified Lu extension of each degree: equivalence of unram categories with extensions of the residue field. K Counting Problem Enumeration Problem Algebraic Tori Filtrations of p-adic Galois groups The splitting of L/K into unramified, tame and wild pieces induces a filtration on Gal(L/K). We can refine this filtration to G D G0 D G1 D G2 D ··· D Gr = 1: For every i, Gi E G; G G/G0 = hσi is cyclic, and L 0 = Lu; −1 q G0/G1 = hτi is cyclic, order prime to p and σ τσ = τ ; ki For 0 < i < r, Gi/Gi+1 Fp .
    [Show full text]