Math4190 Lecture-04-02 H

Lecture 4.
2: Equivalence relations and equivalence classes
Matthew Macauley
Department of Mathematical Sciences

Clemson University
http://www.math.clemson.edu/~macaule/
Math 4190, Discrete Mathematical Structures
M. Macauley (Clemson) Lecture 4.2: Equivalence relations & classes Discrete Mathematical Structures 1 / 11
Recall the basic concepts
Definition
An equivalence relation on a set A is a relation that is
(i) reflexive,
(ii) transitive,
(iii) symmetric.
We can always visualize a relation R on a finite set A with a directed graph (digraph):
the vertex set is A;
include a directed edge a → b if (a, b) ∈ R.
The digraph of an equivalence relation will be bidirected.
For convenience, we usually drop:
all arrow tips, so all edges are undirected;

all self-loops.
Equivalence classes
Definition
Given an equivalence relation R on A (write a ≡ b for (a, b) ∈ R), the equivalence class
containing a ∈ A is the set

[a] := b ∈ A | (a, b) ∈ R = b ∈ A | a ≡ b .
We denote the set of equivalence classes by A/R, or A/ ≡, and say “A modulo R.”
Example 1
Let A be the set of all people.
1. Say that two people are equivalent iff they were born in the same year.
2. Say that two people are equivalent iff they have the same last name.
Proposition
Let R be an equivalence relation on A.
(i) If b ∈ [a], then [a] = [b].
(ii) If b 6∈ [a], then [a] ∩ [b] = ∅.
In other words, the set of equivalence classes forms a partition of A.
Examples of equivalence classes
Example 2: isomorphic graphs
Let S be the following graphs, under the equivalence relation of isomorphism.
1 2 1 2 1 1
2 3
4 3 4 3 4 3 4 2
1 2 1 2 1 2 1 2
4 3 4 3 4 3 4 3
Figure: These 8 graphs fall into 6 equivalence classes.
Example 3: similar matrices

Let Mn (C) be the set of n × n matrices, where the equivalence is similarity.
The equivalence classes are the similarity classes.
Examples of equivalence classes
Example 4: equivalence relation from partitions
Let V be a finite set. Every undirected graph on V defines an equivalence relation, where
v ≡ w iff v and w lie on the same connected component.
Moreover, any arbitrary partition of V defines an equivalence relation.
Example 5: Bitstrings
Given a length-n Boolean vector x, its Hamming weight H(x) is the number of 1 bits in it.
Consider the equivalence on the set of length-3 Boolean vectors (or strings), where
x ≡y iff H(x) = H(y ).
The equivalence classes are the connected components in the graph below:
(1, 1, 1)
(1, 1, 0) (1, 0, 1) (0, 1, 1)
(1, 0, 0) (0, 1, 0) (0, 0, 1)
(0, 0, 0)
Example 6: Digital logic circuits
There are infinitely many possible digital logic circuits with n inputs.
n
However, there are only 22 Boolean functions with n inputs.
Declare two digital logic circuits to be equivalent iff they give the same output on all inputs.
P not
and P
R or not R
Q
Q not
Figure: Two equivalent digital circuits
Example 7: Modular arithmetic
Let A = Z, and fix n > 1.
Say that a ≡ b iff n | (a − b). We say that a and b are equivalent modulo n, and write
a≡b (mod n), or a ≡n b.
This equivalence relation is sometimes called congruence modulo n.
Proposition
Let a, b, c ∈ N, n > 1 and suppose that a ≡ b (mod n). Then
1. a + c ≡ b + c (mod n),
2. ac ≡ bc (mod n),
3. ac ≡ b c (mod n).
Corollary
Reducing modulo n can be done before or after doing arithmetic, i.e.,
1. (a + b) (mod n) ≡ a (mod n) + b (mod n),
2. (ab) (mod n) ≡ (a (mod n))(b (mod n)).
We say that addition and multiplication is well-defined with respect to ≡n .
Example 7: Modular arithmetic
Let n = 12. The equivalence classes of Z modulo n are
[0] = {. . . , −36, −24, −12, 0, 12, 24, 36, . . . }

[1] = {. . . , −35, −23, −11, 1, 13, 25, 37, . . . }
[2] = {. . . , −34, −22, −10, 2, 14, 26, 38, . . . }
..
.
[11] = {. . . , −25, −13, −1, 11, 23, 35, 47, . . . }
The fact that addition and multiplication is well-defined with respect to ≡n means that it
does not depend on choice of representative, i.e.,
if [a] = [b] and [c] = [d], then [a + c] = [b + d] and [ac] = [bd].
Equivalently,
if a ≡n b and c ≡n d, then (a + c) ≡n (b + d) and ac ≡n bd.
Example 8: the rational numbers
“God created the integers; all else is the work of man.”
. –Leopold Kronecker (1880s)
Let A = Z × (Z \ {0}). Define a relation on A by

(a, b) ∼ (c, d) ⇔ ad = bc.
We need to check that ∼ is:
(i) Reflexive: (a, b) ∼ (a, b),
(ii) Symmetric: (a, b) ∼ (c, d) ⇒ (c, d) ∼ (a, b),
(iii) Transitive: (a, b) ∼ (c, d) and (c, d) ∼ (e, f ) ⇒ (a, b) ∼ (e, f ).
[We need the cancellation law in Z: if ab = ac and a 6= 0, then b = c.]
The equivalence class containing (a, b), denoted a/b or ba , is

a

b
:= (a, b) = (p, q) | (a, b) ∼ (p, q) .
Definition
We can define addition and multiplication of equivalence classes as follows:
a c ad+bc
(i) b
+ d
= bd
,
a c ac
(ii) b
· d
= bd
.
Example 8: the rational numbers
Exercise
Check that addition and multiplication of equivalence classes, defined as
a c ad+bc
(i) b
+ d
= bd
,
a c ac
(ii) b
· d
= bd
,
is well-defined.
This means checking that if [(a, b)] = [(c, d)] and [(p, q)] = [(r , s)], then
1. [(a, b)] + [(p, q)] = [(c, d)] + [(r , s)],
2. [(a, b)] · [(p, q)] = [(c, d)] · [(r , s)].

Math4190 Lecture-04-02 H

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Math4190 Lecture-04-02 H

Uploaded by

Copyright:

Available Formats

Lecture 4.

2: Equivalence relations and equivalence classes

Department of Mathematical Sciences

Math 4190, Discrete Mathematical Structures

The digraph of an equivalence relation will be bidirected.

For convenience, we usually drop:

all arrow tips, so all edges are undirected;

Figure: These 8 graphs fall into 6 equivalence classes.

Example 3: similar matrices

x ≡y iff H(x) = H(y ).

(1, 1, 0) (1, 0, 1) (0, 1, 1)

(1, 0, 0) (0, 1, 0) (0, 0, 1)

Figure: Two equivalent digital circuits

a≡b (mod n), or a ≡n b.

This equivalence relation is sometimes called congruence modulo n.

We say that addition and multiplication is well-defined with respect to ≡n .

[0] = {. . . , −36, −24, −12, 0, 12, 24, 36, . . . }

if [a] = [b] and [c] = [d], then [a + c] = [b + d] and [ac] = [bd].

if a ≡n b and c ≡n d, then (a + c) ≡n (b + d) and ac ≡n bd.

Let A = Z × (Z \ {0}). Define a relation on A by

[We need the cancellation law in Z: if ab = ac and a 6= 0, then b = c.]

The equivalence class containing (a, b), denoted a/b or ba , is

1. [(a, b)] + [(p, q)] = [(c, d)] + [(r , s)],

2. [(a, b)] · [(p, q)] = [(c, d)] · [(r , s)].

You might also like