math.wiki
Abstract algebra › Rings › Rings and integral domains
Sign in

Rings and integral domains

The integers, the integers mod n, the Gaussian integers and the square matrices can all be added and multiplied. Which rules do they share, and when may a nonzero factor be canceled from both sides of an equation?

Where you are 4 in Rings

Why this exists

A group has one operation. The integers, \mathbb{Z}_n, polynomials and square matrices carry two, tied together by the distributive law. Solving x^2 - 5x + 6 = 0 by writing (x - 2)(x - 3) = 0 uses the rule that a product is zero only when a factor is. A ring records the rules these systems share, and that last rule is not among them: in \mathbb{Z}_{15}, 3 \cdot 5 = 0. The rings where it holds, the integral domains, are exactly the commutative rings in which a nonzero factor may be canceled.

Definition

A ring is a set R with two binary operations (Binary operations and the group axioms), addition a + b and multiplication ab, such that:

  • (R1) (R, +) is an abelian group, with identity 0 and the inverse of a written -a;
  • (R2) multiplication is associative: (ab)c = a(bc);
  • (R3) there is an element 1 \in R with 1a = a1 = a for all a \in R;
  • (R4) the distributive laws hold: a(b + c) = ab + ac and (a + b)c = ac + bc.

The ring is commutative if ab = ba for all a, b. Write a - b for a + (-b), and, as in any additive group, na = a + \dots + a (n terms) for a positive integer n, 0a = 0 and (-n)a = -(na). The ring \{0\}, in which 1 = 0, is the zero ring.

Convention. In this course every ring has a 1, and a subring must contain it. Some texts do not require a 1. So here the even integers 2\mathbb{Z}, though closed under both operations, are not a subring of \mathbb{Z}; they are an ideal (Ideals and quotient rings).

A subring of R is a subset that contains the 1 of R and is a ring under the operations of R. An element u is a unit if uv = vu = 1 for some v \in R; this v is unique (Theorem 2 of Binary operations and the group axioms) and written u^{-1}. The units form R^\times. A nonzero a \in R is a zero divisor if ab = 0 or ba = 0 for some nonzero b \in R.

An integral domain is a commutative ring with 1 \ne 0 and no zero divisors: ab = 0 implies a = 0 or b = 0. A field is a commutative ring with 1 \ne 0 in which every nonzero element is a unit. The characteristic \operatorname{char} R is the least positive integer n with n1 = 0, or 0 if there is none.

The integers form an integral domain, and \mathbb{Q}, \mathbb{R}, \mathbb{C} are fields, all of characteristic 0. By Theorems 1 and 2 of Integers mod n, symmetries and matrices as groups, \mathbb{Z}_n is a commutative ring, of characteristic n. The Gaussian integers \mathbb{Z}[i] = \{a + bi : a, b \in \mathbb{Z}\} lie in \mathbb{C} (Complex numbers), with norm N(z) = a^2 + b^2 = z\bar z for z = a + bi.

For rings R and S, the product ring R \times S (Cartesian product) has (a, b) + (c, d) = (a + c, b + d) and (a, b)(c, d) = (ac, bd); each axiom holds in each coordinate, so it is a ring with 1 = (1, 1). For a commutative ring R, the matrix ring M_n(R) is the set of n \times n matrices over R under the usual operations (Matrix multiplication), with identity I_n; the proofs of the axioms for real matrices use only the ring axioms of the entries.

Intuition

The ring axioms are the rules of school algebra without commutativity of multiplication and without division. Whether a product of nonzero elements can be 0 sorts the rings below.

Rings
M_2(\mathbb{R}),\ M_2(\mathbb{Z}_2)
Commutative rings
\mathbb{Z}_{15},\ \mathbb{Z}_4 \times \mathbb{Z}_6,\ \mathcal{P}(X)
Integral domains
\displaystyle \mathbb{Z},\ \mathbb{Z}[i],\ \mathbb{Z}[\sqrt{2}]
Fields
\mathbb{Q},\ \mathbb{R},\ \mathbb{C},\ \mathbb{Z}_7
Figure 1Every field is an integral domain, every integral domain is a commutative ring, and every commutative ring is a ring. Each box lists rings that belong to it but to no box inside it.

A unit and a zero divisor are opposite kinds of element: a unit can be canceled, a zero divisor sends some nonzero element to 0. No element is both (Theorem 2). In a finite commutative ring every nonzero element is one or the other (Exercise 12), but in \mathbb{Z} the element 2 is neither.

Results

Throughout, R is a ring.

Theorem 1 (rules of signs). For all a, b \in R: a0 = 0a = 0; a(-b) = (-a)b = -(ab); (-a)(-b) = ab; and (-1)a = -a. If 1 = 0, then R is the zero ring.

Theorem 2 (units). R^\times is a group under multiplication, and no unit is a zero divisor.

Theorem 3 (subring test). A subset S \subseteq R is a subring if and only if 1 \in S, and a - b \in S and ab \in S for all a, b \in S.

Theorem 4 (cancellation). A commutative ring R with 1 \ne 0 is an integral domain if and only if, for all a, b, c \in R, ab = ac and a \ne 0 imply b = c.

Theorem 5 (fields are domains). Every field is an integral domain.

Corollary 6 (subrings of domains). A subring of an integral domain, in particular of a field, is an integral domain.

Theorem 7 (finite domains). A finite integral domain is a field.

Corollary 8 (the integers mod n). Let n \ge 2. A nonzero class [a] \in \mathbb{Z}_n is a unit if \gcd(a, n) = 1 and a zero divisor otherwise. Hence \mathbb{Z}_n is an integral domain if and only if it is a field, if and only if n is prime.

Theorem 9 (characteristic). If \operatorname{char} R = n > 0, then na = 0 for every a \in R, and n is the least positive integer with this property. The characteristic of an integral domain is 0 or a prime.

Why it is true

Proof of Theorem 1. By (R4), a0 = a(0 + 0) = a0 + a0, and adding -(a0) gives a0 = 0; likewise 0a = 0. Next, ab + a(-b) = a(b + (-b)) = a0 = 0, so a(-b) is an additive inverse of ab, and inverses in a group are unique: a(-b) = -(ab). In the same way (-a)b = -(ab). Then (-a)(-b) = -(a(-b)) = -(-(ab)) = ab, and (-1)a = -(1a) = -a. If 1 = 0, every a satisfies a = 1a = 0a = 0. \square

Proof of Theorem 2. First, 1 \in R^\times. If u, v \in R^\times, then (uv)(v^{-1}u^{-1}) = u(vv^{-1})u^{-1} = 1 and likewise (v^{-1}u^{-1})(uv) = 1, so uv \in R^\times; and u^{-1} \in R^\times, with inverse u. Multiplication is associative on R, hence on R^\times, so R^\times is a group. If u is a unit and ub = 0, then b = u^{-1}(ub) = u^{-1}0 = 0 by Theorem 1; if bu = 0, then b = (bu)u^{-1} = 0. \square

Proof of Theorem 3. A subring contains 1 and is closed under subtraction and multiplication. Conversely, suppose the conditions hold. Then 0 = 1 - 1 \in S, -b = 0 - b \in S and a + b = a - (-b) \in S, so S is closed under addition and contains 0 and every additive inverse. Associativity, commutativity of addition and the distributive laws hold for all elements of R, hence for those of S. So S is a ring under the operations of R containing 1. \square

Proof of Theorem 4. Let R be a domain, ab = ac and a \ne 0. By (R4) and Theorem 1, a(b - c) = ab - ac = 0, so b - c = 0. Conversely, if cancellation holds and ab = 0 with a \ne 0, then ab = a0, so b = 0. \square

Proof of Theorem 5. A field is commutative with 1 \ne 0, and each nonzero element is a unit, hence not a zero divisor by Theorem 2. \square

Proof of Corollary 6. Let S be a subring of a domain D. Then S is commutative, its 1 is the 1 \ne 0 of D, and a product of nonzero elements of S is a product in D, so it is nonzero. A field is a domain by Theorem 5. \square

Proof of Theorem 7. Let D be a finite domain and a \ne 0. The map x \mapsto ax from D to D is injective by Theorem 4. An injective map from a finite set to itself is surjective (Result 3 of One-to-one, onto and bijective functions), so ab = 1 for some b, and ba = ab = 1. \square

Proof of Corollary 8. By Theorem 2 of Integers mod n, symmetries and matrices as groups, [a] is a unit when \gcd(a, n) = 1. If d = \gcd(a, n) > 1 and [a] \ne 0, put b = n/d; then 0 < b < n, so [b] \ne 0, and ab = (a/d)n \equiv 0 \pmod{n} since d \mid a. So [a] is a zero divisor. If n is prime, every nonzero class has \gcd(a, n) = 1, so \mathbb{Z}_n is a field, and a domain by Theorem 5. If not, n = rs with 1 < r, s < n, and [r][s] = 0 with both factors nonzero. \square

Proof of Theorem 9. For a positive integer m, (R4) gives (m1)a = (1 + \dots + 1)a = a + \dots + a = ma. So na = (n1)a = 0a = 0; and if m > 0 with ma = 0 for every a, then m1 = 0, so m \ge n. Now let D be a domain with \operatorname{char} D = n > 0. As 1 \ne 0, n \ge 2. If n = rs with 1 < r, s < n, then expanding by (R4), (r1)(s1) is a sum of rs terms 1 \cdot 1, so (r1)(s1) = n1 = 0. As D has no zero divisors, r1 = 0 or s1 = 0, against the choice of n as least. So n is prime. \square

Worked examples

Example 1

The ring \mathbb{Z}_{15}

Sort the nonzero elements of \mathbb{Z}_{15} into units and zero divisors, with a partner for each zero divisor. Then solve x^2 = x in \mathbb{Z}_{15}.

Solution

By Corollary 8 the units are the classes prime to 15: 1, 2, 4, 7, 8, 11, 13, 14, eight of them, as \varphi(15) = 8. The rest, 3, 5, 6, 9, 10, 12, are zero divisors. Each multiple of 3 times 5, and each multiple of 5 times 3, is a multiple of 15. The count checks: 8 + 6 + 1 = 15.

The equation x^2 = x says x(x - 1) = 0. In a domain that forces x = 0 or x = 1; here the factors may be zero divisors. Now 15 \mid x(x - 1) exactly when 3 divides x or x - 1 and 5 divides x or x - 1, since a prime that divides a product divides a factor (Every number has exactly one prime factorization). Among 0, \dots, 14, the condition at 5 leaves 0, 1, 5, 6, 10, 11, and the condition at 3 keeps x = 0, 1, 6, 10. Check: 6^2 = 36 \equiv 6 and 10^2 = 100 \equiv 10: four roots of a quadratic, impossible in a domain.

Example 2

The Gaussian integers

Show that \mathbb{Z}[i] is an integral domain, find \mathbb{Z}[i]^\times, and show that \mathbb{Z}[i] is not a field.

Solution

We use Theorem 3 in \mathbb{C}: 1 = 1 + 0i lies in \mathbb{Z}[i], (a + bi) - (c + di) = (a - c) + (b - d)i, and, as i^2 = -1,

(a + bi)(c + di) = (ac - bd) + (ad + bc)i,

with integer parts. So \mathbb{Z}[i] is a subring of the field \mathbb{C}, and an integral domain by Corollary 6.

For the units, multiplying out shows \overline{zw} = \bar z\,\bar w, so N(zw) = zw\,\bar z\,\bar w = N(z)N(w). If zw = 1 in \mathbb{Z}[i], then N(z)N(w) = N(1) = 1, and as norms are nonnegative integers, N(z) = 1. So a^2 + b^2 = 1 for z = a + bi, which forces (a, b) = (\pm 1, 0) or (0, \pm 1). Conversely 1 \cdot 1 = (-1)(-1) = 1 and i(-i) = 1. So

\mathbb{Z}[i]^\times = \{1, -1, i, -i\}.

The element 2 is nonzero with N(2) = 4 \ne 1, so it is not a unit, and \mathbb{Z}[i] is not a field. It is infinite, so Theorem 7 does not apply.

Example 3

A product ring

Let R = \mathbb{Z}_4 \times \mathbb{Z}_6. Find R^\times, the number of zero divisors, and \operatorname{char} R.

Solution

(a, b)(c, d) = (1, 1) means ac = 1 in \mathbb{Z}_4 and bd = 1 in \mathbb{Z}_6, so (a, b) is a unit exactly when a and b are: R^\times = \{1, 3\} \times \{1, 5\}, with 4 elements.

Every other nonzero element is a zero divisor. If (a, b) \ne 0 is not a unit, one coordinate, say a, is not a unit of \mathbb{Z}_4, so by Corollary 8 either a = 0 or a is a zero divisor. Either way ac = 0 for some c \ne 0, and (a, b)(c, 0) = (0, 0). The second coordinate works the same way. For instance (2, 3)(2, 2) = (4, 6) = (0, 0). That makes 24 - 4 - 1 = 19 zero divisors.

Last, m(1, 1) = ([m]_4, [m]_6) is zero exactly when 4 \mid m and 6 \mid m, that is, when \operatorname{lcm}(4, 6) = 12 divides m. So \operatorname{char} R = 12.

Example 4

Orders at a taqueria

At a taqueria the toppings are X = \{c, o, \ell, s\} (cilantro, onion, lime, salsa), and an order is a subset of X. For orders A and B let A + B = (A \setminus B) \cup (B \setminus A), the toppings on exactly one of them, and AB = A \cap B, the toppings on both. Show that the set \mathcal{P}(X) of the 16 orders is a commutative ring, and find its units, zero divisors and characteristic. Kofi orders K = \{c, o, s\} and Yuna orders Y = \{o, \ell\}; find K + Y, KY, and the Z with K + Z = Y.

Solution

Match each order A with its indicator \chi_A : X \to \mathbb{Z}_2, equal to 1 exactly on the toppings in A; this is a bijection onto the functions X \to \mathbb{Z}_2. A topping is on exactly one of A, B when \chi_A + \chi_B = 1 there, and on both when \chi_A\chi_B = 1 there, so

\chi_{A + B} = \chi_A + \chi_B, \qquad \chi_{AB} = \chi_A\chi_B,

computed topping by topping. With these pointwise operations the functions form a commutative ring, since each axiom holds at every topping because it holds in \mathbb{Z}_2. So \mathcal{P}(X) is a commutative ring with 0 = \varnothing and 1 = X.

Every order has A + A = \varnothing and AA = A, so \operatorname{char} \mathcal{P}(X) = 2. If AB = X, then A = X: X is the only unit. Every other nonempty A is a zero divisor, as A(X \setminus A) = \varnothing: there are 16 - 2 = 14 of them.

Finally K + Y = \{c, \ell, s\}, the toppings that differ, and KY = \{o\}. Since -K = K, adding K to both sides of K + Z = Y gives Z = K + Y = \{c, \ell, s\}.

Example 5

When every element is its own square

Prove that if a^2 = a for every element a of a ring R, then 2a = 0 for every a and R is commutative.

Solution

Proof. By (R4), a + a = (a + a)^2 = a^2 + a^2 + a^2 + a^2 = 4a, and subtracting 2a gives 2a = 0, so -x = x for every x \in R. Next, for a, b \in R,

\begin{aligned} a + b &= (a + b)^2 = a^2 + ab + ba + b^2 \\ &= a + ab + ba + b, \end{aligned}

so ab + ba = 0, and ab = -(ba) = ba. \square

The ring of Example 4 is of this kind, and so is \mathbb{Z}_2.

Example 6

A field with 25 elements

In M_2(\mathbb{Z}_5) let J = \begin{pmatrix} 0 & 2 \\ 1 & 0 \end{pmatrix} and L = \{aI_2 + bJ : a, b \in \mathbb{Z}_5\}. Show that L is a field, and invert I_2 + J.

Solution

Mod 5, J^2 = \begin{pmatrix} 2 & 0 \\ 0 & 2 \end{pmatrix} = 2I_2. As aI_2 + bJ = \begin{pmatrix} a & 2b \\ b & a \end{pmatrix}, L has 25 elements. It contains I_2 and (aI_2 + bJ) - (cI_2 + dJ) = (a - c)I_2 + (b - d)J, and, using J^2 = 2I_2,

\begin{aligned} &(aI_2 + bJ)(cI_2 + dJ) \\ &\quad = (ac + 2bd)I_2 + (ad + bc)J, \end{aligned}

which lies in L and is unchanged when (a, b) and (c, d) trade places. By Theorem 3, L is a commutative subring, with I_2 \ne 0.

Taking (c, d) = (a, -b) gives (aI_2 + bJ)(aI_2 - bJ) = \delta I_2 with \delta = a^2 - 2b^2. If \delta = 0 and b \ne 0, then (ab^{-1})^2 = 2, but the squares in \mathbb{Z}_5 are 0, 1, 4; if b = 0, then a^2 = 0 forces a = 0. So each nonzero element has inverse \delta^{-1}(aI_2 - bJ) \in L, and L is a field of 25 elements and characteristic 5, unlike \mathbb{Z}_{25}, where 5 \cdot 5 = 0. For I_2 + J, \delta = 4 = 4^{-1}, so the inverse is 4I_2 - 4J = 4I_2 + J; indeed (I_2 + J)(4I_2 + J) = 4I_2 + 5J + J^2 = 6I_2 = I_2.

Boundaries

  • In a noncommutative ring a product of nonzero elements can be 0 in one order only (Exercise 6).
  • Theorem 7 needs finiteness: \mathbb{Z} is a domain and not a field.
  • If every nonzero element is a unit but multiplication does not commute, the ring is a division ring, such as Hamilton’s quaternions; it is not a field.

Where this goes next

The even integers are the model of an ideal, and an ideal I gives a quotient ring R/I. Maps that respect both operations are Ring homomorphisms. For a field F, the polynomial ring F[x] is an integral domain with a division algorithm, and the norm gives \mathbb{Z}[i] one too (Euclidean domains and principal ideal domains). Example 6 and Exercise 10 build Finite fields beyond \mathbb{Z}_p.

Exercises

Units, zero divisors and characteristic

  1. List the units and the zero divisors of \mathbb{Z}_{18}, with a partner for each zero divisor.
  2. Solve x^2 = x and x^2 = 1 in \mathbb{Z}_{21}.
  3. In \mathbb{Z}_{20}, find the inverse of 7 and every nonzero b with 6b = 0.
  4. An element a is nilpotent if a^k = 0 for some positive integer k. Find the nilpotent elements of \mathbb{Z}_{24}.
  5. In \mathbb{Z}_5 \times \mathbb{Z}_8, count the units and the zero divisors, find the characteristic, and solve (2, 3)x = (1, 1).
  6. In M_2(\mathbb{R}) let P = \begin{pmatrix} 1 & 2 \\ 2 & 4 \end{pmatrix} and Q = \begin{pmatrix} 2 & -4 \\ -1 & 2 \end{pmatrix}. Compute PQ and QP. What do they show?

Subrings and other rings

  1. Which are subrings? (a) \displaystyle \{a + b\sqrt{3} : a, b \in \mathbb{Z}\} in \mathbb{R}; (b) \displaystyle \{a + b\sqrt[3]{2} : a, b \in \mathbb{Z}\} in \mathbb{R}; (c) the matrices \begin{pmatrix} a & b \\ 0 & a \end{pmatrix} with a, b \in \mathbb{R}, in M_2(\mathbb{R}). For (c), find the units and the zero divisors.
  2. In \displaystyle \mathbb{Z}[\sqrt{2}] = \{a + b\sqrt{2} : a, b \in \mathbb{Z}\}, show that \displaystyle 3 + 2\sqrt{2} is a unit, that \displaystyle \mathbb{Z}[\sqrt{2}]^\times is infinite, and that \displaystyle \sqrt{2} is not a unit.
  3. In \mathbb{Z}[i], compute (2 + 3i)(4 - i) and check that the norm of the product is the product of the norms. Is 1 + 2i a unit? Is 3 a zero divisor?
  4. Let K_p be the set of matrices \begin{pmatrix} a & -b \\ b & a \end{pmatrix} in M_2(\mathbb{Z}_p). Show that K_3 is a field with 9 elements, and that K_5 is not an integral domain.
  5. Refute with a counterexample in \mathbb{Z}_{14}: if ab = ac and a \ne 0 in a commutative ring, then b = c.

Proofs

  1. Prove that every nonzero element of a finite commutative ring is a unit or a zero divisor.
  2. Prove that in an integral domain the only solutions of x^2 = x are 0, 1 and the only solutions of x^2 = 1 are \pm 1. Compare Exercise 2.
  3. Let R be commutative and a nilpotent. Prove that 1 - a is a unit, and that 0 is the only nilpotent element of an integral domain.
  4. Let R be a commutative ring of prime characteristic p. Prove that (a + b)^p = a^p + b^p for all a, b \in R.
  5. For rings R and S, prove that (R \times S)^\times = R^\times \times S^\times, and that if neither is the zero ring, R \times S is not an integral domain.
Answers
  1. Units: 1, 5, 7, 11, 13, 17, the classes prime to 18. Zero divisors: 2, 3, 4, 6, 8, 9, 10, 12, 14, 15, 16. Each even one times 9 is a multiple of 18, and so are 3 \cdot 6, 9 \cdot 2, 15 \cdot 6. Count: 6 + 11 + 1 = 18.
  2. x^2 = x: x = 0, 1, 7, 15. x^2 = 1: x = 1, 8, 13, 20. As in Example 1: x \equiv 0 or 1 (for x^2 = 1, x \equiv \pm 1) modulo the primes 3 and 7.
  3. 7^{-1} = 3, as 21 \equiv 1. And 20 \mid 6b exactly when 10 \mid 3b, exactly when 10 \mid b: only b = 10.
  4. 0, 6, 12, 18. If 24 \mid a^k, then 2 \mid a and 3 \mid a, so 6 \mid a; conversely 6^3 = 216 = 9 \cdot 24, 12^2 = 144 = 6 \cdot 24 and 18^3 = 5832 = 243 \cdot 24.
  5. Units: pairs of units, 4 \cdot 4 = 16. Zero divisors: 40 - 16 - 1 = 23, by the argument of Example 3. Characteristic \operatorname{lcm}(5, 8) = 40. And x = (2^{-1}, 3^{-1}) = (3, 3), as 2 \cdot 3 \equiv 1 \pmod 5 and 3 \cdot 3 \equiv 1 \pmod 8.
  6. PQ = \begin{pmatrix} 0 & 0 \\ 0 & 0 \end{pmatrix} and QP = \begin{pmatrix} -6 & -12 \\ 3 & 6 \end{pmatrix}. So P and Q are zero divisors, M_2(\mathbb{R}) is not commutative, and a product can vanish in one order only.
  7. (a) Yes: it contains 1, and \displaystyle (a + b\sqrt{3})(c + d\sqrt{3}) is \displaystyle (ac + 3bd) + (ad + bc)\sqrt{3}. (b) No: \displaystyle \sqrt[3]{2} \cdot \sqrt[3]{2} = \sqrt[3]{4} is not in it. If \displaystyle \sqrt[3]{4} = a + b\sqrt[3]{2}, multiplying by \displaystyle \sqrt[3]{2} gives \displaystyle 2 = ab + (a + b^2)\sqrt[3]{2}; as \displaystyle \sqrt[3]{2} is irrational, a = -b^2 and ab = 2, so b^3 = -2, with no integer solution. (c) Yes: it contains I_2, is closed under subtraction, and the product of \begin{pmatrix} a & b \\ 0 & a \end{pmatrix} and \begin{pmatrix} c & d \\ 0 & c \end{pmatrix} is \begin{pmatrix} ac & ad + bc \\ 0 & ac \end{pmatrix}. Units: a \ne 0, with inverse \begin{pmatrix} a^{-1} & -ba^{-2} \\ 0 & a^{-1} \end{pmatrix}. Zero divisors: a = 0, b \ne 0, since \begin{pmatrix} 0 & b \\ 0 & 0 \end{pmatrix}^2 = 0.
  8. \displaystyle (3 + 2\sqrt{2})(3 - 2\sqrt{2}) = 9 - 8 = 1. Its powers are units (Theorem 2), and since \displaystyle u = 3 + 2\sqrt{2} > 1, the real numbers u, u^2, u^3, \dots increase strictly, so they are distinct. If \displaystyle \sqrt{2}(a + b\sqrt{2}) = 2b + a\sqrt{2} = 1, then a = 0, as \displaystyle \sqrt{2} is irrational, and 2b = 1, impossible.
  9. (2 + 3i)(4 - i) = 11 + 10i, and N(11 + 10i) = 221 = 13 \cdot 17, which is N(2 + 3i)N(4 - i). N(1 + 2i) = 5 \ne 1, so 1 + 2i is not a unit (Example 2). 3 is not a zero divisor: \mathbb{Z}[i] is a domain.
  10. Write M(a, b) for the matrix. M(a, b) - M(c, d) = M(a - c, b - d) and M(a, b)M(c, d) = M(ac - bd, ad + bc), symmetric in the two factors, and I_2 = M(1, 0): K_p is a commutative subring with p^2 elements. \det M(a, b) = a^2 + b^2. Squares mod 3 are 0 and 1, so a^2 + b^2 \equiv 0 only for a = b = 0, and a nonzero M(a, b) has inverse \delta^{-1}M(a, -b), \delta = a^2 + b^2, again in K_3. In K_5, M(2, 1)M(2, -1) = M(5, 0) = 0.
  11. 2 \cdot 3 = 6 and 2 \cdot 10 = 20 \equiv 6, yet 3 \ne 10: 2 is a zero divisor.
  12. Proof. Let a \ne 0 in a finite commutative ring R, and \lambda(x) = ax. If \lambda is injective, it is surjective (Result 3 of One-to-one, onto and bijective functions), so ab = 1 for some b, and a is a unit. If not, ax = ay with x \ne y, and a(x - y) = 0 with x - y \ne 0. \square
  13. Proof. If x^2 = x, then x(x - 1) = 0, so x = 0 or x = 1. If x^2 = 1, then by commutativity (x - 1)(x + 1) = x^2 - 1 = 0, so x = 1 or x = -1. \square In \mathbb{Z}_{21} each has four solutions, so \mathbb{Z}_{21} is not a domain.
  14. Proof. Let a^k = 0. The sum telescopes: (1 - a)(1 + a + \dots + a^{k - 1}) = 1 - a^k = 1, so 1 - a is a unit. In a domain, let k be least with a^k = 0. If k \ge 2, then a \cdot a^{k - 1} = 0 with a^{k - 1} \ne 0 forces a = 0, against the choice of k. So k = 1 and a = 0. \square
  15. Proof. The binomial theorem (The binomial theorem) holds in a commutative ring, by the same induction as for numbers: (a + b)^p = \sum_{k=0}^{p} \binom{p}{k} a^k b^{p - k}. For 0 < k < p, p divides p! = \binom{p}{k} k!(p - k)! but no factor of k!(p - k)!, so p \mid \binom{p}{k}; write \binom{p}{k} = pm. Then \binom{p}{k}a^kb^{p-k} = m\bigl(p\,a^kb^{p-k}\bigr) = 0 by Theorem 9. Only a^p + b^p remains. \square
  16. Proof. (a, b)(c, d) = (1, 1) = (c, d)(a, b) exactly when ac = ca = 1 and bd = db = 1, so (a, b) is a unit exactly when a \in R^\times and b \in S^\times. If 1 \ne 0 in both, then (1, 0) and (0, 1) are nonzero with (1, 0)(0, 1) = (0, 0). \square
math.wiki · updated 2026-11-17 · CC-BY-SA-4.0