(a) For each of the following relations R on the given domains A, categorize them as not an equivalence relation, an equivalence relation with finitely many distinct equivalence classes, or an equivalence relation with infinitely many distinct equivalence classes. Justify each decision with a brief proof.

(i) A = {1, 2, 3} , R = {(1, 1),(2, 2),(3, 3)}

(ii) A = R, R = {(x, y) | x 2 = y 2}

(iii) A = Z, R = {(x, y) | x ≡ y (mod 4)}

(iv) A = P(Z +), R = {(x, y) | x ⊆ y}

(b) Comparing the congruence class of 6 modulo 8 and the congruence class of 6 modulo 12, which of the following is true? Prove the statement if true; disprove it if false.

(i) [6]8 ⊆ [6]12

(ii) [6]12 ⊆ [6]8

(iii) [6]8 ∩ [6]12 = ∅

Answer rating: 100% (QA)

A relation R defined on set A is said to be equivalence relation if it is reflexive symmetric and transitive R is reflexive that is xRx for all x belo... View the full answer