Transitive relation

Version

v3 · 2026-09-28 · History

Prime #

1554

Domain group

Formal Sciences

Origin domain

Mathematics

Aliases

Transitivity

Core Idea

A transitive relation is the substrate-independent relational property R for which every composable pair aRb and bRc entails aRc over the declared carrier. The abstraction is not exhausted by its familiar source-domain notation. Its autonomous core is closure under two-step relational composition, distinct from symmetry, reflexivity, antisymmetry, numerical linearity, or empirical causal transmission.

The operative mechanism is this: Two relation instances share a middle element; relational composition produces the endpoint pair, and transitivity requires that composite pair already belong to the relation, making R composed with itself a subset of R. The mechanism separates identity from observation. A case does not qualify merely because an observer can describe it using the word transitive relation; the constitutive relation must be present in the carrier.

How would you explain it like I'm…

The Pass-Along Rule

If Mia is taller than Sam, and Sam is taller than Leo, then Mia is taller than Leo. 'Taller than' passes along like that. But not everything does: a friend of your friend isn't always your friend.

If A→B and B→C, Then A→C

A Transitive Relation is a kind of connection that carries through a middle step. 'Older than' is one: if Grandma is older than Mom and Mom is older than you, then Grandma is older than you. It has to work every time, for every three things you pick. 'Is a friend of' or 'beats in rock-paper-scissors' don't work that way — rock beats scissors, scissors beats paper, but rock doesn't beat paper.

Closure Under Chaining

A transitive relation is one where any two-step chain automatically gives you the direct link: whenever a is related to b and b is related to c, a must be related to c. 'Less than,' 'is a subset of,' 'is an ancestor of,' and 'is divisible by' all work this way. It has to hold for every possible trio in the set you're talking about, not just usually. Transitivity is a different property from symmetry (if a relates to b, then b relates to a) or reflexivity (everything relates to itself); a relation can have any mix of these. It also doesn't mean the things line up in a single line — 'is a subset of' is transitive even though many sets can't be compared at all. Sports results are a classic non-example: team A can beat B and B beat C, while C beats A.

 

A Transitive Relation is a binary relation R on a declared set such that for all a, b, c, if aRb and bRc then aRc. Equivalently, composing R with itself yields nothing outside R: R∘R ⊆ R. The mechanism is closure under two-step composition through a shared middle element. Examples: ≤ and < on numbers, set inclusion, divisibility, ancestry, logical implication. Non-examples: 'is a parent of,' 'is adjacent to,' and cyclic dominance relations like rock-paper-scissors or intransitive preference cycles. Transitivity is independent of symmetry, reflexivity, and antisymmetry — combinations of these define equivalence relations and partial orders — and it doesn't require numerical linearity. It also shouldn't be confused with empirical causal transmission: that A influences B and B influences C does not by itself guarantee a transitive 'causes' relation. The property is universal, so a single counterexample triple breaks it, and it holds only relative to a fixed relation and carrier.

Broad Use

order. The carrier is less-than or subset inclusion. The identity test is that two comparisons compose into a third. This is a literal instantiation rather than decorative analogy because the carrier, observable organization, conserved relation, variation class, and failure test retain the same roles. The domain accent is strict and nonstrict variants differ in reflexivity. A responsible analysis states scale, observation window, representation and noise model before claiming the structure, then distinguishes the structure itself from the process used to discover, stabilize or exploit it. Removing the constitutive relation must make the classification fail; otherwise the label is only topical resemblance.

Clarity

A clear Transitive relation claim can be rewritten as a testable sentence: on carrier C at scale S, relation R holds within tolerance T, remains under transformations V, and fails for counterexample K. This grammar exposes missing components and prevents a noun from standing in for an argument.

Manages Complexity

Transitive relation manages complexity by replacing an unstructured inventory with a small set of relations that survive relevant variation. Compression becomes legitimate when the retained relation supports reconstruction, comparison or reliable discrimination and the discarded details are declared incidental for the task.

The abstraction also supports chunking. Once an organized unit is established, reasoning can treat it as one object while retaining an audit trail to its elements.

Abstract Reasoning

1. Type the carrier and explain why its elements are individuated at the selected scale.
2. Separate the target structure from the notation, image, model or story used to display it.
3. State the constitutive relation as an equation, rule, repeatability condition or traceable interpretive criterion.
4. List transformations expected to preserve identity and justify why they are incidental.
5. Choose at least one positive diagnostic and one collapse test.

Knowledge Transfer

Transfer begins from the role graph, not the name. Preserve carrier, relation, invariant, admissible variation, diagnostic and collapse test; then substitute domain occupants. A successful mapping explains how the target case would be recognized and how it would fail.

The most common transfer error is feature substitution. One field may represent the structure visually, another algebraically and another behaviorally. The visible features are not the invariant. Transfer must identify the relation those features evidence and state the target domain's measurement or proof obligations.

Relationships to Other Abstractions

Current abstraction Transitive relation Prime

Parents (1) — outgoing typed relations

• Transitive relation is a kind of Relation Prime

  The accepted reference-grade review places Transitive relation under Relation because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.

Hierarchy path (1) — routes to 1 parentless root

• Transitive relation → is a kind of Relation