Equivalence Relations in Set Theory: Homework Statement and Solutions

imranq
Messages
57
Reaction score
1

Homework Statement


zu3x5e.png

Homework Equations


An equivalence relation on a set A, is for a,b,c in A if:
a~a
a~b => b~a
a~b and b~c => a~c

The Attempt at a Solution


It seems uncomplicated, but I don't know how I would write down a proof. The book I'm using is Topics in Algebra, 1st Edition Herstein
 
Physics news on Phys.org
What if there were some element a \in A which wasn't related to any other member of A?
 
In other words, consider A= {1, 2, 3} and the relation is {(1, 1), (1,2), (2,1), (2,2)},
 
HallsofIvy said:
In other words, consider A= {1, 2, 3} and the relation is {(1, 1), (1,2), (2,1), (2,2)},

I don't understand this. I think equivalence classes are generalized equal signs for some property. So (1,1) I understand, but how so for (1,2)?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top