Describe, with proof, all relations R on {4, 5, 6} that are symmetric and transitive, and for which 4R5, but that are not equivalence relations.
in Other Math Topics by Level 1 User (120 points)

Your answer

Your name to display (optional):
Privacy: Your email address will only be used for sending these notifications.
Anti-spam verification:
To avoid this verification in future, please log in or register.

1 Answer

Define aRb iff a-b≠0.

For {4, 5, 6}, 4R5=5R4, 5R6=6R5 (symmetry); 4R5 and 5R64R6 (transitivity), and 4R6=6R4 (symmetry). But 4R4=0, 5R5=0, 6R6=0 (non-reflexivity).

Therefore, even though the relations are transitive and symmetrical, they are not reflexive so equivalence does not apply.

by Top Rated User (840k points)

Related questions

1 answer
asked Jun 8, 2020 in Other Math Topics by ainm Level 1 User (220 points) | 96 views
1 answer
1 answer
asked Jul 19, 2020 in Other Math Topics by ainm Level 1 User (220 points) | 87 views
1 answer
1 answer
asked Nov 18, 2016 in Other Math Topics by anonymous | 261 views
1 answer
asked Jun 8, 2020 in Other Math Topics by ainm Level 1 User (220 points) | 50 views
1 answer
asked Sep 10, 2014 in Other Math Topics by anonymous | 261 views
Welcome to MathHomeworkAnswers.org, where students, teachers and math enthusiasts can ask and answer any math question. Get help and answers to any math problem including algebra, trigonometry, geometry, calculus, trigonometry, fractions, solving expression, simplifying expressions and more. Get answers to math questions. Help is always 100% free!
86,310 questions
92,368 answers
2,251 comments
23,929 users