# Part IX. Factorization

Size: px
Start display at page:

Transcription

1 IX.45. Unique Factorization Domains 1 Part IX. Factorization Section IX.45. Unique Factorization Domains Note. In this section we return to integral domains and concern ourselves with factoring (with respect to the multiplication binary operation). We define irreducible and prime. Many of the results are motivated by the behavior of integral domain Z,+,. We show that every PID is a UFD (!) and give a proof of the Fundamental Theorem of Arithmetic in Z. Note. Recall that an integral domain is a commutative ring (that is, in R, +,, multiplication is commutative) with unity 1 0 and containing no divisors of 0 (so a b = 0 implies that either a = 0 or b = 0). Z,+, is an example of an integral domain. Definition Let R be a commutative ring with unity and let a,b R. If there exists c R such that b = a, then a divides b (or equivalently, a is a factor of b), denoted a b. If for given a and b, no such c exists then we say a does not divide b, denoted a b. Definition An element u of a commutative ring with unity is a unit if u divides 1; that is, if u has a multiplicative inverse in the ring. Two elements a and b in a ring are associates if a = bu where u is a unit in the ring.

2 IX.45. Unique Factorization Domains 2 Example In ring Z,+,, the only units are 1 and 1. Distinct a,b Z are associates if and only if a = b. Definition A nonzero element p that is not a unit in an integral domain D is an irreducible of D if in every factorization p = ab in D implies that either a or b is a unit. Note. If p and q are associates in an integral domain then p is irreducible if an only if q is irreducible. Note. As with the Fundamental Theorem of Arithmetic in N, we are interested in uniquely factoring elements of an integral domain into irreducibles. Since N is not a ring (it has no additive inverses), we need to extend the Fundamental Theorem of Arithmetic to Z. However, uniqueness is affected by the existence of negative primes (which are, of course, associates of positive primes in Z). This idea is the inspiration for the next definition.

3 IX.45. Unique Factorization Domains 3 Definition An integral domain D is a unique factorization domain (or UFD ) is the following hold: 1. Every element of D that is neither 0 nor a unit can be factored into a product of a finite number of irreducibles. 2. If p 1,p 2,...,p r and q 1,q 2,...,q r are two factorizations of the same element of D into irreducibles, then r = s and the q j can be renumbered so that p i and g i are associates for each i. Note. We have met the idea of unique factorization in Section 23. Recall: Theorem If F is a field, then every nonconstant polynomial in F[x] can be factored in F[x] into a product of irreducible polynomials being unique except for order and for unit (that is, nonzero constant) factors in F. In the words used here, if F is a field then F[x] is a UFD. Note. Recall that an additive subgroup N of a ring R which satisfies an N and Nb N for all a,b R is an ideal. (If N is an ideal of ring R, then we can make the factor ring or quotient ring R/N.) An ideal N of ring R is a principal ideal if for some a R we have N = {ra r R} = a. Definition An integral domain D is a principal ideal domain (or PID ) if every ideal in D is a principal ideal.

4 IX.45. Unique Factorization Domains 4 Note. In integral domain D = Z, every ideal is of the form nz (see Corollary 6.7 and Example 26.11) and since nz = n = n, then every ideal is a principal ideal. So Z is a PID. Note. Theorem says that if F is a field then every ideal of F[x] is principal. So for every field F, the integral domain F[x] is a PID. Note. The goal of this section is to prove two results (the first of which is poetically brief): 1. Theorem Every PID is a UFD. 2. Theorem If D is a UFD, then D[x] is a UFD. We need a few more definitions before completing the lengthy proofs. Definition If {A i i I} is a collection of sets, then the union of the sets, denoted i I A i, is the set of all x such that x A i for some i I. Lemma Let R be a commutative ring and let N 1 N 2 be an ascending chain of ideals N i in R. Then N = sup i N i is an ideal of R.

5 IX.45. Unique Factorization Domains 5 Lemma The Ascending Chain Condition for a PID. Let D be a PID. If N 1 N 2 is an ascending chain of ideals, then there exists a positive integer r such that N r = N s for all s r. Equivalently, every strictly ascending chain of ideals in a PID is of finite length. Under such conditions it is said that the ascending chain condition holds for ideals in a PID. Note 1. In the following proofs we will use the facts that: (1) a b if and only if b a. proof. If a b then a b and then a = bd for some d D. Then b a. If b a then a = bd for some d D and then a b, or a b. (2) a = b if and only if a and b are associates. proof. We have a = b if and only if a b and b a by (1). This is the case if and only if a = bc and b = ad for some c,d D, or a = bc = (ad)c and then dc = 1. So d and c are units and a and b are associates (and conversely). Note. The following gives us the first condition in the definition of UFD for a PID. Theorem Let D be a PID. Every element that is neither 0 nor a unit of D is a product of irreducibles.

6 IX.45. Unique Factorization Domains 6 Note. To prove that every PID is a UFD, we now need to show that every PID satisfies the second condition in the definition of a UFD. That is, we need to show that the product of irreducibles of Theorem is unique (in the sense explained in the definition of UFD). Note. Let R be a ring. Recall that an ideal M of R, where M R, is a maximal ideal of R if there is no proper ideal N of R properly containing M. Recall that Theorem says that ideal p(x) {0} or ring F[x] (where F is a field) is maximal if and only if p(x) is irreducible over F. (This result was an important part of the proof of Kronecker s Theorem [Theorem 29.3].) The following result is analogous to Theorem but is in the setting of PIDs. Lemma An ideal p is a PID is maximal if and only if p is irreducible. Note. Recall that Theorem says that for irreducible p(x) F[x] (F a field), if p(x) divides r(x)s(x) for r(x),s(x) F[x] then either p(x) divides r(x) or s(x). The following result is analogous to Theorem but is in the setting of PIDs. Recall that an ideal N R is a commutative ring R is a prime ideal if ab N implies that either a N or b N for a,b R. Lemma In a PID, if an irreducible p divides ab then either p a or p b.

7 IX.45. Unique Factorization Domains 7 Corollary If p is an irreducible in a PID and p divides the product a 1 a 2 a n for a i D, then p a i for at least on i. Proof. This follows by induction from Lemma Definition A nonzero nonunit element p of an integral domain D is a prime if, for all a,b D, p ab implies either p a or p b. Note. In Exercises 25 and 26, it is shown that a prime in an integral domain is irreducible and that in a UFD an irreducible is a prime. Since a UFD is a type of integral comain, then prime and irreducible are the same in a UFD. The next example shows that in some integral domains there are irreducibles that are not primes. Example Let F be a field and let D be the subdomain F[x 3,xy,y 3 ] of F[x,y]. (That is, x 3,xy,y 3,x,y are indeterminates [not something involving free groups, though the notation is similar].) Then x 3,xy,y 3 are irreducibles in D ( clearly ), but (x 3 ) = (y 3 ) = (xy)(xy)(xy). So xy divides x 3 y 3 but xy divides neither x 3 nor y 3. So xy is not prime. (Elements x 3 and y 3 are also irreducible and not prime.) Theorem Every PID is a UFD.

8 IX.45. Unique Factorization Domains 8 Note. A natural question to ask now is: Is every UFD a PID (that is, are UFDs and PIDs equivalent)? We will see in Example a UFD which is not a PID. Corollary Fundamental Theorem of Arithmetic. The integral domain Z is a UFD. Proof. We know that Z is a PID (see the note after Definition 45.7). So by Theorem 45.17, Z is a UFD. Note. We normally think of the Fundamental Theorem of Arithmetic as stating that every natural number can be uniquely written as a product of primes. The units in Z are 1 and 1 and the irreducibles in Z are the positive primes and the negative primes. So the only associate of a prime is its negative. Since Z is a UFD, every element can be expressed as a product of irreducibles (i.e., positive and negative primes) uniquely in the sense of Property 2 of the definition of UFD (that is, different products of irreducibles involve pairwise associates). So if a = p 1 p 2 p p r in Z and a N, then there must be an even number of negative p i s and we can replace these with corresponding positive associates to produce a unique factorization of a into a product of positive primes in N. So Corollary implies the traditional Fundamental Theorem of Arithmetic in N. Note. We now show that if D is a UFD then D[x] is a UFD. This requires some new definitions and several preliminary results.

9 IX.45. Unique Factorization Domains 9 Definition Let D be a UFD and let a 1,a 2,...,a n be nonzero elements in D. An element d D is a greatest common divisor (or gcd ) of all the a i if d a i for i = 1,2,...,n and any other d D that divides all the a i also divides d. Note. If both d and d are gcd s of the a i then d d and d d. Thus d = q d and d = qd for some q,q D. Then d = q d = q qd and by cancellation in D (by Theorem 19.5) 1 = q q and q and q are units and d and d are associates. So gcd s are not unique in a UFD, but different gcd s must be associates. In Z, this means that different gcd s differ by a multiple of 1. Example Consider 420, 168, and 252 in D. We know 420 = , 168 = and 252 = To find a gcd, we algorithmically choose the highest power of each irreducible common to to each number: = 84. So a gcd is 84. Another is 84 (notice that 1 is not an irreducible since it is a unit). Definition Let D be a UFD. A noncontant polynomial f(x) = a 0 + a 1 x + a 2 x a n x n in D[x] is primitive if 1 is a gcd of the a i for i = 0,1,...,n. Example In Z[x], 4x 2 + 3x + 2 is primitive but 4x 2 + 6x + 2 is not. Notice that a nonconstant irreducible in D[x] must be a primitive polynomial.

10 IX.45. Unique Factorization Domains 10 Lemma If D is a UFD then for every nonconstant f(x) D[x] we have f(x) = cg(x) where c D, g(x) D[x] and g(x) is a primitive. The element c is unique up to a unit factor in D and is the content of f(x). Also g(x) is unique up to a unit factor in D. Lemma Gauss s Lemma. If D is a UFD, then a product of two primitive polynomials in D[x] is again primitive. Corollary If D is a UFD, then a finite product of primitive polynomials in D[x] is again primitive. Proof. This follows by induction from Lemma Note. In the following result, D is a UFD and F is field of quotients of D (see Section 21). By Theorem 23.20, F[x] is also a UFD. In our last major result of this section (Theorem 45.29) we ll show that D[x] is a UFD. In the proof, we will relate factorization of polynomials in F[x] to factorization in D[x]. Lemma Let D be a UFD and let F be a field of quotients of D. Let f(x) D[x] where (degree f(x)) > 0. If f(x) is an irreducible in D[x], then f(x) is also an irreducible in F[x]. Also, if f(x) is primitive in D[x] and irreducible in F[x], then f(x) is irreducible in D[x].

11 IX.45. Unique Factorization Domains 11 Corollary If D is a UFD and F is a field of quotients of D, then a nonconstant f(x) D[x] factors into a product of two polynomials of lower degrees r and s in F[x] if and only if it has a factorization into polynomials of the same degrees r and s in D[x]. Theorem If D is a UFD, then D[x] is a UFD. Corollary If F is a field and x 1,x 2,...,x n are indeterminates, then F[x 1,x 2,...,x n ] is a UFD. Example Now for an example of a UFD which is not a PID. Let F be a field and let x and y be indeterminates. Then F[x,y] is a UFD by Corollary Consider the set N of all polynomials in x and y in F[x,y] having constant term 0. Then N is an ideal (since an N and Nb N for all a,b F). A principal ideal is of the form N = {ar r F } = a and so includes 0. So our N cannot be a principal ideal. Thus F[x,y] is not a PID. Note. Since Z is a UFD by the Fundamental Theorem of Arithmetic (Corollary 45.18), by Theorem Z[x] is a UFD. In Exercise it is shown that Z[x] is not a PID. Revised: 3/17/2014

### Factorization 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. PIDs Definition 1 A principal ideal domain (PID) is an integral

### Part IX ( 45-47) Factorization

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,

### Factorization in Domains

Last Time Chain Conditions and s Uniqueness of s The Division Algorithm Revisited in Domains Ryan C. Trinity University Modern Algebra II Last Time Chain Conditions and s Uniqueness of s The Division Algorithm

### 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)

### Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going

### Math 547, Exam 2 Information.

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

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

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

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

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

### Section III.6. Factorization in Polynomial Rings

III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)

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

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

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

### Discrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:

Discrete valuation rings Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: 1. v is surjective. 2. v(ab) = v(a) + v(b). 3. v(a + b) min(v(a), v(b)) if a + b 0. Proposition:

### Contents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains

Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and

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

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

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

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

### However another possibility is

19. Special Domains Let R be an integral domain. Recall that an element a 0, of R is said to be prime, if the corresponding principal ideal p is prime and a is not a unit. Definition 19.1. Let a and b

### 1. Factorization Divisibility in Z.

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

### 1. Group Theory Permutations.

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

### (Rgs) Rings Math 683L (Summer 2003)

(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that

### 32 Divisibility Theory in Integral Domains

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

### a + bi by sending α = a + bi to a 2 + b 2. To see properties (1) and (2), it helps to think of complex numbers in polar coordinates:

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.

### 2. THE EUCLIDEAN ALGORITHM More ring essentials

2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there

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

### A few exercises. 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in

A few exercises 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in F 2 [x]. solution. Since f(x) is a primitive polynomial in Z[x], by Gauss lemma it is enough

### Example: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)

Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative

### ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS. In this handout we wish to describe some aspects of the theory of factorization.

ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS PETE L. CLARK In this handout we wish to describe some aspects of the theory of factorization. The first goal is to state what it means for an arbitrary

### Factorization in Polynomial Rings

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

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

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

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

### Ideals: Definitions & Examples

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,

### CHAPTER 10: POLYNOMIALS (DRAFT)

CHAPTER 10: POLYNOMIALS (DRAFT) LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN The material in this chapter is fairly informal. Unlike earlier chapters, no attempt is made to rigorously

### Prime Rational Functions and Integral Polynomials. Jesse Larone, Bachelor of Science. Mathematics and Statistics

Prime Rational Functions and Integral Polynomials Jesse Larone, Bachelor of Science Mathematics and Statistics Submitted in partial fulfillment of the requirements for the degree of Master of Science Faculty

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

### 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,

### CHAPTER 14. Ideals and Factor Rings

CHAPTER 14 Ideals and Factor Rings Ideals Definition (Ideal). A subring A of a ring R is called a (two-sided) ideal of R if for every r 2 R and every a 2 A, ra 2 A and ar 2 A. Note. (1) A absorbs elements

### Computations/Applications

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

### Abstract Algebra: Chapters 16 and 17

Study polynomials, their factorization, and the construction of fields. Chapter 16 Polynomial Rings Notation Let R be a commutative ring. The ring of polynomials over R in the indeterminate x is the set

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

### Section 19 Integral domains

Section 19 Integral domains Instructor: Yifan Yang Spring 2007 Observation and motivation There are rings in which ab = 0 implies a = 0 or b = 0 For examples, Z, Q, R, C, and Z[x] are all such rings There

### Chapter 9, Additional topics for integral domains

Chapter 9, Additional topics for integral domains Many times we have mentioned that theorems we proved could be done much more generally they only required some special property like unique factorization,

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

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

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

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

### Solutions to Homework 1. All rings are commutative with identity!

Solutions to Homework 1. All rings are commutative with identity! (1) [4pts] Let R be a finite ring. Show that R = NZD(R). Proof. Let a NZD(R) and t a : R R the map defined by t a (r) = ar for all r R.

### Recall, R is an integral domain provided: R is a commutative ring If ab = 0 in R, then either a = 0 or b = 0.

Recall, R is an integral domain provided: R is a commutative ring If ab = 0 in R, then either a = 0 or b = 0. Examples: Z Q, R Polynomials over Z, Q, R, C The Gaussian Integers: Z[i] := {a + bi : a, b

### 36 Rings of fractions

36 Rings of fractions Recall. If R is a PID then R is a UFD. In particular Z is a UFD if F is a field then F[x] is a UFD. Goal. If R is a UFD then so is R[x]. Idea of proof. 1) Find an embedding R F where

### 8 Appendix: Polynomial Rings

8 Appendix: Polynomial Rings Throughout we suppose, unless otherwise specified, that R is a commutative ring. 8.1 (Largely) a reminder about polynomials A polynomial in the indeterminate X with coefficients

### Rings. Chapter Homomorphisms and ideals

Chapter 2 Rings This chapter should be at least in part a review of stuff you ve seen before. Roughly it is covered in Rotman chapter 3 and sections 6.1 and 6.2. You should *know* well all the material

### Modern Algebra Lecture Notes: Rings and fields set 6, revision 2

Modern Algebra Lecture Notes: Rings and fields set 6, revision 2 Kevin Broughan University of Waikato, Hamilton, New Zealand May 20, 2010 Solving quadratic equations: traditional The procedure Work in

### 12 16 = (12)(16) = 0.

Homework Assignment 5 Homework 5. Due day: 11/6/06 (5A) Do each of the following. (i) Compute the multiplication: (12)(16) in Z 24. (ii) Determine the set of units in Z 5. Can we extend our conclusion

### Lecture 7.4: Divisibility and factorization

Lecture 7.4: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)

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

Algebra Qualifying Exam August 2001 Do all 5 problems. 1. Let G be afinite group of order 504 = 23 32 7. a. Show that G cannot be isomorphic to a subgroup of the alternating group Alt 7. (5 points) b.

### Introduction Non-uniqueness of factorization in A[x]... 66

Abstract In this work, we study the factorization in A[x], where A is an Artinian local principal ideal ring (briefly SPIR), whose maximal ideal, (t), has nilpotency h: this is not a Unique Factorization

### Commutative Algebra and Algebraic Geometry. Robert Friedman

Commutative Algebra and Algebraic Geometry Robert Friedman August 1, 2006 2 Disclaimer: These are rough notes for a course on commutative algebra and algebraic geometry. I would appreciate all suggestions

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

### Rings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.

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

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

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

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

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

### Chapter 14: Divisibility and factorization

Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter

### CSIR - Algebra Problems

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

### 8. Prime Factorization and Primary Decompositions

70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings

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

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

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

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

### Rings. EE 387, Notes 7, Handout #10

Rings EE 387, Notes 7, Handout #10 Definition: A ring is a set R with binary operations, + and, that satisfy the following axioms: 1. (R, +) is a commutative group (five axioms) 2. Associative law for

### AP-DOMAINS AND UNIQUE FACTORIZATION

AP-DOMAINS AND UNIQUE FACTORIZATION JIM COYKENDALL AND MUHAMMAD ZAFRULLAH Abstract. In this paper we generalize the standard notion of unique factorization domains (UFDs) to the the nonatomic situation.

### Polynomials over UFD s

Polynomials over UFD s Let R be a UFD and let K be the field of fractions of R. Our goal is to compare arithmetic in the rings R[x] and K[x]. We introduce the following notion. Definition 1. A non-constant

### NOTES ON LINEAR ALGEBRA OVER INTEGRAL DOMAINS. Contents. 1. Introduction 1 2. Rank and basis 1 3. The set of linear maps 4. 1.

NOTES ON LINEAR ALGEBRA OVER INTEGRAL DOMAINS Contents 1. Introduction 1 2. Rank and basis 1 3. The set of linear maps 4 1. Introduction These notes establish some basic results about linear algebra over

### Section VI.33. Finite Fields

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,

### SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.

### Quizzes for Math 401

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

### MATH 326: RINGS AND MODULES STEFAN GILLE

MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called

### Polynomial Rings. i=0

Polynomial Rings 4-15-2018 If R is a ring, the ring of polynomials in x with coefficients in R is denoted R[x]. It consists of all formal sums a i x i. Here a i = 0 for all but finitely many values of

### A Generalization of Wilson s Theorem

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

### Exploring the Exotic Setting for Algebraic Geometry

Exploring the Exotic Setting for Algebraic Geometry Victor I. Piercey University of Arizona Integration Workshop Project August 6-10, 2010 1 Introduction In this project, we will describe the basic topology

### Handout - Algebra Review

Algebraic Geometry Instructor: Mohamed Omar Handout - Algebra Review Sept 9 Math 176 Today will be a thorough review of the algebra prerequisites we will need throughout this course. Get through as much

### Total 100

Math 542 Midterm Exam, Spring 2016 Prof: Paul Terwilliger Your Name (please print) SOLUTIONS NO CALCULATORS/ELECTRONIC DEVICES ALLOWED. MAKE SURE YOUR CELL PHONE IS OFF. Problem Value 1 10 2 10 3 10 4

### Math 611 Homework 6. Paul Hacking. November 19, All rings are assumed to be commutative with 1.

Math 611 Homework 6 Paul Hacking November 19, 2015 All rings are assumed to be commutative with 1. (1) Let R be a integral domain. We say an element 0 a R is irreducible if a is not a unit and there does

### Characterizing integral domains by semigroups of ideals

Characterizing integral domains by semigroups of ideals Stefania Gabelli Notes for an advanced course in Ideal Theory a. a. 2009-2010 1 Contents 1 Star operations 4 1.1 The v-operation and the t-operation..............

### MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is

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

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

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

### Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018

Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018 Do 6 problems with at least 2 in each section. Group theory problems: (1) Suppose G is a group. The

### Selected Math 553 Homework Solutions

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

### Math Introduction to Modern Algebra

Math 343 - Introduction to Modern Algebra Notes Field Theory Basics Let R be a ring. M is called a maximal ideal of R if M is a proper ideal of R and there is no proper ideal of R that properly contains

### A COURSE ON INTEGRAL DOMAINS

A COURSE ON INTEGRAL DOMAINS ALGEBRA II - SPRING 2004 Updated - March 3, 2004 1. The Fundamental Theorem of Arithmetic My son who is in the 4 th grade is learning about prime numbers and cancelling prime

### Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter

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

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

### Math 4320 Final Exam

Math 4320 Final Exam 2:00pm 4:30pm, Friday 18th May 2012 Symmetry, as wide or as narrow as you may define its meaning, is one idea by which man through the ages has tried to comprehend and create order,

### (1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d

The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers

### A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:

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

### ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ.

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ANDREW SALCH 1. Hilbert s Nullstellensatz. The last lecture left off with the claim that, if J k[x 1,..., x n ] is an ideal, then

### Rings and Fields Theorems

Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)

### Polynomial Rings : Linear Algebra Notes

Polynomial Rings : Linear Algebra Notes Satya Mandal September 27, 2005 1 Section 1: Basics Definition 1.1 A nonempty set R is said to be a ring if the following are satisfied: 1. R has two binary operations,

### (3) Let Y be a totally bounded subset of a metric space X. Then the closure Y of Y

() Consider A = { q Q : q 2 2} as a subset of the metric space (Q, d), where d(x, y) = x y. Then A is A) closed but not open in Q B) open but not closed in Q C) neither open nor closed in Q D) both open