Difference between revisions of "Transitive property"
(stub) |
m |
||
(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
− | A [[relation]] <math>R(x,y)</math> is | + | 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}} | {{stub}} | ||
Line 6: | Line 6: | ||
* [[Partially ordered set]] | * [[Partially ordered set]] | ||
+ | * [[Equivalence relation]] | ||
[[Category:Abstract algebra]] | [[Category:Abstract algebra]] | ||
+ | [[Category:Definition]] |
Latest revision as of 16:52, 16 June 2008
A binary relation is said to be transitive or to have the transitive property if
and
together imply
.
This article is a stub. Help us out by expanding it.