Divisibility

Definition

Given a commutative ring \(R\) with elements \(a, b \in R\), we say that \(a\) divides \(b\) (or \(a\) is a divisor of \(b\)), written as \(a \mid b\), if there exists an \(n \in R\) such that:

\[ an = b.\]

Note that this definition exists in the absence of division, and no division operation need be defined for divisibility to be well defined. This leads to the fact that \(0 \mid 0\) even though \(0 \div 0\) is not defined.

There are many useful properties of divisibility, some of which apply generally, while others require additional restrictions on the underlying ring.


Theorem

In a commutative ring with identity, \(a \mid b\) if and only if:

  1. \(b \in \langle a \rangle\)
  2. \(\langle b \rangle \subseteq \langle a \rangle\)
Proof

These facts follow very simply from the explicit form of ideals generated by subsets. That is:

\[ a \mid b \iff an = b \iff b \in \langle a \rangle\]

since \(an\) for \(n \in R\) is the form of all elements in \(\langle a \rangle\) when working in a commutative ring with identity. The requirement of a ring with identity is used in applying the result linked above.

Then, we have that:

\[ b \in \langle a \rangle \iff \langle b \rangle \subseteq \langle a \rangle,\]

as a direct consequence of this result.


Note specifically the use of a commutative ring, which means that we also have \(na = b\). Divisibility is rarely defined in non-commutative rings, although one can construct an analogous definition by distinguishing between left and right divisibility as follows.

Definition

In any ring \(R\) with elements \(a, b \in R\), \(a\) is said to be a left divisor of \(b\), while \(b\) is a right multiple of \(a\) if there exists an \(n \in R\) such that

\[ an = b.\]