Question: Problem 1. Let > be a binary relation on set X that satisfies reflexivity, completeness and transitivity. Let - be the symmetric part of >,

 Problem 1. Let > be a binary relation on set X

that satisfies reflexivity, completeness and transitivity. Let - be the symmetric part

Problem 1. Let > be a binary relation on set X that satisfies reflexivity, completeness and transitivity. Let - be the symmetric part of >, i.e., x - y if and only if x > y and y > x. Prove that ~ is transitive

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Economics Questions!