Let denote the set of words in the English dictionary. Define the relation by
Show that this relation is reflexive and symmetric, but not transitive.
Confirming your payment
Previous Year Questions · Question 22 of 37
Let denote the set of words in the English dictionary. Define the relation by
Show that this relation is reflexive and symmetric, but not transitive.
Throughout, write the letter set of a word for the set of distinct letters it uses. Two words are related exactly when their letter sets have a non-empty intersection.
Reflexive. Take any word . Every word contains at least one letter, and that letter is shared between and itself. So and have at least one letter in common, i.e. , for every . Hence is reflexive.
Symmetric. Suppose . Then there is some letter appearing in both and . "Appearing in both" does not depend on the order in which the two words are named, so the same letter appears in both and . Therefore , and is symmetric.
Not transitive. Transitivity would require: if shares a letter with , and shares a letter with , then shares a letter with . Take the three dictionary words
Their letter sets are
Now check the two hypotheses and the conclusion, letter by letter.
: compare with . Is in "toy"? No. Is in "toy"? No. Is in "toy"? Yes — "toy" begins with . One shared letter is enough, so .
: compare with . Is in "boy"? No. Is in "boy"? Yes. Is in "boy"? Yes. So .
: compare with . Is in "boy"? No. Is in "boy"? No. Is in "boy"? No. Every letter of "cat" has been tested against every letter of "boy" and none matches, so
and .

So and while . Hence is not transitive.
The middle word is what makes this possible: "toy" shares with "cat" on one side and with "boy" on the other, but those are different letters, so nothing is passed along from "cat" to "boy".
Conclusion. is reflexive and symmetric but not transitive, so it is not an equivalence relation.