Let denote the words in the English dictionary. Define the relation by : the words and have at least one letter in common . Then is
For a relation on a set to be
• reflexive ⇔ for every element of the set.
• symmetric ⇔ .
• transitive ⇔ .
The set under consideration is = “all words that appear in an English dictionary”. The relation is
Reflexive Every word shares all its own letters with itself, so for every the ordered pair belongs to . Hence is reflexive.
Symmetric Suppose . Then and contain at least one common letter, say “”. Because is also in , the pair shares the same letter , giving . Therefore is symmetric.
Not transitive To test transitivity we need an example with words such that and but .
Take the dictionary words
• “BALL” and “LAMP” share the letters and , so .
• “LAMP” and “MOCK” share the letter , so .
• “BALL” and “MOCK” have no common letter, so .
Since a single counter-example is enough to break transitivity, is not transitive.
Thus is reflexive and symmetric, but not transitive.
Option B which is: reflexive, symmetric and not transitive
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.