Let R be the relation on the set of ordered pairs of positive integers such that if and only if ad = bc. Show that R is an equivalence relations.

Printable View

- July 7th 2007, 07:18 AMTheRekzequivalence relations
Let R be the relation on the set of ordered pairs of positive integers such that if and only if ad = bc. Show that R is an equivalence relations.

- July 7th 2007, 07:43 AMJhevon
this is just a case of applying definitions. Do you know what it means for a relation to be an equivalence relation? reflexive? symmetric? transitive?

Hint: A relation is said to be an "equivalence relation" if it is reflexive, symmetric and transitive.

Proving each of those cases are true for this relation should not be very difficult

Hint 2: A somewhat similar problem was done here. There are also definitions for all the terms mentioned in that thread as well. Use it as a guide - July 7th 2007, 09:23 AMTheRekz
I am confused on how to proof an ordered pair is reflexive or not

- July 7th 2007, 09:34 AMJhevon
The transitive part is actually the toughest to prove. but i'll give you the reflexive part just so you see how to work with it.

**Proof (incomplete):**

Let be a relation on the set , such that .

First, we show that is reflexive. Since we have . Thus is reflexive.

....now continue - July 7th 2007, 09:48 AMred_dog
1) Reflexivity:

, which is true.

2) Simmetry:

3) Tranzitivity:

(1)

(2)

From (1) and (2)