Scribd
Upload
36 views3 pages

Problem Set 3.: Properties of Homogeneous Binary Relations, Equivalence Relations and Partitions

This document contains a problem set on properties of binary relations from a discrete mathematics course. It includes 9 questions about determining if various relations are reflexive, symmetric, anti-symmetric, transitive, or equivalence relations. It also includes problems about equivalence classes and partitions induced by equivalence relations. The document provides examples of relations and asks students to analyze the properties of the relations and solve other problems related to equivalence relations and partitions.

Uploaded by

Laith Sandouka
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views3 pages

Problem Set 3.: Properties of Homogeneous Binary Relations, Equivalence Relations and Partitions

This document contains a problem set on properties of binary relations from a discrete mathematics course. It includes 9 questions about determining if various relations are reflexive, symmetric, anti-symmetric, transitive, or equivalence relations. It also includes problems about equivalence classes and partitions induced by equivalence relations. The document provides examples of relations and asks students to analyze the properties of the relations and solve other problems related to equivalence relations and partitions.

Uploaded by

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

ELTE IK Discrete mathematics I Problem set 3.

Problem set 3.: Properties of homogeneous binary relations,


equivalence relations and partitions

Properties of homogeneous binary relations


Question 1.
Let X = {1, 2, 3}. In each of the following examples below decide if the relation ρ on X is reflexive,
symmetric, anti-symmetric and/or transitive.
(a) ρ = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)}
(b) ρ = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (3, 1), (3, 3)}
(c) ρ = {(1, 2), (1, 3), (2, 1), (3, 1)}
(d) ρ = {(1, 2), (2, 3), (3, 1)}
(e) ρ = {(1, 2)}
(f) ρ = {(1, 2), (2, 1), (2, 3), (3, 2)}
(g) ρ = {(1, 1), (2, 2), (2, 3), (3, 3)}
(h) ρ = {(1, 2), (1, 3), (2, 1), (2, 3), (3, 1), (3, 2)}

Question 2.
(a) Can a relation be both symmetric and anti-symmetric at the same time? Can a relation be
both reflexive and irreflexive? Justify your answers.
(b) Prove that if a relation is both symmetric and anti-symmetric then it is also transitive.
(c) Prove that if a relation that is not the empty set is both irreflexive and symmetric, then it is
not transitive.

Question 3.
In each of the following examples, decide if the given relation is reflexive, irreflexive, symmetric,
anti-symmetric and/or transitive, and find the domain and the range of the relation.
(a) R = {(a, b) ∈ N × N | a · b is odd}
(b) S = {(a, b) ∈ B × B | the surname of a is shorter than the surname of b} where B is the set
of all Dimat 1. students at ELTE.
(c) TX = {(A, B) ∈ P (X) × P (X) | A ∩ B 6= ∅} where X is a given set.
(d) U = {(a, b) ∈ Z+ × Z+ | gcd(a, b) > 1}
(e) V = {(x, y) ∈ K × K| | x touches y from inside}, where K is the set of all circles in a given
plane.

Question 4.
Define the binary relation R ⊆ N × N as follows: for every m, n ∈ N let n R m if and only if the
number of common prime divisors of m and n is even. Describe the properties of R (i.e. decide if
R is reflexive, transitive, symmetric, anti-symmetric and/or trichotomous).

Question 5.
In each question below give an example for a relation on the set {1, 2, 3, 4} satisfying simultaneously
all the properties listed in the question:
(a) reflexive and not irreflexive;
(b) anti-symmetric and not symmetric;

1
ELTE IK Discrete mathematics I Problem set 3.

(c) symmetric and not anti-symmetric;


(d) both symmetric and anti-symmetric;
(e) neither symmetric nor anti-symmetric;
(f) both reflexive and trichotomous;
(g) not reflexive, not transitive, not symmetric, not anti-symmetric, and not trichotomous

Equivalence relations and partitions


Question 6.
Let A = {1, 2, 3, 4, 5, 6, 7, 8}. For each of the relations defined in parts (a) and (b) below, solve
questions (1) and (2).
(a) ρ = {(1, 1), (1, 5), (2, 2), (3, 3), (3, 4), (4, 3), (4, 4), (5, 1), (5, 5)}
(b) ρ = {(1, 1), (1, 5), (1, 6), (1, 8), (2, 2), (2, 4), (3, 3), (3, 7), (4, 2), (4, 4), (5, 1), (5, 5), (5, 6),
(5, 8), (6, 1), (6, 5), (6, 6), (6, 8), (7, 3), (7, 7), (8, 1), (8, 5), (8, 6), (8, 8)}
(1) Prove that ρ is an equivalence relation on A.
(2) Write down the partition of A induced by the equivalence relation ρ (in other words: Find
the quotient set A/ρ).

Question 7.
In each example below find the equivalence relation on {a, b, c, d, e, f } which corresponds to the
given partition:
(a) {{a, b, f }, {c}, {d, e}}
(b) {{a}, {b}, {c}, {d}, {e, f }}

Question 8.
In each of the following examples prove that R is an equivalence relation (on the set which R is
defined on in the example), and find the equivalence classes of R.
(a) R = {(m, n) ∈ Z × Z | m + n páros szám}
(b) R = {(x, y) ∈ Z × Z | x2 + y 2 osztható 2-vel}
(c) R = {(a, b) ∈ R × R | a − b racionális}
(d) R = {(m, n) ∈ N × N | m2 − n2 osztható 3-mal}
(e) R = {((x1 , y1 ), (x2 , y2 )) ∈ R2 × R2 | x1 + y1 = x2 + y2 }
(f) R = {((x1 , y1 ), (x2 , y2 )) ∈ R2 × R2 | x1 · y1 = x2 · y2 }

Question 9.
In each question below give an example for a relation on the set {1, 2, 3, 4} satisfying simultaneously
all the properties listed in the question:
(a) reflexive and not irreflexive;
(b) anti-symmetric and not symmetric;
(c) symmetric and not anti-symmetric;
(d) both symmetric and anti-symmetric;
(e) neither symmetric nor anti-symmetric;
(f) both reflexive and trichotomous;
(g) not reflexive, not transitive, not symmetric, not anti-symmetric, and not trichotomous

2
ELTE IK Discrete mathematics I Problem set 3.

Harder and optional questions


Question 10.
Let R, S ⊆ A×A be symmetric relations. Prove that R◦S is symmetric if and only if R◦S = S ◦R.

Question 11.
Prove that the intersection of two reflexive (irreflexive, symmetric, anti-symmetric, strictly anti-
symmetric,transitive) relations is also a(n) reflexive (irreflexive, symmetric, anti-symmetric, strictly
anti-symmetric,transitive) relation.

You might also like