Let be the set of all -letter strings formed from the alphabet
MATHEMATICS · Subjective · CBSE · Mathematics · Relations and Functions · Relations and Functions
Problem
Let S={xx,xy,yx,yy} be the set of all 2-letter strings formed from the alphabet {x,y}. A relation R on S is given by
R={(xx,xx),(xy,xy),(yx,yx),(yy,yy),(xx,xy),(xy,xx),(yx,yy)}.
Answer the following questions, giving reasons in each case.
(i) Is R reflexive on S?
(ii) Is R symmetric on S?
(iii) Is R transitive on S?
(iv) Suggest a single ordered pair whose addition to or deletion from R would convert it into an equivalence relation on S, and justify your choice.