The number of relations on the set containing at most 6 elements including (1, 2), which are reflexive and transitive but not symmetric, is ______.
The set has three elements, so there are ordered pairs in the universal relation on .
For a relation to be
• reflexive (always present)
• required (given in the question)
• of size we may choose at most two more pairs
• not symmetric there exists at least one ordered pair whose reverse is absent
• transitive whenever , then .
Let
The five remaining off-diagonal pairs are
We may add 0, 1 or 2 of them. Each choice is examined below.
Case 1: 0 extra pairs (size 4)Only itself. No new two-step paths are created, so is transitive. Because , it is not symmetric. Hence one relation is obtained.
Case 2: exactly 1 extra pair (size 5)Test every single pair from .
1. Add are both present, so the relation becomes symmetric reject.
2. Add . Two-step paths are
gives only loops, and gives existing pairs. Hence transitive and not symmetric accept.
3. Add . Path demands , which is missing violates transitivity reject.
4. Add . Path demands , missing reject.
5. Add . Path is unchanged; path followed by loops requires nothing new. Relation is transitive and not symmetric accept.
Thus two relations are obtained in this case.
Case 3: exactly 2 extra pairs (size 6)Choose two pairs from (there are possibilities). Only the following three choices satisfy transitivity and lack of symmetry.
(i) : path already gives , present transitive.
(ii) : path already gives , present transitive.
(iii) : path gives , present transitive.
In each of the three relations at least one ordered pair lacks its reverse, so none is symmetric.
No other pair-sets work: each of the remaining seven choices either forces a missing third pair (breaking transitivity) or makes the relation symmetric.
Hence three relations arise in this case.
Adding up all cases:
Therefore, the number of required relations is
Tagged Reflexive, symmetric and transitive relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.