Let A = {1, 2, 3}. The number of equivalence | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(C) For a relation $R$ on $A = \{1, 2, 3\}$ to be an equivalence relation containing $(1, 2)$,it must satisfy reflexivity,symmetry,and transitivity.Si

Vedclass · Accepted Answer

$2$

Vedclass · Answer

(C) For a relation $R$ on $A = \{1, 2, 3\}$ to be an equivalence relation containing $(1, 2)$,it must satisfy reflexivity,symmetry,and transitivity.Since it is reflexive,$(1, 1), (2, 2), (3, 3) \in R$.Since it contains $(1, 2)$ and is symmetric,$(2, 1) \in R$.Now we have $R_0 = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}$. This is an equivalence relation.To add more elements while maintaining equivalence,we must consider the partitions of $A$. The partition corresponding to $R_0$ is $\{\{1, 2\}, \{3\}\}$.The only other partition of $A$ that contains the subset $\{1, 2\}$ is the trivial partition $\{\{1, 2, 3\}\}$.The equivalence relation corresponding to the partition $\{\{1, 2, 3\}\}$ is the universal relation $A 	imes A$,which contains $(1, 2)$.Thus,there are $2$ such equivalence relations: $\{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}$ and $A 	imes A$.

Let $A = \{1, 2, 3\}$. The number of equivalence relations on $A$ containing $(1, 2)$ is . . . . . . .

Similar Questions

The number of reflexive relations on a set $A$ of $n$ elements is equal to

Let $R$ be a relation from $Q$ to $Q$ defined by $R = \{(a, b) : a, b \in Q \text{ and } a - b \in Z\}$. Show that $(a, b) \in R$ implies that $(b, a) \in R$.

The number of relations on the set $\{1,2,3\}$ containing $(1,2)$ and $(2,3)$,which are reflexive and transitive but not symmetric,is

Give an example of a relation which is reflexive and transitive but not symmetric.

If $R = \{(6, 6), (9, 9), (6, 12), (12, 12), (12, 6)\}$ is a relation on set $A = \{3, 6, 9, 12\}$,then relation $R$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module