8.2 Reflexivity, Symmetry, and Transitivity

Definition

Let R by a relation a set A.

  1. R is reflexive if and only if, for every x ∈ A, x R x.
  2. R is symmetric if and only if, for every x, y ∈ A, if x R y then y R x.
  3. R is transitive if and only if, for every x, y, z ∈ A, if x R y and y R z then x R z.

Alternatively

  1. R is reflexive ↔ for every x in A, (x, x) ∈ R
  2. R is symmetric ↔ for every x, y in A, if (x, y) ∈ R then (y, x) ∈ R
  3. R is transitive ↔ for every x, y, z in A, if (x, y) ∈ R and (y, z) ∈ R then (x, z) ∈ R

Examples

Definition: Transitive Closure

Let A be a set and R a relation on A. The transitive closure of R is the relation Rt on A that satisfies the following properties:

  1. Rt is transitive
  2. R ⊆ Rt
  3. If S is any other transitive relation that contains R, then Rt ⊆ S

In Class Exercises