Difficulty: 3

For proofs that are somewhat easy, maybe takes few minutes figure it out.

3

Sequentially compact     \implies Countably compact

Added:

Mar 14, 2026

Difficulty:

Contrapositively, suppose {Vn}\{V_n\} is a cover with no finite subcover. Then for Wn=mnVnW_n = \bigcup_{m \le n} V_n, each XWnX \setminus W_n is nonempty. So for each nn, choose xnXWnx_n \in X \setminus W_n. The sequence {xn}\{x_n\} cannot have a converging subsequence: If pXp \in X, then pVmp \in V_m for some mm and so xnVmx_n \notin V_m for all n>mn > m.

5

Exhaustible by compacts     \implies Hemicompact

Added:

Mar 14, 2026

Difficulty:

Let {Kn}\{K_n\} be a countable compact cover of XX of which for all xXx \in X, some KnK_n is a compact nbd of xx. Let KK be compact. For each xKx \in K, let nxn_x be the least element of which KnK_n is a compact nbd. Then {int(Knx)}\{\text{int}(K_{n_x})\} is a cover of KK, which must have a finite subcover, and so finitely many KnK_n. Meaning AnmKnA \subseteq \bigcup_{n \le m} K_n for big enough mm.

So define Km=nmKnK'_m = \bigcup_{n \le m} K_n. Clearly {Km}\{K'_m\} is a countable compact cover of XX and any compact is contained in some KmK'_m by above.

11

Has a countable kk-network     \implies Has a countable network

Added:

Mar 14, 2026

Difficulty:

We just have to argue a kk-netork is a network: Let N\mathcal{N} be a kk-network. Singletons are compact. So in a kk-network, for each xx in an open set UU, we can find NxN\mathcal{N}^*_x \subseteq \mathcal{N} with {x}NxU\{x\} \subseteq \bigcup \mathcal{N}^*_x \subseteq U (we don’t need Nx\mathcal{N}^*_x to be finite here, so no need for the axiom of choice, just take every set of N\mathcal{N} containing xx). Thus,

U=xU{x}xUNxU      U is a union of sets in N, so it is a networkU = \bigcup_{x \in U} \{x\} \subseteq \bigcup_{x \in U} \mathcal{N}^*_x \subseteq U \ \implies \ \text{$U$ is a union of sets in $\mathcal{N}$, so it is a network}

19

(T1T_1 ∧ Weakly countably compact)     \implies Countably compact

Added:

Mar 14, 2026

Difficulty:

Let AA be an infinite set. Contrapositively, suppose every limit point of AA is not an ω\omega-accumulation point. If pp were to be a limit point of AA, there exists a nbd VV of pp of which VA={a1,,an}V \cap A = \{ a_1, \dots, a_n \} is finite. But now for each aka_k, there’s VkV_k, a nbd of pp, so that akVka_k \notin V_k (by being T1T_1). Then W=VV1VnW = V \cap V_1 \cap \cdots \cap V_n is a nbd of pp with WA=W \cap A = \emptyset. So AA is an infinite set with no limit points.

86

Functionally Hausdorff     \implies T212T_{2 \frac{1}{2}}

Added:

Mar 13, 2026

Difficulty:

Let f:X[0,1]f : X \to [0, 1] with f(a)=0f(a) = 0 and f(b)=1f(b) = 1. Take Va=f1([0,1/3))V_a = f^{-1}([0, 1/3)) and Vb=f1((2/3,1])V_b = f^{-1}((2/3, 1]). Then f(Va)f(Va)[0,1/3]f(\overline{V_a}) \subseteq \overline{f(V_a)} \subseteq [0, 1/3] and f(Vb)f(Vb)=[2/3,1]f(\overline{V_b}) \subseteq \overline{f(V_b)} = [2/3, 1]. This proves VaVb=\overline{V_a} \cap \overline{V_b} = \emptyset.

93

Has a countable network     \implies Hereditarily separable

Added:

Mar 13, 2026

Difficulty:

Let {Nn}\{N_n\} be the countable network and AXA \subseteq X. Ignore the network sets that don’t intersect AA and choose xnNnAx_n \in N_n \cap A. Then {xn}\{x_n\} has to be dense in AA: For any xAVx \in A \cap V, xNnAAVx \in N_n \cap A \subseteq A \cap V for some nn so that xnAVx_n \in A \cap V.

95

(Connected ∧ Locally path connected)     \implies Path connected

Added:

Mar 13, 2026

Difficulty:

If any path connected component is open, then there can only be one (as they form a partition of XX, disproving being connected). Take the path connected component PP of xx. For yPy \in P, let UU be a connected nbd. Then any zUz \in U is path connected to xx (just concatenate the paths xyx \sim y and yzy \sim z). So UPU \subseteq P.

120

Embeddable in R\mathbb R     \implies GO-space

Added:

Mar 13, 2026

Difficulty:

Let f:XYRf : X \to Y \subseteq \R be a homeomorphism. R\R is T1T_1, so YXY \simeq X is as well. Define order on XX by x<yx < y iff f(x)<f(y)f(x) < f(y). If UU is a nbd of xx, then f(x)f(U)f(x) \in f(U) and f(U)=VYf(U) = V \cap Y, where I=(f(x)δ,f(x)+δ)VI = (f(x) - \delta, f(x) + \delta) \subseteq V for some δ>0\delta > 0. Let J=f1(I)UJ = f^{-1}(I) \subseteq U. Suppose a,bJa,b \in J and a<z<ba < z < b. Then f(a)<f(z)<f(b)f(a) < f(z) < f(b) with f(a),f(b)If(a),f(b) \in I, so f(z)If(z) \in I and zJz \in J as we wished, to prove JJ is order-convex.

195

Locally Hausdorff     \implies T1T_1

Added:

Mar 13, 2026

Difficulty:

Take any xx and a nbd UU which is T2T_2. We wish to find a neighborhood VV not containing some other yy. If yUy \notin U, just take V=UV = U. Otherwise, take xVUx \in V \subseteq U with yVy \notin V since UU is T1T_1. But then VV is also open in XX, so we’re done.

659

(Noetherian ∧ R1R_1)     \implies Partition topology

Added:

Mar 13, 2026

Difficulty:

Let xyx \sim y iff they are indistinguishable. The equivalent classes [x][x] form a basis for a topology which must be finer than XX (if UU is a nbd of xx, it must contain all yxy \sim x). It suffices to show each [x][x] is an open set. But Y=X[x]Y = X \setminus [x] is compact, and any points of YY are distinguishable from xx, so it’s possible to find xUx \in U and YVY \subseteq V nbds with UV=U \cap V = \emptyset (this is analogous to the result that for T2T_2 spaces, any point xx and a compact KK can be separated)