Quotient Rings. is defined. Addition of cosets is defined by adding coset representatives:

Similar documents
Commutative Rings and Fields

Example 2: Let R be any commutative ring with 1, fix a R, and let. I = ar = {ar : r R},

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.

Math 547, Exam 1 Information.

Polynomial Rings. i=0

2a 2 4ac), provided there is an element r in our

RINGS: SUMMARY OF MATERIAL

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.

Some practice problems for midterm 2

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

Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2

Ideals, congruence modulo ideal, factor rings

Homework problems from Chapters IV-VI: answers and solutions

φ(a + b) = φ(a) + φ(b) φ(a b) = φ(a) φ(b),

Foundations of Cryptography

Algebraic structures I

Total 100

Math Introduction to Modern Algebra

Mathematics for Cryptography

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

AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS

CHAPTER 14. Ideals and Factor Rings

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

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

MATH 115, SUMMER 2012 LECTURE 12

Divisibility = 16, = 9, = 2, = 5. (Negative!)

NOTES ON FINITE FIELDS

(Rgs) Rings Math 683L (Summer 2003)

Name: Solutions Final Exam

Outline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials

FACTORIZATION OF IDEALS

Math 120 HW 9 Solutions

Examples of Groups

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

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

Modern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

Abstract Algebra II. Randall R. Holmes Auburn University. Copyright c 2008 by Randall R. Holmes Last revision: November 7, 2017

ABSTRACT ALGEBRA 1, LECTURE NOTES 5: HOMOMORPHISMS, ISOMORPHISMS, SUBGROUPS, QUOTIENT ( FACTOR ) GROUPS. ANDREW SALCH

Abstract Algebra II. Randall R. Holmes Auburn University

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

ax b mod m. has a solution if and only if d b. In this case, there is one solution, call it x 0, to the equation and there are d solutions x m d

1. Group Theory Permutations.

1. multiplication is commutative and associative;

MATH 403 MIDTERM ANSWERS WINTER 2007

MODEL ANSWERS TO HWK #10

Math 345 Sp 07 Day 7. b. Prove that the image of a homomorphism is a subring.

Factorization in Polynomial Rings

HOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS

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

Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.

Rings and Fields Theorems

1 First Theme: Sums of Squares

Rings. EE 387, Notes 7, Handout #10

Section 4.1: Polynomial Functions and Models

Lecture 7 Cyclic groups and subgroups

Introduction to Information Security

DIHEDRAL GROUPS II KEITH CONRAD

Basic elements of number theory

Basic elements of number theory

1. Introduction to commutative rings and fields

ALGEBRA AND NUMBER THEORY II: Solutions 3 (Michaelmas term 2008)

Johns Hopkins University, Department of Mathematics Abstract Algebra - Spring 2013 Midterm Exam Solution

1. Introduction to commutative rings and fields

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

0 Sets and Induction. Sets

Mahler s Polynomials and the Roots of Unity

MATH 361: NUMBER THEORY FOURTH LECTURE

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

I216e Discrete Math (for Review)

Chapter 4 Mathematics of Cryptography

Homework 9 Solutions to Selected Problems

Note that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.

Eighth Homework Solutions

A Generalization of Wilson s Theorem

Chapter 14: Divisibility and factorization

Algebraic Structures Exam File Fall 2013 Exam #1

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

Inverses and Elementary Matrices

Ring Theory MAT Winter Alistair Savage. Department of Mathematics and Statistics. University of Ottawa

Quasi-cyclic codes. Jay A. Wood. Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico October 12, 2012

COMPUTER ARITHMETIC. 13/05/2010 cryptography - math background pp. 1 / 162

Lecture 7.4: Divisibility and factorization

Moreover this binary operation satisfies the following properties

EXAMPLES CLASS 2 MORE COSETS, FIRST INTRODUCTION TO FACTOR GROUPS

Polynomial Division. You may also see this kind of problem written like this: Perform the division x2 +2x 3

Lecture 3. Theorem 1: D 6

Homework 10 M 373K by Mark Lindberg (mal4549)

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.

Section 18 Rings and fields

MT5836 Galois Theory MRQ

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

a = qb + r The coefficients of the polynomials should be elements of a field.

Factorization in Polynomial Rings

MATH 113 FINAL EXAM December 14, 2012

Many of the groups with which we are familiar are arithmetical in nature, and they tend to share key structures that combine more than one operation.

PRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31

ELG 5372 Error Control Coding. Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35

Transcription:

Quotient Rings 4-21-2018 Let R be a ring, and let I be a (two-sided) ideal. Considering just the operation of addition, R is a group and I is a subgroup. In fact, since R is an abelian group under addition, I is a normal subgroup, and the quotient group R I is defined. Addition of cosets is defined by adding coset representatives: (a+i)+(b+i) = (a+b)+i. The zero coset is 0+I = I, and the additive inverse of a coset is given by (a+i) = ( a)+i. However, R also comes with a multiplication, and it s natural to ask whether you can turn R I into a ring by multiplying coset representatives: (a+i) (b+i) = ab+i. I need to check that that this operation is well-defined, and that the ring axioms are satisfied. In fact, everything works, and you ll see in the proof that it depends on the fact that I is an ideal. Specifically, it depends on the fact that I is closed under multiplication by elements of R. By the way, I ll sometimes write R and sometimes R/I ; they mean the same thing. I Theorem. If I is a two-sided ideal in a ring R, then R/I has the structure of a ring under coset addition and multiplication. Proof. Suppose that I is a two-sided ideal in R. Let r,s I. Coset addition is well-defined, because R is an abelian group and I a normal subgroup under addition. I proved that coset addition was well-defined when I constructed quotient groups. I need to show that coset multiplication is well-defined: (r +I)(s+I) = rs+i. As before, suppose that Then r +I = r +I, so r = r +a, a I s+i = s +I, so s = s +b, b I (r +I)(s+I) = rs+i = (r +a)(s +b)+i = r s +r b+as +ab+i = r s +I = (r +I)(s +I). The next-to-last equality is derived as follows: r b + as + ab I, because I is an ideal; hence r b + as +ab+i = I. Note that this uses the multiplication axiom for an ideal; in a sense, it explains why the multiplication axiom requires that an ideal be closed under multiplication by ring elements on the left and right. Thus, coset multiplication is well-defined. Verification of the ring axioms is easy but tedious: It reduces to the axioms for R. For instance, suppose I want to verify associativity of multiplication. Take r,s,t R. Then ((r +I)(s+I))(t+I) = (rs+i)(t+i) = (rs)t+i = r(st)+i = (r+i)(st+i) = (r+i)((s+i)(t+i)). (Notice how I used associativity of multiplication in R in the middle of the proof.) The proofs of the other axioms are similar. Definition. If R is a ring and I is a two-sided ideal, the quotient ring of R mod I is the group of cosets R with the operations of coset addition and coset multiplication. I 1

Proposition. Let R be a ring, and let I be an ideal (a) If R is a commutative ring, so is R/I. (b) If R has a multiplicative identity 1, then 1+I is a multiplicative identity for R/I. In this case, if r R is a unit, then so is r +I, and (r +I) 1 = r 1 +I. Proof. (a) Let r +I,s+I R/I. Since R is commutative, Therefore, R/I is commutative. (r +I)(s+I) = rs+i = sr +I = (s+i)(r +I). (b) Suppose R has a multiplicative identity 1. Let r R. Then (r +I)(1+I) = r 1+I = r +I and (1+I)(r +I) = 1 r +I = r +I. Therefore, 1+I is the identity of R/I. If r R is a unit, then (r 1 +I)(r +I) = r 1 r +I = 1+I and (r +I)(r 1 +I) = rr 1 +I = 1+I. Therefore, (r +I) 1 = r 1 +I. Example. (A quotient ring of the integers) The set of even integers 2 = 2Z is an ideal in Z. Form the quotient ring Z 2Z. Construct the addition and multiplication tables for the quotient ring. Here are some cosets: 2+2Z, 15+2Z, 841+2Z. But two cosets a+2z and b+2z are the same exactly when a and b differ by an even integer. Every even integer differs from 0 by an even integer. Every odd integer differs from 1 by an even integer. So there are really only two cosets (up to renaming): 0+2Z = 2Z and 1+2Z. Here are the addition and multiplication tables: + 0+2Z 1+2Z 0+2Z 0+2Z 1+2Z 1+2Z 1+2Z 0+2Z 0+2Z 1+2Z 0+2Z 0+2Z 0+2Z 1+2Z 0+2Z 1+2Z You can see that Z 2Z is isomorphic to Z 2. Z In general, nz is isomorphic to Z n. I ve been using Z n informally to mean the set {0,1,...,n 1} with addition and multiplication mod n, and taking for granted that the usual ring axioms hold. This example gives a formal contruction of Z n as the quotient ring Z nz. Example. is the ring of polynomials with coefficients in Z 3. Consider the ideal 2x 2 +x+2. (a) How many elements are in the quotient ring 2x 2 +x+2? 2

(b) Reduce the following product in (c) Find [x+2+ 2x 2 +x+2 ] 1 in 2x 2 +x+2. 2x 2 +x+2 to the form (ax+b)+ 2x2 +x+2 : (2x+1+ 2x 2 +x+2 ) (x+1+ 2x 2 +x+2 ). The ring 2x 2 +x+2 is analogous to Z n = Z n. In the case of Z n, you do computations mod n: To simplify, you divide the result of a computation by the modulus n and take the remainder. In 2x 2 +x+2, the polynomial 2x2 +x+2 acts like the modulus. To do computations in 2x 2 +x+2, you divide the result of a computation by 2x 2 +x+2 and take the remainder. (a) By the Division Algorithm, any f(x) can be written as f(x) = (2x 2 +x+2)q(x)+r(x), where degr(x) < deg(2x 2 +x+2). This means that r(x) = ax+b, where a,b Z 3. Then f(x)+ 2x 2 +x+2 = [(2x 2 +x+2)q(x)+r(x)]+ 2x 2 +x+2 = (ax+b)+ 2x 2 +x+2. Since there are 3 choices for a and 3 choices for b, there are 9 cosets. (b) First, multiply the coset representatives: Dividing 2x 2 +1 by 2x 2 +x+2, I get Then (2x+1)(x+1) = 2x 2 +1. 2x 2 +1 = (2x 2 +x+2)(1)+(2x+2). 2x 2 +1+ 2x 2 +x+2 = [(2x 2 +x+2)(1)+(2x+2)]+ 2x 2 +x+2 = 2x+2+ 2x 2 +x+2. (c) To find multiplicative inverses in Z n, you use the Extended Euclidean Algorithm. The same idea works in quotient rings of polynomial rings. 2x 2 +x+2-2x x+2 2x 1 2 2x+1 0 Thus, (1)(2x 2 +x+2) (2x)(x+2) = 2 (1)(2x 2 +x+2)+(x)(x+2) = 2 (2)(2x 2 +x+2)+(2x)(x+2) = 1 (2)(2x 2 +x+2)+(2x)(x+2)+ 2x 2 +x+2 = 1+ 2x 2 +x+2 (2x)(x+2)+ 2x 2 +x+2 = 1+ 2x 2 +x+2 [x+2+ 2x 2 +x+2 ] 1 = 2x+ 2x 2 +x+2. 3

Example. (a) List the elements of the cosets of (2,2) in the ring Z 4 Z 6. (b) Is the quotient ring Z 4 Z 6 (2,2) an integral domain? (a) If x is an element of a ring R, the ideal x consists of all multiples of x by elements of R. It is not necessarily the same as the additive subgroup generated by x, which is {..., 3x, 2x, x,0,x,2x,3x,...}. In this example, the additive subgroup generated by (2, 2) is {(0,0),(2,2),(0,4),(2,0),(0,2),(2,4)}. As usual, I get it by starting with the zero element (0,0) and the generator (2,2), then adding (2,2) until I get back to (0,0). This set is contained in the ideal (2,2) ; I need to check whether it is the same as the ideal. If (a,b) Z 4 Z 6, then (a,b) (2,2) = (2a,2b). Thus, an element of the ideal (2,2) consists of a pair (2a,2b), where each component is even. There are two even elements in Z 4 (namely 0 and 2) and 3 even elements in Z 6 (namely 0, 2, and 4), so there are 2 3 = 6 such pairs. Thus, the ideal (2,2) has a maximum of 6 elements. Since the additive subgroup above already has 6 elements, it must be the same as the ideal. I can list the elements of the cosets of the ideal as I would for subgroups. (2,2) = {(0,0),(2,2),(0,4),(2,0),(0,2),(2,4)} (0,1)+ (2,2) = {(0,1),(2,3),(0,5),(2,1),(0,3),(2,5)} (1,0)+ (2,2) = {(1,0),(3,2),(1,4),(3,0),(1,2),(3,4)} (1,1)+ (2,2) = {(1,1),(3,3),(1,5),(3,1),(1,3),(3,5)} (b) Note that Hence, Z 4 Z 6 (2,2) [(0,1)+ (2,2) ][(1,0)+ (2,2) ] = (2,2). is not an integral domain. Example. In the ring Z 2 Z 10, consider the principal ideal (1,5). (a) List the elements of (1,5). (b) List the elements of the cosets of (1,5). (c) Is the quotient ring Z 2 Z 10 (1,5) a field? (a) Note that the additive subgroup generated by (1,5) has only two elements. It s not the same as the ideal generated by (1,5), so I can t find the elements of the ideal by taking additive multiples of (1,5). I ll find the elements of the ideal (1,5) by multiplying (1,5) by the elements of Z 2 Z 10, then throwing out duplicates. The computation is routine, if a bit tedious. element (0, 0) (0, 1) (0, 2) (0, 3) (0, 4) (1,5) (0,0) (0,5) (0,0) (0,5) (0,0) 4

element (0, 5) (0, 6) (0, 7) (0, 8) (0, 9) (1,5) (0,5) (0,0) (0,5) (0,0) (0,5) element (1, 0) (1, 1) (1, 2) (1, 3) (1, 4) (1,5) (1,0) (1,5) (1,0) (1,5) (1,0) element (1, 5) (1, 6) (1, 7) (1, 8) (1, 9) (1,5) (1,5) (1,0) (1,5) (1,0) (1,5) Removing duplicates, I have (1,5) = {(0,0),(0,5),(1,0),(1,5)}. (b) Since the ideal has 4 elements and the ring has 20, there must be 5 cosets. (1,5) = {(0,0),(0,5),(1,0),(1,5)} (0,1)+ (1,5) = {(0,1),(0,6),(1,1),(1,6)} (0,2)+ (1,5) = {(0,2),(0,7),(1,2),(1,7)} (0,3)+ (1,5) = {(0,3),(0,8),(1,3),(1,8)} (0,4)+ (1,5) = {(0,4),(0,9),(1,4),(1,9)} (c) Note that (0,1)+ (1,5) is the identity. [(0,2)+ (1,5) ][(0,3)+ (1,5) ] = (0,1)+ (1,5). [(0,4)+ (1,5) ][(0,4)+ (1,5) ] = (0,1)+ (1,5). Since every nonzero coset has a multiplicative inverse, the quotient ring is a field. c 2018 by Bruce Ikenaga 5