Integral Bases. 1. Resultants

Size: px
Start display at page:

Download "Integral Bases. 1. Resultants"

Transcription

1 . Resultants Integral Bases Suppose f and g are polynomials in one or more variables including x) with integer coefficients. Say f = A 0 x m + A x m + + A m, g = B 0 x n + B x n + + B n, with A 0,..., A m and B 0,..., B n polynomials not involving x and with A 0 B 0 0. We recursively define the resultant of f and g with respect to x as 0 and Res x f, g) = A n 0 if m = 0, B0 m if n = 0, ) mn Res x g, f) if 0 < m < n, ) mn B0 n Res x g, h) if 0 < n m, with h = B 0 f A 0 x m n g having lower degree in x than f. If you look closely you can see that A 0 A m A 0 A m A 0 A m A 0 A m Res x f, g) = det B 0 B n B 0 B n B 0 B n B 0 B n with A 0,..., A m appearing in rows through n and B 0,..., B n appearing in rows n + through n + m. It follows that Res x f, g) is a polynomial in zero or more variables not including x) with integer coefficients. Integral Bases -May-0, 9:5 pm

2 When fx) and gx) are polynomials in Z[x] we have fx) = λ x α ) x α m ), gx) = µ x β ) x β n ), with α,..., α m, β,..., β n C, and the resultant has the charming property that ) Res x fx), gx) = λ n µ m m n j= k= α j β k ) = λ n m j= gα j). Even better, if fx) and gx) are monic polynomials in Z[x] then Res x fx), Resy gy), t xy )) = Resx fx), n k= t xβ k) ) = m j= n k= t α jβ k ) Z[t], Res x fx), Resy gy), t x y )) = Resx fx), n k= t x β k) ) = m j= n k= t α j β k ) Z[t]. Thus, if α and β are roots of monic polynomials in Z[x] then so are αβ and α + β. Exercise. Show that if α is a root of a monic polynomial in Z[x] and λ Z then λα is a root of a monic polynomial in Z[x]. Example. Let fx) = x, gy) = y + 5. Then ) r y t, x) = Res y gy), t x y 0 5 = det t x = x tx + t + 5, t x r x,y t) = Res x fx), ry t, x) ) 0 0 = det t t + 5 = t + 6t + 9. t t + 5 Integral Bases -May-0, 9:5 pm

3 . Algebraic Integers An algebraic integer is a root of a monic polynomial in Z[x]. For example, if k is an integer and α = + k + ) then α is a root of x x k, so α is an algebraic integer. Exercise: Exercise. Gauss s Lemma. Show that if fx) is a monic polynomial in Z[x] and gx) and hx) are monic polynomials in Q[x] and fx) = gx) hx) then gx) and hx) belong to Z[x]. Apply Gauss s Lemma to show that the monic) minimal polynomial of an algebraic integer has integer coefficients. The set of algebraic integers belonging to an algebraic number field K we denote by O K or simply O. From the discussion above it follows that O K is both a ring and a Z-module. Suppose β is a nonzero algebraic integer with hx) its minimal polynomial over Q and m the degree of hx), and let λ be a positive integer. Then the minimal polynomial of β/λ is λ m hλx), which will not be in Z[x] if λ m > h0). For example, if β is a root of x x then β/ is a root of x x, but the minimal polynomial of β/ is x x, so β/ is not an algebraic integer. Exercise: Vandermonde Determinants. Show that if then V = v v v n v v v n v v v n... v n v n v n n det V = j<k v k v j ). Let fx) be an irreducible monic polynomial in Z[x] of degree n, let α be a root of fx), and let O be the set of algebraic integers belonging to Qα). Integral Bases -May-0, 9:5 pm

4 Suppose β O. Then Z[α, β ] = j n, k n Z αj β k O and the elements α j β k, j n, k n, expressed as vectors over Q, can be reduced over Z note!) to give a Z-module basis { ω, ω,..., ω n } for Z[α, β ]. Since {, α, α,..., α n } is a vector-space basis for Qα) over Q there is a matrix T ω Q n n such that ω ω ω. = T ω ω n α α. α n Note that without loss of generality we may construct ω,..., ω n so that T ω is lowertriangular with positive diagonal entries, and so we do. And since it follows that T ω Z n n. α α. α n ω n. ω = T ω ω ω. Exercises. Exploit the fact that T ω is in lower-triangular form with positive diagonal entries to prove the following.. For k =,..., n there exists a positive integer d k such that T ω ) kk = /d k, and in particular d =. Use the fact that α k can be expressed uniquely as a Z-linear combination of ω,..., ω n.). d k is a multiple of d k for k =,..., n. Use the fact that if λ k d k + µ k d k = gcdd k, d k ) for integers λ k and µ k then λ k αω k +µ k ω k can be expressed uniquely as a Z-linear combination of ω,..., ω n.). d k ω k Z[α] for k =,..., n. Use the fact that αω k can be expressed uniquely as a Z-linear combination of ω,..., ω n.) Integral Bases -May-0, 9:5 pm

5 Decomposing fx) into linear factors as fx) = x α ) x α n ) we define tr hα) ) = hα ) + hα ) + + hα n ) for hx) Q[x]. If hα) O then ) Res x fx), t hx) = t hα ) ) t hα n ) ) = t n tr hα) ) t n + ± hα ) hα n ) Z[t] and therefore tr hα) ) Z. Now let A = α α α α n α α α αn, A T =... α n α n α n αn n α α α n α α α n α α α n... α n αn αn n so that A A T = tr) trα) trα ) trα n ) trα) trα ) trα ) trα n ) trα ) trα ) trα ) trα n+ )... trα n ) trα n ) trα n+ ) trα n ) and det AA T = j k α j α k ) = disc f = ) nn )/ Res x fx), f x)). Integral Bases 5 -May-0, 9:5 pm

6 Treating ω = ω α),..., ω n = ω n α) as polynomials in α we will write ω jk for ω j α k ). We define W = ω ω ω ω n ω ω ω ω n ω ω ω ω n, W T =... ω n ω n ω n ω nn ω ω ω ω n ω ω ω ω n ω ω ω ω n... ω n ω n ω n ω nn so that W W T = trω ω ) trω ω ) trω ω ) trω ω n ) trω ω ) trω ω ) trω ω ) trω ω n ) trω ω ) trω ω ) trω ω ) trω ω n )... trω n ω ) trω n ω ) trω n ω ) trω n ω n ) Z n n and hence det W W T Z. On the other hand, with d ω = d d n we have W = T ω A, det W W T = dett ω A A T T T ω) = det T ω ) det A) = d ω disc f, disc f = d ω det W W T, T ω = det T ω T ω ) = d ω T ω ) d ω Z n n. Proposition. If d is the largest square dividing disc f then Z[α] O d Z[α]. Integral Bases 6 -May-0, 9:5 pm

7 Example. Let fx) = x x +. Then disc f = 80 = 5, so that d = 6. Among the 5 distinct nonzero representatives of dz[α] modulo Z[α] there are five algebraic integers. ωα) Res x fx), ωx), t x ) α t 7t α t t + + α t 0t α t 6t α t t + Row-reduction to lower-triangular form over Z gives and it follows that {, + 6 α } is a Z-basis for O. Integral Bases 7 -May-0, 9:5 pm

8 Example. Let fx) = x 7x x. Then disc f = 7 = 6, so that d = = 8. Among the 5 distinct nonzero representatives of dz[α] modulo Z[α] there are seven algebraic integers. ωα) Res x fx), ωx), t x ) α + α t 9t 6t + α t 9t + t + α + α t 7t + 6t + α t 7t + t 5 + α t 5t + t + α t 5t + 0t 7 + α + α t t + 5t 7 Row-reduction to lower-triangular form over Z gives and it follows that {, + α, + α } is a Z-basis for O. Integral Bases 8 -May-0, 9:5 pm

9 . Computing Integral Bases Efficiently Often we need to work with the ring of integers of an algebraic number field and so we need an efficient way to find an integral basis for the field, i.e., a Z-module basis for its ring of integers. It is clear that the method sketched in the examples in the previous section is not efficient.) Let K be an algebraic number field of degree n with ring of integers O. An order of K is a subring of K that contains and is also an n-dimensional Z-module. Note that if K = Qα) with α O then Z[α] is an order of K, as is O itself. Let A be an order of K and let { ω,..., ω n } be a Z-basis for A. Exercises.. Prove that A O, as follows. For an arbitrary element α of A let M α = a a a n a a a n... Zn n a n a n a nn be given by αω j = a j ω + + a jn ω n for j =,..., n and let χ α x) = detxi M α ). Show that χ α x) is a monic polynomial in Z[x] with χ α α) = 0.. Apply the previous result with A = O to show that if β, γ K and β 0 and β γ k O for all k 0 then γ O. Integral Bases 9 -May-0, 9:5 pm

10 Let p be prime and define O p = { α O pα A }, R p = { β A β k pa for some k }, [R p /R p ] = { γ K γr p R p }. Exercises. For θ K let µ θ denote the minimal polynomial of θ over Q. Prove the following.. γr p R p = p, pγ, pγ,... A = γ O.. [R p /R p ] is an order of K.. A [R p /R p ] O p.. α k po for some k = µ α x) µ pβ x k ) with pβ = α k = µ α x) x m mod p) for some m. 5. µ α x) x m mod p) for some m = α m pa = α k po for some k. 6. R p = { α A α k po for some k }. 7. [R p /R p ] = { γ O γr p A }. Proposition. If A = O p then A = [R p /R p ]. Proof. There exists m such that R m p pa. Choose γ O p A, and while γr p A replace γ γα γr p A. It follows that after m such replacements we would have γ A. Therefore, after at most m replacements we will have γr p A, but with γ / A, so that [R p /R p ] A. Integral Bases 0 -May-0, 9:5 pm

11 Computing R p. Let q = p log p n. Then q n and, for α A, α k pa for some k α n pa α q pa. Take Then α = x ω + + x n ω n A. α p x p ωp + + xp nω p n x ω p + + x nω p n mod pa) and so Define the matrix T by Then α q x ω q + + x nω q n mod pa). ω q k = T jk ω j. α R p α q pa T jk x k 0 mod p) for j =,..., n. Solving this system of congruences gives R p. Computing T p. The computation of R p becomes burdensome when p is large. Instead, let T p = { α A trαβ) pz for all β A }. For i =,..., n let the matrix W i express the action of ω i on ω,..., ω n, i.e., ω i ω j = W i ) jk ω k for i, j =,..., n, and define the matrix T by T jk = trω j ω k ) = trw j W k ). Then, for α = x ω + + x n ω n A, we have α T p T jk x k 0 mod p) for j =,..., n. Solving this system of congruences gives T p. Integral Bases -May-0, 9:5 pm

12 Proposition. If p > n then R p = T p. Proof. It is clear that R p T p. Assume p > n and take α T p. Let µ α denote the minimal polynomial of α over Q. Since trα k ) 0 mod p) for all k > 0, it is a consequence of Newton s relations that µ α x) x m mod p), and therefore α R p. Computing [R p /R p ]. Let the matrices W,..., W n be defined as above. Take γ = y ω + + y n ω n QA = K and set C γ = y W + + y n W n. The matrix C γ expresses a Z-basis for γa in terms of ω,..., ω n. If the matrix J expresses a Z-basis for R p in terms of ω,..., ω n then JC γ J gives a Z-basis for γr p in terms of the basis for R p expressed by J, and therefore γr p R p JC γ J Z n n y i JW i J ) Z n n. Solving this set of n relations for the unknowns y,..., y n gives [R p /R p ]. Integral Bases -May-0, 9:5 pm

Explicit Methods in Algebraic Number Theory

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

More information

Resultants. Chapter Elimination Theory. Resultants

Resultants. Chapter Elimination Theory. Resultants Chapter 9 Resultants 9.1 Elimination Theory We know that a line and a curve of degree n intersect in exactly n points if we work in the projective plane over some algebraically closed field K. Using the

More information

RINGS: SUMMARY OF MATERIAL

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

More information

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

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

More information

TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction

TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS KEITH CONRAD A (monic) polynomial in Z[T ], 1. Introduction f(t ) = T n + c n 1 T n 1 + + c 1 T + c 0, is Eisenstein at a prime p when each coefficient

More information

TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction

TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS. 1. Introduction TOTALLY RAMIFIED PRIMES AND EISENSTEIN POLYNOMIALS KEITH CONRAD A (monic) polynomial in Z[T ], 1. Introduction f(t ) = T n + c n 1 T n 1 + + c 1 T + c 0, is Eisenstein at a prime p when each coefficient

More information

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

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

More information

Homework 8 Solutions to Selected Problems

Homework 8 Solutions to Selected Problems Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x

More information

Algebra Homework, Edition 2 9 September 2010

Algebra Homework, Edition 2 9 September 2010 Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.

More information

Algebraic Number Theory

Algebraic Number Theory TIFR VSRP Programme Project Report Algebraic Number Theory Milind Hegde Under the guidance of Prof. Sandeep Varma July 4, 2015 A C K N O W L E D G M E N T S I would like to express my thanks to TIFR for

More information

Problem 1A. Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1. (Hint: 1. Solution: The volume is 1. Problem 2A.

Problem 1A. Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1. (Hint: 1. Solution: The volume is 1. Problem 2A. Problem 1A Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1 (Hint: 1 1 (something)dz) Solution: The volume is 1 1 4xydz where x = y = 1 z 2 This integral has value 16/3 Problem 2A Let f(x)

More information

D-MATH Algebra I HS 2013 Prof. Brent Doran. Exercise 11. Rings: definitions, units, zero divisors, polynomial rings

D-MATH Algebra I HS 2013 Prof. Brent Doran. Exercise 11. Rings: definitions, units, zero divisors, polynomial rings D-MATH Algebra I HS 2013 Prof. Brent Doran Exercise 11 Rings: definitions, units, zero divisors, polynomial rings 1. Show that the matrices M(n n, C) form a noncommutative ring. What are the units of M(n

More information

ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008

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

More information

Quasi-reducible Polynomials

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

More information

Algebraic Number Theory summary of notes

Algebraic Number Theory summary of notes Algebraic Number Theory summary of notes Robin Chapman 3 May 2000, revised 28 March 2004, corrected 4 January 2005 This is a summary of the 1999 2000 course on algebraic number theory. Proofs will generally

More information

A connection between number theory and linear algebra

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.

More information

Solutions of exercise sheet 11

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

More information

1. a) Let ω = e 2πi/p with p an odd prime. Use that disc(ω p ) = ( 1) p 1

1. a) Let ω = e 2πi/p with p an odd prime. Use that disc(ω p ) = ( 1) p 1 Number Theory Mat 6617 Homework Due October 15, 018 To get full credit solve of the following 7 problems (you are welcome to attempt them all) The answers may be submitted in English or French 1 a) Let

More information

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

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

More information

Chapter 12. Algebraic numbers and algebraic integers Algebraic numbers

Chapter 12. Algebraic numbers and algebraic integers Algebraic numbers Chapter 12 Algebraic numbers and algebraic integers 12.1 Algebraic numbers Definition 12.1. A number α C is said to be algebraic if it satisfies a polynomial equation with rational coefficients a i Q.

More information

Math 121 Homework 2 Solutions

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.

More information

QUALIFYING EXAM IN ALGEBRA August 2011

QUALIFYING EXAM IN ALGEBRA August 2011 QUALIFYING EXAM IN ALGEBRA August 2011 1. There are 18 problems on the exam. Work and turn in 10 problems, in the following categories. I. Linear Algebra 1 problem II. Group Theory 3 problems III. Ring

More information

FACTORING IN QUADRATIC FIELDS. 1. Introduction

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

More information

88 CHAPTER 3. SYMMETRIES

88 CHAPTER 3. SYMMETRIES 88 CHAPTER 3 SYMMETRIES 31 Linear Algebra Start with a field F (this will be the field of scalars) Definition: A vector space over F is a set V with a vector addition and scalar multiplication ( scalars

More information

Section IV.23. Factorizations of Polynomials over a Field

Section IV.23. Factorizations of Polynomials over a Field IV.23 Factorizations of Polynomials 1 Section IV.23. Factorizations of Polynomials over a Field Note. Our experience with classical algebra tells us that finding the zeros of a polynomial is equivalent

More information

PART I ALGEBRAIC NUMBER THEORY

PART I ALGEBRAIC NUMBER THEORY PART I ALGEBRAIC NUMBER THEORY 3. Introduction Let Q { a b ; a, b Z, b 0}. Then we can regard Z as Z {α Q; fα 0 for some fx X + b Z[X]}. We can associate with Z the Riemann zeta function ζs n s Na s n

More information

4.5 Hilbert s Nullstellensatz (Zeros Theorem)

4.5 Hilbert s Nullstellensatz (Zeros Theorem) 4.5 Hilbert s Nullstellensatz (Zeros Theorem) We develop a deep result of Hilbert s, relating solutions of polynomial equations to ideals of polynomial rings in many variables. Notation: Put A = F[x 1,...,x

More information

Factorization in Integral Domains II

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

More information

Minimum Polynomials of Linear Transformations

Minimum Polynomials of Linear Transformations Minimum Polynomials of Linear Transformations Spencer De Chenne University of Puget Sound 30 April 2014 Table of Contents Polynomial Basics Endomorphisms Minimum Polynomial Building Linear Transformations

More information

Math 6370: Algebraic Number Theory

Math 6370: Algebraic Number Theory Math 6370: Algebraic Number Theory Taught by David Zywina Notes by David Mehrle dmehrle@math.cornell.edu Cornell University Spring 2018 Last updated May 13, 2018. The latest version is online here. Contents

More information

EIGENVALUES AND EIGENVECTORS 3

EIGENVALUES AND EIGENVECTORS 3 EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices

More information

Chapter 8. P-adic numbers. 8.1 Absolute values

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.

More information

5.1 Commutative rings; Integral Domains

5.1 Commutative rings; Integral Domains 5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following

More information

FACTORING AFTER DEDEKIND

FACTORING AFTER DEDEKIND FACTORING AFTER DEDEKIND KEITH CONRAD Let K be a number field and p be a prime number. When we factor (p) = po K into prime ideals, say (p) = p e 1 1 peg g, we refer to the data of the e i s, the exponents

More information

Algebraic number theory

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

More information

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

Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications 1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the

More information

A Note on Cyclotomic Integers

A Note on Cyclotomic Integers To the memory of Alan Thorndike, former professor of physics at the University of Puget Sound and a dear friend, teacher and mentor. A Note on Cyclotomic Integers Nicholas Phat Nguyen 1 Abstract. In this

More information

LECTURE NOTES IN CRYPTOGRAPHY

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

More information

Higher Hasse Witt matrices. Masha Vlasenko. June 1, 2016 UAM Poznań

Higher Hasse Witt matrices. Masha Vlasenko. June 1, 2016 UAM Poznań Higher Hasse Witt matrices Masha Vlasenko June 1, 2016 UAM Poznań Motivation: zeta functions and periods X/F q smooth projective variety, q = p a zeta function of X: ( Z(X/F q ; T ) = exp m=1 #X(F q m)

More information

Algebra Review 2. 1 Fields. A field is an extension of the concept of a group.

Algebra Review 2. 1 Fields. A field is an extension of the concept of a group. Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions

More information

Resultants. summary and questions. December 7, 2011

Resultants. summary and questions. December 7, 2011 Resultants summary and questions December 7, 2011 1 An exercise about free modules Let A be a unitary commutative integral ring. Let K be the fraction field of A. Let n 1 be an integer. Set V = A n and

More information

Polynomials. Chapter 4

Polynomials. Chapter 4 Chapter 4 Polynomials In this Chapter we shall see that everything we did with integers in the last Chapter we can also do with polynomials. Fix a field F (e.g. F = Q, R, C or Z/(p) for a prime p). Notation

More information

MADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking

MADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking MADHAVA MATHEMATICS COMPETITION, December 05 Solutions and Scheme of Marking NB: Part I carries 0 marks, Part II carries 30 marks and Part III carries 50 marks Part I NB Each question in Part I carries

More information

Solutions of exercise sheet 6

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

More information

Homework 4 Solutions

Homework 4 Solutions Homework 4 Solutions November 11, 2016 You were asked to do problems 3,4,7,9,10 in Chapter 7 of Lang. Problem 3. Let A be an integral domain, integrally closed in its field of fractions K. Let L be a finite

More information

Page Points Possible Points. Total 200

Page Points Possible Points. Total 200 Instructions: 1. The point value of each exercise occurs adjacent to the problem. 2. No books or notes or calculators are allowed. Page Points Possible Points 2 20 3 20 4 18 5 18 6 24 7 18 8 24 9 20 10

More information

18.S34 linear algebra problems (2007)

18.S34 linear algebra problems (2007) 18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction

More information

Groups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002

Groups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002 Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary

More information

Pivoting. Reading: GV96 Section 3.4, Stew98 Chapter 3: 1.3

Pivoting. Reading: GV96 Section 3.4, Stew98 Chapter 3: 1.3 Pivoting Reading: GV96 Section 3.4, Stew98 Chapter 3: 1.3 In the previous discussions we have assumed that the LU factorization of A existed and the various versions could compute it in a stable manner.

More information

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

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)

More information

MT5836 Galois Theory MRQ

MT5836 Galois Theory MRQ MT5836 Galois Theory MRQ May 3, 2017 Contents Introduction 3 Structure of the lecture course............................... 4 Recommended texts..................................... 4 1 Rings, Fields and

More information

arxiv: v1 [math.nt] 2 Jul 2009

arxiv: v1 [math.nt] 2 Jul 2009 About certain prime numbers Diana Savin Ovidius University, Constanţa, Romania arxiv:0907.0315v1 [math.nt] 2 Jul 2009 ABSTRACT We give a necessary condition for the existence of solutions of the Diophantine

More information

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

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.

More information

Diophantine Equations

Diophantine Equations Diophantine Equations Michael E. Pohst Institut für Mathematik Technische Universität Berlin May 24, 2013 Mordell s equation y 2 = x 3 + κ is one of the classical diophantine equations. In his famous book

More information

Practice problems for first midterm, Spring 98

Practice problems for first midterm, Spring 98 Practice problems for first midterm, Spring 98 midterm to be held Wednesday, February 25, 1998, in class Dave Bayer, Modern Algebra All rings are assumed to be commutative with identity, as in our text.

More information

Introduction to finite fields

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

More information

Coding Theory ( Mathematical Background I)

Coding Theory ( Mathematical Background I) N.L.Manev, Lectures on Coding Theory (Maths I) p. 1/18 Coding Theory ( Mathematical Background I) Lector: Nikolai L. Manev Institute of Mathematics and Informatics, Sofia, Bulgaria N.L.Manev, Lectures

More information

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1 2 3 style total Math 415 Examination 3 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. The rings

More information

1 Number Fields Introduction Algebraic Numbers Algebraic Integers Algebraic Integers Modules over Z...

1 Number Fields Introduction Algebraic Numbers Algebraic Integers Algebraic Integers Modules over Z... Contents 1 Number Fields 3 1.1 Introduction............................ 3 1.2 Algebraic Numbers........................ 5 2 Algebraic Integers 7 2.1 Algebraic Integers......................... 7 2.2 Modules

More information

PROBLEMS ON LINEAR ALGEBRA

PROBLEMS ON LINEAR ALGEBRA 1 Basic Linear Algebra PROBLEMS ON LINEAR ALGEBRA 1. Let M n be the (2n + 1) (2n + 1) for which 0, i = j (M n ) ij = 1, i j 1,..., n (mod 2n + 1) 1, i j n + 1,..., 2n (mod 2n + 1). Find the rank of M n.

More information

MTH310 EXAM 2 REVIEW

MTH310 EXAM 2 REVIEW MTH310 EXAM 2 REVIEW SA LI 4.1 Polynomial Arithmetic and the Division Algorithm A. Polynomial Arithmetic *Polynomial Rings If R is a ring, then there exists a ring T containing an element x that is not

More information

18. Cyclotomic polynomials II

18. Cyclotomic polynomials II 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

More information

Algebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.

Algebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example. Coding Theory Massoud Malek Algebra Congruence Relation The definition of a congruence depends on the type of algebraic structure under consideration Particular definitions of congruence can be made for

More information

Solutions of exercise sheet 8

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

More information

Math 120 HW 9 Solutions

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

More information

Polynomials. Henry Liu, 25 November 2004

Polynomials. Henry Liu, 25 November 2004 Introduction Polynomials Henry Liu, 25 November 2004 henryliu@memphis.edu This brief set of notes contains some basic ideas and the most well-known theorems about polynomials. I have not gone into deep

More information

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

(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.)

More information

PMATH 441/641 ALGEBRAIC NUMBER THEORY

PMATH 441/641 ALGEBRAIC NUMBER THEORY PMATH 441/641 ALGEBRAIC NUMBER THEORY 1. Lecture: Wednesday, January 5, 000 NO TEXT References: Number Fields (Marcus) Algebraic Number Theory (Lang) (Stewart & Hill) Marks: Final Exam 65% Midterm 5% Assignments

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND

More information

THE DIFFERENT IDEAL. Then R n = V V, V = V, and V 1 V 2 V KEITH CONRAD 2 V

THE DIFFERENT IDEAL. Then R n = V V, V = V, and V 1 V 2 V KEITH CONRAD 2 V THE DIFFERENT IDEAL KEITH CONRAD. Introduction The discriminant of a number field K tells us which primes p in Z ramify in O K : the prime factors of the discriminant. However, the way we have seen how

More information

Algebra Qualifying Exam, Fall 2018

Algebra Qualifying Exam, Fall 2018 Algebra Qualifying Exam, Fall 2018 Name: Student ID: Instructions: Show all work clearly and in order. Use full sentences in your proofs and solutions. All answers count. In this exam, you may use the

More information

LECTURE 10, MONDAY MARCH 15, 2004

LECTURE 10, MONDAY MARCH 15, 2004 LECTURE 10, MONDAY MARCH 15, 2004 FRANZ LEMMERMEYER 1. Minimal Polynomials Let α and β be algebraic numbers, and let f and g denote their minimal polynomials. Consider the resultant R(X) of the polynomials

More information

Modern Algebra 2: Midterm 2

Modern Algebra 2: Midterm 2 Modern Algebra 2: Midterm 2 April 3, 2014 Name: Write your answers in the space provided. Continue on the back for more space. The last three pages are left blank for scratch work. You may detach them.

More information

Rings in Coding Theory

Rings in Coding Theory Rings in Coding Theory Steven T. Dougherty July 3, 2013 Cyclic Codes Cyclic Codes were first studied by Prange in 1957. Prange, E. Cyclic error-correcting codes in two symbols. Technical Note TN-57-103,

More information

Congruences for Coefficients of Power Series Expansions of Rational Functions. Bachelor Thesis

Congruences for Coefficients of Power Series Expansions of Rational Functions. Bachelor Thesis Congruences for Coefficients of Power Series Expansions of Rational Functions Bachelor Thesis Author Marc Houben 4094573 Supervisor prof. dr. Frits Beukers Acknowledgements First and foremost I would like

More information

B3.4 Algebraic Number Theory

B3.4 Algebraic Number Theory B3.4 Algebraic Number Theory January 2017 Throughout these notes we use the abbreviation NE for not examinable in this course. Lectures will omit some of the non-examinable proofs, and some of the examples

More information

ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS

ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.

More information

Practice Algebra Qualifying Exam Solutions

Practice Algebra Qualifying Exam Solutions Practice Algebra Qualifying Exam Solutions 1. Let A be an n n matrix with complex coefficients. Define tr A to be the sum of the diagonal elements. Show that tr A is invariant under conjugation, i.e.,

More information

ARITHMETIC IN PURE CUBIC FIELDS AFTER DEDEKIND.

ARITHMETIC IN PURE CUBIC FIELDS AFTER DEDEKIND. ARITHMETIC IN PURE CUBIC FIELDS AFTER DEDEKIND. IAN KIMING We will study the rings of integers and the decomposition of primes in cubic number fields K of type K = Q( 3 d) where d Z. Cubic number fields

More information

Parity of the Number of Irreducible Factors for Composite Polynomials

Parity of the Number of Irreducible Factors for Composite Polynomials Parity of the Number of Irreducible Factors for Composite Polynomials Ryul Kim Wolfram Koepf Abstract Various results on parity of the number of irreducible factors of given polynomials over finite fields

More information

FACTORIZATION OF IDEALS

FACTORIZATION OF IDEALS FACTORIZATION OF IDEALS 1. General strategy Recall the statement of unique factorization of ideals in Dedekind domains: Theorem 1.1. Let A be a Dedekind domain and I a nonzero ideal of A. Then there are

More information

a c b b a + c b + c. c b a + c

a c b b a + c b + c. c b a + c TRACE AND NORM KEITH CONRAD 1. Introduction Let L/K be a finite extension of fields, with n = [L : K]. We will associate to this extension two important functions L K, called the trace and the norm. For

More information

Spectra of Semidirect Products of Cyclic Groups

Spectra of Semidirect Products of Cyclic Groups Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with

More information

MINKOWSKI THEORY AND THE CLASS NUMBER

MINKOWSKI THEORY AND THE CLASS NUMBER MINKOWSKI THEORY AND THE CLASS NUMBER BROOKE ULLERY Abstract. This paper gives a basic introduction to Minkowski Theory and the class group, leading up to a proof that the class number (the order of the

More information

IRREDUCIBILITY TESTS IN Q[T ]

IRREDUCIBILITY TESTS IN Q[T ] IRREDUCIBILITY TESTS IN Q[T ] KEITH CONRAD 1. Introduction For a general field F there is no simple way to determine if an arbitrary polynomial in F [T ] is irreducible. Here we will focus on the case

More information

Solutions to Assignment 3

Solutions to Assignment 3 Solutions to Assignment 3 Question 1. [Exercises 3.1 # 2] Let R = {0 e b c} with addition multiplication defined by the following tables. Assume associativity distributivity show that R is a ring with

More information

Linear algebra I Homework #1 due Thursday, Oct Show that the diagonals of a square are orthogonal to one another.

Linear algebra I Homework #1 due Thursday, Oct Show that the diagonals of a square are orthogonal to one another. Homework # due Thursday, Oct. 0. Show that the diagonals of a square are orthogonal to one another. Hint: Place the vertices of the square along the axes and then introduce coordinates. 2. Find the equation

More information

Math 121 Homework 3 Solutions

Math 121 Homework 3 Solutions Math 121 Homework 3 Solutions Problem 13.4 #6. Let K 1 and K 2 be finite extensions of F in the field K, and assume that both are splitting fields over F. (a) Prove that their composite K 1 K 2 is a splitting

More information

LECTURES ON ALGEBRAIC NUMBER THEORY. Yichao TIAN

LECTURES ON ALGEBRAIC NUMBER THEORY. Yichao TIAN LECTURES ON ALGEBRAIC NUMBER THEORY Yichao TIAN Yichao TIAN Morningside Center of Mathematics, 55 Zhong Guan Cun East Road, Beijing, 100190, China. E-mail : yichaot@math.ac.cn LECTURES ON ALGEBRAIC NUMBER

More information

Public-key Cryptography: Theory and Practice

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

More information

Mathematical Olympiad Training Polynomials

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,

More information

Finite Fields. Sophie Huczynska. Semester 2, Academic Year

Finite Fields. Sophie Huczynska. Semester 2, Academic Year Finite Fields Sophie Huczynska Semester 2, Academic Year 2005-06 2 Chapter 1. Introduction Finite fields is a branch of mathematics which has come to the fore in the last 50 years due to its numerous applications,

More information

Computation of a Power Integral Basis of a Pure Cubic Number Field

Computation of a Power Integral Basis of a Pure Cubic Number Field Int. J. Contemp. Math. Sci., Vol. 2, 2007, no. 13, 601-606 Computation of a Power Integral Basis of a Pure Cubic Number Field L houssain EL FADIL Faculté Polydisciplinaire de Ouarzazat Ouarzazat-Morocco

More information

4.4 Noetherian Rings

4.4 Noetherian Rings 4.4 Noetherian Rings Recall that a ring A is Noetherian if it satisfies the following three equivalent conditions: (1) Every nonempty set of ideals of A has a maximal element (the maximal condition); (2)

More information

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

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

More information

Generalized Reed-Solomon Codes

Generalized Reed-Solomon Codes Chapter 5 Generalized Reed-Solomon Codes In 1960, I.S. Reed and G. Solomon introduced a family of error-correcting codes that are douly lessed. The codes and their generalizations are useful in practice,

More information

HW2 Solutions

HW2 Solutions 8.024 HW2 Solutions February 4, 200 Apostol.3 4,7,8 4. Show that for all x and y in real Euclidean space: (x, y) 0 x + y 2 x 2 + y 2 Proof. By definition of the norm and the linearity of the inner product,

More information

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. 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

More information

Representations and Linear Actions

Representations and Linear Actions Representations and Linear Actions Definition 0.1. Let G be an S-group. A representation of G is a morphism of S-groups φ G GL(n, S) for some n. We say φ is faithful if it is a monomorphism (in the category

More information