Let a binary relation on a set be asymmetric (for all : implies ) and negatively transitive (for all : implies or ). Recall is irreflexive if for all , and transitive if and imply . Then is
Tap an option to check your answer.
Let a binary relation on a set be asymmetric (for all : implies ) and negatively transitive (for all : implies or ). Recall is irreflexive if for all , and transitive if and imply . Then is
Tap an option to check your answer.
Checking your account…
Let a binary relation ≻ on a set X be asymmetric (for all x,y: x≻ y implies ¬(y≻ x)) and negatively transitive (for all x,y,z: x≻ y implies x≻ z or z≻ y). Recall ≻ is irreflexive if ¬(x≻ x) for all x, and transitive if x≻ y and y≻ z imply x≻ z. Then ≻ is (A) irreflexive, but not transitive (B) transitive, but not irreflexive (C) irreflexive and transitive (D) neither transitive, nor irreflexive
Also written as: Let a binary relation >- on a set X be asymmetric (for all x,y: x>- y implies not (y>- x)) and negatively transitive (for all x,y,z: x>- y implies x>- z or z>- y). Recall >- is irreflexive if not (x>- x) for all x, and transitive if x>- y and y>- z imply x>- z. Then >- is
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.