NICHOLAS PIERCE

UNIVERSITY OF ROCHESTER
MTH 240: Topology – Homework #2
Section 2 – 2, 4, 5; Section 3 – 1, 3, 4, 13, 15

SECTION 2

Problem 2. Let 𝑓: 𝐴 → 𝐵 and let 𝐴𝑖 ⊂ 𝐴 and 𝐵𝑖 ⊂ 𝐵 for 𝑖 = 0 and 𝑖 = 1. Show that 𝑓 −1 preserves
inclusions, unions, and differences of sets (claims omitted to save space).

(a) Proof: Suppose 𝐵0 ⊂ 𝐵1 . Then we have 𝑎 ∈ 𝑓 −1 (𝐵0 ) ⇒ 𝑓(𝑎) ∈ 𝐵0 . So, 𝑓(𝑎) ∈ 𝐵1 , since 𝐵0 ⊂ 𝐵1 .
Finally, 𝑎 ∈ 𝑓 −1 (𝐵1 ). Therefore 𝑎 ∈ 𝑓 −1 (𝐵0 ) ⇒ 𝑎 ∈ 𝑓 −1 (𝐵1 ) and hence 𝐵0 ⊂ 𝐵1 ⇒ 𝑓 −1 (𝐵0 ) ⊂ 𝑓 −1 (𝐵1 ).
■

(b) Proof: (⟹) Let 𝑎 ∈ 𝑓 −1 (𝐵0 ∪ 𝐵1 ) such that 𝑓(𝑎) ∈ 𝐵0 ∪ 𝐵1 . This must mean that 𝑓(𝑎) ∈ 𝐵0 or
𝑓(𝑎) ∈ 𝐵1 . Thus we have that if 𝑓(𝑎) ∈ 𝐵0 then 𝑎 ∈ 𝑓 −1 (𝐵0 ). Likewise, if 𝑓(𝑎) ∈ 𝐵1 then 𝑎 ∈ 𝑓 −1 (𝐵1 ).
Thus, as 𝑎 lives in either one of the two preimages, we have that 𝑎 ∈ 𝑓 −1 (𝐵0 ) ∪ 𝑓 −1 (𝐵1 ) and
𝑓 −1 (𝐵0 ∪ 𝐵1 ) ⊆ 𝑓 −1 (𝐵0 ) ∪ 𝑓 −1 (𝐵1 ). (⟸) Now, let 𝑎 ∈ 𝑓 −1 (𝐵0 ) ∪ 𝑓 −1 (𝐵1 ). Thus, we must have that
𝑎 ∈ 𝑓 −1 (𝐵0 ) which implies that 𝑓(𝑎) ∈ 𝐵0 , or that 𝑎 ∈ 𝑓 −1 (𝐵1 ) such that 𝑓(𝑎) ∈ 𝐵1 . This means that
in either case, 𝑓(𝑎) ∈ 𝐵0 ∪ 𝐵1 . Thus, 𝑎 ∈ 𝑓 −1 (𝐵0 ∪ 𝐵1 ) and 𝑓 −1 (𝐵0 ) ∪ 𝑓 −1 (𝐵1 ) ⊆ 𝑓 −1 (𝐵0 ∪ 𝐵1 ). ■

Proof: (⟹) Let 𝑎 ∈ 𝑓 −1 (𝐵0 ∩ 𝐵2 ) such that 𝑓(𝑎) ∈ 𝐵0 ∩ 𝐵1 . We have that, by definition, 𝑓(𝑎) ∈
(c) Proof:
𝐵0 and 𝑓(𝑎) ∈ 𝐵1 . So, 𝑎 ∈ 𝑓 −1 (𝐵0 ) and 𝑎 ∈ 𝑓 −1 (𝐵1 ). This must mean that 𝑎 ∈ 𝑓 −1 (𝐵0 ) ∩ 𝑓(𝐵1 ), thus
𝑓 −1 (𝐴 ∩ 𝐵) ⊆ 𝑓 −1 (𝐴) ∩ 𝑓 −1 (𝐵). (⟸) Now, let 𝑎 ∈ 𝑓 −1 (𝐵0 ) ∩ 𝑓 −1 (𝐵1 ). So, 𝑎 ∈ 𝑓 −1 (𝐵0 ) and 𝑎 ∈
𝑓 −1 (𝐵1 ). Then 𝑓(𝑎) ∈ 𝐵0 and 𝑓(𝑎) ∈ 𝐵1 . Therefore, 𝑓(𝑎) ∈ 𝐵0 ∩ 𝐵1 such that 𝑎 ∈ 𝑓 −1 (𝐵0 ∩ 𝐵1 ) and
𝑓 −1 (𝐵0 ) ∩ 𝑓 −1 (𝐵1 ) ⊆ 𝑓 −1 (𝐵0 ∩ 𝐵1 ). ■

(d) Proof: (⟹) Let 𝑎 ∈ 𝑓 −1 (𝐵0 − 𝐵1 ) such that 𝑓(𝑎) ∈ 𝐵0 − 𝐵1 . This means that 𝑓(𝑎) ∈ 𝐵0 but
𝑓(𝑎) ∉ 𝐵1 . So, 𝑎 ∈ 𝑓 −1 (𝐵0 ) but 𝑎 ∉ 𝑓 −1 (𝐵1 ). Thus, we have that 𝑎 ∈ 𝑓 −1 (𝐵0 ) ∩ 𝑎 ∉ 𝑓 −1 (𝐵1 ) ⇒ 𝑎 ∈
𝑓 −1 (𝐵0 ) − 𝑓 −1 (𝐵1 ) and 𝑓 −1 (𝐵0 − 𝐵1 ) ⊆ 𝑓 −1 (𝐵0 ) − 𝑓 −1 (𝐵1 ). (⟸) 𝑎 ∈ 𝑓 −1 (𝐵0 ) − 𝑓 −1 (𝐵1 ). 𝑎 must be
contained strictly in 𝑓 −1 (𝐵0 ) and so 𝑓(𝑎) must also be contained strictly in 𝐵0 . That is, we have 𝑓(𝑎) ∈
𝐵0 ∩ 𝑓(𝑎) ∉ 𝐵1 ⇒ 𝑓(𝑎) ∈ 𝐵0 − 𝐵1 . Therefore, 𝑎 ∈ 𝑓 −1 (𝐵0 − 𝐵1 ) and 𝑓 −1 (𝐵0 ) − 𝑓 −1 (𝐵1 ) ⊆
𝑓 −1 (𝐵0 − 𝐵1 ). ■

Proof: Suppose that 𝐴0 ⊂ 𝐴1 and consider 𝑏 ∈ 𝑓(𝐴0 ). Thus, ∃𝑎 ∈ 𝐴0 such that 𝑓(𝑎) = 𝑏. Moreover,
(e) Proof:
since 𝐴0 ⊂ 𝐴1 , 𝑎 ∈ 𝐴1 so it follows that 𝑏 = 𝑓(𝑎) ∈ 𝐴1 . Thus, we have that 𝑓(𝐴0 ) ⊂ 𝑓(𝐴1 ). ■

(f) Proof: (⟹) From e, we already have that 𝑓(𝐴𝑖 ) ⊂ 𝑓(𝐴0 ∪ 𝐴1 ) ⇒ 𝑓(𝐴0 ∪ 𝐴1 ) ⊆ 𝑓(𝐴0 ) ∪ 𝑓(𝐴1 ).
(⟸) Suppose 𝑏 ∈ 𝑓(𝐴0 ∪ 𝐴1 ). So, ∃𝑎(𝑎 ∈ 𝐴0 ∪ 𝐴1 ) such that 𝑓(𝑎) = 𝑏 which implies ∃𝑎 ∈ 𝐴0 such
that 𝑓(𝑏) = 𝑎 or ∃𝑎 ∈ 𝐴1 such that 𝑓(𝑎) = 𝑏. Thus, we have 𝑏 ∈ 𝑓(𝐴0 ) ∪ 𝑓(𝐴1 ) ⊆ 𝑓(𝐴0 ∪ 𝐴1 ). ■
(g) Proof: Consider any 𝑏 ∈ 𝑓(𝐴0 ∩ 𝐴0 ). We then have 𝑎 ∈ 𝐴0 ∩ 𝐴1 : 𝑏 = 𝑓(𝑎); hence, 𝑎 ∈ 𝐴0 ∩ 𝑎 ∈ 𝐴1 .
Now, we know that since 𝑏 = 𝑓(𝑎), 𝑏 ∈ 𝑓(𝐴0 ) ∩ 𝑏 ∈ 𝑓(𝐴1 ). Thus, 𝑏 ∈ 𝑓(𝐴0 ) ∩ 𝑓(𝐴1 ). We suppose that
𝑓 is injective and consider 𝑏 ∈ 𝑓(𝐴0 ) ∩ 𝑓(𝐴1 ). So, 𝑏 ∈ 𝑓(𝐴0 ) and 𝑏 ∈ 𝑓(𝐴1 ) from which we have that
∃𝑎0 ∈ 𝐴0 ⇒ 𝑓(𝑎0 ) = 𝑏 and ∃𝑎1 ∈ 𝐴1 ⇒ 𝑓(𝑎1 ) = 𝑏. Since we then have 𝑓(𝑎0 ) = 𝑓(𝑎1 ) = 𝑏 which implies
that 𝑎0 = 𝑎1 , 𝑓 is invective. Hence, 𝑎0 ∈ 𝐴0 and 𝑎0 = 𝑎1 ∈ 𝐴1 so that 𝑎0 ∈ 𝐴0 ∩ 𝐴1 . Moreover, 𝑏 =
𝑓(𝑎0 ), which shows that by definition 𝑏 ∈ 𝑓(𝐴0 ∩ 𝐴1 ). Thus, 𝑓(𝐴0 ) ∩ 𝑓(𝐴1 ) ⊂ (𝑓(𝐴0 ∩ 𝐴1 ) since 𝑏 was
arbitrary and demonstrates the desired equivalence (we already showed the opposite direction). ■

(h) Proof: Consider any 𝑏 ∈ 𝑓(𝐴0 ) − 𝑓(𝐴1 ) ⇒ 𝑏 ∈ 𝑓(𝐴0 ) ∩ 𝑏 ∉ 𝑓(𝐴1 ). Thus, ∃𝑎 ∈ 𝐴0 : 𝑓(𝑎) = 𝑏 which
implies that 𝑎 ∉ 𝐴1 . Clearly, 𝑏 ∈ 𝑓(𝐴0 − 𝐴1 ) as there is no 𝑎′ ∈ 𝐴1 : 𝑏 = 𝑓(𝑎′). In particular, since 𝑏 =
𝑓(𝑎), 𝑎 ∉ 𝐴1 . Hence 𝑎 ∈ 𝐴0 − 𝐴1 and 𝑏 ∈ 𝑓(𝐴0 − 𝐴1 ). Now we suppose that 𝑓 is invective and consider
any 𝑏 ∈ 𝑓(𝐴0 − 𝐴1 ). Then ∃𝑎 ∈ 𝐴0 − 𝐴1 , with 𝑏 = 𝑓(𝑎). However, while 𝑎 ∈ 𝐴0 , 𝑎 ∉ 𝐴1 . It then
follows that 𝑏 ∈ 𝑓(𝐴0 ) since 𝑏 = 𝑓(𝑎) and 𝑎 ∈ 𝐴0 . Suppose we were to consider, WLOG, some 𝑎′ ∈ 𝐴1 .
We can’t have 𝑏 = 𝑓(𝑎′ ) since this would invalidate injection, i.e., 𝑓(𝑎′ ) = 𝑓(𝑎) = 𝑏 ⇒ 𝑎 = 𝑎′ (by
definition of injection). In particular, we’d have a contradiction with 𝑎 = 𝑎′ ∉ 𝐴1 . So, it must be the
case that ∄𝑎′ ∈ 𝐴1 where 𝑏 = 𝑓(𝑎′ ), which is sufficient to show that 𝑏 ∉ 𝑓(𝐴1 ). Therefore, 𝑏 ∈ 𝑓(𝐴0 ) −
𝑓(𝐴1 ) so that 𝑓(𝐴0 − 𝐴1 ) ⊂ 𝑓(𝐴0 ) − 𝑓(𝐴1 ). ■

4. Let 𝑓 ∶ 𝐴 → 𝐵 and 𝑔 ∶ 𝐵 → 𝐶.
Problem 4.

roof: Consider any 𝑥. Then, it is simple to prove the claim as follows: 𝑥 ∈ (𝑔 ∘ 𝑓)−1 (𝐶0 ) ⇒
(a) Proof:
(𝑔 ∘ 𝑓)(𝑥) ∈ 𝐶0 . Thus, we have by definition 𝑔(𝑓(𝑥)) ∈ 𝐶0 ⇒ 𝑓(𝑥) ∈ 𝑔 −1 (𝐶0 ). Therefore, 𝑥 ∈
𝑓 −1 (𝑔 −1 (𝐶0 )). ■

(b) Proof: First, suppose that 𝑥, 𝑦 ∈ 𝐴, 𝑥 ≠ 𝑦. It’s given that 𝑓 is injective, so 𝑓(𝑥) ≠ 𝑓(𝑦) (this is the
contrapositive definition of injection). So, we have that (𝑔 ∘ 𝑓)(𝑥) = 𝑔(𝑓(𝑥)) ≠ 𝑔(𝑓(𝑦)) = (𝑔 ∘ 𝑓)(𝑦) as
𝑓(𝑥) ≠ 𝑓(𝑦) and 𝑔 is injective. Thus, we’ve shown that 𝑔 ∘ 𝑓 is injective. ■

(c) Claim: We claim that if 𝑔 ∘ 𝑓 is injective, then 𝑓 must be injective but not necessarily 𝑔.
Proof: Suppose that 𝑔 ∘ 𝑓 is injective, but 𝑓 is not. If this is the case, ∃(𝑥, 𝑦) ∈ 𝐴 where 𝑥 ≠ 𝑦 but
𝑓(𝑥) = 𝑓(𝑦). We have (𝑔 ∘ 𝑓)(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(𝑓(𝑦)) = (𝑔 ∘ 𝑓)(𝑦),which yields a contradiction as 𝑔 ∘ 𝑓
is injective since 𝑥 ≠ 𝑦. Therefore, 𝑓 indeed must be injective, but 𝑔 needn’t be. ■

(d) Proof: suppose that 𝑓 and 𝑔 are surjective, and WLOG, consider any element 𝑐 ∈ 𝐶. Then there is
a 𝑏 ∈ 𝐵, where 𝑐 = 𝑔(𝑏) since 𝑔 is surjective. Moreover, since 𝑓 is surjective: ∃𝑎 ∈ 𝐴 where 𝑏 = 𝑓(𝑎).
We finally get that (𝑔 ∘ 𝑓)(𝑎) = 𝑔(𝑓(𝑎)) = 𝑔(𝑏) = 𝑐, which shows that 𝑔 ∘ 𝑓 is surjective. ■

(e) Proof: Consider 𝑔 ∘ 𝑓 is surjective and consider any 𝑐 ∈ 𝐶 so that there is a 𝑎 ∈ 𝐴 where
(𝑔 ∘ 𝑓)(𝑎) = 𝑐. Immediately, we have that 𝑎 ∈ 𝐴 where (𝑔 ∘ 𝑓)(𝑎) = 𝑐. Moreover, 𝑔(𝑓(𝑎)) = 𝑐 ∶ 𝑏 =
𝑓(𝑎) ∈ 𝐵 where 𝑔(𝑏) = 𝑐 (by definition of composition). Thus, we have that 𝑔 ∘ 𝑓 is surjective as
desired. ■
 Theorem. Suppose that 𝑓 ∶ 𝐴 → 𝐵 and 𝑔 ∶ 𝐵 → 𝐶. We have the following properties:
(f) Theorem.

(1) If 𝑓 and 𝑔 are injective, then 𝑔 ∘ 𝑓 is injective.

(2) If 𝑔 ∘ 𝑓 is injective, then 𝑓 is also injective but 𝑔 need not be.

(3) If 𝑓 and 𝑔 are surjective, then 𝑔 ∘ 𝑓 is surjective.

(4) If 𝑔 ∘ 𝑓 is surjective, then 𝑔 is also surjective.

Problem
Problem 5. Stated in the text.

Proof: We’re given that 𝑓 has a left inverse, 𝑔 ∶ 𝐵 → 𝐴 | 𝑔 ∘ 𝑓 = 𝑖𝐴 . By definition of injection

(a) Proof:
consider some 𝑥, 𝑦 ∈ 𝐴 such that 𝑓(𝑥) = 𝑓(𝑦). By definition of the identity function, we have that
𝑥 = 𝑖𝐴 (𝑥) = (𝑔 ∘ 𝑓)(𝑥) = 𝑔(𝑓(𝑥)) = 𝑔(𝑓(𝑦)) = (𝑔 ∘ 𝑓)(𝑦) = 𝑖𝐴 (𝑦) = 𝑦,
which shows that 𝑓 is injective. Now, suppose that 𝑓 has a right inverse, ℎ ∶ 𝐵 → 𝐴 | 𝑓 ∘ 𝑔 = 𝑖𝐵 .
Consider any 𝑦 ∈ 𝐵 so that
𝑦 = 𝑖𝐵 (𝑦) = (𝑓 ∘ ℎ)(𝑦) = 𝑓(ℎ(𝑦)),
so 𝑥 = ℎ(𝑦) ∈ 𝐴 such that 𝑓(𝑥) = 𝑦, which shows that 𝑓 must be surjective. ■

Proof: Consider that 𝑓 has a left inverse 𝑔 and a right inverse ℎ. We have then that 𝑓 must be both
(e) Proof:
injective and surjective, because it has left and right inverses, respectively. This implies that 𝑓 is
bijective by definition. This also implies that the inverse 𝑓 −1 ∶ 𝐵 → 𝐴 exists. So, we consider 𝑦 ∈ 𝐵 and
let 𝑥 = 𝑓 −1 (𝑦) ⇒ 𝑦 = 𝑓(𝑥). Thus, we have 𝑔(𝑦) = 𝑔(𝑓(𝑥)) = (𝑔 ∘ 𝑓)(𝑥) = 𝑖𝐴 (𝑥) = 𝑥. Moreover, we have
that 𝑓(ℎ(𝑦)) = (𝑓 ∘ ℎ)(𝑦) = 𝑖𝐵 (𝑦) = 𝑦 ⇒ ℎ(𝑦) = 𝑓 −1 (𝑓(ℎ(𝑦)) = 𝑓 −1 (𝑦) = 𝑥. Thus, we’ve shown that
𝑥 = 𝑓 −1 (𝑦) = 𝑔(𝑦) = ℎ(𝑦) ⇒ 𝑓 −1 = 𝑔 = ℎ. ■

SECTION 3

Problem 1.
roof: Suppose that (𝑥0 , 𝑦0 ), (𝑥1 , 𝑦1 ), and (𝑥2 , 𝑦2 ) are all points in the plane.
Proof:
(Reflexivity) Clearly, we have that 𝑦0 − 𝑥20 = 𝑦0 − 𝑥20 , hence (𝑥0 , 𝑦0 ) ~ (𝑥0 , 𝑦0 ).

(Symmetry) Suppose that (𝑥0 , 𝑦0 ) ~ (𝑥1 , 𝑦1 ). Since we have 𝑦0 − 𝑥20 = 𝑦1 − 𝑥21 , it is implied that 𝑦1 −
𝑥21 = 𝑦2 − 𝑥22 . Since we have equality numerically, which is indeed symmetric, (𝑥1 , 𝑦1 ) ~ (𝑥0 , 𝑦0 ).

(Transitivity) Suppose that (𝑥0 , 𝑦0 ) ~ (𝑥1 , 𝑦1 ) and (𝑥1 , 𝑦1 ) ~ (𝑥2 , 𝑦2 ). Then, 𝑦0 − 𝑥20 = 𝑦1 − 𝑥21 and 𝑦1 −
𝑥21 = 𝑦2 − 𝑥22 , such that we have 𝑦0 − 𝑥20 = 𝑦2 − 𝑥22 . Therefore we have transitivity with
(𝑥0 , 𝑦0 ) ~ (𝑥2 , 𝑦2 ). ■

Problem 3.
Let 𝐶 be a relation on set 𝐴. Now, while this argument holds for any 𝑎, 𝑏 ∈ 𝐴 so that 𝑎𝐶𝑏 ⇒ 𝑎𝐶𝑎 (and
similarly for 𝑏𝐶𝑏). But reflexivity, by definition, requires that 𝑎𝐶𝑎 holds for every 𝑎 ∈ 𝐴. Thus, if there
is no 𝑏 ∈ 𝐴 such that 𝑎𝐶𝑏 holds, then the proposition does not hold and we fail to conclude that 𝑎𝐶𝑎.
Indeed, the element 𝑎 is not even involved in the relation. ■

Problem 4.
4.
(a) Proof: We demonstrate the three properties necessary for ~ to be an equivalence relation in this
particular case.
(Reflexivity) For any 𝑎 ∈ 𝐴, we have that 𝑓(𝑎) = 𝑓(𝑎) since 𝑓 is a function. Hence, 𝑎 ~ 𝑎 such that ~ is
reflexive.

(Symmetry) Let 𝑎, 𝑏 ∈ 𝐴 and suppose that 𝑎 ~ 𝑏. By definition, 𝑓(𝑎) = 𝑓(𝑏) which is obviously the same
as 𝑓(𝑏) = 𝑓(𝑎). So, 𝑏 ~ 𝑎 such that ~ is symmetric.

(Transitivity). Let 𝑎, 𝑏, 𝑐 ∈ 𝐴 and suppose that 𝑎 ~ 𝑏 and 𝑏 ~ c. Thus, we have that, by definition,
𝑓(𝑎) = 𝑓(𝑏) and 𝑓(𝑏) = 𝑓(𝑐) so that 𝑓(𝑎) = 𝑓(𝑏) = 𝑓(𝑐) and thus 𝑎 ~ 𝑐. Therefore ~ is transitive. ■

(b) Proof: Define the function 𝑔 ∶ 𝐴∗ → 𝐵. For any equivalence class 𝐶 ∈ 𝐴∗ , 𝐶 ≠ ∅ since 𝐴∗ ≤ 𝐴. So
we have that ∃𝑎 ∈ 𝐶 so that 𝑔(𝐶) = 𝑓(𝑎). We note that 𝑔(𝐶) = 𝑓(𝑎) ∈ 𝐵 ⇒ 𝐵 is the range of 𝑔.
jection): consider two equivalence classes 𝐶, 𝐷 where 𝑔(𝐶) = 𝑔(𝐷). Then we must have elements
(Injection)
(Injection):
𝑐 ∈ 𝐶 and 𝑑 ∈ 𝐷 such that 𝑓(𝑐) = 𝑔(𝐶) = 𝑔(𝐷) = 𝑓(𝑑). This proves that 𝑐 ~ 𝑑 so that they’re in the
same equivalence class. Therefore 𝑑 ∈ 𝐶 since 𝑐 ∈ 𝐶 and 𝑑 ∈ 𝐷 such that 𝐶 ∩ 𝐷 ≠ ∅. Thus, 𝐶 = 𝐷,
proving that 𝑔 is injective.

(Surjection): Consider some 𝑏 ∈ 𝐵. Since we’re given that 𝑓 is surjective, ∃𝑎 ∈ 𝐴 | 𝑓(𝑎) = 𝑏. Since we
have that 𝐴∗ is a partition, 𝑎 must belong to an equivalence class 𝐶 ∈ 𝐴∗ . Thus, ∃𝑐 ∈ 𝐶 ⇒ 𝑔(𝐶) =
𝑓(𝑐). Now, since 𝑎, 𝑐 ∈ 𝐶, we have that 𝑎 ~ 𝑐 ⇒ 𝑔(𝐶) = 𝑓(𝑐) = 𝑓(𝑎) = 𝑏. This verifies that 𝑔 is
surjective.

We have therefore shown that 𝑔 is both injective and surjective, which are the conditions for being a
bijection by definition. ■

Problem 13.
13. *LUB = least upper bound,
bound, GLB = greatest lower bound.
bound.

Proof: Suppose that 𝐴0 ≠ ∅ ⊂ 𝐴, that is bounded below such that 𝑏 ≤ 𝑥, ∀𝑥 ∈ 𝐴0 . Suppose that 𝐵0 is
this set of all lower bounds of 𝐴0 ⇒ 𝐵0 ≠ ∅ (since 𝑏 ∈ 𝐵0 ). Since 𝐴0 is also nonempty, we have that
∃𝑎 ∈ 𝐴0 . Then, for all 𝑥 ∈ 𝐵0 , we have that 𝑥 is a lower bound of 𝐴0 , i.e., 𝑥 ≤ 𝑎 which implies 𝑎 is an
upperbound for 𝐵0 . We therefore have that 𝐵0 is a nonempty subset of 𝐴 that is bounded above, and
contains a LUB 𝑧, since 𝐴 has LUBP. Now we show that 𝑧 is also the GLB of 𝐴0 .

Suppose 𝑥 ∈ 𝐴0 and 𝑦 ∈ 𝐵0 . Then 𝑦 is a lower bound of 𝐴 such that 𝑦 ≤ 𝑥 → 𝑥 ∈ 𝐴0 . Now, as 𝑦 ∈ 𝐵0 ,

we have that 𝑥 is an upper bound of 𝐵0 . Therefore, we determine that 𝑧 ≤ 𝑥 since 𝑧 is the LUB of 𝐵0 .
Moreover, we have that 𝑧 is a lower bound of 𝐴0 . Now, if 𝑦 is any lower bound, then 𝑦 ∈ 𝐵0 ∶ 𝑦 ≤ 𝑧 (as
𝑧 is an upper bound of 𝐵0 . We’ve shown that 𝑧 is the GLB of 𝐴0 . Therefore, 𝐴 also has the greatest
lower bound property. ■

Problem 15
15.
(a) Proof: Let 𝐴 = [0, 1] (or [0. 1)) and 𝐴0 ⊂ 𝐴 be bounded above in 𝐴 and be nonempty. We let 𝑏 ≥
𝑥 be the upper of bound of 𝐴0 such that 𝑏 ∈ [0, 1] (or [0, 1). As we showed earlier, 𝐴0 has a LUB 𝑧 ∈
𝐑, as 𝐴0 ≠ ∅ ⊂ 𝐑, bounded above. We have that 𝑧 ≤ 𝑐 since it is the least upper bound. Now, ∀𝑥 ∈
𝐴0 , 𝑥 ∈ 𝐴 ∶ 𝑥 ∈ [0, 1] (or [0, 1)) and also that 𝑧 ≤ 𝑥 since it is an upper bound for 𝐴0 . Therefore, 0 ≤
𝑥 ≤ 𝑧 ≤ 𝑏 ≤ 1 (or 0 ≤ 𝑥 ≤ 𝑧 ≤ 𝑏 < 1) and we have shown that for both sets given that 𝐴0 has a LUB
in 𝐴. ■

(b) Proof: Suppose that 𝐴 = 𝑋 × 𝑌 = [0, 1] × [0, 1] (or [0, 1) × [0,1]). Let 𝐵 be bounded above in 𝐴
and let 𝑆 be a set of all 𝑥 | 𝑥 × 𝑦 ∈ 𝐵. Since 𝐵 is bounded above in 𝐴, we have that 𝑆 is bounded
above in 𝑋, where 𝑠 is a LUB. If we have that 𝑠 ∉ 𝑆, there does not exist in 𝐵 with 𝑥 = 𝑠; however,
∀𝑡 < 𝑠, there exists a (𝑥, 𝑦) in 𝐵 such that 𝑥 ≥ 𝑡. Thus, in this case, (𝑠, 0) is the LUB of 𝐵. If 𝑠 ∈ 𝑆,
then there exists some (𝑥, 𝑦) in 𝐵 such that 𝑥 = 𝑠 and the set of all their 𝑦 coordinates has a LUB 𝑢 ∈
[0, 1] or ([0, 1)). Thus, (𝑠, 𝑢) is the LUB of 𝐵. ■

We can also show that 𝐴 = [0, 1] × [0, 1) does not satisfy the desired property. For example, WLOG,
𝐵 = 0 × [0, 1) is clearly bounded from above, but has not LUB. This is because for any 𝑠 > 0, (𝑠, 0) is
an upper bound of 𝐵 but there does not exist an upper bound (0, 𝑦).