# 18. Cyclotomic polynomials II

Size: px
Start display at page:

Transcription

1 18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients in various fields, but as universal things, having coefficients in Z. [1] Most of this discussion is simply a rewrite of the earlier discussion with coefficients in fields, especially the case of characteristic 0, paying attention to the invocation of Gauss lemma. A new point is the fact that the coefficients lie in Z. Also, we note the irreducibility of Φ p (x) for prime p in both Z[x] and Q[x], via Eisenstein s criterion (and Gauss lemma, again). 1. Cyclotomic polynomials over Z Define Φ 1 (x) = x 1 Z[x] and for n > 1 try to define [2] x n 1 Φ n (x) = d n, d<n Φ d(x) We prove inductively that Φ n (x) is monic, has integer coefficients, and has constant coefficient ±1. First, we claim that x n 1 Z[x] has no repeated factors. The greatest common divisor of its coefficients is 1, so by Gauss lemma any irreducible factors can be taken to be monic polynomials with integer coefficients which are irreducible in Q[x], not merely in Z[x]. Thus, it suffices to compute the greatest common divisor of x n 1 and its derivative nx n 1 in Q[x]. Since n is invertible in Q, (x n 1) x n nxn 1 = 1 [1] Given any field k, there is a unique Z-algebra homomorphism Z[x] k[x] sending x to x and 1 to 1. Thus, if we can successfully demonstrate properties of polynomials in Z[x] then these properties descend to any particular k[x]. In particular, this may allow us to avoid certain complications regarding the characteristic of the field k. [2] It is not immediately clear that the denominator divides the numerator, for example. 233

2 234 Cyclotomic polynomials II Thus, there are no repeated factors [3] in x n 1. Next, note that in Z[x] we still do have the unlikely-looking gcd(x m 1, x n 1) = x gcd(m,n) 1 Again, the gcd of the coefficients of each polynomial is 1, so by Gauss lemma the gcd of the two polynomials can be computed in Q[x] (and will be a monic polynomial with integer coefficients whose gcd is 1). Taking m n without loss of generality, (x n 1) x n m (x m 1) = x n m 1 For n = qm + r with 0 r < m, repeating this procedure q times allows us to reduce n modulo m, finding that the gcd of x n 1 and x m 1 is the same as the gcd of x m 1 and x r 1. In effect, this is a single step in the Euclidean algorithm applied to m and n. Thus, by an induction, we obtain the assertion. Claim that in Z[x], for m < n, Φ m (x) and Φ n (x) have no common factor. Again, by induction, they have integer coefficients with gcd 1, so by Gauss lemma any common factor has the same nature. Any common factor would be a common factor of x n 1 and x m 1, hence, by the previous paragraph, a factor of x d 1 where d = gcd(m, n). Since m n, d must be a proper factor n, and by its recursive definition x n 1 Φ n (x) = δ n, δ<n Φ δ(x) divides xn 1 δ d Φ δ(x) = divides xn 1 x d 1 Thus, since x n 1 has no repeated factors, Φ n (x) shares no common factors with x d 1. Thus, for m < n, Φ m (x) and Φ n (x) have greatest common factor 1. Therefore, in the attempted definition x n 1 Φ n (x) = d n, d<n Φ δ(x) by induction the denominators in the right-hand side have no common factor, all divide x n 1, so their product divides x n 1, by unique factorization in Z[x]. Thus, the apparent definition of Φ n (x) as a polynomial with integer coefficients succeeds. [4] Also, by induction, from x n 1 = d n, d n the constant coefficient of Φ n (x) is ±1. And Φ n (x) is monic. Finally, note that for p prime Φ p (x + 1) = (x + 1)p 1 (x + 1) 1 = xp 1 + ( ) p x p Φ δ (x) ( ) ( ) ( ) p p p x p x + 2 p 2 p 1 This has all lower coefficients divisible by p, and the constant coefficient is exactly p, so is not divisible by p 2. Thus, by Eisenstein s criterion, Φ p (x) is irreducible in Z[x]. By Gauss lemma, it is irreducible in Q[x]. [3] We had noted this earlier, except the conclusion was weaker. Previously, we could only assert that there were no repeated factors in Q[x], since we knew that the latter ring was Euclidean, hence a PID. One weakness of that viewpoint is that it does not directly tell anything about what might happen over finite fields. Treating integer coefficients is the universal. [4] Proving that the cyclotomic polynomials have integer coefficients is more awkward if one cannot discuss unique factorization in Z[x].

3 Garrett: Abstract Algebra Worked examples [18.1] Prove that a finite division ring D (a not-necessarily commutative ring with 1 in which any non-zero element has a multiplicative inverse) is commutative. (This is due to Wedderburn.) (Hint: Check that the center k of D is a field, say of cardinality q. Let D act on D by conjugation, namely α β = αβα 1, and count orbits, to obtain an equality of the form D = q n = q + d q n 1 q d 1 where d is summed over some set of integers all strictly smaller than n. Let Φ n (x) be the n th cyclotomic polynomial. Show that, on one hand, Φ n (q) divides q n q, but, on the other hand, this is impossible unless n = 1. Thus D = k. ) First, the center k of D is defined to be k = center D = {α D : αx = xα for all x D} We claim that k is a field. It is easy to check that k is closed under addition, multiplication, and contains 0 and 1. Since α = ( 1) α, it is closed under taking additive inverses. There is a slight amount of interest in considering closure under taking multiplicative inverses. Let 0 α k, and x D. Then left-multiply and right-multiply αx = xα by α 1 to obtain xα 1 = α 1 x. This much proves that k is a division ring. Since its elements commute with every x D certainly k is commutative. This proves that k is a field. The same argument shows that for any x D the centralizer D x = centralizer of x = {α D : αx = xα} is a division ring, though possibly non-commutative. It certainly contains the center k, so is a k-vectorspace. Noting that αx = xα is equivalent to αxα 1 = x for α invertible, we see that D x is the pointwise fixer of x under the conjugation action. Thus, the orbit-counting formula gives D = k + [D : D x ] non-central orbits O x where the center k is all singleton orbits and O x is summed over orbits of non-central elements, choosing representatives x for O x. This much did not use finiteness of D. Let q = k, and n = dim k D. Suppose n > 1. Let n x = dim k D x. Then q n = q + non-central orbits O x In all the non-central orbit summands, n > n x. Rearranging, q n 1 q nx 1 q 1 = (q n 1) + non-central orbits O x q n 1 q nx 1 Let Φ n (x) be the n th cyclotomic polynomial, viewed as an element of Z[x]. Then, from the fact that the recursive definition of Φ n (x) really does yield a monic polynomial of positive degree with integer coefficients

4 236 Cyclotomic polynomials II (and so on), and since n x < n for all non-central orbits, the integer Φ n (q) divides the right-hand side, so divides q 1. We claim that as a complex number Φ n (q) > q 1 for n > 1. Indeed, fix a primitive n th root of unity ζ C. The set of all primitive n th roots of unity is {ζ a } where 1 a p prime to p. Then Φ n (q) 2 = q ζ a 2 [ = (q Re(ζ a )) 2 + (Im(ζ a )) 2] a: gcd(a,n)=1 a: gcd(a,n)=1 Since ζ = 1, the real part is certainly between 1 and +1, so q Re(ζ a ) > q 1 unless Re(ζ a ) = 1, which happens only for ζ a = 1, which can happen only for n = 1. That is, for n > 1, the integer Φ n (q) is a product of complex numbers each larger than q 1, contradicting the fact that Φ n (q) (q 1). That is, n = 1. That is, there are no non-central orbits, and D is commutative. [18.2] Let q = p n be a (positive integer) power of a prime p. Let F : F q F q by F (α) = α p be the Frobenius map over F p. Let S be a set of elements of F q stable under F (that is, F maps S to itself). Show that the polynomial (x α) has coefficients in the smaller field F p. α S Since the set S is Frobenius-stable, application of the Frobenius to the polynomial merely permutes the linear factors, thus leaving the polynomial unchanged (since the multiplication of the linear factors is insensitive to ordering.) Thus, the coefficients of the (multiplied-out) polynomial are fixed by the Frobenius. That is, the coefficients are roots of the equation x p x = 0. On one hand, this polynomial equation has at most p roots in a given field (from unique factorization), and, on the other hand, Fermat s Little Theorem assures that the elements of the field F p are roots of that equation. Thus, any element fixed under the Frobenius lies in the field F p, as asserted. [18.3] Let q = p n be a power of a prime p. Let F : F q F q by F (α) = α p be the Frobenius map over F p. Show that for every divisor d of n that the fixed points of F d form the unique subfield F p d of F q of degree d over the prime field F p. This is similar to the previous example, but emphasizing a different part. Fixed points of the d th power F d of the Frobenius F are exactly the roots of the equation x pd x = 0 of x(x pd 1 1) = 0. On one hand, a polynomial has at most as many roots (in a field) as its degree. On the other hand, F p d is of order p d 1, so every element of F p d is a root of our equation. There can be no more, so F p d is exactly the set of roots. [18.4] Let f(x) be a monic polynomial with integer coefficients. Show that f is irreducible in Q[x] if it is irreducible in (Z/p)[x] for some p. First, claim that if f(x) is irreducible in some (Z/p)[x], then it is irreducible in Z[x]. A factorization f(x) = g(x) h(x) in Z[x] maps, under the natural Z-algebra homomorphism to (Z/p)[x], to the corresponding factorization f(x) = g(x) h(x) in (Z/p)[x]. (There s little reason to invent a notation for the reduction modulo p of polynomials as long as we are clear what we re doing.) A critical point is that since f is monic both g and h can be taken to be monic also (multiplying by 1 if necessary), since the highestdegree coefficient of a product is simply the product of the highest-degree coefficients of the factors. The irreducibility over Z/p implies that the degree of one of g and h modulo p is 0. Since they are monic, reduction modulo p does not alter their degrees. Since f is monic, its content is 1, so, by Gauss lemma, the factorization in Z[x] is not proper, in the sense that either g or h is just ±1. That is, f is irreducible in the ring Z[x]. Again by Gauss lemma, this implies that f is irreducible in Q[x]. [18.5] Let n be a positive integer such that (Z/n) is not cyclic. Show that the n th cyclotomic polynomial Φ n (x) factors properly in F p [x] for any prime p not dividing n.

5 Garrett: Abstract Algebra 237 (See subsequent text for systematic treatment of the case that p divides n.) Let d be a positive integer such that p d 1 = 0 mod n. Since we know that F p d is cyclic, Φ n (x) = 0 has a root in F p d when p d 1 = 0 mod n. For Φ n (x) to be irreducible in F p [x], it must be that d = ϕ(n) (Euler s totient function ϕ) is the smallest exponent which achieves this. That is, Φ n (x) will be irreducible in F p [x] only if p ϕ(n) = 1 mod n but no smaller positive exponent achieves this effect. That is, Φ n (x) is irreducible in F p [x] only if p is of order ϕ(n) in the group (Z/n). We know that the order of this group is ϕ(n), so any such p would be a generator for the group (Z/n). That is, the group would be cyclic. [18.6] Show that the 15 th cyclotomic polynomial Φ 15 (x) is irreducible in Q[x], despite being reducible in F p [x] for every prime p. First, by Sun-Ze (Z/15) (Z/3) (Z/5) Z/2 Z/4 This is not cyclic (there is no element of order 8, as the maximal order is 4). Thus, by the previous problem, there is no prime p such that Φ 15 (x) is irreducible in F p [x]. To prove that Φ 15 is irreducible in Q[x], it suffices to show that the field extension Q(ζ) of Q generated by any root ζ of Φ 15 (x) = 0 (in some algebraic closure of Q, if one likes) is of degree equal to the degree of the polynomial Φ 15, namely ϕ(15) = ϕ(3)ϕ(5) = (3 1)(5 1) = 8. We already know that Φ 3 and Φ 5 are irreducible. And one notes that, given a primitive 15 th root of unity ζ, η = ζ 3 is a primitive 5 th root of unity and ω = ζ 5 is a primitive third root of unity. And, given a primitive cube root of unity ω and a primitive 5 th root of unity η, ζ = ω 2 η 3 is a primitive 15 th root of unity: in fact, if ω and η are produced from ζ, then this formula recovers ζ, since = 1 Thus, By the multiplicativity of degrees in towers of fields Q(ζ) = Q(ω)(η) [Q(ζ) : Q] = [Q(ζ) : Q(ω)] [Q(ω) : Q] = [Q(ζ) : Q(ω)] 2 = [Q(ω, η) : Q(ω)] 2 Thus, it would suffice to show that [Q(ω, η) : Q(ω)] = 4. We should not forget that we have shown that Z[ω] is Euclidean, hence a PID, hence a UFD. Thus, we are entitled to use Eisenstein s criterion and Gauss lemma. Thus, it would suffice to prove irreducibility of Φ 5 (x) in Z[ω][x]. As in the discussion of Φ p (x) over Z with p prime, consider f(x) = Φ 5 (x + 1). All its coefficients are divisible by 5, and the constant coefficient is exactly 5 (in particular, not divisible by 5 2 ). We can apply Eisenstein s criterion and Gauss lemma if we know, for example, that 5 is a prime in Z[ω]. (There are other ways to succeed, but this would be simplest.) To prove that 5 is prime in Z[ω], recall the norm N(a + bω) = (a + bω)(a + bω) = (a + bω)(a + bω 2 ) = a 2 ab + b 2 already used in discussing the Euclidean-ness of Z[ω]. One proves that the norm takes non-negative integer values, is 0 only when evaluated at 0, is multiplicative in the sense that N(αβ) = N(α)N(β), and N(α) = 1 if and only if α is a unit in Z[ω]. Thus, if 5 were to factor 5 = αβ in Z[ω], then 25 = N(5) = N(α) N(β) For a proper factorization, meaning that neither α nor β is a unit, neither N(α) nor N(β) can be 1. Thus, both must be 5. However, the equation 5 = N(a + bω) = a 2 ab + b 2 = (a b 2 ) b2 = 1 4 ( (2a b) 2 + 3b 2)

6 238 Cyclotomic polynomials II has no solution in integers a, b. Indeed, looking at this equation mod 5, since 3 is not a square mod 5 it must be that b = 0 mod 5. Then, further, 4a 2 = 0 mod 5, so a = 0 mod 5. That is, 5 divides both a and b. But then 25 divides the norm N(a + bω) = a 2 ab + b 2, so it cannot be 5. Thus, in summary, 5 is prime in Z[ω], so we can apply Eisenstein s criterion to Φ 5 (x + 1) to see that it is irreducible in Z[ω][x]. By Gauss lemma, it is irreducible in Q(ω)[x], so [Q(ω, η) : Q(ω)] = ϕ(5) = 4. And this proves that [Q(ζ) : Q)] = 8, so Φ 15 (x) is irreducible over Q. [18.7] Let p be a prime. Show that every degree d irreducible in F p [x] is a factor of x pd 1 1. Show that that the (p d 1) th cyclotomic polynomial s irreducible factors in F p [x] are all of degree d. Let f(x) be a degree d irreducible in F p [x]. For a linear factor x α with α in some field extension of F p, we know that [F p (α) : F p ] = degree of minimal poly of α = deg f = d Since there is a unique (up to isomorphism) field extension of degree d of F p, all roots of f(x) = 0 lie in that field extension F p d. Since the order of the multiplicative group F is p d 1, by Lagrange the order of p d any non-zero element α of F p d is a divisor of p d 1. That is, α is a root of x pd 1 1 = 0, so x α divides x pd 1 1 = 0. Since f is irreducible, f has no repeated factors, so f(x) = 0 has no repeated roots. By unique factorization (these linear factors are mutually distinct irreducibles whose least common multiple is their product), the product of all the x α divides x pd 1 1. For the second part, similarly, look at the linear factors x α of Φ pd 1(x) in a sufficiently large field extension of F p. Since p does not divide n = p d 1 there are no repeated factors. The multiplicative group of the field F p d is cyclic, so contains exactly ϕ(p d 1) elements of (maximal possible) order p d 1, which are roots of Φ p 1(x) = 0. The degree of Φ d p d 1 is ϕ(p d 1), so there are no other roots. No proper subfield F p e of F p d contains any elements of order p d 1, since we know that e d and the multiplicative group F p is of order e p e 1 < p d 1. Thus, any linear factor x α of Φ pd 1(x) has [F p (α) : F p ] = d, so the minimal polynomial f(x) of α over F p is necessarily of degree d. We claim that f divides Φ p 1. Write d Φ pd 1 = q f + r where q, r are in F p [x] and deg r < deg f. Evaluate both sides to find r(α) = 0. Since f was minimal over F p for α, necessarily r = 0 and f divides the cyclotomic polynomial. That is, any linear factor of Φ p d 1 (over a field extension) is a factor of a degree d irreducible polynomial in F p [x]. That is, that cyclotomic polynomial factors into degree d irreducibles in F p [x]. [18.8] Fix a prime p, and let ζ be a primitive p th root of 1 (that is, ζ p = 1 and no smaller exponent will do). Let ζ ζ 2 ζ 3... ζ p 1 1 ζ 2 (ζ 2 ) 2 (ζ 2 ) 3... (ζ 2 ) p 1 V = det 1 ζ 3 (ζ 3 ) 2 (ζ 3 ) 3... (ζ 3 ) p 1 1 ζ 4 (ζ 4 ) 2 (ζ 4 ) 3... (ζ 4 ) p ζ p 1 (ζ p 1 ) 2 (ζ p 1 ) 3... (ζ p 1 ) p 1 Compute the rational number V 2. There are other possibly more natural approaches as well, but the following trick is worth noting. The ij th entry of V is ζ (i 1)(j 1). Thus, the ij th entry of the square V 2 is ζ (i 1)(l 1) ζ (l 1)(j 1) = { ζ (i 1+j 1)(l 1) 0 if (i 1) + (j 1) 0 mod p = p if (i 1) + (j 1) = 0 mod p l l

7 since Garrett: Abstract Algebra l<p ω l = 0 for any p th root of unity ω other than 1. Thus, p p V p 0 = p p That is, there is a p in the upper left corner, and p s along the anti-diagonal in the lower right (n 1)-by-(n 1) block. Thus, granting that the determinant squared is the square of the determinant, (det V ) 2 = det(v 2 ) = p p ( 1) (p 1)(p 2)/2 Note that this did not, in fact, depend upon p being prime. [18.9] Let K = Q(ζ) where ζ is a primitive 15 th root of unity. Find 4 fields k strictly between Q and K. Let ζ be a primitive 15 th root of unity. Then ω = ζ 5 is a primitive cube root of unity, and η = ζ 3 is a primitive fifth root of unity. And Q(ζ) = Q(ω)(η). Thus, Q(ω) is one intermediate field, of degree 2 over Q. And Q(η) is an intermediate field, of degree 4 over Q (so certainly distinct from Q(ω).) By now we know that 5 Q(η), so Q( 5) suggests itself as a third intermediate field. But one must be sure that Q(ω) Q( 5). We can try a direct computational approach in this simple case: suppose (a + bω) 2 = 5 with rational a, b. Then 5 = a 2 + 2abω + b 2 ω 2 = a 2 + 2abω b 2 b 2 ω = (a 2 b 2 ) + ω(2ab b 2 ) Thus, 2ab b 2 = 0. This requires either b = 0 or 2a b = 0. Certainly b cannot be 0, or 5 would be the square of a rational number (which we have long ago seen impossible). Try 2a = b. Then, supposedly, 5 = a 2 2(2a) 2 = 3a 2 which is impossible. Thus, Q( 5) is distinct from Q(ω). We know that Q(ω) = Q( 3). This might suggest Q( 3 5) = Q( 15) as the fourth intermediate field. We must show that it is distinct from Q( 3) and Q( 5). If it were equal to either of these, then that field would also contain 5 and 3, but we have already checked that (in effect) there is no quadratic field extension of Q containing both these. Thus, there are (at least) intermediate fields Q(η), Q( 3), Q( 5, and Q( 15). Exercises 18.[2.0.1] Find two fields intermediate between Q and Q(ζ 9 ), where ζ 9 is a primitive 9 th root of unity. 18.[2.0.2] Find two fields intermediate between Q and Q(ζ 8, where ζ 8 is a primitive 8 th root of unity. 18.[2.0.3] Find the smallest exponent l such that the irreducible x 3 + x + 1 in F 2 [x] divides x 2l x. 18.[2.0.4] Find the smallest exponent l such that the irreducible x 3 x + 1 in F 3 [x] divides x 3l x.

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

(January 14, 2009) [10.1] Prove that a finite division ring D (a not-necessarily commutative ring with 1 in which any non-zero element has a multiplicative inverse) is commutative. (This is due to Wedderburn.)

### CYCLOTOMIC POLYNOMIALS

CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where

### Solutions 13 Paul Garrett garrett/

(March 1, 005) Solutions 13 Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [13.1] Determine the degree of Q( 65 + 56i) over Q, where i = 1. We show that 65 + 56i is not a suare in

### CYCLOTOMIC POLYNOMIALS

CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where

### (January 14, 2009) a primitive fifth root of unity, so have order divisible by 5.) Recall the isomorphisms

(January 14, 009) [1.1] Prove that a prime p such that p = 1 mod 3 factors properly as p = ab in Z[ω], where ω is a primitive cube root of unity. (Hint: If p were prime in Z[ω], then Z[ω]/p would be a

### Galois Theory, summary

Galois Theory, summary Chapter 11 11.1. UFD, definition. Any two elements have gcd 11.2 PID. Every PID is a UFD. There are UFD s which are not PID s (example F [x, y]). 11.3 ED. Every ED is a PID (and

### TC10 / 3. Finite fields S. Xambó

TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the

### Polynomial Rings. i=0. i=0. n+m. i=0. k=0

Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients

### Factorization in Integral Domains II

Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and

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

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore

### g(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.

6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral

### 6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree

Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S

### Computations/Applications

Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x

### Continuing the pre/review of the simple (!?) case...

Continuing the pre/review of the simple (!?) case... Garrett 09-16-011 1 So far, we have sketched the connection between prime numbers, and zeros of the zeta function, given by Riemann s formula p m

### 22. Galois theory. G = Gal(L/k) = Aut(L/k) [L : K] = H. Gal(K/k) G/H

22. Galois theory 22.1 Field extensions, imbeddings, automorphisms 22.2 Separable field extensions 22.3 Primitive elements 22.4 Normal field extensions 22.5 The main theorem 22.6 Conjugates, trace, norm

### GALOIS THEORY. Contents

GALOIS THEORY MARIUS VAN DER PUT & JAAP TOP Contents 1. Basic definitions 1 1.1. Exercises 2 2. Solving polynomial equations 2 2.1. Exercises 4 3. Galois extensions and examples 4 3.1. Exercises. 6 4.

### Math 121 Homework 2 Solutions

Math 121 Homework 2 Solutions Problem 13.2 #16. Let K/F be an algebraic extension and let R be a ring contained in K that contains F. Prove that R is a subfield of K containing F. We will give two proofs.

### where c R and the content of f is one. 1

9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.

### NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

### 9. Finite fields. 1. Uniqueness

9. Finite fields 9.1 Uniqueness 9.2 Frobenius automorphisms 9.3 Counting irreducibles 1. Uniqueness Among other things, the following result justifies speaking of the field with p n elements (for prime

### Solutions of exercise sheet 11

D-MATH Algebra I HS 14 Prof Emmanuel Kowalski Solutions of exercise sheet 11 The content of the marked exercises (*) should be known for the exam 1 For the following values of α C, find the minimal polynomial

### Factorization in Polynomial Rings

Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,

### Homework 6 Solution. Math 113 Summer 2016.

Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x

### All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.

Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1

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

1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials

### Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.

5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field

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

Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,

### Homework problems from Chapters IV-VI: answers and solutions

Homework problems from Chapters IV-VI: answers and solutions IV.21.1. In this problem we have to describe the field F of quotients of the domain D. Note that by definition, F is the set of equivalence

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

ALGEBRA PH.D. QUALIFYING EXAM SOLUTIONS October 20, 2011 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved

### FACTORING IN QUADRATIC FIELDS. 1. Introduction

FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also

### Public-key Cryptography: Theory and Practice

Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues

### MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0

### THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION ADVANCED ALGEBRA I.

THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - FALL SESSION 2006 110.401 - ADVANCED ALGEBRA I. Examiner: Professor C. Consani Duration: take home final. No calculators allowed.

### Quizzes for Math 401

Quizzes for Math 401 QUIZ 1. a) Let a,b be integers such that λa+µb = 1 for some inetegrs λ,µ. Prove that gcd(a,b) = 1. b) Use Euclid s algorithm to compute gcd(803, 154) and find integers λ,µ such that

### Explicit Methods in Algebraic Number Theory

Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic

### A connection between number theory and linear algebra

A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.

### Quasi-reducible Polynomials

Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let

### Galois Theory TCU Graduate Student Seminar George Gilbert October 2015

Galois Theory TCU Graduate Student Seminar George Gilbert October 201 The coefficients of a polynomial are symmetric functions of the roots {α i }: fx) = x n s 1 x n 1 + s 2 x n 2 + + 1) n s n, where s

### Math 547, Exam 2 Information.

Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)

### Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35

Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)

### Homework 10 M 373K by Mark Lindberg (mal4549)

Homework 10 M 373K by Mark Lindberg (mal4549) 1. Artin, Chapter 11, Exercise 1.1. Prove that 7 + 3 2 and 3 + 5 are algebraic numbers. To do this, we must provide a polynomial with integer coefficients

### Math 120 HW 9 Solutions

Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z

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

13. Radical and Cyclic Extensions The main purpose of this section is to look at the Galois groups of x n a. The first case to consider is a = 1. Definition 13.1. Let K be a field. An element ω K is said

### Solutions of exercise sheet 6

D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 6 1. (Irreducibility of the cyclotomic polynomial) Let n be a positive integer, and P Z[X] a monic irreducible factor of X n 1

### RINGS: SUMMARY OF MATERIAL

RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered

### Classification of Finite Fields

Classification of Finite Fields In these notes we use the properties of the polynomial x pd x to classify finite fields. The importance of this polynomial is explained by the following basic proposition.

### Finite Fields: An introduction through exercises Jonathan Buss Spring 2014

Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence

### Algebra Qualifying Exam Solutions. Thomas Goller

Algebra Qualifying Exam Solutions Thomas Goller September 4, 2 Contents Spring 2 2 2 Fall 2 8 3 Spring 2 3 4 Fall 29 7 5 Spring 29 2 6 Fall 28 25 Chapter Spring 2. The claim as stated is false. The identity

### PRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.

PRACTICE FINAL MATH 18.703, MIT, SPRING 13 You have three hours. This test is closed book, closed notes, no calculators. There are 11 problems, and the total number of points is 180. Show all your work.

### CSIR - Algebra Problems

CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com

### 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 201C Homework Edward Burkard 5.1. Field Extensions. 5. Fields and Galois Theory Exercise 5.1.7. If v is algebraic over K(u) for some u F and v is transcendental over K, then u is algebraic over K(v).

### Algebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...

Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2

### 1. Factorization Divisibility in Z.

8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that

### Chapter 8. P-adic numbers. 8.1 Absolute values

Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.

### Math 210B: Algebra, Homework 6

Math 210B: Algebra, Homework 6 Ian Coley February 19, 2014 Problem 1. Let K/F be a field extension, α, β K. Show that if [F α) : F ] and [F β) : F ] are relatively prime, then [F α, β) : F ] = [F α) :

### D-MATH Algebra I HS17 Prof. Emmanuel Kowalski. Solution 12. Algebraic closure, splitting field

D-MATH Algebra I HS17 Prof. Emmanuel Kowalski Solution 1 Algebraic closure, splitting field 1. Let K be a field of characteristic and L/K a field extension of degree. Show that there exists α L such that

### Solutions of exercise sheet 8

D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra

### 11. Finitely-generated modules

11. Finitely-generated modules 11.1 Free modules 11.2 Finitely-generated modules over domains 11.3 PIDs are UFDs 11.4 Structure theorem, again 11.5 Recovering the earlier structure theorem 11.6 Submodules

### Real Analysis Prelim Questions Day 1 August 27, 2013

Real Analysis Prelim Questions Day 1 August 27, 2013 are 5 questions. TIME LIMIT: 3 hours Instructions: Measure and measurable refer to Lebesgue measure µ n on R n, and M(R n ) is the collection of measurable

### Gauss s Theorem. Theorem: Suppose R is a U.F.D.. Then R[x] is a U.F.D. To show this we need to constuct some discrete valuations of R.

Gauss s Theorem Theorem: Suppose R is a U.F.D.. Then R[x] is a U.F.D. To show this we need to constuct some discrete valuations of R. Proposition: Suppose R is a U.F.D. and that π is an irreducible element

### Factorization of zeta-functions, reciprocity laws, non-vanishing

(January, 0 Factorization of zeta-functions, reciprocity laws, non-vanishing Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/. Gaussian integers o Z[i]. Eisenstein integers o Z[ω] 3.

### RUDIMENTARY GALOIS THEORY

RUDIMENTARY GALOIS THEORY JACK LIANG Abstract. This paper introduces basic Galois Theory, primarily over fields with characteristic 0, beginning with polynomials and fields and ultimately relating the

### FIELD THEORY. Contents

FIELD THEORY MATH 552 Contents 1. Algebraic Extensions 1 1.1. Finite and Algebraic Extensions 1 1.2. Algebraic Closure 5 1.3. Splitting Fields 7 1.4. Separable Extensions 8 1.5. Inseparable Extensions

### D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains

D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.

### LECTURE NOTES IN CRYPTOGRAPHY

1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic

### ϕ : Z F : ϕ(t) = t 1 =

1. Finite Fields The first examples of finite fields are quotient fields of the ring of integers Z: let t > 1 and define Z /t = Z/(tZ) to be the ring of congruence classes of integers modulo t: in practical

### Algebra SEP Solutions

Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since

### CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)

### Algebraic number theory

Algebraic number theory F.Beukers February 2011 1 Algebraic Number Theory, a crash course 1.1 Number fields Let K be a field which contains Q. Then K is a Q-vector space. We call K a number field if dim

### Course 2316 Sample Paper 1

Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity

### Gaussian integers. 1 = a 2 + b 2 = c 2 + d 2.

Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d

### Example (cont d): Function fields in one variable...

Example (cont d): Function fields in one variable... Garrett 10-17-2011 1 Practice: consider K a finite extension of k = C(X), and O the integral closure in K of o = C[X]. K = C(X, Y ) for some Y, and

### Outline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials

Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields

### [06.1] Given a 3-by-3 matrix M with integer entries, find A, B integer 3-by-3 matrices with determinant ±1 such that AMB is diagonal.

(January 14, 2009) [06.1] Given a 3-by-3 matrix M with integer entries, find A, B integer 3-by-3 matrices with determinant ±1 such that AMB is diagonal. Let s give an algorithmic, rather than existential,

### Notes on graduate algebra. Robert Harron

Notes on graduate algebra Robert Harron Department of Mathematics, Keller Hall, University of Hawai i at Mānoa, Honolulu, HI 96822, USA E-mail address: rharron@math.hawaii.edu Abstract. Graduate algebra

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

MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon

### Mathematical Olympiad Training Polynomials

Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,

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

D-MAH Algebra II FS18 Prof. Marc Burger Solution 26 Cyclotomic extensions. In the following, ϕ : Z 1 Z 0 is the Euler function ϕ(n = card ((Z/nZ. For each integer n 1, we consider the n-th cyclotomic polynomial

### ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008

ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely

### Homework due on Monday, October 22

Homework due on Monday, October 22 Read sections 2.3.1-2.3.3 in Cameron s book and sections 3.5-3.5.4 in Lauritzen s book. Solve the following problems: Problem 1. Consider the ring R = Z[ω] = {a+bω :

### A Generalization of Wilson s Theorem

A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................

### HOMEWORK 11 MATH 4753

HOMEWORK 11 MATH 4753 Recall that R = Z[x]/(x N 1) where N > 1. For p > 1 any modulus (not necessarily prime), R p = (Z/pZ)[x]/(x N 1). We do not assume p, q are prime below unless otherwise stated. Question

### AN INTRODUCTION TO GALOIS THEORY

AN INTRODUCTION TO GALOIS THEORY STEVEN DALE CUTKOSKY In these notes we consider the problem of constructing the roots of a polynomial. Suppose that F is a subfield of the complex numbers, and f(x) is

### x 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0

1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials

### Selected Math 553 Homework Solutions

Selected Math 553 Homework Solutions HW6, 1. Let α and β be rational numbers, with α 1/2, and let m > 0 be an integer such that α 2 mβ 2 = 1 δ where 0 δ < 1. Set ǫ:= 1 if α 0 and 1 if α < 0. Show that

### MATH 361: NUMBER THEORY TENTH LECTURE

MATH 361: NUMBER THEORY TENTH LECTURE The subject of this lecture is finite fields. 1. Root Fields Let k be any field, and let f(x) k[x] be irreducible and have positive degree. We want to construct a

### ABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK

ABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK 1. Practice exam problems Problem A. Find α C such that Q(i, 3 2) = Q(α). Solution to A. Either one can use the proof of the primitive element

### Coding Theory and Applications. Solved Exercises and Problems of Cyclic Codes. Enes Pasalic University of Primorska Koper, 2013

Coding Theory and Applications Solved Exercises and Problems of Cyclic Codes Enes Pasalic University of Primorska Koper, 2013 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a collection of solved

### 32 Divisibility Theory in Integral Domains

3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible

### Solutions for Field Theory Problem Set 1

Solutions for Field Theory Problem Set 1 FROM THE TEXT: Page 355, 2a. ThefieldisK = Q( 3, 6). NotethatK containsqand 3and 6 3 1 = 2. Thus, K contains the field Q( 2, 3). In fact, those two fields are the

### GALOIS THEORY AT WORK: CONCRETE EXAMPLES

GALOIS THEORY AT WORK: CONCRETE EXAMPLES KEITH CONRAD 1. Examples Example 1.1. The field extension Q(, 3)/Q is Galois of degree 4, so its Galois group has order 4. The elements of the Galois group are

### CDM. Finite Fields. Klaus Sutner Carnegie Mellon University. Fall 2018

CDM Finite Fields Klaus Sutner Carnegie Mellon University Fall 2018 1 Ideals The Structure theorem Where Are We? 3 We know that every finite field carries two apparently separate structures: additive and

### Introduction to finite fields

Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in

### Field Theory Qual Review

Field Theory Qual Review Robert Won Prof. Rogalski 1 (Some) qual problems ˆ (Fall 2007, 5) Let F be a field of characteristic p and f F [x] a polynomial f(x) = i f ix i. Give necessary and sufficient conditions

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

THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - SPRING SESSION 2006 110.402 - ADVANCED ALGEBRA II. Examiner: Professor C. Consani Duration: 3 HOURS (9am-12:00pm), May 15, 2006. No

### Topics in linear algebra

Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over

### Polynomial Rings. (Last Updated: December 8, 2017)

Polynomial Rings (Last Updated: December 8, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from Chapters

### 1. Group Theory Permutations.

1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7