Skip to content

Relations#

Definition: Relation

A relation \(R \subseteq A \times B\) between two sets \(A\) and \(B\) is any subset of the Cartesian product \(A\times B\).

Notation

For any \(a \in A\) and any \(b \in B\), if \((a;b) \in R\), then we write

\[ a\,\, R\,\, b \]

Intuition

The statement \(a \,\, R\,\, b\) translates to "there is a relationship between \(a\) and \(b\) which is expressed by \(R\)".

Example

Let \(R \subseteq \mathbb{N} \times \mathbb{N}\) be the relation

\[ R = \{(a;b)\mid a,b \in \mathbb{N} \text{ and } b \text{ is a divisor of a} \} \]

For any \(x,y \in \mathbb{N}\), the statement \(x\,\, R\,\, y\) means that \((x,y) \in R\) which in this case translates to "\(y\) is a divisor of \(b\)".

Definition: Reflexive Relation

A relation \(R \subseteq A \times A\) is reflexive iff

\[ x\,\, R\,\, x \]

is true for all \(x\in A\).

Definition: Irreflexive Relation

A relation \(R \subseteq A \times A\) is irreflexive if there is no \(x \in A\) such that

\[ x\,\, R\,\, x \]

Note

Irreflexive relations are also called anti-reflexive or aliorelative.

Definition: Right-Unique Relation

A relation \(R\subseteq A\times B\) is right-unique, if for all \(a \in A\) and all \(b_1, b_2 \in B\)

\[ ((a\,\, R\,\, b_1)\land(a\,\, R\,\, b_1)) \implies b_1 = b_2 \]

Definition: Symmetric Relation

A relation \(R \subseteq A \times A\) is symmetric if

\[ x\,\, R\,\, y \implies y\,\, R\,\, x \]

for all \(x,y \in A\).

Definition: Asymmetric Relation

A relation \(R \subseteq A \times A\) is asymmetric if

\[ ((x\,\, R\,\, y) \land (y\,\, R \,\, x)) \implies x=y \]

for all \(x,y, \in A\)

Definition: Transitivity

A relation \(R \subseteq A \times A\) is transitive iff

\[ ((x\,\, R\,\, y) \land (y\,\, R \,\, z)) \implies x\,\, R \,\, z \]

for all \(x,y,z \in A\).

Definition: Equivalence Relation

An equivalence relation on a set \(A\) is any relation \(R \subseteq A \times A\) which is reflexive, transitive and symmetric.

Notation

Equivalence relations are usually denoted with \(\sim\) instead of \(R\).

Intuition

The statement \(x\sim y\) means that \(x\) is equal to \(y\) in the sense of \(\sim\).

Definition: Equivalence Class

Let \(A\) be a set with an equivalence relation \(\sim\).

The equivalence class of an element \(a \in A\) formed by \(\sim\) is the set of all \(x \in A\) such that \(x \sim a\).

\[ \{x\in A\mid a\sim x\} \]

Notation

\[ [a]_\sim \]