Section X.55. Cyclotomic Extensions

Similar documents
Quasi-reducible Polynomials

Galois Theory, summary

Section V.8. Cyclotomic Extensions

GALOIS THEORY. Contents

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

Section IV.23. Factorizations of Polynomials over a Field

UNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY

Classification of Finite Fields

Section V.7. Cyclic Extensions

CONSTRUCTIBLE NUMBERS AND GALOIS THEORY

Page Points Possible Points. Total 200

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

Section 33 Finite fields

Math 210B: Algebra, Homework 6

Section VI.33. Finite Fields

Section V.6. Separability

1 The Galois Group of a Quadratic

Galois Theory TCU Graduate Student Seminar George Gilbert October 2015

Field Theory Problems

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

Field Theory Qual Review

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

Solutions of exercise sheet 6

Practice problems for first midterm, Spring 98

Galois theory (Part II)( ) Example Sheet 1

The primitive root theorem

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

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

Course 311: Abstract Algebra Academic year

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

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.

FIELD THEORY. Contents

Keywords and phrases: Fundamental theorem of algebra, constructible

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

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

Introduction to finite fields

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

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

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

Chapter 4. Fields and Galois Theory

A Generalization of Wilson s Theorem

Some algebraic number theory and the reciprocity map

Galois Theory and Some Applications

Explicit Methods in Algebraic Number Theory

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

Bulletin of the Transilvania University of Braşov Vol 7(56), No Series III: Mathematics, Informatics, Physics, 59-64

CYCLOTOMIC POLYNOMIALS

MATH 361: NUMBER THEORY FOURTH LECTURE

18. Cyclotomic polynomials II

Section III.6. Factorization in Polynomial Rings

An Additive Characterization of Fibers of Characters on F p

CYCLOTOMIC POLYNOMIALS

Name: Solutions Final Exam

The following results are from the review sheet for the midterm.

ON VALUES OF CYCLOTOMIC POLYNOMIALS. V

NOVEMBER 22, 2006 K 2

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

NOTES ON FINITE FIELDS

Elementary Properties of Cyclotomic Polynomials

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

Number Theory and Algebraic Equations. Odile Marie-Thérèse Pons

A BRIEF INTRODUCTION TO LOCAL FIELDS

TC10 / 3. Finite fields S. Xambó

Math 121 Homework 2 Solutions

GALOIS THEORY: LECTURE 24

1 Structure of Finite Fields

FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS

INTRODUCTION TO GALOIS THEORY. 1. Introduction and History. one of the most interesting and dramatic tales in the history of mathematics.

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

Math 121 Homework 3 Solutions

Notes on Primitive Roots Dan Klain

Part II. Number Theory. Year

SEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS

Linear Algebra, 3rd day, Wednesday 6/30/04 REU Info:

GALOIS THEORY I (Supplement to Chapter 4)

1. Group Theory Permutations.

A Harvard Sampler. Evan Chen. February 23, I crashed a few math classes at Harvard on February 21, Here are notes from the classes.

Finite fields Michel Waldschmidt

Theory of Numbers Problems

Test 2. Monday, November 12, 2018

ALGEBRA HW 9 CLAY SHONKWILER

arxiv: v1 [math.gr] 3 Feb 2019

An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.

Zsigmondy s Theorem. Lola Thompson. August 11, Dartmouth College. Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, / 1

Factorization in Integral Domains II

Ideals: Definitions & Examples

be any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism

1 Finite abelian groups

Part II Galois Theory

MT5836 Galois Theory MRQ

CSIR - Algebra Problems

SOLUTIONS Math 345 Homework 6 10/11/2017. Exercise 23. (a) Solve the following congruences: (i) x (mod 12) Answer. We have

Algebraic proofs of Dirichlet s theorem on arithmetic progressions

LECTURE NOTES IN CRYPTOGRAPHY

arxiv: v1 [math.nt] 2 Jul 2009

Public-key Cryptography: Theory and Practice

CS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II

Galois Theory of Cyclotomic Extensions

DIVISIBLE MULTIPLICATIVE GROUPS OF FIELDS

NOTES ON GALOIS THEORY Alfonso Gracia-Saz, MAT 347

Transcription:

X.55 Cyclotomic Extensions 1 Section X.55. Cyclotomic Extensions Note. In this section we return to a consideration of roots of unity and consider again the cyclic group of roots of unity as encountered in Part I. Primitive roots of unity are defined and we classify which regular n-gons are constructible with a straight edge and compass. Definition 55.1. The splitting field of x n 1 over field F is the nth cyclotomic extension of F. Note. If α is a zero of x n 1 F[x], then x α is a factor of x n 1 by the Factor Theorem (Corollary 3.3). Consider g(x) = (x n 1)/(x α) (that is, perform the division and cancellation so that g(x) is then a polynomial of degree n 1). Then g(α) = (n 1)α 1 0 provided the characteristic of F does not divide n (see page 303 for the computation). So, under this condition on the characteristic of F, any zero of x n 1 is a zero of multiplicity 1 and by Note of Section 51, the splitting field of x n 1 is separable. Therefore, the nth cyclotomic extension of F is a finite normal extension (and so the Main Theorem of Galois Theory, Theorem 53.6, applies).

X.55 Cyclotomic Extensions Note. Recall that the nth roots of unity in C form the group U n and U n is isomorphic to Z n. So U n is a cyclic group. The elements of U n which generate U n are called primitive roots of unity (this definition is given in the exercises of Section 6). By Corollary 6.16, a cyclic group of order n has φ(n) generators, where φ is the Euler phi-function (φ(n) is the number of positive integers less than n which are relatively prime to n). So U n has φ(n) generators the φ(n) primitive nth roots of unity. Definition 55.. The polynomial φ(n) Φ n (x) = (x α i ) i=1 where the α i are the primitive nth roots of unity in F, is the nth cyclotomic polynomial over F. Note. With K as the splitting field of x n 1 over field F, we know by Corollary 48.5 that an automorphism in the Galois group G(K/F) must permute the primitive nth roots of unity. So the coefficients of Φ n (x) are left fixed under such an automorphism and so Φ n (x) is left fixed under every element of G(K/F) regarded as extended to K[x]. Therefore Φ n (x) F[x]. In particular, in the case when F = Q, we have Φ n (x) Q[x] and Φ n (x) is a divisor of x n 1. by Theorem 3.11, we have Φ n (x) Z[x]. We now claim without proof that Φ n (x) is irreducible over Q (for a proof, see Proposition V.8.3(i) of Thomas Hungerford s Algebra, Springer Verlag, 1974).

X.55 Cyclotomic Extensions 3 Example 55.3. Find the primitive 8th roots of unity in C and find Φ n (x). Solution. ( ) We know ( from ) Section 1 that the 8th roots of unity are of the form kπ kπ cos + i sin for k = 0,1,,...,7. By Corollary 6.16, the generators 8 8 of U 8 (and hence the primitive 8th roots of unity) are given when k is relatively prime to 8. That is, the primitive roots are given by k = 1,3,5,7 (notice that φ(8) = 4). With k = 1, we have ζ = cos ( ( π 4) +i sin π ) 4 = +i. So the primitive 8th roots of unity are ζ = + i, ζ3 = + i, ζ5 = i, ζ7 = i. Then Φ 8 (x) = (x ζ)(x ζ 3 )(x ζ 5 )(x ζ 7 ). As shown in Exercise 55.1, this reduces to Φ 8 (x) = x 4 + 1. Theorem 55.4. The Galois group of the nth cyclotomic extension of Q has φ(n) elements and is isomorphic to the group consisting of the positive integers less than n and relatively prime to n under multiplication modulo n. Example 55.5. In Example 54.7, we saw that the splitting field K of Φ 8 (x) = x 4 +1 satisfies G(K/Q) = {σ 1,σ 3,σ 5,σ 7 } and G(K/Q) = G 8 = {1,3,5,7}, 8. Corollary 55.6. The Galois group of the pth cyclotomic extension of Q for a prime p is cyclic of order p 1.

X.55 Cyclotomic Extensions 4 Note. We now have the equipment to address the construction of regular n- gons with a compass and straight edge. Notice that the central angle determined by a side of a regular n-gon is π/n. So a regular n-gon is constructible if and only if angle π/n is constructible. By the Lemma to Theorem 3.11 (see the video supplement to Section 3), π/n is constructible if and only if cos(π/n) is constructible. So a regular n-gon is constructible if and only if cos(π/n) is constructible. Definition. A prime number of the form (k) + 1 for non-negative integer k is a Fermat prime. Note. The only known Fermat primes are 3, 5, 17, 57, and 65,537 which correspond to k = 0,1,,3,4, respectively. For 5 k 19, (k) + 1 is a composite number. It is unknown if k = 0 produces a composite or a prime number. It is unknown whether the number of Fermat primes is finite or infinite (see page 468). Lemma 1. If the regular n-gon is constructible with a compass and straight edge then all odd primes dividing n are Fermat primes whose squares do not divide n. Example 55.7. The regular 7-gon is the smallest (in terms of the number of sides) n-gon which is not constructible. Notice that for n 0, the regular n-gon with n {7,9,11,13,14,18,19} is not constructible.

X.55 Cyclotomic Extensions 5 Lemma. If all odd primes dividing n are Fermat primes whose squares do not divide n, then the regular n-gon is constructible with a compass and straight edge. Note. Lemmas 1 and combine to give us: Theorem 55.8. The regular n-gon is constructible with a compass and straight edge if and only if all the odd primes dividing n are Fermat primes whose squares do not divide n. Note. Euclid s Elements gives constructions of regular n-gons for n {3, 4, 5, 6, 15}. By combining these results, one could also construct n-gons for n {8,10,1,16,0}. By Theorem 55.8, this covers all admissible cases where n 0, except for n = 17. Theorem 55.8 implies that a 17-gon is constructible, since 17 is a Fermat prime. As commented in the notes for Section 33, Gauss showed that a regular 17-gon can be constructed with a compass and straight edge. He did not actually give the construction, but only showed that it existed. The first explicit construction of a 17-gon was given by Ulrich von Huguenin in 1803. H. W. Richmond found a simpler version in 1893. (see page 136 of Why Beauty is Truth: A History of Symmetry by Ian Stewart, NY: Basic Books, 007). It seems surprising that a question addressed in Euclid s Elements was picked up in the 19th century and taken taken further down the field! Revised: 4/5/014