Study Notes 2 | Relations

Definition: A relation on a nonempty set A is a nonempty set R of ordered pair ( x, y ) of elements

where x and y are elements of A.

Definition: Let A & B be sets. A relation between A and B is any subset R of the Cartesian product
A × B. Remember that A × B does not have to be equal to B × A.

Definition: A relation R on a set A is an equivalence relation if the following conditions are satisfied
for any x, y, and z in A.

Reflexive: xRx is true ∀ x ∈ A

Symmetric: If xRy, then yRx
Transitive: If xRy & yRz, then xRz

Example: Is a relation xRy iff xy is greater than or equal to zero an equivalence relation in Z?

1) Since x ⋅ x =x 2 ≥ 0 ∀ x ∈ Z , it is reflexive

2) Since xy ≥ 0 ⇒ yx ≥ 0 ∀ x, y in Z , it is symmetric

3) Not transitive. We only need to find one conterexample.

− 2 R0 & 0 R 4, but − 2 is not related to 4.

Definition: A partition of a set S is a collection of nonempty disjoint subsets of S whose union is S.

Example: {0} , {... − 3, −2, −1} , & {1, 2,3...} constitutes a partition of the integers.