# Give an example of a relation which is (iii) Reflexive and symmetric but not transitive.

This question has multiple parts. Therefore each part has been answered as a separate question on Clay6.com

Toolbox:
• A relation R in a set A is called $\mathbf{ reflexive},$ if $(a,a) \in R\;$ for every $\; a\in\;A$
• A relation R in a set A is called $\mathbf{symmetric}$, if $(a_1,a_2) \in R\;\Rightarrow\; (a_2,a_1)\in R \; for \;a_1,a_2 \in A$
• A relation R in a set A is called $\mathbf{transitive},$ if $(a_1,a_2) \in R$ and $(a_2,a_3) \in R \; \Rightarrow \;(a_1,a_3)\in R$ for all$\; a_1,a_2,a_3 \in A$
A relation R in a set A is called $\mathbf{transitive},$ if $(a_1,a_2) \in R$ and $(a_2,a_3) \in R \; \Rightarrow \;(a_1,a_3)\in R$ for all$\; a_1,a_2,a_3 \in A$
In a set of integers, we can observe that the Relation $R = \{(1,1), (2,2) (3,3\}$ does not satisify the properties of a transitive relation.
Given that the Relation $R = \{(1,1), (2,2) (3,3)\}$, we can observe that if $a=1,2$ or $3$, $(1,1), (2,2), (3,3) \in R$. Therefore, R is reflexive.
Given that the Relation $R = \{(1,1), (2,2) (3,3)\}$, we can further observe that $(a,b) = (1,1) \in R$, and $(b,a) = (1,1)$ is in $R$. Similarly $(2,2) \in R$ and $(3,3) \in R$. Therefore $R$ is symmetric.
Therefore, we can conclude that the Relation $R = \{(1,1), (2,2) (3,3\}$ is not transitive but reflexive and symmetrical.