Quasitransitive relation

From Wikipedia, the free encyclopedia

Quasitransitivity is a weakened version of transitivity. Informally, a relation is quasitransitive if it is transitive where it is asymmetric.

[edit] Formal definition

In mathematics, a binary relation T over a set X is quasitransitive if for all a, b, and c in X the following holds:

$(a\operatorname{T}b) \wedge \neg(b\operatorname{T}a) \wedge (b\operatorname{T}c) \wedge \neg(c\operatorname{T}b) \Rightarrow (a\operatorname{T}c) \wedge \neg(c\operatorname{T}a)$

If the relation is also antisymmetric, T is transitive.

Alternately, for a relation T, define the asymmetric part of the relation P:

$(a\operatorname{P}b) \Leftrightarrow (a\operatorname{T}b) \wedge \neg(b\operatorname{T}a)$

Then T is quasitransitive iff P is transitive.

[edit] Examples

Preferences might be assumed to be quasitransitive in some economic contexts. The classic example is that a person might be indfferent between 10 and 11 grams of sugar and indifferent to 11 and 12 grams of sugar, but not indifferent between 10 and 12 grams of sugar.