Subrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING

Similar documents
Math 547, Exam 1 Information.

Rings and Fields Theorems

MATH 433 Applied Algebra Lecture 22: Semigroups. Rings.

CHAPTER 14. Ideals and Factor Rings

Written Homework # 4 Solution

Rings and groups. Ya. Sysak

GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION

Section 19 Integral domains

Math Introduction to Modern Algebra

Homework 1/Solutions. Graded Exercises

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

Lecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG)

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.

Eighth Homework Solutions

MODEL ANSWERS TO THE FIRST HOMEWORK

Algebra Homework, Edition 2 9 September 2010

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems

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

Ring Theory Problem Set 2 Solutions

EP elements and Strongly Regular Rings

Solutions to Assignment 3

Algebraic structures I

ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS

(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

1 2 3 style total. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

MODEL ANSWERS TO HWK #7. 1. Suppose that F is a field and that a and b are in F. Suppose that. Thus a = 0. It follows that F is an integral domain.

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

Part 1. For any A-module, let M[x] denote the set of all polynomials in x with coefficients in M, that is to say expressions of the form

Chapter 5. Modular arithmetic. 5.1 The modular ring

MATH 326: RINGS AND MODULES STEFAN GILLE

MA 252 notes: Commutative algebra

Exercises on chapter 1

Homework 3/ Solutions

Section 18 Rings and fields

Chapter 1. Sets and Numbers

Algebraic Structures Exam File Fall 2013 Exam #1

MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions

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

) = 1, ) = 2, and o( [ 11]

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part III: Ring Theory

Dedekind, Prüfer and Skolem Rings

MATH 403 MIDTERM ANSWERS WINTER 2007

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

INTRODUCTION TO THE GROUP THEORY

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

On R-Strong Jordan Ideals

* 8 Groups, with Appendix containing Rings and Fields.

Chapter 1. Sets and Mappings

CHAPTEER - TWO SUBGROUPS. ( Z, + ) is subgroup of ( R, + ). 1) Find all subgroups of the group ( Z 8, + 8 ).

Rings, Modules, and Linear Algebra. Sean Sather-Wagstaff

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

Rings, Integral Domains, and Fields

J-Noetherian Bezout domain which is not a ring of stable range 1

TEST CODE: PMB SYLLABUS

ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.

Kevin James. MTHSC 412 Section 3.1 Definition and Examples of Rings

EXERCISES. a b = a + b l aq b = ab - (a + b) + 2. a b = a + b + 1 n0i) = oii + ii + fi. A. Examples of Rings. C. Ring of 2 x 2 Matrices

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

DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY

Group, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S,

B Sc MATHEMATICS ABSTRACT ALGEBRA

A Little Beyond: Linear Algebra

(Rgs) Rings Math 683L (Summer 2003)

a b (mod m) : m b a with a,b,c,d real and ad bc 0 forms a group, again under the composition as operation.

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

BENJAMIN LEVINE. 2. Principal Ideal Domains We will first investigate the properties of principal ideal domains and unique factorization domains.

January 2016 Qualifying Examination

0 Sets and Induction. Sets

Course of algebra. Introduction and Problems

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

1. Group Theory Permutations.

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

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson

1 Commutative Rings with Identity

LATTICE AND BOOLEAN ALGEBRA

CSIR - Algebra Problems

THE REAL NUMBERS Chapter #4

Foundations of Cryptography

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

Block Introduction. Some self study examples and proof of the theorems are left to the readers to check their progress.

GROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache

Groups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group

Classical Rings. Josh Carr. Honors Thesis. Appalachian State University

11. Finitely-generated modules

Tensor Product of modules. MA499 Project II

Example. Addition, subtraction, and multiplication in Z are binary operations; division in Z is not ( Z).

Solutions to the August 2008 Qualifying Examination

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.

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

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9

Math 4400, Spring 08, Sample problems Final Exam.

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

Rings. Chapter Homomorphisms and ideals


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

Tripotents: a class of strongly clean elements in rings

RINGS: SUMMARY OF MATERIAL

Transcription:

Subrings and Ideals Chapter 2 2.1 INTRODUCTION In this chapter, we discuss, subrings, sub fields. Ideals and quotient ring. We begin our study by defining a subring. If (R, +, ) is a ring and S is a non-empty subset of R, then + and, may induce binary operations + and respectively on S. If S is a ring with respect to these induced operations, then we call S, a subring of R. 2.2 SUBRING Definition 2.1 Let (R, +, ) be a ring and let S be a non-empty subset of R. If (S, +, ) is a ring, then S is called a subring of R. Every non-zero ring R has two trivial subrings, viz. the ring itself and the zero ring consisting of the zero element of the ring R. {0} and R are called the improper subrings of R. If S is a subring of R, then (i) S is a subgroup of additive group R. i.e., (S, +) is a subgroup of (R, +). (ii) S is closed with respect to multiplication. éa 0ù Example 1: The set S of all 2 2 matrices of the type b c where a, b, c are ë û integers is subring of the ring M 2 of all 2 matrices over Z. Example 2: The set of integers Z is a subring of the ring of real numbers. Theorem 2.1: A non-empty subset S of a ring R is a subring of R if and only if a - b Î S and ab Î S for all a, b Î S Proof: Let S be a subring of R and let a, b Î S. Then S is a subgroup of R under addition. Hence, b Î S Þ - b Î S and, a Î S, b Î S Þ a Î S, - b Î S Þ a + (- b) Î S Þ a - b + S

Subrings and Ideals 41 Hence, S is a subring of R. Example 2: Show that S = {0, 3} is a subring of (z 6, + 6, x 6 ) under the operations + 6 and x 6. Solution: We construct the composition tables as follows: + 6 0 3 6 0 3 0 0 3 0 0 0 3 3 0 3 0 3 From the above composition tables a Î S, b Î S Þ a + 6 (- b) = a - b Î S a 6 b Î S " a, b Î S Hence, S is a subring of R. Example 3: Let m be any fixed integer and let S be any subset of Z, the set of integers, such that S = {..., - 3m, - 2m, - m, 0, m, 2m, 3m,...} show that S is a subring of (z, +, ) Solution: Let rm, s m Î S, then r, s Î Z now rm - sm = (r - s)m Î Z (Q r - s Î Z " r, s Î Z) and, (rm) (sm) = (rsm) m Î Z (Q r s m Î Z " r, s, m Î Z) \ S is a subring of (Z, +, ) Theorem 2.2: The necessary and sufficient conditions for a non-empty subset S of a ring R to be a subring of R are: (i) S + (- S) = S and (ii) SS Í S Solution: Let S be a subring of R Then (S, +) is a subgroup of (R, +) let a + (- b) Î S + (- S), then a + (- b) Î S + (- S) Þ a Î S, - b Î - S Þ a Î S, b Î S Þ a - b Î S Þ a + (- b) Î S Thus, S + (- S) Í S (1) 0 Î S Þ 0 Î - S Now a Î S, 0 Î - S Þ a + 0 Î ST (- S) Hence, S Í S + (- S) (2)

42 Linear Algebra From (1) and (2), we have S + (- S) = S Again, S is a subring of R Þ S is closed under multiplication. Thus, a Î S, b Î S Þ a b Î S but ab Î SS Now ab Î SS Þ a Î S, b Î S Þ ab Î S Þ SS Í S Hence, proved. Conversely, let S + (- S) = S and SS Í S " a, b Î S, we have ab Î SS Þ ab Î S (Q SS Í S) Again S + (- S) = S Þ S + (- S) Í S we have a + (- b) Î S + ( S) Í S Thus, Þ a + (- b) Î S " a, b Î S Þ a - b Î S " a, b Î S Thus, a - b Î S, ab Î S " a, b Î S Hence, S is a subring of R. Theorem 2.3: The intersection of two subrings of a ring R is a subring of R. Proof: Let S 1 and S 2 be two subrings of a ring R. 0 Î S 1, 0 Î S 2, therefore, 0 Î S 1 Ç S 2 Thus, S 1 Ç S 2 ¹ f Now let a, b Î S 1 Ç S 2, then a Î S 1 Ç S 2 Þ a Î S 1, a Î S 2 b Î S 1 Ç S 2 Þ b Î S 1, b Î S 2 But S 1, S 2 are subrings of R, therefore, a Î S, b Î S 1 Þ a - b Î S 1, ab Î S 1 and, a Î S 2, b Î S 2 Þ a - b Î S 2, ab Î S 2 a - b Î S 1, a - b Î S 2 Þ a - b Î S 1 Ç S 2 ab Î S 1, ab Î S 2 Þ ab Î S 1 Ç S 2 Consequently, a - b Î S 1 Ç S 2, ab Î S 1 Ç S 2 " a, b Î S 1 Ç S 2 Hence, S 1 Ç S 2 is a subring of R. Theorem 2.4: Let R be a ring and S 1, S 2 be two subrings. Then S 1 È S 2 is a subring of R if and only if S 1 Í S 2 or S 2 Í 1.

44 Linear Algebra 3. Prove that the z of integers is a subring of R, the set real numbers under addition and multiplication. 4. Show that the set of n n matrices over the rational numbers is a subring of n n matrices over the real numbers under addition and multiplication matrices. 5. Show that ({0, 2, 4}, + 6, 6) is a subring of (Z 6, + 6, 6) where, Z 6 = {0, 1, 2, 3, 4, 5}. 6. R is an integral domain. Show that the set S = {mx : x Î R, m is a fixed integer} is a subring of R. 7. If R is a ring, then show that the set N(a) = {x Î R; ax = xa} is a subring of R. 2.3 IDEALS 2.3.1 Left Ideal Definition 2.2: A non-empty subset U of a ring R is called a left ideal if (i) a Î U, b Î U Þ a - b Î U (ii) a Î U, r Î R Þ r a Î U Example: In the ring M of 2 2 matrices over integers consider the set U ìéa 0 ù ü = í : a, bî Z ý b 0 ïîë û ïþ Let Also é0 0ù 0 0 ë û Î U Þ U ¹ f éa 0ù A = b 0 ë û, B = éc 0ù d 0 Î U, then ë û A - B = P = éa - c ëb - d 0ù 0 û Î U éa bùéa 0ù Þ PA = g d b 0 ë ûë û éa bù g d ë û Î M, A = éa 0ù b 0 ë û Î U

Subrings and Ideals 45 éaa + bb = ëg a + db This shows that U is a left ideal of M 0ù 0 û Î U 2.3.2 Right Ideal Definition 2.3: A non-empty set U of a ring R is called a right ideal of R if (i) a Î U, b Î U Þ a - b Î U, and (ii) a Î U, r Î R Þ ar Î U. Example: Let M be the ring of 2 2 matrices one integers. Consider ì éa bù ü U = í : a, bî zý 0 0 ïî ë û ïþ é0 0ù 0 0 ë û Î U Þ U ¹ f and, P = we have AP = éa bù A = 0 0 ë û Î U B = éc dù 0 0 ë û Î U Þ A - B = éa -c b-dù 0 0 ë û Î 0 éa bù g d ë û, A = éa 0ù b 0 ë û Î U éa bùéa bù 0 0 g d ë ûë û éaa + bg ab + bdù = 0 0 ë û Î U Hence, U is a right ideal of M. 2.3.3 Ideal Definition 2.4: A non-empty set U of a ring R is called an ideal (two-sided ideal) of R if (i) a Î U, b Î U Þ a - b Î U, and (ii) a Î U, r Î R Þ a r Î U and r a Î U Example: The set E of even integers is an ideal of the ring Z of integers. a, b Î E Þ a = 2m, b = 2n for some integers m and n we have a - b = 2m - 2n = 2(m - n) Î E also r Î Z, a Î E Þ ra = r(2m) = 2(rm) Î E and, ar = (2m) r = 2(mr) Î E Hence, E is an ideal of Z.

Subrings and Ideals 47 Consider a(xr) a(xr) = (ax) r = 0 r = 0 Þ x r Î S Thus, S is a right ideal of R. " r Î R 1 x Î S Example 3: If R is a commutative ring with unity, then the ideal Ra is the smallest ideal containing a. Proof: Let < a > = Ç {U: U is a ideal of R and a Î U} Clearly, < a > is the smallest ideal which contains a. We shall show that < a > = Ra. Since Ra is an ideal and a Î Ra, we have < a > Ì Ra Let U be any ideal of R such that a Î U For any r Î R, r a Î U by the definition of an ideal. Hence, Ra Ì U. Since U is an arbitrary ideal containing a it follows that R a Ì Ç {U: U is an ideal and a Î U} i.e., Ra Ì < a > Hence, Ra = < a > Theorem 2.6: If R is a ring with unity and U is an ideal of R such that 1 Î U, then U = R. Proof: U is an ideal of R Þ U Í R (1) Let x Î R Now x Î R, 1 Î U Þ n 1 Î U (since U is a ideal of R) Þ x Î U Hence, R Í U (2) From (1) and (2), we have U = R Theorem 2.7: A field has no proper ideals. Proof: Let F be a field and U be an ideal of R. Then we will prove that either U = {0} or U = F. From the definition of an ideal, we have U Í F. (1) Let U ¹ {0}, a Î U and a ¹ 0 a Î U Þ a Î F (since U Ì F) Þ a -1 Î F (since F is a field) Now a Î U, a -1 Î F Þ aa -1 = 1 Î U Let x Î F: then x = x 1 Î F x Î F, 1 Î U Þ x 1 Î U (since U is an ideal)

48 Linear Algebra Þ x Î U Thus, F Í U (2) From (1) and (2), we have U = F Therefore, {0} and F are the only ideals of F. Theorem 2.8: proper ideals. A non-zero commutative ring with unity is a field if it has no Proof: Let R be a commutative ring with unity such that R has no proper ideals. In order to prove that every non-zero element in R has a multiplicative inverse, let a ¹ 0 Î R, then the set Ra = {ra : r Î R} is an ideal of R. R is with unity; therefore, 1 Î R, such 1 a = a Î Ra i.e., a ¹ 0 Î Ra Þ Ra is not a zero ideal R has no proper ideals and Ra ¹ {0}, therefore, it follows that Ra = R Now 1 Î R Þ 1 Î Ra Þ there exists an element b Î R such that 1 = ba Þ a -1 = b Thus, every non-zero element of R has a multiplicative inverse. Accordingly R is a field. Theorem 2.9: The intersection of two ideals of a ring R is an ideal of R. Solution: Let U 1 and U 2 be two ideals of a ring R. Then 0 Î U 1, 0 Î U 2 where 0 is zero element of the ring R. We have 0 Î U 1 Ç U 2 and, 0 Î U 1 Ç U 2 Þ U 1 Ç U 2 ¹ f Let a, b Î U 1 Ç U 2, and r Î R a, b Î U 1 Ç U 2 Þ a, b Î U 1 and a, b Î U 2 Now a, b Î U 1, r Î R Þ a - b Î U 1, ar, ra Î U 1 (1) (since U 1 is an ideal of R) and, a, b Î U 2, r Î R Þ a - b Î U 2, ar, ra Î U 2 (2) (since U 2 is an ideal of R)

50 Linear Algebra a Î U 1, b Î U 2 Þ a, b Î U 1 È U 2 Þ a, b Î U 1 or a, b Î U 2 Þ a - b Î U 1 or a - b Î U 2 If a - b Î U 1, then a - (a - b) = b Î U 1 (Q U 1 is an ideal of R) a contradiction and ifa - b Î U 2, then b + (a - b)= a Î U 2 (Q U 2 is an ideal of R) a contradiction Our assumption that U 1 Ë U 2 and U 2 Ë U 1 leads to a contradiction. Hence, U 1 Í U 2 or U 2 Í U 1 2.3.5 Sum of Ideals Definition 2.6: Let U 1 and U 2 be two ideals of a ring R, then the set U 1 + U 2 = {a + b: a Î U 1, b Î U 2 } is called the sum of ideals U 1 and U 2. Theorem 2.12: If U 1 and U 2 are any two ideals of a ring R, then U 1 + U 2 is an ideal of R containing both A and B. Proof: Clearly 0 = 0 + 0 Î U 1 + U 2 ; therefore, U 1 + U 2 ¹ f. Consider a = a 1 + b 1, b = a 2 + b 2 ; a 1, a 2 Î U 1, and b 1, b 2 Î U 2 Then, we have a - b = (a 1 - a 2 ) + (b 1 - b 2 ) Î U 1 + U 2 (since a 1 - a 1 Î U 1 ; b 1 - b 2 Î U 2 for all a 1, a 2 Î U 1, b 1, b 2 Î U 2 ) further, for any r Î R, ar = a 1 r + b 1 r Î U 1 + U 2 ra = ra 1 + rb 1 Î U 1 + U 2 since a 1 r, ra 1 Î N 1, and b 1 r, rb 1 Î U 2 Hence, U 1 + U 2 is an ideal of R. Now a Î U 1 Þ a = a + 0 Î U 1 + U 2 Þ U 1 Í U 1 + U 2 (Q 0 Î U 2 ) b Î U 2 Þ b = 0 + b Î U 1 + U 2 (Q 0 Î U 1 ) Þ U 2 Í U 1 + U 2 This proves the theorem. Definition 2.7: Let S be any subset of a ring R and U be an ideal of R. Then U is said be generated by S if (i) S Í U; and (ii) for any ideal V of R S Í V Þ U Í V

Subrings and Ideals 51 If the ideal U is generated by a subset S of a ring R, then we denote U by the symbol < S >. From the definition, < S > is the intersection of all those ideals of R which contain S. Theorem 2.13: If U 1 and U 2 are any two ideals of a ring R, then U 1 + U 2 = < U 1 È U 2 >. Proof: If U 1, U 2 are ideals of R, then by the previous theorem U 1 + U 2 is also an ideal of R, such that U 1 Í U 1 + U 2 and U 2 Í U 1 + U 2. We have U 1 Í U 1 + U 2, U 2 Í U 1 + U 2 Þ U 1 È U 2 Í U 1 + U 2 Let V be any ideal of R such that U 1 È U 2 Í V If x Î U 1 + U 2, then x = a + b, a Î U 1, b Î U 2 now a Î U 1 È U 2, b Î U 1 È U 2 Þ a, b Î V Þ a + b Î V Þ x Î V Hence, U 1 + U 2 Í V, consequently, by definition U 1 + U 2 = < U 1 È U 2 >. Example: If R is a ring with an R has no right ideals except R and {0}, show that R is a divisor ring. Solution: Let x ¹ 0 Î R Consider x R = {xr: r Î R} x Î R Þ x = x 1 Î xr, so xr ¹ f Also xy - xz = x (y - z) Î xr " xy, xz Î xr and for any S Î R, (xr) s = x (rs) Î x R. Thus, xr is a right ideal of R. Since x ¹ 0 Î xr, xr = R. Since R is a ring with unity, there exists y Î R such that xy = 1. Thus, R - {0} is a semigroup with unity and every non-zero element of R - {0} is right invertible. Hence, R - {0} is a group under multiplication. Consequently, R is a divisor ring. 2.4 SIMPLE RING Definition 2.8 A ring R is said to be simple, if (i) there exist a, b Î R such that ab ¹ 0, and, (ii) R has no proper ideals. Theorem 2.14: A divisor ring is a simple ring.

Subrings and Ideals 53 Þ r 1 a Î V (Since U is an ideal) Þ x Î V Thus, U Ì V Hence, U is an ideal of R generated by a, i.e., U is a principal ideal. Example: (Z, +, ) is a commutative ring with unity. E = < 2 > = {2n : n Î z} is an ideal of Z generated by 2 Thus E is a principal ideal of Z. 2.6 PRINCIPAL IDEAL RING Definition 2.10: A ring for which every ideal is a principal ideal is called a principal ideal ring. Example: The ring (Z 5, + 5, x 5 ) is a principal ideal ring. Theorem 2.16: Every field is a principal ideal ring. Proof: Let F be a field. We know, that a field has no proper zero divisor, i.e., the null ideal and the unit ideal are the only ideals of F. The null ideal U = {0} = < 0 > is generated by 0 and the unit ideal F = < 1 > is generated by, therefore U = < 0 > and F are the principal ideals of F. i.e., every ideal of F, is a principal ideal. Hence, F is a principal ideal ring. Example: Find the principal ideals of the ring (Z 6, + 6, 6) Solution: We have Z 6 = {0, 1, 2, 3, 4, 5} Clearly (Z 6, + 6, 6) is a commutative ring with unity and it is not a field. (Q Z 6 is a ring with zero divisor) (0) = {0} the null ideal is a principal ideal of Z 6 (1) = z 6, the unit ideal is a principal ideal of the ring (2) = {0, 2, 4} is a principal ideal of the ring (3) = {0, 3} is a principal ideal of the ring (4) = (2) is a principal ideal (5) = (1) is a principal ideal Hence, the principal ideals of (Z 6, + 6, 6) are (0), (1), {0, 3}, {0, 2, 4} Theorem 2.17: The ring of integers Z is a principal ideal ring. Proof: The ring of integers (Z, +, ) is a commutative ring with unity and without zero divisors; therefore, (Z, +, ) is an integral domain. Let U be an ideal of Z. If U = {0} = < 0 >, then U is a principal ideal Let us suppose that U ¹ (0).

54 Linear Algebra U contains at least one non-zero integer say a. Since U is a subgroup Z under addition; a Î U Þ - a Î U, where one of the integers, a, - a is positive. Hence, we conclude that U contains at least one positive integer. Let U + denote the set of all positive integers of U. From the well ordering principle, U + must have at least element. Let b denote least element in U +. We now show that U = (b); i.e., U is a principal ideal generated by b. Let x Î U, then x, b are integers where b ¹ 0. There exist integers q, r such that x = bq + r, 0 r < b U is an ideal, therefore, b Î U, q Î Z Þ bq Î U also x Î U, bq Î U Þ x - bq = r Î U(Since U is a subgroup of (Z, +)) but 0 r < b and b is the least positive integer such that b Î U implies that r < b and r Î U, which is a contradiction. Therefore, r must be zero. Hence, x = bq Therefore, U = {bq : q Î z} = (b) i.e., U is a principal ideal of Z, generated by b. Thus, every ideal of Z is a principal ideal. Hence, the ring of integers is a principal ideal ring. Example: If R is a commutative ring and a Î R, then the principal ideal (a) is equal to the set {ar + na : r Î R, n Î Z} Solution: Let U = {ar + na : r Î R, n Î Z)} We shall prove that U is the ideal generated by a. Clearly a = a0 + 1a Î U so that U ¹ f Let ar + na, as + ma Î U, where r, s Î R, n, m Î Z Then (ar + na) - (as + ma) = a (r - s) + (n - m) a Î U Further, if s Î R, then (ar + na)s = a (rs) + a (ns) = a (rs + ns) + 0a Î U which shows that U is a right ideal of R. Since R is commutative, U is also a left ideal of R. Hence, U is an ideal of R such that (a) Ì U. Let V be another ideal of R, containing (a). Since a Î V and V is an ideal of R, ar Î V, n a Î V for all r Î R and n Î Z. Therefore, ar + na Î V for all r Î R and for all n Î Z. Hence, U Í V consequently, U = (a)

56 Linear Algebra = [r + U] + [(s + t) + U] = (r + U) + [(s + U) + (t + U) Thus, addition is associative in R/U Existence of Identity: U = 0 + U Î R/U such that (r + U) + (0 + U) = (r + 0) + U = r + U and, (0 + U) + (r + U) = (0 + r) + U = r + U for all r + U Î R/U Hence, U = 0 + U is the identity with respect to addition. Existence of inverse: r + U Î R/U Þ - r + U Î R/U such that (r + U) + (- r + U) = (r + (- r)) + U = 0 + U = U and, (- r + U) + (r + r) = (- r + r) + U = 0 + U = U Thus, each element is invertible under addition. Commutative Property: r + U, s + U Î R/U Þ (r + U) + (s + U) = (r + s) + U = (s + r) + U = (s + U) + (r + U) (Since (R, +) is abelian Þ r + s = s + r " r, s Î R) Hence, (R/U, +) is an abelian group. I. R/U is closed with respect to multiplication (by def.) Association axiom: r + U, s + U, t + U Î R/U Þ [(r + U)] (s + U) (t + U) = (rs + U) (t + U) = (rs)t + U = r (st) + U (Q r, s, t Î R Þ (rs) t = r (st) = (r + U) (st + U) = (r + U) [(s + U) (t + U)] Thus, multiplication is associative in R/U. II. Distributive Laws: We have (r + U) [(s + U) + (t + U)] = (r + U) [(s + t) + U] = (r + (s + t)] + U = (rs + rt) + U = (rs + U) + (rt + U) = (r + U) (s + U) + (r + U) (t + U)

Subrings and Ideals 57 for all r + U, s + U, t + U Î R/U Similarly, we can prove that [(s + U) + (t + U)] (r + U) = (s + U) (r + U) + (t + U) (r + U) Hence, (R/U, +, ) is a ring. Definition 2.11: Let R be a ring and U be any ideal of R, then the system (R/U, +, ) where R/U = {r + U: r Î R} and + are the binary operations on R/ U defined by (r + U) + (s + U) = (r + s) + U (r + U) + (s + U)= rs + U for all r, s Î R (i.e., for all r + U, S + U Î R/U) is a ring called the quotient ring of R with respect to the ideal U. Example: Let U = {6n: n Î Z}, U is an ideal of Z and Z/U = {U, 1 + U, 2 + U, 3 + U, 4 + U, 5 + U} is the quotient ring under the operations * and,. Addition modulo 6 and multiplication modulo 6. Remarks 1: If R is commutative then R/U is also commutative, since (r + U) (s + U) = rs + U = sr + U = (s + U) (r + U) (Q rs º sr " r, s Î R) 2. If R has unity element, then R/U also has unity element: Let 1 be the unity element in R, then 1 + U Î R/U such that (1 + U) (r + U) = 1 r + U = r + U for all r + U Î R/U (Q 1 r = r for all r Î R) Therefore, 1 + U is the unity element in R/U. 2.8 PRIME IDEAL Definition 2.12: ideal if Let R be a commutative ring. An ideal P of R is called a prime ab Î P Þ a Î P or b Î P for all a, b Î R Example 1: The ideal (3) = {3n : n Î z} is a prime ideal in z, since 3 ab Þ 3 a or 3 b Þ a Î (3) or b Î (3) In general, P = {pr; r Î Z, p is a prime} is a prime ideal of Z.

Subrings and Ideals 59 = {... - 21, - 14, - 7, 0, 7, 14, 21,...} is maximal ideal in z. Alternative definition: A proper ideal M of a ring R is called a maximal ideal if there does not exist an ideal U of R such that M Í U Í R. Theorem 2.20: An ideal ring Z of integers is a maximal ideal if and only if it is generated by some prime number. Proof: Let M be an ideal of Z generated by a prime number p, and let M = {pn: n Î z} = < p > Let U be any ideal of Z, such that M Ì U Ì Z Every ideal of Z is a principal ideal Thus, U = < q >, q is an integer Now M Ì U Ì Z Þ < p > Ì < q > Ì Z Þ p Î < q > Þ p = qm for some m Î Z but p is prime Þ q = 1 or m = 1 m = 1 Þ p = q Þ < p > = < q > Þ M = U q = 1 Þ < q > = z Þ U = Z Hence, M is maximal ideal. Conversely, let M be a maximal ideal in Z and let M = (p). Let us assume that p is not a prime, then p must be a composite number. There exist integers a and b such that p = ab. Let a, b be prime numbers, then U = < a > and U É M Thus M Ì U Ì Z but M is a maximal ideal Hence, M = U or U = Z Case (i) When U = z we have U = < a > = < 1 > Þ a = 1 Therefore, p = ab Þ p = b Þ p is a prime number.

60 Linear Algebra Case (ii) when, U = M We have U = < a > = M Þ a Î M Þ a Î rp, r Î Z Therefore, p = ab = (rp) b = p(rb) Þ 1= rb Þ r = 1, b = 1 Thus, p = a 1 = a Þ p is prime Hence, M is generated by the prime p. Theorem 2.21: An ideal M ¹ R of a commutative ring R with unity is maximal if and only if R/M is a field. Proof: Let R be a commutative ring with unity and let M be a maximal ideal of the ring R. The R/M is also a commutative with unity. 1 + M is the unity of the ring R/M. R/M is a field, if we show that every non-zero element of R/M has a multiplicative inverse. M is a maximal ideal of R, therefore a Î R, a Ï M Þ < a > + M = R(1) there exist elements b Î R, x Î M such that x + ab = 1 or ab - 1= x Î M If ab - 1 Î M, then we have ab + M = 1 + M Þ (a + M) (b + M) = 1 + M i.e., to each non-zero element a + M Î R/M, there exists b + M Î R/M such that (a + M) (b + M) = 1 + M Thus, a + M Î R/M is invertible. Hence, R/M is a field. Conversely, let R/M be a field and U be an ideal of U ¹ M and M Ì U We now show that U = R Since U É M, U ¹ M there exists an element a Î U such that a Ï M a Ï M Þ a + M is a non-zero element of R/M. R/M is a field and a + M is a non-zero element in R/M. Hence, a + M is invertible

62 Linear Algebra Solution: Let a + U = b + U 0 Î U Þ a = a + 0 Î a + U = b + U now at b + U Þ a = b + x for some x Î U Þ a - b = x Î U Conversely, let a - b Î U; and a - b = c, then a - b = c Î U Þ a = b + c we have x Î a + U Þ x = a + d for some d Î U Hence, x = (b + c) + d = b + (c + d) Î b + 0 (Q c + d Î U) Thus, a + U Ì b + U Similarly, b + U Ì a + U Therefore, a + U = b + U