Helpful context:

A group is a set with one operation. What happens when you add a second? Integers under addition form an abelian group, but integers also multiply, and multiplication distributes over addition. That extra operation, and the interaction between the two, is what makes $\mathbb{Z}$ a ring. Impose enough additional structure and you get a field, where division is always possible. The progression from ring to integral domain to field is one of the cleanest hierarchies in algebra: each step adds a constraint, and each constraint unlocks a new theorem.

This post works through rings, ideals, zero divisors, integral domains, fields, and lattices. The Fibonacci sequence lives in a ring. The rationals form a field. The subsets of a set form a lattice. These are not isolated examples; they are instances of a common algebraic pattern.

Rings

A ring is a set $R$ equipped with two binary operations, addition $+$ and multiplication $\cdot$, satisfying:

  • $(R, +)$ is an abelian group: associativity, commutativity, additive identity $0$, additive inverses $-a$
  • $(R, \cdot)$ is associative: $a \cdot (b \cdot c) = (a \cdot b) \cdot c$
  • Distributivity: $a \cdot (b + c) = a \cdot b + a \cdot c$ and $(a + b) \cdot c = a \cdot c + b \cdot c$

A unital ring also has a multiplicative identity $1$ with $1 \cdot a = a \cdot 1 = a$ for all $a \in R$. A commutative ring further satisfies $a \cdot b = b \cdot a$ for all $a, b$.

Examples. $\mathbb{Z}$, $\mathbb{Q}$, $\mathbb{R}$, $\mathbb{C}$ are all commutative unital rings. The set $M_n(\mathbb{R})$ of $n \times n$ real matrices is a unital ring that is not commutative for $n \geq 2$: matrix multiplication does not commute in general. The integers modulo $n$, written $\mathbb{Z}_n$, form a commutative unital ring under addition and multiplication mod $n$. Given any ring $R$, the polynomial ring $R[x]$ consists of all polynomials with coefficients in $R$; it is a ring under the usual polynomial addition and multiplication.

A few immediate consequences of the axioms: $0 \cdot a = 0$ for all $a$ (the additive identity annihilates); $(-a) \cdot b = -(a \cdot b)$; and $(-a)(-b) = ab$. These follow from distributivity alone, without needing commutativity or inverses for multiplication.

Subrings and Ideals

Subrings. A subset $S \subseteq R$ is a subring if it is a ring under the operations inherited from $R$. Equivalently, $S$ is nonempty and closed under subtraction and multiplication: for all $a, b \in S$, $a - b \in S$ and $a \cdot b \in S$. Example: $\mathbb{Z}$ is a subring of $\mathbb{Q}$, which is a subring of $\mathbb{R}$.

Ideals. A subset $I \subseteq R$ is a two-sided ideal if:

  • $(I, +)$ is a subgroup of $(R, +)$
  • For all $r \in R$ and $a \in I$: $ra \in I$ and $ar \in I$

An ideal is a subring that absorbs multiplication from the full ring on both sides. Left ideals require only $ra \in I$; right ideals require only $ar \in I$; in a commutative ring these coincide.

The principal ideal generated by $a \in R$ is $\langle a \rangle = \{ra \mid r \in R\}$ (in a commutative ring). In $\mathbb{Z}$, every ideal is principal: the ideal $\langle n \rangle$ consists of all multiples of $n$. The even integers $2\mathbb{Z} = \langle 2 \rangle$ form an ideal of $\mathbb{Z}$.

Quotient rings. Given an ideal $I \subseteq R$, the quotient ring $R/I$ consists of cosets $a + I = \{a + x \mid x \in I\}$ with operations $(a + I) + (b + I) = (a+b) + I$ and $(a+I)(b+I) = (ab) + I$. The ideal condition ensures multiplication is well-defined on cosets. Example: $\mathbb{Z}/n\mathbb{Z} \cong \mathbb{Z}_n$.

First isomorphism theorem for rings. If $\phi: R \to S$ is a ring homomorphism (a map preserving both operations), then $\ker \phi = \{a \in R \mid \phi(a) = 0\}$ is an ideal of $R$, the image $\phi(R)$ is a subring of $S$, and

$$R / \ker \phi ;\cong; \phi(R).$$

The quotient by the kernel recovers the image, up to isomorphism. This is the exact analogue of the first isomorphism theorem for groups, with the additional condition that the map respects multiplication.

Zero Divisors

A nonzero element $a \in R$ is a zero divisor if there exists a nonzero $b \in R$ with $ab = 0$ or $ba = 0$.

Example. In $\mathbb{Z}_6$: $2 \cdot 3 = 6 \equiv 0$, so $2$ and $3$ are both zero divisors. Similarly, $4 \cdot 3 = 12 \equiv 0$. In contrast, $\mathbb{Z}_5$ has no zero divisors: the only way $ab \equiv 0 \pmod{5}$ is if $5 \mid a$ or $5 \mid b$, i.e., $a \equiv 0$ or $b \equiv 0$.

Zero divisors obstruct cancellation. In $\mathbb{Z}_6$, the equation $2x = 2y$ does not imply $x = y$: take $x = 0$ and $y = 3$, then $2 \cdot 0 = 0 = 2 \cdot 3$ in $\mathbb{Z}_6$. Cancellation requires that multiplication by a nonzero element be injective, which fails precisely when that element is a zero divisor.

The presence or absence of zero divisors is a key structural property. It separates the well-behaved rings from the pathological ones.

Integral Domains

A commutative ring with identity $R$ is an integral domain if it has no zero divisors: for all $a, b \in R$,

$$ab = 0 \implies a = 0 \text{ or } b = 0.$$

Equivalently, the cancellation law holds: if $c \neq 0$ and $ca = cb$, then $a = b$.

Examples. $\mathbb{Z}$ is an integral domain. The polynomial ring $\mathbb{Z}[x]$ is an integral domain. $\mathbb{Z}_n$ is an integral domain if and only if $n$ is prime, because $\mathbb{Z}_n$ has zero divisors exactly when $n$ is composite (if $n = ab$ with $1 < a, b < n$, then $a \cdot b \equiv 0$).

Every field is an integral domain. If $ab = 0$ and $a \neq 0$, multiply both sides by $a^{-1}$: $b = a^{-1} \cdot 0 = 0$.

Theorem. Every finite integral domain is a field. The proof uses the cancellation law to show that multiplication by any nonzero element is a bijection on the finite set $R \setminus \{0\}$, so every nonzero element has a multiplicative inverse.

The hierarchy so far: field $\Rightarrow$ integral domain $\Rightarrow$ commutative ring $\Rightarrow$ ring. None of these implications reverses in general.

Fields

A field is a commutative ring $(F, +, \cdot)$ in which every nonzero element has a multiplicative inverse. Stated as axioms:

  • $(F, +)$ is an abelian group with identity $0$
  • $(F \setminus \{0\}, \cdot)$ is an abelian group with identity $1$
  • Distributivity: $a(b+c) = ab + ac$

Examples. $\mathbb{Q}$, $\mathbb{R}$, $\mathbb{C}$ are fields. $\mathbb{Z}_p$ for any prime $p$ is a field: every nonzero element $a$ in $\mathbb{Z}_p$ satisfies $\gcd(a, p) = 1$, so $a$ has a multiplicative inverse mod $p$ by Bezout’s theorem. The set $\mathbb{Q}(\sqrt{2}) = \{a + b\sqrt{2} \mid a, b \in \mathbb{Q}\}$ is a field under ordinary addition and multiplication, since $(a + b\sqrt{2})^{-1} = \frac{a - b\sqrt{2}}{a^2 - 2b^2}$ (and $a^2 - 2b^2 \neq 0$ for $(a,b) \neq (0,0)$ since $\sqrt{2}$ is irrational).

Characteristic. The characteristic of a field $F$ is the smallest positive integer $p$ such that $1 + 1 + \cdots + 1$ ($p$ times) $= 0$, or $0$ if no such $p$ exists. The characteristic is always either $0$ or a prime. Fields like $\mathbb{Q}$, $\mathbb{R}$, $\mathbb{C}$ have characteristic $0$; $\mathbb{Z}_p$ has characteristic $p$.

Field extensions. If $F \subseteq E$ and both are fields under the same operations, then $E$ is a field extension of $F$, written $E/F$. The example $\mathbb{Q}(\sqrt{2})/\mathbb{Q}$ is a degree-$2$ extension: $\mathbb{Q}(\sqrt{2})$ is a two-dimensional vector space over $\mathbb{Q}$ with basis $\{1, \sqrt{2}\}$. Field extensions are the central object of Galois theory, connecting field structure to group theory.

Lattices

A lattice is a partially ordered set $(L, \leq)$ in which every pair of elements $\{a, b\}$ has:

  • A least upper bound (join) $a \vee b$: the smallest element $\geq a$ and $\geq b$
  • A greatest lower bound (meet) $a \wedge b$: the largest element $\leq a$ and $\leq b$

Equivalently, a lattice is an algebraic structure with two binary operations $\vee$ and $\wedge$ satisfying:

Law $\vee$ form $\wedge$ form
Commutativity $a \vee b = b \vee a$ $a \wedge b = b \wedge a$
Associativity $a \vee (b \vee c) = (a \vee b) \vee c$ $a \wedge (b \wedge c) = (a \wedge b) \wedge c$
Idempotence $a \vee a = a$ $a \wedge a = a$
Absorption $a \vee (a \wedge b) = a$ $a \wedge (a \vee b) = a$

The two definitions are equivalent: the algebraic axioms recover a partial order via $a \leq b \iff a \vee b = b$.

Examples.

  • The power set $\mathcal{P}(S)$ ordered by inclusion $\subseteq$: join is $A \cup B$, meet is $A \cap B$.
  • The positive divisors of $n$ ordered by divisibility: join is $\text{lcm}(a,b)$, meet is $\gcd(a,b)$.
  • Propositions ordered by implication: join is disjunction $P \vee Q$, meet is conjunction $P \wedge Q$.

Boolean algebras. A Boolean algebra is a distributive, complemented lattice: distributivity means $a \vee (b \wedge c) = (a \vee b) \wedge (a \vee c)$ and $a \wedge (b \vee c) = (a \wedge b) \vee (a \wedge c)$; complemented means every element $a$ has a complement $\neg a$ satisfying $a \vee \neg a = 1$ and $a \wedge \neg a = 0$ (where $0$ and $1$ are the bottom and top elements). The power set $\mathcal{P}(S)$ with $\neg A = S \setminus A$ is the canonical example. The two-element set $\{0, 1\}$ with ordinary logical operations is the simplest Boolean algebra. Boolean algebras formalize propositional logic and are the algebraic foundation of digital circuit design.

Summary

The algebraic structures in this post form a clean hierarchy:

$$\text{field} \subset \text{integral domain} \subset \text{commutative ring} \subset \text{ring}$$

Each containment is strict, and each step adds a structural requirement. Lattices sit slightly apart, connecting order theory to algebra.

Structure Key property Examples
Ring Two operations, $+$ abelian, $\cdot$ associative, distributivity $\mathbb{Z}$, $M_n(\mathbb{R})$, $\mathbb{Z}_n$, $R[x]$
Commutative ring Also $a \cdot b = b \cdot a$ $\mathbb{Z}$, $\mathbb{Z}_n$, $\mathbb{Q}[x]$
Integral domain Commutative, no zero divisors $\mathbb{Z}$, $\mathbb{Z}_p$, $\mathbb{Z}[x]$
Field Integral domain, every nonzero element invertible $\mathbb{Q}$, $\mathbb{R}$, $\mathbb{C}$, $\mathbb{Z}_p$
Lattice Partial order with joins and meets $\mathcal{P}(S)$, divisors of $n$
Boolean algebra Distributive complemented lattice $\mathcal{P}(S)$, $\{0,1\}$

The theorems that mark these transitions: a finite integral domain is always a field; $\mathbb{Z}_n$ is a field iff $n$ is prime; every field extension is a vector space over the base field. The ideal-quotient construction gives a systematic way to build new rings from old ones, and the first isomorphism theorem ties ring homomorphisms to this construction.

Read next: