3

I am given to prove this proposition on equivalence classes.

Each element of $A$ is an element of one and only one equivalent class.

The part that is confusing is one and only one. It sounds like an existential statement, the existence of an equivalence class and that that equivalence class is unique. How should one understand this proposition in "common" logic terms, namely "for every", "there exists", if..then,...?

So far here is my understanding, or say 'translation' of the proposition:

There exists a unique equivalence class such that each element of $A$ belongs to that equivalence class.

This understanding is doubtful, at least for me, because it implies that all elements of $A$ belong to one equivalence class, which is wrong.

I am not looking for a proof, just an understanding of the proposition. Thanks!

Asaf Karagila
  • 393,674
nt.bas
  • 475

3 Answers3

4

If $E$ is an equivalence relation on $A$ then for every $a\in A$ there exists an equivalence class $B$ such that $a\in B$, and for every equivalence class $C$, $a\in C$ implies $C=B$.

So there exists such equivalence class, and it is unique.

Note, however, that $\forall a\exists B\ldots$ is not the same as $\exists B\forall a\ldots$. The former is what I wrote above, and the latter is the statement that all the elements are in the same equivalence class.

Asaf Karagila
  • 393,674
  • 3
    No, OP has the quantifiers in the wrong order. It's not "There exists a unique equivalence class such that each element of A belongs to that equivalence class"; it's "For each element of A, there exists a unique equivalence class such that the element belongs to that equivalence class", and this is exactly the source of their confusion. – MJD Feb 17 '13 at 23:26
  • @MJD: Oh, sorry. I misread the question. Anyway I've corrected my answer now. – Asaf Karagila Feb 17 '13 at 23:27
  • @AsafKaragila Thanks! But i assume $a \in A$ is the element "generating" the equivalent class $B$. Is that right? p.s. by "generating" i mean: $B = {x \in A: a \sim x}$ where $\sim$ is the equivalence relation. – nt.bas Feb 17 '13 at 23:48
  • @nt.bas: Because there is a unique such $B$ the relation ${\langle a,B\rangle\mid a\in B, B\text{ an equivalence class}}$ is a function and we can say that $a$ "generates" it. – Asaf Karagila Feb 17 '13 at 23:50
  • @AsafKaragila thanks for the info on functions but i was asking about $a \in A$. I mean i don't understand if one has to prove the proposition with respect to $a$ or $x$. More clearly, is it: "For every $a \in A$, there exists one unique equivalence class B such that $a \in B$" OR "For every $x \in A$, there exists one unique equivalence class B such that $x \in B$". Understood that $B \subset A$. I don't understand the relationship between $a \in A$ and $x \in B$. – nt.bas Feb 18 '13 at 00:17
  • @nt.bas: Is the equation $y=5$ any different from $x=5$? The two statements are the same, because we replaced all the instances of $a$ with $x$ (and $x$ did not appear there before). – Asaf Karagila Feb 18 '13 at 00:20
  • @AsafKaragila True! But since $x$ wasn't introduced before i thought i was missing something. – nt.bas Feb 18 '13 at 00:22
  • @nt.bas: Yes, that was a typo, sorry 'bout that! :-) – Asaf Karagila Feb 18 '13 at 00:23
2

There exists a unique equivalence class such that each element of A belongs to that equivalence class.

This understanding is doubtful, at least for me, because it implies that all elements of A belong to one equivalence class, which is wrong.

You are right to be doubtful, because your translation is wrong. You are being asked to prove that for each element $a$ in $A$, the element $a$ belongs to exactly one equivalence class. But your translation, as you observed, says there is one equivalence class to which every element of $a$ belongs.

This subtle difference catches many beginning mathematics students. But the order of the quantifiers ("there exists" and "for each") is important. For example, it is true that for each number $x$, there is exactly one number $y$ that is the square of $x$. But it is completely false that there is exactly one number $y$ which, for each number $x$, is the square of $x$.

It is correct to say that a number $x$ has one and only one square. But we don't mean by this that every number has the same square! And similarly when we say that an element of $A$ is in "one and only one" equivalence class, we don't mean that every element is in the same class. We just mean that each element is in one class, not zero, and not more than one.

MJD
  • 65,394
  • 39
  • 298
  • 580
1

You are asked to show that any given element $x\in A$ belongs to precisely one equivalence class. Thus, that for that given element $x\in A$ there exists an equivalence class $E$ such that $x\in E$ and that if $F$ is any other equivalence class with $x\in F$ then $E=F$. Of course for any other element $y$ its unique equivalence class might be different than $E$.

Ittay Weiss
  • 79,840
  • 7
  • 141
  • 236