π-base: IDs 200-299

IDs 200-299

200

Polish     \implies Completely metrizable

Added:

Mar 26, 2026

Difficulty:

By definition.

201

(Separable ∧ Completely metrizable)     \implies Polish

Added:

Mar 26, 2026

Difficulty:

By definition.

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”.

206

Fréchet Urysohn     \implies Radial

Added:

Mar 13, 2026

Difficulty:

Fréchet Urysohn is stronger because it asserts there is a sequence, a.k.a a transfinite sequence of length ω\omega.

207

Sequential     \implies Pseudoradial

Added:

Mar 13, 2026

Difficulty:

Any radially closed set must be, in particular, sequentially closed.

208

(Indiscrete ∧ Has multiple points)     \implies ¬ Has an isolated point

Added:

Mar 12, 2026

Difficulty:

Any open set has more than one point.

209

(Has an isolated point ∧ Homogeneous)     \implies Discrete

Added:

Mar 26, 2026

Difficulty:

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

210

(Locally countable ∧ Pseudoradial)     \implies Sequential

Added:

Mar 13, 2026

Difficulty:

Suppose a set AA is sequentially closed. Let pXp \in X and (xα)α<λA(x_\alpha)_{\alpha < \lambda} \subseteq A. Take VV a countable nbd of pp. If xαpx_\alpha \to p, then there is an ordinal μ\mu for which xαVx_\alpha \in V for all αμ\alpha \ge \mu. The set of ordinals μα<λ\mu \le \alpha < \lambda is isomorphic to some λ\lambda'. So we have (yα)α<λV(y_\alpha)_{\alpha < \lambda'} \subseteq V, still with yαVy_\alpha \to V.

From a converging transfinite sequence within a countable set, we can extract a ω\omega-sequence that still converges to the same value, this was done in (T211). So we construct a sequence (zn)(z_n) with znpz_n \to p, and so pAp \in A as we wished to prove.

211

(Countably tight ∧ Radial)     \implies Fréchet Urysohn

Added:

Mar 13, 2026

Difficulty:

Given pAp \in \overline{A}, choose DAD \subseteq A countable with pDp \in \overline{D}. Suppose (xα)α<λ(x_\alpha)_{\alpha < \lambda} is some transfinite sequence in DD with xαpx_\alpha \to p. We now construct a sequence in DD which converges to pp and we’re done (thanks to PatrickR).

If some yDy \in D is cofinal in (xα)(x_\alpha), this means any neighborhood UU of xx must contain yy, so we can construct a constant sequence yn=yy_n = y with ynpy_n \to p. If no yDy \in D is cofinal, then each Iy={α<λ : xα=y}I_y = \{ \alpha < \lambda \ : \ x_\alpha = y \} is finite and λ=yDIy\lambda = \bigcup_{y \in D} I_y is a countable union of finite sets, so it is a countable ordinal. We can assume λ\lambda to be a regular cardinal, so it is already a sequence.

212

(Countable ∧ First countable)     \implies Second countable

Added:

Mar 13, 2026

Difficulty:

If each local basis Vx\mathcal{V}_x is countable and XX is countable, then B=xXVx\mathcal{B} = \bigcup_{x \in X} \mathcal{V}_x is a countable basis.

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.

216

GO-space     \implies Radial

Added:

Mar 26, 2026

Difficulty:

Let VV be an order convex nbd of pAp \in \cl{A}. If A=(,p)A = ({\leftarrow}, p) and B=(p,)B = (p, {\rightarrow}), then we could assume either AVA \cap V has no maximum or BVB \cap V has no minimum. Otherwise, then we could take x=maxAx = \max A and y=minBy = \min B then (x,y)V={p}(x, y) \cap V = \{p\} would be a nbd of pp and so pAp \in A (it would then suffice to take the constant sequence xα=px_\alpha = p). Without loss of generality, say AVA \cap V is infinite.

Using the axiom of choice, specifically Zorn’s lemma, we can take the collection of all well-ordered subsets of AVA \cap V, and any maximal element WW must be cofinal in AVA \cap V. Since this set is well-ordered, there is an isomorphism f:ξWf : \xi \to W from some ordinal ξ\xi and xα=f(α)x_\alpha = f(\alpha) is a sequence with xαpx_\alpha \to p by cofinality.

218

Discrete     \implies Locally finite

Added:

Mar 12, 2026

Difficulty:

{x}\{x\} is a finite neighborhood of xx.

221

Countable sets are discrete     \implies T1T_1

Added:

Mar 12, 2026

Difficulty:

For xyx \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.

223

(Countably compact ∧ Sequential)     \implies Sequentially compact

Added:

Mar 20, 2026

Difficulty:

Let (xn)(x_n) be a sequence. By contradiction, suppose it has no converging subsequence and for each k<ωk < \omega, define A[k]=mk{xm}A[k] = \bigcup_{m \ge k} \cl{\{x_m\}}. We first prove each A[k]A[k] is closed. As the space is sequential, it suffices to take (yn)(y_n) a sequence in A[k]A[k] with ynyy_n \to y and prove yA[k]y \in A[k]. Let Y(m)={n>m : yn{xm}}Y(m) = \{ n > m \ : \ y_n \in \cl{\{x_m\}}\} for each mkm \ge k. If some $Y(m) is infinite, we could construct a subsequence (yf(n))(y_{f(n)}) in {xm}\cl{\{x_m\}} such that yf(n)yy_{f(n)} \to y, and so y{xm}A[k]y \in \cl{\{x_m\}} \subseteq A[k]. Otherwise, each Y(m)Y(m) is finite and infinitely many are nonempty. So let m1m_1 be the least mm for which Y(m)Y(m) \ne \emptyset and n1Y(m1)n_1 \in Y(m_1). Inductively, let mj+1m_{j+1} be the least m>njm > n_j such that Y(m)Y(m) \ne \emptyset and nj+1Y(mj+1)n_{j+1} \in Y(m_{j+1}). Now we’ve chosen subsequences (ynj)(y_{n_j}) and (xmj)(x_{m_j}) such that ynj{xmj}y_{n_j} \in \cl{\{x_{m_j}\}}. For any VV nbd of yy, there exists some n0n_0 such that ynjVy_{n_j} \in V for jn0j \ge n_0. But then VV is a nbd of ynjy_{n_j}, so xmjVx_{m_j} \in V for all jn0j \ge n_0. As this holds for all VV, that would imply xnjyx_{n_j} \to y, a contradiction!

So each A[k]A[k] is closed, and as the space is countably compact, let pp be an accumulation point of (xn)(x_n). Then clearly pp is a limit point of A[k]A[k] for all kk. Now consider the sets X(n)={m>n : p{xm}}X(n) = \{ m > n \ : \ p \in \cl{\{x_m\}} \}. If X(k)=X(k) = \emptyset for some kk, that would imply pA[k+1]p \notin A[k+1], which is impossible since pA[k+1]p \in \cl{A[k+1]} and A[k+1]A[k+1] is closed. So let m1=minX(1)m_1 = \min X(1) and mk+1=minX(mk)m_{k+1} = \min X(m_k). We’ve contructed a sequence (xmk)(x_{m_k}) such that p{xmk}p \in \cl{\{x_{m_k}\}} for all kk. Then for any VV nbd of pp, xmkVx_{m_k} \in V and that would imply xmkpx_{m_k} \to p.

Source: Sequential space methods, Kremsater

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.

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 xnxx_n \coloneqq x, xnxx_n \to x and xnyx_n \to y.

227

KC     \implies Weak Hausdorff

Added:

Mar 27, 2026

Difficulty:

If f:KXf : 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 KX2K \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 xyx \ne y. Contrapositively, suppose UnVnU_n \cap V_n \ne \emptyset for all nn, and choose znUnVnz_n \in U_n \cap V_n. Then znxz_n \to x and znyz_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.

232

(Totally path disconnected ∧ Embeddable in R\mathbb R)     \implies Zero dimensional

Added:

Mar 28, 2026

Difficulty:

If XYRX \simeq Y \subseteq \R, for each xXx \in X, we shall assume xx is not minimum or maximum element of LL, so that it has a local basis of sets of the form (a,b)X(a, b) \cap X for a,bLa,b \in L (otherwise the proof is similar but the intervals are either [x,b)[x, b) or (a,x](a, x]). Then there must be some c(a,x)c \in (a, x) with cXc \notin X, otherwise (a,x)X(a, x) \subseteq X would be a path connected subset1. Similarly, there must be some d(x,b)Xd \in (x, b) \setminus X so that x(c,d)X=[c,d]Xx \in (c, d) \cap X = [c, d] \cap X is a clopen nbd of xx in XX. So the clopen nbds of XX form a basis.

(1): This is the one time in the proof where we use the fact that we’re in R\R, because connected     \iff path connected in R\R. Otherwise, we could construct a very similar proof for (Totally disconnected ∧ GO-space)     \implies Zero dimensional

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:Xf(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.

234

Strongly KC     \implies KC

Added:

Mar 12, 2026

Difficulty:

Compact sets are countably compact.

235

(Sequential ∧ US)     \implies Strongly KC

Added:

Mar 27, 2026

Difficulty:

Suppose AA is countably compact yet not closed. XX is sequential, so there is a sequence (xn)(x_n) in AA and pAAp \in \cl{A} \setminus A with xnpx_n \to p. Then (xn)(x_n) has some accumulation point yAy \in A. There cannot be infinitely many nn for which xn=yx_n = y, otherwise we could extract a subsequence with xnkyx_{n_k} \to y, and by US, that would imply y=py = p. Therefore, by taking a subsequence if necessary, we can assume yxny \ne x_n for all nn. But then yB={xn : n<ω}{p}y \notin B = \{x_n \ : \ n < \omega \} \cup \{p\} yet yBy \in \cl{B}. So BB isn’t closed, which would imply there is some sequence (yn)(y_n) in BB with ynqy_n \to q and qBBq \in \cl{B} \setminus B. Just as before, there can only be finitely many nn with yn=xmy_n = x_m or yn=py_n = p for any mm. So we could extract a subsequence (ynk)(y_{n_k}) such that ynk=xmky_{n_k} = x_{m_k} is also a subsequence of (xn)(x_n) and so ynkp=qy_{n_k} \to p = q, a contradiction.

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.

237

Hemicompact     \implies σ\sigma-compact

Added:

Mar 28, 2026

Difficulty:

By definition: σ\sigma-compact     \iff countable union of compacts {Kn}\{K_n\}. Hemicompact     \iff countable union of compacts {Kn}\{K_n\} such that any compact set lies inside some KmK_m.

238

Countable     \implies Locally countable

Added:

Mar 12, 2026

Difficulty:

Globally implies locally.

241

0\aleph_0-space     \implies Cosmic

Added:

Mar 28, 2026

Difficulty:

This is just “Has a countable kk-network     \implies Has a countable network” (T11) with T3T_3 added.

242

Cosmic     \implies σ\sigma-space

Added:

Mar 28, 2026

Difficulty:

This is just “Has a countable network     \implies Has a σ\sigma-locally finite network” (T29) with T3T_3 added.

243

0\aleph_0-space     \implies \aleph-space

Added:

Mar 12, 2026

Difficulty:

This is just “Has a countable kk-network     \implies Has a σ\sigma-locally finite kk-network” (T352) with T3T_3 added.

244

\aleph-space     \implies σ\sigma-space

Added:

Mar 28, 2026

Difficulty:

This is just “Has a σ\sigma-locally finite kk-network     \implies Has a σ\sigma-locally finite network” (T34) with T3T_3 added.

245

Locally compact     \implies Weakly locally compact

Added:

Mar 28, 2026

Difficulty:

Just take one element from the local basis.

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.

247

(Discrete ∧ Indiscrete)     \implies ¬ Has multiple points

Added:

Mar 12, 2026

Difficulty:

P(X)={,X}\mathcal{P}(X) = \{\emptyset, X\} if and only if it has 0 or 1 point.

248

¬ Has multiple points     \implies Discrete

Added:

Mar 12, 2026

Difficulty:

There’s only one possible topology.

249

¬ Has multiple points     \implies Indiscrete

Added:

Mar 12, 2026

Difficulty:

There’s only one possible topology.

250

¬ Finite     \implies Has multiple points

Added:

Mar 12, 2026

Difficulty:

If you have an infinite amount of apples, then you have at least 2 apples.

251

Indiscrete     \implies Compact

Added:

Mar 28, 2026

Difficulty:

Any open cover must contain XX as an element.

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.

253

(Has multiple points ∧ T0T_0)     \implies ¬ Indiscrete

Added:

Mar 12, 2026

Difficulty:

Some point has a neighborhood not containing another point.

254

Hereditarily Lindelöf     \implies Lindelöf

Added:

Mar 12, 2026

Difficulty:

A space is a subspace of itself.

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.

257

(Normal ∧ GδG_\delta space)     \implies Perfectly normal

Added:

Mar 28, 2026

Difficulty:

We prove any closed set AA is a zero set. Let A=n=1VnA = \bigcap_{n=1}^\infty V_n be a GδG_\delta set. Without loss of generality, assume {Vn}\{V_n\} is decreasing. Define An=VnCA_n = V_n^C, and by normality, let fn:X[0,1]f_n : X \to [0, 1] a function where fn(A)={0}f_n(A) = \{0\} and fn(An)={1}f_n(A_n) = \{1\}. We define f:X[0,1]f : X \to [0, 1] as

f(x)=n=1fn(x)2nf(x) = \sum_{n=1}^\infty \frac{f_n(x)}{2^n}

It already has the property f1({0})=Af^{-1}(\{0\}) = A as we wished, since f(x)=0f(x) = 0 iff fn(x)f_n(x) for all nn and xAx \notin A implies xAnx \in A_n for some nn and fn(x)0f_n(x) \ne 0. To prove continuity, we use the Weierstrass M-test. Each gn(x)=fn(x)/2n2ng_n(x) = f_n(x)/2^n \le 2^{-n} and 2n=1\sum 2^{-n} = 1 converges, so gn(x)\sum g_n(x) converges absolutely and uniformly. As each finite sum n=1Ngn(x)\sum_{n=1}^N g_n(x) is continuous, their uniform limit ff is continuous.

258

(Regular ∧ Hereditarily Lindelöf)     \implies Perfectly normal

Added:

Mar 29, 2026

Difficulty:

We shall show XX is normal and GδG_\delta (T257). The former is a result of (Regular ∧ Lindelöf)     \implies Normal, and the proof of this fact can be seen in the second-half of (T26). There, we merely use the fact that the space is regular and closed sets are Lindelöf, which is clearly true in a Lindelöf space.

Now let AA be closed. By regularity, for each xAx \notin A there is a pair xUx \in U and AVA \subseteq V of open sets with UV=U \cap V = \emptyset. By joining all such pairs (U,V)(U, V) into a collection W\mathcal{W}, we see that π1(W)\pi_1(\mathcal{W}) is a cover of ACA^C. By hereditarily Lindelöf, there is a countable subcollection {(Un,Vn)}\{(U_n, V_n)\} in W\mathcal{W} which, for any xAx \notin A, there is some nn for which nVnn \notin V_n. Conversely, xAx \in A implies xVnx \notin V_n for all nn. So A=n<ωVnA = \bigcap_{n < \omega} V_n is a GδG_\delta set.

259

Countable     \implies Has a countable network

Added:

Mar 12, 2026

Difficulty:

Singletons form a network.

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.

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.

263

(Hereditarily Lindelöf ∧ Scattered)     \implies Countable

Added:

Mar 29, 2026

Difficulty:

Let AA be the set of points which have a countable nbd. Then AA is locally countable and Lindelöf, so it is countable (T499). This must imply B=ACB = A^C is empty, as otherwise it would need to have an isolated point pBp \in B which has no countable nbd, so pUp \in U and UB={p}U \cap B = \{p\} would imply U{p}AU \setminus \{p\} \subseteq A is uncountable (thanks to Almanzoris, I had proved it on my own but it was far more complicated than this nice argument).

264

Metrizable     \implies Pseudometrizable

Added:

Mar 12, 2026

Difficulty:

Every metric is a pseudometric.

265

(Pseudometrizable ∧ T0T_0)     \implies Metrizable

Added:

Mar 13, 2026

Difficulty:

By contraposition, if d(x,y)=0d(x, y) = 0, then they both have the same neighborhoods.

266

Finite     \implies Locally finite

Added:

Mar 12, 2026

Difficulty:

Globally implies locally.

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 yxy \ne x, there is some nbd UyU_y of xx with yUyy \notin U_y, so {x}=V\{x\} = \bigcap \mathcal{V}.

268

Pseudometrizable     \implies Perfectly normal

Added:

Mar 29, 2026

Difficulty:

We prove it is normal and GδG_\delta (T257). For the latter, let AA be any closed set, and define Vn=xAB(x,1/n)V_n = \bigcup_{x \in A} B(x, 1/n). Let pn=1Vnp \in \bigcap_{n=1}^\infty V_n. For each nn there is an xnAx_n \in A such that pB(xn,1/n)p \in B(x_n, 1/n) and therefore, xnpx_n \to p. Since AA is closed, pAp \in A. This proves A=n=1VnA = \bigcap_{n=1}^\infty V_n is GδG_\delta.

To prove normality, we use the fact that for a closed set YY, d(Y,x)=0    xYd(Y, x) = 0 \implies x \in Y. For any disjoint closed sets AA and BB, define rx=d(B,x)/2r_x = d(B, x)/2 for each xAx \in A and sy=d(A,y)/2s_y = d(A, y)/2 for each yBy \in B. Define U=xAB(x,rx)U = \bigcup_{x \in A} B(x, r_x) and V=yBB(y,sy)V = \bigcup_{y \in B} B(y, s_y). It’s clear AUA \subseteq U and BVB \subseteq V. If pUVp \in U \cap V, then d(x,p)<rxd(x, p) < r_x and d(y,p)<syd(y, p) < s_y for some xAx \in A and yBy \in B. But then d(x,y)<rx+sy=d(B,x)/2+d(A,y)/2d(x,y)d(x, y) < r_x + s_y = d(B, x)/2 + d(A, y)/2 \le d(x, y) is a contradiction.

270

Second countable     \implies First countable

Added:

Mar 12, 2026

Difficulty:

A countable basis is a local basis for every point.

271

Second countable     \implies Has a countable kk-network

Added:

Mar 29, 2026

Difficulty:

Any network of open sets is a kk-network. If KNVK \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.

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.

274

Discrete     \implies LOTS

Added:

Mar 29, 2026

Difficulty:

We use the axiom of choice (specifically the well-ordering principle) to denote a bijection f:Xαf : X \to \alpha where α\alpha is some initial ordinal. If α<ω\alpha < \omega, the order topology on α\alpha is discrete, so ff induces an order in XX which is discrete. If κ=card(α)\kappa = \card{\alpha} is infinite, then there is a bijection g:αα×Zg : \alpha \to \alpha \times \Z (the well-ordering of α\alpha allows us to construct a bijection from α×Z\alpha \times \Z to α\alpha and then apply Schröder–Bernstein). The dictionary order on α×Z\alpha \times \Z is discrete since the element (β,n)(\beta, n) is between (β,n1)(\beta, n-1) and (β,n+1)(\beta, n+1), so the bijection gfg \circ f yields a discrete order in XX.

275

(LOTS ∧ Connected ∧ Separable)     \implies Second countable

Added:

Mar 29, 2026

Difficulty:

Let AA be countable and dense. Let B\mathcal{B} be the finite intersections of open rays of the form (x,)(x, {\rightarrow}) or (,x)({\leftarrow}, x) for xAx \in A. For any zXz \in X, assume it is not a minimum or maximum of XX and suppose z(a,b)z \in (a, b). The proof is similar for those cases by taking [z,b)[z, b) or (a,z](a, z]. Then (a,z)(a, z) \ne \emptyset, as otherwise X=(,z)(a,)X = ({\leftarrow}, z) \cup (a, {\rightarrow}) would be disconnected. Furthermore, there must be some xAx \in A in this interval, otherwise some w(a,z)w \in (a, z) with (a,z)A=(a, z) \cap A = \emptyset would imply wAw \notin \cl{A}. Similarly, let y(z,b)y \in (z, b) and so z(x,y)(a,b)z \in (x, y) \subseteq (a, b). Since (x,y)B(x, y) \in \mathcal{B}, this is a countable basis.

276

Hereditarily Lindelöf     \implies Has countable spread

Added:

Mar 29, 2026

Difficulty:

If AXA \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.

279

(Hemicompact ∧ First countable)     \implies Weakly locally compact

Added:

Mar 30, 2026

Difficulty:

Let {Kn}\{K'_n\} be the compact sets of which every compact KKnK \subseteq K_n for some nn, and define Kn=nkKkK_n = \bigcup_{n \le k} K'_k, which has the same property. Let {Un}\{U_n\} be a local basis for some xx and Vn=knUkV_n = \bigcap_{k \le n} U_k is also a countable local basis. We wish to prove xVnKnx \in V_n \subseteq K_n for some nn. By contradiction, assume there is no such nn. That means we can extract a sequence xnVnKnx_n \in V_n \setminus K_n. Then xnxx_n \to x and so K={xn : n<ω}{x}K = \{x_n \ : \ n < \omega\} \cup \{x\} is compact. But then KKnK \subseteq K_n for some nn, which contradicts xnKnx_n \notin K_n.

281

T2T_2     \implies R1R_1

Added:

Mar 12, 2026

Difficulty:

T2T_2 is T0T_0 with R1R_1.

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.

283

(R1R_1T0T_0)     \implies T2T_2

Added:

Mar 12, 2026

Difficulty:

Any two distinct points are distinguishable in a T0T_0 space.

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 VWV \in \mathcal{W} with xVx \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.

286

R1R_1     \implies R0R_0

Added:

Mar 13, 2026

Difficulty:

Immediate by definition.

287

T1T_1     \implies R0R_0

Added:

Mar 13, 2026

Difficulty:

By definition, T1T_1 is T0T_0 and R0R_0.

288

(R0R_0T0T_0)     \implies T1T_1

Added:

Mar 13, 2026

Difficulty:

T0T_0 ensures any two points are distinguishable. This is an if and only if.

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.

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=1KnX = \bigcup_{n=1}^\infty K_n and every compact/finite set is contained in some KnK_n.

292

(Anticompact ∧ k1k_1-space)     \implies Locally finite

Added:

Mar 30, 2026

Difficulty:

We first show the space is Alexandrov. Note that if {Vi}\{V_i\} is any family of open sets, and KK is any compact subspace, KViK \cap V_i is open in KK and also finite. Thus, by removing duplicates, the family {KVi}\{K \cap V_i\} is finite and so i(KVi)\bigcap_{i} (K \cap V_i) is a finite intersection of open sets. Therefore, KiViK \cap \bigcap_{i} V_i is open for every compact KK and so by the k1k_1-space property, iVi\bigcap_{i} V_i is open. Being Alexandrov, let VV be the smallest nbd of xx. Then it must be compact (T284), which is finite.

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.

295

Has multiple points     \implies ¬ Empty

Added:

Mar 12, 2026

Difficulty:

Important result to solve the Riemann hypothesis.

296

Indiscrete     \implies Hereditarily connected

Added:

Mar 30, 2026

Difficulty:

Indiscrete spaces are connected and being indiscrete is hereditary.

297

Countably-many continuous self-maps     \implies Countable

Added:

Mar 30, 2026

Difficulty:

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

299

Finite     \implies Countably-many continuous self-maps

Added:

Mar 12, 2026

Difficulty:

It has finitely many self-maps (continuous or not).