next »

[เกียรติศักดิ์]

Equivalence relation แบ่งสมาชิกออกเป็น distinct classes.

Instead of the proof demonstrated in class*, can I also prove this statement by proving that

"If there are two set of equivalent elements, and one element from one set is equal to an element from the other set, then the two sets are considered the same class; that is, no different classes have the same element--the classes are distinct."?

* which prove that by proving that "If there are two classes, and one element from one class is equal to an element from the other class, then the two classes are equal.".

It is what I did in class and not sure whether it is a valid proof.

[ปิยพงษ์ - Head Admin]

...
* which prove that by proving that "If there are two classes, and one element from one class is equal to an element from the other class, then the two classes are equal.".
...

How do you prove that two classes are equal? Isn't it the same method that we did in the class? 

[เกียรติศักดิ์]

...
* which prove that by proving that "If there are two classes, and one element from one class is equal to an element from the other class, then the two classes are equal.".
...

How do you prove that two classes are equal? Isn't it the same method that we did in the class? 

That's what we did in class on the blackboard (by starting with that claim; I gave it as a reference). I wonder whether it is correct to start with this alternative claim in the very beginning:

If there are two set of equivalent elements, and one element from one set is equal to an element from the other set, then the two sets are considered the same class; that is, no different classes have the same element--the classes are distinct."

[เกียรติศักดิ์]

Here's how it went in my paper.

Equivalence relation แบ่งสมาชิกออกเป็น distinct classes.
Claim: If there are two sets of equivalent elements, and one element from one set is equal to an element from the other set, then the two sets are considered the same class; that is, no different classes have the same element--the classes are distinct.

Proof: Supposed that there are two sets of equivalent elements
and .

Let , then (reflexivity).
But , so (transitivity),
and , so (transitivity).

Since each element of one set is equivalent to all elements of the other set,
the two sets can be merged into a single class.

Thus, two sets cannot be considered two classes if there exists at least one common element.
Therefore, two classes are distinct.