Transitive Relation

In mathematics, a binary relation R over a set X is transitive if it holds for all a, b, and c in X, that if a is related to b and b is related to c, then a is related to c. In mathematical notation, this is:
\forall a, b, c \in X,\ a R b \and b R c \; \Rightarrow a R c
For example, "is greater than" and "is equal to" are transitive relations: if a = b and b = c, then a = c. On the other hand, "is the mother of" is not a transitive relation, because if Alice is the mother of Brenda, and Brenda is the mother of Claire, then Alice is not the mother of Claire. Examples of transitive relations include: A transitive relation that is also reflexive is a preorder. A preorder that is antisymmetric is a partial order. A preorder that is symmetric, is an equivalence relation. See also transitive closure, Intransitivity

External Link

 

<< PreviousWord BrowserNext >>
eliphas levi
friedrich wilhelm gotter
limbic system
francesco scipione, marchese di maffei
friedrich leopold graf zu stolberg
international resources group
afghanistan timeline march 1 15, 2003
boston pops orchestra
frank evans
little owl
list of places in iraq
silvestre de sacy
solonian constitution
uss frank e. evans (dd 754)
uss admiralty islands (cve 99)
phillip johnson
hatra
f space
british coin one pound
mats wilander
homer n. wallin
ludlow castle
nkf
reflexive relation
symmetric relation
tasmanian devil (cartoon)
oligonucleotide
theodor benfey
taz
friedrich thiersch
stephen hunt
mosul
unit of measure
muslin
list of dubious danish kings
a solitary grief
karl felix halm
gary hart
british coin five pounds
johann caspar von orelli
the adventures of brisco county, jr.
loudun
angle of incidence
angle of refraction