# DM-Groups and Lattice-Q11

+2 votes

Let R be a relation from a set A to a set B. The inverse relation from B to A, denoted by $R^{-1}$, is the set of ordered pairs  $\{(b, a) | (a, b) \in R\}$.

S1: R is reflexive relation iff $R^ {-1} = R$

S2: R is a symmetric relation iff $R^ {-1} = R$

Which one of the following statements is true?

(A).Only S1

(B).Only S2

(C).Both S1 and S2

(D).None

asked Jul 8
reshown Jul 9

## 1 Answer

0 votes
B is correct
answered Jul 9 by (24,670 points)
can anyone give solution..., i solved it but dont know whether it is correct or not
1st statement is false , take any reflexive relation with diagonal elements and one element extra , now reverse it.
2nd statement can be proven mathematically using set contain method.
Answer: