Let A=NxN and define a relation R on A by (a,b)R(c,d) iff ab=cd ...show that R is an equivalence relation on A
so we need to show that the relation is: symmetric reflexive transitive did i spell right?
yup
fantastic
so we need to show (a,b)R(a,b) ab=ab so the relation R is symmetric
I get confused with the (a,b)R(c,d) and it shows up in many questions,
(a,b)R(b,a) ab=ba so the relation R is reflexive
zarkon did i do something wrong
reflexive is (a,b)R(a,b)
ok maybe i got my properties mixed up alittle i need to see
symmetric is (a,b)R(c,d) then (c,d)R(a,b)
oh ok, I think I get it now, the ordered pairs threw me off, I'm used to aRb and xRy and the like
darn it zarkon is right
A given binary relation ~ on a set A is said to be an equivalence relation if and only if it is reflexive, symmetric and transitive. Equivalently, for all a, b and c in A: a ~ a. (Reflexivity) if a ~ b then b ~ a. (Symmetry) if a ~ b and b ~ c then a ~ c. (Transitivity)
let me know if you need anymore help i can help with this one now since i have the definition lol
ok, find an equivalence class for E(9,2)
I more so need to understand the concepts then the answers,
can you think of anything that is equivalent to (9,2)
so like (6,3), (18,1)?
yes
now just list them all
(1,18), (3,6), (2,9)...are there others?
(18,1), (6,3), (9,2)
how are they refliexive symmetric and transitive though? I know the dfinitions of them but how in this example are they those 3 things?
the relation R is those 3 things
ok, I understand how it's reflexive, but how is it symmetric and transitive? how can we say that (a,b)R(b,a)
"=" is reflexive symmetric and transitive
oh, is it because ab=cd is commutative?
sorry but could you just show me how R is transitive?
assume (a,b)R(c,d) and (c,d)R(e,f) then ab=cd and cd=ef thus ab=cd=ef hence ab=ef so (a,b)R(e,f)
thanks
then I'm asked to find equivalence class with 2 elements
what is E(1,2)?
Join our real-time social learning platform and learn together with your friends!