Difficulty: 5

For proofs that take a little bit of time. Took me some time thinking, probably had to look at a hint.

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.

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.

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.