Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (goformit100):

Please check my answer

OpenStudy (goformit100):

For the set A = {1, 2, 3}, define a relation R in the set A as follows: R = {(1, 1), (2, 2), (3, 3), (1, 3)}.

OpenStudy (anonymous):

what is the question?

OpenStudy (goformit100):

Write the ordered pairs to be added to R to make it the smallest equivalence relation

OpenStudy (goformit100):

I got (3, 1) is the single ordered pair which needs to be added to R to make it the smallest equivalence relation. is it correct ?

OpenStudy (anonymous):

it has to be reflexive for one

OpenStudy (anonymous):

which it already is also symmetric

OpenStudy (goformit100):

ok, then am I ok ?

OpenStudy (anonymous):

so you need \((3,1)\) which is what you said

OpenStudy (anonymous):

also needs to be transitive

OpenStudy (anonymous):

ok looks like you are right since \((2,2)\) is off by itself

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!