0% found this document useful (0 votes)
235 views62 pages

Lecture 1718 Relation

R2 - R1 = {(1,v)}

Uploaded by

Samrat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
235 views62 pages

Lecture 1718 Relation

R2 - R1 = {(1,v)}

Uploaded by

Samrat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 62

Relation

Lecture 17-18

1
Cartesian product (review)

Let
A={a1, a2, ..ak} and
B={b1,b2,..bm}.

The Cartesian product A x B is defined by a set of ordered


pairs
{(a1 , b1), (a1, b2), … (a1, bm), …, (ak,bm)}.

Cartesian product defines a product set, or a set of all


ordered arrangements of elements in sets in the Cartesian
product.
2
Binary relation
Definition: Let A and B be two sets. A binary relation
from A to B is a subset of a Cartesian product A x B.

• Let R  A  B means R is a set of ordered pairs of the


form (a,b) where a ϵ A and b ϵ B.

• We use the notation a R b to denote (a,b) ϵ R and a R b


to denote (a,b) ϵ R. If a R b, we say a is related to b by
R.

Example: Let A={a,b,c} and B={1,2,3}.

• Is R={(a,1),(b,2),(c,2)} a relation from A to B?


3
Binary relation
Definition: Let A and B be two sets. A binary relation
from A to B is a subset of a Cartesian product A x B.

• Let R  A  B means R is a set of ordered pairs of the


form (a,b) where a ϵ A and b ϵ B.

• We use the notation a R b to denote (a,b) ϵ R and a R b


to denote (a,b) ϵ R. If a R b, we say a is related to b by
R.

Example: Let A={a,b,c} and B={1,2,3}.

• Is R={(a,1),(b,2),(c,2)} a relation from A to B? Yes.


• Is Q={(1,a),(2,b)} a relation from A to B? 4
Binary relation
Definition: Let A and B be two sets. A binary relation
from A to B is a subset of a Cartesian product A x B.

• Let R  A  B means R is a set of ordered pairs of the


form (a,b) where a ϵ A and b ϵ B.

• We use the notation a R b to denote (a,b) ϵ R and a R b


to denote (a,b) ϵ R. If a R b, we say a is related to b by
R.

Example: Let A={a,b,c} and B={1,2,3}.


• Is R={(a,1),(b,2),(c,2)} a relation from A to B? Yes.
• Is Q={(1,a),(2,b)} a relation from A to B? No.
• Is P={(a,a),(b,c),(b,a)} a relation from A to A? 5
Binary relation
Definition: Let A and B be two sets. A binary relation
from A to B is a subset of a Cartesian product A x B.

• Let R  A  B means R is a set of ordered pairs of the


form (a,b) where a ϵ A and b ϵ B.

• We use the notation a R b to denote (a,b) ϵ R and a R b


to denote (a,b) ϵ R. If a R b, we say a is related to b by
R.

Example: Let A={a,b,c} and B={1,2,3}.


• Is R={(a,1),(b,2),(c,2)} a relation from A to B? Yes.
• Is Q={(1,a),(2,b)} a relation from A to B? No.
• Is P={(a,a),(b,c),(b,a)} a relation from A to A? Yes 6
Representing Binary relation
We can graphically represent a binary relation R as follows:
• if a R b then draw an arrow from a to b.

a→b

Example:
• Let A = {0, 1, 2}, B = {u,v} and

R = { (0,u), (0,v), (1,v), (2,u) }


• Note: R  A  B u v
• Graph: 2 Table
0 x x
1 x
0 u
2 x
7
1 V
Reflexive Relation
Definition (reflexive relation) : A relation R on a set A is
called reflexive if (a,a) ϵ R for every element a ϵ A.

Example 1:

• Assume relation Rdiv ={(a b), if a |b} on A = {1,2,3,4}

Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}

• Is Rdiv reflexive?

8
Reflexive Relation
Definition (reflexive relation) : A relation R on a set A is
called reflexive if (a,a) ϵ R for every element a ϵ A.

Example 1:

• Assume relation Rdiv ={(a b), if a |b} on A = {1,2,3,4}

Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}

• Is Rdiv reflexive?

• Answer: Yes. (1,1), (2,2), (3,3), and (4,4) ϵ A.

9
Reflexive Relation
Definition (reflexive relation) : A relation R on a set A is
called reflexive if (a,a) ϵ R for every element a ϵ A.

Example 2:
• Relation Rfun on A = {1,2,3,4} defined as:
• Rfun = {(1,2),(2,2),(3,3)}.

• Is Rfun reflexive?

10
Reflexive Relation
Definition (reflexive relation) : A relation R on a set A is
called reflexive if (a,a) ϵ R for every element a ϵ A.

Example 2:
• Relation Rfun on A = {1,2,3,4} defined as:
• Rfun = {(1,2),(2,2),(3,3)}.

• Is Rfun reflexive?

• No. It is not reflexive since (1,1) ,(4,4) Rfun.

11
Symmetric Relation
Definition (symmetric relation): A relation R on a set A is
called symmetric if
a, b  A(a, b)  R  (b, a )  R

Example 1:

• Rdiv ={(a b), if a |b} on A = {1,2,3,4}


• Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}

• Is Rdiv symmetric?

12
Symmetric Relation
Definition (symmetric relation): A relation R on a set A is
called symmetric if

. a, b  A( a, b)  R  (b, a )  R

Example 1:

• Rdiv ={(a b), if a |b} on A = {1,2,3,4}


• Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}

• Is Rdiv symmetric?

• Answer: No. It is not symmetric since (1,2) ϵ R but


(2,1)R. 13
Symmetric Relation
Definition (symmetric relation): A relation R on a set A is
called symmetric if
a, b  A(a, b)  R  (b, a)  R

Example 2:

• R≠ on A={1,2,3,4}, such that a R≠ b if and only if a ≠ b.

R≠={(1,2),(1,3),(1,4),(2,1),(2,3),(2,4),(3,1),(3,2),(3,4),(4,1),
(4,2),(4,3)}

• Is R≠ symmetric ?

14
Symmetric Relation
Definition (symmetric relation): A relation R on a set A is
called symmetric if
a, b  A(a, b)  R  (b, a)  R

Example 2:

• R≠ on A={1,2,3,4}, such that a R≠ b if and only if a ≠ b.

R≠={(1,2),(1,3),(1,4),(2,1),(2,3),(2,4),(3,1),(3,2),(3,4),(4,1),
(4,2),(4,3)}

• Is R≠ symmetric ?
a, b  A(a, b)  R  (b, a )  R
Answer: Yes. 15
Transitive Relation
Definition (transitive relation): A relation R on a set A is
called transitive if
[(a, b)  R and (b, c)  R]  (a, c)  R a, b, c  A
• Example 1:

• Rdiv ={(a b), if a |b} on A = {1,2,3,4}

• Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}

• Is Rdiv transitive?

16
Transitive Relation
Definition (transitive relation): A relation R on a set A is
called transitive if
[(a, b)  R and (b, c)  R]  (a, c)  R a, b, c  A
• Example 1:

• Rdiv ={(a b), if a |b} on A = {1,2,3,4}

• Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2,4), (3,3), (4,4)}

• Is Rdiv transitive?

• Answer: Yes.
17
Transitive Relation
Definition (transitive relation): A relation R on a set A is
called transitive if
[(a, b)  R and (b, c)  R]  (a, c)  R a, b, c  A
• Example 2:

• R≠ on A={1,2,3,4}, such that a R≠ b if and only if a ≠ b.

• R≠={(1,2),(1,3),(1,4),(2,1),(2,3),(2,4),(3,1),(3,2),(3,4),(4,1),
(4,2),(4,3)}

• Is R≠ transitive ?

18
Transitive Relation
Definition (transitive relation): A relation R on a set A is
calledtransitive if
[(a, b)  R and (b, c)  R]  (a, c)  R a, b, c  A
• Example 2:

• R≠ on A={1,2,3,4}, such that a R≠ b if and only if a ≠ b.


•R≠={(1,2),(1,3),(1,4),(2,1),(2,3),(2,4),(3,1),(3,2),(3,4),(4,1),
(4,2),(4,3)}

• Is R≠ transitive ?

• Answer: No. It is not transitive since (1,2) ϵ R and (2,1) ϵ R


but (1,1) is not an element of R. 19
Combining Relation

Definition: Let A and B be sets. A binary relation from A to


B is a subset of a Cartesian product A x B.

• Let R  A  B means R is a set of ordered pairs of the


form (a,b) where a ϵ A and b ϵ B.

Combining Relations
• Relations are sets → combinations via set operations
• Set operations of: union, intersection, difference and
symmetric difference.

20
Combining Relation

Example:
• Let A = {1,2,3} and B = {u,v} and
• R1 = {(1,u), (2,u), (2,v), (3,u)}
• R2 = {(1,v),(3,u),(3,v)}

What is:
• R1 U R2 = ?

21
Combining Relation

Example:
• Let A = {1,2,3} and B = {u,v} and
• R1 = {(1,u), (2,u), (2,v), (3,u)}
• R2 = {(1,v),(3,u),(3,v)}

What is:
• R1 U R2 = {(1,u),(1,v),(2,u),(2,v),(3,u),(3,v)}
• R1 ∩ R2 = ?

22
Combining Relation

Example:
• Let A = {1,2,3} and B = {u,v} and
• R1 = {(1,u), (2,u), (2,v), (3,u)}
• R2 = {(1,v),(3,u),(3,v)}

What is:
• R1 U R2 = {(1,u),(1,v),(2,u),(2,v),(3,u),(3,v)}
• R1 ∩ R2 = {(3,u)}
• R1 - R2 = ?

23
Combining Relation

Example:
• Let A = {1,2,3} and B = {u,v} and
• R1 = {(1,u), (2,u), (2,v), (3,u)}
• R2 = {(1,v),(3,u),(3,v)}

What is:
• R1 U R2 = {(1,u),(1,v),(2,u),(2,v),(3,u),(3,v)}
• R1 ∩ R2 = {(3,u)}
• R1 - R2 = (1,u),(2,u),(2,v)}
• R2 - R1 = ?

24
Combining Relation

Example:
• Let A = {1,2,3} and B = {u,v} and
• R1 = {(1,u), (2,u), (2,v), (3,u)}
• R2 = {(1,v),(3,u),(3,v)}

What is:
• R1 U R2 = {(1,u),(1,v),(2,u),(2,v),(3,u),(3,v)}
• R1 ∩ R2 = {(3,u)}
• R1 - R2 = (1,u),(2,u),(2,v)}
• R2 - R1 = {(1,v),(3,v)}

25
Composite Relation

Definition: Let R be a relation from a set A to a set B and S


a relation from B to a set C. The composite of R and S is
the relation consisting of the ordered pairs (a,c) where aϵ A
and c ϵ C, and for which there is a b ϵ B such that (a,b) ϵ
R and (b,c) ϵ S. We denote the composite of R and S by
S o R.

Examples:
• Let A = {1,2,3}, B = {0,1,2} and C = {a,b}.
• R = {(1,0), (1,2), (3,1),(3,2)}
• S = {(0,b),(1,a),(2,b)}

• SoR = ?
26
Composite Relation

Definition: Let R be a relation from a set A to a set B and S


a relation from B to a set C. The composite of R and S is
the relation consisting of the ordered pairs (a,c) where aϵ A
and c ϵ C, and for which there is a b ϵ B such that (a,b) ϵ
R and (b,c) ϵ S. We denote the composite of R and S by
S o R.

Examples:
• Let A = {1,2,3}, B = {0,1,2} and C = {a,b}.
• R = {(1,0), (1,2), (3,1),(3,2)}
• S = {(0,b),(1,a),(2,b)}

• SoR = {(1,b),(3,a),(3,b)}
27
Composite Relation

Definition: Let R be a relation on a set A. The powers Rn, n


= 1,2,3,... is defined inductively by

• R1 = R and Rn+1 = Rn O R.

Examples
• R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
• R1 = ?

28
Composite Relation

Definition: Let R be a relation on a set A. The powers Rn, n


= 1,2,3,... is defined inductively by

• R1 = R and Rn+1 = Rn O R.

Examples
• R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
• R1 = {(1,2),(2,3),(2,4), (3,3)}
• R2 = ?

29
Composite Relation

Definition: Let R be a relation on a set A. The powers Rn, n


= 1,2,3,... is defined inductively by

• R1 = R and Rn+1 = Rn O R.

Examples
• R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
• R1 = {(1,2),(2,3),(2,4), (3,3)}
• R2 = {(1,3), (1,4), (2,3), (3,3)}
• R3 = ?

30
Composite Relation

Definition: Let R be a relation on a set A. The powers Rn, n


= 1,2,3,... is defined inductively by

• R1 = R and Rn+1 = Rn O R.

Examples
• R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
• R1 = {(1,2),(2,3),(2,4), (3,3)}
• R2 = {(1,3), (1,4), (2,3), (3,3)}
• R3 = {(1,3), (2,3), (3,3)}
• R4 =

31
Composite Relation

Definition: Let R be a relation on a set A. The powers Rn, n


= 1,2,3,... is defined inductively by

• R1 = R and Rn+1 = Rn O R.

Examples
• R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
• R1 = {(1,2),(2,3),(2,4), (3,3)}
• R2 = {(1,3), (1,4), (2,3), (3,3)}
• R3 = {(1,3), (2,3), (3,3)}
• R4 = {(1,3), (2,3), (3,3)}
• Rk = ? when k>3

32
Composite Relation

Definition: Let R be a relation on a set A. The powers Rn, n


= 1,2,3,... is defined inductively by

• R1 = R and Rn+1 = Rn O R.

Examples
• R = {(1,2),(2,3),(2,4), (3,3)} is a relation on A = {1,2,3,4}.
• R1 = {(1,2),(2,3),(2,4), (3,3)}
• R2 = {(1,3), (1,4), (2,3), (3,3)}
• R3 = {(1,3), (2,3), (3,3)}
• R4 = {(1,3), (2,3), (3,3)}
• Rk = {(1,3), (2,3), (3,3)}

33
Transitive Relation
Definition (transitive relation): A relation R on a set A is
called transitive if
• [(a,b) ϵ R and (b,c) ϵ R] → (a,c) ϵ R for all a, b, c ϵ A.

• Example 1:

• Rdiv ={(a b), if a |b} on A = {1,2,3,4}

• Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2, 3), (2,4), (3,3), (4,4)}

• Is Rdiv transitive?

34
Transitive Relation
Definition (transitive relation): A relation R on a set A is
called transitive if
• [(a,b) ϵ R and (b,c) ϵ R] → (a,c) ϵ R for all a, b, c ϵ A.

• Example 1:

• Rdiv ={(a b), if a |b} on A = {1,2,3,4}

• Rdiv = {(1,1), (1,2), (1,3), (1,4), (2,2), (2, 3), (2,4), (3,3), (4,4)}

• Is Rdiv transitive?

• Answer: Yes.
35
Closure of a Relation

Let R={(1,1),(1,2),(2,1),(3,2)} on A ={1 2 3}.

• Is this relation reflexive?

• Answer: ?

36
Closure of a Relation

Let R={(1,1),(1,2),(2,1),(3,2)} on A ={1 2 3}.

• Is this relation reflexive?

• Answer: No (2,2) and (3,3) is not in R.

The question is what is the minimal relation S  R that is


reflexive?
• How to make R reflexive with minimum number of
additions?

• Answer: ?
37
Closure of a Relation

Let R={(1,1),(1,2),(2,1),(3,2)} on A ={1 2 3}.

• Is this relation reflexive?


• Answer: No (2,2) and (3,3) is not in R.

The question is what is the minimal relation S  R that is


reflexive?
• How to make R reflexive with minimum number of additions?

• Answer: ? Add (2,2) and (3,3)


• Then S= {(1,1),(1,2),(2,1),(3,2),(2,2),(3,3)}
• RS
• The minimal set S  R is called the reflexive closure of R
38
Closure of a Relation

Relations can have different properties:


• reflexive,
• symmetric
• transitive

• Because of that we define:


• reflexive,
• symmetric and
• transitive
closures.

39
Closure of a Relation

Definition: Let R be a relation on a set A. A relation S on A


with property P is called the closure of R with respect to P if S
is a subset of every relationSQ( Q ) with property P that
contains R ( R  Q ).

40
Closure of a Relation

Definition: Let R be a relation on a set A. A relation S on A


with property P is called the closure of R with respect to P if S
is a subset of every relationSQ( Q ) with property P that
contains R ( R  Q ).

Example (symmetric closure):


• Assume R={(1,2),(1,3), (2,2)} on A={1,2,3}.

• What is the symmetric closure S of R?

• S=?

41
Closure of a Relation

Definition: Let R be a relation on a set A. A relation S on A


with property P is called the closure of R with respect to P if S
is a subset of every relationSQ( Q ) with property P that
contains R ( R  Q ).

Example (symmetric closure):


• Assume R={(1,2),(1,3), (2,2)} on A={1,2,3}.

• What is the symmetric closure S of R?

• S = {(1,2),(1,3), (2,2)} U {(2,1), (3,1)}


= {(1,2),(1,3), (2,2),(2,1), (3,1)}

42
Closure of a Relation

Definition: Let R be a relation on a set A. A relation S on A


with property P is called the closure of R with respect to P if S
is a subset of every relationSQ( Q ) with property P that
contains R ( R  Q ).

Example (transitive closure):


• Assume R={(1,2), (2,2), (2,3)} on A={1,2,3}.

• Is R transitive?

43
Closure of a Relation

Definition: Let R be a relation on a set A. A relation S on A


with property P is called the closure of R with respect to P if S
is a subset of every relationSQ( Q ) with property P that
contains R ( R  Q ).

Example (transitive closure):


• Assume R={(1,2), (2,2), (2,3)} on A={1,2,3}.

• Is R transitive? No.
• How to make it transitive?
• S = {(1,2), (2,2), (2,3)} U {(1,3)}
= {(1,2), (2,2), (2,3),(1,3)}
• S is the transitive closure of R
44
Path length

Theorem: Let R be a relation on a set A. There is a path of


length n from a to b if and only if (a,b) ϵ Rn.

Proof (math induction):

45
Path length

Theorem: Let R be a relation on a set A. There is a path of


length n from a to b if and only if (a,b) ϵ Rn.

Proof (math induction):


• P(1): There is a path of length 1 from a to b if and only if (a,b)
ϵ R1, by the definition of R.

46
Path length

Theorem: Let R be a relation on a set A. There is a path of


length n from a to b if and only if (a,b) ϵ Rn.

Proof (math induction):


• P(1): There is a path of length 1 from a to b if and only if (a,b)
ϵ R1, by the definition of R.
Show: P(n) → P(n+1): Assume there is a path of length n from
a to b if and only if (a,b) ϵ Rn → there is a path of length n+1
from a to b if and only if (a,b) ϵ Rn+1.

47
Path length

Theorem: Let R be a relation on a set A. There is a path of


length n from a to b if and only if (a,b) ϵ Rn.

Proof (math induction):


• P(1): There is a path of length 1 from a to b if and only if (a,b)
ϵ R1, by the definition of R.
Show: P(n) → P(n+1): Assume there is a path of length n from
a to b if and only if (a,b) ϵ Rn → there is a path of length n+1
from a to b if and only if (a,b) ϵ Rn+1.

There is a path of length n+1 from a to b if and only if there


exists an x ϵ A, such that (a,x) ϵ R (a path of length 1) and
(x,b) ϵ Rn is a path of length n from x to b.
48
Path length
Theorem: Let R be a relation on a set A. There is a path of length n from a
to b if and only if (a,b) ϵ Rn.

Proof (math induction):


• P(1): There is a path of length 1 from a to b if and only if (a,b) ϵ R1, by the
definition of R.
Show: P(n) → P(n+1): Assume there is a path of length n from a to b if and
only if (a,b) ϵ Rn → there is a path of length n+1 from a to b if and only if
(a,b) ϵ Rn+1.
There is a path of length n+1 from a to b if and only if there
exists an x ϵ A, such that (a,x) ϵ R (a path of length 1) and (x,b) ϵ Rn is a
path of length n from x to b.

(x,b) ϵ Rn holds due to P(n). Therefore, there is a path of length


n + 1 from a to b. This also implies that (a,b) ϵ Rn+1. 49
Connectivity Relation
Definition: Let R be a relation on a set A. The connectivity
relation R* consists of all pairs (a,b) such that there is a path (of
any length, ie. 1 or 2 or 3 or ...) between a and b in R.


R   Rk
*
k 1

Example:
• A = {1,2,3,4}
• R = {(1,2),(1,4),(2,3),(3,4)}

50
Connectivity Relation
Definition: Let R be a relation on a set A. The connectivity
relation R* consists of all pairs (a,b) such that there is a path (of
any length, ie. 1 or 2 or 3 or ...) between a and b in R.


R   Rk
*
k 1

Example:
• A = {1,2,3,4}
• R = {(1,2),(1,4),(2,3),(3,4)}

• R2 =?

51
Connectivity Relation
Definition: Let R be a relation on a set A. The connectivity
relation R* consists of all pairs (a,b) such that there is a path (of
any length, ie. 1 or 2 or 3 or ...) between a and b in R.


R   Rk
*
k 1

Example:
• A = {1,2,3,4}
• R = {(1,2),(1,4),(2,3),(3,4)}

• R2 = {(1,3),(2,4)}
• R3 = ?

52
Connectivity Relation
Definition: Let R be a relation on a set A. The connectivity
relation R* consists of all pairs (a,b) such that there is a path (of
any length, ie. 1 or 2 or 3 or ...) between a and b in R.


R   Rk
*
k 1

Example:
• A = {1,2,3,4}
• R = {(1,2),(1,4),(2,3),(3,4)}

• R2 = {(1,3),(2,4)}
• R3 = {(1,4)}
•R4 = ?
53
Connectivity Relation
Definition: Let R be a relation on a set A. The connectivity
relation R* consists of all pairs (a,b) such that there is a path (of
any length, ie. 1 or 2 or 3 or ...) between a and b in R.


R   Rk
*
k 1

Example:
• A = {1,2,3,4}
• R = {(1,2),(1,4),(2,3),(3,4)}

• R2 = {(1,3),(2,4)}
• R3 = {(1,4)}
•R4 =Ø
• R* =?
54
Connectivity Relation
Definition: Let R be a relation on a set A. The connectivity
relation R* consists of all pairs (a,b) such that there is a path (of
any length, ie. 1 or 2 or 3 or ...) between a and b in R.


R   Rk
*
k 1

Example:
• A = {1,2,3,4}
• R = {(1,2),(1,4),(2,3),(3,4)}

• R2 = {(1,3),(2,4)}
• R3 = {(1,4)}
•R4 =Ø
• R* = {(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)}
55
Equivalence Relation

Definition: A relation R on a set A is called an equivalence


relation if it is reflexive, symmetric and transitive.

Example: Let A = {0,1,2,3,4,5,6} and


• R= {(a,b)| a,b ϵ A, a ≡ b mod 3} (a is congruent to b modulo
3)
Congruencies:
• 0 mod 3 = 0 1 mod 3 = 1 2 mod 3 = 2 3 mod 3 = 0
• 4 mod 3 = 1 5 mod 3 = 2 6 mod 3 = 0

56
Equivalence Relation

Definition: A relation R on a set A is called an equivalence


relation if it is reflexive, symmetric and transitive.

Example: Let A = {0,1,2,3,4,5,6} and


• R= {(a,b)| a,b ϵ A, a ≡ b mod 3} (a is congruent to b modulo
3)
Congruencies:
• 0 mod 3 = 0 1 mod 3 = 1 2 mod 3 = 2 3 mod 3 = 0
• 4 mod 3 = 1 5 mod 3 = 2 6 mod 3 = 0
Relation R has the following pairs:
• (0,0) (0,3), (3,0), (0,6), (6,0)
• (3,3), (3,6) (6,3), (6,6) (1,1),(1,4), (4,1), (4,4)
• (2,2), (2,5), (5,2), (5,5) 57
Equivalence Relation

Example: Let A = {0,1,2,3,4,5,6} and


• R= {(a,b)| a,b ϵ A, a ≡ b mod 3} (a is congruent to b modulo
3)
Relation R has the following pairs:
• (0,0) (0,3), (3,0), (0,6), (6,0)
• (3,3), (3,6) (6,3), (6,6) (1,1),(1,4), (4,1), (4,4)
• (2,2), (2,5), (5,2), (5,5)

Is R reflexive

58
Equivalence Relation

Example: Let A = {0,1,2,3,4,5,6} and


• R= {(a,b)| a,b ϵ A, a ≡ b mod 3} (a is congruent to b modulo
3)
Relation R has the following pairs:
• (0,0) (0,3), (3,0), (0,6), (6,0)
• (3,3), (3,6) (6,3), (6,6) (1,1),(1,4), (4,1), (4,4)
• (2,2), (2,5), (5,2), (5,5)

Is R reflexive Yes
Is R symmetric

59
Equivalence Relation

Example: Let A = {0,1,2,3,4,5,6} and


• R= {(a,b)| a,b ϵ A, a ≡ b mod 3} (a is congruent to b modulo
3)
Relation R has the following pairs:
• (0,0) (0,3), (3,0), (0,6), (6,0)
• (3,3), (3,6) (6,3), (6,6) (1,1),(1,4), (4,1), (4,4)
• (2,2), (2,5), (5,2), (5,5)

Is R reflexive Yes
Is R symmetric Yes
Is R transitive

60
Equivalence Relation

Example: Let A = {0,1,2,3,4,5,6} and


• R= {(a,b)| a,b ϵ A, a ≡ b mod 3} (a is congruent to b modulo
3)
Relation R has the following pairs:
• (0,0) (0,3), (3,0), (0,6), (6,0)
• (3,3), (3,6) (6,3), (6,6) (1,1),(1,4), (4,1), (4,4)
• (2,2), (2,5), (5,2), (5,5)

Is R reflexive Yes
Is R symmetric Yes
Is R transitive Yes

Then 61
Thank You

62

You might also like