We want a number system where $x^2 + 1 = 0$ has a solution. The real numbers do not provide one: for any $a \in \mathbb{R}$, we have $a^2 \geq 0$, so $a^2 + 1 \geq 1 > 0$. The equation is simply impossible in $\mathbb{R}$. But we know complex numbers exist and solve it — the question is how to *build* $\mathbb{C}$ from $\mathbb{R}$ in a principled way, without pulling $i$ out of thin air and asking the reader to accept it. The answer is a quotient ring: form the polynomial ring $\mathbb{R}[x]$ and then "declare" $x^2 + 1 = 0$ by passing to $\mathbb{R}[x]/(x^2 + 1)$. This construction — imposing an algebraic relation by taking a quotient — is what the theory of rings is built to do.

The same pattern recurs everywhere. We want arithmetic modulo $n$: form $\mathbb{Z}$ and pass to $\mathbb{Z}/(n)$. We want a field with $p^2$ elements: start from $\mathbb{F}_p[x]$, pick an irreducible quadratic, and quotient by it. We want to understand whether a polynomial equation is solvable: study the rings and fields generated by its roots. Rings are the algebraic structures that carry both addition and multiplication, and their quotients are the machines for building new number systems by fiat.

[example: The Polynomial Ring Modulo x² + 1] We construct the complex numbers from the reals without postulating $i$. Consider the polynomial ring $\mathbb{R}[x]$, whose elements are polynomials $a_0 + a_1 x + \cdots + a_n x^n$ with $a_i \in \mathbb{R}$. The polynomial $x^2 + 1$ is irreducible over $\mathbb{R}$ — it has no real roots. Form the quotient $\mathbb{R}[x]/(x^2+1)$. Every element of this quotient is a coset $f(x) + (x^2 + 1)$. Since we can divide any polynomial by $x^2 + 1$ with remainder of degree at most $1$, every coset has a unique representative of the form $a + bx$ with $a, b \in \mathbb{R}$. Addition is componentwise: \begin{align*} (a + bx) + (c + dx) &= (a+c) + (b+d)x. \end{align*} Multiplication uses the relation $x^2 \equiv -1 \pmod{x^2+1}$: \begin{align*} (a + bx)(c + dx) &= ac + (ad + bc)x + bd \cdot x^2 \\ &= ac + (ad+bc)x + bd(-1) \\ &= (ac - bd) + (ad + bc)x. \end{align*} This is exactly the multiplication rule for complex numbers under the identification $x \leftrightarrow i$. The element $x + (x^2+1)$ satisfies $(x + (x^2+1))^2 + 1 = (x^2 + 1) + (x^2+1) = 0 + (x^2+1)$, which is the zero element of the quotient. So $x^2 + 1 = 0$ has a solution in $\mathbb{R}[x]/(x^2+1)$, and that quotient ring is isomorphic to $\mathbb{C}$. [/example]

This is the ring-theoretic miracle: you can solve equations by building the solution into the coefficient system. But to understand why this works — and when it doesn't — we need to develop the theory from the ground up.

## Definition

What makes a ring a ring? The minimal requirements for doing algebra: you need to add and subtract freely (an abelian group under addition), you need to multiply (associatively, with an identity), and multiplication must distribute over addition. That is it. Commutativity of multiplication is a bonus, not a requirement.

[definition: Ring] A **ring** is a set $R$ equipped with two binary operations, addition $+: R \times R \to R$ and multiplication $\cdot: R \times R \to R$, satisfying the following axioms: **(R1)** $(R, +)$ is an abelian [group](/page/Group). That is: $+$ is associative and commutative, there is a zero element $0_R \in R$ with $a + 0_R = a$ for all $a \in R$, and every $a \in R$ has an additive inverse $-a$ with $a + (-a) = 0_R$. **(R2)** Multiplication is associative: $(ab)c = a(bc)$ for all $a, b, c \in R$. **(R3)** There is a multiplicative identity $1_R \in R$ with $1_R \cdot a = a \cdot 1_R = a$ for all $a \in R$. **(R4)** Multiplication distributes over addition from both sides: \begin{align*} a(b + c) &= ab + ac, \\ (a + b)c &= ac + bc, \end{align*} for all $a, b, c \in R$. [/definition]

Notice what is *not* required: multiplication need not be commutative ($ab = ba$ is not assumed), and nonzero elements need not have multiplicative inverses. These omissions are intentional — they admit important examples like matrix rings and group rings that would be excluded by stronger axioms. The axioms above capture the bare minimum needed to do algebra with two operations.

From these four axioms alone, we can already derive some essential properties that might seem obvious but genuinely require proof.

[quotetheorem:2572]

The claim is not circular — it follows from the distributive law, not from some general principle about zero. Here is the argument for $0_R \cdot a = 0_R$. Since $0_R + 0_R = 0_R$ (the zero element satisfies this by definition of an additive identity), we compute:

\begin{align*} 0_R \cdot a &= (0_R + 0_R) \cdot a = 0_R \cdot a + 0_R \cdot a. \end{align*}

Subtract $0_R \cdot a$ from both sides (using the additive inverse) to get $0_R = 0_R \cdot a$. The argument for $a \cdot 0_R = 0_R$ is symmetric.

This tells us that the multiplicative identity $1_R$ and the additive identity $0_R$ cannot be equal unless $R = \{0\}$: if $1_R = 0_R$, then for any $a \in R$, $a = 1_R \cdot a = 0_R \cdot a = 0_R$. A ring with $1_R = 0_R$ is called the **zero ring**; it has exactly one element.

[quotetheorem:2573]

These follow from distributivity and the zero annihilation theorem. For the first identity:

\begin{align*} ab + (-a)b &= (a + (-a))b = 0_R \cdot b = 0_R. \end{align*}

So $(-a)b$ is the additive inverse of $ab$, which is $-(ab)$. The second identity is symmetric. For the third: $(-a)(-b) = -(a(-b)) = -(-(ab)) = ab$, where the last step uses the fact that the inverse of the inverse is the original element.

These are not just bookkeeping — the rule $(-1)(-1) = 1$ is what ensures that the integers behave correctly, and it is a theorem, not an axiom.

Now we name the important special cases. In commutative rings, the order of multiplication is irrelevant, which simplifies algebra enormously: the theory of polynomials, divisibility, and factorization all rely on commutativity.