A binary relation ~ on a set S is transitive if, for all a, b, and c in S, whenever a ~ b and b ~ c then a ~ c. Seeequivalence relation, partial order.
Computer
A relation R defined on a set S and having the property that, for all x, y, and z in S,
The relations ‘is less than’ defined on integers, and ‘is subset of’ defined on sets are transitive.
Economics
A relation, denoted by R, such that A R B and B R C imply A R C. The relations of equality, denoted =, and greater than, denoted >, are transitive. The transitivity of the relation ‘at least as good as’ is usually adopted as an axiom of consumer theory.