First and raw version september 2013 klokken 13:45
|
|
- Lora Patterson
- 8 years ago
- Views:
Transcription
1 The discriminant First and raw version september 2013 klokken 13:45 One of the most significant invariant of an algebraic number field is the discriminant. One is tempted to say, apart from the degree, the most fundamental invariant. In simplest case of a quadratic equation, the discriminant tells us the behavior of solution, and of course, even its square roots gives us the solutions. To some extent the same is true for cubic equations, and the higher the degree of an equation less the influence of the discriminant is, but it always plays an important role. For a field extension we shall define a discriminant for any basis. Of course this depends on the basis, but in a very perspicuous way. In the case of a number field, the ring of algebraic integers A is a free module over Z, andifthebasisesareconfined to be Z-basis for A, thediscriminantisanintegerindependentofthethebasis,isan invariant of the number field. The discriminant serves several purposes at. Its main main feature is that it tells us in which primes a number fields ramify, or more generally, in which prime ideals an extension ramifies. Additionally the discriminant is a valuable tool to find Z-basis for the ring A of algebraic integers in a number field. To describe A is in general a difficult task, and the discriminant is some times helpful. In relative situation, the situation is somehow more complicated, and the discriminant is well-defined just as an ideal. The discriminant of a basis The scenario is the usual one: A denotes a Dedekind ring with quotient field K, andl afinite,separableextensionofk. The integral closure of A in L is B. InSeparability we defined the trace form tr L/K (xy). ItisasymmetricandquadraticformonL taking values in K, andsincel is separable over K, itisnon-degenerateaftertheorem1 on page 10 of Separability. Let 1,..., n be a K-basis for L and denote it by B.Onemayform asonemaydo for any quadratic form the matrix M of the trace form by putting M =(tr L/K ( i j )). If B and B are the coordinate vectors relative to the basis B of two elements and of L, thevalueofthetraceformtr L/K ( ) is given as is tr KQ ( )= t BM B We define the discriminant of the basis B as the determinant of the matrix M. That B = ( 1,..., n ) = det(tr K/Q ( i j )). The discriminant depends of course on the basis, but in a very clean way. Assume that B 0 is another basis and denote by M 0 the matrix of the trace form in that basis. 1
2 If V denotes the transition matrix between the two basis that is B = V B 0 for all then BM t B =(V B 0) t M(V B 0)= B t 0(V t MV) B 0, and as this holds for all and determinants, one obtains:, one draws the conclusion that M 0 = V t MV.Taking Lemma 1 Assume that B and B 0 are two K-basises for the field L with transitions matrix V (from B 0 to B). Then the relation between the corresponding discriminants is given as: B0 =(detv )2 B An important observation is, that if B is an integral basis, i.e., the basis elements are all lying in B, thenthediscriminantbelongstoa. Indeed,alreadytheallthetraces tr L/K ( i j ) lie in A. Example. The case of a primitive basis. Assume that the field L has a primitive element x, i.e., L = K(x), andletn be the degree of x. Then L has the special basis 1,x,...,x n 1 formed by the n first powers of x. There is a nice expression for the discriminant of L over K in that particular basis, it equals the discriminant of the minimal polynomial of x as defined in Separability. Torealizethis,let! 1,...,! n be the roots of the minimal polynomial of x in some big field. Inotherwords,the values the different embeddings of L in take at x. The! k s are the eigenvalues in of the multiplication map x,andthereforetr L/K (x i )= P k!i k. Let V =(! j 1 i ) be the van der Monde matrix formed by the! is. 0 Then, forming the product of V and its transposed, we get V t V =(! i 1 j )(! j 1 i )=( X k! i 1 k! j 1 k )=( X k! i+j 2 k )=(tr L/K (x i 1 x j 1 )), and therefore 1,x,...,x n 1 =(detv )2. Combining this with xxxx, we obtain Proposition 1 Given a field extension L = K(x) of degree n with primitive element x. Assumethatx has the minimal polynomial f(t) over K. Thenthediscriminantof the power basis 1,x...,x n 1 is equal to the discriminant of the polynomial f. Thatis f = 1,x,...,x n 1. e The case of extensions of a pid Assume now that in the standard setup A is a principal ideal domain, and n =[L : K]. The two main cases that concerns us are the case of a number field whose with ring of integers extends the principal ideal domain Z and the case that A is a dvr.ifa is 2
3 a pid,anyfinitelygeneratedandtorsionfreemoduleovera is a free module and thus has an A-basis. The transition matrix between two such Z-basises belongs to group Gl(n)A of invertible n n-matrices with coefficients in A, anditsdeterminantbelongs therefore to groups A of units. The case of a number field In the all-important case of a number field the ring of integers A is a free Z-module, and the determinant of a transition matrix between two basises equals ±1. The formula in lemma 1 above shows that the discriminant B is independent of B as long as we restrict B to be a Z-basis of A. This number i called the discriminant of K and it is denoted by K. Proposition 2 Assume that K is a number field and that A is the ring of integers in K. Thenthediscriminant B is independent of the basis B as long as B is a Z-basis for A. Itiscalledthe discriminant of K and denoted by K. Example. The discriminant of the quadratic field Q( p d) depends on the residue class of d mod 4. The discriminant is 4d in case d 6 1 mod 4 and equals d if d 1 mod 4. e The discriminant and the ramified primes The most important application of the discriminant is that it detects ramification. In the case that A has a primitive element, say A = Z[ ], thisisreasonable,sincethenaprimep ramifies exactly when the minimal polynomial f(x) of has a multiple root modulo p, andthediscriminant of f(x) is made to detect this. However, in general A does not have a primitive element and this complicates the matter substantially, but still the discriminant behaves well: Theorem 1 Assume that K is a number field with discriminant is ramified in K if and only if p divides the discriminant K. K. Thenaprimep Proof: There are three points, the first one being that the trace is functorial in the following sense. Let p 2 Z be a prime and let a 1,...,a n be a Z basis for A. Then of course ā 1,...,ā n is a k(p) basis for A/pA. Clearly if one reduces the multiplication map a in A modulo p one obtains the multiplication map ā in A/pA. NowusinganZ-basis for A to compute tr K/Q (a), oneseesthattheintegertr K/Q (a) reduces to tr A/pA/k(p) (a) mod p. Applyingthistoallthecoefficientsofthematrix(tr K/Q (a i a j )), oneobtainsthat det(tr K/Q (a i a j )) reduces to det(tr (A/pA)/k(p) (ā i ā j )) mod p, andas K =det(tr K/Q (a i a j )), it follows that p divides K if and only if the trace form on the k(p)-algebra A/pA is degenerate. The second point is that trace form on A/pA is non-degenerate if and only if A/pA is a product of separable field extensions of k(p). Butask(p) is a finite field, all field extensions are separable, so this happens if and only if A/pA is a product of fields. That is, if and only if it has no nilpotent elements. The third and final point is that A/pA = Q 1appleiapples A/qe i i is without nilpotents if and only if all the e i s are equal to one, that is if and only if p is non-ramified. o 3
4 The discriminant and the ring of integers. The discriminant can sometimes be of great help to find the ring of integers in a number field. Assume we have at our disposal an integral basis B of K, thatisaq-basis for K contained in A. Assumethat B 0 is a Z-basis for A and let V be the transition matrix between these two basises. The known basis B will be a Z-basis for A if and only if V is invertible in Gl(Z)n, thatis, if and only if det V is plus or minus one. But by lemma 1 above the two discriminant B and B 0 differ by the factor (det V ) 2,henceif B is a square free integer, itmustbe so that det V = ±1, andourbasisb is a Z-basis for A. Proposition 3 Assume that K is a number field with ring of integers is A. Ifan integral basis for K has a square free determinant, then it is a Z-basis for A. Example. Let f(x) =x 3 x 1, thenf(x) is irreducible (only possible roots are ±1). Let K = Q( ) where is one of the roots of f. The polynomial f(x) has discriminant 4( 1) = 23 which coincides with the diskriminant of the basis 1,, 2. This is obviously an integral basis, and 23 is square free. It follows that 1,, 2 is a basis for the ring of integers. e Problem 1. Let f(x) =x 3 x +3.Showthatf(x) is irreducible over Q and if denotes a root of f(x), findabasisfortheringofintegersk = Q( ). Hint: Compute the discriminant by the formula 4a 3 27b 2 (see Separability for this formula) X Problem 2. Let g(x) =x 3 3x +9.Showthatg is irreducible and compute the discriminant of f. Let be a root of g(x). ShowthatQ( ) =Q( ) =K (where is as in the previous problem). Show that Z[ ] is not the ring of integers in K. Hint: 3/ is a root of g(x). X Problem 3. Assume that a 1,...,a n is an integral basis for A. Showthatifd = (a 1,...,a n ),thenda a 1 Z + + a n Z. X Problem 4. Let 1,..., n be the different embeddings of the number field K into some big field. Let 1,..., n be a basis for K over Q. Showthat ( 1,..., n )=(det( i ( j ))) 2 X Problem 5. Let ( i ( j )) be the n n-matrix from problem 4.LetP = P even (1)( 1 ) (n)( n ) and N = P odd (1)( 1 ) (n)( n ) where runs through the permutations of {1,...,n}. Showthatdet(a ij )=P N, andthatbothp + N and PN are invariant under the action of that permutes the different embeddings i. Then show that P and N both lie in Z. X Problem 6. (Stickelberger). Let K be the discriminant of the number field K. Show that K is a square modulo 4, hence K 0 or K 1 modulo 4. Hint: Write =(P N) 2 =(P + N) 2 4PN with a smart choice of P an N. X 4
5 The general case and the diskriminant ideal In the general case, there is no way of getting one element in A that plays the role of the discriminant as for a number field. There are two reasons for this. First of all, the ring B is not necessarily is a free A-module and we do have A-basises for B at our disposal. Secondly, even if B were a free A-module, the group A of units in A is in general much more complicated than the one of Z and (A ) 2 can be highly non-trivial. However one may define a discriminant ideal d B/A that does the job. It is defined as the ideal in A generated by (b 1,...,b n ) as the b 1,...,b n run through all integral basises for L over K. Recallthatthismeansthatb 1,...,b n is a basis for L contained in B. In case K is number field with ring of integers A, thediscriminant K is a slightly more subtle invariant than the discriminant ideal d A/Z.Ofcourse, K will be one of the two generators of d A/Z,thesubtilityliesinthefactthatoneofthemispreferredover the other. Just like for the discriminant, the interest of the discriminant deal lies in the fact that it detects ramification: Theorem 2 (Dedekind) Let A be a Dedekind ring with quotient field K and let B be the integral closure of A in a finite and separable extension L of K. Thenaprime p of A ramifies in B if and only if d B/A p. Proof: The proof has three ingredient. The first one is that the discriminant ideal localizes well. That is If S is a multiplicative system in A, wehaved BS /A S =(d B/A ) S Clearly if 1,..., n is a K-basis for L contained in B,itisaK-basis for L contained in B S.Hencetheinclusion(d B/A ) S d BS /A S.Ontheotherhand,if 1,..., n is a K basis for L contained in the localization B S,thens 1,...,s n is contained in B for a suitable s 2 S, anditisstillak basis for L. Obviously (s 1,...,s n )=s 2n ( 1,..., n ). This shows that d BS /A S (d B/A ) S. The second ingredient is that the ramification behavior of a prime ideal localizes. This somehow vague statement, means the following: If p is a prime ideal i A, thenp ramifies in B if and only if pa p ramifies in B p. Indeed, this is an immediate consequence of the isomorphism B/p ' B p /pb p and the fact that p ramifies (respectively pa p )ifandonlyifb/pb (resp. B p /pb p )has non-trivial nilpotent elements. The third and final ingredient is that the theorem holds for the local rings A p,in fact it holds whenever A is a pid : If A is a pid,thenp ramifies if and only if d B/A p. Indeed, it follows from lemma 1 on page 2 that if 1,..., n is an integral basis for L, then ( 1,..., n ) is a generator for the discriminant ideal d B/A.AndasB is a free A- module (any torsion free and finitely generated A-module is since A is, a pid )theproof of theorem 1 shows mutatis mutandi that p ramifies if and only if ( 1,..., n ) /2 p. o 5
6 An observation which is not aprioriclear, is that in the standard situation, only finitely many prime ideals ramify in B. Versjon: Monday, September 23, :45:34 PM 6
Factoring of Prime Ideals in Extensions
Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree
More informationA number field is a field of finite degree over Q. By the Primitive Element Theorem, any number
Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and
More informationModern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)
Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)
More information3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
More informationit is easy to see that α = a
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 UF. Therefore
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationFACTORING 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 informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationUnique Factorization
Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon
More informationFactorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
More informationEXERCISES FOR THE COURSE MATH 570, FALL 2010
EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More information7. Some irreducible polynomials
7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of
More informationCyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
More informationHow To Understand The Relation Between Quadratic And Binary Forms
8430 HANDOUT 3: ELEMENTARY THEORY OF QUADRATIC FORMS PETE L. CLARK 1. Basic definitions An integral binary quadratic form is just a polynomial f = ax 2 + bxy + cy 2 with a, b, c Z. We define the discriminant
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set
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 called a quadratic field and it has degree 2 over Q. Similarly,
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationAlgebraic Number Theory
Algebraic Number Theory 1. Algebraic prerequisites 1.1. General 1.1.1. Definition. For a field F define the ring homomorphism Z F by n n 1 F. Its kernel I is an ideal of Z such that Z/I is isomorphic to
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationMODULES OVER A PID KEITH CONRAD
MODULES OVER A PID KEITH CONRAD Every vector space over a field K that has a finite spanning set has a finite basis: it is isomorphic to K n for some n 0. When we replace the scalar field K with a commutative
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationFactoring Cubic Polynomials
Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than
More informationModule MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationH/wk 13, Solutions to selected problems
H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.
More informationMonogenic Fields and Power Bases Michael Decker 12/07/07
Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Z-module, the nicest possible case is
More informationZeros of Polynomial Functions
Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY
ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY HENRY COHN, JOSHUA GREENE, JONATHAN HANKE 1. Introduction These notes are from a series of lectures given by Henry Cohn during MIT s Independent Activities
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More informationChapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18 of Gallian s Contemporary Abstract Algebra. Most of the important
More informationSOLUTIONS TO PROBLEM SET 3
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
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More information6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives
6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise
More informationPrimality - Factorization
Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
More informationcalculating the result modulo 3, as follows: p(0) = 0 3 + 0 + 1 = 1 0,
Homework #02, due 1/27/10 = 9.4.1, 9.4.2, 9.4.5, 9.4.6, 9.4.7. Additional problems recommended for study: (9.4.3), 9.4.4, 9.4.9, 9.4.11, 9.4.13, (9.4.14), 9.4.17 9.4.1 Determine whether the following polynomials
More informationLecture 18 - Clifford Algebras and Spin groups
Lecture 18 - Clifford Algebras and Spin groups April 5, 2013 Reference: Lawson and Michelsohn, Spin Geometry. 1 Universal Property If V is a vector space over R or C, let q be any quadratic form, meaning
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationINTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 16
INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 16 RAVI VAKIL Contents 1. Valuation rings (and non-singular points of curves) 1 1.1. Completions 2 1.2. A big result from commutative algebra 3 Problem sets back.
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More informationIntroduction to Algebraic Number Theory. F. Oggier
Introduction to Algebraic Number Theory F. Oggier 2 A few words These are lecture notes for the class on introduction to algebraic number theory, given at NTU from January to April 2009 and 2010. These
More information1 = (a 0 + b 0 α) 2 + + (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
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationBasics of Polynomial Theory
3 Basics of Polynomial Theory 3.1 Polynomial Equations In geodesy and geoinformatics, most observations are related to unknowns parameters through equations of algebraic (polynomial) type. In cases where
More informationPrime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
More information6. Fields I. 1. Adjoining things
6. Fields I 6.1 Adjoining things 6.2 Fields of fractions, fields of rational functions 6.3 Characteristics, finite fields 6.4 Algebraic field extensions 6.5 Algebraic closures 1. Adjoining things The general
More information3.6 The Real Zeros of a Polynomial Function
SECTION 3.6 The Real Zeros of a Polynomial Function 219 3.6 The Real Zeros of a Polynomial Function PREPARING FOR THIS SECTION Before getting started, review the following: Classification of Numbers (Appendix,
More informationThe van Hoeij Algorithm for Factoring Polynomials
The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial
More informationOn the generation of elliptic curves with 16 rational torsion points by Pythagorean triples
On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a
More informationQUADRATIC RECIPROCITY IN CHARACTERISTIC 2
QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets
More informationSOLVING POLYNOMIAL EQUATIONS BY RADICALS
SOLVING POLYNOMIAL EQUATIONS BY RADICALS Lee Si Ying 1 and Zhang De-Qi 2 1 Raffles Girls School (Secondary), 20 Anderson Road, Singapore 259978 2 Department of Mathematics, National University of Singapore,
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationAlex, I will take congruent numbers for one million dollars please
Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory
More informationHow To Find Out How To Build An Elliptic Curve Over A Number Field
Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International
More informationPolynomial Factorization Algorithms over Number Fields
J. Symbolic Computation (2002) 11, 1 14 Polynomial Factorization Algorithms over Number Fields Xavier-François Roblot roblot@euler.univ-lyon1.fr Institut Girard Desargues, Université Claude Bernard, Lyon,
More information9. 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.
9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role
More informationOSTROWSKI FOR NUMBER FIELDS
OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for
More informationField Fundamentals. Chapter 3. 3.1 Field Extensions. 3.1.1 Definitions. 3.1.2 Lemma
Chapter 3 Field Fundamentals 3.1 Field Extensions If F is a field and F [X] is the set of all polynomials over F, that is, polynomials with coefficients in F, we know that F [X] is a Euclidean domain,
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More informationThe finite field with 2 elements The simplest finite field is
The finite field with 2 elements The simplest finite field is GF (2) = F 2 = {0, 1} = Z/2 It has addition and multiplication + and defined to be 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 0 0 = 0 0 1 = 0
More informationSOLVING POLYNOMIAL EQUATIONS
C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationComputing Cubic Fields in Quasi-Linear Time
Computing Cubic Fields in Quasi-Linear Time K. Belabas Département de mathématiques (A2X) Université Bordeaux I 351, cours de la Libération, 33405 Talence (France) belabas@math.u-bordeaux.fr Cubic fields
More informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationLecture 10: Distinct Degree Factoring
CS681 Computational Number Theory Lecture 10: Distinct Degree Factoring Instructor: Piyush P Kurur Scribe: Ramprasad Saptharishi Overview Last class we left of with a glimpse into distant degree factorization.
More informationLecture Notes on Polynomials
Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex
More informationr + s = i + j (q + t)n; 2 rs = ij (qj + ti)n + qtn.
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 informationGalois Theory III. 3.1. Splitting fields.
Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationZero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.
MATH 11011 FINDING REAL ZEROS KSU OF A POLYNOMIAL Definitions: Polynomial: is a function of the form P (x) = a n x n + a n 1 x n 1 + + a x + a 1 x + a 0. The numbers a n, a n 1,..., a 1, a 0 are called
More informationFIBER PRODUCTS AND ZARISKI SHEAVES
FIBER PRODUCTS AND ZARISKI SHEAVES BRIAN OSSERMAN 1. Fiber products and Zariski sheaves We recall the definition of a fiber product: Definition 1.1. Let C be a category, and X, Y, Z objects of C. Fix also
More information3 Factorisation into irreducibles
3 Factorisation into irreducibles Consider the factorisation of a non-zero, non-invertible integer n as a product of primes: n = p 1 p t. If you insist that primes should be positive then, since n could
More informationEMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION
EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION CHRISTIAN ROBENHAGEN RAVNSHØJ Abstract. Consider the Jacobian of a genus two curve defined over a finite field and with complex multiplication.
More informationGeneric Polynomials of Degree Three
Generic Polynomials of Degree Three Benjamin C. Wallace April 2012 1 Introduction In the nineteenth century, the mathematician Évariste Galois discovered an elegant solution to the fundamental problem
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More informationLecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic. Theoretical Underpinnings of Modern Cryptography
Lecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic Theoretical Underpinnings of Modern Cryptography Lecture Notes on Computer and Network Security by Avi Kak (kak@purdue.edu) January 29, 2015
More informationFactoring Polynomials and Solving Quadratic Equations
Factoring Polynomials and Solving Quadratic Equations Math Tutorial Lab Special Topic Factoring Factoring Binomials Remember that a binomial is just a polynomial with two terms. Some examples include 2x+3
More informationLECTURES 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 information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More information(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9
Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned
More informationCryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More informationNon-unique factorization of polynomials over residue class rings of the integers
Comm. Algebra 39(4) 2011, pp 1482 1490 Non-unique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate non-unique factorization
More informationFactoring Algorithms
Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors
More informationChapter 1. Search for Good Linear Codes in the Class of Quasi-Cyclic and Related Codes
Chapter 1 Search for Good Linear Codes in the Class of Quasi-Cyclic and Related Codes Nuh Aydin and Tsvetan Asamov Department of Mathematics, Kenyon College Gambier, OH, USA 43022 {aydinn,asamovt}@kenyon.edu
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationGROUP ALGEBRAS. ANDREI YAFAEV
GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite
More information