BOLU ABANT IZZET BAYSAL UNIVERSITY

WORKSHEET 1

Course: Abstract Mathematics 2

Content: Relations
Semester: 2024-2025 Spring
Lecturer: Dr. Sibel Cansu

1. Let A = {1, 2}. Determine all the relations on A.

2. Let A = {{a}, {a, b}, {a, b, c}, {a, b, d, e}} be a set and R be a relation on A that is defined by

(X, Y ) ∈ R if X ∩ Y ⊂ Y .

Find the elements of R.

3. Let R = {(a, a), (b, b), (c, c)} and S = {(a, b), (b, a)} be two relations defined on A = {a, b, c}.
Find whether the relations R and S are reflexive, symmetric, antisymmetric, and transitive.

4. Determine the inverse relation R−1 for the relation R = {(x, y) : x + 4y is odd} defined on N.

5. Let R be a relation defined on the set of positive integers by (x, y) ∈ R if xy is an odd integer.

(a) Is R reflexive?
(b) Is R symmetric?
(c) Is R transitive?

6. Let A = {a, b, c} and B = {1, 2, 3, 4}. Let

R1 = {(a, 2), (a, 3), (b, 1), (b, 3), (c, 4)}

be a relation form A to B, and

R2 = {(1, b), (1, c), (2, a), (2, b), (3, c), (4, a), (4, c)}

be a relation from B to A. Let a relation R on A is defined by

x R y if and only if there exists an element z ∈ B such thatx R1 z and z R2 y

(a) Determine the elements of R.

(b) Find whether the relations R and S are reflexive, symmetric, antisymmetric, and transitive.

1
 7. Let A = {1, 2, 3, 4}. Find a relation on A which is

(a) Reflexive, symmetric but not transitive,

(b) Reflexive, transitive but not symmetric,
(c) Symmetric, transitive but not reflexive,
(d) Symmetric, not transitive and reflexive,
(e) Antisymmetric, transitive but not reflexive,
(f) Antisymmetric, not transitive and reflexive,
(g) Reflexive, not transitive but symmetric,
(h) Reflexive, not symmetric but transitive.

8. Let R be a relation on R defined by a R b if a − b is an integer.

(a) Show that R is an equivalence relation.

(b) Find the equivalence class of 1.
1
(c) Find the equivalence class of .
2
9. A relation R defined on Z by a R b if |a − b| ≤ 2. Which of the reflexive, symmetric and
transitive properties does the relation R possess? If R does not possess one of the properties,
explain why?

10. Let A = {1, 2, 3, 4}, and R = {(x, y) : x = y or x + y = 5} be a relation defined on A. Check

whether R is an equivalence relation or not. If so, find distinct equivalence classes.

11. A relation R defined on Z by x R y if xy ≥ 0. Prove or disprove the following:

(a) R is reflexive, (b) R is symmetric, and (c) R is transitive.

12. Let S = {(x, y) ∈ Z × Z : x2 + 2y + 1 = 0}. Is the relation S symmetric?

13. Let R be a relation on the set of order pairs of positive integers such that

(a, b) R (c, d) if ad = bc.

(a) Show that R is an equivalence relation.

(b) Find the equivalence class of (1, 2).

14. A relation R defined on Z by a R b if 5a ≡ 2b (mod 3). Prove that R is an equivalence relation

and determine the distinct equivalence classes.

15. Let R be a relation defined on Z by a R b if a3 = b3 . Show that R is an equivalence relation

on Z, and determine the distinct equivalence classes.

16. A relation R defined on N by a R b if either a|b or b|a. Determine which of the reflexive,
symmetric, and transitive properties is possessed by R.

2
17. Let A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and B = {1, 2, 3, 5, 7, 9}. The relation R on A defined by

x R y if x = y or x, y ∈ B.

(a) Show that R is an equivalence relation.

(b) Using R, find a partition of A.

18. Let A = {1, 2, 3, 4, 5, 6}. The distinct equivalence classes resulting from an equivalence relation
R on A are {1, 4, 5}, {2, 6} and {3}. What is R?

19. Let A = {4k : k ∈ Z}. A relation R is defined on Z by a R b if a − b ∈ A.

(a) Show that R is an equivalence relation.

(b) Determine the distinct equivalence classes.

20. Let A = {a, b, c, d}, R = {(a, a), (a, b), (a, c), (b, c), (c, a), (c, c), (c, d), (d, c)} and
S = {(a, a), (b, a), (b, c), (b, d), (d, b)} be relations on A. Find

(a) R ◦ R.
(b) R ◦ S.
(c) S ◦ R.
(d) S ◦ S.

21. A relation R defined on Z by a R b if 2a + 3b ≡ 0 (mod 5). Prove that R is an equivalence

relation and determine the distinct equivalence classes.

22. Let A be a poset with relation R. Show that inverse of R is also a partial order on A.

23. Draw the Hasse diagram for divisibility relation on the set

(a) {1, 2, 3, 4, 5, 6, 7, 8}. (b) {1, 2, 3, 5, 7, 11, 13}.

(c) {1, 2, 3, 6, 12, 24, 36, 48}. (d) {1, 2, 4, 8, 16, 32, 64}.

24. Let A be a nonempty set and let B be a fixed subset of A. A relation R is defined on P(A) by
X R Y if X ∩ B = Y ∩ B.

(a) Prove that R is an equivalence relation.

(b) Let A = {1, 2, 3, 4} and B = {1, 3, 4}. For X = {2, 3, 4}, determine [X].

25. Let A and B be posets with the relations R1 and R2 , respectively. On A×B, define the relation
R by
′ ′ ′ ′
(a, b) R (a , b ) if a R1 a and b R2 b .

Show that A × B is a poset with the relation R.

3
26. Let A = {2, 4, 6, 9, 12, 18, 27, 36, 48, 60, 72} be a poset with the relation R defined by a R b if a
divides b.

(a) Find the maximal elements of A.

(b) Find the minimal elements of A.
(c) Is there a greatest element?
(d) Is there a least element?
(e) Find the upper bounds of {2, 9}.
(f) Find the least upper bound of {2, 9}, if it exists.
(g) Find the lower bounds of {60, 72}.
(h) Find the greatest lower bound of {60, 72}, if it exists.

27. Let R be a partial order on the set A. If A has the least element x, then show that x is the
minimal element of A.

28. Let R be a partial order on the set A. If A has the greatest element x, then show that x is the
maximal element of A.

29. For any set A, let R(A) denotes the set of relations on A. For R1 , R2 ∈ R(A), define a relation
≤ on R(A).

R1 ≤ R2 means x R1 y implies x R2 y.

Show that R(A) is a poset with the relation ≤.

30. How many elements has at least a partially ordered relation on a 6-element set A?

31. Answer the following questions for the partial order represented by the following Hasse diagram.

l m

j k

i h g

d e f

a b c

(a) Find the maximal elements.

(b) Find the minimal elements.
(c) Is there a greatest element?

4
 (d) Is there a least element?
(e) Find the upper bounds of {a, b, c}.
(f) Find the least upper bound of {a, b, c}, if it exists.
(g) Find the lower bounds of {f, g, h}.
(h) Find the greatest lower bound of {f, g, h}, if it exists.

32. Answer the following questions for the partial order represented by the following Hasse diagram.

f g

d e

b c

(a) Find the maximal elements.

(b) Find the minimal elements.
(c) Is there a greatest element?
(d) Is there a least element?
(e) Find upper bounds of {b, d, e}.
(f) Find the least upper bound of {b, d, e}, if it exists.
(g) Find lower bounds of {b, d, e}.
(h) Find the greatest lower bound of {b, d, e}, if exists.

33. Let (R, ≤) be a partially ordered set. Let ⪯ be a relation defined on R × R by

(x, y) ⪯ (a, b) if and only if x ≤ a and y ≤ b.

Check whether ⪯ is a partial order relation.