Home
Class 12
MATHS
Statement-1: On the set Z of all odd in...

Statement-1: On the set Z of all odd integers relation R defined by
`(a, b) in R iff a-b` is even for all `a, b in Z` is an equivalence relation.
Statement-2: If a relation R on a set A is symmetric and transitive, then it is reflexive and hence an equivalence relation, because
`(a, b) in Rimplies(b, a)in R" [By symmetry]"`
`(a, b)in R and (b, a) in Rimplies (a,a)in R " [By transitivity]"`

A

Statement-1 is True, Statement-2 is true, Statement-2 is a correct explanation for statement-1.

B

Statement-1 is True, Statement-2 is true, Statement-2 is not a correct explanation for Statement-1.

C

Statement-1 is True, Statement-2 is False

D

Statement-1 is False, Statement-2 is True.

Text Solution

AI Generated Solution

The correct Answer is:
To solve the given problem, we will analyze both statements step by step. ### Step 1: Analyze Statement 1 **Statement 1:** On the set Z of all odd integers, relation R defined by (a, b) in R iff a - b is even for all a, b in Z is an equivalence relation. **Solution:** 1. **Reflexivity:** For any odd integer a, a - a = 0, which is even. Thus, (a, a) is in R for all a in Z. Therefore, R is reflexive. 2. **Symmetry:** If (a, b) is in R, then a - b is even. This implies that b - a = -(a - b) is also even. Hence, (b, a) is in R. Therefore, R is symmetric. 3. **Transitivity:** If (a, b) is in R and (b, c) is in R, then a - b is even and b - c is even. Adding these gives (a - b) + (b - c) = a - c, which is even. Thus, (a, c) is in R. Therefore, R is transitive. Since R is reflexive, symmetric, and transitive, it is an equivalence relation. ### Conclusion for Statement 1: **Statement 1 is true.** ### Step 2: Analyze Statement 2 **Statement 2:** If a relation R on a set A is symmetric and transitive, then it is reflexive and hence an equivalence relation. **Solution:** 1. **Counterexample:** Consider a relation R on set A = {1, 2} defined as R = {(1, 2), (2, 1)}. - This relation is symmetric because (1, 2) implies (2, 1). - It is transitive because there are no pairs (a, b) and (b, c) such that a ≠ c. - However, it is not reflexive because (1, 1) and (2, 2) are not in R. Since we found a counterexample where R is symmetric and transitive but not reflexive, Statement 2 is false. ### Conclusion for Statement 2: **Statement 2 is false.** ### Final Conclusion: - Statement 1 is true. - Statement 2 is false. ### Correct Option: The correct option is that Statement 1 is true and Statement 2 is false. ---

To solve the given problem, we will analyze both statements step by step. ### Step 1: Analyze Statement 1 **Statement 1:** On the set Z of all odd integers, relation R defined by (a, b) in R iff a - b is even for all a, b in Z is an equivalence relation. **Solution:** 1. **Reflexivity:** For any odd integer a, a - a = 0, which is even. Thus, (a, a) is in R for all a in Z. Therefore, R is reflexive. ...
Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • CARTESIAN PRODUCT OF SETS AND RELATIONS

    OBJECTIVE RD SHARMA ENGLISH|Exercise Exercise|38 Videos
  • CARTESIAN PRODUCT OF SETS AND RELATIONS

    OBJECTIVE RD SHARMA ENGLISH|Exercise Chapter Test|30 Videos
  • CARTESIAN PRODUCT OF SETS AND RELATIONS

    OBJECTIVE RD SHARMA ENGLISH|Exercise Section I - Solved Mcqs|34 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

Show that the relation R defined by R={(a , b):a-b is divisible by 3; a , bZ} is an equivalence relation.

Show that the relation R defined by R={(a , b):a-b is divisible by 3; a , bZ} is an equivalence relation.

Knowledge Check

  • Let Z = {set of integers}. Define a relation R on Z by a R b iff (a+b) is even integer for all a, b in Z. Then R is

    A
    Equivalence relation
    B
    Identify relation
    C
    Only reflexive, neither symmetric nor transitive
    D
    Only transitive, neither reflexive nor symmetric
  • Similar Questions

    Explore conceptually related problems

    Show that the relation R defined by R={(a , b):a-b is divisible by 3; a , bZ} is an equivalence relation.

    Let Z be the set of all integers. A relation R is defined on Z by xRy to mean x-y is divisible by 5. Show that R is an equivalence relation on Z.

    Prove that the relation R on Z defined by (a ,\ b) in RhArr a-b is divisible by 5 is an equivalence relation on Z .

    Statement-1: The relation R on the set N xx N defined by (a, b) R (c, d) iff a+d = b+c for all a, b, c, d in N is an equivalence relation. Statement-2: The intersection of two equivalence relations on a set A is an equivalence relation.

    Let Z be the set of all integers and R be the relation on Z defined by R= { (a,b): a, b in Z and (a-b) is divisible by 5} . Prove that R is an equivalence relation

    Let Z be the set of all integers and R be the relation on Z defined as R={(a, b); a,\ b\ in Z, and (a-b) is divisible by 5} . Prove that R is an equivalence relation.

    Let Z be the set of integers. Show that the relation R={(a ,\ b): a ,\ b in Z and a+b is even} is an equivalence relation on Zdot