# Category:Transitive Closures

This category contains results about Transitive Closures in the context of Relation Theory.

### Definition 1

Let $\mathcal R$ be a relation on a set $S$.

The **transitive closure** of $\mathcal R$ is defined as the smallest transitive relation on $S$ which contains $\mathcal R$ as a subset.

### Definition 2

Let $\mathcal R$ be a relation on a set $S$.

The **transitive closure** of $\mathcal R$ is defined as the intersection of all transitive relations on $S$ which contain $\mathcal R$.

### Definition 3

Let $\mathcal R$ be a relation on a set or class $S$.

The **transitive closure** of $\mathcal R$ is the relation $\mathcal R^+$ defined as follows:

For $x, y \in S$, $x \mathrel {\mathcal R^+} y$ if and only if for some $n \in \N_{>0}$ there exist $s_0, s_1, \dots, s_n \in S$ such that $s_0 = x$, $s_n = y$, and:

\(\displaystyle s_0\) | \(\mathcal R\) | \(\displaystyle s_1\) | |||||||||||

\(\displaystyle s_1\) | \(\mathcal R\) | \(\displaystyle s_2\) | |||||||||||

\(\displaystyle \) | \(\vdots\) | \(\displaystyle \) | |||||||||||

\(\displaystyle s_{n - 1}\) | \(\mathcal R\) | \(\displaystyle s_n\) |

### Definition 4

Let $\mathcal R$ be a relation on a set $S$.

Let:

- $\mathcal R^n := \begin{cases} \mathcal R & : n = 0 \\ \mathcal R^{n-1} \circ \mathcal R & : n > 0 \end{cases}$

where $\circ$ denotes composition of relations.

Finally, let:

- $\displaystyle \mathcal R^+ = \bigcup_{i \mathop \in \N} \mathcal R^i$

Then $\mathcal R^+$ is called the **transitive closure** of $\mathcal R$.

## Subcategories

This category has only the following subcategory.

## Pages in category "Transitive Closures"

The following 11 pages are in this category, out of 11 total.

### E

### T

- Transitive Closure Always Exists (Relation Theory)
- Transitive Closure Always Exists (Relation Theory)/Proof 1
- Transitive Closure Always Exists (Relation Theory)/Proof 2
- Transitive Closure is Closure Operator
- Transitive Closure of Reflexive Relation is Reflexive
- Transitive Closure of Reflexive Symmetric Relation is Equivalence
- Transitive Closure of Set-Like Relation is Set-Like
- Transitive Closure of Symmetric Relation is Symmetric