What Is A Transitive Relation?
A transitive relation is a relation on a set where, whenever one element is related to a second and that second is related to a third, the first is automatically related to the third. The property is about chains: two links in a row guarantee the shortcut link across them.
Relations are usually written with ordered pairs. If $R$ is a relation on a set $A$ and $(a, b) \in R$ means "$a$ is related to $b$," then the transitive condition is short to state.
$$(a, b) \in R \ \text{ and } \ (b, c) \in R \ \Rightarrow \ (a, c) \in R$$
Read it as a promise. Every time you can walk from $a$ to $b$ and then from $b$ to $c$, the pair $(a, c)$ has to be in the relation as well. If even one such shortcut is missing, the relation is not transitive. For the wider family this belongs to, see relations in math.
What Is The Condition For A Relation To Be Transitive?
The transitive property has one condition, and it only ever involves three elements at a time: a first, a middle, and a last. You never check four steps at once. You check every pair of links that share a middle element.
Here is the test in words. Find any two pairs in the relation where the second entry of the first pair equals the first entry of the second pair. That shared value is the middle. The relation passes only if the "outer" pair, first entry to last entry, is also present.
The condition says nothing about pairs that do not chain. If no two pairs share a middle element, there is nothing to check, and the relation counts as transitive by default. That default case has a name, and it trips people up, so it gets its own treatment further down.
What Are Some Examples Of Transitive Relations?
Most of the relations you already trust are transitive. The clearest ones come from comparing numbers and from family structure.
Equality. If $a = b$ and $b = c$, then $a = c$. The equals sign is the original transitive relation.
Less than. If $a < b$ and $b < c$, then $a < c$. The same holds for $\le$, $>$, and $\ge$.
Divisibility. If $a$ divides $b$ and $b$ divides $c$, then $a$ divides $c$. For example, $2 \mid 6$ and $6 \mid 12$, and indeed $2 \mid 12$.
"Is an ancestor of." If Ravi is an ancestor of Priya and Priya is an ancestor of Meena, then Ravi is an ancestor of Meena.
Subset. If $X \subseteq Y$ and $Y \subseteq Z$, then $X \subseteq Z$, a fact you meet again with sets.
Notice the shared shape. In each case the relation describes a direction that keeps going the same way when you extend the chain, so the shortcut always exists.
Which Relations Are Not Transitive?
A relation fails transitivity as soon as one chain does not close. Everyday relationships break the pattern more often than mathematical ones.
"Is a friend of." Ana may be friends with Ben and Ben friends with Cara, yet Ana and Cara might never have met.
"Is the mother of." If Sara is the mother of Tara and Tara is the mother of Uma, Sara is not the mother of Uma. She is the grandmother, which is a different relation.
"Is perpendicular to." If line $m$ is perpendicular to line $p$ and $p$ is perpendicular to line $n$, then $m$ and $n$ are parallel, not perpendicular.
Each failure is a chain that runs off in a new direction at the second step. One broken chain is enough, so a single counterexample settles the question.
How Do You Check If A Relation Is Transitive From Its Ordered Pairs?
To check transitivity from a set of ordered pairs, test every two-step chain and confirm its closing pair is present. Work through it in order, one chain at a time, and stop the moment a closing pair is missing.
Take the set $A = {1, 2, 3, 4}$ with the relation below, written as ordered pairs.
$$R = {(1, 2), (2, 3), (1, 3), (3, 4)}$$
Two moves settle it:
Find the two-step chains, the cases where one pair ends on the value another pair starts with.
For each chain, write down the closing pair it demands, then look for that pair in $R$.
Table: Checking every two-step chain in $R$ for its closing pair.
Two-Step Chain | Closing Pair Needed | Present In $R$? |
|---|---|---|
$(1, 2)$ then $(2, 3)$ | $(1, 3)$ | Yes |
$(2, 3)$ then $(3, 4)$ | $(2, 4)$ | No |
$(1, 3)$ then $(3, 4)$ | $(1, 4)$ | No |
The first chain closes, but the second needs $(2, 4)$ and it is absent, so $R$ is not transitive. One missing pair is the whole verdict. To repair this relation you would add $(2, 4)$ and $(1, 4)$, then re-check, because new pairs can create new chains.
A directed graph makes the same check visual: draw an arrow for every pair, then look for any two arrows that meet head-to-tail without a third arrow jumping straight across.
Where Does Transitivity Sit Among Reflexive, Symmetric, And Transitive?
Transitivity is one of three properties a relation can have, and the three are usually studied together because their combination defines something important. The other two are the reflexive property and the symmetric property.
Table: The three properties that combine into an equivalence relation.
Property | Condition On $R$ | Plain-Language Meaning |
|---|---|---|
Reflexive | $(a, a) \in R$ for every $a$ | Every element relates to itself |
Symmetric | $(a, b) \in R$ forces $(b, a) \in R$ | The relation works both ways |
Transitive | $(a, b)$ and $(b, c) \in R$ force $(a, c) \in R$ | Two-step chains collapse to one step |
When a relation has all three properties at once, it is called an equivalence relation, and it sorts a set into clean groups where everything in a group is treated as the same. Equality is the model example. A relation that is reflexive, transitive, and never doubles back, such as $\le$, is a partial order instead, the structure behind ranking and sorting.
Transitivity also behaves well under reversal. The inverse relation of a transitive relation, formed by flipping every pair, is transitive too. For the full menu of ways a relation can behave, see types of relations.
Why Does The Transitive Property Matter?
Transitivity is the property that lets you reason in chains. Without it, knowing a handful of direct links would tell you nothing about the links those steps imply, and most of mathematics would grind to a halt.
Ordering needs it. Arranging things from smallest to largest relies on "less than" being transitive. If it were not, a sorted list could contradict itself.
Inference needs it. From "Ravi is an ancestor of Priya" and "Priya is an ancestor of Meena," transitivity is what lets you conclude the third fact without redrawing the whole family tree.
Equivalence needs it. Grouping objects that share a trait, such as the same remainder or the same shape, only holds together because "same as" chains from one member to the next.
Each use is the same idea wearing different clothes. Transitivity turns a short list of direct links into every link those steps imply, which is why it sits at the center of ordering, classification, and logical proof.
Who Discovered The Transitive Property?
People trusted transitivity long before they named it. The rule that equal things stay equal down a chain was written as a self-evident truth in ancient geometry by Euclid, and it took two more thousand-year stretches before mathematicians studied relations as objects in their own right.
Two nineteenth-century logicians turned that quiet assumption into a studied object.
Augustus De Morgan (1806–1871, born in India, worked in England) pushed logic past simple syllogisms and opened the formal study of the logic of relations, the branch where transitivity became a defined property.
Charles Sanders Peirce (1839–1914, United States) built on De Morgan and developed the logic of relatives, giving relations, transitive ones included, a full algebraic treatment.
Where Are Transitive Relations Used In The Real World?
Transitivity is quietly at work whenever a computer or a person reasons through a chain of steps.
Sorting and ranking: every sorting algorithm assumes "comes before" is transitive, which is how it can order a list without comparing every possible pair.
Family trees and genealogy software: "is an ancestor of" is transitive, so a database can return all of someone's ancestors from a few parent-child records.
Build systems and scheduling: "must run before" is transitive, letting a tool work out a complete task order from a handful of direct dependencies.
Database design: dependencies between columns can be transitive, and designers use that fact to spot and remove redundant data.
Classification: "is a kind of" is transitive, so if a robin is a bird and a bird is an animal, a robin is an animal.
The same three-step logic runs a code compiler, a family-history site, and a biology textbook, which is what makes transitivity worth naming once and reusing everywhere.
What Are The Most Common Transitive Relation Mistakes?
These three errors account for most lost marks on relations questions, and each one has a clean fix.
Declaring A Relation Transitive After Checking Too Few Pairs.
Where it slips in:
A learner finds one chain that closes, feels satisfied, and calls the whole relation transitive.
Don't do this:
Do not conclude from a single successful chain. Transitivity is an "every chain" property, not an "at least one chain" property.
The correct way:
List every two-step chain and confirm each closing pair, the way the table above does. The relation is transitive only if not one closing pair is missing.
Confusing Transitivity With Symmetry.
Where it slips in:
A learner sees $(a, b)$ and reaches for $(b, a)$, treating transitivity as if it were about reversing a pair.
Don't do this:
Do not flip a pair and call it transitivity. Reversing $(a, b)$ into $(b, a)$ is the symmetric property, a different rule.
The correct way:
Chain, do not reverse. Transitivity joins $(a, b)$ and $(b, c)$ to demand $(a, c)$, moving forward through a middle element rather than turning a single pair around.
Missing A Required Closing Pair, Or Forgetting Vacuous Transitivity.
Where it slips in:
A learner overlooks one closing pair in a long relation, or wrongly labels a chain-free relation non-transitive because "nothing connects."
Don't do this:
Do not skip a chain, and do not demand closing pairs when no two-step chain exists in the first place.
The correct way:
Check each chain carefully. When a relation has no two pairs that share a middle element, there is nothing that could fail, so it is vacuously transitive, transitive by default.
Practice Problems On Transitive Relations
Work each one by testing every two-step chain. Answers follow each problem.
On ${1, 2, 3}$, is $R = {(1, 2), (2, 3), (1, 3)}$ transitive?
(Answer: Yes. The only chain, $(1,2)$ then $(2,3)$, closes with $(1,3)$, which is present.)On ${1, 2, 3}$, is $R = {(1, 2), (2, 3)}$ transitive?
(Answer: No. The chain needs $(1, 3)$, which is missing. Adding $(1, 3)$ fixes it.)Which single pair makes $R = {(2, 4), (4, 5)}$ transitive on ${2, 4, 5}$?
(Answer: Add $(2, 5)$.)Is the relation $\le$ on the real numbers transitive?
(Answer: Yes. If $a \le b$ and $b \le c$, then $a \le c$.)Is "is perpendicular to" on the set of lines transitive?
(Answer: No. Two lines perpendicular to the same line are parallel to each other.)On ${1, 2, 3}$, is $R = {(1, 1)}$ transitive?
(Answer: Yes, vacuously. The only possible chain, $(1,1)$ then $(1,1)$, closes with $(1,1)$.)
Where Should You Go Next After Transitive Relations?
Transitivity is one piece of a larger map, and a few natural next stops build straight on it.
Types Of Relations. See how transitive sits beside reflexive, symmetric, and the other ways a relation can behave.
Relations And Functions. Move from relations in general to the special ones that qualify as functions.
Inverse Relation. Reversing every pair of a transitive relation keeps it transitive, and this is where reversing a relation is defined.
If your child is building these ideas for the first time, a live Bhanzu trainer teaches relations starting from the intuition behind each property in the Bhanzu algebra program.
Was this article helpful?
Your feedback helps us write better content