Relations and Equivalence Relations: JEE Main Notes
Reviewed Last updated 2026-11-20. Syllabus topic: Relations and equivalence relations.
In short. A relation on A is a subset of A x A. It is an equivalence relation when it is reflexive, symmetric and transitive, and then it splits A into disjoint classes; the number of ordered pairs in it is the sum of the squares of the class sizes.
- Relations on an n-set number 2^(n²); reflexive ones 2^(n² - n); symmetric ones 2^(n(n+1)/2); reflexive and symmetric 2^(n(n-1)/2).
- An equivalence relation is the same thing as a partition; the counts for n = 1 to 5 are 1, 2, 5, 15, 52.
- The empty relation on a non-empty set is symmetric and transitive but not reflexive.
- Symmetric and transitive does not imply reflexive: an element related to nothing breaks the argument.
- Check transitivity by looking for a chain a-b, b-c with a-c missing.
Syllabus line: SETS, RELATIONS AND FUNCTIONS: Sets and their representation; Union, intersection and complement of sets and their algebraic properties; Power set; Relations, type of relations, equivalence relations, functions; one-one, into and onto functions, the composition of functions. (NTA JEE (Main) 2026 syllabus, Mathematics, Unit 1 (https://jeemain.nta.nic.in/document/syllabus-2026/))
Before you start
Prerequisites
- Sets, power set and algebra of sets: A relation is a subset of A x A, so subset counting and set notation are used throughout. Read this first if subsets are unclear.
Related topics
- Sets, power set and algebra of sets
- Functions: one-one, onto and composition
- Combinations and selections
- Sets, Relations and Functions (lesson planned)
The concept step by step
Step 1: A relation is a set of pairs
A relation on A is a subset of A x A. List it as ordered pairs or draw arrows. There are 2^(n²) relations on an n-set because each of the n² ordered pairs is either present or absent.
Step 2: Check the three properties one by one
Reflexive: every (a, a) is present. Symmetric: every pair has its reverse. Transitive: every chain a-b, b-c has the shortcut a-c. Test them in this order and stop at the first failure with a named counter-example.
Step 3: Equivalence relation means same group
An equivalence relation puts elements in the same class when they are related. Classes are disjoint and cover the set, so an equivalence relation and a partition are the same data. This lets you count them with partitions.
Step 4: Count pairs and classes
If the class sizes are s1, s2, ..., the relation has s1² + s2² + ... ordered pairs. For congruence modulo m the class sizes come from dividing the range by m, with the remainders at the start of the range getting the extra element.
Step 5: Counting relations with a property
Reflexive: fix the diagonal, choose the rest freely. Symmetric: choose the diagonal and each unordered off-diagonal pair. For not transitive, subtract the transitive ones from the total; for reflexive and symmetric the transitive ones are exactly the equivalence relations.
Worked examples
Each solution shows the marks every step would earn. The sanity check tests units and size of the answer.
Example 1 (easy)
Find the number of relations from a set A with 2 elements to a set B with 3 elements.
| Step | Marks |
|---|---|
| A x B has 2 x 3 = 6 ordered pairs. | 1 |
| A relation is any subset of A x B, so there are 2⁶ relations. | 1 |
| 2⁶ = 64. | 1 |
| Total: 3 marks | 3 |
Answer: 64
Fast method: Relations from A to B number 2^(mn).
Sanity check: The count is a power of 2 and includes the empty relation and the full relation A x B, as every subset count should.
Example 2 (easy)
On the integers, a R b means 4 divides a - b. How many distinct equivalence classes does R have?
| Step | Marks |
|---|---|
| R is reflexive (a - a = 0), symmetric and transitive, so it is an equivalence relation. | 1 |
| Each integer is related to exactly those with the same remainder on division by 4. | 1 |
| The remainders 0, 1, 2, 3 give 4 classes. | 1 |
| Total: 3 marks | 3 |
Answer: 4
Fast method: Congruence modulo m has m classes.
Sanity check: Every integer has exactly one remainder in 0 to 3, so the 4 classes cover all integers with no overlap.
Example 3 (medium)
On 1, 2, 3, 4, R = (1,1), (2,2), (3,3), (1,2), (2,1). What is the least number of ordered pairs that must be added to make R an equivalence relation?
| Step | Marks |
|---|---|
| R is symmetric and transitive but (4,4) is missing, so it is not reflexive. | 1 |
| Adding (4,4) restores reflexivity and no new chain a-b, b-c needs a new pair. | 1 |
| One pair is added: 1. | 1 |
| Total: 3 marks | 3 |
Answer: 1
Fast method: Check the diagonal first, then look for broken chains.
Sanity check: The final relation has the classes 1,2, 3, 4, a valid partition of the 4 elements.
Example 4 (medium)
Find the number of relations on 1, 2, 3 that are symmetric and transitive but not reflexive.
| Step | Marks |
|---|---|
| Such a relation is an equivalence relation on a subset S of the set (elements outside S are related to nothing). | 1 |
| Count: S empty gives 1; one element gives 3 x 1 = 3; two elements give 3 x 2 = 6; three elements give 5. Total 15. | 2 |
| Remove the 5 equivalence relations (S = whole set): 15 - 5 = 10. | 1 |
| Total: 4 marks | 4 |
Answer: 10
Fast method: Sum the Bell numbers over subsets, then subtract the equivalence relations.
Sanity check: The 15 symmetric-transitive relations include the empty relation and the 5 equivalence relations, so 10 non-reflexive ones is a plausible remainder.
Example 5 (hard, multi-step)
On S = 1, 2, ..., 30, a R b means a - b is divisible by 7. Find the number of ordered pairs in R.
| Step | Marks |
|---|---|
| R is an equivalence relation with classes given by the remainder modulo 7. | 1 |
| 30 = 4 x 7 + 2, so remainders 1 and 2 occur 5 times and remainders 3, 4, 5, 6, 0 occur 4 times. | 2 |
| Pairs = 2 x 5² + 5 x 4² = 50 + 80. | 1 |
| The number of ordered pairs in R is 130. | 1 |
| Total: 5 marks | 5 |
Answer: 130
Fast method: Sum of squares of class sizes: 2 x 25 + 5 x 16.
Sanity check: If all 30 were spread evenly the classes would have size about 4.3 and 7 x 4.3² is about 130, matching.
Example 6 (hard, multi-step)
Find the number of equivalence relations on 1, 2, 3, 4, 5.
| Step | Marks |
|---|---|
| Equivalence relations correspond to partitions of the set, so count partitions by block sizes. | 1 |
| 5 (1), 4+1 (5), 3+2 (10), 3+1+1 (10), 2+2+1 (15), 2+1+1+1 (10), 1+1+1+1+1 (1). | 3 |
| Total = 1 + 5 + 10 + 10 + 15 + 10 + 1 = 52. | 1 |
| Total: 5 marks | 5 |
Answer: 52
Fast method: Bell numbers: 1, 2, 5, 15, 52.
Sanity check: The Bell recurrence B(5) = C(4,0)B(0) + C(4,1)B(1) + C(4,2)B(2) + C(4,3)B(3) + C(4,4)B(4) = 1 + 4 + 12 + 20 + 15 = 52 agrees.
Formulas and units
| Result | Formula | Valid when | Units or note | Worked example |
|---|---|---|---|---|
| Relations from A to B | 2^(mn) with n(A) = m, n(B) = n | n(A) = m, n(B) = n, finite sets | dimensionless count | Example 1 |
| Relations on an n-set | 2^(n²) | relations on a finite n-element set | dimensionless count | none |
| Reflexive relations | 2^(n² - n) | relations on an n-element set | dimensionless count | none |
| Symmetric relations | 2^(n(n+1)/2) | relations on an n-element set | dimensionless count | none |
| Reflexive and symmetric | 2^(n(n-1)/2) | relations on an n-element set | dimensionless count | none |
| Equivalence relations | Bell numbers 1, 2, 5, 15, 52 (n = 1 to 5) | number of equivalence relations on an n-element set (partitions) | dimensionless count | Example 6 |
| Ordered pairs in an equivalence relation | sum of (class size)² | equivalence relation on a finite set | dimensionless count | Example 5 |
| Congruence mod m on integers | m classes: remainders 0 to m - 1 | integers, a ~ b when m divides a - b, m positive | dimensionless count | Example 2 |
Common mistakes and speed
- Declaring a relation transitive after checking only a few pairs. Why it tempts: Most pairs satisfy the condition, and one missing shortcut such as (1,3) is easy to overlook.
- Believing symmetric and transitive together imply reflexive. Why it tempts: The two-line proof a R b, b R a, so a R a looks complete but assumes a is related to something.
- Counting symmetric relations as 2^(n² / 2). Why it tempts: Symmetry seems to halve the pairs, but the n diagonal pairs are free; the correct exponent is n(n+1)/2.
- Giving the number of classes when the number of ordered pairs is asked. Why it tempts: Classes are found first and the number looks like a complete answer.
Time per question and fast method
Target: about 90 seconds per question.
For a property check, scan the pairs for a chain with a missing shortcut (transitivity usually fails first). For counting, split off the diagonal and the unordered off-diagonal pairs. For an equivalence relation, jump to classes and sum squares of sizes.
Recall quiz
Pick an option for each question. Your answers stay on this page and are not sent anywhere.
Score: 0 of 6 correct. Pick an option for each question.
Practice
- On A = 1, 2, 3, the relation R = (1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2) is Verified (T1)
- The number of relations on a set with 3 elements that are both reflexive and symmetric is Verified (T1)
- The number of equivalence relations on the set 1, 2, 3, 4 is Verified (T1)
- On S = 1, 2, ..., 20, a relation R is defined by a R b if the product ab is a perfect square. R is an… Verified (T1)
- The number of relations on A = 1, 2, 3, 4 that are reflexive and symmetric but not transitive is Verified (T3)
Previous-year questions
Previous-year questions are not imported yet. Previous-year questions are not imported yet; see the official papers on the NTA site. Official NTA papers page.
Going deeper and revision
Definition, domain, range, inverse and counting relations
A relation from A to B is any subset of the Cartesian product A x B. If n(A) = m and n(B) = n, there are 2^(mn) relations from A to B, and 2^(n²) relations on an n-element set. The domain is the set of first elements, the range the set of second elements that actually occur, and the codomain is B. The inverse of R contains (b, a) for every (a, b) in R. Special relations on A: the empty relation (no pairs), the universal relation (A x A) and the identity relation (a, a); the universal and identity relations are both equivalence relations, while the empty relation is not when A is non-empty.
Reflexive, symmetric, transitive and antisymmetric
R on A is reflexive if (a, a) is in R for every a; symmetric if (a, b) in R implies (b, a) in R; transitive if (a, b) and (b, c) in R imply (a, c) in R; antisymmetric if (a, b) and (b, a) in R force a = b. Counting on an n-set: reflexive 2^(n² - n); symmetric 2^(n(n+1)/2); reflexive and symmetric 2^(n(n-1)/2); antisymmetric 2ⁿ x 3^(n(n-1)/2). Edge cases: a relation with no pairs satisfies symmetry and transitivity vacuously; (a, a) alone is symmetric, transitive and antisymmetric; "a divides b" on positive integers is reflexive, transitive and antisymmetric but not symmetric.
Equivalence relations, classes and partitions
An equivalence relation is reflexive, symmetric and transitive. The class of a is [a] = x : x R a. Two classes are either equal or disjoint, and their union is A, so classes form a partition of A; conversely every partition defines an equivalence relation (related when in the same block). Hence the number of equivalence relations on an n-set is the Bell number: 1, 2, 5, 15, 52 for n = 1 to 5. Standard examples: congruence modulo m on integers gives m classes; "ab is a perfect square" on positive integers groups numbers by square-free part; "same remainder" and "same value of a function f" are always equivalence relations.
Proving and disproving, pairs and classes
To prove equivalence, check three properties in order, writing the algebraic reason for each. To disprove, give one counter-example: |a - b| less than or equal to 1 on the integers is reflexive and symmetric but not transitive (1, 2 and 2, 3 but not 1, 3). Symmetric plus transitive gives a R b, b R a, so a R a, but only for an a that is related to something; an element related to nothing makes the relation non-reflexive. If the classes have sizes s1, s2, ..., the number of ordered pairs in R is s1² + s2² + ...; the number of classes is the number of distinct invariants. The smallest equivalence relation containing R adds missing diagonal pairs, reverses pairs, and closes under transitivity.
Memory hook
Suppose 12 students are seated on 3 benches with 4 students on each bench, and two students are "bench-mates" if they sit on the same bench. Each student is a bench-mate of themselves, if A is a bench-mate of B then B is of A, and if A and B share a bench and B and C share a bench then A and C do too.
- Suppose we count the ordered pairs of bench-mates: each student pairs with all 4 on the bench, including themselves, giving 4 pairs per student.
- So the total is 12 x 4 = 48, which is the same as 3 benches x 4² = 48 (the sum of the squares of the class sizes).
- The 3 benches form a partition of the 12 students, and bench-mate is exactly the equivalence relation of that partition.
Reflexive, symmetric and transitive together mean "same group", and the groups (classes) split the set into disjoint pieces.
An equivalence relation is the same-bench rule: it slices the set into benches.
Revision card
Try to answer each without looking above.
- Define reflexive, symmetric and transitive in one line each.
- How many relations are there on an n-element set, and how many are reflexive?
- How many reflexive and symmetric relations are there on an n-set?
- What is the link between equivalence relations and partitions?
- Give a relation that is symmetric and transitive but not reflexive.
- How do you count the ordered pairs in an equivalence relation from its classes?
Sources and review
Reviewed Reviewed on 2026-11-20: every number recomputed by code and independently reviewed; textbook section references pending.
- Method: Every number in worked examples, recall checks and notes recomputed by code; claims recomputed independently by a separate verifier run using other numerical methods; textbook section references not yet attached; wording defects found were fixed afterwards and re-linted (code checks re-run) but not re-reviewed by a second run; syllabus scope compared with the NTA JEE Main 2026 syllabus text (by the verifier; see the report)
- Reviewer: independent verifier agent run (not the author)
- Date: 2026-11-20
- Defects found: 1; fixed: 1
- Report: content/reviews/learn5-set-2026-11-20.md
Textbook references
- NCERT Mathematics, Class 11 (reprint 2026-27), Chapter 2: Relations and Functions, 2.3 Relations (read 2026-11-22)
- NCERT Mathematics Part 1, Class 12 (reprint 2026-27), Chapter 1: Relations and Functions, 1.2 Types of Relations (read 2026-11-22)
Sources used
- Syllabus: NTA JEE (Main) 2026 syllabus, Mathematics, Unit 1, line id jee-main-2026-U01 in syllabus/lines/jee-main/2026.json
- NCERT Class 12 Mathematics, Relations and Functions (read as a reference for scope only; content written fresh for this site, textbook section references still pending)
How labels work: see how answers and lessons are verified. Found a mistake? Use Report an error on any question page.