Exercise 4.1.

1
If F1 , F2 are finite, then (X − F1 ) ∩ (X − F2 ) = X − F1 ∪ F2 , for finite F1 ∪ F2 .
If C1 , C2 are countable, then (X − C1 ) ∩ (X − C2 ) = X − C1 ∪ C2 , for countable C1 ∪ C2 .
By Lemma 4.1.2, both are topological bases.
Exercise 4.1.2
Let x ∈ B(x1 , ϵ1 ) ∩ B(x2 , ϵ2 ). Then d(x, x1 ) < ϵ1 and d(x, x2 ) < ϵ2 . Let ϵ = min{ϵ1 −
d(x, x1 ), ϵ2 − d(x, x2 )} > 0. Then

y ∈ B(x, ϵ) =⇒ d(y, x) < ϵ ≤ ϵ1 − d(x, x1 )

=⇒ d(y, x1 ) ≤ d(y, x) + d(x, x1 ) < ϵ1 .

This means B(x, ϵ) ⊂ B(x1 , ϵ1 ). By the same reason, we also have B(x, ϵ) ⊂ B(x2 , ϵ2 ). Then
x ∈ B(x, ϵ) ⊂ B(x1 , ϵ1 ) ∩ B(x2 , ϵ2 ).
Exercise 4.1.3
(1) B ∪ B ′ = {B : B ∈ B or B ′ }: not basis.
Take X = R, B = {[a, b)}, B ′ = {(a, b]}. Then 0 ∈ (−1, 0] ∩ [0, 1) for (−1, 0], [0, 1) ∈ B ∪ B ′ .
However, the only subset between 0 and (−1, 0] ∩ [0, 1) is {0}, which is not in B ∪ B ′ .
(2) B ∩ B ′ = {B : B ∈ B and B ′ }: not basis.
Take X = {1, 2, 3, 4, 5}, and

B = { {2}, {1, 2}, {2, 3}, {1, 2, 3, 4}, {1, 2, 3, 5} },

B ′ = { {3}, {1, 3}, {2, 3}, {1, 2, 3, 4}, {1, 2, 3, 5} }.

Then B ∩ B ′ = { {2, 3}, {1, 2, 3, 4}, {1, 2, 3, 5} } is not a basis.

(3) B − B ′ = {B : B ∈ B and B ̸∈ B ′ }: not basis.
Take X = {1, 2, 3}, B = { {1}, {1, 2}, {1, 3} }, B ′ = { {1} }. Then B −B ′ = { {1, 2}, {1, 3} }
is not a basis.
(4) {B ∪ B ′ : B ∈ B and B ′ ∈ B ′ }: not basis.
Take X = {1, 2, 3}, B = { {1, 2}, {1, 2, 3} }, B ′ = { {1, 3}, {1, 2, 3} }. Then { {1, 2}, {1, 3}, {1, 2, 3} }
is not a basis.
(5) {B ∩ B ′ : B ∈ B and B ′ ∈ B ′ }: basis.

x ∈ (B1 ∩ B1′ ) ∩ (B2 ∩ B2′ ), with B1 , B2 ∈ B, B1′ , B2′ ∈ B ′

=⇒ x ∈ B1 ∩ B2 , and x ∈ B1′ ∩ B2′
=⇒ x ∈ B ⊂ B1 ∩ B2 for some B ∈ B, and x ∈ B ′ ⊂ B1′ ∩ B2′ for some B ′ ∈ B ′
=⇒ x ∈ B ∩ B ′ ⊂ (B1 ∩ B2 ) ∩ (B1′ ∩ B2′ ) for some B ∩ B ′ .

(6) {B − B ′ : B ∈ B and B ′ ∈ B ′ }: not basis.

Take B = { {1}, {1, 2}, {1, 2, 3} } and B ′ = { {1}, {2}, {3} }. Then {B − B ′ : B ∈
B and B ′ ∈ B ′ } = { {1}, {2}, {1, 2}, {2, 3}, {1, 3} } is not a basis.
Exercise 4.1.4
(1) For f −1 (B).
 First condition:

x ∈ X =⇒ f (x) ∈ Y
=⇒ f (x) ∈ B for some B ∈ B
=⇒ x ∈ f −1 (B) for some f −1 (B) ∈ f −1 (B).

Second condition:

x ∈ f −1 (B1 ) ∩ f −1 (B2 ), with B1 , B2 ∈ B

=⇒ f (x) ∈ B1 ∩ B2
=⇒ f (x) ∈ B ⊂ B1 ∩ B2 for some B ∈ B
=⇒ x ∈ f −1 (B) ⊂ f −1 (B1 ∩ B2 ) = f −1 (B1 ) ∩ f −1 (B2 ) for some f −1 (B) ∈ f −1 (B).

(2) For {B : f (B) ∈ B}.

Take any Y and B = {Y }. Take X = Y ⊔ Y ′ to be two disjoint copies of Y , and take
f : X → Y to be identity on Y and Y ′ . Then

{B : f (B) ∈ B} = {A1 ⊔ A′2 : A1 ∪ A2 = Y }.

Let Y = {1, 2}. Then 1 ∈ {1} = {1, 2} ∩ {1, 2′ }. However, {1} ̸∈ {B : f (B) ∈ B}. Not a
topological basis.
Exercise 4.1.5
(1) For f (B) = {f (B) : B ∈ B}.
Take f : X = {1, 2, 3, 4} → Y = {1, 2, 3} to be f (1) = f (4) = 1, f (2) = 2, f (3) = 3.
Take the topological basis B = { {1, 2}, {3, 4} } on X. Then f (B) = { {1, 2}, {1, 3} } is not a
topological basis on Y .
(2) For {B : f −1 (B) ∈ B}.
Take f : X = {1, 2, 3, 4, 5, 6} → Y = {1, 2, 3} to be f (1) = f (4) = 1, f (2) = f (5) = 2,
f (3) = f (6) = 3. Take the topological basis B = { {2}, {5}, {1, 2, 4, 5}, {2, 3, 5, 6} } on X.
Then {B : f −1 (B) ∈ B} = { {1, 2}, {2, 3} } is not a topological basis on Y .
Exercise 4.1.6
First condition:

(x, y) ∈ X × Y =⇒ x ∈ B1 for some B1 ∈ BX , and y ∈ B2 for some B2 ∈ BY

=⇒ (x, y) ∈ B1 × B2 for some B1 × B2 ∈ BX × BY .

Second condition:

(x, y) ∈ (B1 × B2 ) ∩ (B1′ × B2′ ), with B1 , B1′ ∈ BX and B2 , B2′ ∈ BY

=⇒ x ∈ B1 ∩ B1′ and y ∈ B2 ∩ B2′
=⇒ x ∈ B1′′ ⊂ B1 ∩ B1′ for some B1′′ ∈ BX , and y ∈ B2′′ ⊂ B2 ∩ B2′ for some B2′′ ∈ BY
=⇒ (x, y) ∈ B1′′ × B2′′ ⊂ (B1 × B2 ) ∩ (B1′ × B2′ ) for some B1′′ × B2′′ ∈ BX × BY .
Exercise 4.1.7

S1 = {(a, +∞)} ∪ {(−∞, a)}, S2 = {[a, +∞)} ∪ {(−∞, a)},

S3 = {(a, +∞)} ∪ {(−∞, a]}, B4 (not basis),
S5 = {(a, ∞)}, S6 = {(−∞, a)},
S7 = {(a, +∞) : a ∈ Q} ∪ {(−∞, a) : a ∈ Q}, S8 = {[a, +∞) : a ∈ Q} ∪ {(−∞, a) : a ∈ Q},
S9 = {R − a = (−∞, a) ∪ (a, +∞)}, S10 = {{a} : a ∈ R}.

Exercise 4.1.8
By
(a, b) × R ∩ R × (c, d) = (a, b) × (c, d),
S induces B1 . Moreover, we may take

S4 = {[a, b) × R} ∪ {R × [c, d)},

S5 = {[a, b) × R} ∪ {R × (c, d)},
S6 = {(a, b) × R : a, b ∈ Q} ∪ {R × (c, d) : c, d ∈ Q}.

We may also take

S1 = {(a, +∞) × R, (−∞, a) × R, R × (a, +∞), R × (−∞, a)},

S4 = {[a, +∞) × R, (−∞, a) × R, R × [a, +∞), R × (−∞, a)}, ,
S5 = {[a, +∞) × R, (−∞, a) × R, R × (a, +∞), R × (−∞, a)}, ,
S6 = {(a, +∞) × R, (−∞, a) × R, R × (a, +∞), R × (−∞, a) : a ∈ Q}.

Exercise 4.1.9
For distinct prime numbers p1 , p2 , . . . , pn , we have

p1 N ∩ p1 N ∩ · · · ∩ pn N = (p1 p2 . . . pn )N.

Therefore the topological basis

B = {nN : n has no square factor}.

Exercise 4.2.1
(1)
{2, 3} is not open: We have 2 ∈ {2, 3}. But both {2} and {2, 3} are not in B.
{1, 2, 4} is open: For 1, 2 ∈ {1, 2, 4}, we have {1, 2} ∈ B satisfying 1, 2 ∈ {1, 2} ⊂ {1, 2, 4}.
For 4 ∈ {1, 2, 4}, we have {4} ∈ B satisfying 4 ∈ {4} ⊂ {1, 2, 4}.
{2, 3, 4} is not open: We have 2 ∈ {2, 3, 4}. But both {2}, {2, 3}, {2, 4}, {2, 3, 4} are not in
B.
(2)
[0, 1] is open only with respect to B10 .
(0, 1] is open only with respect to B3 , B10 .
(0, +∞) is open with respect to all except B6 , B9 .
(3) With respect to pointwise convergence topology:
{f : fR(0) > f (1)} is open.
1
{f : 0 f (t)dt < 1} is not open.
R1 R1
{f : 02 f (t)dt > 1 f (t)dt} is not open.
2

(4)
The first is open with respect to all bases.
The second is open with respect B4 .
The third and fourth are not open.
Exercise 4.2.2
mk
Suppose U is open. For any pm 1 · · · pk
1
∈ U , there is n with no square factors, such that
mk mk
p1 · · · pk ∈ nN ⊂ U . Since n has no square factor, we know pm
m1
1 · · · pk
1
∈ nN implies
p1 · · · pk ∈ nN. Then lp1 · · · pk ∈ nN ⊂ U .
mk
Conversely, if U has the said property. For any pm 1 · · · pk ∈ U , take B = p1 · · · pk N. Then
1

mk
B is in the topological basis, and pm 1 · · · pk ∈ B. Moreover, any element of B is p1 · · · pk l ∈ U .
1

Exercise 4.2.3
If x ∈ n1 N ∩ n2 N, then n1 , n2 divide x. This implies the least common multiple n of n1 , n2
also divides a. Then x ∈ nN ⊂ n1 N ∩ n2 N. This verifies that B is a basis.
For U to be open with respect to B, we need x ∈ U implies x ∈ nN ⊂ U for some n. Then
n divides x, which implies xN ⊂ nN. Therefore the open condition for U means exactly

x ∈ U =⇒ xN ⊂ U.

Exercise 4.2.4
First condition: For any x ∈ X ⊔ Y , we have x ∈ X or Y . Then x ∈ B for some B ∈ BX or
BY .
Second condition: Suppose x ∈ B1 ∩ B2 , with B1 , B2 ∈ BX ⊔ BY . By B1 ∩ B2 ̸= ∅, we have
B1 , B2 ∈ BX or B1 , B2 ∈ BY . If B1 , B2 ∈ BX , then x ∈ B1 ∩ B2 implies x ∈ B ⊂ B1 ∩ B2 for
some B ∈ BX ⊂ BX ⊔ BY . If B1 , B2 ∈ BY , then the argument is the same.
The open subsets in X ⊔ Y are U ⊔ V , where U is open in X and V is open in Y .
Exercise 4.2.5
Suppose a subset U is open in the sense of Definition 2.3.1. Then for any x ∈ U , we can
find x ∈ B(y, ϵ) ⊂ U . By Lemma 2.3.2, we can find δ > 0, such that B(x, δ) ⊂ B(y, ϵ). Then
x ∈ B(x, δ) ⊂ U . This verifies that U is open in the sense of Definition 4.2.1.
Conversely, if a subset is open in the sense of Definition 4.2.1, then by taking x = y in the
definition, it is open in the sense of Definition 2.3.1.
Exercise 4.3.1
(1) {subsets with at least two elements} ∪ {∅, N}: Not topology.
{1, 2}, {1, 3} ∈ T . But {1, 2} ∩ {1, 3} = {1} ̸∈ T .
(2) {subsets with even number of elements} ∪ {N}: Not topology.
{1, 2}, {1, 3} ∈ T . But {1, 2} ∩ {1, 3} = {1} ̸∈ T .
(3) {subsets containing no odd numbers} ∪ {N}: Topology.
∅ has no odd number, and N ∈ T .
If Ui have no odd numbers, then ∪Ui have no odd numbers.
If U, V have not odd numbers, then U ∩ V has no odd number.
(4) {nN : n ∈ N} ∪ {∅, N}, where nN is defined in Exercise 4.1.9: Not topology.
2N ∪ 3N = {2, 3, 4, 6, 8, 9, 10, 12, . . . } is not of the form nN.
(5) {2n N : n ∈ N} ∪ {∅, N}: Topology.
∪2ni N = 2n N, where n = min ni .
2m N ∩ 2n N = 2max{m,n} N.
Exercise 4.3.2
(1) {(a, ∞) : a ∈ Z} ∪ {∅, R}: Topology.
∪(ai , +∞) = (a, +∞), where a = inf ai .
(a, +∞) ∩ (b, +∞) = (max{a, b}, +∞).
(2) {(−∞, −a) ∪ (a, ∞) : a > 0} ∪ {∅, R}: Topology.
∪((−∞, −ai ) ∪ (ai , +∞)) = (−∞, −a) ∪ (a, +∞), where a = inf ai .
((−∞, −a) ∪ (a, +∞)) ∩ ((−∞, −b) ∪ (b, +∞)) = (−∞, − max{a, b}) ∪ (max{a, b}, +∞).
(3) {(−a, 2a) : all a > 0} ∪ {∅, R}: Topology.
∪(−ai , 2a1 ) = (−a, 2a), where a = sup ai .
(−a, 2a) ∩ (−b, 2b) = (− min{a, b}, 2 min{a, b}).
(4) {[−a, 2a) : all a > 0} ∪ {∅, R}: Not topology.
∪∞ 1 1
n=1 [−1 + n , 2 − n ) = (−1, 2) ̸∈ T .

(5) {(an , ∞) : n ∈ N} ∪ {∅, R}, where an is an increasing sequence: Topology.

∪(ani , +∞) = (an , +∞), where n = min ni .
(ai , +∞) ∩ (aj , +∞) = (amax{i,j} , +∞).
Exercise 4.3.3
(1) {X − C : C is a countable subset} ∪ {∅}.
We have X = X − ∅, and ∅ is countable.
If Ci are countable, then ∪(X − Ci ) = X − ∩Ci , and ∩Ci is countable.
If C1 , C2 are countable, then (X − C1 ) ∩ (X − C2 ) = X − C1 ∪ C2 , and C1 ∪ C2 is countable.
(2) {U : U ⊂ A} ∪ {X}.
We have ∅ ⊂ A.
If Ui ⊂ A, then ∪Ui ⊂ A.
If U1 , U2 , ⊂ A, then U1 , ∩U2 ⊂ A.
 (3) {U : U ∩ A = ∅} ∪ {X}.
This is the same as {U : U ⊂ X − A} ∪ {X}. By (2), this is a topology.
Exercise 4.3.4
Any subset A = ∪x∈A {x}. Since {x} is open, we know A is open.
Exercise 4.3.5
If A is open, then we may take U = A, and get x ∈ U ⊂ A.
If x ∈ A implies x ∈ Ux ⊂ A for an open Ux , then A = ∪x∈A Ux is open.
Exercise 4.3.7 Suppose T and T ′ are topologies on X. Which are also topologies?

1. T ∪ T ′ = {U : U ∈ T or U ∈ T ′ }. 4. {U ∪ U ′ : U ∈ T and U ′ ∈ T ′ }.

2. T ∩ T ′ = {U : U ∈ T and U ∈ T ′ }. 5. {U ∩ U ′ : U ∈ T and U ′ ∈ T ′ }.

3. T − T ′ = {U : U ∈ T and U ̸∈ T ′ }. 6. {U − U ′ : U ∈ T and U ′ ∈ T ′ }.

(1) T ∪ T ′ = {U : U ∈ T or u ∈ T ′ }: not topology.

Take X = {1, 2, 3}, T = { {1, 2}, {1, 2, 3}, }, T ′ = { {1, 3}, {1, 2, 3}, }. Then T ∪ T ′ =
{ {1, 2}, {1, 3}, {1, 2, 3}, } is not a topology.
(2) T ∩ T ′ = {U : U ∈ T and u ∈ T ′ }: topology.
By ∅, X ∈ T and ∅, X ∈ T ′ , we get ∅, X ∈ T ∩ T ′ .
If Ui ∈ T ∩ T ′ , then Ui ∈ T . This implies ∪Ui ∈ T . By the same reason, we have ∪Ui ∈ T ′ .
Therefore ∪Ui ∈ T ∩ T ′ .
If U, V ∈ T ∩ T ′ , then U, V ∈ T . This implies U ∩ V ∈ T . By the same reason, we have
U ∩ V ∈ T ′ . Therefore U ∩ V ∈ T ∩ T ′ .
(3) T − T ′ = {U : U ∈ T and U ̸∈ T ′ }: Not topology.
Take X = {1, 2, 3}, T = { {1}, {1, 2}, {1, 3} }, T ′ = { {1}, {1, 2, 3} }. Then T − T ′ =
{ {1, 2}, {1, 3} } is not a topology.
(4) {U ∪ U ′ : U ∈ T and U ′ ∈ T ′ }: Not topology.
Take X = {1, 2} × {1′ , 2′ }, T = { ∅, {1} × {1′ , 2′ }, X }, T = { ∅, {1, 2} × {1′ }, X }.
Then we get B = { ∅, {1} × {1′ , 2′ }, {1, 2} × {1′ }, {1} × {1′ , 2′ } ∪ {1, 2} × {1′ }, X }. We have
(1, 1′ ) ∈ {(1, 1′ )} = {1} × {1′ , 2′ } ∩ {1, 2} × {1′ }. However, {(1, 1′ )} is not in B.
(5) {U ∩ U ′ : U ∈ T and U ′ ∈ T ′ }: Topology.
Take X = {1, 2, 3, 4}, T = { ∅, {1, 2}, {3, 4}, X } and T ′ = { ∅, {1, 3}, {2, 4}, X }. Then we
get { ∅, X, {1}, {2}, {3}, {4}, {1, 2}, {3, 4}, {1, 3}, {2, 4} }, which is not a topology.
(6) {U − U ′ : U ∈ T and U ′ ∈ T ′ }: Not topology.
Take X = {1, 2, 3}, T = { {1, 2, 3} }, T ′ = { {1}, {2}, {3} }. Then we get { {1, 2}, {1, 3}, {2, 3} },
which is not a topology.
Exercise 4.3.8
(1) f −1 (T ) = {f −1 (V ) : V ∈ T } is topology.
First condition: f −1 (∅) = ∅, f −1 (Y ) = X.
 Second condition: f −1 (∪Ui ) = ∪f −1 (Ui ).
Third condition: f −1 (U1 ∩ U2 ) = f −1 (U1 ) ∩ f −1 (U2 ).
(2) {U : f (U ) ∈ T } is not topology.
Take any Y and T = {∅, Y }. Take X = Y ⊔ Y ′ to be two disjoint copies of Y , and take
f : X → Y to be identity on Y and Y ′ . Then

{U : f (U ) ∈ T } = {A1 ⊔ A′2 : A1 ∪ A2 = Y or A1 = A2 = ∅}.

Let Y = {1, 2}. Then {1, 2}, {1, 2′ } ∈ T . However, for {1} = {1, 2} ∩ {1, 2′ }, we have
f ({1}) = {1} ̸∈ T .
Exercise 4.3.9
(1) f (T ) = {f (U ) : U ∈ T } is not topology.
Take X = {1, 2, 3, 4}, T = { {1, 2}, {3, 4} }. Take Y = {1, 2, 3} and f (1) = f (4) = 1,
f (2) = 2, f (3) = 3. Then f (T ) = { {1, 2}, {1, 3} } is not a topology.
(2) T ′ = {V : f −1 (V ) ∈ T } is topology.
First condition: f −1 (∅) = ∅, f −1 (Y ) = X.
Second condition: If Vi ∈ T ′ , then f −1 (Vi ) ∈ T . Then f −1 (∪Vi ) = ∪f −1 (Vi ) ∈ T . Therefore
∪Vi ∈ T ′ .
Third condition: If U, V ∈ T ′ , then f −1 (U ), f −1 (V ) ∈ T ′ . Then f −1 (U ∩ V ) = f −1 (U ) ∩
f (V ) ∈ T . Therefore U ∩ V ∈ T ′ .
−1

Exercise 4.3.10
Let X = Y = {1, 2}, and TX = TY = { {1}, {1, 2} }. Then TX × TY = { {1} × {1}, {1} ×
{1, 2}, {1, 2}×{1}, {1, 2}×{1, 2} }. However, {1}×{1, 2}∪{1, 2}×{1} = {(1, 1), (1, 2), (2, 1)} ̸∈
TX × T Y .
Exercise 4.4.1 √
We have B√d (x, ϵ) = Bd (x, ϵ2 ). Then Bd (x, ϵ) ⊂ U =⇒ B√d (x, ϵ) ⊂ U , and B√d (x, ϵ) ⊂
√
U implies Bd (x, ϵ2 ) ⊂ U . This proves that d-open is the same as d-open.
For ϵ < 1, we have Bmin{d,1} (x, ϵ) = Bd (x, ϵ). Since we may additionally assume ϵ < 1 in
the definition of open subsets in metric space, we know d-open is the same as min{d, 1}-open.
Exercise 4.4.2
(1) Example 4.1.3:
By B5 , B6 , B7 ⊂ B1 , and B9 ⊂ T1 , we know T5 , T6 , T7 , T9 are coarser than T1 .
For any (a, b), there are rational decreasing sequence ai → a and rational increasing bi → b.
Then (a, b) = ∪(ai , bi ) ∈ T7 . Therefore B1 ⊂ T7 . Combined with T7 coarser than T1 , we get
T1 = T7 .
Open subsets are unions of subsets in Bi . Therefore open subsets in T5 , T6 , T9 are unbounded.
This implies T1 , T2 , T3 , T7 , T8 , T10 are not coarser than T5 or T6 . We conclude T5 , T6 , T9 ⊊ T1 (⊊
means strictly coarser).
We know (a, b) are open with respect to B2 , B3 , B8 . Moreover, subsets in B2 , B3 , B8 are not
open with respect to B1 . Therefore T1 ⊊ T2 , T3 , T8 . √
By B8 ⊂ B2 , we know T8 is coarser than B2 . Moreover, [ 2, 2) is open in B2 but not in B8 .
Therefore T8 ⊊ T2 .
Finally, {a} = [a, a] ∈ B10 . Therefore T10 is the discrete topology, the finest topology.
We conclude
T5 , T6 , T9 ⊊ T1 ⊊ T3 , T8 , T8 ⊊ T2 , T2 , T3 ⊊ T10 .

(2) Topologies on N given in Exercises 4.1.9, 4.3.1, and by the 2-adic metric

1. 4.1.9: B1 = {nN : n has no square factor}

2. 4.3.1(3): T2 = {subsets containing no odd numbers} ∪ {N}.

3. 4.3.1(5): T3 = {2n N : n ∈ N} ∪ {∅, N}.

4. T4 =2-adic.

We have 3N ∈ T1 , and 3N is not in T2 , T3 , T4 . The reason for not in T4 is because 3 ∈ 3N,

and d2−adic (3, 3 + 2n ) = 2−n can be arbitrarily small, and yet 3 + 2n ̸∈ 3N. Therefore T1 is not
coarser than T2 , T3 , T4 .
Non-empty open subsets in T1 , T3 , T4 are infinite. Since {2, 4} ∈ T2 , we know T2 is not
coarser than T1 , T3 , T4 .
We have 1 + 2N ∈ T4 , and 1 + 2N is not in T1 , T2 , T3 . Therefore T4 is not coarser than
T1 , T 2 , T3 .
The only remaining is whether T3 is contained in any Ti .
We have 4N ∈ T3 , and 4N ̸∈ T1 .
We have T3 ⊂ T2 .
We have T3 ⊂ T4 : For any x ∈ 2n N, and d2−adic (x, y) < 2−n , we have x − y ∈ 2n N. Therefore
y ∈ 2n N.
 Therefore the only relation is T3 ⊊ T2 and T3 ⊊ T4 .
Exercise 4.4.4 Prove that the L1 -topology and the pointwise convergence topology on C[0, 1]
cannot be compared.

1. Use Examples 2.4.8 and 4.2.6 to show that the pointwise convergence topology is not
coarser than the L1 -topology.
 Z 1 
2. Use the ball BL1 (0, 1) = f : |f (t)|dt < 1 in Exercise 4.2.1 to show that the L1 -
0
topology is not coarser than the pointwise convergence topology.

Exercise 4.4.6
We need U ∈ T to be open, and {a} ∈ A to be open. By taking union, we know U ∪ B is
open for any B ⊂ A. Now we form

T = {U ∪ B : U ∈ T , B ⊂ A}.

By ∪(Ui ∪Bi ) = (∪Ui )∪(∪Bi ) and (U1 ∪B1 )∩(U2 ∪B2 ) = (U1 ∩U2 )∪B, for some B ⊂ B1 ∪B2 ⊂ A,
we know T is a topology. Therefore T is the coarsest topology satisfy the requirement.
Exercise 4.4.7
Suppose we have the property with U replaced by B ′ ∈ B′ for a know topological basis B ′
that induces the topology. Then for x ∈ U , U open, there is B ′ ∈ B ′ , such that x ∈ B ′ ∈ B ′ .
Since the property holds for B ′ in place of U , there is B ∈ B, such that x ∈ B ⊂ B ′ . Then by
B ′ ⊂ U , we get x ∈ B ⊂ U . The property of the lemma is verified.
Exercise 4.4.9
Denote S ′ = B, as topological subbasis. Then S ′ induces B ′ .
Let B and B ′ induce T and T ′ .
We have B ⊂ S ′ ⊂ B ′ ⊂ T ′ . By Lemma 4.4.2 ((2) implies (1)), we get T ⊂ T ′ .
We have S ′ = B ⊂ T . By Lemma 4.4.2 ((3) implies (1)), we get T ′ ⊂ T .
We conclude T ′ = T .
Exercise 4.4.10
Let B ′ = T be T regarded as a topological basis. Let T ′ be the topology induced by B ′ .
We have T = B ′ ⊂ T ′ .
On the other hand, by B ′ ⊂ T and Lemma 4.4.2, we get T ′ ⊂ T .