All Exams Test series for 1 year @ ₹349 only
Question

Suppose that $R_1$ and $R_2$ are reflexive relations on a set A.
Which of the following statements is correct ?

The correct answer is
Both $R_1 \cap R_2$ and $R_1 \cup R_2$ are reflexive.

Understanding Reflexive Relations

A relation R on a set A is defined as reflexive if for every element $a$ in set A, the pair $(a, a)$ is included in the relation R. Mathematically, this is expressed as:

$\forall a \in A, (a, a) \in R$.

Analyzing Intersection of Reflexive Relations ($R_1 \cap R_2$)

We are given that both $R_1$ and $R_2$ are reflexive relations on set A. This implies:

  • For every $a \in A$, $(a, a) \in R_1$.
  • For every $a \in A$, $(a, a) \in R_2$.

The intersection of two relations, $R_1 \cap R_2$, consists of all ordered pairs that are common to both $R_1$ and $R_2$. Since $(a, a)$ is present in $R_1$ and also in $R_2$ for all $a \in A$, it must be present in their intersection $R_1 \cap R_2$.

Therefore, $R_1 \cap R_2$ satisfies the condition $\forall a \in A, (a, a) \in R_1 \cap R_2$.

Conclusion: $R_1 \cap R_2$ is reflexive.

Analyzing Union of Reflexive Relations ($R_1 \cup R_2$)

Similar to the intersection, since $R_1$ and $R_2$ are reflexive:

  • For every $a \in A$, $(a, a) \in R_1$.
  • For every $a \in A$, $(a, a) \in R_2$.

The union of two relations, $R_1 \cup R_2$, consists of all ordered pairs that are present in $R_1$, or in $R_2$, or in both. Because $(a, a)$ is present in $R_1$ (and also in $R_2$) for all $a \in A$, it is guaranteed to be included in the union $R_1 \cup R_2$.

Therefore, $R_1 \cup R_2$ satisfies the condition $\forall a \in A, (a, a) \in R_1 \cup R_2$.

Conclusion: $R_1 \cup R_2$ is reflexive.

Final Result

Based on the analysis, both the intersection ($R_1 \cap R_2$) and the union ($R_1 \cup R_2$) of two reflexive relations $R_1$ and $R_2$ on a set A are themselves reflexive.

Was this answer helpful?

Important Questions from Types of Relations

  1. A Relation in R is defined as R = {(a, b) : a ≤ b2} is ________.

  2. Let S = {1, 2, 3, ...}, A relation R on S × S is defined by xRy if log ax > log ay when a  \(\rm = \frac 1 2.\)  Then the relation is:

  3. Let A be {I, m, n}. Let the relation R be {}. Which of the following statements about R is true?
  4. Which of the following relations is symmetric but neither reflexive nor transitive for a set A= {a, b, c}?
  5. Consider the following relations on the set {1, 2, 3, 4}:

    R1 = {(1, 1),(1, 2), (1, 4),(2, 1), (2, 2), (3, 3),(4, 1), (4, 4)}

    R2 = {(2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3)}

    R3 = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 3 ), (2, 4), (3, 3), (3, 4), (4, 4)}

    R4 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 4), (4, 1), (4, 4)}

    Which of these relations are reflexive and transitive but NOT symmetric?

Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App