The number of relations, defined on the set , which are both reflexive and symmetric, is equal to:
- A
- B
- C
- D
The number of relations, defined on the set , which are both reflexive and symmetric, is equal to:
Correct answer:B
Standard Method
Given: The set is so .
Find: The number of relations on that are both reflexive and symmetric.
A relation on is a subset of .
For a reflexive relation, all diagonal pairs must be included:
So these pairs are fixed, giving only choice for each.
Now consider the off-diagonal pairs. Since , the number of off-diagonal elements is
Because the relation must be symmetric, pairs of the form must be chosen together. Thus the off-diagonal ordered pairs form
symmetric pair-groups.
For each such group, there are exactly choices:
Hence total number of such relations is
In general, for a set of size , the count is
Therefore, the total number of relations is and the correct option is B.
Counting by unordered pairs
Given: A set with elements.
Find: How many relations are simultaneously reflexive and symmetric.
Reflexivity forces all pairs to be present, so there is no freedom on the diagonal.
For distinct elements, the possible unordered pairs are:
There are such choices.
Each unordered pair corresponds to the ordered pair set
For symmetry, either both are included or both are excluded. So each unordered pair contributes choices.
Therefore,
Hence the correct option is B.
Counting all ordered pairs as independent choices is incorrect because symmetry links with . Treat each off-diagonal symmetric pair as one unit.
Allowing diagonal pairs to be optional is wrong because reflexivity requires every to be included. The diagonal contributes fixed choice, not choices.
Using instead of for off-diagonal pair-groups is incorrect. First remove the diagonal elements, then group the remaining ordered pairs into symmetric pairs.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.