Relations: Difference between revisions
| Line 21: | Line 21: | ||
<span id='Transitive_Relation'></span>A binary relation R ⊆ A x A is '''transitive''' if ''a R b'' and ''b R c'' implies ''a R c'' for all a, b, c ∈ A. | <span id='Transitive_Relation'></span>A binary relation R ⊆ A x A is '''transitive''' if ''a R b'' and ''b R c'' implies ''a R c'' for all a, b, c ∈ A. | ||
<span id=Equivalence_Relation'></span>A relation that is [[#Reflexive_Relation|reflexive]], [[#Symmetric_Relation|symmetric]] and [#Transitive_Relation|transitive]] is an '''equivalence relation'''. | <span id=Equivalence_Relation'></span>A relation that is [[#Reflexive_Relation|reflexive]], [[#Symmetric_Relation|symmetric]] and [[#Transitive_Relation|transitive]] is an '''equivalence relation'''. | ||
=TODO= | =TODO= | ||
<font color=darkgray>[[CLRS]] page 1163</font> | <font color=darkgray>[[CLRS]] page 1163</font> | ||
Revision as of 21:52, 27 August 2018
Internal
Overview
A binary relation R on two sets A and B is a subset of the Cartesian product A x B. If (a, b) belongs to the subset of the Cartesian product that defines the relation, we write a R b.
A binary relation R on a set A is a subset of the Cartesian product A x A.
A n-ary relation on sets A1, A2, .... An is a subset of the Cartesian product A1 x A2 x ... x An.
An example of a binary relation on a finite set is the edge set of a graph.
Binary Relation Properties
A binary relation R ⊆ A x A is reflexive if a R a for all a ∈ A.
A binary relation R ⊆ A x A is symmetric if a R b implies b R a for all a, b ∈ A.
A binary relation R ⊆ A x A is transitive if a R b and b R c implies a R c for all a, b, c ∈ A.
A relation that is reflexive, symmetric and transitive is an equivalence relation.
TODO
CLRS page 1163