Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

From my basic understanding, $R$ is an equivalence relation on the set $A$, which is a relation between elements of a set that is reflexive, symmetric, and transitive.

I am not sure how to find the distinct equivalence classes of $R$ in the following relation:

$$A = \{-4,-3,-2,-1,0,1,2,3,4,5\}$$ $$\text{For all}\;x, y \in A,\;x\,R\,y \iff 3 \mid (x-y)$$

share|improve this question
    
Do you want to prove that the relation you defined is an equivalence relation or what? –  Albanian_EAGLE Apr 19 '13 at 15:18

3 Answers 3

up vote 4 down vote accepted

You are correct that the relation defined is an equivalence relation on A is an equivalence relation, essentially $$\forall x \in A, xRy \iff 3\mid (x - y) \iff x\equiv y \pmod 3$$

The relation $R$, i.e., defines congruence modulo $3$. So your task boils down to finding the congruence classes, $\pmod 3$.

Do you know how to find the equivalence classes of your set, $\pmod 3$?

  • Class one: Which elements have are divisible by $3$? $\quad A_0 = \{-3, 0, 3\}$
  • Class two: Which elements leave a remainder of $1$ when divided by $3$? $\quad A_1 =\{-2, 1, 4\}$
  • Class three: Which elements leave a remainder of $2$ when divided by $3$? $\quad A_2 = \{-4, -1, 2, 5\}$

You're done: three equivalence classes.

$$A = A_0 \cup A_1 \cup A_2 = \{-4,-3,-2,-1,0,1,2,3,4,5\},$$ $$ \quad A_i \cap A_j = \varnothing, \;\text{when}\;\;i\neq j, \text{ for}\;\; i, j \in \{0, 1, 2\}$$

share|improve this answer
    
No, I dont know how to find the equivalence classes of the set. Please help. –  CodeLover1985 Apr 19 '13 at 15:26
    
Perfectly explained. Now I know how to do the rest of the problems. Thanks! –  CodeLover1985 Apr 19 '13 at 15:37
    
You're welcome, CodeLover! –  amWhy Apr 19 '13 at 15:42
    
@amWhy: Excellent when you've answered and know you've taught! +1 –  Amzoti Apr 20 '13 at 2:09

Hint: When you need to list all equivalence classes, you should start with one element, and find it's equivalence class. For example, take $0$. Find $[0]_R=\{a\in A|aR0\}$. Then find the 'first' element which is not in $[0]_R$, call it $b$. Now find $[b]_R$. Continue untill you have listed all the elements of $A$.

share|improve this answer

Take an element (say, -4) and find all elements equivalent to it w. r. t. your relation (i. e. calculate the differences and find out if 3 divides them). Thus you'll have one equivalence class. Proceed in the same fashion until you classify all the elements.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.