Skip to main contentSkip to solution

A relation R = {(1,1),(2,2),(3,3),(1,2),(2,1),(1,3),(2,3)} on A = {1,2,3} will be an equivalence relation, if we delete:

Choose the correct answer from the options given below:

Solution

✅ Correct Option: 4

R is reflexive. For symmetry, (1,3)(1,3) has no (3,1)(3,1) and (2,3)(2,3) has no (3,2)(3,2). Deleting both (1,3)(1,3) and (2,3)(2,3) leaves {(1,1),(2,2),(3,3),(1,2),(2,1)}\{(1,1),(2,2),(3,3),(1,2),(2,1)\}, which is reflexive, symmetric, and transitive, hence an equivalence relation.

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question