NVAMediumJEE 2023Relations

JEE Mathematics 2023 Question with Solution

The minimum number of elements that must be added to the relation R={(a,b),(b,c),(b,d)}R = \{(a, b), (b, c), (b, d)\} on the set {a,b,c,d}\{a, b, c, d\} so that it is an equivalence relation, is:

Answer

Correct answer:13

Step-by-step solution

Standard Method

Given: R={(a,b),(b,c),(b,d)}R = \{(a, b), (b, c), (b, d)\} on the set {a,b,c,d}\{a, b, c, d\}.

Find: The minimum number of ordered pairs that must be added so that RR becomes an equivalence relation.

An equivalence relation must be reflexive, symmetric, and transitive.

For reflexivity, the pairs

(a,a),(b,b),(c,c),(d,d)(a,a),(b,b),(c,c),(d,d)

must be present.

For symmetry, since

R={(a,b),(b,c),(b,d)}R = \{(a,b),(b,c),(b,d)\}

we must also add

(b,a),(c,b),(d,b)(b,a),(c,b),(d,b)

so that each ordered pair has its reverse.

For transitivity, the required additional pairs are

(a,c),(a,d),(c,a),(d,a),(c,d),(d,c)(a,c),(a,d),(c,a),(d,a),(c,d),(d,c)

.

Thus, the total number of pairs to be added is

4+3+6=134 + 3 + 6 = 13

.

Therefore, the minimum number of elements to be added is 1313.

Count by equivalence class completion

Given: R={(a,b),(b,c),(b,d)}R = \{(a, b), (b, c), (b, d)\} on {a,b,c,d}\{a, b, c, d\}.

Find: How many more ordered pairs are needed to make it an equivalence relation.

Because aa is related to bb, bb is related to cc, and bb is related to dd, all four elements must lie in the same equivalence class after completion. Hence the final equivalence relation on {a,b,c,d}\{a,b,c,d\} must contain all possible ordered pairs of this class, namely 42=164^2 = 16 pairs.

The relation already contains 33 pairs:

(a,b),(b,c),(b,d)(a,b),(b,c),(b,d)

.

So the number of new pairs required is

163=1316 - 3 = 13

.

Therefore, the minimum number of elements to be added is 1313.

Common mistakes

  • Adding only reflexive pairs and stopping there. An equivalence relation must satisfy all three properties: reflexive, symmetric, and transitive. After adding self-pairs, you must still check reverse pairs and transitive consequences.

  • Checking symmetry for the original pairs but forgetting that newly added symmetric pairs can create further transitive requirements. After adding reverse pairs, recheck transitivity on the enlarged relation.

  • Counting distinct elements instead of ordered pairs. In a relation, (a,b)(a,b) and (b,a)(b,a) are different ordered pairs, so both must be counted separately when required.

Practice more Relations questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step - free to start.

Related questions