Let X be the set of all students registered in AUT in 2016 F
Solution
( i ) The relation R1 is defined by R1 = { ( x , y ) P2 | x has a common course with y }
( ii )The relation R2 is defined by R2 = { ( x , y ) P2 | x has exactly the same number of letters in the name as y }
1. Since every student has exactly the same number of letters in the name as himself.
That is x P , (x , x ) R2. So R2 is reflexive.
2. Suppose x has exactly the same number of letters in the name as y then y has exactly the same number of letters in the name as x.
That is if ( x , y ) R2 then( y , x ) R2. So, R2 is symmetric.
3. Suppose x has exactly the same number of letters in the name as y and y has exactly the same number of letters in the name as x.Then x and y may not same.
That is if ( x , y ) R2 and ( y , x ) R2 then x may not be equal to y.So, R2 is not anti-symmetric.
4. Suppose x has exactly the same number of letters in the name as y and y has exactly the same number of letters in the name as z.Then x has exactly the same number of letters in the name as z.
That is if ( x , y ) R2 and ( y , z ) R2 then ( x , z ) R2 .So, R2 is transitive.
