Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Download

📚 The CoCalc Library - books, templates and other resources

132930 views
License: OTHER
Kernel:
%%html <link href="http://mathbook.pugetsound.edu/beta/mathbook-content.css" rel="stylesheet" type="text/css" /> <link href="https://aimath.org/mathbook/mathbook-add-on.css" rel="stylesheet" type="text/css" /> <style>.subtitle {font-size:medium; display:block}</style> <link href="https://fonts.googleapis.com/css?family=Open+Sans:400,400italic,600,600italic" rel="stylesheet" type="text/css" /> <link href="https://fonts.googleapis.com/css?family=Inconsolata:400,700&subset=latin,latin-ext" rel="stylesheet" type="text/css" /><!-- Hide this cell. --> <script> var cell = $(".container .cell").eq(0), ia = cell.find(".input_area") if (cell.find(".toggle-button").length == 0) { ia.after( $('<button class="toggle-button">Toggle hidden code</button>').click( function (){ ia.toggle() } ) ) ia.hide() } </script>

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.

ParseError: KaTeX parse error: \newcommand{\lt} attempting to redefine \lt; use \renewcommand

Section16.2Integral Domains and Fields

Let us briefly recall some definitions. If RR is a ring and rr is a nonzero element in R,R\text{,} then rr is said to be a if there is some nonzero element sRs \in R such that rs=0.rs = 0\text{.} A commutative ring with identity is said to be an if it has no zero divisors. If an element aa in a ring RR with identity has a multiplicative inverse, we say that aa is a . If every nonzero element in a ring RR is a unit, then RR is called a . A commutative division ring is called a .

Example16.12

If i2=1,i^2 = -1\text{,} then the set Z[i]={m+ni:m,nZ}{\mathbb Z}[ i ] = \{ m + ni : m, n \in {\mathbb Z} \} forms a ring known as the . It is easily seen that the Gaussian integers are a subring of the complex numbers since they are closed under addition and multiplication. Let α=a+bi\alpha = a + bi be a unit in Z[i].{\mathbb Z}[ i ]\text{.} Then α=abi\overline{\alpha} = a - bi is also a unit since if αβ=1,\alpha \beta = 1\text{,} then αβ=1.\overline{\alpha} \overline{\beta} = 1\text{.} If β=c+di,\beta = c + di\text{,} then

1=αβαβ=(a2+b2)(c2+d2).\begin{equation*} 1 = \alpha \beta \overline{\alpha} \overline{\beta} = (a^2 + b^2 )(c^2 + d^2). \end{equation*}

Therefore, a2+b2a^2 + b^2 must either be 1 or 1;-1\text{;} or, equivalently, a+bi=±1a + bi = \pm 1 or a+bi=±i.a+ bi = \pm i\text{.} Therefore, units of this ring are ±1\pm 1 and ±i;\pm i\text{;} hence, the Gaussian integers are not a field. We will leave it as an exercise to prove that the Gaussian integers are an integral domain.

Example16.13

The set of matrices

F={(1001),(1110),(0111),(0000)}\begin{equation*} F = \left\{ \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}, \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}, \begin{pmatrix} 0 & 1 \\ 1 & 1 \end{pmatrix}, \begin{pmatrix} 0 & 0 \\ 0 & 0 \end{pmatrix} \right\} \end{equation*}

with entries in Z2{\mathbb Z}_2 forms a field.

Example16.14

The set Q(2)={a+b2:a,bQ}{\mathbb Q}( \sqrt{2}\, ) = \{ a + b \sqrt{2} : a, b \in {\mathbb Q} \} is a field. The inverse of an element a+b2a + b \sqrt{2} in Q(2){\mathbb Q}( \sqrt{2}\, ) is

aa22b2+ba22b22.\begin{equation*} \frac{a}{a^2 - 2 b^2} +\frac{- b}{ a^2 - 2 b^2} \sqrt{2}. \end{equation*}

We have the following alternative characterization of integral domains.

Proposition16.15Cancellation Law

Let DD be a commutative ring with identity. Then DD is an integral domain if and only if for all nonzero elements aDa \in D with ab=ac,ab = ac\text{,} we have b=c.b=c\text{.}

Proof

Let DD be an integral domain. Then DD has no zero divisors. Let ab=acab = ac with a0.a \neq 0\text{.} Then a(bc)=0.a(b - c) =0\text{.} Hence, bc=0b - c = 0 and b=c.b = c\text{.}

Conversely, let us suppose that cancellation is possible in D.D\text{.} That is, suppose that ab=acab = ac implies b=c.b=c\text{.} Let ab=0.ab = 0\text{.} If a0,a \neq 0\text{,} then ab=a0ab = a 0 or b=0.b=0\text{.} Therefore, aa cannot be a zero divisor.

The following surprising theorem is due to Wedderburn.

Theorem16.16

Every finite integral domain is a field.

Proof

Let DD be a finite integral domain and DD^\ast be the set of nonzero elements of D.D\text{.} We must show that every element in DD^* has an inverse. For each aDa \in D^\ast we can define a map λa:DD\lambda_a : D^\ast \rightarrow D^\ast by λa(d)=ad.\lambda_a(d) = ad\text{.} This map makes sense, because if a0a \neq 0 and d0,d \neq 0\text{,} then ad0.ad \neq 0\text{.} The map λa\lambda_a is one-to-one, since for d1,d2D,d_1, d_2 \in D^*\text{,}

ad1=λa(d1)=λa(d2)=ad2\begin{equation*} ad_1 = \lambda_a(d_1) = \lambda_a(d_2) = ad_2 \end{equation*}

implies d1=d2d_1 = d_2 by left cancellation. Since DD^\ast is a finite set, the map λa\lambda_a must also be onto; hence, for some dD,d \in D^\ast\text{,} λa(d)=ad=1.\lambda_a(d) = ad = 1\text{.} Therefore, aa has a left inverse. Since DD is commutative, dd must also be a right inverse for a.a\text{.} Consequently, DD is a field.

For any nonnegative integer nn and any element rr in a ring RR we write r++rr + \cdots + r (nn times) as nr.nr\text{.} We define the of a ring RR to be the least positive integer nn such that nr=0nr=0 for all rR.r \in R\text{.} If no such integer exists, then the characteristic of RR is defined to be 0. We will denote the characteristic of RR by charR.\chr R\text{.}

Example16.17

For every prime p,p\text{,} Zp{\mathbb Z}_p is a field of characteristic p.p\text{.} By Proposition 3.4, every nonzero element in Zp{\mathbb Z}_p has an inverse; hence, Zp{\mathbb Z}_p is a field. If aa is any nonzero element in the field, then pa=0,pa =0\text{,} since the order of any nonzero element in the abelian group Zp{\mathbb Z}_p is p.p\text{.}

Lemma16.18

Let RR be a ring with identity. If 1 has order n,n\text{,} then the characteristic of RR is n.n\text{.}

Proof

If 1 has order n,n\text{,} then nn is the least positive integer such that n1=0.n 1 = 0\text{.} Thus, for all rR,r \in R\text{,}

nr=n(1r)=(n1)r=0r=0.\begin{equation*} nr = n(1r) = (n 1) r = 0r = 0. \end{equation*}

On the other hand, if no positive nn exists such that n1=0,n1 = 0\text{,} then the characteristic of RR is zero.

Theorem16.19

The characteristic of an integral domain is either prime or zero.

Proof

Let DD be an integral domain and suppose that the characteristic of DD is nn with n0.n \neq 0\text{.} If nn is not prime, then n=ab,n = ab\text{,} where 1<a<n1 \lt a \lt n and 1<b<n.1 \lt b \lt n\text{.} By Lemma 16.18, we need only consider the case n1=0.n 1 = 0\text{.} Since 0=n1=(ab)1=(a1)(b1)0 = n 1 = (ab)1 = (a1)(b1) and there are no zero divisors in D,D\text{,} either a1=0a1 =0 or b1=0.b1=0\text{.} Hence, the characteristic of DD must be less than n,n\text{,} which is a contradiction. Therefore, nn must be prime.