Let on be asymmetric and negatively transitive, and define iff and . The relation is said to be symmetric if implies . Then
Tap an option to check your answer.
Let on be asymmetric and negatively transitive, and define iff and . The relation is said to be symmetric if implies . Then
Tap an option to check your answer.
Checking your account…
Let ≻ on X be asymmetric and negatively transitive, and define x~ y iff ¬(x≻ y) and ¬(y≻ x). The relation ~ is said to be symmetric if x~ y implies y~ x. Then ~ (A) is symmetric (B) is not symmetric (C) may not be symmetric (D) is not symmetric over a nonempty subset of X
Also written as: Let >- on X be asymmetric and negatively transitive, and define x~ y iff not (x>- y) and not (y>- x). The relation ~ is said to be symmetric if x~ y implies y~ x. Then ~
Sets, relations and functions has come up 65 times in 6 exams since 2004.
This question is on Relations and their properties, part of Sets, relations and functions in Mathematics.
Binary relations and what reflexive, symmetric, transitive, complete and order properties imply.
TestStop has 6 past-paper questions on this subtopic.
Question from the DSE 2020 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.