15.12.2012 Views

Why Read This Book? - Index of

Why Read This Book? - Index of

Why Read This Book? - Index of

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

294 Chapter 9 Rings<br />

A subring S <strong>of</strong> a ring R is merely a subgroup <strong>of</strong> the additive group that is also<br />

closed under multiplication. We call {0} the trivial subring, and all subrings other<br />

than {0} and R itself are called proper subrings.<br />

Example 9.2.1 The integers are a subring <strong>of</strong> the rationals, and the rationals are<br />

a subring <strong>of</strong> the real numbers. �<br />

If R has a unity, it is not necessary that the unity be in S in order for S to be a<br />

subring <strong>of</strong> R.<br />

Example 9.2.2 Let m be a positive integer, and write mZ ={km : k ∈ Z}, the<br />

set <strong>of</strong> integer multiples <strong>of</strong> m. <strong>This</strong> is another common notation for the set in<br />

Eq. (8.31), where we denoted by (m) the subgroup <strong>of</strong> the additive group <strong>of</strong> integers<br />

generated by m. Then mZ is a subring <strong>of</strong> the integers, because it is a subgroup <strong>of</strong><br />

the integers under addition, and it is closed under multiplication. If m ≥ 2, then<br />

mZ does not contain 1. �<br />

EXERCISE 9.2.3 Find all subrings <strong>of</strong> Z6 and Z7.<br />

Example 9.2.4 Z2×2 is a subring <strong>of</strong> R2×2. �<br />

EXERCISE 9.2.5 Call a square matrix diagonal if its only nonzero entries lie<br />

on the main diagonal. Let D2×2 be the subset <strong>of</strong> Z2×2 consisting <strong>of</strong> the diagonal<br />

matrices. Then D2×2 is a subring <strong>of</strong> Z2×2.<br />

Example 9.2.6 In this example, we create a subring <strong>of</strong> the rational numbers that<br />

we will return to in Section 9.9. Let QOD be the subset <strong>of</strong> the rational numbers<br />

whose denominators are odd. There is more than one way to denote an element<br />

<strong>of</strong> QOD. The form<br />

� �<br />

m<br />

: m, n ∈ Z<br />

(9.12)<br />

2n + 1<br />

is an obvious way. But another useful way to denote the set is to exploit the prime<br />

factorization <strong>of</strong> the numerator and denominator, isolating 2 to keep it separate<br />

from all the other primes involved. <strong>This</strong> works for all elements except zero, which<br />

we throw in separately.<br />

QOD ={0}∪<br />

�<br />

± 2n p1p2 ···pr<br />

q1q2 ···qs<br />

: n ∈ W and pi,qi are odd primes<br />

�<br />

for all 1 ≤ i ≤ r and 1 ≤ i ≤ s<br />

(9.13)<br />

The amount <strong>of</strong> repetition among the pi and qi does not matter. And notice that<br />

the form <strong>of</strong> an element in Eq. (9.13) includes 1 by letting n = 0, r = s = 1 and

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!