The Central Idea

A ring is built from a set equipped with two operations:

\[ + \]

and

\[ \cdot. \]

The addition operation gives an abelian group structure, while multiplication is associative and interacts with addition through the distributive laws.

Strengthening the multiplicative behavior produces the hierarchy

\[ \boxed{ \text{field} \Longrightarrow \text{integral domain} \Longrightarrow \text{commutative ring} \Longrightarrow \text{ring} }. \]

Each implication adds structure; the reverse implications do not hold in general.

A Note About Ring Conventions

Different algebra texts use slightly different definitions of the word ring.

In this lesson, a ring is required to have a multiplicative identity

\[ 1 \]

satisfying

\[ 1a=a1=a. \]

Some authors allow rings without a multiplicative identity. When reading another source, always check which convention it uses.

We also distinguish commutative rings, in which

\[ ab=ba, \]

from rings whose multiplication may be noncommutative.

What Is a Ring?

A ring is a set \(R\) equipped with addition and multiplication such that:

  1. \((R,+)\) is an abelian group;
  2. multiplication is associative;
  3. there is a multiplicative identity \(1\in R\);
  4. multiplication distributes over addition on both sides.

The distributive laws are

\[ \boxed{a(b+c)=ab+ac} \]

and

\[ \boxed{(a+b)c=ac+bc}. \]

The Additive Structure of a Ring

The statement

\[ (R,+) \]

is an abelian group means:

Thus

\[ a+0=a \]

and

\[ a+(-a)=0. \]

The Multiplicative Structure of a Ring

Ring multiplication is associative:

\[ (ab)c=a(bc). \]

Under the convention used here, it also has identity \(1\):

\[ 1a=a1=a. \]

But multiplication does not need to be commutative unless the ring is specifically called a commutative ring.

Also, not every element is required to have a multiplicative inverse.

Addition and Multiplication Play Different Roles

In a ring, addition has stronger requirements than multiplication.

Every element must have an additive inverse:

\[ a+(-a)=0. \]

But a multiplicative inverse

\[ a^{-1} \]

need not exist.

This asymmetry is one of the defining features of ring structure.

Example: The Integers Form a Ring

The integers

\[ \mathbb{Z} \]

form a ring under ordinary addition and multiplication.

Addition makes \(\mathbb{Z}\) an abelian group.

Multiplication is associative and commutative, with identity

\[ 1. \]

Multiplication distributes over addition.

Therefore,

\[ \boxed{(\mathbb{Z},+,\cdot)\text{ is a commutative ring}}. \]

The Integers Are Not a Field

A field requires every nonzero element to have a multiplicative inverse inside the set.

In \(\mathbb{Z}\), the integer \(2\) would require

\[ \frac12. \]

But

\[ \frac12\notin\mathbb{Z}. \]

Therefore the integers are not a field.

Commutative Rings

A ring \(R\) is commutative if

\[ \boxed{ab=ba} \]

for all

\[ a,b\in R. \]

The familiar rings

\[ \mathbb{Z},\qquad \mathbb{Q},\qquad \mathbb{R},\qquad \mathbb{C} \]

all have commutative multiplication.

Example: Matrix Rings

Let

\[ M_n(\mathbb{R}) \]

denote the set of all \(n\times n\) real matrices.

Under matrix addition and matrix multiplication, this set forms a ring.

Matrix multiplication is associative and has identity matrix

\[ I. \]

But for \(n\ge2\),

\[ AB\ne BA \]

in general.

Thus matrix rings provide standard examples of noncommutative rings.

The Additive and Multiplicative Identities Are Different

A ring contains both an additive identity

\[ 0 \]

and a multiplicative identity

\[ 1. \]

Their roles are:

\[ a+0=a \]

and

\[ a\cdot1=a. \]

For a nontrivial ring,

\[ \boxed{0\ne1}. \]

Integral domains and fields always require this nontrivial condition.

Why \(a\cdot0=0\)

In any ring,

\[ \boxed{a\cdot0=0}. \]

To see why, begin with

\[ 0+0=0. \]

Multiply by \(a\):

\[ a(0+0)=a0. \]

Distribute:

\[ a0+a0=a0. \]

Add the additive inverse of \(a0\) to both sides:

\[ a0=0. \]

Similarly,

\[ 0a=0. \]

Why Negative Signs Behave Familiarity

Ring laws also imply

\[ \boxed{(-a)b=-(ab)} \]

and

\[ \boxed{a(-b)=-(ab)}. \]

Applying both rules gives

\[ \boxed{(-a)(-b)=ab}. \]

These familiar sign laws follow from the ring axioms rather than needing to be assumed separately.

Zero Divisors

In a nontrivial commutative ring, a nonzero element \(a\) is called a zero divisor if there exists a nonzero element \(b\) such that

\[ \boxed{ab=0}. \]

Zero divisors reveal that multiplication can collapse two nonzero elements to zero.

Example: Zero Divisors Modulo 6

In

\[ \mathbb{Z}_6, \]

we have

\[ 2\cdot3=6\equiv0\pmod6. \]

Yet

\[ 2\not\equiv0\pmod6 \]

and

\[ 3\not\equiv0\pmod6. \]

Therefore \(2\) and \(3\) are zero divisors in \(\mathbb{Z}_6\).

Why Zero Divisors Matter

Over ordinary integers and real numbers, the equation

\[ ab=0 \]

implies

\[ a=0 \]

or

\[ b=0. \]

This is the zero-product property.

In a ring with zero divisors, that implication can fail.

For example, modulo \(6\),

\[ 2\cdot3=0 \]

even though neither factor is zero.

What Is an Integral Domain?

An integral domain is a commutative ring with

\[ 1\ne0 \]

and no zero divisors.

Thus if \(R\) is an integral domain and

\[ ab=0, \]

then

\[ \boxed{a=0\text{ or }b=0}. \]

Integral Domain Checklist

A structure is an integral domain if:

  1. it is a commutative ring;
  2. \(1\ne0\);
  3. it has no zero divisors.

The key new condition beyond commutative ring structure is the absence of nonzero factors whose product is zero.

The Integers Form an Integral Domain

The integers form a commutative ring with

\[ 1\ne0. \]

They also satisfy the zero-product property:

\[ ab=0 \Longrightarrow a=0\text{ or }b=0. \]

Therefore,

\[ \boxed{\mathbb{Z}\text{ is an integral domain}}. \]

Integral Domains Support Cancellation

Suppose \(R\) is an integral domain and

\[ ab=ac. \]

Subtract \(ac\):

\[ ab-ac=0. \]

Factor:

\[ a(b-c)=0. \]

If

\[ a\ne0, \]

then the absence of zero divisors forces

\[ b-c=0. \]

Therefore,

\[ \boxed{ab=ac,\ a\ne0\Longrightarrow b=c}. \]

Why Cancellation Can Fail with Zero Divisors

In \(\mathbb{Z}_6\),

\[ 2\cdot1\equiv2\pmod6 \]

and

\[ 2\cdot4\equiv8\equiv2\pmod6. \]

Thus

\[ 2\cdot1=2\cdot4 \]

in \(\mathbb{Z}_6\), even though

\[ 1\ne4. \]

Multiplicative cancellation fails because \(2\) is a zero divisor.

Polynomial Rings

Let

\[ \mathbb{R}[x] \]

denote the set of polynomials in \(x\) with real coefficients.

Under ordinary polynomial addition and multiplication,

\[ \mathbb{R}[x] \]

forms a commutative ring.

It is also an integral domain.

A Polynomial Ring Need Not Be a Field

Consider the nonzero polynomial

\[ x. \]

A multiplicative inverse inside \(\mathbb{R}[x]\) would need to be a polynomial \(p(x)\) satisfying

\[ x\,p(x)=1. \]

No polynomial can satisfy this equation.

Therefore

\[ \boxed{\mathbb{R}[x]\text{ is not a field}}. \]

What Is a Field?

A field is a commutative ring with

\[ 1\ne0 \]

in which every nonzero element has a multiplicative inverse.

Thus for every

\[ a\in F,\qquad a\ne0, \]

there exists

\[ a^{-1}\in F \]

such that

\[ \boxed{aa^{-1}=1}. \]

Field Structure in Two Group Statements

A field \(F\) can be summarized by two group structures.

Under addition,

\[ (F,+) \]

is an abelian group.

Remove zero and consider multiplication:

\[ F^\times=F\setminus\{0\}. \]

Then

\[ (F^\times,\cdot) \]

is also an abelian group.

The distributive laws connect the two operations.

The Rational Numbers Form a Field

The rational numbers

\[ \mathbb{Q} \]

form a commutative ring.

Every nonzero rational number

\[ \frac{a}{b} \]

has multiplicative inverse

\[ \frac{b}{a}. \]

Therefore,

\[ \boxed{\mathbb{Q}\text{ is a field}}. \]

The Real Numbers Form a Field

The real numbers are closed under addition, subtraction, multiplication, and division by nonzero elements.

Every nonzero

\[ a\in\mathbb{R} \]

has inverse

\[ \frac1a\in\mathbb{R}. \]

Therefore,

\[ \boxed{\mathbb{R}\text{ is a field}}. \]

The Complex Numbers Form a Field

The complex numbers

\[ \mathbb{C} \]

also form a field.

If

\[ z=a+bi\ne0, \]

then

\[ z^{-1} = \frac{a-bi}{a^2+b^2}. \]

Since

\[ a^2+b^2>0 \]

for nonzero \(z\), this inverse is well defined.

Every Field Is an Integral Domain

Suppose \(F\) is a field and

\[ ab=0. \]

If

\[ a\ne0, \]

then \(a^{-1}\) exists.

Multiply by \(a^{-1}\):

\[ a^{-1}(ab)=a^{-1}0. \]

Therefore,

\[ b=0. \]

Hence a field has no zero divisors.

Therefore,

\[ \boxed{\text{every field is an integral domain}}. \]

Not Every Integral Domain Is a Field

The integers provide the standard counterexample.

We know

\[ \mathbb{Z} \]

is an integral domain.

But \(2\) has no multiplicative inverse in \(\mathbb{Z}\).

Therefore,

\[ \boxed{\mathbb{Z}\text{ is an integral domain but not a field}}. \]

Units in a Ring

An element \(u\in R\) is called a unit if it has a multiplicative inverse in \(R\).

Thus there exists

\[ u^{-1}\in R \]

such that

\[ uu^{-1}=u^{-1}u=1. \]

The units of a ring form a group under multiplication.

Units in the Integers

In

\[ \mathbb{Z}, \]

the only units are

\[ \boxed{1\text{ and }-1}. \]

Indeed,

\[ 1\cdot1=1 \]

and

\[ (-1)(-1)=1. \]

No other integer has an integer reciprocal.

Units in a Field

In a field, every nonzero element is a unit.

Therefore,

\[ \boxed{F^\times=F\setminus\{0\}} \]

is precisely the group of units of the field.

Modular Rings

For any positive integer \(n\), the residue classes

\[ \mathbb{Z}_n = \{0,1,\ldots,n-1\} \]

form a commutative ring under addition and multiplication modulo \(n\).

Whether this ring is an integral domain or field depends strongly on \(n\).

Prime Moduli Produce Fields

If \(p\) is prime, then

\[ \boxed{\mathbb{Z}_p\text{ is a field}}. \]

Every nonzero residue class modulo \(p\) has a multiplicative inverse.

For example, in

\[ \mathbb{Z}_5, \]

we have

\[ 2\cdot3=6\equiv1\pmod5. \]

Thus \(3\) is the multiplicative inverse of \(2\) modulo \(5\).

Composite Moduli Produce Zero Divisors

If \(n\) is composite, then \(\mathbb{Z}_n\) has zero divisors.

Suppose

\[ n=ab \]

with

\[ 1 Then in \(\mathbb{Z}_n\),

\[ ab\equiv0\pmod n, \]

even though neither factor is congruent to \(0\).

Therefore \(\mathbb{Z}_n\) is not an integral domain when \(n\) is composite.

Example: \(\mathbb{Z}_5\)

Because \(5\) is prime,

\[ \mathbb{Z}_5 \]

is a field.

The nonzero multiplicative inverses are:

\[ 1^{-1}=1, \] \[ 2^{-1}=3, \] \[ 3^{-1}=2, \] \[ 4^{-1}=4. \]

Every nonzero element is invertible.

Example: \(\mathbb{Z}_6\)

Because \(6\) is composite,

\[ \mathbb{Z}_6 \]

contains zero divisors.

For example,

\[ 2\cdot3\equiv0\pmod6. \]

Therefore \(\mathbb{Z}_6\) is not an integral domain and cannot be a field.

Finite Integral Domains Are Fields

A particularly important theorem states:

\[ \boxed{ \text{every finite integral domain is a field} }. \]

Intuitively, multiplication by a nonzero element cannot collapse two distinct elements to the same output because cancellation holds.

On a finite set, this forces multiplication by a nonzero element to hit every element, including \(1\).

Therefore each nonzero element has a multiplicative inverse.

Why the Finite Theorem Matters for Modular Arithmetic

The ring

\[ \mathbb{Z}_p \]

for prime \(p\) has no zero divisors.

Since it is finite, it must therefore be a field.

This connects prime numbers directly to finite field structure.

Characteristic

Repeatedly adding the multiplicative identity produces

\[ 1,\quad1+1,\quad1+1+1,\quad\ldots \]

In some rings, a positive number of copies of \(1\) eventually equals \(0\).

The smallest positive integer \(n\) satisfying

\[ n\cdot1=0 \]

is called the characteristic of the ring.

If no positive integer does this, the ring has characteristic \(0\).

Examples of Characteristic

The familiar rings

\[ \mathbb{Z},\qquad \mathbb{Q},\qquad \mathbb{R},\qquad \mathbb{C} \]

have characteristic

\[ 0. \]

The ring

\[ \mathbb{Z}_n \]

has characteristic

\[ \boxed{n}. \]

Fields Have Prime Characteristic or Characteristic Zero

If a field has positive characteristic \(n\), then \(n\) must be prime.

If

\[ n=ab \]

were composite, then

\[ (a\cdot1)(b\cdot1)=n\cdot1=0 \]

would create nonzero zero divisors.

But fields have no zero divisors.

Therefore a field has characteristic \(0\) or prime characteristic.

Division in a Field

Division by a nonzero element is defined using multiplication by its inverse:

\[ \boxed{ \frac{a}{b} = a b^{-1} } \]

for

\[ b\ne0. \]

Thus division is not a new independent operation in field theory. It is multiplication by an inverse.

Why Division Works Differently in \(\mathbb{Z}\)

In the integers,

\[ \frac{1}{2} \]

is not an integer.

Therefore multiplication by the inverse of \(2\) cannot be performed internally in \(\mathbb{Z}\).

This is exactly why the integers form an integral domain but not a field.

Solving Linear Equations in a Field

Suppose

\[ ax=b \]

in a field and

\[ a\ne0. \]

Multiply by \(a^{-1}\):

\[ a^{-1}(ax)=a^{-1}b. \]

Therefore,

\[ \boxed{x=a^{-1}b=\frac{b}{a}}. \]

This guaranteed solvability is one reason fields provide the natural scalar systems for much of linear algebra.

Why Fields Matter for Vector Spaces

A vector space uses scalars drawn from a field.

Common scalar fields include

\[ \mathbb{R} \]

and

\[ \mathbb{C}. \]

The availability of addition, subtraction, multiplication, and division by nonzero scalars supports the algebraic manipulations used in linear combinations, span, bases, and dimension.

These ideas will be developed later in this section.

Hierarchy of Familiar Examples

Structure Ring? Integral Domain? Field?
\(\mathbb{Z}\) Yes Yes No
\(\mathbb{Q}\) Yes Yes Yes
\(\mathbb{R}\) Yes Yes Yes
\(\mathbb{C}\) Yes Yes Yes
\(\mathbb{Z}_5\) Yes Yes Yes
\(\mathbb{Z}_6\) Yes No No
\(\mathbb{R}[x]\) Yes Yes No

Structure Hierarchy

Under the conventions used in this lesson:

\[ \boxed{ \text{field} \Longrightarrow \text{integral domain} \Longrightarrow \text{commutative ring} \Longrightarrow \text{ring} }. \]

The reverse directions fail in general.

For example:

Common Error: Assuming Ring Multiplication Must Be Commutative

Addition in a ring is always commutative.

Multiplication need not be.

Matrix rings provide the standard example:

\[ AB\ne BA \]

in general.

A ring whose multiplication is commutative must be identified specifically as a commutative ring.

Common Error: Assuming Every Nonzero Ring Element Has an Inverse

That property belongs to fields, not arbitrary rings.

In

\[ \mathbb{Z}, \]

the nonzero element \(2\) has no multiplicative inverse in the ring.

Ring structure alone does not guarantee division by nonzero elements.

Common Error: Confusing Zero Divisors with Zero

A zero divisor is required to be nonzero.

The equation

\[ 0\cdot a=0 \]

does not make \(0\) a zero divisor under the standard definition used here.

We look for nonzero elements \(a\) and \(b\) satisfying

\[ ab=0. \]

Common Error: Assuming No Zero Divisors Means Field

The integers have no zero divisors.

Therefore \(\mathbb{Z}\) is an integral domain.

But most nonzero integers do not have multiplicative inverses in \(\mathbb{Z}\).

Therefore absence of zero divisors does not by itself make a ring a field.

Common Error: Assuming Every \(\mathbb{Z}_n\) Is a Field

The modular ring

\[ \mathbb{Z}_n \]

is a field exactly when

\[ \boxed{n\text{ is prime}}. \]

Composite moduli introduce zero divisors.

Common Error: Cancelling Across a Zero Divisor

Cancellation such as

\[ ab=ac \Longrightarrow b=c \]

requires an appropriate nonzero factor in a structure without zero divisors.

In \(\mathbb{Z}_6\),

\[ 2\cdot1=2\cdot4, \]

but

\[ 1\ne4. \]

Blind cancellation would produce an incorrect conclusion.

A Reliable Ring Classification Procedure

  1. Identify the set and the two operations.
  2. Verify that addition forms an abelian group.
  3. Verify associativity of multiplication.
  4. Locate the multiplicative identity under the convention used here.
  5. Verify both distributive laws.
  6. Check whether multiplication is commutative.
  7. If the ring is commutative and nontrivial, test for zero divisors.
  8. If there are no zero divisors, the structure is an integral domain.
  9. If every nonzero element has a multiplicative inverse, the structure is a field.

Example: Full Classification of \(\mathbb{Z}_7\)

Consider

\[ \mathbb{Z}_7 \]

under addition and multiplication modulo \(7\).

Ring structure

Modular addition forms an abelian group, multiplication is associative and commutative, \(1\) is the multiplicative identity, and the distributive laws hold.

Therefore \(\mathbb{Z}_7\) is a commutative ring.

Zero divisors

Because \(7\) is prime, no two nonzero residues multiply to \(0\) modulo \(7\).

Therefore \(\mathbb{Z}_7\) is an integral domain.

Inverses

Every nonzero residue has a multiplicative inverse.

For example,

\[ 3\cdot5=15\equiv1\pmod7. \]

Therefore,

\[ \boxed{\mathbb{Z}_7\text{ is a field}}. \]

Practice 1: Classify the Integers

Classify

\[ \mathbb{Z} \]

among commutative ring, integral domain, and field.

Practice 2: Classify the Rational Numbers

Classify

\[ \mathbb{Q} \]

among commutative ring, integral domain, and field.

Practice 3: Find Zero Divisors

Show that \(2\) and \(4\) are zero divisors in

\[ \mathbb{Z}_8. \]

Practice 4: Prime Modulus

Is

\[ \mathbb{Z}_{11} \]

a field?

Practice 5: Composite Modulus

Is

\[ \mathbb{Z}_{10} \]

an integral domain?

Practice 6: Units in the Integers

List all units in

\[ \mathbb{Z}. \]

Practice 7: Polynomial Ring

Is

\[ \mathbb{R}[x] \]

a field?

Practice 8: Cancellation

Suppose \(R\) is an integral domain and

\[ ab=ac \]

with \(a\ne0\). What can you conclude?

Practice 9: Field Inverse

In

\[ \mathbb{Z}_7, \]

find the multiplicative inverse of \(3\).

Practice 10: Identify the Error

A student says:

“\(\mathbb{Z}\) is a field because it is closed under multiplication and has no zero divisors.”

Explain the error.

Practice Answers

Practice 1

The integers form a commutative ring and have no zero divisors, so

\[ \boxed{\mathbb{Z}\text{ is an integral domain}}. \]

It is not a field because most nonzero integers do not have multiplicative inverses in \(\mathbb{Z}\).

Practice 2

Every nonzero rational number has a rational reciprocal.

Therefore,

\[ \boxed{\mathbb{Q}\text{ is a field}}. \]

Consequently it is also an integral domain and a commutative ring.

Practice 3

In \(\mathbb{Z}_8\),

\[ 2\cdot4=8\equiv0\pmod8. \]

Since neither \(2\) nor \(4\) is zero modulo \(8\), both are zero divisors.

Practice 4

Yes. Since \(11\) is prime,

\[ \boxed{\mathbb{Z}_{11}\text{ is a field}}. \]

Practice 5

No. Since

\[ 2\cdot5=10\equiv0\pmod{10}, \]

\(\mathbb{Z}_{10}\) has zero divisors.

Therefore it is not an integral domain.

Practice 6

The only integers with integer multiplicative inverses are

\[ \boxed{1\text{ and }-1}. \]

Practice 7

No. The nonzero polynomial \(x\) has no multiplicative inverse in \(\mathbb{R}[x]\).

Thus \(\mathbb{R}[x]\) is an integral domain but not a field.

Practice 8

Cancellation holds in an integral domain for nonzero factors.

Therefore,

\[ \boxed{b=c}. \]

Practice 9

We need \(b\) such that

\[ 3b\equiv1\pmod7. \]

Since

\[ 3\cdot5=15\equiv1\pmod7, \]

the inverse is

\[ \boxed{5}. \]

Practice 10

A field requires every nonzero element to have a multiplicative inverse inside the set.

In \(\mathbb{Z}\), the element \(2\) would need inverse

\[ \frac12, \]

but \(\frac12\notin\mathbb{Z}\).

Therefore \(\mathbb{Z}\) is an integral domain, not a field.

What to Remember

A ring combines two operations linked by distributivity.

Under the convention used here:

The hierarchy is

\[ \boxed{ \text{field} \Longrightarrow \text{integral domain} \Longrightarrow \text{commutative ring} \Longrightarrow \text{ring} }. \]

The integers, modular systems, polynomial rings, rational numbers, real numbers, and complex numbers illustrate the different levels of this hierarchy.

Where We Go Next

Rings and fields show how algebraic behavior can depend dramatically on the underlying arithmetic system. Modular arithmetic supplies especially important finite examples, while Boolean algebra introduces operations governed by a different but equally reusable family of laws.

The next lesson, Modular Arithmetic and Boolean Algebra, develops these finite and logical algebraic systems and shows how familiar operations can be reorganized under new rules.