HomeNotesAboutLinks

Some exercise solutions for John M. Lee Introduction to Topological Manifolds Second Edition

2 Topological Spaces ​

Exercise 2.4 ​

(a) ​

  • Suppose d and d′ generate the same topology.

    For every x∈M,r>0.

    Because d and d′ generate the same topology. Br(d)(x) is open in the topology induced by b, and it is also open in the topology induced by d′.

    By the definition of openness in the d′-topology,

    A subset A⊆M is said to be an open subset of M if it contains an open ball around each of its points.

    For every point x∈Br(d)(x), there exists some r1>0 such that Br1(d′)(x)⊆Br(d)(x).

    This gives the first inclusion.


    Similarly, Br(d′)(x) is open in the d′-topology and hence also open in the d-topology.

    Thus there exists some r2>0 such Br2(d)(x)⊆Br(d′)(x)

    This gives the second inclusion.


    Both inclusions are obtained and the inclusion property holds for every x∈M and r>0.

  • Suppose Br1(d′)(x)⊆Br(d)(x) and Br2(d)(x)⊆Br(d′)(x). Let Td denote the topology generated by d and Td′ the topology generated by d′.

    The goal is to prove that Td=Td′. By the antisymmetry of ⊆, the goal can be written as Td⊆Td′∧Td′⊆Td.

    Let U∈Td and take any x∈U. By the definition of open set in the metric topology, there exists r>0 such that Br(d)(x)⊆U.

    According to the assumption, there exists r1>0 such that Br1(d′)(x)⊆Br(d)(x)⊆U.

    Thus every point x∈U also has a d′-ball around it contained in U. Therefore U is also open in the d′-topology.

    Hence U∈Td′, proving Td⊆Td′


    Similarly, let V∈Td′ and x∈V. Then there exists r>0 such that Br(d′)(x)⊆V. By the assumption, there exists r2>0 such that Br2(d)(x)⊆Br(d′)(x).

    Thus V is also open in the d-topology, proving Td′⊆Td.


    Both inclusions hold, so Td=Td′.

    ◻

(b) ​

Let Td denote the topology generated by d and Td′ the topology generated by d′.

Let U∈Td and take any u∈U, there exists r1>0 such that Br1(d)(u)⊆U.

Br1(d)(u)={y∈M:d(u,y)<r1}

Let V∈Td′ and take any v∈V, there exists r2>0 such that Br2(d′)(v)⊆V.

Br2(d′)(v)={y∈M:d′(v,y)<r2}

Now substitute d′(v,y)=c⋅d(v,y),

Br2(d′)(v)={y∈M:d′(v,y)<r2}={y∈M:c⋅d(v,y)<r2}

Divide both sides by c>0,

Br2(d′)(v)={y∈M:d(v,y)<r2/c}=Br2/c(d)(v)

Hence for any v∈V there exists Br2/c(d)(v)⊆V, proving V∈Td. Namely Td′⊆Td.


Similarly, substitute d(u,y)=d′(u,y)/c,

Br1(d)(u)={y∈M:d(u,y)<r1}={y∈M:d′(u,y)/c<r1}

Multiply both sides by c,

Br1(d)(u)={y∈M:d′(u,y)<r1⋅c}=Bc⋅r1(d′)(u)

Hence for any u∈U there exists Bc⋅r1(d′)(u)⊆U, proving U∈Td′. Namely Td⊆Td′.

Combining both inclusions, get Td=Td′.

◻

(c) ​

Let Td denote the topology generated by the Euclidean metric and Td′ the topology generated by d′.


Let U∈Td and take any u∈U, there exists r1>0 such that Br1(d)(u)⊆U.

Br1(d)(u)={y∈Rn:d(u,y)<r1}

Let V∈Td′ and take any v∈V, there exists r2>0 such that Br2(d′)(v)⊆V.

Br2(d′)(v)={y∈Rn:d′(v,y)<r2}

To compare these two topologies, relation between the two metrics is desired.

We can prove the following inequalities.

d′(x,y)≤d(x,y)≤nd′(x,y)
  • d′(x,y)≤d(x,y)

    By the definition of Euclidean metric,

    d(x,y)2=∑i=1n(xi−yi)2

    Every term (xi−yi)2 is nonnegative, so for any term j,

    (xj−yj)2≤∑i=1n(xi−yi)2=d(x,y)2

    Now take the square root of both sides (valid since both sides are ≥0)

    |xj−yj|≤d(x,y)

    Because j can be any coordinate, substitute by d′ is valid.

    d′(x,y)≤d(x,y)
  • d(x,y)≤nd′(x,y)

    For every coordinate i, |xi−yi|≤d′(x,y) by the definition of d′.

    Squaring and then summing over all coordinates gives

    ∑i=1n(xi−yi)2≤n⋅(d′(x,y))2

    Now take square roots (both sides are nonnegative):

    d(x,y)≤nd′(x,y)

For each y∈Br2(d′)(v), d′(v,y)<r2 by definition.

Then apply above inequalities,

d(v,y)≤nd′(v,y)<nr2

That is y∈Bnr2(d)(v). Namely Br2(d′)(v)⊆Bnr2(d)(v).

Therefore, for each v∈V, there exists r2′>0 (take r2′=nr2) such that Br2′(d)(v)⊆V.


Similarly, if d(u,y)<r1 then d′(u,y)≤d(u,y)<r1.

That is Br1(d)(u)⊆Br1(d′)(u).

Therefore, for each u∈U, there exists Br1(d′)(u)⊆U.


Both inclusions hold, get Td=Td′.

◻

(d) ​

It suffices to show that if every singleton is in the topology, the topology must be the discrete topology, because arbitrary unions of singletons can generate entire power set.

For any x∈X and r>0,

  • r≤1

    Since d(x,y)<r≤1 can only ocurr when x=y by the definition of discrete metric.

    Br(d)(x)={y∈X:d(x,y)<r}={x}
  • r>1

    Then d(x,y)<r holds for all y∈X, because d(x,y) is always 1 or 0.

    So Br(d)(x)=X.

Any subset A⊆X can be written as a union of singletons,

A=⋃x∈Ax

Since any singleton is open and the unions of open sets are still open, every subset of X is open and d generates the discrete topology.

◻

(e) ​

By Exercise 2.4 (c), discrete metric generates the discrete topology.

It suffices to show that Euclidean metric d(x,y)=|x−y| also generates the discrete topology on Z.

For x∈Z and r>0,

Br(d)(x)={y∈Z:|x−y|<r}

Now consider different ranges of r,

  • r≤1

    The only integer y satisfying |x−y|<1 is x−y. So Br(d)(x)={x}.

  • r>1

    Because it has already been proved that every singleton is open, d generates the discrete topology on Z.

Therefore, both metrics generate the same (discrete) topology.

◻

Exercise 2.5 ​

Let T be the topology on X and TY be the topology on Y.

Three axioms of topology space must be hold.

  • ∅,Y∈TY

    Since ∅∈T and ∅⊆Y, ∅∈TY.

    Y∈T by the given assumption and Y⊆Y, so Y∈TY.

  • TY is closed under arbitary unions.

    Let {Ui}i∈I be any collection of sets in TY. Each Ui is open in X and contained in Y by the definition of TY. Then

    ⋃i∈IUi

    is a union of open sets in X, hence open in X, and clearly contained in Y because each Ui∈Y.

    Thus ⋃i∈IUi∈TY.

  • TY is closed under finite intersections.

    Let U1,U2,…,Un∈TY. Each Ui∈T and Ui⊆Y. Then

    ⋂i=1nUi

    is a finite intersection of open sets in X, hence open in X, and also contained in Y. Therefore

    ⋂i=1nUi∈TY

All topology axioms are satisfied, so TY={U⊆Y:U∈T} is a topology on Y.

◻

Exercise 2.6 ​

  • ∅,Y∈T

    Since each Tα is a topology, ∅,X∈Tα. Hence ∅,X∈⋃α∈ATα=T.

  • T is closed under arbitary unions.

    Let {Ui}i∈I be any collection of sets in T. Then Ui∈Tα for each α∈A. Because Tα is a topology,

    ⋃i∈IUi∈Tα

    Since this holds for every α,

    ⋃i∈IUi∈⋃α∈ATα=T

    Therefore, T is closed under arbitary unions.

  • T is closed under finite intersections.

    Let U1,U2,…,Un∈T. Then Ui∈Tα for every α∈A and 1≤i≤n.

    Since each Tα is a topology,

    ⋂i=1nUi∈Tα

    Hence

    ⋂i=1nUi∈⋂α∈ATα=T

    So T is closed under finite intersections.

All topology axioms hold. Therefore T=⋂α∈ATα is a topology on X.

◻

Exercise 2.9 ​

(a) ​

  • Suppose x∈IntA.

    By definition of the interior, there exists an open set U such that x∈U⊆A.

    Because U is open and contains x, U is a neighborhood x. Namely x has a neighborhood contained in A.

  • Suppose x has a neighborhood contained in A.

    That means that there exists an open set U such that x∈U⊆A. Then any such U is part of the union that forms IntA by the definition.

    Hence x∈IntA.

◻

(b) ​

  • Suppose x∈ExtA.

    By definition, x∈X and x∉A―, which means that there exists a closed set B,B⊇A and x∉B.

    Then there must exists an open set U containing x and U⊆X∖A. Thus x has a neighborhood U contained in X∖A.

  • Suppose x has a neighborhood contained in X∖A.

    That is, there exists an open set U with x∈U⊆X∖A. Then U∩A=∅, so there exists a closed set that is a super set of A and not containing x, resulting in x∉A―.

    Therefore x∈X∖A―=ExtA.

◻

(c) ​

  • Suppose x∈∂A.

    By definition, x∈X, x∉IntA and x∉ExtA.

    Since x∉IntA, by Exercise 2.9 (a), x has no neighborhood contained entirely in A. Therefore, every neighborhood of x intersects X∖A.

    Since x∉ExtA, by by Exercise 2.9 (b), x has no neighborhood contained entirely in X∖A. Therefore, every neighborhood of x intersects A.

    Combining these two facts, every neighborhood of x contains at least one point of A and one point of X∖A.

  • Suppose every neighborhood of x meets both A and X∖A.

    Then no neighborhood of x can be contained in A, which means x∉IntA. And no neighborhood of x can be contained in X∖A, which means x∉ExtA.

    Thus x∈X∖(IntA∪ExtA).

◻

(d) ​

  • Suppose x∈A―.

    By definition, x is in every closed set B that is a superset of A.

    Now take any neighborhood U of x. Its complement X∖U is closed and does not contain x. Assume that U∩A=∅, then A⊆X∖U, and X∖U is a closed set containing A but not x. That would contradict x∈A―, since x must be in every closed set containing A. Hence U∩A≠∅.

    So every neighborhood U of x contains at least one point of A.

  • Suppose every neighborhood of x meets A.

    Let B be any closed set with A⊆B, then X∖B is open and disjoint from A.

    Assume that x∉B for some B, then x∈X∖B, which is a neighborhood of x disjoint from A. But this contradicts the assumption that every neighborhood of x meets A. Therefore, x∈B for every such closed B.

    That means x lies in the intersection of all closed sets containing A. Namely, x∈A―.

◻

(e) ​

x∈A― if and only if every neighborhood of x meets A, by Exercise 2.9 (d).

x∈∂A if and only if every neighborhood of x meets both A and X∖A, by Exercise 2.9 (c).

x∈IntA if and only if some neighborhood of x lies in A, by Exercise 2.9 (a).

Then

A―=IntA∪{x:every neighborhood meets A but not contained in A}

and the second set equals to ∂A. Hence A―=IntA∪∂A.

Since IntA⊆A⊆A― and ∂A⊆A―, the same argument yeilds A―=A∪∂A.

Thus both equalities hold.

◻

(f) ​

IntA is a union of open sets, so it is open.

ExtA is the complement of closed set, so it is open.

A― is an intersection of closed sets. so it is closed.

∂A is the complement of open set, so it is closed.

◻

(g) ​

  • A is open ↔ IntA

    If A is open, by definition of interior, A itself is open and contained in A. Thus IntA=A.

    If IntA=A, and IntA is open by Exercise 2.9 (f), then A is open.

  • A is open ↔ A contains none of its boundary points

    If A is open, then IntA=A, so

    ∂A=X∖(IntA∪ExtA)=X∖(A∪ExtA)∂A∩A=∅

    By Exercise 2.9 (e), A―=A∪∂A. Since ∂A∩A=∅, ∂A=A―∖A. Hence no point of A lies in ∂A.

    Conversely, if A contains no boundary points, then A∩∂A=∅. Since A―=A∪∂A=IntA∪∂A, A⊆IntA. But alwyas IntA⊆A by Exercise 2.9 (e), so A=IntA, and thus A is open.

  • A is open ↔ Every point of A has a neighborhood contained in A

    If A is open, it is itself a neighborhood of each of its points. So each x∈A has a neighborhood A contained in A.

    If every point of A has a neighborhood Ux⊆A, then A=⋃x∈AUx, a union of open sets, hence open.

◻

(h) ​

  • A is closed ↔A=A―

    If A is closed, A itself is a closed set containing A, and its intersection with any larger closed set containing A is still A. So A=A―.

    If A=A―, since A― is always closed by Exercise 2.9 (f), A is closed.

  • A is closed ↔ A contains all its boundary points

    If A is closed, then A―=A, hence A―=A∪∂A=A―∪∂A, which implies that ∂A⊆A. So A contains all its boundary points.

    If A contains all its boundary points, then ∂A⊆A, hence A―=A∪∂A=A. So A is closed.

  • A is closed ↔ Every point of X∖A has a neighborhood contained in X∖A

    If A is closed, then X∖A is open. So for each x∈X∖A, the set X∖A itself is an open neighborhood of x and the set itself contained in X∖A. Hence every point of X∖A has a neighborhood contained in X∖A.

    If every x∈X∖A has a neighborhood (open set Ux) contained in X∖A, then

    X∖A=⋃x∈X∖AUx

    is open because the union of open sets is open, implying A is closed.

◻

Exercise 2.10 ​

  • Suppose A is closed.

    Let x be a limit point of A. Assume that x∉A for some x. Then x∈X∖A, which is open. So there exists a neighborhood U⊆X∖A of x. But then U∩A=∅, contradicting the definition of limit point. Hence x∈A.

  • Suppose A contains all of its limit points.

    Let x∈X∖A. Since x∉A and x is not a limit point of A, there exists an open neighborhood U of x such that U∩A=∅. Then U⊆X∖A, so every point of X∖A has an open neighborhood contained in it. Hence X∖A is open, and A is closed.

◻

Exercise 2.11 ​

  • Suppose a subset A⊆X is dense.

    That is A―=X. Let U⊆X be a nonempty open set. For any x∈U, since x∈A―, every neighborhood of x intersects A by Exercise 2.8 (d). In particular, U itself is a neighborhood of x. Hence U∩A≠∅. So U contains a point of A.

  • Suppose every nonempty open subset of X contains a point of A.

    Let x∈X. Every neighborhood U of x is open and nonempty, so U contains a point of A. Thus every neighborhood of x intersects A, meaning x∈A―. Thus A―=X.

◻

Exercise 2.12 ​

Let Td be the topology induced by the metric d in a metric space.

  • Suppose xi→x in the metric space.

    For any open neighborhood U of x in the topology Td. By definition of Td, there exists ε>0 such that the open ball

    Bε(x)={y∈X:d(x,y)<ε}

    is contained in U. By metric convergence, there exists N such that i≥N⟹d(xi,x)<ε.

    Hence xi∈Bε(x)⊆U for all i≥N. Thus xi→x in the topology sense.

  • Suppose xi→x in the topology space.

    Fix ε>0. The ball Bε(x) is open in Td, hence a neighborhood of x. By topological convergence, there exists N such that i≥N⟹xi∈Bε(xi), namely d(xi,x)<ε. Thus xi→x in the metric sense.

◻

Exercise 2.13 ​

  • Suppose xi→x in X.

    Then {x} is an open neighborhood of x since X is a discrete topology space. By the definition of convergence, there exists N such that i≥N⟹xi∈{x}. That is xi=x for all i≥N. Hence the sequence is eventually constant.

  • Suppose (xi) is eventually constant.

    That is there exists N such that xi=x for all i≥N. Then for any open set U containing x, xi=x∈U holds for all i≥N. Therefore xi→x.

◻

Exercise 2.14 ​

Let U be any open neighborhood of x. Since xi→x, by the definition of convergence, there exists N such that i≥N⟹xi∈U. Each xi∈A by hypothesis, so xi∈A∩U for all i≥N. Thus every neighborhood of x meets A. By Exercise 2.9 (d), it follows that x∈A―.

◻

Exercise 2.16 ​

Let f:X→Y be a map between topological spaces.

  • Suppose f is continuous.

    For any closed set C⊆Y. Then Y∖C is open in Y. By continuity of f, the preimage f−1(Y∖C) is open in X.

    By the preimage law

    f−1(Y∖C)=X∖f−1(C)

    Since X∖f−1(C) is open, f−1(C) must be closed in X. Hence preimages of closed sets are closed.

  • Suppose the preimage of every closed subset is closed.

    That is, for every closed set C⊆Y, the set f−1(C) is closed in X. Then Y∖C is open in Y. Similarly

    f−1(Y∖C)=X∖f−1(C)

    Because f−1(C) is closed, its complement X∖f−1(C) is open. Thus preimages of open sets are open, proving f is continuous.

◻

Exercise 2.18 ​

(a) ​

Let f(x)=c for some fixed x∈Y, and U is any open set in Y. Then

f−1(U)={X,c∈U∅,c∉U

Both X and \empty are open in X. Hence f−1(U) is open for every open set U⊆Y, proving f is continuous.

(b) ​

For any open set U⊆X,

IdX−1(U)={x∈X:IdX(x)∈U}=U

Since U is open and its preimage U is open, IdX is continuous.

(c) ​

Let U⊆Y be open, and define f|U:U→Y by f|U(x)=f(x).

Let V⊆Y be open. By definition of preimage and restrictions:

(f|U)−1(V)={x∈U:f(x)∈V}=U∩f−1(V)

Since f is continuous, f−1(V) is open in X. Hence the intersection U∩f−1(V) of two open sets is open in U (by the subspace topology definition). Thus f|U is continuous.

◻

Exercise 2.20 ​

  • Reflexivity

    For every topology space X, the identity map

    idX:X→X,idX(x)=x

    is bijective and continuous, and its inverse is itself (also continuous). Hence X is homeomorphic to itself.

  • Symmetry

    Suppose f:X→Y is a homeomorphism. Then f is bijective, continuous, and f−1:X→Y is continuous. Therefore f−1 is a homeomorphism from Y to X. Hence if X is homeomorphic to Y, then Y is homeomorphic to X.

  • Transitivity

    Suppose f:X→Y and g:Y→Z are homeomorphisms. Then both f and g are bijective and continuous, with continuous inverses. The composition

    g∘f:X→Z

    is bijective (since a composition of bijections is bijective), continuous (composition of continuous maps is continuous), and has continuous inverse

    (g∘f)−1=f−1∘g−1

    Thus g∘f is a homeomorphism from X to Z. Hence if X is homeomorphic to Y and Y to Z, then X is homeomorphic to Z.

◻

Exercise 2.21 ​

  • Suppose f is a homeomorphism.

    Because f is continuous, for any open set V∈T2, f−1(V)∈T1.

    Because f−1 is continuous, for any U∈T1, f(U)∈T2.

    Thus f(U)∈T2 if U∈T1 and f−1(V)∈T1 if V∈T2. Therefore f(T1)=T2.

  • Suppose f(T1)=T2.

    • Continuity of f.

      Let V∈T2. Since f(T1)=T2, there exists U∈T1 such that V=f(U). Then f−1(V)=f−1(f(U))=U∈T1. Thus f is continuous.

    • Continuity of f−1.

      Let U∈T1. Then f(U)∈T2. Since (f−1)−1(U)=f(U)∈T2, f−1 is continuous.

    Therefore f is a homeomorphism.

◻

Exercise 2.22 ​

Since f is a homeomorphism, both f and f−1 are continuous. Because f−1 is continuous, the preimage under f−1 of any open set in X is open in Y. That is (f−1)−1(U)=f(U), which means f(U) is open in Y.


The next goal is to prove that f|U:U→f(U) is a homeomorphism.

  • Bijectivity

    Since f is bijective, the restriction f|U is bijective from U onto f(U).

  • Continuouity

    From Exercise 2.18 (c), the restriction of a continuous map to an open subset of its domain is continuous. Thus f|U is continuous.

  • Inverse Continuouity

    The inverse of f|U is the restriction of f−1 to f(U). That is (f|U)−1=f−1|f(u). Since f−1 is continuous and f(U) is open in Y, apply Exercise 2.18 (c) again shows that the restriction f−1|f(u) is continuous.

Therefore, f|U is bijective, continuous, and has a continuous inverse.

◻

Exercise 2.23 ​

By the definition of continuouity,

idX is continuous↔idX−1(U)∈T1 for all U∈T2.

Because idX−1(U)=U, this becomes,

U∈T1 for all U∈T2

Namely T2⊆T1, which is the definition of T1 being finer than T2.

Thus

idX is continuous↔T1 is finer than T2.

By the definition of homeomorphism,

idX is a homeomorphism if and only if idX is continuous, and its inverse is continuous.The second condition means that

idX−1:(X,T2)→(X,T1) is continuous ↔T2 is finer than T1

Combine with previous part,

idX is continuous ↔T1 is finer than T2.

Hence both T1⊆T2 and T2⊆T1 must hold.

Thus,

idX is a homeomorphism ↔T1=T2.◻

Exercise 2.33 ​

Let T={∅,Y} be the trivial topology of Y, (yn) be any sequence of Y, and let y∈Y be any point.

In the trivial topology, the only open set containing y is Y it self. Since Y also contains every term of the sequence, by definition, y is the limit point of sequence (yn).

◻

Exercise 2.35 ​

Let p,q∈X,p≠q. By assumption, there is a continuous function fp:X→R such that fp−1(0)=p. Since p≠q, fp(q)≠0.

Let

ε=|fp(q)|2>0

Define the open sets,

U=fp−1(−ε,ε),V=fp−1(R∖[−ε,ε])

Both sets are open because fp is continuous.

Then

  • p∈U because fp(p)=0∈(−ε,ε).

  • q∈V because |fp(q)|>ε.

  • U∩V=∅ by construction.

Thus every pair p≠q is contained in disjoint open neighborhood, proving X is Hausdorff.

◻

Exercise 2.40 ​

  • Suppose U∈T,

    Let p∈U. Since B is a basis for T, every open set (including U) is a union of basis elements. Therefore, there exists some basis element B∈B such that p∈B⊆U.

  • Suppose for each p∈U, there exists Bp∈B such that p∈Bp⊆U.

    Then U=⋃p∈UBp. Each Bp is open because basis elements are open. A union of open sets is open, so U is open.

◻

Exercise 2.42 (a) ​

  • Every cube Cs(x) is open.

    By definition of open cube, it can be rewritten as

    Cs(x)=∏i=1n(xi−s/2,xi+s/2)

    a Cartesian product of open intervals. Since products of open intervals are exactly the usual Euclidean open boxes, each Cs(s) is an open subset of Rn.

  • Every Euclidean open set is a union of cubes Cs(x).

    Let U⊆Rn be an open set. Fix p∈U, there exists an open ball Br(p)⊆U,r>0 since U is open. Consider the cube with side length s=2rn. Then for any y∈Cs(p),

    |yi−pi|<s/2∥y−p∥2<∑i=1n(s/2)2=ns2=r

    Thus Cs(p)⊆Br(p)⊆U. Therefore every point of U is contained in some cube entirely contained in U. Hence any Euclidean open set is a union of members of B1.

Exercise 2.51 ​

Let B={Bn:n∈N} be a countable basis for the topology on X.

Define

D={xn:Bn≠∅,xn∈Bn}

Since D is constructed by choosing one xn from each Bn, D is countable.

Let U⊆X be any nonempty open set. Since B is a basis, there exists some Bk∈B such that Bk⊆U and Bk≠∅. Then xk∈D∩Bk and D∩Bk⊆D∩U. Hence every nonempty open set intersects D, by Exercise 2.11, D is dense.

Thus D is a countable dense subset of X.

Exercise 2.54 ​

  • Suppose X is a 0-manifold.

    For each x∈X, there exists an open Ux⊆X and a homeomorphism φx:Ux→{0}. Since φx is a homeomorphism and {0} is open in itself, Ux=φx−1({0}) is open. But Ux contains exactly one point because φ is injective. Hence Ux={x} is open. So X is discrete.


    A 0-manifold is second countable by definition. Therefore a discrete second-countable space must be countable, because a discrete space has the basis {{x}:x∈X}. A basis must be countable, so X must be countable.

    Thus X is a countable discrete space.

  • Suppose X is a discrete countable space.

    In a discrete space, every point x∈X has an open neighborhood Ux={x}, which is open. Then the map {x}→{0},x↦0 is a homeomorphism onto {0}. So each point has a neighborhood homeomorphic to an open subset of R0. And a countable discrete space is second countable and Hausdorff.

    Thus X satisfies the definition of a 0-manifold.

◻