π-base: IDs 100-199

IDs 100-199

100

T5T_5     \implies T1T_1

Added:

Mar 13, 2026

Difficulty:

T5T_5 is T2T_2 (hence, T1T_1) by definition.

101

(T1T_1 ∧ Completely normal)     \implies T5T_5

Added:

Mar 13, 2026

Difficulty:

In particular, XX is T1T_1 and normal, which implies T2T_2 (shown in T99), and so it must be T5T_5 by definition.

102

First countable     \implies Well-based

Added:

Mar 13, 2026

Difficulty:

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

Rigorously, define M(V)={mω : VmV}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 pAp \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).

104

Fully T4T_4     \implies T1T_1

Added:

Mar 13, 2026

Difficulty:

By definition.

105

(T1T_1 ∧ Fully normal)     \implies Fully T4T_4

Added:

Mar 13, 2026

Difficulty:

By definition.

106

(Lindelöf ∧ Countably compact)     \implies Compact

Added:

Mar 12, 2026

Difficulty:

Shrink the cover twice.

107

(Countably compact ∧ Meta-Lindelöf)     \implies Compact

Added:

Mar 13, 2026

Difficulty:

Let R={Rj}\mathcal{R} = \{R_j\} be a point-countable open refinement of some open cover {Ui}\{U_i\}. Contrapositively, suppose no countable subcover exists. Recursively, define x0x_0 as any point and R0\mathcal{R}_0 the countable collection of sets in R\mathcal{R} containing xx. Then XR0X \setminus \mathcal{R}_0 is nonempty and we can choose x1x_1 from that. Inductively, let RnR\mathcal{R}_n \subseteq \mathcal{R} of the sets containing xnx_n, so that j=0nRj\bigcup_{j=0}^n \mathcal{R}_j is countable and so xn+1X(j=0nRj)x_{n+1} \in X \setminus (\bigcup_{j=0}^n \mathcal{R}_j).

The sequence Y={xn}Y = \{x_n\} is infinite and has no cluster point: If xx were to be, take xRjx \in R_j and the minimum nn such that xnRjx_n \in R_j. By construction, it is the only element of YY in RjR_j. For any sequence with no cluster point, we can construct a countable cover with no finite subcover. Take U0U_0 nbd of x0x_0, let mm be the least element of which xmU0x_m \notin U_0 and U1U_1 a nbd of xmx_m. Then if mm is the least element with xmknUkx_m \notin \bigcup_{k \le n} U_k, let Un+1U_{n+1} a nbd of xmx_m. Finally, if V=XUnV = X \setminus \bigcup U_n, then {V}{Un}\{V\} \cup \{U_n\} is a countable cover of XX with no finite subcover.

108

(Totally disconnected ∧ Locally connected)     \implies Discrete

Added:

Mar 13, 2026

Difficulty:

If only singletons are connected and XX has a basis of connected sets, then the basis must be all singletons.

109

(Ultraconnected ∧ R0R_0)     \implies Indiscrete

Added:

Mar 13, 2026

Difficulty:

If xyx \ne y are indistinguishable, then {x}{y}=\overline{\{x\}} \cap \overline{\{y\}} = \emptyset. So no two distinct points are distinguishable.

110

(Normal ∧ Pseudocompact)     \implies Weakly countably compact

Added:

Mar 23, 2026

Difficulty:

Let A={xn}A = \{x_n\} be a countable, closed and discrete set. Then we could define f:ARf : A \to \R as f(xn)=nf(x_n) = n. This is clearly continuous (AA is discrete), and we can extend it to F:XRF : X \to \R via the Tietze extension theorem. But then FF must be bounded, so AA has to be finite.

111

(Biconnected ∧ Cardinality 4\geq 4)     \implies T0T_0

Added:

Mar 24, 2026

Difficulty:

By contradiction, suppose xyx \ne y are topologically indistinguishable. Then Y=X{x,y}Y = X \setminus \{x, y\} must be disconnected, since {x,y}\{x, y\} is connected and YY has at least two points. Then there are open sets U,VU,V such that YUVY \subseteq U \cup V and UVY=U \cap V \cap Y = \emptyset. Note that UU can’t contain any of xx or yy, otherwise it must contain both and UU and VV are a separation of XX, which should be connected. Same goes for VV. So {x,y}=(UV)C\{x, y\} = (U \cup V)^C. But notice U{x}U \cup \{x\} is connected: If A,BA,B is a separation by open sets with xAx \in A, then yAy \in A and the pair AVA \cup V,BUB \cap U is a separation of XX. Through a similar reasoning, V{y}V \cup \{y\} is connected. But then XX is not biconnected.

112

T5T_5     \implies T4T_4

Added:

Mar 13, 2026

Difficulty:

I’m not sure why this is here. T5T_5 implies T1T_1 (T100) and completely normal (T336). Completely normal implies normal (T36). T1T_1 and normal implies T4T_4 (T99).

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

116

0\aleph_0-space     \implies Has a countable kk-network

Added:

Mar 24, 2026

Difficulty:

By definition.

117

(Has a countable kk-network ∧ T3T_3)     \implies 0\aleph_0-space

Added:

Mar 24, 2026

Difficulty:

By definition.

118

T2T_2     \implies T1T_1

Added:

Mar 12, 2026

Difficulty:

Clear from their definitions.

119

T1T_1     \implies T0T_0

Added:

Mar 12, 2026

Difficulty:

Clear from their definitions.

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.

121

Compact     \implies σ\sigma-compact

Added:

Mar 12, 2026

Difficulty:

A single set is trivially a countable union.

122

σ\sigma-compact     \implies Lindelöf

Added:

Mar 12, 2026

Difficulty:

If each compact has a finite subcover, a countable union of them will have a countable subcover.

123

(Lindelöf ∧ Countably paracompact)     \implies Paracompact

Added:

Mar 24, 2026

Difficulty:

Take any open cover. Apply Lindelöf, then apply countably paracompact.

124

(Lindelöf ∧ Countably metacompact)     \implies Metacompact

Added:

Mar 24, 2026

Difficulty:

Take any open cover. Apply Lindelöf, then apply countably metacompact.

125

(GO-space ∧ Compact)     \implies LOTS

Added:

Mar 24, 2026

Difficulty:

Let τ\tau be the topology of XX and τ\tau' the order topology of XX. The open rays (x,)(x, {\rightarrow}) and (,y)({\leftarrow}, y) are all open in τ\tau, and they form a subbasis for τ\tau', so ττ\tau' \subseteq \tau. Then the identity map id:(X,τ)(X,τ)\text{id} : (X, \tau) \to (X, \tau') is continuous. But τ\tau is compact and τ\tau' is Hausdorff (LOTS spaces are T2T_2), so this is a homeomorphism and τ=τ\tau = \tau'.

126

(Compact ∧ T2T_2 ∧ Extremally disconnected)     \implies Stonean

Added:

Mar 24, 2026

Difficulty:

By definition.

128

Lindelöf     \implies Weakly Lindelöf

Added:

Mar 13, 2026

Difficulty:

A subcover is trivially, a subcolection with dense union.

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

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 XX \ne \emptyset can’t have empty interior (so XX is not Baire).

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.

138

Cardinality =c=\mathfrak c     \implies ¬ Cardinality <c\lt\mathfrak c

Added:

Mar 12, 2026

Difficulty:

Left as an exercise for the reader.

139

Cardinality =c=\mathfrak c     \implies Cardinality c\leq\mathfrak c

Added:

Mar 12, 2026

Difficulty:

Left as an exercise for the reader.

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 FnUn\mathcal{F}_n \subseteq \mathcal{U}_n is finite.

143

Door     \implies T0T_0

Added:

Mar 13, 2026

Difficulty:

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

144

Discrete     \implies Door

Added:

Mar 13, 2026

Difficulty:

Every set is clopen.

146

T3T_3     \implies Regular

Added:

Mar 13, 2026

Difficulty:

By definition.

147

σ\sigma-space     \implies Has a σ\sigma-locally finite network

Added:

Mar 23, 2026

Difficulty:

By definition.

148

(Regular ∧ T0T_0)     \implies T3T_3

Added:

Mar 13, 2026

Difficulty:

Let xyx \ne y such that xWx \in W and yWy \notin W for some open WW. Then xF=WCx \notin F = W^C, so by regularity, choose disjoint open sets U,VU,V with FUF \subseteq U and xVx \in V. Since yUy \in U, this proves being T2T_2. T2T_2 and regular is T3T_3 by definition.

149

T312T_{3 \frac{1}{2}}     \implies Completely regular

Added:

Mar 25, 2026

Difficulty:

By definition.

150

(Has a σ\sigma-locally finite network ∧ T3T_3)     \implies σ\sigma-space

Added:

Mar 25, 2026

Difficulty:

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

152

T6T_6     \implies T1T_1

Added:

Mar 13, 2026

Difficulty:

By definition.

153

(T1T_1 ∧ Perfectly normal)     \implies T6T_6

Added:

Mar 13, 2026

Difficulty:

By definition.

154

T6T_6     \implies T5T_5

Added:

Mar 13, 2026

Difficulty:

T6T_6 is T1T_1 and perfectly normal. Then it is completely normal (T156). T1T_1 and completely normal is T5T_5 (T101).

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}).

157

Dowker     \implies T4T_4

Added:

Mar 25, 2026

Difficulty:

Normal and T2T_2 is the definition of T4T_4.

163

σ\sigma-compact     \implies σ\sigma-relatively-compact

Added:

Mar 25, 2026

Difficulty:

Any compact set is relatively compact.

169

Scattered     \implies T0T_0

Added:

Mar 13, 2026

Difficulty:

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

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.

174

Sober     \implies T0T_0

Added:

Mar 25, 2026

Difficulty:

Note that T0T_0 implies {x}{y}\cl{\{x\}} \ne \cl{\{y\}} for any xyx \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.

175

(Locally Euclidean ∧ Lindelöf)     \implies Second countable

Added:

Mar 25, 2026

Difficulty:

If the space is locally euclidean, this means the open sets which are embeddable in some Rn\R^n is an open cover, and being Lindelöf, we can take an countable subcover {Vn}\{V_n\}, where each has a homeomorphism f:Vnf(Vn)Rknf : V_n \to f(V_n) \subseteq \R^{k_n}. For each nn, consider

Un={f1(B(r,1/m)) : rQkn  and  mN}\mathcal{U}_n = \{ f^{-1}(B(r, 1/m)) \ : \ r \in \Q^{k_n} \ \text{ and } \ m \in \N \}

Because Qkn\Q^{k_n} is dense in Rkn\R^{k_n}, the balls B(r,1/m)B(r, 1/m) form a countable basis of f(Vn)f(V_n), so Un\mathcal{U}_n is a countable basis of VnV_n (since ff is homeomorphic). This gives us a countable basis n<ωUn\bigcup_{n < \omega} \mathcal{U}_n of XX.

176

Spectral     \implies Sober

Added:

Mar 25, 2026

Difficulty:

By definition.

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

181

Metrizable     \implies Locally metrizable

Added:

Mar 13, 2026

Difficulty:

Globally implies locally.

182

\aleph-space     \implies Has a σ\sigma-locally finite kk-network

Added:

Mar 26, 2026

Difficulty:

By definition.

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 pAp \in \overline{A}, select xnWnA{p}x_n \in W_n \cap A \setminus \{p\} for each nn and xnpx_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 “Ascl(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 Ascl(A)A\overline{A} \subseteq \text{scl}(A) \subseteq A, proving AA is closed.

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.

187

Finite     \implies Countable

Added:

Mar 12, 2026

Difficulty:

That’s right, “countable” does not mean infinitely countable.

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.

189

Finite     \implies Second countable

Added:

Mar 12, 2026

Difficulty:

Any topology is a subset of P(X)\mathcal{P}(X), so there are finitely many open sets.

190

Cardinality =1=\aleph_1     \implies Cardinality c\leq\mathfrak c

Added:

Mar 12, 2026

Difficulty:

By definition, 1\aleph_1 is the smallest cardinality greater than 0\aleph_0. Assuming the continuum hypothesis, 1=c\aleph_1 = \mathfrak c.

191

Cardinality =1=\aleph_1     \implies ¬ Countable

Added:

Mar 12, 2026

Difficulty:

By definition, 1\aleph_1 is the smallest uncountable cardinal.

192

(k2k_2-space ∧ k2k_2-Hausdorff)     \implies CGWH

Added:

Mar 26, 2026

Difficulty:

It suffices to prove Weak Hausdorff. Thus, let KK be compact T2T_2 and f:KXf : K \to X continuous. Using the k2k_2-space property, we wish to show that for any other KK' compact T2T_2 and g:KXg : K' \to X continuous, that g1(f(K))g^{-1}(f(K)) is closed. Let Δ\Delta be the diagonal of X2X^2. If we define the function f×g:K×KX2f \times g : K \times K' \to X^2 as (f×g)(x,y)=(f(x),g(x))(f \times g)(x, y) = (f(x), g(x)), then the set L=(f×g)1(Δ)L = (f \times g)^{-1}(\Delta) is closed, by the k2k_2-Hausdorff property (K×KK \times K' is compact T2T_2). If π2:K×KK\pi_2 : K \times K' \to K' is the projection map, since KK is compact, π2\pi_2 is a closed map. But π2(L)=g1(f(K))\pi_2(L) = g^{-1}(f(K)).

193

T2T_2     \implies Locally Hausdorff

Added:

Mar 13, 2026

Difficulty:

Globally implies locally.

194

CGWH     \implies KC

Added:

Mar 26, 2026

Difficulty:

Let LL be compact. Using the k2k_2-space property, we wish to show that for any KK compact T2T_2 and any f:KXf : K \to X continuous, that f1(L)f^{-1}(L) is closed. Our objectives are to show (1) XX is T1T_1 (2) f(K)f(K) is compact T2T_2 (3) prove f1(L)f^{-1}(L) is closed.

(1) The inclusion map id:{x}X\text{id} : \{x\} \to X is continuous and {x}\{x\} is clearly compact T2T_2, so apply Weak Hausdorff.

(2) f(K)f(K) is compact since ff is continuous. Note that T2T_2 spaces separate compact sets, and since every closed set in KK is compact, KK is T4T_4. Take xyf(K)x \ne y \in f(K). {x}\{x\} and {y}\{y\} are closed in XX by (1), so A=f1({x})A = f^{-1}(\{x\}) and B=f1({y})B = f^{-1}(\{y\}) are closed and can be separated by open nbds AUA \subseteq U and BVB \subseteq V. Note that KUK \setminus U is compact, so f(KU)f(K \setminus U) is closed and U=f(K)f(KU)U' = f(K) \setminus f(K \setminus U) is a nbd of xx. Similarly, V=f(K)f(KV)V' = f(K) \setminus f(K \setminus V) is a nbd of yy and UV=U' \cap V' = \emptyset.

(3) L=f(K)LL' = f(K) \cap L is compact. Since f(K)f(K) is T2T_2, LL' is closed in f(K)f(K) But f(K)f(K) is closed in XX by Weak Hausdorff, so LL' is closed. Then clearly f1(L)=f1(L)f^{-1}(L) = f^{-1}(L') is closed.

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.

197

(Has a σ\sigma-locally finite kk-network ∧ T3T_3)     \implies \aleph-space

Added:

Mar 26, 2026

Difficulty:

By definition.

198

Finite     \implies Noetherian

Added:

Mar 12, 2026

Difficulty:

Every subspace is finite.

199

Polish     \implies Separable

Added:

Mar 26, 2026

Difficulty:

By definition.