This sheet introduces rings—algebraic structures with two operations: addition and multiplication. Rings generalize the integers and provide the foundation for field theory and algebraic geometry.

Commentary. Where groups model symmetry, rings model algebraic systems where we can both add and multiply. The integers Z\mathbb{Z} are the prototypical ring. By abstracting the properties of Z\mathbb{Z}, we obtain structures that appear throughout mathematics: polynomials, matrices, functions, and number systems.


Definition of a Ring#

Definition 7.1. A ring is a set RR together with two binary operations ++ and ⋅\cdot (called addition and multiplication) such that:

  1. (R,+)(R, +) is an abelian group.
  2. Multiplication is associative: (a⋅b)⋅c=a⋅(b⋅c)(a \cdot b) \cdot c = a \cdot (b \cdot c).
  3. The distributive laws hold:
    • a⋅(b+c)=a⋅b+a⋅ca \cdot (b + c) = a \cdot b + a \cdot c
    • (a+b)⋅c=a⋅c+b⋅c(a + b) \cdot c = a \cdot c + b \cdot c

Definition 7.2. A ring is commutative if a⋅b=b⋅aa \cdot b = b \cdot a for all a,b∈Ra, b \in R.

Definition 7.3. A ring has unity (or is a ring with unity) if there exists an element 1∈R1 \in R such that 1⋅a=a⋅1=a1 \cdot a = a \cdot 1 = a for all a∈Ra \in R.

Definition 7.4. The zero ring is the ring with a single element 00, where 0+0=00 + 0 = 0 and 0⋅0=00 \cdot 0 = 0. In a nonzero ring, we require 1≠01 \neq 0.

Example 7.5. (Z,+,⋅)(\mathbb{Z}, +, \cdot) is a commutative ring with unity.

Example 7.6. (Q,+,⋅)(\mathbb{Q}, +, \cdot), (R,+,⋅)(\mathbb{R}, +, \cdot), (C,+,⋅)(\mathbb{C}, +, \cdot) are commutative rings with unity.

Example 7.7. (Zn,+,⋅)(\mathbb{Z}_n, +, \cdot) is a commutative ring with unity.

Example 7.8. The set Mn(R)M_n(\mathbb{R}) of n×nn \times n matrices with real entries, with matrix addition and multiplication, is a ring with unity. It is not commutative for n≥2n \geq 2.

Example 7.9. The set of all functions f:R→Rf: \mathbb{R} \to \mathbb{R}, with pointwise addition and multiplication, is a commutative ring with unity.

Example 7.10. The set 2Z2\mathbb{Z} of even integers with usual addition and multiplication is a commutative ring without unity.

Exercise 7.11. Verify that (Z,+,⋅)(\mathbb{Z}, +, \cdot) satisfies all ring axioms.

Exercise 7.12. Show that M2(Z)M_2(\mathbb{Z}) is a ring. Is it commutative? What is its unity?


Basic Properties of Rings#

Theorem 7.13. In any ring RR, for all a∈Ra \in R:a⋅0=0⋅a=0.a \cdot 0 = 0 \cdot a = 0.where zero is identity for (R,+)(R,+).

Theorem 7.14. In any ring RR, for all a,b∈Ra, b \in R:a⋅(−b)=−(a⋅b)=(−a)⋅b.a \cdot (-b) = -(a \cdot b) = (-a) \cdot b.

Theorem 7.15. In any ring RR, for all a,b∈Ra, b \in R:(−a)⋅(−b)=a⋅b.(-a) \cdot (-b) = a \cdot b.


Subrings#

Definition 7.18. A nonempty subset S⊆RS \subseteq R is a subring of RR if SS is closed under addition, subtraction, and multiplication. Equivalently, SS is a ring with the induced operations.

Theorem 7.19 (Subring Criterion). A nonempty subset S⊆RS \subseteq R is a subring iff for all a,b∈Sa, b \in S:a−b∈Sanda⋅b∈S.a - b \in S \quad \text{and} \quad a \cdot b \in S.

Example 7.20. Z⊆Q\mathbb{Z} \subseteq \mathbb{Q} is a subring.

Example 7.21. The set of diagonal matrices is a subring of Mn(R)M_n(\mathbb{R}).

Example 7.22. nZn\mathbb{Z} is a subring of Z\mathbb{Z}.

Exercise 7.23. Show that the set of upper triangular 2×22 \times 2 matrices is a subring of M2(R)M_2(\mathbb{R}).

Exercise 7.24. Let RR be a ring and a∈Ra \in R. Show that the set {n⋅a∣n∈Z}\{n \cdot a \mid n \in \mathbb{Z}\} is a subring of RR.


Units#

Definition 7.25. Let RR be a ring with unity. An element u∈Ru \in R is a unit if it has a multiplicative inverse, i.e., there exists v∈Rv \in R such that:uv=vu=1.uv = vu = 1.The set of all units of RR is denoted R×R^\times.

Theorem 7.26. R×R^\times is a group under multiplication.

Example 7.27. Z×={±1}\mathbb{Z}^\times = \{\pm 1\}.

Example 7.28. (Zn)×={a∈Zn∣gcd⁡(a,n)=1}(\mathbb{Z}_n)^\times = \{a \in \mathbb{Z}_n \mid \gcd(a, n) = 1\}.

Example 7.29. Q×=Q∖{0}\mathbb{Q}^\times = \mathbb{Q} \setminus \{0\}.

Exercise 7.30. Find the units of Z12\mathbb{Z}_{12}.

Exercise 7.31. Prove Theorem 7.26.


Integral Domains#

Definition 7.32. A nonzero commutative ring with unity is an integral domain if it has no zero divisors, i.e. :a⋅b=0  ⟹  a=0 or b=0.a \cdot b = 0 \implies a = 0 \text{ or } b = 0.

Definition 7.33. A nonzero element a∈Ra \in R is a zero divisor if there exists b≠0b \neq 0 such that a⋅b=0a \cdot b = 0 or b⋅a=0b \cdot a = 0.

Example 7.34. Z\mathbb{Z} is an integral domain.

Example 7.35. Zp\mathbb{Z}_p (where pp is prime) is an integral domain.

Example 7.36. Z6\mathbb{Z}_6 is not an integral domain since 2⋅3=02 \cdot 3 = 0.

Example 7.37. M2(R)M_2(\mathbb{R}) is not an integral domain (zero divisors exist).

Theorem 7.38. In an integral domain, the cancellation law holds:a≠0 and ab=ac  ⟹  b=c.a \neq 0 \text{ and } a b = a c \implies b = c.

Theorem 7.39. Every finite integral domain is a field.

Math Language: mapping!!

Exercise 7.40. Show that Z12\mathbb{Z}_{12} has zero divisors. Find all of them.

Exercise 7.41. Prove that in an integral domain, the only idempotent elements (elements satisfying a2=aa^2 = a) are 00 and 11.


Fields#

Definition 7.42. A field is a commutative ring with unity 1≠01 \neq 0 in which every nonzero element has a multiplicative inverse. Equivalently, R×=R∖{0}R^\times = R \setminus \{0\}.

Example 7.43. Q,R,C\mathbb{Q}, \mathbb{R}, \mathbb{C} are fields.

Example 7.44. Zp\mathbb{Z}_p (where pp is prime) is a field.

Example 7.45. Z\mathbb{Z} is not a field.

Theorem 7.46. Every field is an integral domain.

Theorem 7.47. Every finite integral domain is a field.

Exercise 7.48. Show that Q(2)={a+b2∣a,b∈Q}\mathbb{Q}(\sqrt{2}) = \{a + b\sqrt{2} \mid a, b \in \mathbb{Q}\} is a field.

Exercise 7.49. Prove Theorem 7.47.


The Field of Fractions#

Definition 7.50.0 (Frac(D)). Let D be an integral domain. Define an equivalence relation on D×(D∖{0})D × (D\setminus\{ 0 \}) by:(a,b)∼(c,d)  ⟺  ad=bc.(a, b) \sim (c, d) \iff ad = bc.Let F=(D×(D∖{0}))/∼F = (D \times (D \setminus \{0\})) / \sim be the set of equivalence classes. Denote the class of (a,b)(a, b) by a/ba/b or ab\frac{a}{b}.
Define:ab+cd=ad+bcbd,ab⋅cd=acbd.\frac{a}{b} + \frac{c}{d} = \frac{ad + bc}{bd}, \qquad \frac{a}{b} \cdot \frac{c}{d} = \frac{ac}{bd}.Then (F,+,⋅)(F, +, \cdot) is a field. It is called the field of fractions of DD, denoted Frac⁡(D)\operatorname{Frac}(D).

Theorem7.50.1 Let RR and SS be rings. An injective homomorphism φ:R→S\varphi:R\to S is called an embedding.)

Theorem 7.50.2 The map φ:D→Frac⁡(D)\varphi: D \to \operatorname{Frac}(D) defined by φ(a)=a/1\varphi(a) = a/1 is an embedding.

Theorem 7.50. Every integral domain DD can be embedded in a field F=Frac⁡(D)F = \operatorname{Frac}(D), called the field of fractions of DD. Every element of Frac⁡(D)\operatorname{Frac}(D) can be written as a/ba/b with a,b∈Da, b \in D, b≠0b \neq 0.

Example 7.51. Frac⁡(Z)=Q\operatorname{Frac}(\mathbb{Z}) = \mathbb{Q}.

Example 7.52. Frac⁡(F[x])=F(x)\operatorname{Frac}(F[x]) = F(x).

Exercise 7.53. Construct Frac⁡(Z[i])\operatorname{Frac}(\mathbb{Z}[i]) explicitly.


Characteristic of a Ring#

Definition 7.54. Let RR be a ring. If there exists a positive integer nn such that n⋅1=0n \cdot 1 = 0, the characteristic of RR, denoted char⁡(R)\operatorname{char}(R), is the smallest such nn. If no such nn exists, char⁡(R)=0\operatorname{char}(R) = 0.

Theorem 7.55. The characteristic of an integral domain is either 00 or a prime number.

Theorem 7.56. If char⁡(R)=n>0\operatorname{char}(R) = n > 0, then n⋅a=0n \cdot a = 0 for all a∈Ra \in R.

Example 7.57. char⁡(Z)=0\operatorname{char}(\mathbb{Z}) = 0, char⁡(Zp)=p\operatorname{char}(\mathbb{Z}_p) = p, char⁡(Q)=0\operatorname{char}(\mathbb{Q}) = 0.

Example 7.58. char⁡(Z6)=6\operatorname{char}(\mathbb{Z}_6) = 6 (not an integral domain).

Exercise 7.59. What is the characteristic of Z2×Z3\mathbb{Z}_2 \times \mathbb{Z}_3? Of Z2×Z2\mathbb{Z}_2 \times \mathbb{Z}_2?

Exercise 7.60. Prove Theorem 7.55.


Ring Homomorphisms and Isomorphisms#

Definition 7.61. Let R,SR, S be rings. A function φ:R→S\varphi: R \to S is a ring homomorphism if for all a,b∈Ra, b \in R:φ(a+b)=φ(a)+φ(b),φ(a⋅b)=φ(a)⋅φ(b).\varphi(a + b) = \varphi(a) + \varphi(b), \quad \varphi(a \cdot b) = \varphi(a) \cdot \varphi(b).

Definition 7.62. A ring isomorphism is a bijective ring homomorphism. We write R≅SR \cong S if such an isomorphism exists.

Definition 7.63. The kernel of a ring homomorphism φ:R→S\varphi: R \to S is:ker⁡φ={a∈R∣φ(a)=0S}.\ker \varphi = \{a \in R \mid \varphi(a) = 0_S\}.

Theorem 7.64. If φ:R→S\varphi: R \to S is a ring homomorphism, then ker⁡φ\ker \varphi is a subring of RR.

Theorem 7.65. A ring homomorphism φ:R→S\varphi: R \to S is injective iff ker⁡φ={0}\ker \varphi = \{0\}.

Theorem 7.66. Let φ:R→S\varphi: R \to S be a ring homomorphism.

  1. φ(0)=0\varphi(0) = 0.
  2. φ(−a)=−φ(a)\varphi(-a) = -\varphi(a).
  3. If RR has unity 11, then φ(1)\varphi(1) is unity for φ(R)\varphi(R).
  4. If u∈Ru \in R is a unit, then φ(u)\varphi(u) is a unit in SS.

Example 7.67. The map φ:Z→Zn\varphi: \mathbb{Z} \to \mathbb{Z}_n given by φ(m)=m mod n\varphi(m) = m \bmod n is a ring homomorphism.

Example 7.68. The evaluation map φa:Z[x]→Z\varphi_a: \mathbb{Z}[x] \to \mathbb{Z} given by φa(f(x))=f(a)\varphi_a(f(x)) = f(a) is a ring homomorphism.

Exercise 7.69. Show that the map φ:Z→Z\varphi: \mathbb{Z} \to \mathbb{Z} given by φ(n)=2n\varphi(n) = 2n is not a ring homomorphism.

Exercise 7.70. Find all ring homomorphisms from Z\mathbb{Z} to Z\mathbb{Z}.

Exercise 7.71. Prove Theorem 7.66(1) and (2).


Summary#

We have introduced:

  • The definition of a ring (additive abelian group + associative multiplication + distributivity)
  • Commutative rings, rings with unity, the zero ring
  • Units and the unit group R×R^\times
  • Subrings and the subring criterion
  • Zero divisors and integral domains
  • Fields and finite integral domains
  • The field of fractions of an integral domain
  • Characteristic of a ring
  • Ring homomorphisms, isomorphisms, and kernels