Home
Class 12
MATHS
If R and R' are symmetric relations (not...

If R and R' are symmetric relations (not disjoint ) on a set A, then the relation `Rnn R'` is :

A

reflexive

B

symmetric

C

transitive

D

None of these

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem, we need to determine the nature of the relation \( R \cap R' \) (the intersection of relations \( R \) and \( R' \)) given that both \( R \) and \( R' \) are symmetric relations on a set \( A \) and are not disjoint. ### Step-by-step Solution: 1. **Understanding Symmetric Relations**: A relation \( R \) on a set \( A \) is symmetric if for every pair \( (a, b) \) in \( R \), the pair \( (b, a) \) is also in \( R \). Similarly, \( R' \) is symmetric. 2. **Assuming Elements in the Intersection**: Let's assume there are elements \( a \) and \( b \) such that \( (a, b) \) is in \( R \cap R' \). This means that \( (a, b) \) is in both \( R \) and \( R' \). 3. **Using the Definition of Symmetry**: Since \( (a, b) \) is in \( R \) and \( R \) is symmetric, it follows that \( (b, a) \) must also be in \( R \). Similarly, since \( (a, b) \) is in \( R' \) and \( R' \) is symmetric, \( (b, a) \) must also be in \( R' \). 4. **Conclusion about the Intersection**: Therefore, \( (b, a) \) is in both \( R \) and \( R' \). This implies that \( (b, a) \) is in \( R \cap R' \). 5. **Final Result**: Since for every pair \( (a, b) \) in \( R \cap R' \), the pair \( (b, a) \) is also in \( R \cap R' \), we conclude that \( R \cap R' \) is symmetric. ### Answer: The relation \( R \cap R' \) is symmetric.
Promotional Banner

Similar Questions

Explore conceptually related problems

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

If R is a symmetric relation on a set A, then write a relation between R and R^(-1) .

If R is a relation from a set A to a set B and S is a relation from B to a set C, then the relation SoR

If R and S are relations on a set A, then prove the following: R and S are symmetric $R nn S and R uu S are symmetric R is reflexive and S is any relation hat varphi R uu S is reflexive.

If R and S are relations on a set A, then prove the following: R and S are symmetric rArr R nn S and R uu S are symmetric (ii) R is reflexive and S is any relation rArr R uu S is reflexive.

If R and S are transitive relations on a set A then prove that R uu S may not be a transitive relation on A.

If and and and are equivalence relations in a set A, show that R_(1)nn R_(2) is also an equivalence relation.

If R and S are transitive relations on a set A then prove that R uu S may not be a transitive relation on A.