Ring

Basis
Last updated: Tags: Abstract Algebra, Ring Theory

Prerequisites

Numbers support two operations, not one. You add them and you multiply them, and multiplication distributes over addition: a(b+c)=ab+aca(b + c) = ab + ac. A ring is the algebraic structure that captures exactly this two-operation arrangement, stripped of everything that is specific to numbers.

Two operations, one set

Everything you have seen so far — semigroups, monoids, groups — involves one binary operation on a set. A ring layers a second operation on top of the same set and imposes a rule connecting the two.

The two operations are called addition (written ++) and multiplication (written \cdot or by juxtaposition). Their names are chosen by analogy with ordinary arithmetic, but the operations themselves can be anything satisfying the axioms below.

Definition

Definition. A ring is a triple (R,+,)(R, +, \cdot) where RR is a set and ++, \cdot are binary operations on RR satisfying:

  1. (R,+,0)(R, +, 0) is an abelian group (with identity element 00, called the additive identity).
  2. (R,,1)(R, \cdot, 1) is a monoid (with identity element 11, called the multiplicative identity).
  3. Multiplication distributes over addition: for all a,b,cRa, b, c \in R,
a(b+c)=ab+ac(1)a \cdot (b + c) = a \cdot b + a \cdot c \tag{1} (a+b)c=ac+bc(2)(a + b) \cdot c = a \cdot c + b \cdot c \tag{2}

Breaking this down:

  • The addition operation forms an abelian group: you can add, subtract (using additive inverses, written a-a), and the order of addition never matters.
  • The multiplication operation forms a monoid: you can multiply, there is a multiplicative identity 11, and multiplication is associative — but multiplication does not need to have inverses.
  • Distributivity is the bridge between the two operations. Without it, addition and multiplication would be two independent, unrelated monoids on the same set.

Examples

Integers. (Z,+,)(\mathbb{Z}, +, \cdot) is the prototypical ring. Addition forms an abelian group with identity 00 and inverses n-n. Multiplication is associative with identity 11. Distributivity holds by basic arithmetic.

Real numbers. (R,+,)(\mathbb{R}, +, \cdot) is a ring. In fact it has more structure — every non-zero element has a multiplicative inverse — but it is a ring as a baseline.

Polynomials. Let R[x]\mathbb{R}[x] denote the set of all polynomials in one variable with real coefficients. You can add two polynomials term by term and multiply them by the standard rule. The zero polynomial is the additive identity and the constant polynomial 11 is the multiplicative identity. So (R[x],+,)(\mathbb{R}[x], +, \cdot) is a ring.

Square matrices. Let Mn(R)M_n(\mathbb{R}) be the set of all n×nn \times n real matrices. Matrix addition is component-wise (abelian group), matrix multiplication is associative with the identity matrix InI_n as identity (monoid), and matrix multiplication distributes over addition. So (Mn(R),+,)(M_n(\mathbb{R}), +, \cdot) is a ring.

Commutativity is not guaranteed

In all the examples above, integers and polynomials satisfy ab=baa \cdot b = b \cdot a — multiplication is commutative. But the matrix ring Mn(R)M_n(\mathbb{R}) does not: in general, ABBAAB \neq BA.

A ring where ab=baa \cdot b = b \cdot a holds for all elements is called a commutative ring. The integers Z\mathbb{Z} and the polynomials R[x]\mathbb{R}[x] are commutative rings. The matrix ring Mn(R)M_n(\mathbb{R}) for n2n \geq 2 is non-commutative.

The axioms for a ring only require that addition commutes, not multiplication. When working in a non-commutative ring, the two distributive laws (1) and (2) are both needed precisely because left-multiplying and right-multiplying can give different results.

What about division?

A ring does not require multiplicative inverses. In Z\mathbb{Z}, the integer 22 has no multiplicative inverse (since 12Z\frac{1}{2} \notin \mathbb{Z}). Division is not always possible in a ring.

This is intentional. Rings model settings where you can add, subtract, and multiply freely, but cannot always divide. Polynomials are a perfect illustration: you can add, subtract, and multiply polynomials freely, but dividing one polynomial by another may not yield a polynomial.

When you need division too, you restrict to the richer structure called a field.

Zero annihilates everything

One consequence of the axioms is that multiplying any element by the additive identity 00 always gives 00:

a0=0for all aR(3)a \cdot 0 = 0 \qquad \text{for all } a \in R \tag{3}

This follows from distributivity: a0=a(0+0)=a0+a0a \cdot 0 = a \cdot (0 + 0) = a \cdot 0 + a \cdot 0. Subtracting a0a \cdot 0 from both sides gives 0=a00 = a \cdot 0. This property is not an additional axiom — it is a theorem derived from the three axioms above.

Summary

  • A ring (R,+,)(R, +, \cdot) is a set with two binary operations: addition (forming an abelian group) and multiplication (forming a monoid), connected by the distributive laws.
  • Rings allow free addition, subtraction, and multiplication, but do not require division.
  • A ring is commutative if ab=baa \cdot b = b \cdot a for all elements; integers and polynomials are commutative, matrices are generally not.
  • The multiplicative identity 11 and additive identity 00 are distinct provided the ring has more than one element.
  • Multiplying any element by 00 yields 00 — a theorem, not an axiom.
  • When every non-zero element also has a multiplicative inverse, the ring gains enough structure to support division and becomes a field.