{ "cells": [ {"cell_type": "code", "execution_count":null, "metadata":{}, "source":["%%html\n\n\n\n\n\n\n"], "outputs":[]}, {"cell_type":"markdown", "metadata":{}, "source":["**Important:** to view this notebook properly you will need to execute the cell above, which assumes you have an Internet connection. It should already be selected, or place your cursor anywhere above to select. Then press the \"Run\" button in the menu bar above (the right-pointing arrowhead), or press Shift-Enter on your keyboard."]}, {"cell_type":"markdown", "metadata":{}, "source":["$\\newcommand{\\identity}{\\mathrm{id}}\n\\newcommand{\\notdivide}{\\nmid}\n\\newcommand{\\notsubset}{\\not\\subset}\n\\newcommand{\\lcm}{\\operatorname{lcm}}\n\\newcommand{\\gf}{\\operatorname{GF}}\n\\newcommand{\\inn}{\\operatorname{Inn}}\n\\newcommand{\\aut}{\\operatorname{Aut}}\n\\newcommand{\\Hom}{\\operatorname{Hom}}\n\\newcommand{\\cis}{\\operatorname{cis}}\n\\newcommand{\\chr}{\\operatorname{char}}\n\\newcommand{\\Null}{\\operatorname{Null}}\n\\newcommand{\\lt}{<}\n\\newcommand{\\gt}{>}\n\\newcommand{\\amp}{&}\n$"]}, {"cell_type":"markdown", "metadata":{}, "source":["

Section16.1Rings

"]}, {"cell_type":"markdown", "metadata":{}, "source":["

A nonempty set $R$ is a ring if it has two closed binary operations, addition and multiplication, satisfying the following conditions.

  1. $a + b = b + a$ for $a, b \\in R\\text{.}$

  2. $(a + b) + c = a + ( b + c)$ for $a, b, c \\in R\\text{.}$

  3. There is an element $0$ in $R$ such that $a + 0 = a$ for all $a \\in R\\text{.}$

  4. For every element $a \\in R\\text{,}$ there exists an element $-a$ in $R$ such that $a + (-a) = 0\\text{.}$

  5. $(ab) c = a ( b c)$ for $a, b, c \\in R\\text{.}$

  6. For $a, b, c \\in R\\text{,}$

    \n\\begin{align*}\na( b + c)&= ab +ac\\\\\n(a + b)c & = ac + bc.\n\\end{align*}\n

This last condition, the distributive axiom, relates the binary operations of addition and multiplication. Notice that the first four axioms simply require that a ring be an abelian group under addition, so we could also have defined a ring to be an abelian group $(R, +)$ together with a second binary operation satisfying the fifth and sixth conditions given above.

"]}, {"cell_type":"markdown", "metadata":{}, "source":["

If there is an element $1 \\in R$ such that $1 \\neq 0$ and $1a = a1 = a$ for each element $a \\in R\\text{,}$ we say that $R$ is a ring with unity or identity. A ring $R$ for which $ab = ba$ for all $a, b$ in $R$ is called a commutative ring. A commutative ring $R$ with identity is called an integral domain if, for every $a, b \\in R$ such that $ab = 0\\text{,}$ either $a = 0$ or $b = 0\\text{.}$ A division ring is a ring $R\\text{,}$ with an identity, in which every nonzero element in $R$ is a unit; that is, for each $a \\in R$ with $a \\neq 0\\text{,}$ there exists a unique element $a^{-1}$ such that $a^{-1} a = a a^{-1} = 1\\text{.}$ A commutative division ring is called a field. The relationship among rings, integral domains, division rings, and fields is shown in Figure 16.1.

"]}, {"cell_type":"markdown", "metadata":{}, "source":["
\"\"
Figure16.1Types of rings
"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Example16.2

As we have mentioned previously, the integers form a ring. In fact, ${\\mathbb Z}$ is an integral domain. Certainly if $a b = 0$ for two integers $a$ and $b\\text{,}$ either $a=0$ or $b=0\\text{.}$ However, ${\\mathbb Z}$ is not a field. There is no integer that is the multiplicative inverse of 2, since $1/2$ is not an integer. The only integers with multiplicative inverses are 1 and $-1\\text{.}$

"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Example16.3

Under the ordinary operations of addition and multiplication, all of the familiar number systems are rings: the rationals, ${\\mathbb Q}\\text{;}$ the real numbers, ${\\mathbb R}\\text{;}$ and the complex numbers, ${\\mathbb C}\\text{.}$ Each of these rings is a field.

"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Example16.4

We can define the product of two elements $a$ and $b$ in ${\\mathbb Z}_n$ by $ab \\pmod{n}\\text{.}$ For instance, in ${\\mathbb Z}_{12}\\text{,}$ $5 \\cdot 7 \\equiv 11 \\pmod{12}\\text{.}$ This product makes the abelian group ${\\mathbb Z}_n$ into a ring. Certainly ${\\mathbb Z}_n$ is a commutative ring; however, it may fail to be an integral domain. If we consider $3 \\cdot 4 \\equiv 0 \\pmod{12}$ in ${\\mathbb Z}_{12}\\text{,}$ it is easy to see that a product of two nonzero elements in the ring can be equal to zero.

"]}, {"cell_type":"markdown", "metadata":{}, "source":["

A nonzero element $a$ in a ring $R$ is called a zero divisor if there is a nonzero element $b$ in $R$ such that $ab = 0\\text{.}$ In the previous example, 3 and 4 are zero divisors in ${\\mathbb Z}_{12}\\text{.}$

"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Example16.5

In calculus the continuous real-valued functions on an interval $[a,b]$ form a commutative ring. We add or multiply two functions by adding or multiplying the values of the functions. If $f(x) = x^2$ and $g(x) = \\cos x\\text{,}$ then $(f+g)(x) = f(x) + g(x) = x^2 + \\cos x$ and $(fg)(x) = f(x) g(x) = x^2 \\cos x\\text{.}$

"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Example16.6

The $2 \\times 2$ matrices with entries in ${\\mathbb R}$ form a ring under the usual operations of matrix addition and multiplication. This ring is noncommutative, since it is usually the case that $AB \\neq BA\\text{.}$ Also, notice that we can have $AB = 0$ when neither $A$ nor $B$ is zero.

"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Example16.7

For an example of a noncommutative division ring, let

\n\\begin{equation*}\n1 = \n\\begin{pmatrix}\n1 & 0 \\\\\n0 & 1\n\\end{pmatrix},\n\\quad\n{\\mathbf i}\n=\n\\begin{pmatrix}\n0 & 1 \\\\\n-1 & 0\n\\end{pmatrix},\n\\quad\n{\\mathbf j} =\n\\begin{pmatrix}\n0 & i \\\\\ni & 0\n\\end{pmatrix},\n\\quad\n{\\mathbf k} = \n\\begin{pmatrix}\ni & 0 \\\\\n0 & -i\n\\end{pmatrix},\n\\end{equation*}\n

where $i^2 = -1\\text{.}$ These elements satisfy the following relations:

\n\\begin{align*}\n{\\mathbf i}^2 = {\\mathbf j}^2 & = {\\mathbf k}^2 = -1\\\\\n{\\mathbf i} {\\mathbf j} & = {\\mathbf k} \\\\\n{\\mathbf j} {\\mathbf k} & = {\\mathbf i} \\\\\n{\\mathbf k} {\\mathbf i} & = {\\mathbf j} \\\\\n{\\mathbf j} {\\mathbf i} & = - {\\mathbf k} \\\\\n{\\mathbf k} {\\mathbf j} & = - {\\mathbf i} \\\\\n{\\mathbf i} {\\mathbf k} & = - {\\mathbf j}. \n\\end{align*}\n

Let ${\\mathbb H}$ consist of elements of the form $a + b {\\mathbf i} + c {\\mathbf j} +d {\\mathbf k}\\text{,}$ where $a, b , c, d$ are real numbers. Equivalently, ${\\mathbb H}$ can be considered to be the set of all $2 \\times 2$ matrices of the form

\n\\begin{equation*}\n\\begin{pmatrix}\n\\alpha & \\beta \\\\\n-\\overline{\\beta} & \\overline{\\alpha }\n\\end{pmatrix},\n\\end{equation*}\n

where $\\alpha = a + di$ and $\\beta = b+ci$ are complex numbers. We can define addition and multiplication on ${\\mathbb H}$ either by the usual matrix operations or in terms of the generators 1, ${\\mathbf i}\\text{,}$ ${\\mathbf j}\\text{,}$ and ${\\mathbf k}\\text{:}$

\n\\begin{gather*}\n(a_1 + b_1 {\\mathbf i} + c_1 {\\mathbf j} +d_1 {\\mathbf k} ) + ( a_2 + b_2 {\\mathbf i} + c_2 {\\mathbf j} +d_2 {\\mathbf k} )\\\\\n= (a_1 + a_2) + ( b_1 + b_2) {\\mathbf i} + ( c_1 + c_2) \\mathbf j + (d_1 + d_2) \\mathbf k\n\\end{gather*}\n

and

\n\\begin{equation*}\n(a_1 + b_1 {\\mathbf i} + c_1 {\\mathbf j} +d_1 {\\mathbf k} ) ( a_2 + b_2 {\\mathbf i} + c_2 {\\mathbf j} +d_2 {\\mathbf k} ) = \\alpha + \\beta {\\mathbf i} + \\gamma {\\mathbf j} + \\delta {\\mathbf k},\n\\end{equation*}\n

where

\n\\begin{align*}\n\\alpha & = a_1 a_2 - b_1 b_2 - c_1 c_2 -d_1 d_2\\\\\n\\beta & = a_1 b_2 + a_2 b_1 + c_1 d_2 - d_1 c_2\\\\\n\\gamma & = a_1 c_2 - b_1 d_2 + c_1 a_2 + d_1 b_2\\\\\n\\delta & = a_1 d_2 + b_1 c_2 - c_1 b_2 + d_1 a_2.\n\\end{align*}\n

Though multiplication looks complicated, it is actually a straightforward computation if we remember that we just add and multiply elements in ${\\mathbb H}$ like polynomials and keep in mind the relationships between the generators ${\\mathbf i}\\text{,}$ ${\\mathbf j}\\text{,}$ and ${\\mathbf k}\\text{.}$ The ring ${\\mathbb H}$ is called the ring of quaternions.

To show that the quaternions are a division ring, we must be able to find an inverse for each nonzero element. Notice that

\n\\begin{equation*}\n( a + b {\\mathbf i} + c {\\mathbf j} +d {\\mathbf k} )( a - b {\\mathbf i} - c {\\mathbf j} -d {\\mathbf k} ) = a^2 + b^2 + c^2 + d^2.\n\\end{equation*}\n

This element can be zero only if $a\\text{,}$ $b\\text{,}$ $c\\text{,}$ and $d$ are all zero. So if $a + b {\\mathbf i} + c {\\mathbf j} +d {\\mathbf k} \\neq 0\\text{,}$

\n\\begin{equation*}\n( a + b {\\mathbf i} + c {\\mathbf j} +d {\\mathbf k} )\\left( \\frac{a - b {\\mathbf i} - c {\\mathbf j} - d {\\mathbf k} }{ a^2 + b^2 + c^2 + d^2 } \\right) = 1.\n\\end{equation*}\n
"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Proposition16.8

Let $R$ be a ring with $a, b \\in R\\text{.}$ Then

  1. $a0 = 0a = 0\\text{;}$

  2. $a(-b) = (-a)b = -ab\\text{;}$

  3. $(-a)(-b) =ab\\text{.}$

Proof

To prove (1), observe that

\n\\begin{equation*}\na0 = a(0+0)= a0+ a0;\n\\end{equation*}\n

hence, $a0=0\\text{.}$ Similarly, $0a = 0\\text{.}$ For (2), we have $ab + a(-b) = a(b-b) = a0 = 0\\text{;}$ consequently, $-ab = a(-b)\\text{.}$ Similarly, $-ab = (-a)b\\text{.}$ Part (3) follows directly from (2) since $(-a)(-b) = -(a(- b)) = -(-ab) = ab\\text{.}$

"]}, {"cell_type":"markdown", "metadata":{}, "source":["

Just as we have subgroups of groups, we have an analogous class of substructures for rings. A subring $S$ of a ring $R$ is a subset $S$ of $R$ such that $S$ is also a ring under the inherited operations from $R\\text{.}$

"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Example16.9

The ring $n {\\mathbb Z}$ is a subring of ${\\mathbb Z}\\text{.}$ Notice that even though the original ring may have an identity, we do not require that its subring have an identity. We have the following chain of subrings:

\n\\begin{equation*}\n{\\mathbb Z} \\subset {\\mathbb Q} \\subset {\\mathbb R} \\subset {\\mathbb C}.\n\\end{equation*}\n
"]}, {"cell_type":"markdown", "metadata":{}, "source":["

The following proposition gives us some easy criteria for determining whether or not a subset of a ring is indeed a subring. (We will leave the proof of this proposition as an exercise.)

"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Proposition16.10

Let $R$ be a ring and $S$ a subset of $R\\text{.}$ Then $S$ is a subring of $R$ if and only if the following conditions are satisfied.

  1. $S \\neq \\emptyset\\text{.}$

  2. $rs \\in S$ for all $r, s \\in S\\text{.}$

  3. $r-s \\in S$ for all $r, s \\in S\\text{.}$

"]}, {"cell_type":"markdown", "metadata":{}, "source":["
Example16.11

Let $R ={\\mathbb M}_2( {\\mathbb R} )$ be the ring of $2 \\times 2$ matrices with entries in ${\\mathbb R}\\text{.}$ If $T$ is the set of upper triangular matrices in $R\\text{;}$ i.e.,

\n\\begin{equation*}\nT =\n\\left\\{\n\\begin{pmatrix}\na & b \\\\\n0 & c\n\\end{pmatrix}\n: a, b, c \\in {\\mathbb R}\n\\right\\},\n\\end{equation*}\n

then $T$ is a subring of $R\\text{.}$ If

\n\\begin{equation*}\nA =\n\\begin{pmatrix}\na & b \\\\\n0 & c\n\\end{pmatrix}\n\\quad \\text{and} \\quad\nB =\n\\begin{pmatrix}\na' & b' \\\\\n0 & c'\n\\end{pmatrix}\n\\end{equation*}\n

are in $T\\text{,}$ then clearly $A-B$ is also in $T\\text{.}$ Also,

\n\\begin{equation*}\nAB =\n\\begin{pmatrix}\na a' & ab' + bc' \\\\\n0 & cc'\n\\end{pmatrix}\n\\end{equation*}\n

is in $T\\text{.}$

"]} ], "nbformat": 4, "nbformat_minor": 0, "metadata": {"kernelspec": {"display_name": "", "name": "sagemath"}, "language_info": {"codemirror_mode": {"name": "ipython", "version": 2}, "file_extension": ".py", "mimetype": "text/x-python", "name": "python", "nbconvert_exporter": "python", "pygments_lexer": "ipython2", "version": "2.7.8"}, "name": "section-rings-definitions.ipynb"} }