PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] proof that the cyclotomic polynomial is irreducible (Proof)

We first prove that $\Phi_n(x) \in \Z[x]$ . The field extension $\Q(\zeta_n)$ of $\Q$ is the splitting field of the polynomial $x^n - 1 \in \Q[x]$ , since it splits this polynomial and is generated as an algebra by a single root of the polynomial. Since splitting fields are normal, the extension $\Q(\zeta_n)/\Q$ is a Galois extension. Any element of the Galois group, being a field automorphism, must map $\zeta_n$ to another root of unity of exact order $n$ . Therefore, since the Galois group of $\Q(\zeta_n)/\Q$ permutes the roots of $\Phi_n(x)$ , it must fix the coefficients of $\Phi_n(x)$ , so by Galois theory these coefficients are in $\Q$ . Moreover, since the coefficients are algebraic integers, they must be in $\Z$ as well.

Let $f(x)$ be the minimal polynomial of $\zeta_n$ in $\Q[x]$ . Then $f(x)$ has integer coefficients as well, since $\zeta_n$ is an algebraic integer. We will prove $f(x) = \Phi_n(x)$ by showing that every root of $\Phi_n(x)$ is a root of $f(x)$ . We do so via the following claim:

Claim: For any prime $p$ not dividing $n$ , and any primitive $n^{\rm th}$ root of unity $\zeta \in \mathbb{C}$ , if $f(\zeta) = 0$ then $f(\zeta^p) = 0$ .

This claim does the job, since we know $f(\zeta_n) = 0$ , and any other primitive $n^{\rm th}$ root of unity can be obtained from $\zeta_n$ by successively raising $\zeta_n$ by prime powers $p$ not dividing $n$ a finite number of times 1.

To prove this claim, consider the factorization $x^n - 1 = f(x) g(x)$ for some polynomial $g(x) \in \Z[x]$ . Writing $\O$ for the ring of integers of $\Q(\zeta_n)$ , we treat the factorization as taking place in $\O[x]$ and proceed to mod out both sides of the factorization by any prime ideal $\p$ of $\O$ lying over $(p)$ . Note that the polynomial $x^n - 1$ has no repeated roots mod $\p$ , since its derivative $n x^{n-1}$ is relatively prime to $x^n - 1$ mod $\p$ . Therefore, if $f(\zeta) = 0 \bmod \p$ , then $g(\zeta) \neq 0 \bmod \p$ , and applying the $p^{\rm th}$ power Frobenius map to both sides yields $g(\zeta^p) \neq 0 \bmod \p$ . This means that $g(\zeta^p)$ cannot be 0 in $\mathbb{C}$ , because it doesn't even equal $0 \bmod \p$ . However, $\zeta^p$ is a root of $x^n - 1$ , so if it is not a root of $g$ , it must be a root of $f$ , and so we have $f(\zeta^p) = 0$ , as desired.



Footnotes

... times1
Actually, if one applies Dirichlet's theorem on primes in arithmetic progressions here, it turns out that one prime is enough, but we do not need such a sharp result here.



"proof that the cyclotomic polynomial is irreducible" is owned by djao.
(view preamble | get metadata)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: even, Frobenius map, relatively prime, derivative, prime ideal, sides, place, ring of integers, Dirichlet's theorem on primes in arithmetic progressions, number, primitive, prime, integer, minimal polynomial, algebraic integers, Galois theory, coefficients, fix, order, root of unity, map, automorphism, field, Galois group, Galois extension, extension, normal, root, algebra, polynomial, splitting field, field extension

This is version 6 of proof that the cyclotomic polynomial is irreducible, born on 2002-05-08, modified 2005-04-03.
Object id is 2897, canonical name is ProofThatTheCyclotomicPolynomialIsIrreducible.
Accessed 7955 times total.

Classification:
AMS MSC11C08 (Number theory :: Polynomials and matrices :: Polynomials)
 11R18 (Number theory :: Algebraic number theory: global fields :: Cyclotomic extensions)
 11R60 (Number theory :: Algebraic number theory: global fields :: Cyclotomic function fields )
 12E05 (Field theory and polynomials :: General field theory :: Polynomials )

Pending Errata and Addenda
None.
[ View all 4 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)