Section 1.2 Examples of Rings
Example 1.2.2. (Ring of integers).
Example 1.2.3. (Rationals, Reals and Complex numbers).
Example 1.2.4. (Gaussian integers).
\begin{equation*}
\Z[i]=\{a+ib:a,b\in\Z\}
\end{equation*}
is a ring under the addition and the multiplication inherited from \(\C\text{.}\) This ring is called the ring of Gaussian integers. Given any \(x\in\Z[i]\) there are unique \(a,b\in\Z\) such that \(z=a+ib\text{.}\)Example 1.2.5. (Finite cyclic group as a ring).
\begin{equation*}
[i]\cdot[j]=[ij]
\end{equation*}
Here \(ij\) is the multiplication of integers \(i,j\) in \(\Z\text{.}\)Example 1.2.6. (Matrices over a ring).
\begin{equation*}
M_n(R)=\left\{(a_{ij})=\begin{pmatrix}a_{11}\amp a_{12}\amp\cdots\amp a_{1n}\\a_{21}\amp a_{22}\amp\cdots\amp a_{2n}\\\vdots\amp\vdots\amp\ddots\amp\vdots\\a_{n1}\amp a_{n2}\amp\cdots\amp a_{nn}\end{pmatrix}:a_{ij}\in R\right\}.
\end{equation*}
It is an abelian group under matrix addition.
\begin{equation*}
(a_{ij})+(b_{ij})=(a_{ij}+b_{ij})
\end{equation*}
The matrix multiplication gives \(M_{n}(R)\) a monoid structure.
\begin{equation*}
\begin{pmatrix}a_{11}\amp a_{12}\amp\cdots\amp a_{1n}\\a_{21}\amp a_{22}\amp\cdots\amp a_{2n}\\\vdots\amp\vdots\amp\ddots\amp\vdots\\a_{n1}\amp a_{n2}\amp\cdots\amp a_{nn}\end{pmatrix}\cdot\begin{pmatrix}b_{11}\amp b_{12}\amp\cdots\amp b_{1n}\\b_{21}\amp b_{22}\amp\cdots\amp b_{2n}\\\vdots\amp\vdots\amp\ddots\amp\vdots\\b_{n1}\amp b_{n2}\amp\cdots\amp b_{nn}\end{pmatrix}=\begin{pmatrix}\sum_ja_{1j}b_{j1}\amp \sum_ja_{1j}b_{j2}\amp\cdots\amp \sum_ja_{1j}b_{jn}\\\sum_ja_{2j}b_{j1}\amp \sum_ja_{2j}b_{j2}\amp\cdots\amp \sum_ja_{2j}b_{jn}\\\vdots\amp\vdots\amp\ddots\amp\vdots\\\sum_ja_{nj}b_{j1}\amp \sum_ja_{nj}b_{j2}\amp\cdots\amp \sum_ja_{nj}b_{jn}\end{pmatrix}
\end{equation*}
Example 1.2.7. (Triangular ring).
Consider an abelian group \(A\) with the group operation written additively. We write the additive identities of \({\mathbb{Z}}\) and \(A\) by \(0_{\mathbb{Z}}\) and \(0_A\text{,}\) respectively. For \(n\in\mathbb{N}\) and \(a\in A\) we make following conventions.
Left action:
\begin{equation}
n\cdot a=\underbrace{a+a+\cdots+a}_{n-\text{times}}\quad\text{and}\quad -n\cdot a=\underbrace{(-a)+(-a)+\cdots+(-a)}_{n-\text{times}}\tag{1.2.1}
\end{equation}
Right action:
\begin{equation}
a\cdot n=\underbrace{a+a+\cdots+a}_{n-\text{times}}\quad\text{and}\quad a\cdot (-n)=\underbrace{(-a)+(-a)+\cdots+(-a)}_{n-\text{times}}\tag{1.2.2}
\end{equation}
For \(0_{\mathbb{Z}}\in\mathbb{Z}\) and any \(a\in A\) we take
\begin{equation}
0_{\mathbb{Z}}\cdot a=0_A\quad\text{and}\quad a\cdot0_{\mathbb{Z}}=0_A.\tag{1.2.3}
\end{equation}
Consider a triangular ring.
\begin{equation*}
R=\left\{\begin{pmatrix}m\amp a\\0_{\mathbb{Z}}\amp n\end{pmatrix}:m,n\in\mathbb{Z}\text{ and }a\in A\right\}
\end{equation*}
The addition on \(R\) is defined as follows.
\begin{equation*}
\begin{pmatrix}m_1\amp a_1\\0_{\mathbb{Z}}\amp n_1\end{pmatrix}+\begin{pmatrix}m_2\amp a_2\\0_{\mathbb{Z}}\amp n_2\end{pmatrix}=\begin{pmatrix}m_1+m_2\amp a_1+a_2\\0_{\mathbb{Z}}\amp n_1+n_2\end{pmatrix}
\end{equation*}
The multiplication on \(R\) is defined as follows.
\begin{equation}
\begin{pmatrix}m_1\amp a_1\\0_{\mathbb{Z}}\amp n_1\end{pmatrix}\cdot\begin{pmatrix}m_2\amp a_2\\0_{\mathbb{Z}}\amp n_2\end{pmatrix}=\begin{pmatrix}m_1 m_2\amp m_1\cdot a_2+a_1\cdot n_2\\0_{\mathbb{Z}}\amp n_1n_2\end{pmatrix}\tag{1.2.4}
\end{equation}
Example 1.2.8. (Polynomial ring).
\begin{equation*}
R[X]=\left\{r_0+r_1X+\cdots +r_nX^n:r_i\in R\text{ and }n\in\mathbb{N}\right\}.
\end{equation*}
Addition and multiplication is defined in usual way:
\begin{gather*}
\text{Addition:}\;\text{ if }m\leq n\text{ then}\quad\sum_{i=0}^mr_iX^i+\sum_{j=0}^ns_jX^j=\sum_{k=0}^{m}(r_k+s_k)X^k+\sum_{j=m+1}^{n}s_jX^j\\
\text{We also assume }\sum_ia_iX^i+\sum_jb_jX^j=\sum_jb_jX^j+\sum_ia_iX^i\;\text{for any two elements of }R[X]\\
\text{Multiplication:}\quad\left(\sum_{i=0}^{m}r_iX^i\right)\left(\sum_{j=0}^{n}s_jX^j\right)=\sum_{i=0}^{m}\left(\sum_{j=0}^{n}r_is_jX^{j+i}\right)=r_0s_0+\sum_{i=1}^{m+n}\left(\sum_{j=0}^{i}r_js_{i-j}\right)X^i\\
\text{We also assume that }\sum_ir_iX^i=\sum_is_iX^i\;\text{if and only if}\;r_i=s_i\;\text{for every }i.
\end{gather*}
Example 1.2.9. (Opposite Ring).
- We denote elements of \(R^{\rm op}\) by \(r^{\rm op}\text{.}\) Thus when \(r\in R\) is viewed as an element of \(R^{\rm op}\) we denote it by \(r^{\rm op}\text{.}\)
- The underlying set and the abelian group structure of \(R^{\rm op}\) is the same as that of \(R\text{.}\) In other words, \((R^{\rm op},+)=(R,+)\text{.}\) Hence for \(r,s\in R\) we have\begin{equation*} r^{\rm op}+s^{\rm op}=(r+s)^{\rm op}. \end{equation*}
- The multiplication is defined as follows: for \(r^{\rm op},s^{\rm op}\in R^{\rm op}\text{,}\) i.e., for \(r,s\in R\)\begin{equation*} r^{\rm op}s^{\rm op}=(sr)^{\rm op}. \end{equation*}
Example 1.2.10. (Product of rings).
\begin{gather*}
(\ldots,r_i,\ldots)+(\ldots,s_i,\ldots)=(\ldots,r_i+s_i,\ldots)\\
(\ldots,r_i,\ldots)(\ldots,s_i,\ldots)=(\ldots,r_is_i,\ldots)
\end{gather*}
Similar to the above construction we have the following example.
Let \(R\) be a ring and let \(I\) be a nonempty set. Let \(R^I\) be the set of all functions from \(I\) to \(R\text{.}\) The set \(R^I\) is a ring with following operations of addition and multiplication.
\begin{gather*}
\text{Addition:}\quad (f+g)(i)=f(i)+g(i)\\
\text{Additive Identity:}\quad\mathbf{0}\colon I\to R\quad\text{give by}\quad i\mapsto 0\quad\text{for every}\;i\in I\\
\text{Multiplication:}\quad (fg)(i)=f(i)g(i)\\
\text{Multiplicative Identity:}\quad \unit\colon I\to R\quad\text{given by}\quad i\mapsto 1\quad\text{for every}\quad i\in I
\end{gather*}
Example 1.2.11. (Endomorphisms of a vector space).
- Addition: \((f+g)(v)=\underbrace{f(v)+g(v)}_{\text{addition in }V}\) for \(f,g\in\End_F(V)\) and \(v\in V\)
- Multiplication: \((f\circ g)(v)=f\left(g(v)\right)\) for \(f,g\in\End_F(V)\) and \(v\in V\)
Example 1.2.12. (Continuous real-valued functions).
\begin{equation*}
C(I)=\{f\colon I\to\R:f\text{ is continuous}\}
\end{equation*}
is a ring under addition of functions and the multiplication defined as follows.
\begin{equation*}
\left(f\cdot g\right)(x)=f(x)g(x)\quad\text{for}\; f,g\in C(I)\;\text{and}\;x\in I.
\end{equation*}
