THE CHINESE UNIVERSITY OF HONG KONG

Department of Mathematics
MMAT5510 Foundation of Advanced Mathematics (2024 Fall)
Extra exercises on chapter 1-4

1. By writing down the corresponding truth table, prove that

(P ∧ Q) ∨ (¬P ) ≡ P → Q

for any statements P, Q.

Solution:
Let P1 = (P ∧ Q) ∨ (¬P ) and P2 = P → Q.

P Q P ∧Q ¬P P1 P2
T T T F T T
T F F F F F
F T F T T T
F F F T T T

Hence, P1 ≡ P2 .

2. By writing down the corresponding truth table, prove that

¬(P → Q) ≡ P ∧ (¬Q)

for any statements P, Q.

Solution:
Let P1 = ¬(P → Q) and P2 = P ∧ (¬Q).

P Q P → Q P1 ¬Q P2
T T T F F F
T F F T T T
F T T F F F
F F T F T F

Hence, P1 ≡ P2 .
 2

3. (a) Prove one of the distributive properties of sets:

A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

for any sets A, B, C ⊆ U.

(b) Considering De Morgan’s laws, prove the other distributive properties of sets:

A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)

for any sets A, B, C ⊆ U.

Solution:

(a) ⊆:

x ∈ A ∩ (B ∪ C)
⇒ (x ∈ A) and (x ∈ B ∪ C)
⇒ (x ∈ A) and (x ∈ B or x ∈ C)

So, x ∈ A. If x ∈ B, then x ∈ A ∩ B. If x ∈ C, then x ∈ A ∩ C. Therefore,

(x ∈ A ∩ B) or (x ∈ A ∩ C)
⇒ x ∈ (A ∩ B) ∪ (A ∩ C)

⊇:

x ∈ (A ∩ B) ∪ (A ∩ C)
⇒ (x ∈ A ∩ B) or (x ∈ A ∩ C)
⇒ (x ∈ A and x ∈ B) or (x ∈ A and x ∈ C)

If x ∈ A and x ∈ B, then x ∈ A and x ∈ B ∪ C. If x ∈ A and x ∈ C, we also

have x ∈ A and x ∈ B ∪ C. Thus,

(x ∈ A) and (x ∈ B ∪ C)
⇒ x ∈ A ∩ (B ∪ C)

(b)

A ∪ (B ∩ C)
= A ∩ (B ∩ C)
= A ∩ (B ∪ C)
= (A ∩ B) ∪ (A ∩ C) (by part (a))
= (A ∪ B) ∪ (A ∪ C)
= (A ∪ B) ∩ (A ∪ C)

Therefore, A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C).
 3

4. By writing down the negation of the statement

“∀x ∈ R, ∃y ∈ R, x2 + y 2 = 1”
prove that the statement is false.
Solution:
The negation of the statement is “∃x ∈ R, ∀y ∈ R, x2 + y 2 6= 1”.
Take x = 2. Then ∀y ∈ R, x2 + y 2 = y 2 + 4 > 1.
Since the negation of the statement is true, the statement is false.
5. Let R be the relation on R defined as
a ∼ b if |a − b| < 2
Determine if R is reflexive, symmetric, transitive.
Solution:
∀a ∈ R, |a − a| = 0 < 2.
Therefore, ∀a ∈ R, a ∼ a, and R is reflexive.
∀a, b ∈ R, |a − b| < 2 ⇒ |b − a| = |a − b| < 2.
Therefore, ∀a, b ∈ R, a ∼ b ⇒ b ∼ a, and R is symmetric.
|2 − 1| = 1 < 2, |1 − 0| = 1 < 2 and |2 − 0| = 2.
Therefore, R is not transitive because 2 ∼ 1, 1 ∼ 0 but 2  0.
6. Let R be the relation on Z defined as
a ∼ b if a + b is even
Show that R is an equivalence relation and write down the equivalence classes.
Solution:
∀a ∈ Z, a + a = 2a is even.
Therefore, ∀a ∈ Z, a ∼ a, and R is reflexive.
∀a, b ∈ Z, a + b is even ⇒ b + a = a + b is even.
Therefore, ∀a, b ∈ Z, a ∼ b ⇒ b ∼ a, and R is symmetric.
For any a, b, c ∈ Z,
a ∼ b, b ∼ c
=⇒ a + b, b + c are even
=⇒ a + b = 2d, b + c = 2d0 for some d, d0 ∈ Z
=⇒ a + c = (a + b) + (b + c) − 2b = 2(d + d0 − b)
Thus, a ∼ c and R is transitive. Since R is reflexive, symmetric and transitive, R is
an equivalence relation.
The equivalence classes are
[0] = {a ∈ Z | 0 + a is even} = {even numbers}
[1] = {a ∈ Z | 1 + a is even} = {odd numbers}
 4

7. For each of the following functions, write down its domain, codomain, range and
the corresponding relation R.
(No justification is needed)

(a)
f : {1, 2, 3, 4} → {1, 2, 3, 4} where f (x) = 5 − x
(b)
f : {0, 1, 2} → {0, 1, 2} where f (x) = |x − 1|
(c) (
2x if x ≤ 0
f :R→R where f (x) =
1 − x if x > 0

Solution:

(a) The domain and codomain are both {1, 2, 3, 4}. The range is {1, 2, 3, 4} and
the corresponding relation is

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

(b) The domain and codomain are both {0, 1, 2}. The range is {0, 1} and the
corresponding relation is

R = {(0, 1), (1, 0), (2, 1)}.

(c) The domain and codomain are both R. The range is (−∞, 1] and the corre-
sponding relation is

R = {(x, 2x ) ∈ R2 | x ≤ 0} ∪ {(x, 1 − x) ∈ R2 | x > 0}.

8. Let R be the relation on R defined as

x ∼ y if 3x2 + 2y 2 = 1

Show that R does not define a function.

Solution:
Take x = 0. Notice that
 1 2 1
2
3(0) + 2 √ = 1 ⇒ 0 ∼ √ = y1
2 2
 1 2 1
3(0)2 + 2 − √ = 1 ⇒ 0 ∼ − √ = y2
2 2

Since x ∼ y1 , x ∼ y2 and y1 6= y2 , R does not define a function.

 5

9. For each of the following functions, determine if it is injective, surjective and bijec-
tive.

(a)
f :Z→Z where f (x) = 2x + 1
(b)
f :R→R where f (x) = 2x + 1
(c) 
x 3 if x ≤ 0
f :R→R where f (x) = 1
 if x > 0
x
Solution:

(a) Let x1 , x2 ∈ Z. Then

f (x1 ) = f (x2 ) ⇒ 2x1 + 1 = 2x2 + 1 ⇒ x1 = x2 .

Thus, f is injective.
If f (x) = 0, then x = − 12 ∈
/ Z. So, f is not surjective.
Hence, f is not bijective.
(b) Let x1 , x2 ∈ R. Then

f (x1 ) = f (x2 ) ⇒ 2x1 + 1 = 2x2 + 1 ⇒ x1 = x2 .

Thus, f is injective.
y−1
For any y ∈ R, take x = ∈ R ⇒ f (x) = y. So, f is surjective.
2
Hence, f is bijective.
(c) Let x1 , x2 ∈ R.
If x1 , x2 ≤ 0, then
q q
f (x1 ) = f (x2 ) ⇒ x31 = x32 ⇒ x1 = 3
x31 = 3 x32 = x2 .

If x1 , x2 > 0, then
1 1
f (x1 ) = f (x2 ) ⇒ = ⇒ x2 = x1 .
x1 x2

If x1 ≤ 0, x2 > 0, then
1
f (x1 ) = f (x2 ) ⇒ 0 ≥ x31 = > 0 (contradiction).
x2

If x1 > 0, x2 ≤ 0, then, by symmetry, it is also impossible.

So, f is injective.
 6

For any y ∈ R,
√ √
if y ≤ 0, then take x = 3 y ≤ 0 ⇒ f (x) = ( 3 y)3 = y.
1 1
If y > 0, then take x = > 0 ⇒ f (x) = 1 = y.
y (y)
Thus, f is surjective.
Hence, f is bijective.

10. (a) Let R be the relation on Z defined as

a ∼ b if a2 + b2 is even

Determine if R is reflexive, transitive.

(b) Show that the function

f : [0, ∞) → R where f (x) = x2 + x

is injective.
(c) Show that the function

f : (0, ∞) → R where f (x) = 1 + ln x

is surjective.
Solution:

(a) ∀ a ∈ Z,
a2 + a2 = 2a2 is even =⇒ a ∼ a
So, R is reflexive.

∀ a, b, c ∈ Z,

a ∼ b, b ∼ c
=⇒ a2 + b2 , b2 + c2 are even
=⇒ ∃ d, e ∈ Z, a2 + b2 = 2d, b2 + c2 = 2e
=⇒ a2 + c2 = (a2 + b2 ) + (b2 + c2 ) − 2b2 = 2d + 2e − 2b2 = 2(d + e − b2 ) is even
=⇒ a ∼ c

So, R is transitive.
(b) ∀x1 , x2 ∈ [0, ∞),

f (x1 ) = f (x2 ) =⇒ x21 + x1 = x22 + x2

=⇒ x21 − x22 + x1 − x2 = 0
=⇒ (x1 − x2 )(x1 + x2 + 1) = 0
=⇒ x1 = x2 (because x1 + x2 + 1 > 0)

So, f is injective.
 7

(c) ∀ y ∈ R, take x = ey−1 ∈ (0, ∞). Then,

f (x) = 1 + ln(ey−1 ) = 1 + y − 1 = y
So, f is surjective.

11. (a) Let R be the relation on R defined as

a ∼ b if a2 + b2 < 2
Determine if R is reflexive, symmetric, transitive.
(b) Let R be the relation on Z defined as
a ∼ b if a − b is a multiple of 3
Show that R is an equivalence relation and write down the equivalence classes.
Solution:

(a) 12 + 12 = 2 6< 2 =⇒ 1  1.
Therefore, R is not reflexive.

∀a, b ∈ R, a ∼ b =⇒ a2 + b2 < 2 =⇒ b2 + a2 < 2 =⇒ b ∼ a.

Therefore, R is symmetric.

(−1)2 + 02 = 1 < 2, 02 + 12 = 1 < 2 and (−1)2 + 12 = 2 6< 2. Thus, −1 ∼ 0,

0 ∼ 1 but −1  1.
Therefore, R is not transitive.
(b) ∀a ∈ Z, a − a = 0 = 3(0) =⇒ a ∼ a.
Therefore, R is reflexive.

∀a, b ∈ Z, a ∼ b =⇒ ∃n ∈ Z, a − b = 3n =⇒ b − a = −3n = 3(−n)

=⇒ b ∼ a.
Therefore, R is symmetric.

For any a, b, c ∈ Z,
a ∼ b, b ∼ c
=⇒ ∃n, m ∈ Z, a − b = 3n, b − c = 3m
=⇒ a − c = (a − b) + (b − c) = 3n + 3m = 3(n + m)
=⇒ a∼c
Therefore, R is transitive.
Since R is reflexive, symmetric and transitive, R is an equivalence relation.
The equivalence classes are
[0] = {a ∈ Z | a − 0 is a multiple of 3}
[1] = {a ∈ Z | a − 1 is a multiple of 3}
[2] = {a ∈ Z | a − 2 is a multiple of 3}
 8

12. (a) For the function

f : {1, 2, 3, 4} → {0, 1, 2, 3, 4} where f (x) = |x − 2| + 1
write down its domain, codomain, range and the corresponding relation R.
(No justification is needed)
(b) For the function
(
x if x ≤ 0
f : R → R where f (x) = 2
x + 1 if x > 0
Show that f is injective.
(c) For the function
(
x + 1 if x ≤ 0
f :R→R where f (x) =
x2 if x > 0
Show that f is surjective.
Solution:

(a) The domain is {1, 2, 3, 4} and the codomain is {0, 1, 2, 3, 4}. The range is
{1, 2, 3} and the corresponding relation is
R = {(1, 2), (2, 1), (3, 2), (4, 3)}.
(b) For any x1 , x2 ∈ R,
If x1 , x2 ≤ 0, then
f (x1 ) = f (x2 ) =⇒ x1 = x2 .
If x1 , x2 > 0, then
f (x1 ) = f (x2 )
=⇒ x21 + 1 = x22 + 1
=⇒ (x1 − x2 )(x1 + x2 ) = 0
=⇒ x1 = x2 (because x1 + x2 > 0)
If x1 ≤ 0, x2 > 0, then
f (x1 ) = f (x2 ) =⇒ 0 ≥ x1 = x22 + 1 > 1 (contradiction).
If x1 > 0, x2 ≤ 0, then
f (x1 ) = f (x2 ) =⇒ 1 < x21 + 1 = x2 ≤ 0 (contradiction).
Hence, f is injective.
(c) For any y ∈ R,
If y ≤ 0, take x = y − 1 ≤ −1. Then,
f (x) = x + 1 = (y − 1) + 1 = y
√
If y > 0, take x = y > 0. Then,
√
f (x) = x2 = ( y)2 = y
Hence, f is surjective.