Discrete MAthematics

3. Relations
Class – 22
Relations

Detailed explanations for n=3:

A relation R on a set A such that for all a, b ∈ A, if (a, b) ∈ R and (b, a) ∈ R, then a = b is called antisymmetric.
R = {(1,1), (2,2), (3,3), (1,2)} (No (2,1))
R = {(1,2), (2,1), (3,3)} (Since (1,2) and (2,1) both exist)
Relations
EXAMPLE 5 For the following relations on the set of integers, which are reflexive, symmetric, antisymmetric and transitive?:
R1 = {(a, b) ∣ a ≤ b},
R2 = {(a, b) ∣ a > b},
Relation Reflexive Symmetric Antisymmetric Transitive
R3 = {(a, b) ∣ a = b or a = −b},
R4 = {(a, b) ∣ a = b}, If a ≤ b and b
R1 = {(a, b) ∣ a ≤ Because a ≤ a 1 ≤ 2, but 2 is If a ≤ b and b
R5 = {(a, b) ∣ a = b + 1}, ≤ a, then a must
b} for all integers a. not ≤ 1. ≤ c, then a ≤ c.
equal b.
R6 = {(a, b) ∣ a + b ≤ 3}.
It's impossible
R2 = {(a, b) ∣ a > 2 > 1, but 1 is If a > b and b
a is never > a. for both a > b and b
b} not > 2. > c, then a > c.
> a to be true.
1 = -1 or 1 = -
If a = b or a =
R3 = {(a, b) ∣ a = b a = a is always (-1) is true, and -1 If a = ±b and b
-b, then b = a or b
or a = −b} true. = -1 or -1 = -(-1) is = ±c, then a = ±c.
= -a.
true, but 1 ≠ -1.
R4 = {(a, b) ∣ a = a = a is always If a = b, then b If a = b and b If a = b and b
b} true. = a. = a, then a = b. = c, then a = c.
It's impossible
(2, 1) and (1, 0)
R5 = {(a, b) ∣ a = b a is never equal 2 = 1 + 1, but 1 for both a = b + 1
are in R5, but (2, 0)
+ 1} to a + 1. ≠ 2 + 1. and b = a + 1 to be
is not.
true.
If a = 2, then a (2, 1) and (1, 2)
R6 = {(a, b) ∣ a + b If a + b ≤ 3, 1 + 2 ≤ 3 and 2
+ a = 4, which is are in R6, but (2, 2)
≤ 3} then b + a ≤ 3. + 1 ≤ 3, but 1 ≠ 2.
not ≤ 3. is not.
 EXAMPLE 7 Consider the following relations on {1, 2, 3, 4}. Then which of these relations are reflexive, symmetric,
Relations antisymmetric and transitive?
R1 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 4), (4, 1), (4, 4)},
R2 = {(1, 1), (1, 2), (2, 1)},
R3 = {(1, 1), (1, 2), (1, 4), (2, 1), (2, 2), (3, 3), (4, 1), (4, 4)},
R4 = {(2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3)},
R5 = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 3), (2, 4), (3, 3), (3, 4), (4, 4)},
R6 = {(3, 4)}.
Relations Problem: Divisibility Relations
Define the following relations on the set of positive integers:
•R1: {(a, b) | a divides b} (a is a divisor of b)
•R2: {(a, b) | a and b have a common divisor greater than 1}
•R3: {(a, b) | gcd(a, b) = 1} (a and b are relatively prime)
Determine which of these relations are reflexive, symmetric, antisymmetric, and transitive.
Sol:
Relation Reflexive Symmetric Antisymmetric Transitive

(2 divides 4, but 4 (If a divides b and b (If a divides b and b

(2 and 4 have a
(a and a always have a (2 and 4 have a common divisor > 1, 4
(If a and b have a
common divisor a > 1 if common divisor 2, and 4 and 6 have a common
R2: common divisor > 1 common divisor, so do b
a > 1. If a = 1, then the and 2 have a common divisor > 1, but 2 and 6
and a)
relation is not reflexive) divisor 2, but 2 ≠ 4) have a common divisor 2
> 1)

(gcd(2, 3) = 1 and
(gcd(a, a) = a, which (gcd(2, 3) = 1 and
R3: gcd(a, b) = 1 (gcd(a, b) = gcd(b, a)) gcd(3, 4) = 1, but gcd(2,
is not always 1) gcd(3, 2) = 1, but 2 ≠ 3)
4) = 2)