Answer :

It is given that A = {1, 2, 3}.

An equivalence relation is reflexive, symmetric and transitive.


The smallest equivalence relations containing (1, 2) is equal to


R1 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}


Now, only four pairs are left (2, 3), (3, 2), (1, 3) and (3, 1).


So, if we add one pair to R, then for symmetry we must add (3, 2).


Also, for transitivity we required to add (1, 3) and (3, 1).


Thus, the only equivalence relation is the universal relation.


Therefore, the total number of equivalence relations containing (1, 2) is 2.

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation
caricature
view all courses
RELATED QUESTIONS :

Fill in theMathematics - Exemplar

State True Mathematics - Exemplar

State True Mathematics - Exemplar

State True Mathematics - Exemplar

Let A = {1, 2, 3}Mathematics - Exemplar

Show that the relMathematics - Board Papers

Let N denote the Mathematics - Board Papers