π-base: Difficulty 2

Difficulty: 2

For proofs that very easy, using a quick little argument.

2

Countably compact   ⟹  \implies Weakly countably compact

Added:

Mar 11, 2026

Difficulty:

Let XX be infinite and A⊆XA \subseteq X countably infinite. If XX has no limit points, AA is closed and for each x∈Ax \in A, choose a nbd VxV_x with Vx∩X=∅V_x \cap X = \emptyset. Then {Vn}∪{AC}\{V_n\} \cup \{A^C\} is a cover. A finite subcover would imply AA is finite.

4

Countably compact   ⟹  \implies Pseudocompact

Added:

Mar 11, 2026

Difficulty:

For f:X→Rf : X \to \R continuous, {f−1(−n,n)}\{f^{-1}(-n, n)\} is a countable cover.

29

Has a countable network   ⟹  \implies Has a σ\sigma-locally finite network

Added:

Mar 18, 2026

Difficulty:

Any countable family is a countable union of finite sets. Finite sets are clearly locally finite. So any countable family is σ\sigma-locally finite.

32

T212T_{2 \frac{1}{2}}   ⟹  \implies T2T_2

Added:

Mar 15, 2026

Difficulty:

If U‾∩V‾=∅\overline{U} \cap \overline{V} = \emptyset, then U∩V=∅U \cap V = \emptyset.

34

Has a σ\sigma-locally finite kk-network   ⟹  \implies Has a σ\sigma-locally finite network

Added:

Mar 14, 2026

Difficulty:

A kk-netork is a network: This was done in (T11).

35

Completely regular   ⟹  \implies Regular

Added:

Mar 14, 2026

Difficulty:

Let f:X→[0,1]f : X \to [0, 1] continuous with f(A)={0}f(A) = \{0\} and f(b)=1f(b) = 1. Then U=f−1([0,1/2))U = f^{-1}([0, 1/2)) and V=f−1((1/2,1])V = f^{-1}((1/2, 1]) are disjoint with A⊆UA \subseteq U and b∈Vb \in V.

40

Path connected   ⟹  \implies Connected

Added:

Mar 15, 2026

Difficulty:

A path component is always a subset of a connected component: If f:[0,1]→Xf : [0, 1] \to X is a path from xx to yy, then f([0,1])f([0, 1]) is a connected set containing xx and yy.

44

Partition topology   ⟹  \implies Extremally disconnected

Added:

Mar 18, 2026

Difficulty:

In a partition topology, every open set is clopen, and equals its own closure.

45

(Extremally disconnected ∧ T2T_2)   ⟹  \implies Totally separated

Added:

Mar 18, 2026

Difficulty:

If x∈Ux \in U and y∈Vy \in V with U∩V=∅U \cap V = \emptyset, then in particular, y∉U‾y \notin \overline{U}, which must be clopen.

46

Totally separated   ⟹  \implies Totally disconnected

Added:

Mar 18, 2026

Difficulty:

Take x≠yx \ne y. Then there’s some AA clopen with y∈Ay \in A and x∉Ax \notin A, so yy cannot be in the connected component of xx.

47

Totally disconnected   ⟹  \implies Totally path disconnected

Added:

Mar 18, 2026

Difficulty:

Path connected components are subsets of connected components. So path connected components are singletons, which implies constant paths.

48

Totally separated   ⟹  \implies Functionally Hausdorff

Added:

Mar 18, 2026

Difficulty:

Let x∈Ax \in A and y∉Ay \notin A with AA clopen. Then χA\chi_A (indicator function of AA) is continuous, since any preimage is one of {∅,A,AC,X}\{\emptyset, A, A^C, X\} and all are open. χA(x)=1\chi_A(x) = 1 and χA(y)=0\chi_A(y) = 0.

49

Totally path disconnected   ⟹  \implies T1T_1

Added:

Mar 18, 2026

Difficulty:

Contrapositively, suppose every nbd of xx must contain yy. Then f(0)=xf(0) = x and f(t)=yf(t) = y for t∈(0,1]t \in (0, 1] is continuous.

57

Locally pseudometrizable   ⟹  \implies First countable

Added:

Mar 20, 2026

Difficulty:

Let WW be a nbd of xx which is pseudometrizable. Then the open balls B(x,1/n)⊆WB(x, 1/n) \subseteq W form a countable local basis.

64

Locally path connected   ⟹  \implies Locally connected

Added:

Mar 21, 2026

Difficulty:

A path component is always a subset of a connected component (seen in T40).

70

k3k_3-space   ⟹  \implies T1T_1

Added:

Mar 23, 2026

Difficulty:

Let x∈Xx \in X. If K⊆XK \subseteq X is compact T2T_2, then {x}∩K\{x\} \cap K is clearly closed in KK. This proves {x}\{x\} is closed.

71

Hyperconnected   ⟹  \implies Strongly connected

Added:

Mar 23, 2026

Difficulty:

If f:X→Rf : X \to \R is continuous and nonconstant, then for some x≠yx \ne y there exists zz with f(x)<z<f(y)f(x) < z < f(y) and the sets f−1((−∞,z))f^{-1}((-\infty, z)) and f−1((z,∞))f^{-1}((z, \infty)) are disjoint, open, and nonempty.

72

Ultraconnected   ⟹  \implies Collectionwise normal

Added:

Mar 23, 2026

Difficulty:

By definition, a discrete family must be disjoint, so in an ultraconnected space, it has at most one nonempty closed set FF. Then just choose XX to be the open set with F⊆XF \subseteq X.

73

(Zero dimensional ∧ T0T_0)   ⟹  \implies Totally separated

Added:

Mar 23, 2026

Difficulty:

Take x≠yx \ne y and suppose UU is a nbd of xx not containing yy. Let x∈B⊆Ux \in B \subseteq U with BB clopen, so y∉By \notin B. Similarly, y∈BCy \in B^C is clopen and x∉BCx \notin B^C.

79

Strongly connected   ⟹  \implies Connected

Added:

Mar 23, 2026

Difficulty:

If CC is a clopen set, then the indicator function χC\chi_C is continuous, so it must be constant equal to zero or one (meaning C=∅C = \emptyset or C=XC = X).

81

(Weakly locally compact ∧ KC)   ⟹  \implies Locally relatively compact

Added:

Mar 23, 2026

Difficulty:

Let x∈V⊆Kx \in V \subseteq K with VV open and KK compact (in particular, KK is closed). Then the sets of the form U∩VU \cap V where UU is any open set is a local basis for xx and U∩V‾⊆K‾=K\cl{U \cap V} \subseteq \cl{K} = K are all compact.

83

(Locally injectively path connected ∧ ¬ Discrete)   ⟹  \implies ¬ Cardinality <c\lt\mathfrak c

Added:

Mar 21, 2026

Difficulty:

If XX is not discrete, then some path is non-constant, so some f:[0,1]→Xf : [0, 1] \to X is injective, meaning card(X)≥card([0,1])=c\text{card}(X) \ge \text{card}([0, 1]) = \mathfrak{c}.

85

Discrete   ⟹  \implies Completely metrizable

Added:

Mar 13, 2026

Difficulty:

The discrete metric d(x,y)=1d(x, y) = 1 iff x≠yx \ne y is complete: If ∣xn−xm∣<1/2\abs{x_n - x_m} < 1/2, then xn=xmx_n = x_m.

87

Ultraconnected   ⟹  \implies Ultranormal

Added:

Mar 13, 2026

Difficulty:

If no disjoint nonempty closed sets exist, one of the disjoint closed sets is empty, and the other is contained in XX, which is clopen.

89

(Locally path connected ∧ ¬ Discrete)   ⟹  \implies ¬ Totally path disconnected

Added:

Mar 13, 2026

Difficulty:

Contrapositively, if all paths were constant, then any basis of path connected sets must be made up of singletons, proving it would be discrete.

91

(Hyperconnected ∧ Normal)   ⟹  \implies Ultraconnected

Added:

Mar 13, 2026

Difficulty:

Contrapositively, assume A,BA,B are disjoint, nonempty, and closed. Then we could separate them with U,VU,V open sets, disproving hyperconnectivity.

92

Has a dispersion point   ⟹  \implies Biconnected

Added:

Mar 13, 2026

Difficulty:

Let XX be partitioned into two sets with at least 2 elements each. One of them contains pp, and so the other is contained in X∖{p}X \setminus \{p\}, so it is disconnected.

96

Hyperconnected   ⟹  \implies Extremally disconnected

Added:

Mar 13, 2026

Difficulty:

Every open set is dense, so V‾=X\overline{V} = X is trivially clopen for any open VV.

97

(Extremally disconnected ∧ Connected)   ⟹  \implies Hyperconnected

Added:

Mar 13, 2026

Difficulty:

Let VV be open. Then V‾\overline{V} is clopen, so it is either empty or VV is dense (no other nonempty open sets are disjoint with VV).

99

(T1T_1 ∧ Normal)   ⟹  \implies T4T_4

Added:

Mar 13, 2026

Difficulty:

Let x≠yx \ne y. T1T_1 implies {x}\{x\} and {y}\{y\} are closed, and normal implies there are {x}⊆U\{x\} \subseteq U and {y}⊆V\{y\} \subseteq V open sets with U∩V=∅U \cap V = \emptyset. So it is T2T_2 and normal.

102

First countable   ⟹  \implies Well-based

Added:

Mar 13, 2026

Difficulty:

Let {Vn}\{V_n\} be a countable local basis of pp. Let Um=⋂n≤mVnU_m = \bigcap_{n \le m} V_n. Now just remove duplicates.

Rigorously, define M(V)={m∈ω : Vm⊂V}M(V) = \{ m \in \omega \ : \ V_m \subset V \} for each VV open. Then W0=U0W_0 = U_0 and Wn+1=UM(Wn)W_{n+1} = U_{M(W_n)} is a valid definition with {Wn}\{W_n\} well ordered by reverse-inclusion, unless some M(Wn)M(W_n) is empty, for which {Wn}\{W_n\} is finite, and that’s okay.

103

Well-based   ⟹  \implies Radial

Added:

Mar 13, 2026

Difficulty:

Take a local basis of pp which is well-ordered by reverse inclusion. Then it’s isomorphic to some ordinal α\alpha and it can be enumerated with {Vβ}β<α\{V_\beta\}_{\beta < \alpha}. Since p∈A‾p \in \overline{A}, use the axiom of choice to construct xβ∈Vβ∩A∖{p}x_\beta \in V_\beta \cap A \setminus \{p\}.

This is a similar proof to First countable   ⟹  \implies Fréchet Urysohn (T183), just with transfinite sequences now (and using the full axiom of choice, not just countable).

109

(Ultraconnected ∧ R0R_0)   ⟹  \implies Indiscrete

Added:

Mar 13, 2026

Difficulty:

If x≠yx \ne y are indistinguishable, then {x}‾∩{y}‾=∅\overline{\{x\}} \cap \overline{\{y\}} = \emptyset. So no two distinct points are distinguishable.

113

T4T_4   ⟹  \implies T312T_{3 \frac{1}{2}}

Added:

Mar 24, 2026

Difficulty:

A T4T_4 space is normal and T2T_2, in particular, R0R_0. So by (T37), it is completely regular.

114

T312T_{3 \frac{1}{2}}   ⟹  \implies Functionally Hausdorff

Added:

Mar 24, 2026

Difficulty:

The space is T2T_2, so given x≠yx \ne y, {y}\{y\} is closed. It’s also completely regular, so there is a continuous map f:X→[0,1]f : X \to [0, 1] with f(x)=0f(x) = 0 and f(y)=1f(y) = 1.

115

T312T_{3 \frac{1}{2}}   ⟹  \implies T3T_3

Added:

Mar 24, 2026

Difficulty:

The space is T2T_2 and completely regular. By (T35), it is regular.

134

(Baire ∧ ¬ Empty)   ⟹  \implies ¬ Meager

Added:

Mar 24, 2026

Difficulty:

If XX is a countable union of nowhere dense sets, then either it is a union of zero sets (so XX is empty), or X≠∅X \ne \emptyset can’t have empty interior (so XX is not Baire).

140

Menger   ⟹  \implies Lindelöf

Added:

Mar 25, 2026

Difficulty:

Given an open cover U\mathcal{U}, define Un=U\mathcal{U}_n = \mathcal{U} for all nn and so ⋃n<ωFn\bigcup_{n < \omega} \mathcal{F}_n is a countable cover, since each Fn⊆Un\mathcal{F}_n \subseteq \mathcal{U}_n is finite.

143

Door   ⟹  \implies T0T_0

Added:

Mar 13, 2026

Difficulty:

Take x≠yx \ne y. If {x}\{x\} is open, it’s a nbd of xx and not of yy. If it is closed, {x}C\{x\}^C is a nbd of yy not of xx.

148

(Regular ∧ T0T_0)   ⟹  \implies T3T_3

Added:

Mar 13, 2026

Difficulty:

Let x≠yx \ne y such that x∈Wx \in W and y∉Wy \notin W for some open WW. Then x∉F=WCx \notin F = W^C, so by regularity, choose disjoint open sets U,VU,V with F⊆UF \subseteq U and x∈Vx \in V. Since y∈Uy \in U, this proves being T2T_2. T2T_2 and regular is T3T_3 by definition.

151

(Completely regular ∧ T0T_0)   ⟹  \implies T312T_{3 \frac{1}{2}}

Added:

Mar 25, 2026

Difficulty:

It suffices to show T2T_2. For x≠yx \ne y. The space is T0T_0, so by swapping xx and yy if needed, suppose yy has a nbd not of xx, which means x∉{y}‾x \notin \cl{\{y\}}. Completely regular implies there’s a separation between xx and {y}‾\cl{\{y\}}, which is a separation of xx and yy.

169

Scattered   ⟹  \implies T0T_0

Added:

Mar 13, 2026

Difficulty:

Contrapositively, if x≠yx \ne y were indistinguishable, then {x,y}\{x, y\} would have no isolated point.

174

Sober   ⟹  \implies T0T_0

Added:

Mar 25, 2026

Difficulty:

Note that T0T_0 implies {x}‾≠{y}‾\cl{\{x\}} \ne \cl{\{y\}} for any x≠yx \ne y. So contrapositively, if A={x}‾={y}‾A = \cl{\{x\}} = \cl{\{y\}}, then the closed set AA is the closure of two distinct singletons (not unique), so the space is not sober.

183

First countable   ⟹  \implies Fréchet Urysohn

Added:

Mar 13, 2026

Difficulty:

Take a countable local basis {Vn}\{V_n\} of pp. By constructing Wn=⋃j=1nVnW_n = \bigcup_{j=1}^n V_n, {Wn}\{W_n\} is a shrinking local basis. Since p∈A‾p \in \overline{A}, select xn∈Wn∩A∖{p}x_n \in W_n \cap A \setminus \{p\} for each nn and xn→px_n \to p.

184

Fréchet Urysohn   ⟹  \implies Sequential

Added:

Mar 13, 2026

Difficulty:

If scl(A)\text{scl}(A) denotes the sequential closure, then Fréchet Urysohn means “A‾⊆scl(A)\overline{A} \subseteq \text{scl}(A) for all AA” and sequential means “scl(A)⊆A\text{scl}(A) \subseteq A implies AA is closed for all AA”. So if the former is true, then assuming scl(A)⊆A\text{scl}(A) \subseteq A, we have A‾⊆scl(A)⊆A\overline{A} \subseteq \text{scl}(A) \subseteq A, proving AA is closed.

188

(Sequentially compact ∧ Sequentially discrete)   ⟹  \implies Finite

Added:

Mar 13, 2026

Difficulty:

Contrapositively, if XX is infinite, let A={x0,x1,x2,… }⊆XA = \{x_0, x_1, x_2, \dots\} \subseteq X be countable. Since no subsequence of AA is eventually constant, any subsequence must not converge.

204

Discrete   ⟹  \implies Homogeneous

Added:

Mar 13, 2026

Difficulty:

Any bijective function is a homeomorphism in discrete space. Just take the permutation that swaps aa and bb.

205

Radial   ⟹  \implies Pseudoradial

Added:

Mar 13, 2026

Difficulty:

Essentially the same proof as Fréchet Urysohn   ⟹  \implies Sequential (T184). Just swap “sequential closure” with “radial closure”.

209

(Has an isolated point ∧ Homogeneous)   ⟹  \implies Discrete

Added:

Mar 26, 2026

Difficulty:

Let pp be isolated and ϕ:X→X\phi : X \to X with ϕ(p)=q\phi(p) = q a homeomorphism. Then qq is isolated. Do this for every qq.

221

Countable sets are discrete   ⟹  \implies T1T_1

Added:

Mar 12, 2026

Difficulty:

For x≠yx \ne y, {x,y}\{x, y\} is discrete, so some nbd of yy does not contain xx and vice-versa.

222

Countable sets are discrete   ⟹  \implies Anticompact

Added:

Mar 26, 2026

Difficulty:

If KK is infinite, let A={xn}⊆KA = \{x_n\} \subseteq K be a countable subset. But then AA is discrete and sets of the form {xn}\{x_n\} form a cover for AA with no finite subcover, so KK can’t be compact.

226

US   ⟹  \implies T1T_1

Added:

Mar 21, 2026

Difficulty:

Contrapositively, suppose there is no nbd of xx which doesn’t contain yy as well. Then for the constant sequence xn≔xx_n \coloneqq x, xn→xx_n \to x and xn→yx_n \to y.

227

KC   ⟹  \implies Weak Hausdorff

Added:

Mar 27, 2026

Difficulty:

If f:K→Xf : K \to X continuous and KK compact, f(K)f(K) is compact, so it is closed by KC.

228

T2T_2   ⟹  \implies k1k_1-Hausdorff

Added:

Mar 27, 2026

Difficulty:

T2T_2 implies Δ⊆X2\Delta \subseteq X^2 is closed. So Δ∩K\Delta \cap K is trivially closed in KK for any K⊆X2K \subseteq X^2.

230

(First countable ∧ US)   ⟹  \implies T2T_2

Added:

Mar 21, 2026

Difficulty:

Let {Un}\{U_n\} and {Vn}\{V_n\} be countable local bases of x≠yx \ne y. Contrapositively, suppose Un∩Vn≠∅U_n \cap V_n \ne \emptyset for all nn, and choose zn∈Un∩Vnz_n \in U_n \cap V_n. Then zn→xz_n \to x and zn→yz_n \to y.

231

Embeddable in R\mathbb R   ⟹  \implies Embeddable into Euclidean space

Added:

Mar 21, 2026

Difficulty:

R\R is homeomorphic to R1\R^1.

233

(Connected ∧ Embeddable in R\mathbb R)   ⟹  \implies Locally path connected

Added:

Mar 28, 2026

Difficulty:

Not sure why they expected locally here. If f:X→f(X)⊆Rf : X \to f(X) \subseteq \R is a homeomorphism and XX connected, then f(X)f(X) is connected. Every connected set in R\R is path connected, so f(X)≃Xf(X) \simeq X is path connected.

252

Partition topology   ⟹  \implies Pseudometrizable

Added:

Mar 13, 2026

Difficulty:

Define d(x,y)=1d(x, y) = 1 if x,yx,y belong to the same set in the partition, and 0 otherwise. This is a pseudometric.

262

(R1R_1 ∧ Hyperconnected)   ⟹  \implies Indiscrete

Added:

Mar 28, 2026

Difficulty:

If no nonempty disjoint open sets exist, R1R_1 implies all points are indistinguishable.

267

(Alexandrov ∧ T1T_1)   ⟹  \implies Discrete

Added:

Mar 29, 2026

Difficulty:

Let V\mathcal{V} be all nbds of xx. Then ⋂V\bigcap \mathcal{V} is an open set. For any y≠xy \ne x, there is some nbd UyU_y of xx with y∉Uyy \notin U_y, so {x}=⋂V\{x\} = \bigcap \mathcal{V}.

271

Second countable   ⟹  \implies Has a countable kk-network

Added:

Mar 29, 2026

Difficulty:

Any network of open sets is a kk-network. If K⊆⋃N∗⊆VK \subseteq \bigcup \mathcal{N}^* \subseteq V for some KK compact, we can take a finite subcollection of N∗\mathcal{N}^*. Any basis is a network. Therefore, a countable basis is a countable kk-network.

276

Hereditarily Lindelöf   ⟹  \implies Has countable spread

Added:

Mar 29, 2026

Difficulty:

If A⊆XA \subseteq X is discrete, it can be covered by nbds which contain one element each. So if AA were to be Lindelöf, it has to have countably many elements.

284

Alexandrov   ⟹  \implies Locally compact

Added:

Mar 30, 2026

Difficulty:

If V\mathcal{V} is the collection of all nbds of xx, W=⋂VW = \bigcap \mathcal{V} is the smallest nbd of xx, so {W}\{W\} is a compact local basis of xx: for any W\mathcal{W} open cover of WW, there must be some V∈WV \in \mathcal{W} with x∈Vx \in V, and then {V}\{V\} is a subcover.

285

Alexandrov   ⟹  \implies First countable

Added:

Mar 30, 2026

Difficulty:

If V\mathcal{V} is the collection of all nbds of xx, W=⋂VW = \bigcap \mathcal{V} is the smallest nbd of xx, so {W}\{W\} is a local basis of xx.

291

(Anticompact ∧ Countable)   ⟹  \implies Hemicompact

Added:

Mar 30, 2026

Difficulty:

If X={x1,x2,… }X = \{x_1, x_2, \dots\} is countable, define Kn={x1,x2,…,xn}K_n = \{ x_1, x_2, \dots, x_n \}. Then X=⋃n=1∞KnX = \bigcup_{n=1}^\infty K_n and every compact/finite set is contained in some KnK_n.

293

Locally finite   ⟹  \implies Anticompact

Added:

Mar 30, 2026

Difficulty:

Cover a compact set KK with finite nbds. It has a finite subcover of finite sets, so it must be finite.

297

Countably-many continuous self-maps   ⟹  \implies Countable

Added:

Mar 30, 2026

Difficulty:

Every point pp is associated with the constant map x↦px \mapsto p, which is continuous. So XX has at most as many continuous self-maps.

308

(R0R_0 ∧ Has an isolated point ∧ Has multiple points)   ⟹  \implies ¬ Connected

Added:

Mar 31, 2026

Difficulty:

Let pp be the isolated point with nbd VV so that V∩X={p}V \cap X = \{p\}. Every other point x≠px \ne p has a nbd not containing pp, so if UU is the union of all open sets not containing pp, we have U∩V=∅U \cap V = \emptyset and U∩V=XU \cap V = X.

311

Has closed retracts   ⟹  \implies T1T_1

Added:

Mar 31, 2026

Difficulty:

Every singleton is a retract: the constant function f:X→{p}f : X \to \{p\} is continuous.

314

Has an isolated point   ⟹  \implies ¬ Meager

Added:

Apr 2, 2026

Difficulty:

If pp is isolated, any set containing pp cannot be nowhere empty, since it contains the open set {p}\{p\}.

316

Alexandrov   ⟹  \implies Locally path connected

Added:

Apr 2, 2026

Difficulty:

Let WW be the smallest nbd of xx. Then WW must be path connected since it is indiscrete as a subspace topology, and so any function f:[0,1]→Wf : [0, 1] \to W must be continuous.

318

(Anticompact ∧ T1T_1)   ⟹  \implies k1k_1-Hausdorff

Added:

Apr 2, 2026

Difficulty:

In a T1T_1 space, finite sets are discrete, in particular, they are T2T_2.

319

(Countable ∧ ¬ Has an isolated point ∧ T1T_1)   ⟹  \implies Meager

Added:

Apr 2, 2026

Difficulty:

XX is a countable union of singletons. For each xx, {x}‾={x}\cl{\{x\}} = \{x\} because XX is T1T_1, and int({x})=∅\text{int}(\{x\}) = \emptyset because no point is isolated.

324

k3k_3-space   ⟹  \implies k2k_2-space

Added:

Apr 2, 2026

Difficulty:

Suppose that for every KK compact T2T_2 and f:K→Xf : K \to X continuous, that f−1(A)f^{-1}(A) is open. In particular, for each K⊆XK \subseteq X compact T2T_2, the inclusion ι:K→X\iota : K \to X is continuous, and so ι−1(A)=K∩A\iota^{-1}(A) = K \cap A is open. So AA is open.

325

k2k_2-space   ⟹  \implies k1k_1-space

Added:

Apr 2, 2026

Difficulty:

Suppose that for every KK compact and f:K→Xf : K \to X continuous, that f−1(A)f^{-1}(A) is open. In particular, for each KK compact and T2T_2, f−1(A)f^{-1}(A) is open. So AA is open.

328

Locally metrizable   ⟹  \implies Locally Hausdorff

Added:

Apr 2, 2026

Difficulty:

A metric space is Hausdorff: For x≠yx \ne y, let r=d(x,y)/2r = d(x, y)/2 and then B(x,r)∩B(y,r)=∅B(x, r) \cap B(y, r) = \emptyset.

329

Locally Euclidean   ⟹  \implies Locally metrizable

Added:

Apr 2, 2026

Difficulty:

Rn\R^n is a normed space, so it is metrizable.

330

Locally pseudometrizable   ⟹  \implies R0R_0

Added:

Apr 2, 2026

Difficulty:

Let x≠yx \ne y and VV a pseudometrizable nbd of xx. If y∉Vy \notin V, we’re done. Otherwise, if they are indistinguishable, we have r=d(x,y)>0r = d(x, y) > 0 and then y∉B(x,r)y \notin B(x, r).

332

Locally Euclidean   ⟹  \implies Locally compact

Added:

Apr 2, 2026

Difficulty:

Let VV be a nbd such that V≃W⊆RnV \simeq W \subseteq \R^n. If Rn\R^n is locally compact, W≃VW \simeq V is as well. But that holds since the balls B(x,δ)B(x, \delta) form a basis and B(x,δ)‾\cl{B(x, \delta)} is compact in finite-dimensional metric spaces.

343

Strongly paracompact   ⟹  \implies Paracompact

Added:

Apr 2, 2026

Difficulty:

Take a star-finite open cover. xx is in some element UU, which is open. So for any nbd VV of xx, U∩VU \cap V is a nbd which intersects finitely many elements. So it is locally finite.

347

Has a group topology   ⟹  \implies Homogeneous

Added:

Apr 2, 2026

Difficulty:

The map ϕ(x)=(ba−1)x\phi(x) = (ba^{-1})x satisfies ϕ(a)=b\phi(a) = b, is bijective, continuous, and ϕ−1(x)=(ab−1)x\phi^{-1}(x) = (ab^{-1})x is also continuous.

349

Indiscrete   ⟹  \implies Homogeneous

Added:

Apr 3, 2026

Difficulty:

Any bijective function is a homeomorphism. Just take Φ\Phi as the permutation that swaps aa and bb.

352

Has a countable kk-network   ⟹  \implies Has a σ\sigma-locally finite kk-network

Added:

Mar 14, 2026

Difficulty:

Any countable family is a countable union of finite sets. Finite sets are clearly locally finite. So any countable family is σ\sigma-locally finite.

397

(Countable sets are discrete ∧ Countably compact)   ⟹  \implies Finite

Added:

Mar 17, 2026

Difficulty:

Countably compact implies every sequence has an accumulation point, which would contradict being discrete.

406

(Pseudonormal ∧ Countable)   ⟹  \implies Normal

Added:

Apr 3, 2026

Difficulty:

If A,BA,B are closed and disjoint, just apply the theorem to A⊆U=BCA \subseteq U = B^C, since AA must be countable. Then A⊆V⊆V‾⊆UA \subseteq V \subseteq \cl{V} \subseteq U so that B⊆W=V‾CB \subseteq W = \cl{V}^C and V∩W=∅V \cap W = \emptyset.

414

Sequentially discrete   ⟹  \implies US

Added:

Mar 27, 2026

Difficulty:

Any converging sequence is eventually constant, and this constant has to be unique.

420

T2T_2   ⟹  \implies Semi-Hausdorff

Added:

Mar 21, 2026

Difficulty:

If x∈Ux \in U and y∈Vy \in V with U∩V=∅U \cap V = \emptyset, in particular, y∉U‾y \notin \cl{U}. So x∈W=int(U‾)x \in W = \text{int}(\cl{U}) is regular and y∉Wy \notin W. (blaze it)

421

(T1T_1 ∧ Semiregular)   ⟹  \implies Semi-Hausdorff

Added:

Mar 21, 2026

Difficulty:

If x∈Ux \in U is a nbd with y∉Uy \notin U, let OO be a regular basis element with x∈O⊆Ux \in O \subseteq U.

429

(Connected ∧ ¬ Cardinality ≥3\geq 3 ∧ ¬ Empty)   ⟹  \implies Has a dispersion point

Added:

Mar 20, 2026

Difficulty:

If XX has one or two points, clearly X∖{p}X \setminus \{p\} has either 1 point (trivially totally disconnected), or it’s empty (also totally disconnected, since there are no connected components).

437

Discrete   ⟹  \implies Locally nn-Euclidean

Added:

Mar 21, 2026

Difficulty:

{x}\{x\} is homeomorphic to R0\R^0.

438

(Locally nn-Euclidean ∧ Has an isolated point)   ⟹  \implies Discrete

Added:

Apr 4, 2026

Difficulty:

Some nbd around the isolated point has to be homeomorphic to R0\R^0. But that implies every point has a nbd homeomorphic to R0\R^0, and so every point is isolated.

441

Hereditarily separable   ⟹  \implies Countably tight

Added:

Apr 4, 2026

Difficulty:

For each A⊆XA \subseteq X, as it is separable subspace, there is a countable D⊆AD \subseteq A with A⊆D‾A \subseteq \cl{D}. So then A‾⊆D‾‾=D‾\cl{A} \subseteq \cl{\cl{D}} = \cl{D}.

444

(Has a group topology ∧ Has multiple points)   ⟹  \implies ¬ Fixed point property

Added:

Apr 4, 2026

Difficulty:

If g≠1g \ne 1, then the map x↦gxx \mapsto gx is continuous yet has no fixed point.

447

Fixed point property   ⟹  \implies T0T_0

Added:

Apr 5, 2026

Difficulty:

If p≠qp \ne q were to be topologically indistinguishable, let f(x)=pf(x) = p for all x≠px \ne p and f(p)=qf(p) = q. Then ff is continuous yet has no fixed point.

451

(Indiscrete ∧ ¬ Cardinality <c\lt\mathfrak c)   ⟹  \implies Locally injectively path connected

Added:

Mar 21, 2026

Difficulty:

If card(X)≥c=card([0,1])\text{card}(X) \ge \mathfrak{c} = \text{card}([0, 1]), then there exists an injective function f:[0,1]→Xf : [0, 1] \to X, which is clearly continuous in the trivial space, and a path from f(0)f(0) to f(1)f(1).

459

Embeddable into Euclidean space   ⟹  \implies Second countable

Added:

Apr 5, 2026

Difficulty:

If f:X→Y⊆Rnf : X \to Y \subseteq \R^n is a homeomorphism, the balls of the form B(r,1/n)B(r, 1/n) for r∈Qr \in \Q and n∈Nn \in \N form a countable basis for Rn\R^n, so f−1(B(r,1/n))f^{-1}(B(r, 1/n)) forms a basis for XX.

460

Embeddable into Euclidean space   ⟹  \implies Metrizable

Added:

Apr 5, 2026

Difficulty:

If X≃Y⊆RnX \simeq Y \subseteq \R^n, note that Rn\R^n is metrizable because it’s a normed vector space, and being metrizable is hereditary, so Y≃XY \simeq X is metrizable.

467

Partition topology   ⟹  \implies Alexandrov

Added:

Apr 5, 2026

Difficulty:

If {Xi}i∈I\{X_i\}_{i \in I} is the partition for the topology of XX, then for each x∈Xx \in X, the set XiX_i such that x∈Xix \in X_i is the smallest nbd of xx.

468

(Partition topology ∧ Connected)   ⟹  \implies Indiscrete

Added:

Apr 5, 2026

Difficulty:

Any set of the partition is a clopen set. So if XX is the only nonempty clopen set, the partition is {X}\{X\}.

493

(Countable ∧ Discrete)   ⟹  \implies Ordinal space

Added:

Mar 12, 2026

Difficulty:

It has a bijection f:X→nf: X \to n if finite, or f:X→ωf : X \to \omega if infinite. It’s a homeomorphism either way.

512

(Quasi-sober ∧ T0T_0)   ⟹  \implies Sober

Added:

Mar 25, 2026

Difficulty:

T0T_0 implies x≠y  ⟹  {x}‾≠{y}‾x \ne y \implies \cl{\{x\}} \ne \cl{\{y\}}. Thus, if A={x}‾A = \cl{\{x\}}, then this xx must be unique.

527

Spectral   ⟹  \implies Locally compact

Added:

Mar 25, 2026

Difficulty:

If there’s a basis of compact open sets, the ones intersecting xx form a local basis for xx.

528

(Noetherian ∧ Sober)   ⟹  \implies Spectral

Added:

Mar 25, 2026

Difficulty:

The open sets are trivially closed under finite intersections and form a basis. Since they are all compact, including XX itself, the space is spectral.

676

(Has a point with a unique neighborhood ∧ Locally injectively path connected)   ⟹  \implies Injectively path connected

Added:

Mar 21, 2026

Difficulty:

Take a basis of open injectively path connected sets. There’s a point pp of which the only possible basis element containing pp is XX. So XX is injectively path connected.

677

Locally finite   ⟹  \implies Has a σ\sigma-locally finite network

Added:

Mar 21, 2026

Difficulty:

Let N={{x} : x∈X}\mathcal{N} = \{ \{x\} \ : \ x \in X \} be the network of singletons. N\mathcal{N} is locally finite: Every point has a finite nbd, so it obviously intersects finitely many elements of N\mathcal{N}.

690

(KC ∧ Hereditarily Lindelöf)   ⟹  \implies Strongly KC

Added:

Mar 27, 2026

Difficulty:

Every countably compact set is also Lindelöf, so it is compact (T106), hence it is closed.