9.1 Ideals
A subset I⊆R is an ideal if:
- (I,+) is a subgroup of (R,+).
- For all r∈R and a∈I: ra∈I and ar∈I.
If only ra∈I for all r∈R and a∈IThen I is a left ideal. Similarly for right Ideals. A two-sided ideal (or ideal) satisfies both.
Proposition 9.1. Every ideal is a subring. The converse is false.
Example. nZ={nk:k∈Z} is an ideal of Z.
Example. If ϕ:R→S is a ring homomorphism, then ker(ϕ) is an ideal of R.
9.2 Quotient Rings
If I is an ideal of RThe quotient ring R/I has elements {a+I:a∈R} (cosets) With operations (a+I)+(b+I)=(a+b)+I and (a+I)(b+I)=ab+I.
Theorem 9.2 (Ring Isomorphism Theorem). If ϕ:R→S is a surjective ring homomorphism, Then R/ker(ϕ)≅S.
The …/1-number-and-algebra/3_proof-and-logic follows the same pattern as the first isomorphism theorem for groups.
9.3 Prime and Maximal Ideals
An ideal I=R is prime if ab∈I implies a∈I or b∈I.
An ideal I=R is maximal if there is no ideal J with I⊊J⊊R.
Theorem 9.3. In a commutative ring R with unity:
- I is a prime ideal if and only if R/I is an integral domain.
- I is a maximal ideal if and only if R/I is a field.
Corollary 9.4. Every maximal ideal is prime.
Proof. A field is an integral domain. ■
Example. In ZThe ideal (p) is maximal (hence prime) if and only if p is prime. The ideal (6) is neither prime nor maximal. The ideal (0) is prime (Z is an integral domain) But not maximal (Z/(0)≅Z is not a field).
Example. In R[x]The ideal (x2+1) is maximal since R[x]/(x2+1)≅C is a field.
Problem. Show that (2) is a maximal ideal of Z but (4) is not.
Solution
Solution. Z/(2)≅Z/2Z is a field, so (2) is maximal by Theorem 9.3.
Z/(4) has zero divisors: [2][2]=[4]=[0] but [2]=[0]. So Z/(4) is not An integral domain, hence (4) is not prime, and therefore not maximal. Explicitly, (4)⊊(2)⊊Z. ■
9.4 The Chinese Remainder Theorem
Theorem 9.5 (Chinese Remainder Theorem for Rings). Let R be a commutative ring with unity and Let I,J be ideals with I+J=R. Then
R/(I∩J)≅R/I×R/J
Proof. Define ϕ:R→R/I×R/J by ϕ(r)=(r+I,r+J). This is a ring homomorphism. It is surjective: since I+J=RThere exist a∈I and b∈J with a+b=1. For any (r1+I,r2+J)Take r=r1b+r2a. Then r≡r1b≡r1(1−a)≡r1(modI) And r≡r2a≡r2(1−b)≡r2(modJ).
The kernel is ker(ϕ)={r:r∈I and r∈J}=I∩J. By the ring isomorphism theorem, R/(I∩J)≅R/I×R/J. ■
Corollary 9.6. If m,n∈Z are coprime, then Z/(mn)≅Z/(m)×Z/(n).
Proof. Apply Theorem 9.5 with I=(m), J=(n). Since gcd(m,n)=1We have (m)+(n)=(1)=Z. Also (m)∩(n)=(lcm(m,n))=(mn). ■
Problem. Find all solutions to x≡2(mod3), x≡3(mod5), x≡1(mod7).
Solution
Solution. By the Chinese Remainder Theorem, since gcd(3,5)=gcd(3,7)=gcd(5,7)=1 There is a unique solution modulo 105.
First, solve x≡2(mod3) and x≡3(mod5). x=2+3k: we need 2+3k≡3(mod5)So 3k≡1(mod5)Giving k≡2(mod5). Thus x≡2+6=8(mod15).
Now solve x≡8(mod15) and x≡1(mod7). x=8+15k: we need 8+15k≡1(mod7)So 1+k≡1(mod7)Giving k≡0(mod7). Thus x≡8(mod105).
The unique solution modulo 105 is x≡8(mod105). ■