π-base: Difficulty 3

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.

21

Separable     \implies Countable chain condition

Added:

Mar 15, 2026

Difficulty:

Let V\mathcal{V} be a collection of pairwise-disjoint nonempty open sets. Let DD be a dense countable set. For each VVV \in \mathcal{V}, DVD \cap V \ne \emptyset means it must be the nbd of some xnDx_n \in D. So let nVn \sim V if and only if xnVx_n \in V. As the collection is pairwise-disjoint, this induces a function f:ωVf : \omega \to \mathcal{V} with f(n)=Vf(n) = V that must be surjective, and so card(ω)card(V)\text{card}(\omega) \ge \text{card}(\mathcal{V}).

22

(Anticompact ∧ Countable)     \implies Has a countable kk-network

Added:

Mar 17, 2026

Difficulty:

Let N={{x} : xX}\mathcal{N} = \{ \{x\} \ : \ x \in X \} be the network of singletons. The open sets don’t matter: If any compact KK is necessarily finite, then N={{x} : xK}NN^* = \{ \{x\} \ : \ x \in K \} \subseteq \mathcal{N} is finite and KNK \subseteq N^*. Since XX is countable, so is N\mathcal{N}.

33

T3T_3     \implies T212T_{2 \frac{1}{2}}

Added:

Mar 15, 2026

Difficulty:

Let xyx \ne y. Since XX is T2T_2, let xUx \in U and yVy \in V nbds with UV=U \cap V = \emptyset. This means xVx \notin \overline{V} and yUy \notin \overline{U}, so being regular, let Wx,WVW_x,W_V be disjoint nbds with xWxx \in W_x and VWV\overline{V} \subseteq W_V and similarly Wy,WUW_y,W_U disjoint nbds with yWyy \in W_y and UWU\overline{U} \subseteq W_U. Then Ox=WxUO_x = W_x \cap U and Oy=WyO_y = W_y are the nbds of xx and yy of which OxOy=\overline{O_x} \cap \overline{O_y} = \emptyset (remember that OxWxU\overline{O_x} \subseteq \overline{W_x} \cap \overline{U}).

37

(Normal ∧ R0R_0)     \implies Completely regular

Added:

Mar 15, 2026

Difficulty:

Let AA be a closed set and xAx \notin A. We argue {x}A=\overline{\{x\}} \cap A = \emptyset: Every point of {x}\overline{\{x\}} is indistinguishable from xx, as the space is R0R_0, so y{x}Ay \in \overline{\{x\}} \cap A would imply xAAx \in \overline{A} \subseteq A. So by Urysohn’s lemma, let f:X[0,1]f : X \to [0, 1] with f(A)={0}f(A) = \{0\} and f({x})={1}f(\overline{\{x\}}) = \{1\}. In particular, f(x)=1f(x) = 1.

43

(T1T_1 ∧ Scattered)     \implies Totally disconnected

Added:

Mar 23, 2026

Difficulty:

Let CC be a connected component, and xx an isolated point of CC. XX is T1T_1 and CC is closed, so {x}\{x\} is closed in CC, and take WW the nbd of xx with WC={x}W \cap C = \{x\}. Then C{x}C \setminus \{x\} and WW is a separation of CC.

51

Hyperconnected     \implies Locally connected

Added:

Mar 20, 2026

Difficulty:

Every open set is connected: If VV were not to be, then V=U1U2V = U_1 \cup U_2 with U1,U2U_1,U_2 disjoint and open in VV, but then they must be open in XX as well.

53

(Lindelöf ∧ Weakly locally compact)     \implies Exhaustible by compacts

Added:

Mar 20, 2026

Difficulty:

By definition, it suffices to show the space is σ\sigma-compact. Let K\mathcal{K} be the set of all compact neighborhoods. So {int(K)}KK\{\text{int}(K)\}_{K \in \mathcal{K}} forms an open cover. Let CK\mathcal{C} \subseteq \mathcal{K} be countable such that {int(K)}KC\{\text{int}(K)\}_{K \in \mathcal{C}} is a countable subcover. Then X=KCKX = \bigcup_{K \in \mathcal{C}} K.

54

Zero dimensional     \implies Completely regular

Added:

Mar 20, 2026

Difficulty:

Let AA be closed and xAx \notin A. Then VA=V \cap A = \emptyset for some nbd of xx. Let BVB \subseteq V be a clopen nbd of xx. Then χB\chi_B (indicator function of BB) is continuous, as any preimage is one of {,B,Bc,X}\{\emptyset, B, B^c, X\}, with χB(A)={0}\chi_B(A) = \{0\} and χB(x)=1\chi_B(x) = 1.

66

LOTS     \implies GO-space

Added:

Mar 23, 2026

Difficulty:

A LOTS space is clearly T1T_1. For x<yx < y, consider the nbds (,y)({\leftarrow}, y) and (x,)(x, {\rightarrow}). For any given xx, if x=minXx = \min X, the sets {[x,y) : y>x}\{ [x, y) \ : \ y > x \} are open. If x=maxXx = \max X, the sets {(y,x] : y<x}\{ (y, x] \ : \ y < x \} are open. Otherwise, {(y,z) : y<x<z}\{ (y, z) \ : \ y < x < z \} are open. In all three cases, we have a local basis for xx which is trivially order-convex (unless X={x}X = \{x\}, but then the result is trivial).

82

Locally Euclidean     \implies Locally arc connected

Added:

Mar 23, 2026

Difficulty:

For each xx, let VV be a nbd with f:VRnf : V \to \R^n a homeomorphism to f(V)f(V). Let δ\delta be small enough such that B=B(f(x),δ)f(V)B = B(f(x), \delta) \subseteq f(V). Any open ball is arc connected (consider h(t)=tx+(1t)yh(t) = tx + (1-t)y), so Bn=B(f(x),δ/n)B_n = B(f(x), \delta/n) is a local basis of arc connected sets within BB which means Un=f1(Bn)U_n = f^{-1}(B_n) have the same property (homeomorphisms preserve local bases and arc-connectedness). Now do this with every xx to form a basis.

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.

131

(GO-space ∧ Connected)     \implies LOTS

Added:

Mar 24, 2026

Difficulty:

A GO-space has a basis of order-convex neighborhoods. A LOTS space has a basis containing all open intervals. So by contraposition, suppose AA is some order-convex neighborhood of a point xx that contains no open intervals. Then it must be closed. If yAy \in \cl{A} and y<xy < x, then there is some z(y,x)Az \in (y, x) \cap A. But then either (z,x)A(z, x) \subseteq A or (x,z)A(x, z) \subseteq A. The same holds if y>xy > x. But then AA is a proper nonempty clopen set, and XX is not connected (unless X={x}X = \{x\}, but then the result is trivial).

137

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

Added:

Mar 24, 2026

Difficulty:

It suffices to show a basis is a kk-network: If KUK \subseteq U with UU open and KK compact, then U=BU = \bigcup \mathcal{B}, where B\mathcal{B} is a set of basis elements. KK being compact means there exists a finite subset BB\mathcal{B}^* \subseteq \mathcal{B} with KBUK \subseteq \bigcup \mathcal{B}^* \subseteq U.

155

Regular     \implies Semiregular

Added:

Mar 25, 2026

Difficulty:

It suffices to show that for xWx \in W with WW open, there is some regular open set OO with xOWx \in O \subseteq W. By regularity, let xUx \in U and WCVW^C \subseteq V open sets with UV=U \cap V = \emptyset. In particular, UWC=\cl{U} \cap W^C = \emptyset, so UW\cl{U} \subseteq W. Then just pick O=int(U)O = \text{int}(\cl{U}).

171

(Locally Euclidean ∧ Has multiple points)     \implies ¬ Hyperconnected

Added:

Mar 25, 2026

Difficulty:

Let f:VRnf : V \to \R^n be an embedding with VV nbd of xx. If n=0n = 0 for every choice of xx, the space is discrete with two or more points, so clearly not hyperconnected. If n1n \ge 1 for some xx, then f(V)f(V) is an open set with infinitely many points, so by taking any two points with disjoint nbds UU and VV (Rn\R^n is T2T_2), we have f1(U)f^{-1}(U) and f1(V)f^{-1}(V) disjoint, open, nonempty.

180

Perfectly normal     \implies Cozero complemented

Added:

Mar 26, 2026

Difficulty:

Let UU be a cozero set. Then by perfect normality, let f:X[0,1)f : X \to [0, 1) be continuous with f1({0})=Uf^{-1}(\{0\}) = \cl{U} (since \emptyset is closed, so we chose it as the set where f1({1})=f^{-1}(\{1\}) = \emptyset, this is in fact why every closed set is a zero set in perfectly normal spaces). It follows that V=f1((0,1))V = f^{-1}((0, 1)) is cozero with UV=U \cap V = \emptyset and X=UVUVX = \cl{U} \cup V \subseteq \cl{U \cup V}.

186

Locally countable     \implies Countably tight

Added:

Mar 26, 2026

Difficulty:

Let pAp \in \cl{A} and choose BB a countable basis nbd of pp. Then D=ABD = A \cap B is a countable subset of AA such that if VV is any open nbd of pp, BVB \cap V is open, so A(BV)=DVA \cap (B \cap V) = D \cap V \ne \emptyset.

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.

213

Collectionwise normal     \implies Normal

Added:

Mar 26, 2026

Difficulty:

If AA and BB are disjoint closed sets, then AB=\cl{A} \cap \cl{B} = \emptyset and so {A,B}\{A, B\} is a discrete family.

224

(Weakly locally compact ∧ Regular)     \implies Locally relatively compact

Added:

Mar 27, 2026

Difficulty:

Take xWKx \in W \subseteq K with VV open and KK compact. Let UU and VV be a separation of xx and the closed set WCW^C. In particular, UK\cl{U} \subseteq K. The sets of the form UOU \cap O where OO is open forms a local basis for xx and each closure UOK\cl{U \cap O} \subseteq K is compact.

236

(GO-space ∧ Countably tight)     \implies First countable

Added:

Mar 28, 2026

Difficulty:

Fix pXp \in X. If pp is isolated, {{p}}\{\{p\}\} is a local basis. Otherwise, pX{p}p \in \cl{X \setminus \{p\}} and there is a countable DX{p}D \subseteq X \setminus \{p\} with pDp \in \cl{D}. So consider the intervals of the form [p,x)[p, x), (x,p](x, p], or (x,y)(x, y) for x,yDx,y \in D which are open in XX. This must be countable and it is a local basis of pp since pDp \in \cl{D} and it isn’t isolated in XX.

246

(Weakly locally compact ∧ Regular)     \implies Locally compact

Added:

Mar 28, 2026

Difficulty:

The proof is literally the same as (T224). I’d like to express my discontent with π\pi-base’s usage of the term “local basis”. To me, a local basis is by definition a collection of open sets, but what they mean by “locally compact” is: Each xx has a collection of compact sets whose interiors form a local basis for xx.

255

(Lindelöf ∧ GδG_\delta space)     \implies Hereditarily Lindelöf

Added:

Mar 28, 2026

Difficulty:

It suffices to prove any FσF_\sigma set is Lindelöf, as that implies every open set is Lindelöf in a GδG_\delta space. This follows from two basic topological facts: (1) Closed sets of Lindelöf spaces are Lindelöf: If AXA \subseteq X is closed and U\mathcal{U} is a cover of AA, then U{AC}\mathcal{U} \cup \{A^C\} is a cover of XX with a countable subcover, which induces a countable subcover of AA (2) A countable union of Lindelöf spaces {Ln}\{L_n\} is Lindelöf: If U\mathcal{U} is a cover of L=n<ωLnL = \bigcup_{n < \omega} L_n, then it is a cover of each LnL_n, which gives us a countable subcover Un\mathcal{U}_n of LnL_n, and so n<ωUn\bigcup_{n < \omega} \mathcal{U}_n is a countable subcover of LL.

256

Perfectly normal     \implies GδG_\delta space

Added:

Mar 28, 2026

Difficulty:

Let AA be closed. Then there is a continuous map f:X[0,1]f : X \to [0, 1] with f1({0})=Af^{-1}(\{0\}) = A. Thus, each Vn=f1([0,1/n))V_n = f^{-1}([0, 1/n)) is open and A=n=1VnA = \bigcap_{n=1}^\infty V_n is a GδG_\delta set.

260

Has a countable network     \implies Hereditarily Lindelöf

Added:

Mar 29, 2026

Difficulty:

Let {Nk}\{N_k\} be the countable network. Let AXA \subseteq X and U\mathcal{U} be an open cover of AA. We know for any xUUx \in U \in \mathcal{U} there is a kk such that xNkUx \in N_k \subseteq U. Let II be the set of k<ωk < \omega such that NkUN_k \subseteq U for some UUU \in \mathcal{U}, and for each kIk \in I, choose one such UkU_k. Then {Uk}kI\{U_k\}_{k \in I} is a countable subcover.

261

(Countable ∧ R0R_0)     \implies GδG_\delta space

Added:

Mar 29, 2026

Difficulty:

In R0R_0 spaces, points x,yx,y are indistinguishable iff {x}={y}\cl{\{x\}} = \cl{\{y\}}. Thus, if xVx \in V and VV is open, {x}V\cl{\{x\}} \subseteq V. So V=xX{x}V = \bigcup_{x \in X} \cl{\{x\}} is an FσF_\sigma set, as XX is countable.

272

Second countable     \implies kk-Lindelöf

Added:

Mar 29, 2026

Difficulty:

Let U\mathcal{U} be a kk-cover and B\mathcal{B} a countable basis. For any compact KK, KUK \subseteq U for some UUU \in \mathcal{U}, which can be written as a union of basis elements U=BU = \bigcup \mathcal{B}^*. This is an open cover of KK, so we can extract a finite subcover. This allows to conclude that if for each finite selection of basis elements, we select one element UU which contains their union, then this must be a kk-subcover, and the collection of all finite selections of basis elements n<ωBn\bigcup_{n < \omega} \mathcal{B}^n is countable.

282

Regular     \implies R1R_1

Added:

Mar 30, 2026

Difficulty:

xx and yy are indistinguishable iff either x{y}x \notin \cl{\{y\}} or y{x}y \notin \cl{\{x\}}. Suppose the former. Then regularity gives us xUx \in U and {y}V\cl{\{y\}} \subseteq V with UV=U \cap V = \emptyset, which is clearly a separation of xx and yy.

289

GδG_\delta space     \implies R0R_0

Added:

Mar 30, 2026

Difficulty:

To prove R0R_0, it suffices to prove x{y}    y{x}x \notin \cl{\{y\}} \implies y \notin \cl{\{x\}}. Note that {y}=n<ωVn\cl{\{y\}} = \bigcap_{n < \omega} V_n is a GδG_\delta set, so there exists some nn such that xVnx \notin V_n, yet yVny \in V_n. That proves y{x}y \notin \cl{\{x\}}.

290

Finite     \implies Baire

Added:

Mar 30, 2026

Difficulty:

A countable union of subsets in a finite space can be assumed to be a finite union by removing duplicates. Now we just use the fact that for finitely many closed sets {A1,,An}\{A_1, \dots, A_n\}, that int(k=1nAi)=k=1nint(Ai)\text{int}(\bigcap_{k=1}^n A_i) = \bigcap_{k=1}^n \text{int}(A_i). That is, a finite union of nowhere dense sets is nowhere dense.

334

(Has a countable network ∧ T0T_0)     \implies Cardinality c\leq\mathfrak c

Added:

Apr 2, 2026

Difficulty:

Let N\mathcal{N} be a countable network. For each xXx \in X, define f(x)={NN : xN}f(x) = \{ N \in \mathcal{N} \ : \ x \in N \}. If xyx \ne y, by T0T_0 and without loss of generality, assume xUx \in U and yUy \notin U for some open UU. Since UU is a union of network elements, there is some NN with xNx \in N yet yNy \notin N. Then f:XP(N)f : X \to \mathcal{P}(\mathcal{N}) is injective, and so card(X)card(P(N))=20=c\card{X} \le \card{\mathcal{P}(\mathcal{N})} = 2^{\aleph_0} = \mathfrak{c}.

344

(Lindelöf ∧ Zero dimensional)     \implies Ultraparacompact

Added:

Apr 2, 2026

Difficulty:

Let B\mathcal{B} be a basis of clopen sets and let U\mathcal{U} be an open cover. For each UUU \in \mathcal{U}, define BU={BB : BU}\mathcal{B}_U = \{ B \in \mathcal{B} \ : \ B \subseteq U \}. Then V=UUBU\mathcal{V} = \bigcup_{U \in \mathcal{U}} \mathcal{B}_U is an open refinement of clopen sets. By Lindelöf, let {Bn}\{B_n\} be a countable subrefinement of V\mathcal{V}. If Bn=Bnk<nBkB^*_n = B_n \setminus \bigcup_{k < n} B_k, then {Bn}\{B^*_n\} are all clopen and pairwise disjoint, so it is a clopen refinement which partitions XX.

360

ω\omega-Lindelöf     \implies Lindelöf

Added:

Apr 3, 2026

Difficulty:

Let U\mathcal{U} be an open cover. Let F\mathcal{F} be the collection of finite subsets of U\mathcal{U} and define a function v(F)=Fv(F) = \bigcup F on F\mathcal{F}. Then {v(F)}FF\{v(F)\}_{F \in \mathcal{F}} is an ω\omega-cover, since U\mathcal{U} is a cover of any finite (compact) set KK, which has a finite subcover, meaning KFK \subseteq \bigcup F for some finite FUF \subseteq \mathcal{U}. Let AF\mathcal{A} \subseteq \mathcal{F} be countable so that {v(F)}FA\{v(F)\}_{F \in \mathcal{A}} is a countable ω\omega-subcover. Then AU\bigcup \mathcal{A} \subseteq \mathcal{U} is a countable subcover.

376

(Has a σ\sigma-locally finite network ∧ Lindelöf)     \implies Has a countable network

Added:

Apr 3, 2026

Difficulty:

A locally-finite collection in a Lindelöf space is countable, seen in the proof of (T387), and so the network is a countable union of countable networks, hence, countable.

387

(Has a σ\sigma-locally finite kk-network ∧ Lindelöf)     \implies Has a countable kk-network

Added:

Apr 3, 2026

Difficulty:

A locally-finite collection in a Lindelöf space is countable: If A\mathcal{A} is locally finite, the sets U\mathcal{U} which intersect finitely many elements of A\mathcal{A} is an open cover, so if U\mathcal{U}^* is a countable subcover, then every element of A\mathcal{A} intersects some UUU \in \mathcal{U}^*, yet only finitely many intersect each UU, so A\mathcal{A} is countable.

395

(P-space ∧ Lindelöf ∧ T2T_2)     \implies Normal

Added:

Apr 3, 2026

Difficulty:

Start by showing regularity. Let xAx \notin A and AA closed. Construct the pairs (U,V)(U, V) of nbds such that xUx \in U and yVy \in V for some yAy \in A with UV=U \cap V = \emptyset. Then the sets VV form an open cover of AA. Closed sets are Lindelöf, so take {(Un,Vn)}\{(U_n, V_n)\} a countable subcollection with {Vn}\{V_n\} still covering AA. Then xUn<ωUnx \in U \coloneqq \bigcap_{n < \omega} U_n is open in a P-space, and AVn<ωVnA \subseteq V \coloneqq \bigcup_{n < \omega} V_n, with UV=U \cap V = \emptyset.

Now let A,BA,B be closed and disjoint. Construct the pairs (U,V)(U, V) of nds such that AUA \subseteq U and xVx \in V for some xBx \in B with UV=U \cap V = \emptyset. Similarly, we take {(Un,Vn)}\{(U_n, V_n)\} such that BVn<ωVnB \subseteq V \coloneqq \bigcup_{n < \omega} V_n and AUn<ωUnA \subseteq U \coloneqq \bigcap_{n < \omega} U_n, which is open in a P-space, and UV=U \cap V = \emptyset.

396

(P-space ∧ Functionally Hausdorff)     \implies Totally separated

Added:

Apr 3, 2026

Difficulty:

Given xyx \ne y, let f:X[0,1]f : X \to [0, 1] such that f(x)=0f(x) = 0 and f(y)=1f(y) = 1. Then Vn=f1([0,1/n))V_n = f^{-1}([0, 1/n)) are all open. Then xB=n=1Vnx \in B = \bigcap_{n=1}^\infty V_n is open in a P-space, and BB is closed, since B=f1(n=1[0,1/n))=f1(0)B = f^{-1}\left( \bigcap_{n=1}^\infty [0, 1/n) \right) = f^{-1}(0).

400

(Connected ∧ Strongly zero-dimensional)     \implies Strongly connected

Added:

Apr 3, 2026

Difficulty:

Contrapositively, let f:XRf : X \to \R is continuous and non-constant. So f(x)=αf(x) = \alpha and f(y)=βf(y) = \beta with αβ\alpha \ne \beta. Clearly A1=f1(α)A_1 = f^{-1}(\alpha) and A2=f1(β)A_2 = f^{-1}(\beta) are disjoint. They are zero sets, since A1=g1(0)A_1 = g^{-1}(0) for g(x)=f(x)αg(x) = f(x) - \alpha and similarly, A2A_2 is a zero set. So A1B1A_1 \subseteq B_1 and A2B2A_2 \subseteq B_2 with B1,B2B_1,B_2 disjoint clopen sets, by strongly zero-dimensional. In particular, xB1Xx \in B_1 \subset X, so the space is not connected.

401

Normal     \implies Pseudonormal

Added:

Apr 3, 2026

Difficulty:

If you remove “countable” from the definition of pseudonormal, that’s precisely one property of normal spaces. If HH is closed and HUH \subseteq U is open, then HUC=H \cap U^C = \emptyset, so there are open sets HVH \subseteq V and UCVU^C \subseteq V' with VV=V \cap V' = \emptyset. In particular, VU\cl{V} \subseteq U.

402

(T1T_1 ∧ Pseudonormal)     \implies Regular

Added:

Apr 3, 2026

Difficulty:

Let xAx \notin A with AA closed. Being T1T_1, {x}\{x\} is a countable closed set, and {x}U=AC\{x\} \subseteq U = A^C is open. So let VV be open with xVVACx \in V \subseteq \cl{V} \subseteq A^C. Then AVC=WA \subseteq \cl{V}^C = W with VW=V \cap W = \emptyset.

403

(Regular ∧ P-space)     \implies Pseudonormal

Added:

Apr 3, 2026

Difficulty:

Let H={xn}H = \{x_n\} and HUH \subseteq U open. Then xnF=UCx_n \notin F = U^C for each nn, so by regularity, let xVnx \in V_n and FUnF \subseteq U_n with VnUn=V_n \cap U_n = \emptyset. Then AV=n<ωVnA \subseteq V = \bigcup_{n < \omega} V_n and FW=n<ωUnF \subseteq W = \bigcap_{n < \omega} U_n with VW=V \cap W = \emptyset. But that implies VF=\cl{V} \cap F = \emptyset, so HVVUH \subseteq V \subseteq \cl{V} \subseteq U.

411

(Discrete ∧ Cardinality c\leq\mathfrak c)     \implies Has a coarser separable metrizable topology

Added:

Mar 27, 2026

Difficulty:

Let f:XRf : X \to \R be injective. Using the usual topology of R\R, we can define d(x,y)=f(x)f(y)d(x, y) = \abs{f(x) - f(y)} which is clearly a metric, and under this new metrizable topology for XX, ff is a homeomorphism from XX to f(X)Rf(X) \subseteq \R, and any subset of R\R has a countable dense subset. This separable metrizable topology is trivially coarser than the discrete topology.

413

(Anticompact ∧ T1T_1)     \implies Sequentially discrete

Added:

Mar 27, 2026

Difficulty:

Let (xn)(x_n) be a sequence with xnxx_n \to x. Then A={xn : n<ω}{x}A = \{ x_n \ : \ n < \omega\} \cup \{x\} is compact, since for any open cover of AA, some element VV nbd of xx must contain xnx_n for all nn0n \ge n_0 and {xn : n<n0}\{ x_n \ : \ n < n_0 \} is finite. But then AA is finite, and in a T1T_1 space, it must be discrete. So for some n0n_0, nn0    xn{x}    xn=xn \ge n_0 \implies x_n \in \{x\} \implies x_n = x.

415

(P-space ∧ T1T_1)     \implies Countable sets are discrete

Added:

Mar 27, 2026

Difficulty:

All countable sets are closed, since they are a countable union of singletons (closed by T1T_1). If AA is countable and some pAp \in A were not to be isolated, then pA{p}p \in \cl{A \setminus \{p\}}, which would imply A{p}A \setminus \{p\} is countable yet not closed.

416

(Sequential ∧ Sequentially discrete)     \implies Discrete

Added:

Mar 28, 2026

Difficulty:

Contrapositively, if pp is not an isolated point, then pX{p}p \in \cl{X \setminus \{p\}} and then there exists a sequence (xn)(x_n) in X{p}X \setminus \{p\} with xnpx_n \to p. But then this sequence cannot be eventually constant, since the constant would have to be pp itself.

417

(Separable ∧ Countable sets are discrete)     \implies Countable

Added:

Mar 28, 2026

Difficulty:

Let AA countable with A=X\cl{A} = X. For any xXx \in X, A{x}A \cup \{x\} is countable, so it is discrete. Since xAx \in \cl{A}, we have xAx \in A and so X=AX = A is countable.

418

(Countably tight ∧ Countable sets are discrete)     \implies Discrete

Added:

Mar 28, 2026

Difficulty:

Contrapositively, if pp is not an isolated point, then pX{p}p \in \cl{X \setminus \{p\}}, so there exists a countable DX{p}D \subseteq X \setminus \{p\} with pDp \in \cl{D}. But then D{p}D \cup \{p\} is countable yet not discrete.

422

(Semi-Hausdorff ∧ Has multiple points)     \implies ¬ Hyperconnected

Added:

Mar 21, 2026

Difficulty:

Let xU=int(U)x \in U = \text{int}(\cl{U}) with yUy \notin U. If UU were to be dense, we’d have U=X\cl{U} = X, but int(U)=UX=int(X)\text{int}(\cl{U}) = U \ne X = \text{int}(X).

423

(Weakly locally compact ∧ k1k_1-Hausdorff)     \implies T2T_2

Added:

Apr 3, 2026

Difficulty:

Let xUKx \in U \subseteq K and yVKy \in V \subseteq K' with U,VU,V open, K,KK,K' compact, and xyx \ne y. Then L=KKL = K \cup K' is compact, so it is T2T_2. Thus, let xWx \in W and yWy \in W' be nbds such that WWL=W \cap W' \cap L = \emptyset. Then (UW)(VW)=(U \cap W) \cap (V \cap W') = \emptyset separates xx and yy by open sets in XX.

424

k1k_1-Hausdorff     \implies KC

Added:

Apr 4, 2026

Difficulty:

Let KXK \subseteq X compact and xKx \notin K. Then K{x}K \cup \{x\} is compact and T2T_2. T2T_2 spaces separate points from compact sets, so there exists a nbd VV of xx with VK=V \cap K = \emptyset. So KK is closed.

443

Fixed point property     \implies Connected

Added:

Apr 4, 2026

Difficulty:

If XX is disconnected, let AA be a clopen set with pAp \in A and qAq \notin A. Then the function f:XXf : X \to X defined as f(x)=qf(x) = q at xAx \in A and f(x)=pf(x) = p at xAx \notin A, then ff is continuous yet has no fixed point.

466

(Alexandrov ∧ R0R_0)     \implies Partition topology

Added:

Apr 5, 2026

Difficulty:

Denote xyx \sim y to mean xx and yy are indistinguishable. For each xx, let W(x)W(x) be its smallest nbd. Clearly xy    yW(x)x \sim y \implies y \in W(x) by definition, and for each y≁xy \not\sim x, there is a nbd VV of xx with yVy \notin V, so yW(x)y \notin W(x). Furthermore, this proves that \sim is an equivalence relation, since xy    W(x)=W(y)x \sim y \iff W(x) = W(y) and the sets [x]=W(x)[x]_{\sim} = W(x) form a partition of XX.

605

Almost discrete     \implies Sober

Added:

Mar 25, 2026

Difficulty:

A hyperconnected set cannot have two isolated points. Let pp be the only non-isolated point. Then the hyperconnected sets are only the ones of the form A={x}A = \{x\} and B={p,x}B = \{p, x\} with p{x}p \in \cl{\{x\}} for some xx. Suppose they’re closed. Then clearly A={x}A = \cl{\{x\}}, and BB is a closed subset of {x}\cl{\{x\}} that contains xx, so B={x}B = \cl{\{x\}}.

607

(Almost discrete ∧ T1T_1)     \implies Strongly KC

Added:

Mar 27, 2026

Difficulty:

Let pp be non-isolated with X{p}X \setminus \{p\} discrete. Let AA be countably compact. If AX{p}A \subseteq X \setminus \{p\}, then AA is finite, so it is closed by T1T_1. If pAp \in A, then for any xAx \notin A, {x}AC\{x\} \subseteq A^C is a nbd, so AA is closed.

608

Totally disconnected     \implies Sober

Added:

Mar 26, 2026

Difficulty:

If CC is hyperconnected, it’s in particular connected, so it’s a singleton. Evidently it must be the closure of itself (connected components are closed).

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)

683

(Almost discrete ∧ Sequential)     \implies Fréchet Urysohn

Added:

Mar 17, 2026

Difficulty:

Let AXA \subseteq X and pXp \in X such that X{p}X \setminus \{p\} is discrete. Then all points of AA are isolated except for potentially pp. That is, AA{p}\overline{A} \setminus A \subseteq \{p\}. We wish to show Ascl(A)\overline{A} \subseteq \text{scl}(A) where scl denotes the sequential closure. Clearly Ascl(A)A \subseteq \text{scl}(A). If AA is not closed, then there is some sequence (xn)(x_n) in AA such that xnxx_n \to x for some xAAx \in \overline{A} \setminus A. But xx must be necessarily pp, so pscl(A)p \in \text{scl}(A).

793

Countable sets are discrete     \implies Strongly KC

Added:

Mar 27, 2026

Difficulty:

If AA is infinite, let BAB \subseteq A countably infinite, which must be discrete, so {x}\{x\} for xBx \in B is a countable cover with no finite subcover. Thus, countably compact sets must be finite, which are closed, as XX is T1T_1 (T221).

802

Stonean     \implies Stone space

Added:

Mar 24, 2026

Difficulty:

It suffices to show it’s totally disconnected. This follows from (T45) and (T46), but the whole argument is: Let xyx \ne y. Then xUx \in U and yVy \in V with UV=U \cap V = \emptyset. So xVx \notin \cl{V}, which is clopen. Then xx can’t be in the connected component CC containing yy, since VC\cl{V} \cap C and VCC\cl{V}^C \cap C would be disjoint nonempty open sets.