ECON2174 Mathematics for Economists
Problem Set 2 Solution
1. Since R is complete, ∀x, y, either xRy or yRx. Let y = x, we have xRx, which means R is
reflexive.
2. (a) Reflexivity:
For any HKUST student, he/she must born in the same month as themselves. Hence,
R is reflexive.
(b) Symmetry:
Suppose a HKUST student x born in month A. Then, xRy implies student y also born
in month A. As a result, students y and x born in the same month and we have yRx.
Hence, R is symmetric.
(c) Transitivity:
Suppose a HKUST student x born in month A. Then xRy implies student y also born in
month A. Similarly, yRz implies student z also born in month A. As a result, students
x and z born in the same month and we have xRz. Hence, R is transitive.
Altogether, we have R to be a equivalence relation.
3. (a) Reflexivity:
∀X ∈ P(S), any element in X is also included in X. Hence, we have X ⊂ X and ⊂ is
reflexive.
(b) Anti-Symmetry:
∀X, Y ∈ P(S), suppose we have X ⊂ Y and Y ⊂ X, this implies any element in X would
be included in Y and any element in Y would be included in X. X and Y therefore
contains identical elements. Hence, X = Y and ⊂ is anti-symmetric.
(c) Transitivity:
∀X, Y, Z ∈ P(S), suppose we have X ⊂ Y and Y ⊂ Z. This implies any element in X
would also be included in Y and any element in Y would also be included in Z. Together,
any element in X would be included in Z. Hence, we have X ⊂ Z and ⊂ is transitive.
Altogether, we have ⊂ to be a partial order.
However, ⊂ is not complete if |S| ≥ 2. Suppose x, y ∈ S, then {x} and {y} belongs to
P(S) and neither {x} ⊂ {y} nor {y} ⊂ {x}. Hence, in general, ⊂ is not a total order.
4. We want to define a function f : S → R to represent the ranking of R. Suppose |S| = N .
Note that R is a total order on a finite set S, therefore there exists x̄ ∈ S such that x̄Ry,
∀y ∈ S. We first assign f (x̄) = N . Next, consider the set S ′ := S \ {x̄}, note that R is still
a total order on S ′ . Hence, there exists x̄′ ∈ S ′ such that x̄′ Ry, ∀y ∈ S ′ . We then assign
f (x̄′ ) = N − 1. The process go on and on until the last element. We then check that this f
indeed represents the ranking.
(a) Suppose f (x) ≥ f (y), then x was selected before y if they were not equal. Since x was
selected before y, that means x was the ‘max’ in terms of R inside a set which included
y. Hence, we have xRy.
(b) Suppose xRy. We know that when y was selected, it was the ‘max’ of all the remaining
elements. By transitivity of R, x is also the ‘max’ among those elements. That means
the set that y is the ‘max’ is a subset that x is the ‘max’. According to our construction
of f , we have f (x) ≥ f (y).
5. We wish to show that the sequence converges to 0.
1
∀ϵ > 0, take n = , i > n
ϵ
1
=⇒ |xi − 0| = −0 <ϵ
i
Hence, xi → 0.
6. Suppose xi → L, ∀ϵ > 0, ∃n ∈ N, i > n
=⇒ |xi − L| = |i − L| < ϵ
Take ϵ = 1, for some n, i > n
=⇒ L − 1 < i < L + 1
Note that L + 1 is a constant, when i > L + 1, we have i out of this bounded range. No
matter which n we chooses, we would eventually have i > L + 1. Hence, which contradicts to
the assumption to xi converging to some L. As a result, xi does not converge.
ϵ
7. Since xi → x, ∀ϵ > 0, ∃nx ∈ N, i > nx =⇒ |xi − x| < .
2|y|
ϵ
Since yi → y, ∀ϵ > 0, ∃ny ∈ N, i > ny =⇒ |yi − y| < .
2(|x| + 1)
Also, note that if we take ϵ = 1, ∃n1 ∈ N, i > n1 =⇒ x − 1 < xi < x + 1
Now, ∀ϵ > 0, take n = max{nx , ny , n1 }, i > n
=⇒ |xi yi − xy| = |xi (yi − y) + y(xi − x)|
≤ |xi ||yi − y| + |y||xi − x|
ϵ ϵ
< (|x| + 1) + |y|
2(|x| + 1) 2|y|
=ϵ
Hence, xi yi → xy.
8. Suppose {x} is open, then there exists an ϵ > 0, where Bϵ (x) ⊂ {x}. Now consider a positive
real number smaller than ϵ, say ϵ/2. (x1 + ϵ/2, x2 , ..., xn ) ∈ Bϵ (x) ̸= x. Hence, it is not in the
set {x}. This contradicts that Bϵ (x) ⊂ {x}. Hence, {x} is not open.
9. Take ϵ = min{x1 − a, b − x1 , x2 − c, d − x2 }, then Bϵ (x) ⊂ (a, b) × (c, d), ∀x ∈ (a, b) × (c, d)
since it would be an inscribed circle in the rectangle with radius equals to the distance from
x to the nearest edge of the rectangle. Hence, (a, b) × (c, d) is open.
