1
vote
1answer
40 views

proving antisymmetry of partition refinement

Suppose $P$ is the set of all partitions of some set $S$. $R$ is a binary relation on $P$, the refinement relation, defined as $(\Pi_1,\Pi_2) \in R $ if and only if for every $S_1 \in \Pi_1$, there ...
2
votes
1answer
49 views

Is this an equivalence relation?

I think the wording is throwing me off, and I also haven't done math in 4 months so basically my mind is scrambled eggs. Let $\sim$ be a relation on $\Bbb Z$ defined by letting $m \sim n$ if ...
2
votes
3answers
939 views

Number of equivalence relations on a finite set

I need a hint for computing the number of ways in which all the equivalent classes on a set of $n$ elements can be realized. For example, if the set has 2 elements ${a,b}$, then there are 2 possible ...
2
votes
5answers
594 views

General questions about equivalence classes and partitions

1) If a set is partitioned into non-overlapping, non-empty subsets, then those subsets are equivalence classes. If each element in a set is unique, how can a set be partitioned into subsets with ...
2
votes
2answers
357 views

Proof of a Proposition on Partitions and Equivalence Classes

I stumbled upon a seemingly rudimentary proposition that I am having trouble writing out a proof for. The proposition goes something like, Proposition: If $\{A_i|i\in I\}$ is a partition of ...
1
vote
2answers
300 views

Proving a relation between 2 sets as antisymmetric

Let $U = \{1,...,n\}$ And let $A$ and $B$ be partitions of the set $U$ such that: $\bigcup A = \bigcup B = U$ and $|A|=s, |B|=t$ Let's define a relation between the sets $A$ and $B$ as follows: $B ...
4
votes
2answers
244 views

The fibres of a map form a partition of the domain.

This is a question from the free Harvard online abstract algebra lectures. I'm posting my solutions here to get some feedback on them. For a fuller explanation, see this post. This problem is from ...
3
votes
3answers
458 views

“Converting” equivalence relations to partitions

There is a direct relationship between equivalence relations and partitions. Is there a way to simply use an equivalence relation's definition to get the matching partition? And what about the other ...