# Section III.6. Factorization in Polynomial Rings

Size: px
Start display at page:

Transcription

1 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) from rings to rings of polynomials. This is a vital step towards our ultimate goal of finding zeros of a polynomial. Definition. Let R be a ring and R[x 1,x 2,...,x n ] be a ring of polynomials in n indeterminates. The degree of a nonzero monomial ax k 1 1 xk 2 2 xk n n R[x 1,x 2,...,x n ] is the nonnegative integer k 1 + k k n. If f is a nonzero polynomial in R[x 1,x 2,...,x n ] then by Theorem III.5.4(v) f = m i=0 a i x k i1 1 xk i2 2 x k in n R[x 1,x 2,...,x n ] and the (total) degree of polynomial f is the maximum of the degrees of the monomials a i x k i1 1 xk i2 2 x k in n that a i 0, denoted deg(f). A polynomial which is a sum of monomials each of degree k is homogeneous of degree k. The degree of f in x k is the degree of f considered as a polynomial in one indeterminate x k over R[x 1,x 2,...,x k 1,x k+1,...,x k ]. Note. The degree of f in x k is simply the highest power of x k in f. For example, 3x 2 1 x2 2 x x 1x 4 3 6x3 2 x 3 Z[x] has degree 2 in x 1, degree 3 in x 2, and degree 4 in x 3. The total degree is 6. Note. By convention we define the degree of the zero polynomial to be.

2 III.6. Factorization in Polynomial Rings 2 Theorem III.6.1. Let R be a ring and f,g R[x 1,x 2,...,x n ]. (i) deg(f + g) max{deg(f), deg(g)}. (ii) deg(fg) deg(f) + deg(g). (iii) If R has no zero divisors then deg(f g) = deg(f) + deg(g). (iv) If n = 1 and the leading coefficient of f or g is not a zero divisor in R (in particular, if it is a unit) then deg(f g) = deg(f) + deg(g). Note. The proof of Theorem III.6.1 is based on consideration of the highest power of x in fg when f and g are represented in the standard way. In fact, the result holds where deg(f) is replaced with degree of f in x k. Theorem III.6.2. The Division Algorithm. Let R be a ring with identity and f,g R[x] nonzero polynomials such that the leading coefficient of g is a unit in R. Then there exist unique polynomials q,r R[x] such that f = qg + r and deg(r) < deg(g). Corollary III.6.3. Remainder Theorem. Let R be a ring with identity and f(x) = n i=0 a ix i R[x]. For any c R there exists a unique q(x) R[x] such that f(x) = q(x)(x c) + f(c).

3 III.6. Factorization in Polynomial Rings 3 Corollary III.6.4. If F is a field, then the polynomial ring F[x] is a Euclidean domain, whence F[x] is a principal ideal domain and a unique factorization domain. The units in F[x] are precisely the nonzero constant polynomials. Note. We now turn our attention to roots of polynomials and linear factors. Definition III.6.5. Let R be a subring of a commutative ring S, c 1,c 2,...,c n S and f = m i=0 a i x k i1 1 xk i2 2 x k in n R[x 1,x 2,...,x n ] a polynomial such that f(c 1,c 2,...,c n ) = 0. Then (c 1,c 2,...,c n ) is a root or zero of f (or a solution of the polynomial equation f(x 1,x 2,...,x n ) = 0). Note. The following result relates zeros of a polynomial to linear factors of the polynomial. This result is usually called the Factor Theorem (see Corollary 23.3 in Fraleigh). Theorem III.6.6. Factor Theorem. Let R be a commutative ring with identity and f R[x]. Then c R is a root of f if and only if x c divides f. Note. The following result is an important step on the road to proving the Fundamental Theorem of Algebra (see the appendix to Section V.5).

4 III.6. Factorization in Polynomial Rings 4 Theorem III.6.7. If D is an integral domain contained in an integral domain E and f D[x] has degree n, then f has at most n distinct roots in E. Note. Commutitivity is necessary in Theorem III.6.7 (it was required when Theorem III.6.6 was used in the proof). This can also be shown explicitly by considering the polynomial x over the (noncommutative) division ring of the real quaternions (see page 117 of Section III.1 in Hungerford, or page 5 of the class notes for Section III.1). Polynomial x has an infinite number of roots here, including ±i, ±j, and ±k. In fact, the roots are {x 1 i + x 2 j + x 3 k x x2 2 + x2 3 = 1}. Note. When looking for roots of a polynomial, the following result gives some candidates to consider for root-hood. Proposition III.6.8. Let D be a unique factorization domain with quotient field F (that is, F is the field of quotients produced from D) and let f = n i=0 a ix i D[x]. If u = c/d F with c and d relatively prime (so u is in reduced form ), and u is a root of f, then c divides a 0 and d divides a n. Example. We use Hungerford s example to illustrate the use of Proposition III.6.8 to search for rational roots of a polynomial in Q[x]. See page 215 of Fraleigh (7th Edition) for a similar application (Corollary and Example 23.14). Consider f = x 4 2x 3 7x 2 (11/3)x 4/3 Q[x]. Then f has exactly the same roots as 3f = 3x 4 6x 3 21x 2 11x 4 Z[x]. By Proposition III.6.8, a rational

5 III.6. Factorization in Polynomial Rings 5 root of 3f must have a numerator dividing 4 and a denominator dividing 3. So the candidate rational roots are ±1, ±2, ±4, ±1/3, ±2/3, and ±4/3. We find that only 4 is actually a root. Notice that we can then factor 3f into q(x)(x 4) by the Factor Theorem (Theorem III.6.6) and we know that the third degree polynomial q(x) has no zeros in Q and hence is irreducible in Q[x]. Note. Let D be an integral domain and f D[x]. If c D and c is a root of f then repeated application of the Factor Theorem (Theorem III.6.6) and Theorem III.6.7 (even though we are not considering distinct roots here) we see that there is a greatest nonnegative integer m (where 0 m deg(f)) such that f(x) = (x c) m g(x) for some g(x) D[x] where (x c) g(x) (or equivalently by the Factor Theorem, g(c) 0). Definition. For integral domain D and f D[x], the nonnegative integer m described in the previous note is the multiplicity of the root c of f. If m = 1 then c is a simple root. If m > 1 then c is a multiple root. Note. In order to explore multiple roots we introduce the formal derivative of a polynomial. You might recall that for analytic function f(x) = i=0 a nx i (say f : C C) then x = c is a zero of multiplicity m if f(c) = f (c) = f (c) = = f (m) (c) = 0 and f (m+1) (c) 0. See Corollary IV.3.9 of my Complex Analysis 1 (MATH 5510) notes:

6 III.6. Factorization in Polynomial Rings 6 Definition. Let D be an integral domain and f = n i=0 a ix i D[x]. Then define the formal derivative of f as n i=1 ia ix i 1 and denote it as f. Note. Since this is an algebra course, we have no concept of distance (or metric or even topology ) so we will not deal with limits. None-the-less, we can symbolically define f. The following result is familiar, but it must be established algebraically here! Lemma III.6.9. Let D be an integral domain f,g D[x]. Then the formal derivatives f and g satisfy: (i) (cf) = cf for all c D; (ii) (f + g) = f + g ; (iii) (fg) = f g + fg ; (iv) (g n ) = ng n 1 g for all n N. Note. Definition III.3.3 defined an irreducible element of a commutative ring with identity. When applied to a nonzero polynomial f R[x], where R is commutative with identity, this gives that f is irreducible means that f is not a unit and for f = gh we have that either g or h is a unit in R[x] (and so either g or h is a constant polynomial where the constant is a unit in R).

7 III.6. Factorization in Polynomial Rings 7 Theorem III Let D be an integral domain which is a subring of an integral domain E. Let f D[x] and c E. (i) c is a multiple root of f if and only if f(c) = 0 and f (c) = 0. (ii) If D is a field and f is relatively prime to f, then f has no multiple roots in E. (iii) If D is a field, f is irreducible in D[x] and E contains a root of f, then f has no multiple roots in E if and only if f 0 (here, f 0 means that f is not the zero polynomial in D[x]). Note. We close this section by considering the irreducible elements of D[x] where D is an integral domain. The rest of the lemmas and theorems of this section concern the case where D is a UFD. Some easily established results are: (i) The units in D[x] are precisely the constant polynomials that are units in D (as shown in Corollary III.6.4 for D a field). (ii) If c D and c is irreducible in D then the constant polynomial c is irreducible in D[x] (this follows from Theorem III.6.1 and part (i)). (iii) Every first degree polynomial whose leading coefficient is a unit in D is irreducible in D[x]. In particular, every first degree polynomial over a field is irreducible. (iv) Suppose D is a subring of an integral domain E and f D[x] E[x]. Then f may be irreducible in E[x] but not in D[x] and vice versa (see the following example).

8 III.6. Factorization in Polynomial Rings 8 Example. 2x + 2 = 2(x + 1) is irreducible in Q[x] = E[x] by (iii) above. However 2x + 2 = 2(x + 1) is reducible in Z[x] = D[x] since neither 2 nor x + 1 is a unit in Z (from (i) above). So f = 2x + 2 is irreducible in E[x] but not in D[x] where D[x] E[x], illustrating (iv) above. Next, x is irreducible in R[x] = D[x] (by the Factor Theorem) but is reducible in C[x] = E[x] as (x +i)(x i) (notice by (i) above that neither x + i nor x i is a unit in C[x]). So x is irreducible in D[x] but not in E[x], illustrating (iv) above (the vice versa part). Definition. Let D be a UFD and f = m i=0 a ix i a nonzero polynomial in D[x]. A greatest common divisor of a 0,a 1,...,a n (which exists by Theorem III.3.11(iii)) is a content of f. Note. Since greatest common divisors are not unique, a given nonzero f D[x] can have multiple contents. But any two contents of f are necessarily associates and any associates of a content of f is also a content of f (see the comment on page 140 after Definition III.3.10, and page 6 of these class notes for Section III.3). We write b c if b and c are associates. Then is an equivalence relation on D and since D is an integral domain then b c if and only if b = cu for some unit u D (by Theorem III.3.2(vi)). Definition. Denote the equivalence class of the contents of f D[x] where D is a UFD as C(f). If C(f) is a unit in D (i.e., C(f) consists of units in D) then f is primitive.

9 III.6. Factorization in Polynomial Rings 9 Note. Any polynomial g D[x] can be written as g = C(g)g 1 where g 1 is primitive. Lemma III (Gauss) If D is a unique factorization domain and f, g D[x], then C(f g) = C(f)C(g). In particular, the product of primitive polynomials is primitive. Lemma III Let D be a unique factorization domain with quotient field F and let f and g be primitive polynomials in D[x]. Then f and g are associates in D[x] if and only if they are associates in F[x]. Lemma III Let D be a unique factorization domain with quotient field F and f a primitive polynomial of positive degree in D[x]. Then f is irreducible in D[x] if and only if f is irreducible in F[x]. Note. The following result shows that unique factorization extends from D to the ring of polynomials D[x]. Theorem III If D is a unique factorization domain, then so is the polynomial ring D[x 1,x 2,...,x n ].

10 III.6. Factorization in Polynomial Rings 10 Theorem III (Eisenstein s Criterion) Let D be a unique factorization domain with quotient field F. If f = n i=0 a ix i D[x], deg(f) 1 and p is an irreducible element of D such that p a n ; p a i for i = 0,1,...,n 1; p 2 a 0, then f is irreducible in F[x]. If f is primitive, then f is irreducible in D[x]. Example. If f = 2x 5 6x 4 + 9x 3 15 Z[x], then with p = 3 we have a 5 = 2 0 (mod 3), a 4 a 3 a 2 a 1 a 0 0 (mod 3), and a 0 = 15 0 (mod 9). So by the Eisenstein Criterion, f is irreducible in Q[x]. Revised: 3/25/2018

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

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

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

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

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

### 1. Algebra 1.5. Polynomial Rings

1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are

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

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

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

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

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

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

### COMMUTATIVE RINGS. Definition 3: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

COMMUTATIVE RINGS Definition 1: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative

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

### Further linear algebra. Chapter II. Polynomials.

Further linear algebra. Chapter II. Polynomials. Andrei Yafaev 1 Definitions. In this chapter we consider a field k. Recall that examples of felds include Q, R, C, F p where p is prime. A polynomial is

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

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

### Part IX. Factorization

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

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

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

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

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

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

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

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

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

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,

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

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

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

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

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

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

### Lecture 7.5: Euclidean domains and algebraic integers

Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley

### Notes 6: Polynomials in One Variable

Notes 6: Polynomials in One Variable Definition. Let f(x) = b 0 x n + b x n + + b n be a polynomial of degree n, so b 0 0. The leading term of f is LT (f) = b 0 x n. We begin by analyzing the long division

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

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 31, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Symbolic Adjunction of Roots When dealing with subfields of C it is easy to

### Polynomials. Chapter 4

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

### IRREDUCIBILITY TESTS IN Q[T ]

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

### How might we evaluate this? Suppose that, by some good luck, we knew that. x 2 5. x 2 dx 5

8.4 1 8.4 Partial Fractions Consider the following integral. 13 2x (1) x 2 x 2 dx How might we evaluate this? Suppose that, by some good luck, we knew that 13 2x (2) x 2 x 2 = 3 x 2 5 x + 1 We could then

### Section II.1. Free Abelian Groups

II.1. Free Abelian Groups 1 Section II.1. Free Abelian Groups Note. This section and the next, are independent of the rest of this chapter. The primary use of the results of this chapter is in the proof

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.

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

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

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

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

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

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

### CYCLOTOMIC POLYNOMIALS

CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where

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

### VII.5. The Weierstrass Factorization Theorem

VII.5. The Weierstrass Factorization Theorem 1 VII.5. The Weierstrass Factorization Theorem Note. Conway motivates this section with the following question: Given a sequence {a k } in G which has no limit

### Lecture 6.3: Polynomials and irreducibility

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

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

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

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

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

### School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information

MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon

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

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

### Groebner Bases and Applications

Groebner Bases and Applications Robert Hines December 16, 2014 1 Groebner Bases In this section we define Groebner Bases and discuss some of their basic properties, following the exposition in chapter

### Section V.6. Separability

V.6. Separability 1 Section V.6. Separability Note. Recall that in Definition V.3.10, an extension field F is a separable extension of K if every element of F is algebraic over K and every root of the

### MATH 361: NUMBER THEORY TENTH LECTURE

MATH 361: NUMBER THEORY TENTH LECTURE The subject of this lecture is finite fields. 1. Root Fields Let k be any field, and let f(x) k[x] be irreducible and have positive degree. We want to construct a

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

### Linear Algebra, 3rd day, Wednesday 6/30/04 REU Info:

Linear Algebra, 3rd day, Wednesday 6/30/04 REU 2004. Info: http://people.cs.uchicago.edu/laci/reu04. Instructor: Laszlo Babai Scribe: Richard Cudney Rank Let V be a vector space. Denition 3.. Let S V,

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

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

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

### ATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL NUMBERS. Ryan Gipson and Hamid Kulosman

International Electronic Journal of Algebra Volume 22 (2017) 133-146 DOI: 10.24330/ieja.325939 ATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL

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

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

### 15. Polynomial rings Definition-Lemma Let R be a ring and let x be an indeterminate.

15. Polynomial rings Definition-Lemma 15.1. Let R be a ring and let x be an indeterminate. The polynomial ring R[x] is defined to be the set of all formal sums a n x n + a n 1 x n +... a 1 x + a 0 = a

### CYCLOTOMIC POLYNOMIALS

CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where

### Euclidean Domains. Kevin James

Suppose that R is an integral domain. Any function N : R N {0} with N(0) = 0 is a norm. If N(a) > 0, a R \ {0 R }, then N is called a positive norm. Suppose that R is an integral domain. Any function N

### Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.

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

### Algebra. Pang-Cheng, Wu. January 22, 2016

Algebra Pang-Cheng, Wu January 22, 2016 Abstract For preparing competitions, one should focus on some techniques and important theorems. This time, I want to talk about a method for solving inequality

### Lecture 7: Polynomial rings

Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules

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

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

### POLYNOMIALS. x + 1 x x 4 + x 3. x x 3 x 2. x x 2 + x. x + 1 x 1

POLYNOMIALS A polynomial in x is an expression of the form p(x) = a 0 + a 1 x + a x +. + a n x n Where a 0, a 1, a. a n are real numbers and n is a non-negative integer and a n 0. A polynomial having only

### Solutions of exercise sheet 11

D-MATH Algebra I HS 14 Prof Emmanuel Kowalski Solutions of exercise sheet 11 The content of the marked exercises (*) should be known for the exam 1 For the following values of α C, find the minimal polynomial

### MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6

MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS PETE L. CLARK Contents 1. Polynomial Functions 1 2. Rational Functions 6 1. Polynomial Functions Using the basic operations of addition, subtraction,

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

### Math 120 HW 9 Solutions

Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z

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

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

### Math 201C Homework. Edward Burkard. g 1 (u) v + f 2(u) g 2 (u) v2 + + f n(u) a 2,k u k v a 1,k u k v + k=0. k=0 d

Math 201C Homework Edward Burkard 5.1. Field Extensions. 5. Fields and Galois Theory Exercise 5.1.7. If v is algebraic over K(u) for some u F and v is transcendental over K, then u is algebraic over K(v).

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

### Polynomials, Ideals, and Gröbner Bases

Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields

### Chapter 4. Remember: F will always stand for a field.

Chapter 4 Remember: F will always stand for a field. 4.1 10. Take f(x) = x F [x]. Could there be a polynomial g(x) F [x] such that f(x)g(x) = 1 F? Could f(x) be a unit? 19. Compare with Problem #21(c).

### Polynomial and Rational Functions. Chapter 3

Polynomial and Rational Functions Chapter 3 Quadratic Functions and Models Section 3.1 Quadratic Functions Quadratic function: Function of the form f(x) = ax 2 + bx + c (a, b and c real numbers, a 0) -30

### Lecture 2: Gröbner Basis and SAGBI Basis

Lecture 2: Gröbner Basis and SAGBI Basis Mohammed Tessema Suppose we have a graph. Suppose we color the graph s vertices with 3 colors so that if the vertices are adjacent they are not the same colors.

### 38 Irreducibility criteria in rings of polynomials

38 Irreducibility criteria in rings of polynomials 38.1 Theorem. Let p(x), q(x) R[x] be polynomials such that p(x) = a 0 + a 1 x +... + a n x n, q(x) = b 0 + b 1 x +... + b m x m and a n, b m 0. If b m

### Rings. Chapter Definitions and Examples

Chapter 5 Rings Nothing proves more clearly that the mind seeks truth, and nothing reflects more glory upon it, than the delight it takes, sometimes in spite of itself, in the driest and thorniest researches

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

### AN INTRODUCTION TO GALOIS THEORY

AN INTRODUCTION TO GALOIS THEORY STEVEN DALE CUTKOSKY In these notes we consider the problem of constructing the roots of a polynomial. Suppose that F is a subfield of the complex numbers, and f(x) is

### Math 581: Skeleton Notes

Math 581: Skeleton Notes Bart Snapp June 7, 2010 Chapter 1 Rings Definition 1 A ring is a set R with two operations: + called addition and called multiplication such that: (i) (R,+) is an abelian group

### 1/30: Polynomials over Z/n.

1/30: Polynomials over Z/n. Last time to establish the existence of primitive roots we rely on the following key lemma: Lemma 6.1. Let s > 0 be an integer with s p 1, then we have #{α Z/pZ α s = 1} = s.

### Chapter Five Notes N P U2C5

Chapter Five Notes N P UC5 Name Period Section 5.: Linear and Quadratic Functions with Modeling In every math class you have had since algebra you have worked with equations. Most of those equations have

### MT5836 Galois Theory MRQ

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

### A connection between number theory and linear algebra

A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.

### COURSE SUMMARY FOR MATH 504, FALL QUARTER : MODERN ALGEBRA

COURSE SUMMARY FOR MATH 504, FALL QUARTER 2017-8: MODERN ALGEBRA JAROD ALPER Week 1, Sept 27, 29: Introduction to Groups Lecture 1: Introduction to groups. Defined a group and discussed basic properties