Determine whether each of the following relations are reflexive, symmetric and transitive:
Relation $R$ in the set $A$ of human beings in a town at a particular time given by
$R =\{(x, y): x $ is father of $y\}$
$R =\{( x , y ): x$ is the father of $y \}$
$( x , x ) \notin R$
As $x$ cannot be the father of himself.
$\therefore R$ is not reflexive.
Now, let $( x , y ) \notin R$
$\Rightarrow x$ is the father of $y$
$\Rightarrow y$ cannot be the father of $y$
Indeed, $y$ is the son or the daughter of $y$.
$\therefore(y, x) \notin R$
$\therefore R$ is not symmetric.
Now, let $(x, y) \in R$ and $(y, z) \notin R$
$\Rightarrow x$ is the father of $y$ and $y$ is the father of $z$.
$\Rightarrow x$ is not the father of $z$
Indeed, $x$ is the grandfather of $z$
$\therefore $ $( x , z ) \notin R$
$\therefore R$ is not transitive.
Hence, $R$ is neither reflexive, nor symmetric, nor transitive.
Let $R$ be a reflexive relation on a finite set $A$ having $n$-elements, and let there be m ordered pairs in $R$. Then
Let $M$ denotes set of all $3 \times 3$ non singular matrices. Define the relation $R$ by
$R = \{ (A,B) \in M \times M$ : $AB = BA\} ,$ then $R$ is-
Let $A =\{1,2,3,4,5,6,7\}$. Then the relation $R =$ $\{( x , y ) \in A \times A : x + y =7\}$ is
The relation $R$ defined on a set $A$ is antisymmetric if $(a,\,b) \in R \Rightarrow (b,\,a) \in R$ for
In order that a relation $R$ defined on a non-empty set $A$ is an equivalence relation, it is sufficient, if $R$