Ring Theory

Why ring theory matters

Ring theory is the algebraic skeleton beneath number theory, geometry, and combinatorics. Rings provide a uniform language for objects as different as integers, polynomials, matrices, and continuous functions — and the structural results (ideals, quotients, homomorphisms) transfer between them.

• Algebraic number theory. Rings of integers ϴ_K in number fields K (e.g. ℤ[i], ℤ[√−5]) generalize ℤ. Unique factorization fails in ℤ[√−5] but is restored at the level of ideals — Dedekind's insight that birthed modern ring theory.
• Algebraic geometry. Affine varieties V correspond to coordinate rings k[V]. Hilbert's Nullstellensatz gives a dictionary — points of V are maximal ideals of k[V], subvarieties are prime ideals. Grothendieck's schemes turn every commutative ring into a geometric object Spec(R).
• Coding theory. Cyclic codes are ideals in 𝔽_q[x]/(xⁿ−1). Reed-Solomon, BCH, and CRC checksums all live inside polynomial-ring quotients.
• Cryptography. RSA works in ℤ/nℤ. Lattice cryptography uses polynomial rings ℤ[x]/(xⁿ+1). Elliptic curve crypto uses rings of regular functions on curves over finite fields.
• Functional analysis. C(X), the ring of continuous real-valued functions on a topological space X, encodes the topology of X via its maximal ideals (Gelfand duality).
• Representation theory. Group rings k[G] turn group representations into module theory over a ring.
• Homological algebra. Ext, Tor, and derived functors are defined in terms of resolutions of modules over rings — the entire machinery of modern algebra.

The ring axioms in detail

A ring (R, +, ×) consists of a set R with two binary operations, satisfying:

• Additive abelian group. + is associative, commutative, has identity 0, and every a has a negation −a.
• Multiplicative monoid (or semigroup). × is associative. Many authors require a multiplicative identity 1 ≠ 0; rings without 1 are sometimes called "rngs."
• Distributive laws. a × (b + c) = a×b + a×c and (a + b) × c = a×c + b×c. Both required because × may be non-commutative.

Notable consequences derivable from the axioms — 0 × a = 0 for all a, (−a) × b = −(a × b), and (−1) × a = −a when 1 exists. The element 0 is never invertible (in any ring with 1 ≠ 0), which is why we exclude it from the multiplicative group of a field.

Canonical examples to keep in mind

Ring	Type	Note
ℤ	Commutative, with 1	The prototype — UFD, Euclidean, principal ideal domain
ℚ, ℝ, ℂ	Field	Every nonzero element invertible
ℤ/nℤ	Commutative, with 1	Field iff n prime; otherwise has zero divisors
k[x]	Commutative, with 1	UFD; Euclidean for k a field
k[x, y]	Commutative, with 1	UFD but not principal — (x, y) is not principal
M_n(R)	Non-commutative, with 1	Matrix ring; has zero divisors when n ≥ 2
ℍ (quaternions)	Division ring (skew field)	Non-commutative but every nonzero element invertible
C(X)	Commutative, with 1	Continuous real functions; max ideals ↔ points of X
ℤ[i]	Euclidean domain	Gaussian integers; classifies sums of two squares
ℤ[√−5]	Not UFD	6 = 2·3 = (1+√−5)(1−√−5)

Ideals — the kernels of ring homomorphisms

A subset I ⊆ R is an ideal if it is closed under addition and absorbs multiplication by all of R — for any r ∈ R and a ∈ I, both ra and ar lie in I. Ideals are exactly the kernels of ring homomorphisms — for any ring homomorphism φ : R → S, ker(φ) = {r : φ(r) = 0} is an ideal, and conversely every ideal arises this way.

The quotient ring R/I has elements a + I (cosets) and inherits ring operations from R. The first isomorphism theorem says R/ker(φ) ≅ Im(φ) for any homomorphism φ.

• Maximal ideal m — R/m is a field. In ℤ, the maximal ideals are exactly (p) for prime p, and ℤ/(p) = 𝔽_p.
• Prime ideal p — R/p is an integral domain. In ℤ, prime ideals are (0) and (p). Generalizes "prime number" in the right way for non-UFD rings.
• Principal ideal — generated by a single element, written (a) = {ra : r ∈ R}. ℤ and k[x] are principal ideal domains (PIDs); k[x, y] is not.

Hilbert and Noether — the structural turn

David Hilbert's Basissatz (1888) showed that every ideal in k[x₁,...,xₙ] is finitely generated. Emmy Noether (1921) abstracted this — a ring R is Noetherian if every ascending chain of ideals I₁ ⊆ I₂ ⊆ ... eventually stabilizes, equivalently every ideal is finitely generated. ℤ, k[x₁,...,xₙ], rings of integers in number fields, and most rings encountered in geometry are Noetherian.

Noether's primary decomposition theorem replaces unique factorization of elements with primary decomposition of ideals — every ideal in a Noetherian ring is a finite intersection of primary ideals. This is the structural backbone of commutative algebra and algebraic geometry.

Common misconceptions

• "All rings have a multiplicative identity." Convention varies. Bourbaki and most modern algebraists require 1; older texts and some categories (ideals, even-integer rings) do not. Check your source's convention before quoting theorems.
• "All rings are commutative." Matrix rings M_n(R) for n ≥ 2 are non-commutative, as are quaternions ℍ, group rings k[G] for non-abelian G, and rings of differential operators. "Commutative algebra" is a specialization, not a default.
• "Fields are special rings." Yes — fields are exactly commutative rings where every nonzero element has a multiplicative inverse. But thinking of fields as "the simplest rings" is misleading; in many ways non-fields like ℤ[x] are the more characteristic examples that drive ring theory.
• "Ideals are subrings." Not in the standard sense. An ideal need not contain 1 (in fact a proper ideal cannot, since 1 ∈ I implies I = R). And subrings need not absorb multiplication by R — ℤ ⊆ ℚ is a subring but not an ideal.
• "Quotient ring R/I is smaller." R/I has |R|/|I| elements when both finite, but for general rings the quotient may be a different kind of object — k[x]/(x²) is finite-dimensional over k even though k[x] is not.
• "Every integral domain is a UFD." ℤ[√−5] is an integral domain that is not a UFD. UFDs are a strict subclass; failure of UFD was the motivation for Dedekind's invention of ideals.