Skip to content

Ideals and Quotient Rings

A subset I⊆RI \subseteq R is an ideal if:

  1. (I,+)(I, +) is a subgroup of (R,+)(R, +).
  2. For all r∈Rr \in R and a∈Ia \in I: ra∈Ira \in I and ar∈Iar \in I.

If only ra∈Ira \in I for all r∈Rr \in R and a∈Ia \in I Then 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:k∈Z}n\mathbb{Z} = \{nk : k \in \mathbb{Z}\} is an ideal of Z\mathbb{Z}.

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

If II is an ideal of RR The quotient ring R/IR/I has elements {a+I:a∈R}\{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 ϕ:R→S\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.

An ideal I≠RI \neq R is prime if ab∈Iab \in I implies a∈Ia \in I or b∈Ib \in I.

An ideal I≠RI \neq R is maximal if there is no ideal JJ with I⊊J⊊RI \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

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/(I∩J)≅R/I×R/JR/(I \cap J) \cong R/I \times R/J

Proof. Define ϕ:R→R/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 = R There exist a∈Ia \in I and b∈Jb \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 r≡r1b≡r1(1−a)≡r1(modI)r \equiv r_1b \equiv r_1(1-a) \equiv r_1 \pmod{I} And r≡r2a≡r2(1−b)≡r2(modJ)r \equiv r_2a \equiv r_2(1-b) \equiv r_2 \pmod{J}.

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

Corollary 9.6. If m,n∈Zm, 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) = 1 We 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 x≡2(mod3)x \equiv 2 \pmod{3}, x≡3(mod5)x \equiv 3 \pmod{5}, x≡1(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 x≡2(mod3)x \equiv 2 \pmod{3} and x≡3(mod5)x \equiv 3 \pmod{5}. x=2+3kx = 2 + 3k: we need 2+3k≡3(mod5)2 + 3k \equiv 3 \pmod{5} So 3k≡1(mod5)3k \equiv 1 \pmod{5} Giving k≡2(mod5)k \equiv 2 \pmod{5}. Thus x≡2+6=8(mod15)x \equiv 2 + 6 = 8 \pmod{15}.

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

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

An ideal is the ring-theoretic analogue of a normal subgroup. It is a subset that absorbs multiplication from both sides: if a∈Ia \in I and r∈Rr \in R, then rara and arar are in II. This absorption property is what makes quotient rings possible: it ensures that the product of two cosets (a+I)(b+I)=ab+I(a + I)(b + I) = ab + I is well-defined.

Prime ideals are the ring-theoretic analogue of prime numbers: II is prime if ab∈Iab \in I implies a∈Ia \in I or b∈Ib \in I. The quotient by a prime ideal is an integral domain (no zero divisors). Maximal ideals are the largest proper ideals: the quotient by a maximal ideal is a field (every non-zero element is invertible). In Z\mathbb{Z}, the prime ideals are (p)(p) for each prime pp, and these are also maximal, giving the fields Z/pZ\mathbb{Z}/p\mathbb{Z}. The Chinese Remainder Theorem says that when two ideals are coprime, the quotient by their product is isomorphic to the product of the individual quotients, which is the algebraic foundation for modular arithmetic and RSA cryptography.

  • Confusing subrings with ideals. Every ideal is a subring, but subrings need not be closed under multiplication by arbitrary ring elements.
  • Forgetting two-sided closure. An ideal must absorb multiplication from both sides: ra∈Ira \in I and ar∈Iar \in I for all r∈Rr \in R, a∈Ia \in I. In non-commutative rings, left and right ideals differ.
  • Assuming primality implies maximality. In Z\mathbb{Z}, (0)(0) is prime but not maximal. In R[x,y]\mathbb{R}[x,y], (x)(x) is prime but not maximal since (x)⊊(x,y)(x) \subsetneq (x,y).
  • Misapplying CRT. The Chinese Remainder Theorem requires coprime moduli (or more generally, I+J=RI + J = R). Without this condition, the natural map need not be surjective.
ConceptRingConditionQuotient
Prime idealCommutative RRab∈I⇒a∈Iab \in I \Rightarrow a \in I or b∈Ib \in IR/IR/I is an integral domain
Maximal idealCommutative RRNo ideal strictly between II and RRR/IR/I is a field
Kernel of hom.Any ring RRker⁡(ϕ)=ϕ−1(0)\ker(\phi) = \phi^{-1}(0)R/ker⁡(ϕ)≅im⁡(ϕ)R/\ker(\phi) \cong \operatorname{im}(\phi)
Principal idealZ\mathbb{Z}, F[x]F[x](a)={ra:r∈R}(a) = \{ra : r \in R\}Z/(n)≅Z/nZ\mathbb{Z}/(n) \cong \mathbb{Z}/n\mathbb{Z}
  • Cryptography: RSA encryption relies on Z/(n)\mathbb{Z}/(n) where n=pqn = pq; the CRT optimises decryption via the isomorphism Z/(pq)≅Z/(p)×Z/(q)\mathbb{Z}/(pq) \cong \mathbb{Z}/(p) \times \mathbb{Z}/(q).
  • Error-correcting codes: Polynomial rings over finite fields and quotient constructions underpin Reed-Solomon and BCH codes.
  • Algebraic geometry: The correspondence between ideals of k[x1,…,xn]k[x_1, \ldots, x_n] and algebraic varieties (Hilbert’s Nullstellensatz) generalises the prime/maximal ideal classification.