Relations Between Sets – Reflexive, Symmetric and Transitive Properties
Quantitative Aptitude › Set Theory, Functions and Graphs · Topic 23.11
A relation from a set A to a set B is a set of ordered pairs (a, b). A relation on A is reflexive if every a is related to itself, symmetric if a related to b implies b related to a, and transitive if a related to b and b related to c implies a related to c; all three together make an equivalence relation.
5 min read · Quantitative Aptitude · Set Theory, Functions and Graphs
Quick Answer
A relation from a set A to a set B is a set of ordered pairs (a, b). A relation on A is reflexive if every a is related to itself, symmetric if a related to b implies b related to a, and transitive if a related to b and b related to c implies a related to c; all three together make an equivalence relation.
At a Glance
- Reflexive (a, a) for every a
- Symmetric (a, b) implies (b, a)
- Transitive (a, b), (b, c) imply (a, c)
- Equivalence All three
- All relations on n elements 2 to the power n²
Where Does It Fit?
This is the last topic of the Set Theory macro. It builds on Set Theory – Union, Intersection, Complement and Venn Diagram Problems and Functions – Domain, Range and Types of Functions (One-One, Onto, Bijective), and it prepares the ground for counting methods in Fundamental Principle of Counting (Addition and Multiplication Rules).
What Are the Properties of a Relation?
In short: a relation R on a set A is just a set of ordered pairs. Three properties are tested.
| Property | Test | Example on {1, 2, 3} |
|---|---|---|
| Reflexive | (1, 1), (2, 2) and (3, 3) are all in R | {(1,1), (2,2), (3,3)} |
| Symmetric | Whenever (a, b) is in R, (b, a) is too | {(1,2), (2,1)} |
| Transitive | (a, b) and (b, c) in R force (a, c) in R | {(1,2), (2,3), (1,3)} |
| Equivalence | Reflexive, symmetric and transitive | {(1,1), (2,2), (3,3)} |
Which Standard Relations Appear in Exams?
In short: a few relations on numbers and lines recur.
| Relation | Reflexive | Symmetric | Transitive |
|---|---|---|---|
| a = b | Yes | Yes | Yes (equivalence) |
| a < b on integers | No | No | Yes |
| a divides b on positive integers | Yes | No | Yes |
| a – b divisible by 5 on integers | Yes | Yes | Yes (equivalence) |
| Line a is parallel to line b | Yes | Yes | Yes (equivalence) |
| a is perpendicular to b | No | Yes | No |
An equivalence relation splits the set into equivalence classes. Congruence modulo 5 on the integers gives 5 classes.
How Do You Count Relations?
In short: each of the n² ordered pairs is either in the relation or not.
Counting on an n-element set
- All relations: 2 to the power n².
- Reflexive relations: 2 to the power (n² – n).
- Symmetric relations: 2 to the power n(n + 1)/2.
- Equivalence relations correspond to the ways of partitioning the set.
The multiplication idea behind this is covered in Fundamental Principle of Counting (Addition and Multiplication Rules).
Solved Examples
Example 1
Question: On A = {1, 2, 3}, is R = {(1,1), (2,2), (3,3)} an equivalence relation?
- Reflexive: all three pairs (a, a) are present.
- Symmetric: each pair (a, a) is its own reverse.
- Transitive: no pair (a, b), (b, c) leads to a missing (a, c).
Answer: Yes, it is an equivalence relation.
Example 2
Question: On A = {1, 2, 3}, test R = {(1,2), (2,1)}.
- Reflexive: (1,1), (2,2), (3,3) are missing, so no.
- Symmetric: (1,2) has (2,1) and (2,1) has (1,2), so yes.
- Transitive: (1,2) and (2,1) require (1,1), which is absent, so no.
Answer: R is symmetric only.
Example 3
Question: Test the relation ‘a divides b’ on positive integers.
- Reflexive: a divides a.
- Not symmetric: 2 divides 4 but 4 does not divide 2.
- Transitive: if a divides b and b divides c, then a divides c.
Answer: It is reflexive and transitive, but not symmetric, so it is not an equivalence relation.
Example 4
Question: Show that ‘a – b is divisible by 5’ is an equivalence relation on integers.
- Reflexive: a – a = 0 is divisible by 5.
- Symmetric: if 5 divides a – b, it divides b – a.
- Transitive: if 5 divides a – b and b – c, it divides their sum a – c.
Answer: It is an equivalence relation, with 5 classes (remainders 0 to 4).
Example 5
Question: For a 3-element set, find the number of relations, reflexive relations and symmetric relations.
- All relations = 2⁹ = 512.
- Reflexive = 2⁶ = 64 (three diagonal pairs fixed).
- Symmetric = 2⁶ = 64, since 3 × 4/2 = 6.
Answer: 512 relations, 64 reflexive and 64 symmetric.
Shortcuts and Tricks
- For reflexive, check the diagonal pairs (a, a) for every element.
- For symmetric, look at each pair and find its reverse.
- For transitive, check every chain (a, b), (b, c).
- A relation is an equivalence relation only if all three properties hold.
- Count relations with 2 to the power of the number of free pairs.
Common Mistakes
- Calling a relation reflexive without checking every element of the set.
- Checking transitivity only for some pairs.
- Forgetting that ‘a divides b’ is not symmetric.
- Assuming a symmetric and transitive relation must be reflexive when elements are unrelated.
- Using n(n – 1) instead of n² for the number of ordered pairs.
Practice Questions
- Is ‘a < b’ on integers reflexive, symmetric or transitive?
- Is ‘a = b’ an equivalence relation?
- Number of reflexive relations on a 2-element set.
- Number of symmetric relations on a 2-element set.
- Is ‘parallel to’ on lines an equivalence relation?
- Is {(1,1), (2,2)} reflexive on {1, 2, 3}?
Answers: 1) transitive only; 2) yes; 3) 4; 4) 8; 5) yes; 6) no, (3,3) is missing.
Why Is This Topic Important?
- Logic Relations train careful checking of properties.
- Exam use CAT may ask for the number of relations or tests.
- Link The counting links to Fundamental Principle of Counting (Addition and Multiplication Rules).
What Comes Next?
The next macro begins with Measures of Central Tendency – Mean, Median and Mode, which moves from sets to measures of central tendency in statistics.
Key Terms and Formulas
- Relation A set of ordered pairs
- Reflexive Every element is related to itself
- Symmetric Related pairs work both ways
- Transitive Related chains can be shortened
- Equivalence class The set of elements related to a given element
Related Topics
- Number of Subsets and the Power Set of a Given Set
- Set Theory – Union, Intersection, Complement and Venn Diagram Problems
- Set Theory Problems Involving Three Overlapping Sets
- Functions – Domain, Range and Types of Functions (One-One, Onto, Bijective)
Exam Corner
Points to Remember
- Equivalence = reflexive + symmetric + transitive.
- All relations on n elements: 2 to the power n².
- Reflexive relations: 2 to the power (n² – n).
- Symmetric relations: 2 to the power n(n + 1)/2.
Do Not Confuse With
- Symmetric vs reflexive Symmetric concerns reversing pairs; reflexive concerns diagonal pairs.
- Transitive vs equivalence Equivalence needs all three properties.
- Relation vs function A function gives exactly one output for each input.
Memory Hook
Itself, both ways, chain: reflexive, symmetric, transitive.
GS Relevance
Frequently Asked Questions
What is a reflexive relation?
A relation on a set is reflexive if every element is related to itself, which means the pair a, a is in the relation for every element a. On the set 1, 2, 3, the relation must contain 1,1, 2,2 and 3,3 to be reflexive.
What is a symmetric relation?
A relation is symmetric if whenever a is related to b, then b is also related to a. The relation containing 1,2 and 2,1 is symmetric, while the divides relation on positive integers is not, because 2 divides 4 but 4 does not divide 2.
What is a transitive relation?
A relation is transitive if a related to b and b related to c always imply a related to c. The less than relation on integers is transitive, because a less than b and b less than c give a less than c.
What is an equivalence relation?
An equivalence relation is a relation that is reflexive, symmetric and transitive at the same time. Equality of numbers and congruence modulo 5 on integers are equivalence relations, and each such relation splits the set into equivalence classes with no overlap.
How many relations are there on a set with 3 elements?
There are 2 to the power 9, which is 512, relations on a set of 3 elements. The set has 9 ordered pairs, and each pair is either in the relation or not, giving two choices for each of the 9 pairs.
PYQ Practice — Statement Analysis
1 An equivalence relation is reflexive, symmetric and transitive.
All three properties are needed.
2 The relation 'a divides b' on positive integers is symmetric.
2 divides 4 but 4 does not divide 2.
3 The number of relations on a 3-element set is 512.
2⁹ = 512.
4 Congruence modulo 5 on the integers has 5 equivalence classes.
The remainders are 0, 1, 2, 3 and 4.
Related Topics
Browse the full Quantitative Aptitude index