[Math] find the number of equivalence classes of $\mathbb R$.

combinatoricselementary-set-theoryequivalence-relations

Let $\mathscr X$ be the set of all nonempty sub sets of the set $\{1,2,3,…,10\}. $Define the relation $\mathscr R$ on $\mathscr X$ by: for all $A,B \in \mathscr X, A\mathscr RB$ if and only if the smallest element of $A$ is equal to the smallest element of $B$.

(a) find the number of equivalence classes of $\mathbb R$.

(b) find the number of elements in the equivalence class $[\{2,6,7\}]$.

I am thinking this would be the number of subsets containing the element 2 of the set $\{1,3,4,…,10\}$ so it would be $2^9$?

(c) find the number of four-element sets which are elements of the equivalence class $[\{2,6,7\}]$.

Also this would be like choosing a 3-element subset from the set $\{1,3,4,…,10\}$ so ${9 \choose 3}$?

Best Answer

Hints to each:

a) Consider looking at the single element subsets and notice how these compare to multi-element subsets in terms of using the equivalence. I suspect it is the cardinality of X that is the answer here but I'll leave it to you to prove that.

b) Would {1,2,3} be in the same class? In this case, 1 is the smallest element while the given set has 2 as its smallest element so it isn't quite that simple.

c) If you fix the error in the previous case this should be relatively easy to see that you are close but not quite right.

Related Question