Transitive relation

In mathematics, a binary relation Template:Mvar on a set Template:Mvar is transitive if, for all elements Template:Mvar, Template:Mvar, Template:Mvar in Template:Mvar, whenever Template:Mvar relates Template:Mvar to Template:Mvar and Template:Mvar to Template:Mvar, then Template:Mvar also relates Template:Mvar to Template:Mvar.

Every partial order and every equivalence relation is transitive. For example, less than and equality among real numbers are both transitive: If Template:Math and Template:Math then Template:Math; and if Template:Math and Template:Math then Template:Math.

Definition

Template:Stack A homogeneous relation Template:Mvar on the set Template:Mvar is a transitive relation if,<ref>Template:Harvnb</ref>

for all Template:Math, if Template:Math and Template:Math, then Template:Math.

Or in terms of first-order logic:

<math>\forall a,b,c \in X: (aRb \wedge bRc) \Rightarrow aRc</math>,

where Template:Math is the infix notation for Template:Math.

Examples

As a non-mathematical example, the relation "is an ancestor of" is transitive. For example, if Amy is an ancestor of Becky, and Becky is an ancestor of Carrie, then Amy is also an ancestor of Carrie.

On the other hand, "is the birth mother of" is not a transitive relation, because if Alice is the birth mother of Brenda, and Brenda is the birth mother of Claire, then it does not follow that Alice is the birth mother of Claire. In fact, this relation is antitransitive: Alice can never be the birth mother of Claire.

Non-transitive, non-antitransitive relations include sports fixtures (playoff schedules), 'knows' and 'talks to'.

The examples "is greater than", "is at least as great as", and "is equal to" (equality) are transitive relations on various sets. As are the set of real numbers or the set of natural numbers:

whenever x > y and y > z, then also x > z

whenever x ≥ y and y ≥ z, then also x ≥ z

whenever x = y and y = z, then also x = z.

More examples of transitive relations:

• "is a subset of" (set inclusion, a relation on sets)
• "divides" (divisibility, a relation on natural numbers)
• "implies" (implication, symbolized by "⇒", a relation on propositions)

Examples of non-transitive relations:

• "is the successor of" (a relation on natural numbers)
• "is a member of the set" (symbolized as "∈")<ref>However, the class of von Neumann ordinals is constructed in a way such that ∈ is transitive when restricted to that class.</ref>
• "is perpendicular to" (a relation on lines in Euclidean geometry)

The empty relation on any set <math>X</math> is transitive<ref>Template:Harvnb</ref> because there are no elements <math>a,b,c \in X</math> such that <math>aRb</math> and <math>bRc</math>, and hence the transitivity condition is vacuously true. A relation Template:Math containing only one ordered pair is also transitive: if the ordered pair is of the form <math>(x, x)</math> for some <math>x \in X</math> the only such elements <math>a,b,c \in X</math> are <math>a=b=c=x</math>, and indeed in this case <math>aRc</math>, while if the ordered pair is not of the form <math>(x, x)</math> then there are no such elements <math>a,b,c \in X</math> and hence <math>R</math> is vacuously transitive.

Properties

Closure properties

• The converse (inverse) of a transitive relation is always transitive. For instance, knowing that "is a subset of" is transitive and "is a superset of" is its converse, one can conclude that the latter is transitive as well.
• The intersection of two transitive relations is always transitive.<ref>Template:Cite journal</ref> For instance, knowing that "was born before" and "has the same first name as" are transitive, one can conclude that "was born before and also has the same first name as" is also transitive.
• The union of two transitive relations need not be transitive. For instance, "was born before or has the same first name as" is not a transitive relation, since e.g. Herbert Hoover is related to Franklin D. Roosevelt, who is in turn related to Franklin Pierce, while Hoover is not related to Franklin Pierce.
• The complement of a transitive relation need not be transitive.<ref name="Derek.1964">Template:Cite journal</ref> For instance, while "equal to" is transitive, "not equal to" is only transitive on sets with at most one element.

Other properties

A transitive relation is asymmetric if and only if it is irreflexive.<ref>Template:Cite book Lemma 1.1 (iv). Note that this source refers to asymmetric relations as "strictly antisymmetric".</ref>

A transitive relation need not be reflexive. When it is, it is called a preorder. For example, on set X = {1,2,3}:

• R = {Template:Hair space(1,1), (2,2), (3,3), (1,3), (3,2)Template:Hair space} is reflexive, but not transitive, as the pair (1,2) is absent,
• R = {Template:Hair space(1,1), (2,2), (3,3), (1,3)Template:Hair space} is reflexive as well as transitive, so it is a preorder,
• R = {Template:Hair space(1,1), (2,2), (3,3)Template:Hair space} is reflexive as well as transitive, another preorder,
• R = {Template:Hair space(1,2), (2,3), (1,3)Template:Hair space} is transitive, but not reflexive.

As a counter example, the relation <math> < </math> on the real numbers is transitive, but not reflexive.

Transitive extensions and transitive closure

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Let Template:Mvar be a binary relation on set Template:Mvar. The transitive extension of Template:Mvar, denoted Template:Math, is the smallest binary relation on Template:Mvar such that Template:Math contains Template:Mvar, and if Template:Math and Template:Math then Template:Math.<ref>Template:Harvnb</ref> For example, suppose Template:Mvar is a set of towns, some of which are connected by roads. Let Template:Mvar be the relation on towns where Template:Math if there is a road directly linking town Template:Mvar and town Template:Mvar. This relation need not be transitive. The transitive extension of this relation can be defined by Template:Math if you can travel between towns Template:Mvar and Template:Mvar by using at most two roads.

If a relation is transitive then its transitive extension is itself, that is, if Template:Mvar is a transitive relation then Template:Math.

The transitive extension of Template:Math would be denoted by Template:Math, and continuing in this way, in general, the transitive extension of Template:Math would be Template:Math. The transitive closure of Template:Mvar, denoted by Template:Math or Template:Math is the set union of Template:Mvar, Template:Math, Template:Math, ... .<ref name=Liu112>Template:Harvnb</ref>

The transitive closure of a relation is a transitive relation.<ref name=Liu112 />

The relation "is the birth parent of" on a set of people is not a transitive relation. However, in biology the need often arises to consider birth parenthood over an arbitrary number of generations: the relation "is a birth ancestor of" is a transitive relation and it is the transitive closure of the relation "is the birth parent of".

For the example of towns and roads above, Template:Math provided you can travel between towns Template:Mvar and Template:Mvar using any number of roads.

Relation types that require transitivity

• Preorder – a reflexive and transitive relation
• Partial order – an antisymmetric preorder
• Total preorder – a connected (formerly called total) preorder
• Equivalence relation – a symmetric preorder
• Strict weak ordering – a strict partial order in which incomparability is an equivalence relation
• Total ordering – a connected (total), antisymmetric, and transitive relation

Counting transitive relations

No general formula that counts the number of transitive relations on a finite set (sequence A006905 in the OEIS) is known.<ref>Steven R. Finch, "Transitive relations, topologies and partial orders" Template:Webarchive, 2003.</ref> However, there is a formula for finding the number of relations that are simultaneously reflexive, symmetric, and transitive – in other words, equivalence relations – (sequence A000110 in the OEIS), those that are symmetric and transitive, those that are symmetric, transitive, and antisymmetric, and those that are total, transitive, and antisymmetric. Pfeiffer<ref>Götz Pfeiffer, "Counting Transitive Relations Template:Webarchive", Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.2.</ref> has made some progress in this direction, expressing relations with combinations of these properties in terms of each other, but still calculating any one is difficult. See also Brinkmann and McKay (2005).<ref>Gunnar Brinkmann and Brendan D. McKay,"Counting unlabelled topologies and transitive relations Template:Webarchive"</ref>

Since the reflexivization of any transitive relation is a preorder, the number of transitive relations an on n-element set is at most 2ⁿ time more than the number of preorders, thus it is asymptotically <math>2^{(1/4+o(1))n^2}</math> by results of Kleitman and Rothschild.<ref>Template:Citation</ref>

Related properties

File:Rock-paper-scissors.svg

The Rock–paper–scissors game is based on an intransitive and antitransitive relation "x beats y".

A relation R is called intransitive if it is not transitive, that is, if xRy and yRz, but not xRz, for some x, y, z. In contrast, a relation R is called antitransitive if xRy and yRz always implies that xRz does not hold. For example, the relation defined by xRy if xy is an even number is intransitive,<ref>since e.g. 3R4 and 4R5, but not 3R5</ref> but not antitransitive.<ref>since e.g. 2R3 and 3R4 and 2R4</ref> The relation defined by xRy if x is even and y is odd is both transitive and antitransitive.<ref>since xRy and yRz can never happen</ref> The relation defined by xRy if x is the successor number of y is both intransitive<ref>since e.g. 3R2 and 2R1, but not 3R1</ref> and antitransitive.<ref>since, more generally, xRy and yRz implies x=y+1=z+2≠z+1, i.e. not xRz, for all x, y, z</ref> Unexpected examples of intransitivity arise in situations such as political questions or group preferences.<ref>Template:Cite news</ref>

Generalized to stochastic versions (stochastic transitivity), the study of transitivity finds applications of in decision theory, psychometrics and utility models.<ref>Template:Cite journal</ref>

A quasitransitive relation is another generalization;<ref name="Derek.1964"/> it is required to be transitive only on its non-symmetric part. Such relations are used in social choice theory or microeconomics.<ref>Template:Cite journal</ref>

Proposition: If R is a univalent, then R;R^T is transitive.

proof: Suppose <math>x R;R^T y R;R^T z.</math> Then there are a and b such that <math>x R a R^T y R b R^T z .</math> Since R is univalent, yRb and aR^Ty imply a=b. Therefore xRaR^Tz, hence xR;R^Tz and R;R^T is transitive.

Corollary: If R is univalent, then R;R^T is an equivalence relation on the domain of R.

proof: R;R^T is symmetric and reflexive on its domain. With univalence of R, the transitive requirement for equivalence is fulfilled.

See also

• Transitive reduction
• Intransitive dice
• Rational choice theory
• Hypothetical syllogism — transitivity of the material conditional

References

• Template:Citation
• Template:Citation
• Gunther Schmidt, 2010. Relational Mathematics. Cambridge University Press, Template:Isbn.
• Template:Citation
• Pfeiffer, G. (2004). Counting transitive relations. Journal of Integer Sequences, 7(2), 3.

External links

• Template:Springer
• Transitivity in Action at cut-the-knot