math.wiki
Abstract algebra › Rings › Ideals and quotient rings
Sign in

Ideals and quotient rings

In a group only a normal subgroup can be divided out. Which subsets of a ring can be divided out so that the cosets still add and multiply, and what ring do the cosets form?

Where you are 4 in Rings

Why this exists

Arithmetic mod n works because sums and products of classes do not depend on the representatives (Relations, equivalence classes and partitions, Theorem 8). A ring (Rings and integral domains) has two operations, so dividing it by an additive subgroup I needs the cosets to multiply too. What made this work for n\mathbb{Z}? If a' = a + nk, then a'b = ab + n(kb): a multiple of n times any integer is a multiple of n. That property, absorbing multiplication, defines an ideal, and Theorem 7 shows it is exactly what dividing out requires.

Definition

Let R be a ring. An ideal of R is a subset I \subseteq R such that

  • (I1) I is a subgroup of the additive group (R, +);
  • (I2) I absorbs multiplication: ra \in I and ar \in I for every r \in R and a \in I.

An ideal I \ne R is proper; every ring has the ideals \{0\} and R. Here a subring contains 1, and an ideal containing 1 is all of R (Theorem 2), so a proper ideal is never a subring: 2\mathbb{Z} is an ideal of \mathbb{Z}, not a subring.

Let R be commutative and a_1, \dots, a_n \in R. The ideal generated by them is

\langle a_1, \dots, a_n \rangle = \{r_1a_1 + \dots + r_na_n : r_i \in R\}.

With one element, \langle a \rangle = \{ra : r \in R\} is the principal ideal of a. In a ring, \langle a \rangle always means this ideal, never the cyclic subgroup \{ka : k \in \mathbb{Z}\} of (R, +) from Cyclic groups. In \mathbb{Z} and \mathbb{Z}_n the two agree; elsewhere the ideal can be larger (Example 4).

Let I be an ideal. As (R, +) is abelian, I is normal in it (Normal subgroups, Theorem 5(a)), and the cosets a + I form the quotient group R/I, with a + I = b + I if and only if a - b \in I. The quotient ring R/I is this set with

\begin{aligned} (a + I) + (b + I) &= (a + b) + I, \\ (a + I)(b + I) &= ab + I. \end{aligned}

The natural map is \pi : R \to R/I, \pi(a) = a + I. For I = n\mathbb{Z} the coset a + n\mathbb{Z} is the class [a]_n, and \mathbb{Z}/n\mathbb{Z} is the ring \mathbb{Z}_n.

Intuition

Read an ideal as the set of things declared to be zero. In R/I, a + I = b + I exactly when a - b \in I: compute in R, then ignore any difference lying in I. For that to be consistent, “zero times anything” must again be “zero”, and that is (I2). An additive subgroup that fails (I2) can still be divided out as a group, but its cosets no longer multiply (Example 1). An ideal is also a net of multiples: in \mathbb{Z}, \langle a, b \rangle holds every ra + sb, and these are exactly the multiples of \gcd(a, b) (Theorem 5).

Results

Throughout, R is a ring and I an ideal of R, unless stated otherwise.

Theorem 1 (ideal test). A subset I \subseteq R is an ideal if and only if I \ne \varnothing, a - b \in I for all a, b \in I, and ra, ar \in I for all r \in R, a \in I. If R is commutative, ra \in I alone suffices for the last condition.

Theorem 2 (ideals and units). For an ideal I the following are equivalent: (a) I = R; (b) 1 \in I; (c) I contains a unit of R.

Corollary 3 (fields). A commutative ring R with 1 \ne 0 is a field if and only if its only ideals are \{0\} and R.

Theorem 4 (generated ideals). Let R be commutative and a_1, \dots, a_n \in R. Then \langle a_1, \dots, a_n \rangle is an ideal containing a_1, \dots, a_n, and it lies inside every ideal that contains a_1, \dots, a_n. Also \langle a \rangle = R if and only if a is a unit.

Theorem 5 (ideals of the integers). Every ideal of \mathbb{Z} is \langle n \rangle = n\mathbb{Z} for exactly one integer n \ge 0. If the integers a, b are not both 0, then \langle a, b \rangle = \langle \gcd(a, b) \rangle, so \gcd(a, b) = ra + sb for some integers r, s.

Theorem 6 (the quotient ring). (a) If a + I = a' + I and b + I = b' + I, then ab + I = a'b' + I. (b) R/I is a ring with zero I and identity 1 + I, commutative if R is, and the zero ring exactly when I = R. (c) The natural map \pi is onto, \pi(a + b) = \pi(a) + \pi(b), \pi(ab) = \pi(a)\pi(b), \pi(1) = 1 + I, and \pi(a) = 0 + I if and only if a \in I.

Theorem 7 (absorption is needed). Let I be a subgroup of (R, +). If a + I = a' + I and b + I = b' + I always imply ab + I = a'b' + I, then I is an ideal.

Why it is true

Proof of Theorem 1. The first two conditions say I is a subgroup of (R, +), by the one-step test (Subgroups, Theorem 3) written additively; the third is (I2). If R is commutative, ar = ra. \square

Proof of Theorem 2. (a) implies (b), and (b) implies (c) as 1 is a unit. If u \in I is a unit, then 1 = u^{-1}u \in I by (I2), and r = r1 \in I for every r, so I = R. \square

Proof of Theorem 4. Write J = \langle a_1, \dots, a_n \rangle. Taking every r_i = 0 gives 0 \in J. By the distributive laws \sum r_ia_i - \sum s_ia_i = \sum (r_i - s_i)a_i, and r\sum r_ia_i = \sum (rr_i)a_i, both in J; so J is an ideal by Theorem 1. Taking r_i = 1 and the other coefficients 0 gives a_i \in J. If an ideal K contains every a_i, then each r_ia_i \in K by (I2), and so is their sum: J \subseteq K. Finally, \langle a \rangle = R if and only if 1 = ra for some r (Theorem 2), and as ra = ar this says a is a unit. \square

Proof of Corollary 3. In a field, an ideal I \ne \{0\} holds some a \ne 0, a unit, so I = R by Theorem 2. Conversely, if the only ideals are \{0\} and R and a \ne 0, then \langle a \rangle \ni a is not \{0\}, so \langle a \rangle = R and a is a unit by Theorem 4. \square

Proof of Theorem 5. An ideal of \mathbb{Z} is a subgroup of (\mathbb{Z}, +), so it is n\mathbb{Z} for exactly one n \ge 0 (Cyclic groups, Corollary 7): 0 for the zero ideal, else its least positive element. Conversely n\mathbb{Z} = \langle n \rangle is an ideal by Theorem 4. Let d = \gcd(a, b) and \langle a, b \rangle = \langle n \rangle; n > 0, as a or b is a nonzero element. Since a, b \in \langle n \rangle, n is a common divisor, so n \le d. Since d divides a and b, it divides every ra + sb, in particular n, so d \le n. Hence n = d, and d \in \langle a, b \rangle is some ra + sb. \square

The Bezout's identity and the extended Euclidean algorithm computes such r and s.

Proof of Theorem 6. (a) Write a' = a + x, b' = b + y with x, y \in I. Then a'b' = ab + ay + xb + xy, where ay, xy lie in I by (I2) on the left and xb by (I2) on the right. So a'b' - ab \in I.

(b) Addition makes R/I an abelian group (Quotient groups, Theorems 1 and 6(a)). Each other axiom holds for cosets because it holds for representatives: both ways of bracketing (a + I)(b + I)(c + I) give abc + I; (a + I)\bigl((b + I) + (c + I)\bigr) = (ab + ac) + I, which is (a + I)(b + I) + (a + I)(c + I), and likewise on the right; 1 + I is an identity; and ab = ba in R gives (a + I)(b + I) = (b + I)(a + I). Last, R/I is the zero ring if and only if 1 + I = 0 + I, that is, 1 \in I, that is, I = R.

(c) Every coset is a + I = \pi(a). The equations for sums, products and 1 are the definitions of the operations, and \pi(a) = 0 + I if and only if a - 0 \in I. \square

Proof of Theorem 7. Let a \in I and r \in R. Then a + I = 0 + I, so the hypothesis gives ar + I = 0r + I = 0 + I, using 0r = 0 (Rings and integral domains, Theorem 1). So ar \in I; the other order gives ra \in I. \square

Worked examples

Example 1

Two subsets of \mathbb{Z} \times \mathbb{Z}

In the product ring \mathbb{Z} \times \mathbb{Z}, decide whether A = \{(a, 0) : a \in \mathbb{Z}\} and C = \{(a, 2a) : a \in \mathbb{Z}\} are ideals. For one that is not, exhibit equal cosets whose products with a third coset differ.

Solution

The ring is commutative. A contains (0, 0), (a, 0) - (b, 0) = (a - b, 0) \in A, and (r, s)(a, 0) = (ra, 0) \in A; by Theorem 1, A is an ideal.

C is an additive subgroup, since (a, 2a) - (b, 2b) = (a - b, 2(a - b)). But (1, 0)(1, 2) = (1, 0), and (1, 0) \notin C as 0 \ne 2: (I2) fails. As (1, 2) \in C, the cosets (1, 2) + C and (0, 0) + C are equal, yet their products with (1, 0) + C are (1, 0) + C and (0, 0) + C, which differ, as Theorem 7 predicts.

Example 2

The ideals of \mathbb{Z}_{30}

Find every ideal of \mathbb{Z}_{30}, its size, and which ideals contain which. Then describe \mathbb{Z}_{30}/\langle 6 \rangle.

Solution

Write k for [k]. Every additive subgroup H of \mathbb{Z}_n absorbs: for r = [k] with 0 \le k < n and a \in H, ra = ka is a sum of k copies of a, in H. So the ideals of \mathbb{Z}_{30} are its additive subgroups: one of each order m dividing 30, namely \langle 30/m \rangle (Cyclic groups, Theorem 10). The divisors of 30 are 1, 2, 3, 5, 6, 10, 15, 30, giving eight ideals \langle d \rangle with 30/d elements, from \langle 1 \rangle = \mathbb{Z}_{30} to \langle 30 \rangle = \{0\}.

For divisors d, d' of 30: if d' \mid d, then d \in \langle d' \rangle, so \langle d \rangle \subseteq \langle d' \rangle. Conversely, if d \in \langle d' \rangle, then d = kd' + 30m for integers k, m, and d' \mid 30 gives d' \mid d.

\langle 1 \rangle
\langle 2 \rangle
\langle 3 \rangle
\langle 5 \rangle
\langle 6 \rangle
\langle 10 \rangle
\langle 15 \rangle
\langle 30 \rangle
Figure 1The eight ideals of \mathbb{Z}_{30} ordered by inclusion (Example 2). The ideal \langle d \rangle has 30/d elements, and \langle d \rangle \subseteq \langle d' \rangle exactly when d' divides d, so the larger the generator, the smaller the ideal.

Now \langle 6 \rangle = \{0, 6, 12, 18, 24\}, so the quotient has 30/5 = 6 elements. As 6 \mid 30, a + \langle 6 \rangle = b + \langle 6 \rangle exactly when 6 \mid a - b. For instance

\begin{aligned} (4 + \langle 6 \rangle)(5 + \langle 6 \rangle) &= 20 + \langle 6 \rangle \\ &= 2 + \langle 6 \rangle, \end{aligned}

just as 4 \cdot 5 \equiv 2 \pmod{6}. So \mathbb{Z}_{30}/\langle 6 \rangle has the tables of \mathbb{Z}_6; Ring homomorphisms makes “the same tables” an isomorphism.

Example 3

An apothecary’s balance

Aisha runs an apothecary and weighs powders on a two-pan balance, with as many brass weights of 28 grams and 63 grams as she likes. A weight may sit on either pan. Which amounts can she balance? How does she weigh the 7 grams David ordered, and can she weigh 50 grams?

Solution

With x grams of powder, p' and q' weights of each size beside it and p, q on the other pan, balance means x + 28p' + 63q' = 28p + 63q, so x = 28(p - p') + 63(q - q'). Every combination 28r + 63s arises, so the amounts are the positive elements of \langle 28, 63 \rangle. By Theorem 5 this is \langle \gcd(28, 63) \rangle, and the The Euclidean algorithm and coprime numbers gives 63 = 2 \cdot 28 + 7, 28 = 4 \cdot 7, so \gcd(28, 63) = 7: she can balance exactly the multiples of 7 grams.

As 7 = 63 - 2 \cdot 28, she sets one 63 gram weight against the powder and two 28 gram weights beside it: 7 + 56 = 63. As 7 \nmid 50, no arrangement balances 50 grams.

Example 4

The Gaussian integers modulo 1 + i

In \mathbb{Z}[i], describe I = \langle 1 + i \rangle, compare it with the additive subgroup generated by 1 + i, and find \mathbb{Z}[i]/I.

Solution

The elements of I are (1 + i)(c + di) = (c - d) + (c + d)i. So a + bi \in I if and only if a + b is even: if a = c - d and b = c + d, then a + b = 2c; conversely, if a + b is even, \displaystyle c = \frac{a + b}{2} and \displaystyle d = \frac{b - a}{2} are integers that work. For example (1 + i)(4 + i) = 3 + 5i.

The additive subgroup generated by 1 + i is \{k + ki : k \in \mathbb{Z}\}, which misses i(1 + i) = -1 + i \in I. So that subgroup is not an ideal, and \langle 1 + i \rangle must mean the ideal.

A coset a + bi + I is 0 + I when a + b is even and 1 + I when a + b is odd, since then (a - 1) + b is even. These differ, as 1 \notin I, so \mathbb{Z}[i]/I = \{0 + I, 1 + I\}. Since 2 = (1 + i)(1 - i) \in I, (1 + I) + (1 + I) = 0 + I, and (1 + I)(1 + I) = 1 + I: the tables of \mathbb{Z}_2, a field with two elements.

Example 5

Real polynomials modulo x^2 + 1

Let \mathbb{R}[x] be the ring of real polynomials (Polynomial rings and the division algorithm) and I = \langle x^2 + 1 \rangle. Show that each coset contains exactly one a + bx. Compute (2 + 3x + I)(1 - x + I) and the inverse of 2 + 3x + I.

Solution

Polynomial long division gives f = q(x^2 + 1) + (a + bx), so f + I = a + bx + I. If a + bx + I = a' + b'x + I, then (a - a') + (b - b')x = g(x^2 + 1); a nonzero g would make the right side of degree at least 2 (Degree, terms and standard form), so g = 0 and a = a', b = b'.

As x^2 - (-1) \in I, x^2 + I = -1 + I. Now (2 + 3x)(1 - x) = 2 + x - 3x^2, and -3x^2 + I = 3 + I, so the product is 5 + x + I. Next (2 + 3x)(2 - 3x) = 4 - 9x^2, which is 13 mod I, so

(2 + 3x + I)\Bigl(\tfrac{2}{13} - \tfrac{3}{13}x + I\Bigr) = 1 + I.

In general (a + bx)(c + dx) + I = (ac - bd) + (ad + bc)x + I, complex multiplication with x for i; compare (2 + 3i)(1 - i) = 5 + i. The quotient is a copy of \mathbb{C}.

Example 6

The nilpotent elements form an ideal

An element a is nilpotent if a^k = 0 for some positive integer k. Let R be commutative. Prove that the set N of nilpotent elements is an ideal, and that 0 + N is the only nilpotent element of R/N.

Solution

Proof. 0 \in N. Let a^m = 0, b^n = 0 and r \in R. By commutativity (ra)^m = r^ma^m = 0. The binomial theorem holds in a commutative ring (as in Rings and integral domains, Exercise 15), so

\begin{aligned} (a - b)^{m + n - 1} &= \sum_{k = 0}^{m + n - 1} c_k\, a^k (-b)^{m + n - 1 - k}, \\ c_k &= \tbinom{m + n - 1}{k}. \end{aligned}

In each term either k \ge m, so a^k = 0, or k \le m - 1, so -b appears to a power at least n, which is 0. So a - b \in N, and N is an ideal by Theorem 1. If (a + N)^k = 0 + N, then a^k + N = 0 + N by Theorem 6, so (a^k)^j = 0 for some j, and a \in N. \square

Boundaries

  • One-sided ideals. An additive subgroup with only ra \in I is a left ideal, such as the matrices in M_2(\mathbb{R}) with second column zero; by Theorem 7 its cosets do not multiply.
  • Generators need commutativity. Theorem 4 and Corollary 3 assume R commutative. In general the ideal generated by a consists of sums r_1as_1 + \dots + r_kas_k, and M_2(\mathbb{R}) has only the ideals \{0\} and itself (Exercise 17) without being a field.
  • Unions. Intersections and sums of ideals are ideals (Exercise 13); unions usually are not (Exercise 2).
  • Not every ideal is principal. In \mathbb{Z}[x], if \langle 2, x \rangle = \langle f \rangle, then 2 = fg forces f = \pm 1 or \pm 2; but every element of \langle 2, x \rangle has even constant term, and x is not 2h.

Where this goes next

By Theorem 6(c) every ideal is the set some map respecting both operations sends to zero. Ring homomorphisms shows every kernel is an ideal and proves the first isomorphism theorem for rings, making Examples 2 and 5 exact. Prime and maximal ideals asks which quotients are integral domains or fields: \mathbb{Z}[i]/\langle 1 + i \rangle is a field, \mathbb{Z}[i]/\langle 2 \rangle not even a domain (Exercise 8). Polynomial rings and the division algorithm shows every ideal of F[x], for a field F, is principal, with division in its role from Theorem 5.

Exercises

Recognizing ideals

  1. Which are ideals? (a) 4\mathbb{Z} \times 6\mathbb{Z} in \mathbb{Z} \times \mathbb{Z}; (b) \{a + bi \in \mathbb{Z}[i] : a \text{ is even}\} in \mathbb{Z}[i]; (c) \mathbb{Z} in \mathbb{Q}; (d) \{0, 5, 10, 15\} in \mathbb{Z}_{20}.
  2. Refute with a counterexample in \mathbb{Z}: the union of two ideals is an ideal.

Generators

  1. Find a single generator: (a) \langle 84, 120 \rangle in \mathbb{Z}, written as 84r + 120s; (b) \langle 6, 10, 15 \rangle in \mathbb{Z}.
  2. In \mathbb{Z} find n, m \ge 0 with \langle 12 \rangle \cap \langle 18 \rangle = \langle n \rangle and \langle 12 \rangle + \langle 18 \rangle = \langle m \rangle, where I + J = \{a + b : a \in I, b \in J\} (Exercise 13).
  3. Aisha buys weights of 45 grams and 75 grams for her apothecary balance. Which amounts can she balance with these alone? How does she balance 15 grams, and can she balance 100 grams?
  4. List the ideals of \mathbb{Z}_{45} with their sizes. Which contain \langle 9 \rangle?
  5. Show that \langle 6, 10 \rangle = \mathbb{Z}_{45}, though neither 6 nor 10 is a unit of \mathbb{Z}_{45}.

Computing in quotient rings

  1. Let I = \langle 2 \rangle in \mathbb{Z}[i]. Show that a + bi \in I exactly when a and b are even, list the cosets, and show (1 + i) + I is nonzero with square 0 + I.
  2. In \mathbb{Q}[x]/\langle x^2 - 2 \rangle each coset has one representative a + bx, as in Example 5. Compute (3 + x + I)(1 - 2x + I) and the inverse of 1 + x + I.
  3. In \mathbb{R}[x]/\langle x^2 \rangle, show x + I \ne 0 + I but (x + I)^2 = 0 + I, and find the inverse of 3 + 2x + I.
  4. Find the ideal N of nilpotent elements of \mathbb{Z}_{200} (Example 6) and the size of \mathbb{Z}_{200}/N.

Proofs

  1. Let R be commutative and a \in R. Prove that \{r \in R : ra = 0\} is an ideal, and find it for a = 6 in \mathbb{Z}_{30}.
  2. Let I, J be ideals of R. Prove that I \cap J and I + J are ideals, and that \langle a \rangle + \langle b \rangle = \langle a, b \rangle when R is commutative.
  3. Prove that R/I is commutative if and only if ab - ba \in I for all a, b \in R.
  4. Let F be a field. Prove that the only ideals of F \times F are \{0\} \times \{0\}, F \times \{0\}, \{0\} \times F and F \times F.
  5. Let R be commutative and I an ideal. Prove that \displaystyle \sqrt{I} = \{a \in R : a^k \in I \text{ for some } k \ge 1\} is an ideal containing I.
  6. Prove that the only ideals of M_2(\mathbb{R}) are \{0\} and M_2(\mathbb{R}).
Answers
  1. (a) Yes: differences stay in it, and (r, s)(a, b) = (ra, sb) with 4 \mid ra, 6 \mid sb. (b) No: it holds i, but i \cdot i = -1 has odd real part. (c) No: it holds the unit 1 of \mathbb{Q} (Theorem 2); \displaystyle \frac{1}{2} \cdot 1 \notin \mathbb{Z}. (d) Yes: an additive subgroup of \mathbb{Z}_{20}, hence an ideal (Example 2).
  2. 2\mathbb{Z} \cup 3\mathbb{Z} holds 3 and 2 but not 3 - 2 = 1.
  3. (a) \langle 12 \rangle: 120 = 84 + 36, 84 = 2 \cdot 36 + 12, 36 = 3 \cdot 12, and 12 = 84 - 2 \cdot 36 = 3 \cdot 84 - 2 \cdot 120. (b) \langle 1 \rangle = \mathbb{Z}, as 1 = 6 + 10 - 15 lies in it (Theorem 2).
  4. n = 36: the common multiples of 12 = 2^2 \cdot 3 and 18 = 2 \cdot 3^2 are the multiples of 36. m = 6: the sum is \langle 12, 18 \rangle = \langle 6 \rangle by Theorem 5.
  5. The multiples of 15 grams, as \langle 45, 75 \rangle = \langle 15 \rangle. Since 15 = 2 \cdot 45 - 75, two 45 gram weights go against the powder and the 75 gram weight beside it. Not 100, as 100 = 6 \cdot 15 + 10.
  6. One per divisor of 45 (Example 2): \langle 1 \rangle (45), \langle 3 \rangle (15), \langle 5 \rangle (9), \langle 9 \rangle (5), \langle 15 \rangle (3), \langle 0 \rangle (1). Those with d \mid 9 contain \langle 9 \rangle: \langle 1 \rangle, \langle 3 \rangle, \langle 9 \rangle.
  7. \gcd(6, 45) = 3 and \gcd(10, 45) = 5, so neither is a unit (Rings and integral domains, Corollary 8). The ideal holds 10 - 6 = 4, 6 - 4 = 2 and 23 \cdot 2 = 46 = 1; explicitly [1] = [6] + [22][10], as 6 + 220 = 226 = 5 \cdot 45 + 1. By Theorem 2 it is \mathbb{Z}_{45}.
  8. 2(c + di) = 2c + 2di. A coset is fixed by the parities of a, b: 0 + I, 1 + I, i + I, (1 + i) + I. And 1 + i \notin I while (1 + i)^2 = 2i \in I.
  9. x^2 + I = 2 + I, and (3 + x)(1 - 2x) = 3 - 5x - 2x^2, giving -1 - 5x + I. As (1 + x)(-1 + x) = x^2 - 1, which is 1 mod I, the inverse is -1 + x + I.
  10. A nonzero multiple of x^2 has degree at least 2, so x \notin I; x^2 \in I. The inverse is \displaystyle \frac{1}{3} - \frac{2}{9}x + I: the product is \displaystyle 1 - \frac{4}{9}x^2, which is 1 mod I.
  11. 200 = 2^3 \cdot 5^2. If 200 \mid a^k, then 2 \mid a and 5 \mid a; conversely (10m)^3 = 1000m^3 = 5 \cdot 200m^3. So N = \langle 10 \rangle, with 20 elements, and the quotient has 200/20 = 10 elements.
  12. Proof. Call the set A. 0a = 0; if ra = 0 = sa, then (r - s)a = 0; and (tr)a = t(ra) = 0. By Theorem 1, A is an ideal. \square In \mathbb{Z}_{30}, 30 \mid 6r exactly when 5 \mid r: A = \langle 5 \rangle = \{0, 5, 10, 15, 20, 25\}.
  13. Proof. I \cap J is an additive subgroup (Subgroups, Theorem 6), and ra, ar lie in both. For I + J: 0 = 0 + 0, (a + b) - (a' + b') = (a - a') + (b - b'), r(a + b) = ra + rb and (a + b)r = ar + br. For commutative R, ra + sb is the general element of both \langle a \rangle + \langle b \rangle and \langle a, b \rangle. \square
  14. Proof. (a + I)(b + I) = (b + I)(a + I) means ab + I = ba + I, that is, ab - ba \in I. Every coset is some a + I, so this for all a, b is commutativity of R/I. \square
  15. Proof. These four are ideals. Let I be an ideal. If (a, b) \in I with a \ne 0, then (a^{-1}, 0)(a, b) = (1, 0) \in I, so F \times \{0\} \subseteq I; likewise b \ne 0 gives \{0\} \times F \subseteq I. If both happen, I holds all sums, so I = F \times F. If only one does, I is F \times \{0\} or \{0\} \times F; if neither, I = \{(0, 0)\}. \square
  16. Proof. By Theorem 6, (a + I)^k = a^k + I, so \displaystyle a \in \sqrt{I} exactly when a + I is nilpotent in R/I. By Example 6 these nilpotents form an ideal N'. If \displaystyle a, b \in \sqrt{I} and r \in R, then (a - b) + I and (r + I)(a + I) = ra + I lie in N', so a - b and ra lie in \displaystyle \sqrt{I}, as does 0. Each a \in I has a^1 \in I. \square
  17. Proof. Let E_{ij} have 1 in row i, column j and 0 elsewhere; E_{ij}E_{kl} is E_{il} if j = k and 0 otherwise, so E_{ik}AE_{lj} = a_{kl}E_{ij} for A = (a_{pq}). If A \ne 0 lies in an ideal J, pick a_{kl} \ne 0. By (I2), E_{ij} = (a_{kl}^{-1}I_2)E_{ik}AE_{lj} \in J for all i, j, so I_2 = E_{11} + E_{22} \in J and J = M_2(\mathbb{R}) by Theorem 2. \square
math.wiki · updated 2026-11-17 · CC-BY-SA-4.0