Question 14 Marks
A relation R on a set A is said to be an equivalence relation on A iff it is:
- Reflexive i.e., $(\text{a, a})\in\ \text{R} \ \forall \ \text{a}\in\text{A}.$
- Symmetric i.e., $(\text{a, b})\in\ \text{R} \Rightarrow \text{(b, a) } \in\text{R}\ \forall \ \text{a, b}\in\text{A}.$
- Transitive i.e., $(\text{a, b})\in\ \text{R} \ \text{and}\ \text{(b, c) } \in\text{R}\Rightarrow\text{(a, c)}\in\text{R}\ \forall \ \text{a, b, c}\in\text{A}.$
- If the relation R = {(1, 1), (1, 2), (1, 3), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)} defined on the set A = {1, 2, 3}, then R is:
- Reflexive
- Symmetric
- Transitive
- Equivalence
- If the relation R = {(1, 2), (2, 1), (1, 3), (3, 1)} defined on the set A = {1, 2, 3}, then R is:
- Reflexive
- Symmetric
- Transitive
- Equivalence
- If the relation R on the set N of all natural numbers defined as R = {(x, y): y = x + 5 and x < 4}, then R is:
- Reflexive
- Symmetric
- Transitive
- Equivalence
- If the relation R on the set A = {1, 2, 3, ........., 13, 14} defined as R = {(x, y): 3x - y = O}, then R is:
- Reflexive
- Symmetric
- Transitive
- Equivalence
- If the relation R on the set A = {I, 2, 3} defined as R = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)}, then R is:
- Reflexive only
- Symmetric only
- Transitive only
- Equivalence
Answer
Clearly, (1, 1), (2, 2), (3, 3), $\in$ R. So, R is reflexive on A.
Since, (1, 2) $\in$ R but (2, 1) $\notin$ R. So, R is not symmetric on A.
Since, (2, 3), $\in$ R and (3, 1) $\in$ R but (2, 1) $\notin$ R. So, R is not transitive on A.
Since, (1, 1), (2, 2) and (3, 3) are not in R. So, R is not reflexive on A.
Now, (1, 2) $\in$ R ⇒ (2, 1) $\in$ R and (1, 3) $\in$ R ⇒ (3, 1) $\in$ R. So, R is symmetric,
Clearly, (1, 2) $\in$ R and (2, 1) $\in$ R but (1, 1) $\notin$ R. So, R is not transitive on A.
We have, R = {(x, y): y = x + 5 and x < 4}, where x, y $\in$ N.
$\therefore$ R = {(1, 6), (2, 7), (3, 8)}
Clearly, (1, 1), (2, 2) etc. are not in R. So, R is not reflexive.
Since, (1, 6) $\in$ R but (6, 1) $\notin$ R. So, R is not symmetric.
Since, (1, 6) $\in$ R and there is no order pair in R which has 6 as the first element.
Same is the case for (2, 7) and (3, 8). So, R is transitive.
We have, R = {(x, y): 3x - y = 0}, where x, y $\in$ A = {1,2, ......, 14}.
$\therefore$ R = {(1, 3), (2, 6), (3, 9), (4, 12)}
Clearly, (1, 1) $\notin$ R. So, R is not reflexive on A.
Since, (1, 3) $\in$ R but (3, 1) $\notin$ R. So, R is not symmetric on A.
Since, (1, 3) $\in$ Rand (3, 9) $\in$ R but (1, 9) $\notin$ R. So, R is not transitive on A.
Clearly, (1, 1), (2, 2), (3, 3) $\in$ R. So, R is reflexive on A.
We find that the ordered pairs obtained by interchanging the components of ordered pairs in R are also in R. So, R is symmetric on A. For 1, 2, 3 $\in$ A such that (1, 2) and (2, 3) are in R implies that (1, 3) is also, in R. So, R is transitive on A. Thus, R is an equivalence relation.
View full question & answer→- (a) Reflexive
Clearly, (1, 1), (2, 2), (3, 3), $\in$ R. So, R is reflexive on A.
Since, (1, 2) $\in$ R but (2, 1) $\notin$ R. So, R is not symmetric on A.
Since, (2, 3), $\in$ R and (3, 1) $\in$ R but (2, 1) $\notin$ R. So, R is not transitive on A.
- (b) Symmetric
Since, (1, 1), (2, 2) and (3, 3) are not in R. So, R is not reflexive on A.
Now, (1, 2) $\in$ R ⇒ (2, 1) $\in$ R and (1, 3) $\in$ R ⇒ (3, 1) $\in$ R. So, R is symmetric,
Clearly, (1, 2) $\in$ R and (2, 1) $\in$ R but (1, 1) $\notin$ R. So, R is not transitive on A.
- (c) Transitive
We have, R = {(x, y): y = x + 5 and x < 4}, where x, y $\in$ N.
$\therefore$ R = {(1, 6), (2, 7), (3, 8)}
Clearly, (1, 1), (2, 2) etc. are not in R. So, R is not reflexive.
Since, (1, 6) $\in$ R but (6, 1) $\notin$ R. So, R is not symmetric.
Since, (1, 6) $\in$ R and there is no order pair in R which has 6 as the first element.
Same is the case for (2, 7) and (3, 8). So, R is transitive.
- (d) Equivalence
We have, R = {(x, y): 3x - y = 0}, where x, y $\in$ A = {1,2, ......, 14}.
$\therefore$ R = {(1, 3), (2, 6), (3, 9), (4, 12)}
Clearly, (1, 1) $\notin$ R. So, R is not reflexive on A.
Since, (1, 3) $\in$ R but (3, 1) $\notin$ R. So, R is not symmetric on A.
Since, (1, 3) $\in$ Rand (3, 9) $\in$ R but (1, 9) $\notin$ R. So, R is not transitive on A.
- (d) Equivalence
Clearly, (1, 1), (2, 2), (3, 3) $\in$ R. So, R is reflexive on A.
We find that the ordered pairs obtained by interchanging the components of ordered pairs in R are also in R. So, R is symmetric on A. For 1, 2, 3 $\in$ A such that (1, 2) and (2, 3) are in R implies that (1, 3) is also, in R. So, R is transitive on A. Thus, R is an equivalence relation.