IDs 1-99

1

Compact     \implies Countably compact

Added:

Mar 12, 2026

Difficulty:

Evident.

2

Countably compact     \implies Weakly countably compact

Added:

Mar 11, 2026

Difficulty:

Let XX be infinite and AXA \subseteq X countably infinite. If XX has no limit points, AA is closed and for each xAx \in A, choose a nbd VxV_x with VxX=V_x \cap X = \emptyset. Then {Vn}{AC}\{V_n\} \cup \{A^C\} is a cover. A finite subcover would imply AA is finite.

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.

4

Countably compact     \implies Pseudocompact

Added:

Mar 11, 2026

Difficulty:

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

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.

6

Compact     \implies Locally relatively compact

Added:

Mar 12, 2026

Difficulty:

Any closed set is compact, so any closure of a nbd is compact.

7

Locally relatively compact     \implies Weakly locally compact

Added:

Mar 12, 2026

Difficulty:

Take one nbd from the local basis. Its closure is compact.

8

Exhaustible by compacts     \implies Weakly locally compact

Added:

Mar 12, 2026

Difficulty:

Yeah.

9

Compact     \implies Exhaustible by compacts

Added:

Mar 12, 2026

Difficulty:

Indeed.

10

(Extremally disconnected ∧ Locally Hausdorff)     \implies Sequentially discrete

Added:

Mar 14, 2026

Difficulty:

Contrapositively, suppose (xn)(x_n) is a sequence with xnpx_n \to p yet has infinitely many terms. If needed, take an injective subsequence. If VV is a nbd of pp that is T2T_2, then there’s a n0n_0 with xnVx_n \in V for nn0n \ge n_0. So by another subsequence, we can assume (xn)(x_n) is an injective converging sequence in a T2T_2 space.

For each nn, it’s possible to construct a neighborhood VnV_n which only contains xnx_n and no other xmx_m, nor pp: Let xnVx_n \in V and pUp \in U with UV=U \cap V = \emptyset. xmUx_m \in U for all mn0m \ge n_0, so apply the Hausdorff condition finitely many times to terms xm<n0x_m < n_0 to construct such VnVV_n \subseteq V.

Now note that x2npx_{2n} \to p and x2n+1px_{2n+1} \to p, so if E=V2nE = \bigcup V_{2n} and O=V2n+1O = \bigcup V_{2n+1}, then any nbd of pp must intersect EE and OO, so pEOp \in \overline{E} \cap \overline{O}. Yet by definition, EO=E \cap O = \emptyset, so the space is not extremally disconnected.

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}

13

Compact     \implies Strongly paracompact

Added:

Mar 12, 2026

Difficulty:

A subcover is a refinement. A finite subcover is star-finite.

14

Paracompact     \implies Metacompact

Added:

Mar 12, 2026

Difficulty:

If finitely many intersect a nbd around the point, finitely many will intersect the point.

15

Paracompact     \implies Countably paracompact

Added:

Mar 12, 2026

Difficulty:

If true for any covers, then true for countable ones.

16

Submetacompact     \implies Countably metacompact

Added:

Mar 12, 2026

Difficulty:

If true for any covers, then true for countable ones.

17

Countably compact     \implies Countably paracompact

Added:

Mar 12, 2026

Difficulty:

A subcover is a refinement. A finite subcover is star-finite.

18

Countably paracompact     \implies Countably metacompact

Added:

Mar 12, 2026

Difficulty:

This is Paracompact     \implies Metacompact, just countable this time.

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.

25

Topological nn-manifold     \implies Locally nn-Euclidean

Added:

Mar 12, 2026

Difficulty:

By definition.

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=f1([0,1/2))U = f^{-1}([0, 1/2)) and V=f1((1/2,1])V = f^{-1}((1/2, 1]) are disjoint with AUA \subseteq U and bVb \in V.

36

Completely normal     \implies Normal

Added:

Mar 14, 2026

Difficulty:

A space is a subspace of itself.

41

Has a dispersion point     \implies ¬ Empty

Added:

Mar 12, 2026

Difficulty:

If it has a dispersion point… it has… a point.

42

Discrete     \implies T1T_1

Added:

Mar 12, 2026

Difficulty:

Singletons are clopen.

52

(Totally disconnected ∧ Has multiple points)     \implies ¬ Connected

Added:

Mar 12, 2026

Difficulty:

The space is not a singleton.

67

Countable     \implies Cardinality <c\lt\mathfrak c

Added:

Mar 12, 2026

Difficulty:

This is obvious, so fun fact: The converse requires the continuum hypothesis.

68

Cardinality <c\lt\mathfrak c     \implies Cardinality c\leq\mathfrak c

Added:

Mar 12, 2026

Difficulty:

Big brain stuff.

74

Countable     \implies σ\sigma-compact

Added:

Mar 12, 2026

Difficulty:

Singletons are compact.

75

(Injectively path connected ∧ Has multiple points)     \implies ¬ Cardinality <c\lt\mathfrak c

Added:

Mar 12, 2026

Difficulty:

The path between two distinct points has at least c\mathfrak c points.

80

(Functionally Hausdorff ∧ Has multiple points)     \implies ¬ Strongly connected

Added:

Mar 12, 2026

Difficulty:

The continuous map with f(a)=0f(a) = 0 and f(b)=1f(b) = 1 is not constant.

85

Discrete     \implies Completely metrizable

Added:

Mar 13, 2026

Difficulty:

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

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.

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.

88

(Path connected ∧ Has multiple points)     \implies ¬ Totally path disconnected

Added:

Mar 12, 2026

Difficulty:

Take a path between two points. It’s not constant.

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.

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.

94

(Injectively path connected ∧ Has multiple points)     \implies ¬ Biconnected

Added:

Mar 12, 2026

Difficulty:

If ff continuous, f([0,1/3])f([0, 1/3]) and f([2/3,1])f([2/3, 1]) are connected.

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.

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

98

T4T_4     \implies T1T_1

Added:

Mar 13, 2026

Difficulty:

T4T_4 is T2T_2 (hence, T1T_1) by definition.

99

(T1T_1 ∧ Normal)     \implies T4T_4

Added:

Mar 13, 2026

Difficulty:

Let xyx \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 UV=U \cap V = \emptyset. So it is T2T_2 and normal.