QUADRATIC RINGS PETE L. CLARK

Transcription

1 QUADRATIC RINGS PETE L. CLARK 1. Quadratic fields and quadratic rings Let D be a squarefree integer not equal to 0 or 1. Then D is irrational, and Q[ D], the subring of C obtained by adjoining D to Q, is a field. From an abstract algebraic perspective, an explanation for this can be given as follows: since D is irrational, the polynomial t D is irreducible over Q. Since the ring Q[t] is a PID, the irreducible element t D generates a maximal ideal (t D), so that the quotient Q[t]/(t D) is a field. Moreover, the map Q[ D] Q[t]/(t D) which is the identity on Q and sends D t is an isomorphism of rings, so Q[ D] is also a field. We may write Q[ D] = {a + b D a, b Q}, so that a basis for Q[ D] as a Q-vector space is 1, D. In particular Q[ D] is two-dimensional as a Q-vector space: we accordingly say it is a quadratic field. It is also easy to check by hand that the ring Q[ D] is a field. for many other things to come, the key identity is For this and (a + b D)(a b D) = a Db. For rational numbers a and b which are not both zero, the rational number a Db is also nonzero: equivalently there are no solutions to D = a b, because D is irrational. It follows that again, for a, b not both 0 we have ( a + b ) ( ) a D a Db b D a Db = 1, which gives a multiplicative inverse for a + b D in Q[ D]. We wish also to consider quadratic rings, certain integral domains whose fraction field is a quadratic field Q( D). Eventually we will want a more precise and inclusive definition, but for now we consider Z[ D] = {a + b D a, b Z}. 1. Fermat s Two Squares Theorem The rings Z[ D] occur naturally when we study Diophantine equations. E.g: 1 This equality is a fact which is not difficult to check; it is not the definition of Z[ D]. By way of comparison, we recommend that the reader check that the ring Z[ D ] is not of the form Zα+Zβ for any two fixed elements α, β of Z[ D ]. In fact its additive group is not finitely generated as an abelian group. 1

2 PETE L. CLARK Question 1. Which prime numbers p can be expressed as a sum of two squares? More precisely, for for which prime numbers p are there integers x and y such that (1) x + y = p? Remark: Evidently is a sum of squares: 1 +1 =. Henceforth we assume p >. At the moment we have exactly one general technique for studying Diophantine equations: congruences. So let s try to apply it here: if we reduce the equation x + y = p modulo p, we get x + y 0 (mod p). Suppose (x, y) Z is a solution to (1). It cannot be that p x, because then we would also have p y, and then p x + y = p, a contradiction. So both x and y are nonzero modulo p (hence invertible in Z/pZ) and the congruence can be rewritten as ( ) x 1 (mod p). y That is, a necessary condition for (1) to have solutions is that 1 be a square modulo p. From [Handout: Pythagorean Triples, Lemma 7] we know that this occurs if and only if p 1 (mod 4). Thus we have shown that (1) has no Z solutions unless p 1 (mod 4). What about the converse: if p 1 (mod 4), is p necessarily a sum of two squares? By Fermat s Lemma, there exists x Z such that x 1 (mod p), i.e., there exists n Z such that pn = x + 1. Now factor the right hand side over Z[ 1]: pn = (x + 1)(x 1). Suppose that p is prime as an element of Z[ 1]. Then it satisfies Euclid s Lemma: if p αβ, then p α or p β. Here, if p is prime in Z[ 1], then we get p x ± i. But this is absurd: what this means is that the quotient x±i p = x p ± 1 pi is an element of Z[ 1], i.e., that both x p and 1 p are integers. But obviously 1 p is not an integer. Therefore p is not prime, so 3 there exists a nontrivial factorization () p = αβ, where α = a + b 1, β = c + d 1 Z[ 1] are nonunit elements. complex conjugates of the above equation, we get (3) p = p = αβ = αβ. Multiplying () and (3) we get (4) p = (αα)(ββ) = (a + b )(c + d ). Taking Now, since α and β are evidently nonzero, we have a + b, c + d > 0. We claim that indeed a + b 1 and c + d 1. Indeed, if a + b 1 Z[ 1] with a + b = 1, then its multiplicative inverse in Q[ a 1] is a +b b a +b 1 = a b 1 which again lies in Z[ 1]. In other words, a + b = 1 implies that By a general technique, we mean a technique that can always be applied, not one that is guaranteed always to succeed. In that stronger sense there are provably no general technique for Diophantine equations! 3 A gap occurs in the argument here. It has been deliberately inserted for pedagogical reasons. Please keep reading at least until the beginning of the next section!

3 QUADRATIC RINGS 3 a + b 1 is a unit in Z[ 1], contrary to our assumption. Having ruled out that either a + b = 1 or c + d = 1, (4) now immediately implies a + b = c + d = p. But that is what we wanted: p is a sum of two squares! Thus we have (apparently...please read on!) proved the following theorem. Theorem 1. (Fermat s Two Squares Theorem) A prime number p can be expressed as the sum of two integer squares if and only if p = or p 1 (mod 4). 3. Fermat s Two Squares Theorem Lost The above proof of Theorem 1 was surprisingly quick and easy, especially compared to Fermat s original one: not having the notion of factorization in domains other than the integers, Fermat s uses (as is typical of him) a more intricate argument by descent. In fact, the way we have presented the above argument, it is too easy: there is a gap in the proof. The gap is rather subtle, and is analogous to a notorious mistake made by the early 19th century mathematician Lamé. Rather than expose it directly, let us try to squeeze more out of it and see what goes wrong. Namely, instead of just working with x + y = p and the corresponding quadratic ring Z[ 1], let consider the equation (5) x + Dy = p, where p is still a prime and D is a squarefree integer different from 0 or 1. We can mimic the above argument in two steps as follows: Step 1: By reducing modulo p, we get exactly as before that the existence of an integral solution to (5) implies that D is a square modulo p. Step : Conversely, assume that D is a square modulo p, i.e., there exists x Z such that D x (mod p). Again this leads means there exists n Z such that pn = x + D, and thus leads to a factorization in Z[ D], namely pn = (x + D)(x D). Now if p were a prime element in Z[ D] it would satisfy Euclid s Lemma, and therefore since it divides the product (x + D)(x D), it must divide one of the factors: p x ± D. But since x p ± 1 p D is still not in Z[ D], this is absurd: p is not a prime element in Z[ D]. So it factors nontrivially: p = αβ, for α, β nonunits in Z[ D]. Let us now define, for any α = a + b D Q( D), α = a b D. When D < 0 this is the usual complex conjugation. When D > 0 it is the conjugate in the sense of high school algebra (and also in Galois theory). It is entirely straightforward to verify the identity αβ = αβ in either case, so that again by taking conjugates we get also p = p = αβ,

4 4 PETE L. CLARK and multiplying the two equations we get p = (αα)(ββ) = (a Db )(c Db ). As above, if a Db = ±1, then the inverse of α lies in Z[ D], so α is a unit in Z[ D], which we assumed it not to be. This time, the conclusion we get is p = ±(a Db ). In particular, if D < 0, the conclusion we get is that p is of the form a + D b if and only if D is a square mod p. Unfortunately we can easily see that this conclusion is very often wrong. Namely, suppose D 3 and take p =. 4 Then the condition that D is a square modulo is quite vacuous: the only elements of Z/Z are 0 = 0 and 1 = 1, so every integer is congruent to a square modulo. Thus the above argument implies there are integers x and y such that = x + D y. But this is absurd: if y = 0 it tells us that is a square; whereas if y 1, x + D y D 3. In other words, is certainly not of the form x + D y. So what went wrong?!? 4. Fermat s Two Squares Theorem (and More!) Regained It is time to come clean. We have been equivocating over the definition of a prime element in an integral domain. Recall that we did not actually define such a thing. Rather, we defined an irreducible element in R to be a nonzero nonunit f such that f = xy implies x or y is a unit. Then in the integers we proved Euclid s Lemma: if an irreducible element f of Z divides ab, then either f divides a or f divides b. Of course this was not obvious: rather, it was all but equivalent to the fundamental theorem of arithmetic. Let us now review how this is the case. By definition, a domain R is a unique factorization domain if it satisfies two properties: first, that every nonzero nonunit factor into irreducible elements, and second that this factorization be unique, up to ordering of factors and associate elements. Suppose R is a UFD. We claim that if f is an irreducible element of R, and f ab, then f a or f b. We already proved this for R = Z and the general argument is the same: we leave to the reader the very important exercise of looking back at the argument for R = Z and adapting it to the context of R a UFD. We define a prime element in a domain R to be a nonzero nonunit p which satisfies the conclusion of Euclid s Lemma: if p ab, then p a or p b. Proposition. Let R be an integral domain. a) Any prime element is irreducible. 4 Taking p = should always raise alarm bells in your head: it is often said that is the oddest prime. In this case, please do look back the above argument to see that p = was not and did not need to be excluded from consideration.

5 QUADRATIC RINGS 5 b) R is a UFD if and only if it is a factorization domain in which every irreducible element is prime. Because this is pure algebra, we prefer to not discuss the proof here. It is a good exercise for the reader. See also pete/factorization.pdf for a careful treatment of the theory of factorization in integral domains. We can now recast the results of the previous two sections as follows. First, the proof which we gave assumed that either p is a prime element of Z[ D] or that p is not an irreducible element: i.e., it factors as p = αβ with α, β nonunit elements of Z[ D]. What was missing was the third possibility: p is an irreducible element of Z[ D] which is not prime. Because of Proposition, this third possibility cannot occur if Z[ D] is a UFD, so what we actually proved was: Theorem 3. Let D be a squarefree integer different from 0 and 1. We assume that the ring Z[ D] is a UFD. Then, for a prime number p, TFAE: (i) There exist x, y Z such that p = x Dy. (ii) There exists x Z such that D x (mod p). Moreover, simply by noticing that for D < we had that D is a square mod but is not of the form x Dy, we also deduce: Corollary 4. For no D < is the ring Z[ D] a UFD. To complete the proof of Theorem 1 it suffices to show that at least Z[ 1] is a UFD. Fortunately for us, it is. We show this in a way which is again a generalization of one of our proofs of the fundamental theorem of arithmetic: namely, by showing that we can perform, in a certain appropriate sense, division with remainder in Z[ 1]. The formalism for this is developed in the next section Euclidean norms. A norm N : R N is called Euclidean if it satisfies the following property: for all a R, b R\{0}, there exist q, r R such that a = qb+r and N(r) < N(b). First let us see that this suffices: we claim that any domain R endowed with a Euclidean norm function is a principal ideal domain. Indeed, let I be any nonzero ideal of such a domain R, and let a be any element of minimal nonzero norm. We claim that in fact I = (b) = {rb r R}. The proof is the same as for integers: suppose that a I and apply the Euclidean property: there exist q, r R such that a = qb + r with N(r) < N(b). But r = a qb and a, b I, so r I. If r 0 then N(r) 0 and we have found an element with nonzero norm smaller than N(a), contradiction. So we must have r = 0, i.e., a = qb (b). Side remark: Note that in our terminology a norm N : R N is multiplicative, and indeed in our present application we are working with such norms. However, the multiplicativity property was not used in the proof. If R is a domain, let us define a generalized Euclidean norm on R to be a function N : R N such that N(r) = 0 r = 0 and such that for all a R, b R \ {0}, there exist

6 6 PETE L. CLARK q, r R with a = qb + r and N(r) < N(b). Then what we have actually shown is that any domain which admits a generalized Euclidean norm is a PID PIDs and UFDs. One also knows that any PID is a UFD. This is true in general, but in the general case it is somewhat tricky to establish the existence of a factorization into irreducibles. In the presence of a multiplicative norm function N : R N i.e., a function such that N(x) = 0 x = 0, N(x) = 1 x R, N(xy) = N(x)N(y) x, y R this part of the argument becomes much easier to establish, since for any nontrivial factorization x = yz we have N(y), N(z) < N(x). Complete details are available in loc. cit Some Euclidean quadratic rings. Finally, we will show that our norm function on Z[ 1] is Euclidean. At this point it costs nothing extra, and indeed is rather enlightening, to consider the more general case of Z[ D] endowed with the norm function N(a + b D) = a Db. According to the characterization of (multiplicative) Euclidean norms in the previous subsection, what we must show is: for all α Q( D), there exists β Z[ D] with N(α β) < 1. A general element of α is of the form r + s D with r, s Q, and we are trying to approximate it by an element x + y D with x, y Z. Let us try something easy: take x (resp. y) to be an integer nearest to r (resp. s). If z is any real number, there exists an integer n with z n 1, and this bound is sharp, attained for all real numbers with fractional part 1.6 So let x, y Z be such that r x, s y 1. Is then β = x + y D a good enough approximation to α = r + s D? Consider the following quick and dirty estimate: (6) N(α β) = (r x) D(s y) r x + D s y D Evidently D +1 4 < 1 iff D < 3. So D = 1 works i.e., the norm N on Z[ 1] is Euclidean, so Z[ 1] is a UFD, which fills in the gap in our proof of Theorem 1. Also D = and D = work: the rings Z[ ] and Z[ ] are UFDs. It is natural to wonder whether the quick and dirty estimate can be improved. We have already seen that it cannot be for D <, since we already know that for such D, Z[ D] is not a UFD. This can be confirmed as follows: when D < 0, N(a + b D) = a + Dy = a + D i ; that is, our norm function is simply the square of the usual Euclidean length function evaluated on the complex number 5 In fact further generalization is possible: in order for this simple argument to go through it is not necessary for the codomain of the norm function to be the natural numbers, but only a well-ordered set! 6 Moreover when z n < 1, the nearest integer is unique, whereas for half-integral real numbers there are evidently two nearest integers. This does not matter to us: in this case take either nearest integer, i.e., either z 1 or z + 1.

7 QUADRATIC RINGS 7 a + D i. Moreover, in this case the ring Z[ D] lives naturally inside C as a lattice, whose fundamental parallelogram is simply a rectangle with sides 1 and D. The problem now is to find, for a given point z = a + bi C with a, b Q, the closest lattice point. But it is geometrically clear that the points which are furthest away from lattice points are precisely those which lie at the center of the 1 corresponding rectangles, e.g. + 1 D i. This shows that nothing was lost in our quick and dirty estimate. The situation D < 0 is quite different, most of all because the geometric picture is different: Z[ D] now lives inside R, but unlike in the previous case, it is not discrete. Rather, (Exercise X.X) it is dense: any interval (a, b) in R with a < b contains some point α Z[ D]. So it is not clear that the above coordinatewise nearest integer approximation is the best possible approximation. But even keeping the same approximating element β as above, we lose ground in the estimate ( 1 ) D( 1 ) = 1 4 D 4 D+1 4. Rather, we want 1 4 D 4 < 1, or D 1 < 4, so D = 3 also works. Thus, Z[ 3] has a Euclidean norm, hence is a UFD. In summary, we get the following bonus theorem : Theorem 5. a) A prime p is of the form x + y iff is a square modulo p. b) A prime p is of the form x y iff is a square modulo p. c) A prime p is of the ofrm x 3y iff 3 is a square modulo p. Of course this brings attention to the fact that for an integer D, we do not know how to characterize the set of primes p such that D is a square mod p, except in the (easiest) case D = 1. The desire to answer this question is an excellent motivation for the quadratic reciprocity law, coming up shortly. 5. Composites of the form x Dy Now that we have determined which primes are of the form x + y, it is natural to attempt to determine all nonzero integers which are sums of two squares. An honest approach to this problem would begin by accumulating data and considering various special cases. Here we must unfortunately be somewhat more succinct. Somewhat more generally, fix D a squarefree integer as before, and put S D = {n Z \ {0} x, y Z, n = x Dy }, the set of all nonzero integers of the form x Dy. Because of the multiplicativity of the norm function or more precisely, the function x + y D x Dy, which takes on negative values when D > 0 the subset S D is closed under multiplication. Remark: Certainly 1 S D : 1 = 1 D 0. Therefore the multiplicative property can be rephrased by saying that S D is a submonoid of the monoid (Z\{0}, ). Now we know that the following positive integers are all sums of two squares: 1,, and prime p 1 (mod 4), and n for any integer n: n = (n) + 0. Now let n be any positive integer, and write p 1,..., p r for the distinct prime divisors of n

8 8 PETE L. CLARK which are congruent to 1 modulo 4, and q 1,..., q s for the distinct prime divisors of n which are congruent to 1 modulo 4, so that n = a p m1 1 p mr r q n1 1 qns s, for a, m 1,..., m r, n 1,..., n s N. It follows that so long as n 1,..., n s are all even, n is a product of sums of two squares and therefore itself a sum of two squares. Finally, we wish to show that we have found all positive integers which are a sum of two squares. 7 Specifically, what we wish to show is that if n Z + is a sum of two squares, then for any prime number p 1 (mod 4), then ord p (n) is even. For this it suffices to show the following Lemma 6. Let p 1 (mod 4) be a prime number, and suppose that there exist x, y Z such that p x + y, then p x and p y. Before proving Lemma 6 let us show how it helps us. Indeed, suppose that a positive integer n is a sum of two squares: n = x +y. Let p be any prime congruent to 1 (mod 4), and assume that p n (otherwise ord p (n) = 0, which is even). Then by Lemma 6 p x and p y, so that n p = ( x p ) + ( y p ) expresses n p as a sum of two integral squares. But now we can repeat this process of repeated division by p until we get an integer n which is not divisible by p. Thus ord p k p (n) = k is even. Proof of Lemma 6: It follows from the proof of the Two Squares Theorem that if p 1 (mod 4) is a prime number, then it remains irreducible in Z[ 1]. Let us recall why: otherwise p = αβ with N(α), N(β) > 1, and then taking norms gives p = N(p) = N(αβ) = N(α)N(β), and thus N(α) = N(β) = p. Writing α = a + b 1, we get p = N(α) = a + b, so p is a sum of two squares, contrary to Fermat s Lemma. Since Z[ 1] is a UFD, the irreducible element p is a prime element, hence Euclid s Lemma applies. We have p x + y = (x + y 1)(x y 1), so that p x + y 1 or p x y 1. This implies that x p, y p Z, i.e., p x and p y. In summary, we have shown: Theorem 7. (Full Two Squares Theorem) A positive integer n is a sum of two squares iff ord p (n) is even for all primes p 1 (mod 4). In that Lemma 6 uses (only) that Z[ 1] is a UFD, similar reasoning applies to other Euclidean quadratic rings Z[ D]. In particular, there is a direct analogue of Theorem 7 for x + y, which we will postpone until we determine for which primes p is a square modulo p. When D is positive, the distinction between αα = a Db and N(α) = a Db becomes important: for instance as above we obviously have 1 S D, but whether 1 S D is a surprisingly difficult problem: to this day there is not a completely satisfactory solution. In contrast, if Z[ D] is not a UFD, then even if we know which primes are of the form x Dy, we cannot use the above considerations to determine the set S D. For example take D = 5. Certainly x + 5y and 3 x + 5y, but 3 = Why would we think this? Again, trial and error experimentation is the honest answer.

Solving Diophantine Equations With Unique Factorization February 17, 2016 1 Introduction In this note we should how unique factorization in rings like Z[i] and Z[ 2] can be used to find integer solutions

INTRODUCTION TO SEMIGROUPS AND MONOIDS PETE L. CLARK We give here some basic definitions and very basic results concerning semigroups and monoids. Aside from the mathematical maturity necessary to follow

Fermat s Last Theorem for Regular Primes S. M.-C. 22 September 2015 Abstract Fermat famously claimed in the margin of a book that a certain family of Diophantine equations have no solutions in integers.

Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under

I will try to organize the work of this semester around several classical questions. The first is, When is a prime p the sum of two squares? The question was raised by Fermat who gave the correct answer

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

5. Types of domains It turns out that in number theory the fact that certain rings have unique factorisation has very strong arithmetic consequences. We first write down some definitions. Definition 5.1.

The group (Z/nZ) February 17, 2016 1 Introduction In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer. If we factor n = p e 1 1 pe, where the p i s are distinct

Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18. PIDs Definition 1 A principal ideal domain (PID) is an integral

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

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

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

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

BEGINNING ALGEBRAIC NUMBER THEORY Fermat s Last Theorem is one of the most famous problems in mathematics. Its origin can be traced back to the work of the Greek mathematician Diophantus (third century

THE UNIT GROUP OF A REAL QUADRATIC FIELD While the unit group of an imaginary quadratic field is very simple the unit group of a real quadratic field has nontrivial structure Its study involves some geometry

Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

COMMUTATIVE ALGEBRA 35 7.2. The Picard group of a ring. Definition. A line bundle over a ring A is a finitely generated projective A-module such that the rank function Spec A N is constant with value 1.

3.4. ZEROS OF POLYNOMIAL FUNCTIONS What You Should Learn Use the Fundamental Theorem of Algebra to determine the number of zeros of polynomial functions. Find rational zeros of polynomial functions. Find

Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

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

Introduction to Abstract Mathematics Notation: Z + or Z >0 denotes the set {1, 2, 3,...} of positive integers, Z 0 is the set {0, 1, 2,...} of nonnegative integers, Z is the set {..., 1, 0, 1, 2,...} of

VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,

8 Modular Arithmetic We introduce an operator mod. Let d be a positive integer. For c a nonnegative integer, the value c mod d is the remainder when c is divided by d. For example, c mod d = 0 if and only

Part IX ( 45-47) Factorization Satya Mandal University of Kansas, Lawrence KS 66045 USA January 22 45 Unique Factorization Domain (UFD) Abstract We prove evey PID is an UFD. We also prove if D is a UFD,

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime

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

The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

DIRICHLET L-FUNCTIONS AND DEDEKIND ζ-functions FRIMPONG A. BAIDOO Abstract. We begin by introducing Dirichlet L-functions which we use to prove Dirichlet s theorem on arithmetic progressions. From there,

Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary

3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;

CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to

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

Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor

CYCLICITY OF (Z/(p)) KEITH CONRAD 1. Introduction For each prime p, the group (Z/(p)) is cyclic. We will give seven proofs of this fundamental result. A common feature of the proofs that (Z/(p)) is cyclic

CHAPTER 3: THE INTEGERS Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction The natural numbers are designed for measuring the size of finite sets, but what if you want to compare the sizes of two sets?

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

. FINITE-DIMENSIONAL VECTOR SPACES.. Fields By now you ll have acquired a fair knowledge of matrices. These are a concrete embodiment of something rather more abstract. Sometimes it is easier to use matrices,

MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly

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

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

6 Lecture 6: More constructions with Huber rings 6.1 Introduction Recall from Definition 5.2.4 that a Huber ring is a commutative topological ring A equipped with an open subring A 0, such that the subspace

Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements

Ideals: Definitions & Examples Defn: An ideal I of a commutative ring R is a subset of R such that for a, b I and r R we have a + b, a b, ra I Examples: All ideals of Z have form nz = (n) = {..., n, 0,

Polynomial Rings and Group Rings for Abelian Groups E. L. Lady (June 16, 2009) A lifetime or so ago, when I was teaching at the University of Kansas, Jim Brewer and I wrote a paper on group rings for finite

Number Theory in Problem Solving Konrad Pilch April 7, 2016 1 Divisibility Number Theory concerns itself mostly with the study of the natural numbers (N) and the integers (Z). As a consequence, it deals

FACULTY FEATURE ARTICLE 6 The Congruent Number Problem Abstract Keith Conrad University of Connecticut Storrs, CT 06269 kconrad@math.uconn.edu We discuss a famous problem about right triangles with rational

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number

Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over

EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all