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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

262 Chapter 8 Groups<br />

EXERCISE 8.3.1 Finish the pro<strong>of</strong> that Z/(n) with operation ⊕n is a group with<br />

the following steps.<br />

(a) Show ⊕n is well defined.<br />

(b) Show ⊕n is associative.<br />

(c) Determine the identity element.<br />

(d) For an arbitrarily chosen [k], determine the inverse <strong>of</strong> [k].<br />

And we are done. Table 8.36 displays the final product for the case Z/(6).<br />

⊕n [0] [1] [2] [3] [4] [5]<br />

[0] [0] [1] [2] [3] [4] [5]<br />

[1] [1] [2] [3] [4] [5] [0]<br />

[2] [2] [3] [4] [5] [0] [1]<br />

[3] [3] [4] [5] [0] [1] [2]<br />

[4] [4] [5] [0] [1] [2] [3]<br />

[5] [5] [0] [1] [2] [3] [4]<br />

(8.36)<br />

Let’s take a closer look at the equivalence classes [0], [1],...,[n − 1], for<br />

there is another standard notation for these sets that we will use below when we<br />

derive quotient groups in general. Though we know from Eq. (8.33) what is in<br />

each equivalence class, let’s consider a way to visualize an arbitrary equivalence<br />

class [k] in terms <strong>of</strong> the subgroup <strong>of</strong> the integers (n) =[0] that motivated this<br />

whole mess in the first place.<br />

Picture all the integers on the number line in standard fashion, but pretend<br />

that each integer is like a key on a piano keyboard. Take countably infinitely<br />

many <strong>of</strong> your friends, and each <strong>of</strong> you place a finger on the elements <strong>of</strong> (n) =[0],<br />

so that you are pointing to all the multiples <strong>of</strong> n: {...,−2n, −n, 0,n,2n,...}. Now<br />

suppose you want to point to all the elements <strong>of</strong> some equivalence class [k]. How<br />

can you do it? Everyone in unison should lift his or her finger <strong>of</strong>f the keyboard,<br />

and everyone should shuffle over to the right k units, then put his or her finger back<br />

down. In other words, to generate all the elements <strong>of</strong> [k], take all the elements <strong>of</strong><br />

(n) and add k to each one, so that you are translating the entire set (n) through<br />

the integers by k units. Notice in this imagery, there will always be some person<br />

pointing to one <strong>of</strong> the integers {0, 1, 2,...,n− 1}. Here is another way to describe<br />

what we have done.<br />

[k] ={x + k : x ∈ (n)} (8.37)<br />

Let’s create new notation for the construction in Eq. (8.37), writing<br />

(n) + k ={x + k : x ∈ (n)} (8.38)<br />

<strong>This</strong> is a slight abuse <strong>of</strong> orthodox notation because it appears that we are combining<br />

the subgroup (n) with an integer k using integer addition. <strong>This</strong> notation

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

Saved successfully!

Ooh no, something went wrong!