Integral Domains and Fields: Abstract Algebra Guide

An integral domain is a commutative ring with 1 where ab = 0 forces a = 0 or b = 0 — no zero divisors. A field goes further: every nonzero element has a multiplicative inverse, so you can divide by anything nonzero. ℤ is a domain but not a field; ℚ, ℝ, ℂ are fields.

These mark where familiar arithmetic holds: cancellation works in domains, full division in fields. Polynomial theory and linear algebra assume these hypotheses — and ℤ/6ℤ shows exactly what breaks without them.

Key Concepts

• Integral domain: commutative, 1 ≠ 0, no zero divisors.
• Field: every nonzero element has an inverse.
• Hierarchy: every field is a domain; not conversely (ℤ is the witness).
• Finite domains are fields; the characteristic of a domain is 0 or prime.
• ℤ/pℤ is a field iff p is prime.

Formulas

• Domain criterion: ab = 0 ⟹ a = 0 or b = 0. (Abstract algebra; no physical units.)
• Cancellation law: in a domain, a ≠ 0 and ab = ac ⟹ b = c (proof: a(b − c) = 0 forces b − c = 0).
• Field criterion: for every a ≠ 0 there exists b with ab = 1; write b = a^{-1}.
• Prime modulus: ℤ/pℤ is a field ⟺ p is prime (inverses via Bézout: gcd(a, p) = 1 gives ax + py = 1, so ax = 1 mod p).
• Limit: the domain criterion as stated requires commutativity; noncommutative "domains" need a separate definition.

Worked Example

ℤ/6ℤ is neither: 2·3 = 0 mod 6 with both factors nonzero — zero divisors, so no domain; 2 has no inverse (2·k is always even), so no field. Cancellation fails: 2·3 = 2·0 yet 3 ≠ 0. But ℤ/7ℤ is a field: 2·4 = 8 = 1, so 2^{-1} = 4; 3·5 = 15 = 1, so 3^{-1} = 5; 6·6 = 36 = 1, so 6^{-1} = 6 (and 1^{-1} = 1, 4^{-1} = 2, 5^{-1} = 3). Every nonzero element has an inverse.

Common Misconceptions

• "ℤ/nℤ is always a field." Only for prime n. ℤ/6ℤ and ℤ/8ℤ have zero divisors; ℤ/4ℤ even has 2·2 = 0.
• "Every integral domain is a field." ℤ is a domain where 2 has no integer inverse — domains allow division-free arithmetic.
• "ab = 0 with a ≠ 0 forces b = 0 in any ring." That is exactly the domain property; matrix rings and ℤ/nℤ (composite n) violate it routinely.

Real-World Applications

• Cryptography: RSA and elliptic-curve cryptography compute in fields ℤ/pℤ and extension fields, where inverses must exist.
• Coding theory: Reed–Solomon codes need field arithmetic — implemented over finite fields GF(2^n).
• Linear algebra: vector spaces are defined over fields; Gaussian elimination needs division by pivots.
• Number theory: unique factorization domains (a special class of domains) explain Diophantine equations.

Domains forbid zero divisors so cancellation works; fields add inverses so division works — and ℤ/pℤ with prime p is the prototype finite field where both hold.