Home
Class 12
MATHS
Which one of the following is not an equ...

Which one of the following is not an equivalence relation?

A

`R_(1)` on Z defined by a `R_(1) b iff a - b` is divisible by m, where m is a fixed positive integer.

B

`R_(2)` on R defined by a `R_(2) b iff 1 + ab gt 0 " for all "a, b in R`.

C

`R_(3)` on `N xx N` defined by (a, b) `R_(3)` (c, d) `iff` ad = bc for all a, b, c, d `in` N.

D

`R_(4)` on Z defined by `aR_(4)` b `iff` a-b is an even integer for all `a, b in Z`.

Text Solution

AI Generated Solution

The correct Answer is:
To determine which of the given relations is not an equivalence relation, we need to check each relation against the three properties of equivalence relations: reflexivity, symmetry, and transitivity. ### Step-by-Step Solution 1. **Identify the Relations**: We have four relations to evaluate (let's denote them as R1, R2, R3, and R4). 2. **Check R1**: - **Relation**: A - B is divisible by M. - **Reflexive**: For any element A, A - A = 0, which is divisible by M. (True) - **Symmetric**: If A - B is divisible by M, then B - A is also divisible by M. (True) - **Transitive**: If A - B is divisible by M and B - C is divisible by M, then A - C is also divisible by M. (True) - **Conclusion**: R1 is an equivalence relation. 3. **Check R2**: - **Relation**: 1 + aR2b if 1 + ab > 0. - **Reflexive**: For any a, 1 + a^2 > 0 (True). - **Symmetric**: If 1 + ab > 0, then 1 + ba > 0 (True). - **Transitive**: Check with specific values: - Let a = 1, b = 1/2, c = -1. - 1 + 1*(1/2) > 0 (True), and 1 + (1/2)(-1) > 0 (False). - Therefore, 1 + 1*(-1) = 0, which is not greater than 0. (False) - **Conclusion**: R2 is not transitive, hence not an equivalence relation. 4. **Check R3**: - **Relation**: If (a, b) is related to (c, d), then ad = bc. - **Reflexive**: For any a, a*a = a^2 (True). - **Symmetric**: If ad = bc, then bc = ad (True). - **Transitive**: If ad = bc and be = cd, then ae = bd (True). - **Conclusion**: R3 is an equivalence relation. 5. **Check R4**: - **Relation**: A - B is an even integer. - **Reflexive**: A - A = 0, which is even (True). - **Symmetric**: If A - B is even, then B - A is also even (True). - **Transitive**: If A - B and B - C are even, then A - C is also even (True). - **Conclusion**: R4 is an equivalence relation. ### Final Conclusion After checking all relations, we find that R2 is not an equivalence relation because it fails the transitive property.

To determine which of the given relations is not an equivalence relation, we need to check each relation against the three properties of equivalence relations: reflexivity, symmetry, and transitivity. ### Step-by-Step Solution 1. **Identify the Relations**: We have four relations to evaluate (let's denote them as R1, R2, R3, and R4). 2. **Check R1**: - **Relation**: A - B is divisible by M. ...
Promotional Banner

Topper's Solved these Questions

  • CARTESIAN PRODUCT OF SETS AND RELATIONS

    OBJECTIVE RD SHARMA ENGLISH|Exercise Section I - Solved Mcqs|34 Videos
  • CARTESIAN PRODUCT OF SETS AND RELATIONS

    OBJECTIVE RD SHARMA ENGLISH|Exercise Section II - Assertion Reason Type|6 Videos
  • AREAS OF BOUNDED REGIONS

    OBJECTIVE RD SHARMA ENGLISH|Exercise Chapter Test|60 Videos
  • CIRCLES

    OBJECTIVE RD SHARMA ENGLISH|Exercise Chapter Test|53 Videos

Similar Questions

Explore conceptually related problems

Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A ?

Which of the following is an equivalence relation?

Which of the following is not an equivalence relation on Z ? a\ R\ bhArra-b is an even integer

Let A = {p, q, r}. Which of the following is an equivalence relation on A?

Define an equivalence relation.

If A={1,2,3} then which of the following relations are equivalence relation on A?

Which of one of the following relations on R is equivalence relation

Which one of the following is related type

Which one of the following relations on R is an equivalence relation?

OBJECTIVE RD SHARMA ENGLISH-CARTESIAN PRODUCT OF SETS AND RELATIONS -Chapter Test
  1. Which one of the following is not an equivalence relation?

    Text Solution

    |

  2. If n(AxxB)=45, then n (A) cannot be

    Text Solution

    |

  3. Set builder form of the relation R={(-2, -7),(-1, -4),(0,-1),(1,2),...

    Text Solution

    |

  4. If A = {(a, b, c, l, m, n}, then the maximum number of elements in any...

    Text Solution

    |

  5. If A={1, 2, 3}, then the relation R={(1,1),(2,2),(3,1),(1,3)}, is

    Text Solution

    |

  6. If relation R is defined as: aRb if ''a is the father of b''. Then, R ...

    Text Solution

    |

  7. If R={(a,b): |a+b|=a+b} is a relation defined on a set {-1, 0, 1}, the...

    Text Solution

    |

  8. A relation between two persons is defined as follows: aRb iff a and bo...

    Text Solution

    |

  9. Which of the following is an equivalence relation?

    Text Solution

    |

  10. Consider the following statements: (i) Every reflexive relation is ...

    Text Solution

    |

  11. Let A be a set of compartments in a train. Then the relation R defined...

    Text Solution

    |

  12. If a set has 13 elements and R is a reflexive relation on A with n ele...

    Text Solution

    |

  13. The relation 'is not equal to' is defined on R, is

    Text Solution

    |

  14. Assertion and Reason type questions :Consider the following statements...

    Text Solution

    |

  15. Let X be the set of all engineering colleges in a state of Indian Repu...

    Text Solution

    |

  16. If R = {(a,b) : a+b=4} is a relation on N, then R is

    Text Solution

    |

  17. If A is a non-empty set, then which of the following is {:(f,a,l,s,e,?...

    Text Solution

    |

  18. If A = {x, y, z}, then the relation R={(x,x),(y,y),(z,z),(z,x),(z,y...

    Text Solution

    |

  19. Assertion and Reason type questions :Consider the following statements...

    Text Solution

    |

  20. The relation ''is a factor of'' on the set N of all natural number is ...

    Text Solution

    |

  21. The relation R={(1,3),(3,5)} is defined on the set with minimum number...

    Text Solution

    |