Transitive relation

Transitive binary relations
Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric Total, Semiconnex Anti- reflexive Equivalence relation Y ✗ ✗ ✗ ✗ ✗ Y ✗ ✗ Preorder (Quasiorder) ✗ ✗ ✗ ✗ ✗ ✗ Y ✗ ✗ Partial order ✗ Y ✗ ✗ ✗ ✗ Y ✗ ✗ Total preorder ✗ ✗ Y ✗ ✗ ✗ Y ✗ ✗ Total order ✗ Y Y ✗ ✗ ✗ Y ✗ ✗ Prewellordering ✗ ✗ Y Y ✗ ✗ Y ✗ ✗ Well-quasi-ordering ✗ ✗ ✗ Y ✗ ✗ Y ✗ ✗ Well-ordering ✗ Y Y Y ✗ ✗ Y ✗ ✗ Lattice ✗ Y ✗ ✗ Y Y Y ✗ ✗ Join-semilattice ✗ Y ✗ ✗ Y ✗ Y ✗ ✗ Meet-semilattice ✗ Y ✗ ✗ ✗ Y Y ✗ ✗ Strict partial order ✗ Y ✗ ✗ ✗ ✗ ✗ Y Y Strict weak order ✗ Y ✗ ✗ ✗ ✗ ✗ Y Y Strict total order ✗ Y Y ✗ ✗ ✗ ✗ Y Y Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric Definitions, for all ${\displaystyle a,b}$ and ${\displaystyle S\neq \varnothing$ :} ${\displaystyle {\begin{aligned}&aRb\\\Rightarrow {}&bRa\end{aligned}}}$ ${\displaystyle {\begin{aligned}aRb{\text{ and }}&bRa\\\Rightarrow a={}&b\end{aligned}}}$ ${\displaystyle {\begin{aligned}a\neq {}&b\Rightarrow \\aRb{\text{ or }}&bRa\end{aligned}}}$ ${\displaystyle {\begin{aligned}\min S\\{\text{exists}}\end{aligned}}}$ ${\displaystyle {\begin{aligned}a\vee b\\{\text{exists}}\end{aligned}}}$ ${\displaystyle {\begin{aligned}a\wedge b\\{\text{exists}}\end{aligned}}}$ ${\displaystyle aRa}$ ${\displaystyle {\text{not }}aRa}$ ${\displaystyle {\begin{aligned}aRb\Rightarrow \\{\text{not }}bRa\end{aligned}}}$
Y indicates that the column's property is always true the row's term (at the very left), while ✗ indicates that the property is not guaranteed in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric, is indicated by Y in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively. All definitions tacitly require the homogeneous relation ${\displaystyle R}$ be transitive: for all ${\displaystyle a,b,c,}$ if ${\displaystyle aRb}$ and ${\displaystyle bRc}$ then ${\displaystyle aRc.}$ A term's definition may require additional properties that are not listed in this table.

A homogeneous relation R on the set X is a transitive relation if,[1]

for all a, b, c ∈ X, if a R b and b R c, then a R c.

Or in terms of first-order logic:

${\displaystyle \forall a,b,c\in X:(aRb\wedge bRc)\Rightarrow aRc}$,

where a R b is the infix notation for (a, b) ∈ R.

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, too, is an ancestor of Carrie.

On the other hand, "is the birth parent of" is not a transitive relation, because if Alice is the birth parent of Brenda, and Brenda is the birth parent of Claire, then this does not imply that Alice is the birth parent of Claire. What is more, it is antitransitive: Alice can never be the birth parent of Claire.

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

"Is greater than", "is at least as great as", and "is equal to" (equality) are transitive relations on various sets, for instance, 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 "∈")[2]
• "is perpendicular to" (a relation on lines in Euclidean geometry)

The empty relation on any set ${\displaystyle X}$ is transitive[3][4] because there are no elements ${\displaystyle a,b,c\in X}$ such that ${\displaystyle aRb}$ and ${\displaystyle bRc}$, and hence the transitivity condition is vacuously true. A relation R containing only one ordered pair is also transitive: if the ordered pair is of the form ${\displaystyle (x,x)}$ for some ${\displaystyle x\in X}$ the only such elements ${\displaystyle a,b,c\in X}$ are ${\displaystyle a=b=c=x}$, and indeed in this case ${\displaystyle aRc}$, while if the ordered pair is not of the form ${\displaystyle (x,x)}$ then there are no such elements ${\displaystyle a,b,c\in X}$ and hence ${\displaystyle R}$ is vacuously transitive.

Let R be a binary relation on set X. The transitive extension of R, denoted R₁, is the smallest binary relation on X such that R₁ contains R, and if (a, b) ∈ R and (b, c) ∈ R then (a, c) ∈ R₁.[8] For example, suppose X is a set of towns, some of which are connected by roads. Let R be the relation on towns where (A, B) ∈ R if there is a road directly linking town A and town B. This relation need not be transitive. The transitive extension of this relation can be defined by (A, C) ∈ R₁ if you can travel between towns A and C by using at most two roads.

If a relation is transitive then its transitive extension is itself, that is, if R is a transitive relation then R₁ = R.

The transitive extension of R₁ would be denoted by R₂, and continuing in this way, in general, the transitive extension of R_i would be R_{i + 1}. The transitive closure of R, denoted by R* or R^∞ is the set union of R, R₁, R₂, ... .[9]

The transitive closure of a relation is a transitive relation.[9]

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, (A, C) ∈ R* provided you can travel between towns A and C using any number of roads.

• 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

No general formula that counts the number of transitive relations on a finite set (sequence A006905 in the OEIS) is known.[10] 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[11] 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).[12] Mala showed that no polynomial with integer coefficients can represent a formula for the number of transitive relations on a set,[13] and found certain recursive relations that provide lower bounds for that number. He also showed that that number is a polynomial of degree two if the set contains exactly two ordered pairs.[14]

Note that S(n, k) refers to Stirling numbers of the second kind.

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,[15] but not antitransitive.[16] The relation defined by xRy if x is even and y is odd is both transitive and antitransitive.[17] The relation defined by xRy if x is the successor number of y is both intransitive[18] and antitransitive.[19] Unexpected examples of intransitivity arise in situations such as political questions or group preferences.[20]

Generalized to stochastic versions (stochastic transitivity), the study of transitivity finds applications of in decision theory, psychometrics and utility models.[21]

A quasitransitive relation is another generalization;[6] it is required to be transitive only on its non-symmetric part. Such relations are used in social choice theory or microeconomics.[22]

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

proof: Suppose ${\displaystyle xR;R^{T}yR;R^{T}z.}$ Then there are a and b such that ${\displaystyle xRaR^{T}yRbR^{T}z.}$ 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.

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

• Grimaldi, Ralph P. (1994), Discrete and Combinatorial Mathematics (3rd ed.), Addison-Wesley, ISBN 0-201-19912-2
• Liu, C.L. (1985), Elements of Discrete Mathematics, McGraw-Hill, ISBN 0-07-038133-X
• Gunther Schmidt, 2010. Relational Mathematics. Cambridge University Press, ISBN 978-0-521-76268-7.
• Smith, Douglas; Eggen, Maurice; St. Andre, Richard (2006), A Transition to Advanced Mathematics (6th ed.), Brooks/Cole, ISBN 978-0-534-39900-9
• Pfeiffer, G. (2004). Counting transitive relations. Journal of Integer Sequences, 7(2), 3.

• "Transitivity", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• Transitivity in Action at cut-the-knot