Home
Class 12
MATHS
Let A={2,4,6,8} and R be the relation "i...

Let `A={2,4,6,8}` and R be the relation "is greater than" on the set A. Write R as a set of order pairs. Is this relation
(i) reflexive? (ii) symmetic? (iii) equivalance relation?
Justify your answer.

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem, we will follow these steps: ### Step 1: Define the set and relation Let \( A = \{2, 4, 6, 8\} \) and the relation \( R \) is defined as "is greater than" on the set \( A \). ### Step 2: Write \( R \) as a set of ordered pairs We need to find all pairs \( (a, b) \) such that \( a > b \) where \( a, b \in A \). - For \( a = 4 \): - \( (4, 2) \) since \( 4 > 2 \) - For \( a = 6 \): - \( (6, 2) \) since \( 6 > 2 \) - \( (6, 4) \) since \( 6 > 4 \) - For \( a = 8 \): - \( (8, 2) \) since \( 8 > 2 \) - \( (8, 4) \) since \( 8 > 4 \) - \( (8, 6) \) since \( 8 > 6 \) Thus, the relation \( R \) can be expressed as: \[ R = \{(4, 2), (6, 2), (6, 4), (8, 2), (8, 4), (8, 6)\} \] ### Step 3: Check if the relation is reflexive A relation is reflexive if every element is related to itself, i.e., \( (a, a) \in R \) for all \( a \in A \). - For \( a = 2 \): \( (2, 2) \notin R \) - For \( a = 4 \): \( (4, 4) \notin R \) - For \( a = 6 \): \( (6, 6) \notin R \) - For \( a = 8 \): \( (8, 8) \notin R \) Since none of these pairs are in \( R \), the relation is **not reflexive**. ### Step 4: Check if the relation is symmetric A relation is symmetric if whenever \( (a, b) \in R \), then \( (b, a) \in R \). - For \( (4, 2) \in R \), \( (2, 4) \notin R \) - For \( (6, 2) \in R \), \( (2, 6) \notin R \) - For \( (6, 4) \in R \), \( (4, 6) \notin R \) - For \( (8, 2) \in R \), \( (2, 8) \notin R \) - For \( (8, 4) \in R \), \( (4, 8) \notin R \) - For \( (8, 6) \in R \), \( (6, 8) \notin R \) Since none of the reverse pairs are in \( R \), the relation is **not symmetric**. ### Step 5: Check if the relation is an equivalence relation A relation is an equivalence relation if it is reflexive, symmetric, and transitive. - Since \( R \) is neither reflexive nor symmetric, it cannot be an equivalence relation. ### Conclusion - The relation \( R \) is not reflexive. - The relation \( R \) is not symmetric. - The relation \( R \) is not an equivalence relation.
Promotional Banner

Topper's Solved these Questions

  • RELATIONS AND FUNCTIONS

    CBSE COMPLEMENTARY MATERIAL|Exercise FOUR MARK QUESTIONS|13 Videos
  • RELATIONS AND FUNCTIONS

    CBSE COMPLEMENTARY MATERIAL|Exercise SIX MARK QUESTIONS|7 Videos
  • RELATIONS AND FUNCTIONS

    CBSE COMPLEMENTARY MATERIAL|Exercise SIX MARK QUESTIONS|7 Videos
  • PROBABILITY

    CBSE COMPLEMENTARY MATERIAL|Exercise SIX MARK QUESTIONS|20 Videos
  • THREE DIMENSIONAL GEOMETRY

    CBSE COMPLEMENTARY MATERIAL|Exercise SIX MARK QUESTIONS|9 Videos

Similar Questions

Explore conceptually related problems

If A={3,5,7} and B={2,4,9} and R is a relation given by is less than,write R as a set ordered pairs.

Let R={(x,y):|x^(2)-y^(2)|<1} be a relation on set A={1,2,3,4,5}. Write R as a set of ordered pairs.

In order that a relation R defined on a non-empty set A is an equivalence relation, it is sufficient, if R

Let R be a relation on the set A of ordered pairs of integers defined by (x,y)R(u,v) iff xv=yu .Show that R is an equivalence relation.

If R and R' are symmetric relations (not disjoint) on a set A ,then the relation R uu R' is (i) Reflexive (ii) Symmetric (ii) Transitive (iv) none of these

Let R be the relation ''is divisor of'' from the set A{1,2,3} to B= [4,10,15]. Write down the set of ordered pairs corresponding to R.

Let R={(a ,\ a),\ (b ,\ b),\ (c ,\ c),\ (a ,\ b)} be a relation on set A={a ,\ b ,\ c} . Then, R is (a) identity relation (b) reflexive (c) symmetric (d) equivalence

Let R be a relation is multiple of from the set A={1,2,3} to B={4,10,15}. Then, the set of ordered pairs corresponding to R are :

Let R be the relation over the set of all straight lines in a plane such that l_1\ R\ l_2hArrl_1_|_l_2 . Then, R is (a) symmetric (b) reflexive (c) transitive (d) an equivalence relation