SOLUTIONS TO PROBLEM SET 3



Similar documents
minimal polyonomial Example

1 = (a 0 + b 0 α) (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

Galois Theory III Splitting fields.

it is easy to see that α = a

7. Some irreducible polynomials

ALGEBRA HW 5 CLAY SHONKWILER

5. Linear algebra I: dimension

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

Introduction to Finite Fields (cont.)

A NOTE ON FINITE FIELDS

Factoring Cubic Polynomials

2. Let H and K be subgroups of a group G. Show that H K G if and only if H K or K H.

SOLVING POLYNOMIAL EQUATIONS BY RADICALS

6. Fields I. 1. Adjoining things

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

Generic Polynomials of Degree Three

H/wk 13, Solutions to selected problems

3 1. Note that all cubes solve it; therefore, there are no more

Mathematics Course 111: Algebra I Part IV: Vector Spaces

University of Lille I PC first year list of exercises n 7. Review

10 Splitting Fields. 2. The splitting field for x 3 2 over Q is Q( 3 2,ω), where ω is a primitive third root of 1 in C. Thus, since ω = 1+ 3

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Cyclotomic Extensions

calculating the result modulo 3, as follows: p(0) = = 1 0,

EXERCISES FOR THE COURSE MATH 570, FALL 2010

Matrix Representations of Linear Transformations and Changes of Coordinates

Math Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov

Finite dimensional C -algebras

(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

FINITE FIELDS KEITH CONRAD

Galois Theory. Richard Koch

Since [L : K(α)] < [L : K] we know from the inductive assumption that [L : K(α)] s < [L : K(α)]. It follows now from Lemma 6.

FACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set

Field Fundamentals. Chapter Field Extensions Definitions Lemma

MA3D5 Galois theory. Miles Reid. Jan Mar 2004 printed Jan 2014

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

Unique Factorization

T ( a i x i ) = a i T (x i ).

Factoring polynomials over finite fields

Assignment 8: Selected Solutions

Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.

First and raw version september 2013 klokken 13:45

Factoring Polynomials

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

GALOIS THEORY AT WORK: CONCRETE EXAMPLES

8.1 Examples, definitions, and basic properties

GROUP ALGEBRAS. ANDREI YAFAEV

Ideal Class Group and Units

RESULTANT AND DISCRIMINANT OF POLYNOMIALS

Group Theory. Contents

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

Linear Algebra I. Ronald van Luijk, 2012

15. Symmetric polynomials

How To Prove The Dirichlet Unit Theorem

Galois representations with open image

fg = f g Ideals. An ideal of R is a nonempty k-subspace I R closed under multiplication by elements of R:

1 VECTOR SPACES AND SUBSPACES

Factorization in Polynomial Rings

1 Homework 1. [p 0 q i+j p i 1 q j+1 ] + [p i q j ] + [p i+1 q j p i+j q 0 ]

Factorization Algorithms for Polynomials over Finite Fields

Associativity condition for some alternative algebras of degree three

Algebra 3: algorithms in algebra

A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

Galois theory. a draft of Lecture Notes of H.M. Khudaverdian. Manchester, Autumn 2006 (version 16 XII 2006)

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

1 Sets and Set Notation.

GROUPS ACTING ON A SET

FIBER PRODUCTS AND ZARISKI SHEAVES

Polynomial Invariants

An Introduction to Galois Theory. Andrew Baker

17. Inner product spaces Definition Let V be a real vector space. An inner product on V is a function

Factoring of Prime Ideals in Extensions

GENERATING SETS KEITH CONRAD

Basics of Polynomial Theory

RINGS WITH A POLYNOMIAL IDENTITY

6.2 Permutations continued

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao

Quotient Rings and Field Extensions

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

INTRODUCTION TO ARITHMETIC GEOMETRY (NOTES FROM , FALL 2009)

Introduction to Modern Algebra

Computational algebraic geometry

Lecture 3: Finding integer solutions to systems of linear equations

Chapter 1. Search for Good Linear Codes in the Class of Quasi-Cyclic and Related Codes

THE SIGN OF A PERMUTATION

LINEAR ALGEBRA W W L CHEN

Chapter 13: Basic ring theory

Die ganzen zahlen hat Gott gemacht

SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE

Galois theory for dummies

Transcription:

SOLUTIONS TO PROBLEM SET 3 MATTI ÅSTRAND The General Cubic Extension Denote L = k(α 1, α 2, α 3 ), F = k(a 1, a 2, a 3 ) and K = F (α 1 ). The polynomial f(x) = x 3 a 1 x 2 + a 2 x a 3 = (x α 1 )(x α 2 )(x α 3 ) is irreducible in F [x]. The symmetric group S 3 acts on L by permuting the α i, and fixes the field F. Problem 2. The field K = F (α 1 ) is generated over F by the element α 1, which is a root of the irreducible polynomial f(x) F [x], so K = F [t]/(f(t)) and has a basis {1, α 1, α 2 1} over F. Thus dim F K = 3. Let s now consider f(x) as a polynomial in K[x]. It has a linear factor corresponding to the root α 1 K, so it factors as f(x) = (x α 1 )g(x), where g(x) is a quadratic polynomial in K[x]. (Note: actually g(x) = (x α 2 )(x α 3 ), but this factoring takes place in L[x].) We get L from K by adding the roots of the quadratic polynomial g(x). Thus the extension is either quadratic (if the roots of g(x) are not in K) or trivial, i.e. L = K (if g(x) has roots already in K). Turns out that L is a quadratic extension of K: for this we need to show that the two fields are not equal. Let σ = (23) be the transposition swapping α 2 and α 3. Denote by L σ the fixed field of σ. Since σ obviously doesn t fix every element of L (e.g. it doesn t fix α 2 ) we see that L σ L. On the other hand, σ does fix everything in F and also α 1, so it fixes everything in K. We then have K L σ L. (Note that this also proves that K is exactly the fixed field L σ.) Now we know that dim K L = 2, and L has a basis {1, α 2 } over K. Then a basis for L over F would be {1, α 1, α 2 1, α 2, α 1 α 2, α 2 1α 2 }. (See problem 1 below) Problem 3. We saw in problem 2 above that dim F K = 3, so we only need to show that the automorphism group Aut(K/F ) is trivial. To see this, let σ Aut(K/F ) be such an automorphism. Since f(x) is a polynomial in F [x], the automorphism σ has to permute the roots of f(x), so σ(α 1 ) has to be a root of f(x). But in problem 2 above we saw that K doesn t contain the other roots α 2 and α 3 of f(x), so σ(α 1 ) = α 1. Let K σ be the fixed field of σ. Since σ has to fix F, we know that F K σ. But since σ(α 1 ) = α 1, we get α 1 K σ. Thus K σ F (α 1 ) = K, so σ fixes all of K, which means that σ = id. Thus Aut(K/F ) = {id}. 1

Problem 4. The roots of the polynomial f(x) = (x α 1 )(x α 2 )(x α 3 ) are exactly {α 1, α 2, α 3 }. The field L is by definition the smallest field containing the roots of f(x) (and k), so it s the smallest field where f(x) splits into linear factors. 2 The Cyclic Cubic Extension Let k be a field, and ξ k an element such that the polynomial κ(t) = t 3 ξ is irreducible. Problem 1. Let k κ = k[t]/(κ(t)) be the Kronecker construction. Denote by α the equivalence class of t in k κ, so that k κ = k(α) and α 3 = ξ. Assume first that k(α) doesn t contain a cube root of unity. Let σ Aut(k(α)/k) be an automorphism. Then σ(α) is also a root of κ(t), since σ permutes the roots of the polynomial κ(t) k[t]. But now we have ( σ(α) α ) 3 = σ(α)3 α 3 = ξ ξ = 1. Since k(α) doesn t have a (nontrivial) third root of unity, we have σ(α) = 1, so α σ(α) = α. But if the fixed field of σ contains both k and α, it has to be the whole field k(α), so σ = id. Assume now that k(α) does contain a cube root of unity µ. We have that (µα) 3 = µ 3 α 3 = 1 ξ = ξ, so µα is another root of κ(t). Similarly µ 2 α is a root of κ(t). Thus κ(t) has three roots in k(α), and κ(t) = (t α)(t µα)(t µ 2 α). Since both α and µα are roots of the irreducible polynomial κ(t), we have two isomorphisms k[t]/(κ(t)) = k(α): one sending the equivalence class of t to α, and another sending it to µα. Composing the first isomorphism with the inverse of the second one, we get an isomorphism from k(α) to itself, sending α to µα: k(α) k[t]/(κ(t)) k(α) This is a nontrivial automorphism of k(α) over k, so Aut(k(α)/k) is nontrivial. In fact, Aut(k(α)/k) = {id, σ, σ 2 } is a cyclic group of order 3. (For details of why this is true, see problem 3 of the last section.) Finally, if k(α) contains a cube root of unity, I claim that it has to be already in k. Otherwise µ is a root of the irreducible polynomial t 3 1 t 1 = t2 + t + 1, so the extension k(µ)/k has degree 2. But by problem 1 below, an extension of degree 3 cannot have a subextension of degree 2, since 3 is odd.

Problem 2. Let C 3 = {1, σ, σ 2 } be a cyclic group of order 3. Define a k-algebra homomorphism φ: k[t] k[c 3 ] by sending t to φ(t) = σ k[c 3 ]. Then φ(t 3 ) = σ 3 = 1, so t 3 1 Ker(φ). Thus we can define a homomorphism φ: k[t]/(t 3 1) k[c 3 ] by φ([g(t)]) = φ(g(t)) for any polynomial g(t) k[t]. Let s show that φ is an isomorphism. The ring k[t]/(t 3 1) has a k-basis {1, t, t 2 }, which is sent to {1, σ, σ 2 }. Thus φ sends a k-basis of k[t]/(t 3 1) to a k-basis of k[c 3 ], so it is bijective. This means that φ is an isomorphism between the two rings. Assume that k has a cube root of unity µ. Since the polynomial t 3 1 splits into coprime factors as t 3 1 = (t 1)(t µ)(t µ 2 ), we get k[c 3 ] = k[t]/(t 3 1) = k[t]/(t 1) k[t]/(t µ) k[t]/(t µ 2 ) = k k k. The automorphism from k[t]/(t 3 1) to k k k sends a polynomial p(t) to the triple (p(1), p(µ), p(µ 2 )). We want e 1 to be sent to (0, 1, 0), and we can notice that such a polynomial is Thus the desired element e 1 k[c 3 ] is (t 1)(t µ 2 ) (µ 1)(µ µ 2 ) = 1 3 (µ t2 + µ 2 t + 1). e 1 = µσ2 + µ 2 σ + 1. 3 Problem 3. Let k be a field of characteristic 3. In k[t], the polynomial t 3 1 factors as (t 1) 3. Thus, the only root of t 3 1 is 1. Last 5 problems Let k be a field containing a cube root of unity µ, K be a field extension with dim k K = 3, and σ Aut(K/k) a nontrivial automorphism. Problem 1. Suppose that dim K L = m and dim L M = n. Choose {a 1,..., a m } to be a K-basis of L and {b 1,..., b n } to be an L-basis of M. I claim that now the mn elements in {a i b j i = 1,..., m, j = 1,..., n} are a K-basis for M. In particular, dim K M = mn. To prove that the (a i b j ) span M over K, let α M. Now α can be written as n α = c j b j j=1 for some c j L. Also the elements c j can be written as m c j = x ij a i 3

for some x ij K. Thus we have n m α = x ij a i b j, j=1 so the elements a i b j generate M over K. Finally, let s show that a i b j are linearly independent over K. Suppose that a linear combination n m ( x ij a i )b j = 0 j=1 for x ij K. But this is a linear combination in b j with the coefficients m x ij a i in the field L, so we must have m x ij a i = 0 for all i. But this means that x ij = 0, since a i are linearly independent. Problem 2. Pick an element α K, such that α / k. Now by the above problem 1 we see that K = k(α), since 3 = (dim k k(α))(dim k(α) K), and dim k k(α) 1. (With similar reasoning you can show that K σ = k.) Let f(t) k[t] be the minimal polynomial of α over k. Now σ permutes the roots of f(t). An automorphism is determined by where it maps α, in the following sense: If σ and τ are two automorphisms in Aut(K/k) such that σ(α) = τ(α), then σ = τ. This is because the fixed field of τ 1 σ contains k and α, so it is all of K, i.e. τ 1 σ = id. Since α has to map to one of the roots of f(t), there are at most 3 automorphisms in Aut(K/k). If σ had order 2, then the polynomial (t α)(t σ(α)) has its coefficients in K σ = k, and it has degree 2. This is a contradiction with the fact that the minimal polynomial of α has degree 3. Problem 3. The solution of problem 2 proves that Aut(K/k) is cyclic group of order 3. Problem 4. Let α K be a root of f(t). Then k(α) is a subfield of K which contains k but is not equal to k. By our standard dimension argument, we see that K = k(α), and deg(f(t)) = dim k k(α) = dim k K = 3. The (distinct) elements α, σ(α) and σ 2 (α) are roots of f(t), so f(t) is divisible by (t α)(t σ(α))(t σ 2 (α)). Because we already saw that deg f(t) = 3, we know that f(t) is constant multiple of the above polynomial. 4

5 Problem 5. The elements e i k[c 3 ] for i = 0, 1, 2 satisfy e 0 + e 1 + e 2 = 1 (σ µ i )e i = 0 e 2 i = e i e i e j = 0 for i j. We identify the group Aut(K/k) = {id, σ, σ 2 } with C 3. Then the elements of the group ring k[c 3 ] give maps K K, which are linear over k. The properties above imply that K = Im(e 0 ) Im(e 1 ) Im(e 2 ), and that Im(e 0 ) K σ = k. This means that Im(e 0 ) is (at most) 1-dimensional, so Im(e i ) has to be nonzero for either i = 1 or i = 2. Now, let η Im(e i ) be nonzero. Then σ(η) = µ i η η, so η / k. This implies that K = k(η) (by the standard dimension argument). Also, so η 3 K σ = k. σ(η 3 ) = (σ(η)) 3 = µ 3i η 3 = η 3,