Section V.8. Cyclotomic Extensions

Similar documents
Section V.7. Cyclic Extensions

Section V.6. Separability

Galois Theory, summary

Section X.55. Cyclotomic Extensions

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

1 The Galois Group of a Quadratic

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

Section VI.33. Finite Fields

NOTES ON FINITE FIELDS

Quasi-reducible Polynomials

GALOIS THEORY. Contents

Chapter 4. Fields and Galois Theory

FIELD THEORY. Contents

Part II Galois Theory

Galois theory (Part II)( ) Example Sheet 1

1 Finite abelian groups

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

Department of Mathematics, University of California, Berkeley

Galois Theory of Cyclotomic Extensions

Galois Theory TCU Graduate Student Seminar George Gilbert October 2015

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

Section 33 Finite fields

CONSTRUCTIBLE NUMBERS AND GALOIS THEORY

Page Points Possible Points. Total 200

Jean-Pierre Escofier. Galois Theory. Translated by Leila Schneps. With 48 Illustrations. Springer

GALOIS THEORY: LECTURE 24

A connection between number theory and linear algebra

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

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

D-MATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions.

Section III.6. Factorization in Polynomial Rings

Factorization in Integral Domains II

Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

ALGEBRA PH.D. QUALIFYING EXAM SOLUTIONS October 20, 2011

Course 311: Abstract Algebra Academic year

Practice problems for first midterm, Spring 98

Factorization in Polynomial Rings

Part II Galois Theory

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

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

ALGEBRA 11: Galois theory

18. Cyclotomic polynomials II

Field Theory Problems

CYCLOTOMIC EXTENSIONS

List of topics for the preliminary exam in algebra

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

Section IV.23. Factorizations of Polynomials over a Field

Chapter 5. Modular arithmetic. 5.1 The modular ring

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

Introduction to finite fields

(January 14, 2009) q n 1 q d 1. D = q n = q + d

Section V.3. Splitting Fields, Algebraic Closure, and Normality (Supplement)

THE CYCLOTOMIC EQUATION AND ITS SIGNIFICANCE TO SOLVING THE QUINTIC EQUATION

SEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS

arxiv: v1 [math.gr] 3 Feb 2019

An Additive Characterization of Fibers of Characters on F p

AN INTRODUCTION TO GALOIS THEORY

Section V.2. The Fundamental Theorem (of Galois Theory)

Section V.9. Radical Extensions

1. Group Theory Permutations.

Fields and Galois Theory Fall 2004 Professor Yu-Ru Liu

NOTES ON GALOIS THEORY Alfonso Gracia-Saz, MAT 347

Keywords and phrases: Fundamental theorem of algebra, constructible

QUALIFYING EXAM IN ALGEBRA August 2011

GALOIS THEORY AT WORK: CONCRETE EXAMPLES

Topics in Inverse Galois Theory

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

Department of Mathematics Cornell University Ithaca, New York July 21, 2011

Explicit Methods in Algebraic Number Theory

CYCLOTOMIC FIELDS CARL ERICKSON

Profinite Groups. Hendrik Lenstra. 1. Introduction

CYCLOTOMIC POLYNOMIALS

Notes on Galois Theory

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

ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008

CYCLOTOMIC POLYNOMIALS

Fields and Galois Theory

A NECESSARY AND SUFFICIENT CONDITION FOR THE PRIMALITY OF FERMAT NUMBERS

Galois Theory and Some Applications

Galois theory of fields

Abstract Algebra: Chapters 16 and 17

Field Theory Qual Review

Algebraic Cryptography Exam 2 Review

TC10 / 3. Finite fields S. Xambó

GALOIS THEORY : LECTURE 12

A Generalization of Wilson s Theorem


THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - SPRING SESSION ADVANCED ALGEBRA II.

FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS

MTH 401: Fields and Galois Theory

Public-key Cryptography: Theory and Practice

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

Solutions of exercise sheet 6

IUPUI Qualifying Exam Abstract Algebra

Finite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay

Notes on Primitive Roots Dan Klain

5 Algebraicially closed fields and The Fundamental Theorem of Algebra

Galois theory - Wikipedia, the free encyclopedia

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

Transcription:

V.8. Cyclotomic Extensions 1 Section V.8. Cyclotomic Extensions Note. In this section we explore splitting fields of x n 1. The splitting fields turn out to be abelian extensions (that is, algebraic Galois extensions with abelian Galois groups). Theorem V.8.1 is used in the proof of Theorem V.9.4 (which is on radical extensions and solvable groups), but the remainder of this chapter is not needed for what follows and may be skipped if we are short on time. Definition. A splitting field F over a field K of polynomial x n 1 K K[x] (where n 1) is a cyclotomic extension of order n. Note. If char(k) divides n, say char(k) = p 0 and n = mp t where gcd(p,m) = (p,m) = 1 then by the Freshman s Dream (Exercise III.1.11; we can also use the Binomial Theorem, Theorem III.1.6, here) (x m 1) pt = x mpt 1 pt = x n 1 and so a cyclotomic extension of order n coincides with one of order m. So we only consider (without loss of generality) cases where char(k) does not divide n; that is, cases where either char(k) = 0 or car(k) = p where (p,n) = 1).

V.8. Cyclotomic Extensions 2 Recall. The Euler phi function is defined on N as ϕ(n) equals the number of elements in the set {1,2,...,n} which are relatively prime to n. For example, for prime p, ϕ(p) = p 1. In Exercise V.8.4 it is shown that the order of the multiplicative group of units in Z n is ϕ(n) (recall that an element of a ring is a unit if it has a multiplicative inverse). Theorem V.8.1. Let n N, let K be a field such that char(k) does not divide n, and let F be a cyclotomic extension of K of order n. Then the following hold. (i) F = K(ζ) where ζ F is a primitive nth root of unity. (ii) F is an abelian extension of dimension d where d ϕ(n); if n is prime then F is actually a cyclic extension. (iii) Aut K (F) is isomorphic to a subgroup of order d of the multiplicative group of units of Z n. Note. The dimension of F over K in Theorem V.8.1 may be strictly less than ϕ(n). For example, let ζ be a primitive 5th root of unity. Then [R(ζ) : R] = 2 (see Corollary V.3.20 and its proof; or find an irreducible second degree polynomial in R[x] for which the primitive 4th root of unity is a root). But ϕ(5) = 4 and so [R(ζ) : R] = 2 < 4 = ϕ(n).

V.8. Cyclotomic Extensions 3 Definition. Let n N, let F be a field such that char(k) does not divide n, and let F be a cyclotomic extension of order n of K. The nth cyclotomic polynomial over K is the monic polynomial g n (x) = (x ζ 1 )(x ζ 2 ) (x ζ r ) where ζ 1,ζ 2,...,ζ r are all the distinct primitive nth roots of unity in F. Example. If K = Q, then the 1th root of unity is 1 (which is trivially a primitive root) and so g 1 (x) = x 1. The only primitive 2th root of unity is 1 and so g 2 (x) = x ( 1) = x + 1. The primitive 3rd roots of unity are 1/2 + ( 3/2)i and 1/2 ( 3/2)i, so g 3 (x) = (x ( 1/2 + ( 3/2)i))(x ( 1/2 ( 3/2)i) = x 2 + x + 1. The primitive 4th roots of unity are i and i, so g 4 (x) = (x i)(x + i) = x 2 + 1. Since 5 is prime then all 5th roots of unity are primitive except x = 1, so In general, if p is prime then similarly g 5 (x) = x5 1 x 1 = x4 + x 3 + x 2 + x + 1. g p (x) = x5 1 x 1 = xp 1 + x p 2 + x 2 + x + 1. Theorem V.8.2. Let n N, let K be a field such that char(k) does not divide n, and let g n (x) be the nth cyclotomic polynomial over K. Then the following hold. (i) x n 1 K = d n g d(x). (ii) The coefficients of g n (x) lie in the prime subfield P of K. If char(k) = 0 and P is identified with the field Q of rationals, then the coefficients are actually integers. (iii) Deg(g n (x)) = ϕ(n) where ϕ is the Euler phi function.

V.8. Cyclotomic Extensions 4 Note. By Theorem V.8.2(i) gives a recursive formula for g n : g n (x) = As previously observed, if p is prime then x n 1 K d n,d<n g d(x). g p (x) = xp 1 K g 1 (x) = xp 1 K x 1 K = x p 1 + x p 1 + + x 2 + x + 1. Based on the example above with K = Q: g 6 (x) = x 6 1 g 1 (x)g 2 (x)g 3 (x) = x 6 1 (x 1)(x + 1)(x 2 + x + 1) = x2 x + 1, and so = g 12 (x) = x 12 1 g 1 (x)g 2 (x)g 3 (x)g 4 (x)g 6 (x) x 12 1 (x 1)(x + 1)(x 2 + x + 1)(x 2 x + 1) = x4 x 2 + 1. Note. If we take the base field as K = Q (of characteristic 0, of course) then we can refine the previous results, as follows. Proposition V.8.3. Let F be a cyclotomic extension of order n of the field Q of rational numbers and g n (x) the nth cyclotomic polynomial over Q. Then the following hold. (i) g n (x) is irreducible in Q[x]. (ii) [F : Q] = ϕ(n) where ϕ is the Euler function. (iii) Aut Q (F) is isomorphic to the multiplicative group of units in the ring Z n.

V.8. Cyclotomic Extensions 5 Note. The Kronecker-Weber Theorem states that Every abelian extension of Q is contained in a cyclotomic extension of Q. An elementary proof is given by M. J. Greenberg in An Elementary Proof of the Kronecker-Weber Theorem, American Mathematical Monthly, 81(6), 601 607 (1974). However, this proof requires results from ramification theory (a branch of commutative algebra). According to Wikipedia (en.wikipedia.org/wiki/kronecker-weber theorem; accessed July 9, 2015), the result was first stated by Leopold Kronecker who gave an incomplete proof in 1853. In 1886, Heinrich Martin Weber published a proof with some gaps and errors. The first complete proof was given by David Hilbert in 1896. Note. Returning to the topic of ruler and compass constructions (from the appendix to Section V.5.1), we can use our knowledge of cyclotomic extensions to give necessary and sufficient conditions by which a regular n-gon can be constructed with a ruler and compass. The conditions (which involve Fermat primes) were originally shown to be necessary by Gauss. However, he did not show the conditions were necessary. The problem was completely solved by Pierre Wantzel in 1837 and published as Recherches sur les moyens de reconnaître si un Problème de Géométrie peut se résoudre avec la règle et le compas in Journal de Mathématiques Pures et Appliquées 1(2), 366-372. In this paper he also proved the impossibility of doubling the cube and trisecting an angle. For more details, see my class notes based on Fraleigh s A First Course in Abstract Algebra, 7th edition: http://faculty.etsu.edu/gardnerr/4127/notes/vi-32.pdf and http://faculty.etsu.edu/gardnerr/4127/notes/x-55.pdf Revised: 1/2/2016