RankRizz
JEE MAIN 2025 · 22 JAN S1+4 / −1MEDIUMTRANSCRIBED

JEE Main 2025 Mathematics question — Cartesian products and counting relations

The number of equivalence relations on the set {1,2,3}\left\{1, 2, 3\right\} is :

SOLUTION

An equivalence relation on a set must satisfy three properties: reflexivity, symmetry, and transitivity. The number of equivalence relations on a set is equal to the number of partitions of that set, as each partition defines an equivalence class.

For the set S={1,2,3}S = \{1, 2, 3\}, we need to find all possible partitions. A partition divides the set into non-empty, disjoint subsets whose union is the entire set.

The possible partitions are:

1. Partition with one subset:
- The entire set: {{1,2,3}}\{\{1, 2, 3\}\}
This corresponds to one equivalence relation where all elements are related to each other.

2. Partitions with two subsets:
- Subset 1: {1}\{1\}, Subset 2: {2,3}\{2, 3\}
- Subset 1: {2}\{2\}, Subset 2: {1,3}\{1, 3\}
- Subset 1: {3}\{3\}, Subset 2: {1,2}\{1, 2\}
Each of these partitions corresponds to an equivalence relation where elements in the same subset are equivalent. There are three such partitions.

3. Partition with three subsets:
- Each element in its own subset: {{1},{2},{3}}\{\{1\}, \{2\}, \{3\}\}
This corresponds to the equivalence relation where each element is only related to itself.

Total number of partitions = 1 (one subset) + 3 (two subsets) + 1 (three subsets) = 5.

Each partition defines a unique equivalence relation. Since reflexivity requires that every element is related to itself (i.e., pairs like (1,1), (2,2), (3,3) must be present), no equivalence relation can be empty. Therefore, all 5 equivalence relations are non-empty.

The number of non-empty equivalence relations is 5.

The correct option is B. 5.

Tagged Cartesian products and counting relations. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicCartesian products and counting relations
TypeMultiple choice