Difference between revisions of "Transitive property"

Latest revision as of 15:52, 16 June 2008

A binary relation $R(x,y)$ is said to be transitive or to have the transitive property if $R(x,y)$ and $R(y,z)$ together imply $R(x,z)$ .

This article is a stub. Help us out by expanding it.

@@ Line 1: / Line 1: @@
-A [[relation]] <math>R(x,y)</math> is called ''transitive'' if <math>R(x,y)</math> and <math>R(y,z)</math> together imply <math>R(x,z)</math>.
+A [[binary relation]] <math>R(x,y)</math> is said to be '''transitive''' or to have the '''transitive property''' if <math>R(x,y)</math> and <math>R(y,z)</math> together imply <math>R(x,z)</math>.
 {{stub}}
@@ Line 6: / Line 6: @@
 * [[Partially ordered set]]
+* [[Equivalence relation]]
 [[Category:Abstract algebra]]
+[[Category:Definition]]