Skip to content

Ideals and Quotient Rings

9.1 Ideals

A subset IRI \subseteq R is an ideal if:

  1. (I,+)(I, +) is a subgroup of (R,+)(R, +).
  2. For all rRr \in R and aIa \in I: raIra \in I and arIar \in I.

If only raIra \in I for all rRr \in R and aIa \in IThen II 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:kZ}n\mathbb{Z} = \{nk : k \in \mathbb{Z}\} is an ideal of Z\mathbb{Z}.

Example. If ϕ:RS\phi : R \to S is a ring homomorphism, then ker(ϕ)\ker(\phi) is an ideal of RR.

9.2 Quotient Rings

If II is an ideal of RRThe quotient ring R/IR/I has elements {a+I:aR}\{a + I : a \in R\} (cosets) With operations (a+I)+(b+I)=(a+b)+I(a + I) + (b + I) = (a + b) + I and (a+I)(b+I)=ab+I(a + I)(b + I) = ab + I.

Theorem 9.2 (Ring Isomorphism Theorem). If ϕ:RS\phi : R \to S is a surjective ring homomorphism, Then R/ker(ϕ)SR / \ker(\phi) \cong 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 IRI \neq R is prime if abIab \in I implies aIa \in I or bIb \in I.

An ideal IRI \neq R is maximal if there is no ideal JJ with IJRI \subsetneq J \subsetneq R.

Theorem 9.3. In a commutative ring RR with unity:

  1. II is a prime ideal if and only if R/IR/I is an integral domain.
  2. II is a maximal ideal if and only if R/IR/I is a field.

Corollary 9.4. Every maximal ideal is prime.

Proof. A field is an integral domain. \blacksquare

Example. In Z\mathbb{Z}The ideal (p)(p) is maximal (hence prime) if and only if pp is prime. The ideal (6)(6) is neither prime nor maximal. The ideal (0)(0) is prime (Z\mathbb{Z} is an integral domain) But not maximal (Z/(0)Z\mathbb{Z}/(0) \cong \mathbb{Z} is not a field).

Example. In R[x]\mathbb{R}[x]The ideal (x2+1)(x^2 + 1) is maximal since R[x]/(x2+1)C\mathbb{R}[x]/(x^2 + 1) \cong \mathbb{C} is a field.

Problem. Show that (2)(2) is a maximal ideal of Z\mathbb{Z} but (4)(4) is not.

Solution

Solution. Z/(2)Z/2Z\mathbb{Z}/(2) \cong \mathbb{Z}/2\mathbb{Z} is a field, so (2)(2) is maximal by Theorem 9.3.

Z/(4)\mathbb{Z}/(4) has zero divisors: [2][2]=[4]=[0][2][2] = [4] = [0] but [2][0][2] \neq [0]. So Z/(4)\mathbb{Z}/(4) is not An integral domain, hence (4)(4) is not prime, and therefore not maximal. Explicitly, (4)(2)Z(4) \subsetneq (2) \subsetneq \mathbb{Z}. \blacksquare

9.4 The Chinese Remainder Theorem

Theorem 9.5 (Chinese Remainder Theorem for Rings). Let RR be a commutative ring with unity and Let I,JI, J be ideals with I+J=RI + J = R. Then

R/(IJ)R/I×R/JR/(I \cap J) \cong R/I \times R/J

Proof. Define ϕ:RR/I×R/J\phi : R \to R/I \times R/J by ϕ(r)=(r+I,r+J)\phi(r) = (r + I, r + J). This is a ring homomorphism. It is surjective: since I+J=RI + J = RThere exist aIa \in I and bJb \in J with a+b=1a + b = 1. For any (r1+I,r2+J)(r_1 + I, r_2 + J)Take r=r1b+r2ar = r_1b + r_2a. Then rr1br1(1a)r1(modI)r \equiv r_1b \equiv r_1(1-a) \equiv r_1 \pmod{I} And rr2ar2(1b)r2(modJ)r \equiv r_2a \equiv r_2(1-b) \equiv r_2 \pmod{J}.

The kernel is ker(ϕ)={r:rI and rJ}=IJ\ker(\phi) = \{r : r \in I\ \mathrm{and\ r} \in J\} = I \cap J. By the ring isomorphism theorem, R/(IJ)R/I×R/JR/(I \cap J) \cong R/I \times R/J. \blacksquare

Corollary 9.6. If m,nZm, n \in \mathbb{Z} are coprime, then Z/(mn)Z/(m)×Z/(n)\mathbb{Z}/(mn) \cong \mathbb{Z}/(m) \times \mathbb{Z}/(n).

Proof. Apply Theorem 9.5 with I=(m)I = (m), J=(n)J = (n). Since gcd(m,n)=1\gcd(m, n) = 1We have (m)+(n)=(1)=Z(m) + (n) = (1) = \mathbb{Z}. Also (m)(n)=(lcm(m,n))=(mn)(m) \cap (n) = (\mathrm{lcm}(m, n)) = (mn). \blacksquare

Problem. Find all solutions to x2(mod3)x \equiv 2 \pmod{3}, x3(mod5)x \equiv 3 \pmod{5}, x1(mod7)x \equiv 1 \pmod{7}.

Solution

Solution. By the Chinese Remainder Theorem, since gcd(3,5)=gcd(3,7)=gcd(5,7)=1\gcd(3, 5) = \gcd(3, 7) = \gcd(5, 7) = 1 There is a unique solution modulo 105105.

First, solve x2(mod3)x \equiv 2 \pmod{3} and x3(mod5)x \equiv 3 \pmod{5}. x=2+3kx = 2 + 3k: we need 2+3k3(mod5)2 + 3k \equiv 3 \pmod{5}So 3k1(mod5)3k \equiv 1 \pmod{5}Giving k2(mod5)k \equiv 2 \pmod{5}. Thus x2+6=8(mod15)x \equiv 2 + 6 = 8 \pmod{15}.

Now solve x8(mod15)x \equiv 8 \pmod{15} and x1(mod7)x \equiv 1 \pmod{7}. x=8+15kx = 8 + 15k: we need 8+15k1(mod7)8 + 15k \equiv 1 \pmod{7}So 1+k1(mod7)1 + k \equiv 1 \pmod{7}Giving k0(mod7)k \equiv 0 \pmod{7}. Thus x8(mod105)x \equiv 8 \pmod{105}.

The unique solution modulo 105105 is x8(mod105)x \equiv 8 \pmod{105}. \blacksquare