Question #15495

Let R be reflexive and transitive relation on a set S. Then R intersect R inverse is a
a)reflexive but not transitive relation.
b)transitive but not reflexive relation.
c)symmetric but not reflexive and transitive relation.
d)equivalence relation.

Expert's answer

R={(a,b)aRb}R = \left\{(a, b) \mid a R b \right\}(a,a):aRa\forall (a, a): a R aaRbbRcaRca R b \wedge b R c \Rightarrow a R cR={(a,b)bRa}R ^ {\prime} = \left\{(a, b) \mid b R a \right\}aRbbRaa R ^ {\prime} b \equiv b R aaRaaRaa R a \equiv a R ^ {\prime} aaRbbRcbRacRbcRaaRca R ^ {\prime} b \wedge b R ^ {\prime} c \Rightarrow b R a \wedge c R b \Rightarrow c R a \equiv a R ^ {\prime} c


So, RR' is again reflexive and transitive

Intersection of two reflexive and transitive relations is again reflexive and transitive relation.

If (a,b)RR(a,b)\in R\cap R^{\prime} then:


aRbbRa(b,a)Ra R b \equiv b R ^ {\prime} a \Rightarrow (b, a) \in R ^ {\prime}aRbbRa(b,a)Ra R ^ {\prime} b \equiv b R a \Rightarrow \Rightarrow (b, a) \in R(a,b)RR(b,a)RR(a, b) \in R \cap R ^ {\prime} \Rightarrow (b, a) \in R \cap R ^ {\prime}


Thus, intersection of reflexive and transitive relation and its inverse is **equivalence relation**.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS