You are on page 1of 3

Precious F.

Eusebio
Logic & Set Theory / Module 3
Ma’am Sharon Galicha
Bachelor of Secondary Education major in Mathematics / Block 1

Assessment Tasks 3

3.1 Let X = {a, b, c}. Recall that P(X) is the power set of X. Define a relation 𝐑
on P(X) as follows: A, B ∈ P(x), A 𝐑 B ↔ |A| = |B|.
a. Is {a, b} 𝐑 {b, c}?
𝐑 = A x B, 𝐑 is universal relation because every element of A is related
to every element of B.
b. Is {a} 𝐑 {a, b}?
𝐑 = {(a,a) ∀ a ∈ A}, is identity relation because it contains only the
ordered pairs where every element of set A is related to ONLY itself.
c. Is {c}𝐑{b}?
𝐑 = ∅, 𝐑 is void relation because there’s no possibility of finding a
relation between c and b.

3.2 Let A = {3, 4, 5} and B = {4, 5, 6} and define the relation 𝐑 as follows: (x, y)
∈ A × B,(x, y) ∈ 𝐑 ⇔ x < y. List the elements of the sets 𝐑 and R−1 .
𝐑 = {(3,4), (3,5), (3,6), (4,5), (4,6), (5,6)}
R
−1
= {(4,3), (5,3), (6,3), (5,4), (6,4), (6,5)}
3.3 Consider the relation on R defined as follows: x, y ∈ R, x 𝐑 y ↔ x ≥ y. Is 𝐑
reflexive? symmetric? transitive?
𝐑 is reflexive: For any set X, X = X
𝐑 is symmetric: ⟹x ≥ y ⟹ y ≥ x ⟹ y 𝐑 x
𝐑 is not transitive: For instance the value of x is 1 and the value of y is 5;
x ≥ y doesn't satisfy relation x ≥ y. That’s why 𝐑 is not transitive.

3.4 Consider the relation on R defined as follows: x, y ∈ R, x 𝐑 y ↔ xy ≥ 0. Is 𝐑


reflexive? symmetric? transitive?
This relation can be reflexive and symmetric but not transitive. We know
that, for any real number x,x2≥0
⟹xx≥0⟹ x 𝐑 x
∴ 𝐑 is reflexive
Let (x,y)∈ 𝐑 i.e . x 𝐑 y
⟹xy≥0⟹yx≥0⟹ y 𝐑 x
∴ 𝐑 is symmetric
Let x 𝐑 y and y 𝐑 x
⟹xy≥0 and yz≥0
But from this, we can't conclude xz≥0
For example,
(−1,0),(0,2) satisfies the relation xy≥0 but (−1,2) doesn't satisfy
relation xy≥0
Thus, 𝐑 is not transitive.
Hence, 𝐑 is reflexive, symmetric but not transitive.

3.5 Let A ≠ ∅ and P(A) be the power set of A. Consider the binary relation on
P(A) defined as follows: X, Y ∈ P(A), X 𝐑 Y ↔ X ⊆ Y. Is ↔ reflexive? symmetric?
transitive?
↔ is reflexive: For any set X ∈ A, X ↔ X.

↔ is symmetric: If X↔Y and Y ↔ X then X = Y, where X, Y ∈ A.

↔ is transitive: If X ↔ Y and Y ↔Z then X ↔ Z, for any set X, Y, Z ∈ A.


3.6 Define a relation 𝐑 on ℤ as follows: for all m, n ∈ ℤ m 𝐑 n ↔ m + n is even.
Is 𝐑 a partial order? Prove or give a counterexample.
𝐑 is not a partial order relation. Why? Because in order the 𝐑 to be a
partial order it should be reflexive, antisymmetric and transitive. But in
this for all a, b ∈ A, a relation 𝐑 is antisymmetric if a 𝐑 b and b 𝐑 a then a
= b and the given relation 𝐑 is not symmetric. And the given relation 𝐑
is not also transitive. For example the value of m is 0 and the value of n
is 1, 0 + 1 = 1 and 1 is not an even number.

You might also like