Question:

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

Updated On: Mar 20, 2025
Hide Solution
collegedunia
Verified By Collegedunia

Correct Answer: 13

Approach Solution - 1

The correct answer is 13
Given
In order to make it equivalence relation as per given set, must be
,

There already given so 13 more to be added.
Was this answer helpful?
0
1
Hide Solution
collegedunia
Verified By Collegedunia

Approach Solution -2

Step 1: Ensure Reflexivity 

For reflexivity, each element in the set \( \{ a, b, c, d \} \) must relate to itself. Thus, the following pairs need to be added:

\[ (a, a), (b, b), (c, c), (d, d). \] 

Step 2: Ensure Symmetry

For symmetry, if \( (x, y) \in R \), then \( (y, x) \) must also be in \( R \). The given relation is:

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

To ensure symmetry, the following pairs need to be added:

\[ (b, a), (c, b), (d, b). \] 

Step 3: Ensure Transitivity

For transitivity, if \( (x, y) \in R \) and \( (y, z) \in R \), then \( (x, z) \) must also be in \( R \). Adding the necessary pairs for transitivity gives:

\[ (a, c), (a, d), (c, a), (d, a), (c, d), (d, c). \] 

Step 4: Total pairs to be added

The total number of pairs to be added is:

\[ 4 \text{ (reflexive)} + 3 \text{ (symmetric)} + 6 \text{ (transitive)} = 13. \]

Was this answer helpful?
0
0

Concepts Used:

Relations and functions

A relation R from a non-empty set B is a subset of the cartesian product A × B. The subset is derived by describing a relationship between the first element and the second element of the ordered pairs in A × B.

A relation f from a set A to a set B is said to be a function if every element of set A has one and only one image in set B. In other words, no two distinct elements of B have the same pre-image.

Representation of Relation and Function

Relations and functions can be represented in different forms such as arrow representation, algebraic form, set-builder form, graphically, roster form, and tabular form. Define a function f: A = {1, 2, 3} → B = {1, 4, 9} such that f(1) = 1, f(2) = 4, f(3) = 9. Now, represent this function in different forms.

  1. Set-builder form - {(x, y): f(x) = y2, x ∈ A, y ∈ B}
  2. Roster form - {(1, 1), (2, 4), (3, 9)}
  3. Arrow Representation