After groups, the next big structure in abstract algebra is the ring: a set where you can add, subtract and multiply, just like the integers. Rings, fields and ideals explain why some equations have solutions and others do not, and they are the foundation of number theory, coding theory and cryptography. Let's build the ideas from the ground up with concrete examples.
What Is a Ring?
A ring \((R, +, \cdot)\) is a set with two operations such that:
- \((R, +)\) is an abelian group, with identity \(0\).
- Multiplication is associative: \((ab)c = a(bc)\).
- The distributive laws hold: \(a(b + c) = ab + ac\) and \((a + b)c = ac + bc\).
Most courses also assume a multiplicative identity \(1\). If \(ab = ba\) for all elements, the ring is commutative.
Familiar Examples
- \(\mathbb{Z}\), \(\mathbb{Q}\), \(\mathbb{R}\), \(\mathbb{C}\) under ordinary operations.
- \(\mathbb{Z}_n = \{0, 1, \dots, n-1\}\) with addition and multiplication modulo \(n\).
- Polynomial rings such as \(\mathbb{R}[x]\).
- \(M_2(\mathbb{R})\), the \(2 \times 2\) real matrices, a standard non-commutative ring.
Units, Zero Divisors and Integral Domains
An element \(a\) is a unit if some \(b\) satisfies \(ab = 1\). A non-zero \(a\) is a zero divisor if \(ab = 0\) for some non-zero \(b\). A commutative ring with \(1 \ne 0\) and no zero divisors is an integral domain. In an integral domain, cancellation works: if \(ab = ac\) and \(a \ne 0\), then \(b = c\).
A field is a commutative ring in which every non-zero element is a unit. Examples are \(\mathbb{Q}\), \(\mathbb{R}\), \(\mathbb{C}\) and \(\mathbb{Z}_p\) for a prime \(p\). Every field is an integral domain, and every finite integral domain is a field.
Worked Example 1: Units and Zero Divisors in \(\mathbb{Z}_{12}\) and \(\mathbb{Z}_{26}\)
Part (a). Find the zero divisors and units of \(\mathbb{Z}_{12}\).
Step 1. In \(\mathbb{Z}_n\), the class \(a\) is a unit exactly when \(\gcd(a, n) = 1\), and every other non-zero class is a zero divisor.
Step 2. The numbers from 1 to 11 coprime to 12 are \(1, 5, 7, 11\). These are the units. Check: \(5 \cdot 5 = 25 = 2\cdot 12 + 1\), so \(5^{-1} = 5\).
Step 3. The remaining non-zero classes \(2, 3, 4, 6, 8, 9, 10\) are zero divisors. For instance \(4 \cdot 3 = 12 \equiv 0\) and \(8 \cdot 3 = 24 \equiv 0\).
So \(\mathbb{Z}_{12}\) is not an integral domain, and certainly not a field.
Part (b). Find the inverse of \(11\) in \(\mathbb{Z}_{26}\).
Step 1: Euclidean algorithm.
$$ 26 = 2 \cdot 11 + 4, \qquad 11 = 2 \cdot 4 + 3, \qquad 4 = 1 \cdot 3 + 1. $$
Step 2: Back-substitute.
$$ 1 = 4 - 3 = 4 - (11 - 2\cdot 4) = 3 \cdot 4 - 11 = 3(26 - 2\cdot 11) - 11 = 3\cdot 26 - 7 \cdot 11. $$
Step 3. Reducing mod 26, \(-7 \cdot 11 \equiv 1\), so \(11^{-1} \equiv -7 \equiv 19\).
Check: \(11 \times 19 = 209 = 8 \times 26 + 1\). Correct. This exact calculation appears in the affine cipher used in elementary cryptography.
Ideals: The "Normal Subgroups" of Ring Theory
A subset \(I \subseteq R\) is an ideal if it is an additive subgroup and absorbs multiplication: \(r \in R\), \(a \in I\) imply \(ra \in I\) and \(ar \in I\). The ideal generated by elements \(a_1, \dots, a_k\) in a commutative ring is
$$ (a_1, \dots, a_k) = \{ r_1 a_1 + \dots + r_k a_k : r_i \in R \}. $$
In \(\mathbb{Z}\), every ideal has the form \(n\mathbb{Z} = (n)\); rings with this property are called principal ideal domains (PIDs). For example, \((4, 6) = (2)\) in \(\mathbb{Z}\), because \(\gcd(4,6) = 2\) and \(2 = 4\cdot(-1) + 6 \cdot 1\).
Quotient Rings
Ideals are exactly what you need to build a quotient ring \(R/I\), whose elements are cosets \(a + I\). The familiar \(\mathbb{Z}_n\) is just \(\mathbb{Z}/n\mathbb{Z}\). Another beautiful example is
$$ \mathbb{R}[x]/(x^2 + 1) \cong \mathbb{C}, $$
where the coset of \(x\) plays the role of \(i\), since \(x^2 \equiv -1\).
Prime and Maximal Ideals
In a commutative ring \(R\) with \(1\):
- \(P\) is prime if \(ab \in P\) implies \(a \in P\) or \(b \in P\). Equivalently, \(R/P\) is an integral domain.
- \(M\) is maximal if no ideal lies strictly between \(M\) and \(R\). Equivalently, \(R/M\) is a field.
Every maximal ideal is prime. In \(\mathbb{Z}\), the ideal \((6)\) is not prime because \(2 \cdot 3 = 6 \in (6)\) but neither \(2\) nor \(3\) is in \((6)\). The ideal \((7)\) is maximal, which is why \(\mathbb{Z}_7\) is a field. In \(\mathbb{Z}[x]\), the ideal \((x)\) is prime but not maximal, because \(\mathbb{Z}[x]/(x) \cong \mathbb{Z}\) is a domain but not a field.
Worked Example 2: Building a Field with Four Elements
Construct a field with 4 elements and find the inverse of each non-zero element.
Step 1: Choose an irreducible polynomial. Over \(\mathbb{Z}_2\), consider \(p(x) = x^2 + x + 1\). A quadratic is irreducible if it has no roots. We have \(p(0) = 1\) and \(p(1) = 1 + 1 + 1 = 3 \equiv 1\). No roots, so \(p\) is irreducible.
Step 2: Form the quotient. Since \(\mathbb{Z}_2[x]\) is a PID, an irreducible polynomial generates a maximal ideal, so
$$ \mathbb{F}_4 = \mathbb{Z}_2[x]/(x^2 + x + 1) $$
is a field. Writing \(\alpha\) for the coset of \(x\), its elements are \(0, 1, \alpha, \alpha + 1\).
Step 3: Use the rule \(\alpha^2 = \alpha + 1\) (because \(\alpha^2 + \alpha + 1 = 0\) and \(-1 = 1\) in \(\mathbb{Z}_2\)).
Step 4: Find inverses. Compute
$$ \alpha(\alpha + 1) = \alpha^2 + \alpha = (\alpha + 1) + \alpha = 2\alpha + 1 = 1. $$
So \(\alpha^{-1} = \alpha + 1\) and \((\alpha + 1)^{-1} = \alpha\), while \(1^{-1} = 1\).
Step 5: Check closure. \((\alpha+1)^2 = \alpha^2 + 2\alpha + 1 = \alpha^2 + 1 = \alpha + 1 + 1 = \alpha\). Every product stays inside the four elements, confirming a field of order 4. Note that \(\mathbb{Z}_4\) is not this field: in \(\mathbb{Z}_4\), \(2 \cdot 2 = 0\).
Ring Homomorphisms and the First Isomorphism Theorem
A ring homomorphism \(\phi: R \to S\) preserves addition and multiplication. Its kernel is always an ideal, and the First Isomorphism Theorem states
$$ R/\ker\phi \cong \operatorname{im}\phi. $$
For example, evaluation \(\phi(f) = f(i)\) maps \(\mathbb{R}[x]\) onto \(\mathbb{C}\) with kernel \((x^2+1)\), which proves the isomorphism stated earlier in one line.
Did You Know?
- The word "ideal" comes from Ernst Kummer's "ideal numbers" in the 1840s, created to rescue unique factorisation in rings of algebraic integers.
- Emmy Noether's work in the 1920s turned ring theory into the abstract subject studied today; Noetherian rings are named after her.
- Finite fields \(\mathbb{F}_{2^8}\) are used in AES encryption and in Reed–Solomon codes that protect data on QR codes.
Key Takeaways
- A ring has addition and multiplication; a field is a commutative ring where every non-zero element has an inverse.
- In \(\mathbb{Z}_n\), \(a\) is a unit if and only if \(\gcd(a, n) = 1\); \(\mathbb{Z}_n\) is a field exactly when \(n\) is prime.
- Ideals let you form quotient rings; \(R/P\) is a domain for prime \(P\), and \(R/M\) is a field for maximal \(M\).
- Quotients by irreducible polynomials build new fields, such as \(\mathbb{C}\) and \(\mathbb{F}_4\).
Stuck on a proof in ring theory or a tricky quotient ring question? Amathify's experts and PhD scholars provide step-by-step solutions and assignment help; reach us on WhatsApp or through the Ask a Question form.
Stuck on a problem or assignment?
Our experts and PhD scholars solve maths, physics and chemistry — step by step.