Equivalence Relations

Definition

An equivalence relation on a set S is a

set R of ordered pairs of elements of S
such that
Reflexive

(a,a) R foralla inS.

(a,b) R implies(b,a) R

Symmetric

(a,b) R and(b,c) R imply(a,c) R

Transitive

Properties of Equivalence
Relations
a

a
Reflexive

b
Symmetric

b
Transitive

a)

b)

c)

d)

e)

Which of these relations on {0, 1, 2, 3} are equivalence relations?

Determine the properties of an equivalence relation that the others
lack
{ (0,0), (1,1), (2,2), (3,3) }
Has all the properties, thus, is an equivalence relation
{ (0,0), (0,2), (2,0), (2,2), (2,3), (3,2), (3,3) }
Not reflexive: (1,1) is missing
Not transitive: (0,2) and (2,3) are in the relation, but not (0,3)
{ (0,0), (1,1), (1,2), (2,1), (2,2), (3,3) }
Has all the properties, thus, is an equivalence relation
{ (0,0), (1,1), (1,3), (2,2), (2,3), (3,1), (3,2) (3,3) }
Not transitive: (1,3) and (3,2) are in the relation, but not (1,2)
{ (0,0), (0,1) (0,2), (1,0), (1,1), (1,2), (2,0), (2,2), (3,3) }
Not symmetric: (1,2) is present, but not (2,1)
Not transitive: (2,0) and (0,1) are in the relation, but not (2,1)
4

Notation

Given a relation R, we usually write

a R b instead of (a,b) R
For example:
x = 1 instead of (x,1)
p q instead
of ( p,q)

Properties Revisited

R is an equivalence relation on S if R is:

Reflexive:
a R a for all a in S
Symmetric:
a R b implies b R a for all a, b in S
Transitive:
a R b and b R c implies a R c for all a,b,c
in S

Suppose that Z is a non-empty set, and f is a function that has Z

as its domain. Let R be the relation on Z consisting of all ordered
pairs (x,y) where f(x) = f(y),
Meaning that x and y are related if and only if f(x) = f(y)

Show that R is an equivalence relation on Z

a = a for all a in Z
a = b implies b = a for all a,b in Z
a = b and b = c implies a = c for all a,b,c,
in Z.
= is reflexive, symmetric, and transitive
So = is an equivalence relation on Z!

Is an equivalence relation on
the integers?

1 2, but 2 1, so is not symmetric

Hence, is not an equivalence relation
on Z.
(Note that is reflexive and transitive.)

Say a R b if 2 | a b

Consider the relation R = { (a,b) | a b (mod m) }

Remember that this means that m | a-b
Called congruence modulo m

Choose any integer a.

2 | 0 = a a, so a ~ a for all a.
(R is reflexive)
Choose any integers a, b with a R b.
2 | ab so ab = 2n for some integer n.
Then ba = 2(n), and 2 | ba.
Hence b R a. (R is symmetric)

A R b if 2 | a b (Con't)

Choose any integers a, b, c with a R and b R c.

Now 2 | ab and 2 | bc means that there exist
integers m and n such that
ab = 2m and bc = 2n.
ac = ab + bc = 2m + 2n = 2(m + n)
So 2 | ac. Hence a R c.
R is transitive.
Since R is reflexive, symmetric, and transitive
R is an equivalence relation on the integers.

Equivalence Classes

Let R be given by a R b if 2 | ab.

Let [n] be the set of all integers related
to n
Even
[0] = { -4, -2, 0, 2, 4 }
Odd
[1] = { -3, -1, 1, 3, 5 }
There are many different names for
these equivalence classes, but only two
distinct equivalence classes.

Partitions

Consider the relation R = { (a,b) | a mod 2 = b

mod 2 }
This splits the integers into two equivalence
classes: even numbers and odd numbers
Those two sets together form a partition of the
integers
Formally, a partition of a set S is a collection of
non-empty disjoint subsets of S whose union is S
In this example, the partition is { [0], [1] }

12

Or { {, -3, -1, 1, 3, }, {, -4, -2, 0, 2, 4, } }

Partition of a set

Let A be a set, then collection of all

subsets of A that are disjoint and their
union is full set then it is called partition
of a set.
Every equivalence relation R on a set S
partitions S into disjoint equivalence
classes.

Example

Let R be the equivalence relation on Z

defined by a R b a-b divisible by 5.
We define
0
1 etc
We denote it as set Z5