finding different equivalence relations The original question is:
How many different equivalence relations can we define on the set $A = \{x,y,z\}$?
I illustrate my confusion in reaching a possible solution with 2 parts below:
Part (1):
The possible partitions of set $A$ are:
a) $\{\{x\}, \{y\}, \{z\}\}$
b) $\{\{x\}, \{y, z\}\}$ 
c) $\{\{y\}, \{x, z\}\}$ 
d) $\{\{z\}, \{x, y\}\}$ 
e) $\{\{x, y, z\}\}$
Part (2): One possible equivalence relation is $\{(x,x), (y,y), (z,z)\}$. 
My question is, how can I use something from Part (1) to get to Part (2)? There is clearly something integral to equivalence relations that I am missing. I know that an equivalence relation is transitive, symmetric, and reflexive, but how does part 2 show transitivity or symmetry?
 A: There is a correspondence between partitions and equivalence relations. 
To illustrate this, I'll give you a concrete example. Suppose $$A = \{ \rm USA, \  \rm France, \ \rm Germany, \ \rm UK \},$$ and suppose that we declare two countries to be "equivalent" if they are in the same continent. Then we can partition $A$ into two subsets:
$$ A_{\rm North \ America} = \{ \rm USA \}, \ \ \ \ A_{\rm Europe} = \{ \rm France, \rm Germany, \rm UK \}.$$
Having partitioned the set in this way, it is clear that two countries are equivalent under the equivalence relation if and only if they are members of the same subset within the partition.
Now let's keep $A$ the same, but change the equivalence relation. Suppose we now decide to declare two countries to be "equivalent" if their people speak the same language. Then we can partition $A$ into three subsets:
$$ A_{\rm English} = \{ \rm USA , \rm UK \}, \ \ \ \ A_{\rm French} = \{ \rm France \}, \ \ \ \ A_{\rm German} = \{ \rm Germany \}.$$
Again, two countries are equivalent under this equivalence relation iff they are members of the same subset within the partition.
In general, one can show that there is a one-to-one correspondence between equivalence relations and partitions. Given an equivalence relation, one can obtain a partition by grouping together elements that are equivalent under the equivalence relation. And conversely, given a partition, one can obtain an equivalence relation by declaring two elements equivalent iff they are members of the same subset within the partition.
So since there are five ways of partitioning your set, there must exist precisely five ways of defining equivalence relations on your set.
