Namespaces
Variants
Actions

Difference between revisions of "Transitive relation"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Category:Logic and foundations)
(transitive closure, cite Fraïssé (2011))
Line 1: Line 1:
 
{{TEX|done}}
 
{{TEX|done}}
One of the most important properties of a [[binary relation]]. A relation $R$ on a set $A$ is called transitive if, for any $a,b,c\in A$, the conditions $aRb$ and $bRc$ imply $aRc$. [[Equivalence relation]]s and orderings (cf [[Partially ordered set]]) are examples of transitive relations.
+
One of the most important properties of a [[binary relation]]. A relation $R$ on a set $A$ is called transitive if, for any $a,b,c\in A$, the conditions $aRb$ and $bRc$ imply $aRc$. [[Equivalence relation]]s and [[Order (on a set)|orderings]] are examples of transitive relations. The universal relation, $a R b$ for all $a,b \in A$, the equality relation, $a R b$ for $a=b \in A$ and the empty relation are transitive.
 +
 
 +
The intersection of transitive relations on a set is again transitive.  The ''transitive closure'' $R^*$ of a relation $R$ is the smallest transitive relation containing $R$.  It can be described as $a R^* b$ if there exists a finite chain $a = a_0, a_1, \ldots, a_n = b$ such that for each $i=1,\ldots,n$ we have $a_{i-1} R a_i$.
 +
 
 +
====References====
 +
<table>
 +
<TR><TD valign="top">[a1]</TD> <TD valign="top">  R. Fraïssé, ''Theory of Relations'', Studies in Logic and the Foundations of Mathematics, Elsevier (2011) ISBN 0080960413</TD></TR>
 +
</table>
  
 
[[Category:Logic and foundations]]
 
[[Category:Logic and foundations]]

Revision as of 18:33, 19 October 2014

One of the most important properties of a binary relation. A relation $R$ on a set $A$ is called transitive if, for any $a,b,c\in A$, the conditions $aRb$ and $bRc$ imply $aRc$. Equivalence relations and orderings are examples of transitive relations. The universal relation, $a R b$ for all $a,b \in A$, the equality relation, $a R b$ for $a=b \in A$ and the empty relation are transitive.

The intersection of transitive relations on a set is again transitive. The transitive closure $R^*$ of a relation $R$ is the smallest transitive relation containing $R$. It can be described as $a R^* b$ if there exists a finite chain $a = a_0, a_1, \ldots, a_n = b$ such that for each $i=1,\ldots,n$ we have $a_{i-1} R a_i$.

References

[a1] R. Fraïssé, Theory of Relations, Studies in Logic and the Foundations of Mathematics, Elsevier (2011) ISBN 0080960413
How to Cite This Entry:
Transitive relation. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Transitive_relation&oldid=33953
This article was adapted from an original article by T.S. Fofanova (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article