Let $ R $ be a relation on $ E $. Demonstrate that:
- $ R $ is reflexive then $R \subseteq R.R$ and $R$.$R$ are reflexive too;
Here is my work though confused about few steps:
$R$.$R$ = {$(x,y) | \exists z \in E | (x,z) \in R , (z,y) \in R$}
$R$ is reflexive $\Rightarrow$ {$(x,x) | x \in E$ } If we have $x \in E, \exists z | (x,z) \in R$ and $(z, x) \in R $ Then $(x,x) \in R.R$
which implies $R \subset R.R$
and as $R$ is relfexive and $R \subset R.R$
then $R.R$ is reflexive too
To prove that $R \circ R$ is reflexive, we have to prove that $(x,x) \in R \circ R$, for every $x$.
But, for every $x$, we have $(x,x) \in R$, because $R$ is reflexive.
Thus, $(x,x) \in R \text { and } (x,x) \in R$, that means that:
and this is: $(x,x) \in R \circ R$.
To show that $R \subseteq R \circ R$, we have to consider $(x,y) \in R$ and use reflexivity of $R$ to have: