Rings, Fields, Ideals, and Unique Factorization

Note

This section corresponds to Rings, Fields, Ideals, and Unique Factorization — 3:36:07 in the video Proof of Fermat Last Theorem FROM SCRATCH. Noah Jang is the original creator of the exposition and examples referenced here. The interactive implementations, animations, additional explanations, and contextual material are my own work.

📌 Rings

Note

Why do we need this?

From the website fermatically.com, we quote:

In a group we have one operation. But even the integers \(\mathbb{Z}\) have two: addition and multiplication. To capture both simultaneously, we need a richer structure — the ring.

The motivation comes directly from number theory: Fermat’s Last Theorem is about the equation \(x^n + y^n = z^n\) in the integers. The proofs for \(n=3\) and \(n=4\) shows that sometimes one must extend the number domain. All these number domains are rings.

🏷️ Rings — definition

A ring \(R(+, \cdot)\) is a set with two binary operations (frequently called addition and multiplication) satisfying

  • \(R(+)\) is an Abelian group
  • \(\forall a,b,c\in\mathbb{R},\ (a\cdot b)\cdot c = a\cdot (b\cdot c)\) (associative)
  • \(\forall a,b,c\in\mathbb{R},\ a(b + c) = ab + ac\ \text{and}\ (a + b)c = ac + bc\) (distributive)

✍️ Examples

  • \(\mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb{C}\) with addition and multiplication
  • \(Mat_n(\mathbb{R})\)
  • \(\mathbb{Z}_n\), with multiplication defined as \(a\cdot b = ab\mod(n)\)
  • \(\mathbb{R}[x]\), the set of polynomials with real coefficients

However, \(\mathbb{N}\) is not a ring, as it is not a(n Abelian) group!

🏷️ Commutativity, unit, and unity

  • A ring is commutative if its multiplication is commutative.
  • A unity (or identity) is a multiplicative identity element, denoted by 1.
  • A unit is an element in a ring with unity that has a multiplicative inverse: \(\forall a\in R\ \exists b: ab=ba =1\)

👉 Note that the existence of a unity is not always guaranteed. However, going forward most of our rings will have a unity.

✍️ Examples

Some examples of units are

  • The elements -1 and 1 when we take \(R=\mathbb{Z}\).
  • For \(R=\mathbb{Q}\) all elements are unit, except for zero.
  • Finally, if we take for example \(R = \mathbb{Z}_9\), 5 is a unit as \(5\cdot 2 \equiv 1\mod(9)\), but 3 is not, as there is no integer for which \(3a \equiv 1\mod(9)\)!

🏷️ Characteristic of a ring

The characteristic of a ring \(R\) is the smallest possible integer \(n\) such that for all \(a\in R\)

\[ \underbrace{a+a+\ldots+a}_{n\ \text{times}} = n\cdot a = 0 \]

If \(n\) exists, then we say the characteristic of \(R\) is \(n\), and if not, it is said to be zero.

✍️ Examples

  • For \(\mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb{C}\) the characteristic is zero
  • For \(\mathbb{Z}_n\) the characteristic is \(n\), since for any number \(a\in\mathbb{Z}_n\), we can add \(a\) \(n\) times, and \(na = 0 \mod(n)\).
  • For \(\mathbb{Z}_2\times\mathbb{Z}_3\) the characteristic is 6, since for any \((a, b)\in \mathbb{Z}_2\times\mathbb{Z}_3\) we have that \([6](a, b) = (6a, 6b) = (0, 0)\).

📌 Fields

Note

🚨 In what follows next, many similar and closely related terms are introduced, such as unit and unity. Read and study these concepts carefully, and don’t feel embarassed to backtrack if needed!

🏷️ Zero divisors

  • A zero divisor is a non-zero element \(a\) for which there exists a non-zero \(b\) such that \(ab=0\)

✍️ Example

In \(\mathbb{Z}_6\) the numbers 2 and 3 are zero divisors, as \(2\cdot 3 \equiv 0\mod(6)\). The same holds for the numbers 6 and 4 in \(\mathbb{Z}_8\).

However, 5 is not a zero divisor in the ring \(\mathbb{Z}_6\), as there is no \(a\in \mathbb{Z}_6\) for which \(5\cdot a\equiv 0\mod(6)\)

Next, we can distinguish between two types of rings: integral domains and fields.

🏷️ Integral domains

An integral domain is a commutative ring with unity \(1\neq 0\) that has no zero divisors

✍️ Example

\(\mathbb{Z}\) is a commutative ring and has no zero divisors, since we have \(a\cdot b = 0 \Leftrightarrow a=0 \lor b=0\). Therefore \(\mathbb{Z}\) is an integral domain.

🏷️ Fields

A field is a commutative ring with unity where every non-zero element is a unit.

A field is one of the most restricted structures. It may most easily be remembered as a number system where addition, subtraction, multiplication and division (except for zero) are all possible.

✍️ Examples

  • \(\mathbb{Q}\), \(\mathbb{R}\), and \(\mathbb{C}\) are a commutative rings where every non-zero element is a unit.
  • Is \(\mathbb{Z}_7\) a ring? Yes, every non-zero element a unit:
    • Let’s start by checking if 1 is a unit. Check, as \(1\cdot 1\).
    • Are 2 and 4 units? Yes, because \(2\cdot 4\equiv 1\mod(7)\).
    • Similarly, is there an element \(a\) such that \(a\cdot 3\equiv 1\mod(7)\)? The answer is 5.
    • Finally, 6 is a unit as \(6\cdot 6\equiv 1\mod(7)\)
  • By contrast, the factor group \(\mathbb{Z} / 6\mathbb{Z}\) is not field, as \(2\cdot 3 = 0\).

🏷️ Finite fields

A finite field is a field with finitely many elements.

For every finite field the number of elements is equal to a the power of a certain prime:

👉 For each prime \(p\) and integer \(n\geq 1\), there exists a unique (up to isomorphism) finite field with \(p^n\) elements, denoted by \(\mathbb{F}_{p^n}\).

✍️ Examples

  • \(\mathbb{Q}\), \(\mathbb{R}\), and \(\mathbb{C}\) have inifintely many elements!
  • \(\mathbb{Z}_7\) is a finite ring.
  • Finite fields can contain \(2, 3, 5, 8, 9, 11, 16, \ldots\) elements, as these can all be written as powers of a prime \(2^1, 3^1, 5^1, 2^3, 3^3, 11^1, 4^2, \ldots\). However, \(6, 10, \ldots\) cannot be written as a power of a prime, hence no finite groups exist with those quantities of elements.

📌 Ideals

In the previous section, we introduced factor groups (quotient groups). Roughly speaking, we divided a group into cosets, after which we could treat those cosets as elements of a new group. We would like to define an analogous concept to a quotient group for rings as well, namely factor or quotient rings.

For the concept of a quotient group, we needed a special condition on the subgroup, called normonality (see definition of quotient groups)). Although we did not elaborate on normal groups at that point, here we cannot take any random subset either, and we need a similar condition on the subset that is compatible with ring operations. That special kind of object is called an ideal.

🏷️ Ideals — definition

An additive subgroup \(N\) of a ring \(R\) satisfyiing below properties is an ideal.

\[ aN \subseteq N\quad\text{and}\quad Nb\subseteq N\quad \forall a, b\in R \]

In a commutative ring \(R\), an ideal \(N\neq R\) is prime if

\[ \forall a,b\in R, ab\in N\Rightarrow a\in N \lor b\in N. \]

✍️ Example 1

An example is the ring \(R=\mathbb{Z}\) with ideal \(N=I=6\mathbb{Z}\). This is an ideal, since \(\forall a\in\mathbb{Z}:\ a(6\mathbb{Z}) \subseteq 6\mathbb{Z}\) (all multiples of \(6\mathbb{Z}\) are in \(6\mathbb{Z}\)).

✍️ Example 2

The ring of polynomials with real coefficients \(R=\mathbb{R}[x]\) has an ideal \(N=I=\langle x^+1\rangle= \{(x^2+1)f(x)\mid f(x)\in R[x]\}\), i.e. the subgroup of all multiples of \((x^2 +1\) such as \((x^2 + 1)(x^3 + 4x +1)\).

1. Is the ideal closed under addition? Let’s check for \(p(x)=(x^2+1)f(x)\) and \(q(x)=(x^2+1)g(x)\). Then we have have:

\[ p(x)-q(x) =(x^2+1)f(x)-(x^2+1)g(x) =(x^2+1)(f(x)-g(x)). \]

This is again a multiple of \(x^2+1\) and hence part of the ideal. ꪜ

2. Absorption under multiplication

For any arbitrary polynomial \(h(x)\in \mathbb{R}[x]\) and an element of \(I\) \(p(x)=(x^2+1)f(x)\) we can write:

\[ h(x)p(x) =h(x)(x^2+1)f(x) =(x^2+1)(h(x)f(x)). \]

This is also a multiple \(x^2+1\), hence \(h(x)p(x)\in N\). Because \(\mathbb{R}[x]\) is commutative, we also have that \(p(x)h(x)\in I.\quad\) ꪜ

Intuitively we can consider \(I=(x^2+1)\) as all polynomials that are “divisible” by \(x^2+1\), for example \(2x^3+2x=2x(x^2+1)\in I\) and \(x^4+2x^2+1=(x^2+1)^2\in I\). However, \(x+1\notin I\), as \(x+1\) is not divisible by \(x^2+1\).

Loosely speaking, we may say that all elements \(r\in\mathbb{R}[x]\) are “absorbed” by the ideal:

\[ \boxed{r\in R[x],\ a\in I\quad\Longrightarrow\quad ra\in I.} \]

✍️ Counter example

On the contrary, with \(R=\mathbb{Z}^2\), the following additive subgroup is not an ideal:

\[ N= \left\{ \begin{pmatrix}a\\a\end{pmatrix} \;\middle|\; a\in\mathbb Z \right\}= \left\{ \begin{pmatrix}0\\0\end{pmatrix}, \begin{pmatrix}1\\1\end{pmatrix}, \begin{pmatrix}2\\2\end{pmatrix}, \begin{pmatrix}-1\\-1\end{pmatrix}, \ldots \right\}. \]

For an ideal we need to have \[ r\in R,\quad n\in N \quad\Longrightarrow\quad rn\in N. \]

But how is the multiplication defined here? The ring structure on \(\mathbb Z^2\) uses component-wise multiplication:

\[ \begin{pmatrix}a\\b\end{pmatrix} \begin{pmatrix}c\\d\end{pmatrix} = \begin{pmatrix}ac\\bd\end{pmatrix}. \]

So if we take

\[ n= \begin{pmatrix}1\\1\end{pmatrix}\in N,\quad r= \begin{pmatrix}1\\2\end{pmatrix}\in R \]

Then:

\[ rn= \begin{pmatrix}1\\2\end{pmatrix} \begin{pmatrix}1\\1\end{pmatrix} = \begin{pmatrix}1\\2\end{pmatrix}\notin N. \]

✍️ Examples: prime ideal

We can easily see that \(I=5\mathbb{Z}\) is an ideal of \(\mathbb{Z}\). But is it a prime ideal? Yes, because

\[ ab\in 5\mathbb{Z} \Rightarrow a\in 5\mathbb{Z} \lor b\in 5\mathbb{Z} \]

However, \(I=6\mathbb{Z}\) is not a prime ideal, as \(12\in 6\mathbb{Z}\), but 12 can be written as \(3\times 4\), and neither 3 nor 4 are in \(6\mathbb{Z}\).

🏷️ Factor rings (quotient rings)

if \(I\) is an ideal of ring \(R\), we can form the factor ring \(R/I\).

  • Its elements are the additive cosets \(a+I\ \forall a\in R\).
  • Operations are defined as
    • \((a+I)+(b+I)=(a+b)I\)
    • \((a+I)(b+I) = (ab)I\)
Note

This is similar to what we discussed in the section on quotient groups, where we considered complete cosets as elements of a new group.

The difference is that in the case of quotient groups we only have one operation, whereas for rings we have two (addition and multiplication)! The “absorption property” of an ideal makes the multiplication between cosets well-defined.

✍️ Example 1

Let \(p\) be a prime number. Then \(\mathbb{Z}/p\mathbb{Z}\) is a factor ring. For example \(\mathbb{Z}/7\mathbb{Z}\):

\[ \begin{eqnarray} (1+7\mathbb{Z}) + (5+7\mathbb{Z}) =(6+7\mathbb{Z}) \\ (2+7\mathbb{Z})(4+7\mathbb{Z})=(1+7\mathbb{Z}) \end{eqnarray} \]

✍️ Example 2

The quotient ring of polynomials: \(R=\mathbb{R}[x]/\langle x^2+1\rangle\).

Fun fact: \(R=\mathbb{R}[x]/\langle x^2+1\rangle \cong \mathbb{C} \cong \mathbb{R}^2\).

🏷️ Rings of polynomials

  • If \(F\) is a field, then \(F[x]\), the set of polynomials in the indermediate \(x\) with coefficients from \(F\), is a commutative ring with unity.
  • A polynomial \(f(x) \in F[x]\) is irreducible over \(F\) if it cannot be factored in two lower-degree non-constant polynomials in \(F[x]\). It is reducible otherwise.

✍️ Examples

Examples are \(\mathbb{R}[x]\), \(\mathbb{Q}[x]\), and \(\mathbb{C}[x]\), that can more explicitly be written as

\[ F[x] = a_0 + a_1x + a_2x^2 +\ldots+ a_n x^n \]

where \(a_0, a_1, \ldots a_n\) are taken from \(\mathbb{R}\), \(\mathbb{Q}\), or \(\mathbb{C}[x]\) respectively.

Next, let’s take a look a reducibility.

\[ f(x)=x^2-4x+3=(x-1)(x-3)\quad (x-1)\in\mathbb{R}, (x-3)\in\mathbb{R} \]

And although \(g(x)=x^2+1\) is not reducible in \(\mathbb{R}\), it is in \(\mathbb{C}\) (as it can be written as \((x+i)(x-i)\)).

🏷️ Divisibility and associates

  • Let \(R\) be a commutative ring. For \(a,b\in R\), we write \(b\mid a\) if \(\exists c\in R\) such that \(a=bc\).
  • Two elements \(a,b\in R\) are associates if \(a=bu\) for some unit \(u\in U(R)\). They are considered equivalent in terms of divisibility.

📖 Further reading