π-base: Difficulty 4

Difficulty: 4

For proofs that are relatively simple. Maybe the first idea didn't work but it's doable in a half-hour.

24

(Meta-Lindelöf ∧ Separable)     \implies Lindelöf

Added:

Mar 17, 2026

Difficulty:

Let U\mathcal{U} be an open cover, and V\mathcal{V} a point-countable open refinement. Let DD be countable with D=X\overline{D} = X. For each xDx \in D, let VxV\mathcal{V}_x \subseteq \mathcal{V} be the finite set of elements containing xx. Then V=xXVxV\mathcal{V}^* = \bigcup_{x \in X} \mathcal{V}_x \subseteq \mathcal{V} is countable. For each VVV \in \mathcal{V}^*, choose a UVUU_V \in \mathcal{U} such that VUV \subseteq U. Then U={UV : VV}\mathcal{U}^* = \{ U_V \ : \ V \in \mathcal{V}^* \} is countable. Any xXx \in X must have some VVV \in \mathcal{V} as an open neighborhood, and since DD is dense, VVdV \in \mathcal{V}_d for some dDd \in D, which proves xUVx \in U_V and U\mathcal{U}^* is a subcover.

28

(T2T_2 ∧ Countably compact ∧ First countable)     \implies T3T_3

Added:

Mar 17, 2026

Difficulty:

It suffices to show regularity. Let AA be closed and xAx \notin A. Let {Vn}\{V_n\} be a countable basis of xx. Define the collection Ua(n)={U nbd of a : UVn=}\mathcal{U}_a(n) = \{ U \text{ nbd of } a \ : \ U \cap V_n = \emptyset \} and U(n)=aAUa(n)\mathcal{U}(n) = \bigcup_{a \in A} \mathcal{U}_a(n). Clearly UnVn=\mathcal{U}_n \cap V_n = \emptyset for each nn. XX is T2T_2, so {Un}\{\mathcal{U}_n\} is an open cover of AA. A closed subspace of a countably compact space is countably compact, so let {U1,,Uk}\{\mathcal{U}_1, \dots, \mathcal{U}_k\} be a finite subcover and

V=n=1kVnU=n=1kUn    xV,AU, and UV=V = \bigcap_{n=1}^k V_n \qquad U = \bigcup_{n=1}^k \mathcal{U}_n \quad \implies \quad x \in V, A \subseteq U, \text{ and } U \cap V = \emptyset

38

Ultraconnected     \implies Path connected

Added:

Mar 18, 2026

Difficulty:

Let xyx \ne y. Note that {x}{y}\overline{\{x\}} \cap \overline{\{y\}} cannot be empty, so let zz be in their intersection and define the path f:[0,1]Xf : [0, 1] \to X where

f(t)={xt<1/2zt=1/2yt>1/2f(t) = \left\{ \begin{array}{ll} x & t < 1/2 \\ z & t = 1/2 \\ y & t > 1/2 \end{array} \right.

Any nbd of zz must contain both xx and yy, so if VfV \subseteq f is any open set, f1(V)f^{-1}(V) is one of the following sets: {[0,1/2),(1/2,1],[0,1]}\{[0, 1/2), (1/2, 1], [0, 1]\}, which are all open in [0,1][0, 1].

50

(T2T_2 ∧ Separable)     \implies Cardinality 2c\leq 2^{\mathfrak c}

Added:

Mar 17, 2026

Difficulty:

Let DD be a countable dense subset. For each xXx \in X, define Dx={AD : xA}\mathcal{D}_x = \{ A \subseteq D \ : \ x \in \overline{A} \}, which is nonempty as it has DD itself. If xyx \ne y, being T2T_2 ensures nbds UU of xx and VV of YY such that UV=U \cap V = \emptyset. Clearly DVDyD \cap V \in \mathcal{D}_y, and U(DV)=U \cap (D \cap V) = \emptyset implies xDVx \notin \overline{D \cap V}, so DVDxD \cap V \notin \mathcal{D}_x. Therefore, the function f:X22Df : X \to 2^{2^D} defined as f(x)=Dxf(x) = \mathcal{D}_x is injective, and card(X)card(22D)=2c\text{card}(X) \le \text{card}(2^{2^D}) = 2^\mathfrak{c}

58

Weakly locally compact     \implies k1k_1-space

Added:

Mar 23, 2026

Difficulty:

Let AXA \subseteq X such that KAK \cap A is open in KK for every KXK \subseteq X compact. We wish to show AA is open in XX. For xAx \in A, let xVKx \in V \subseteq K where VV is open and KK is compact. As AKA \cap K is open in KK, there exists some open WW such that xWKAKx \in W \cap K \subseteq A \cap K. Thus, choose U=VWU = V \cap W. Clearly it is open and xUWKAx \in U \subseteq W \cap K \subseteq A.

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.

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

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.

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.

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

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.

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.

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.

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.

305

Sequentially discrete     \implies Totally path disconnected

Added:

Mar 31, 2026

Difficulty:

XX must be T1T_1: The constant sequence xn=xx_n = x could not converge to yxy \ne x (T226) and so there is a nbd of yy not containing xx, and vice versa. If f:[0,1]Xf : [0, 1] \to X is a path, f([0,1])f([0, 1]) is connected, so it can’t be a finite union of multiple closed sets, hence it is either a singleton or infinite. Take {yn}\{y_n\} countably infinite and for each nn choose tn[0,1]t_n \in [0, 1] so that f(tn)=ynf(t_n) = y_n. Because [0,1][0, 1] is sequentially compact, tnktt_{n_k} \to t for some subsequence and then ynkf(t)y_{n_k} \to f(t) by continuity of ff, yet {ynk}\{y_{n_k}\} isn’t eventually constant, a contradiction. Thus, f([0,1])f([0, 1]) is a singleton and the path is constant.

307

(Locally finite ∧ T0T_0)     \implies Scattered

Added:

Mar 31, 2026

Difficulty:

It suffices to show finite sets have isolated points: If AA is any set, take VAV \subseteq A a finite nbd, then WW the nbd of an isolated point of VV. Then it must be isolated in AA since VV is open     \implies WW is open.

By induction, the isolated point of {x1}\{x_1\} is trivial and {x1,x2}\{x_1, x_2\} has an isolated point by T0T_0. For the set F={x1,,xn+1}F = \{x_1, \dots, x_{n+1}\}, let xjx_j with nbd UU such that U{x1,,xn}={xj}U \cap \{x_1, \dots, x_n\} = \{x_j\}. If xn+1Ux_{n+1} \notin U, then xjx_j is the isolated point of FF. Otherwise, let y{xj,xn+1}y \in \{x_j, x_{n+1}\} with nbd V{xj,xn+1}={y}V \cap \{x_j, x_{n+1}\} = \{y\}. Then yy is the isolated point of FF since (UV)F={y}(U \cap V) \cap F = \{y\}.

310

T2T_2     \implies Has closed retracts

Added:

Mar 31, 2026

Difficulty:

Let f:XAf : X \to A be a continuous map with fA=idAf|_A = \text{id}_A. Define h:XX2h : X \to X^2 as h(x)=(x,f(x))h(x) = (x, f(x)). If U×VX2U \times V \subseteq X^2, then h(Uf1(V))U×Vh(U \cap f^{-1}(V)) \subseteq U \times V, so hh is continuous. Since XX is T2T_2, the diagonal ΔX2\Delta \subseteq X^2 is closed, and h1(Δ)={xX : f(x)=x}=Ah^{-1}(\Delta) = \{ x \in X \ : \ f(x) = x \} = A is closed.

312

(k1k_1-space ∧ KC)     \implies Has closed retracts

Added:

Apr 2, 2026

Difficulty:

Let AXA \subseteq X such that there is some continuous f:XAf : X \to A with fA=idAf|_A = \text{id}_A. To prove AA is closed, we use the k1k_1-space property, and prove KAK \cap A is closed in KK for each compact KXK \subseteq X. KK is closed, so f1(K)f^{-1}(K) is closed, and so is K=f1(K)KK' = f^{-1}(K) \cap K. Then f(K)=KAf(K') = K \cap A is compact, so it is closed.

351

(Regular ∧ P-space)     \implies Zero dimensional

Added:

Apr 3, 2026

Difficulty:

We wish to show that for every xx and VV nbd of xx, there exists a clopen set BB with xBVx \in B \subseteq V. Define U0=VU_0 = V. By regularity, there some xU1x \in U_1 and U0CU1U_0^C \subseteq U_1^* such that U1U1=U_1 \cap U_1^* = \emptyset. Inductively, given xUnx \in U_n, there exists xUn+1x \in U_{n+1} and UnCUn+1U_n^C \subseteq U_{n+1}^* with Un+1Un+1=U_{n+1} \cap U_{n+1}^* = \emptyset. Thus, we construct a decreasing sequence (Un)(U_n) such that xBn<ωUnx \in B \coloneqq \bigcap_{n < \omega} U_n and Un+1Un\cl{U_{n+1}} \subseteq U_n for all nn. BB is open by P-space, and closed because B=n<ωUnB = \bigcap_{n < \omega} \cl{U_n}.

388

GδG_\delta space     \implies Countably metacompact

Added:

Apr 3, 2026

Difficulty:

Suppose {Fn}\{F_n\} is a decreasing sequence of compact sets with Fn=\bigcap F_n = \emptyset. For each nn, we have Fn=k<ωVnkF_n = \bigcap_{k < \omega} V_{nk} where {Vnk}\{V_{nk}\} are open and decreasing. Thus, define Um=nmVnmU_m = \bigcap_{n \le m} V_{nm}. Clearly Fm=nmFnnmVnm=UmF_m = \bigcap_{n \le m} F_n \subseteq \bigcap_{n \le m} V_{nm} = U_m. For any xx, there exists some nn with xFnx \notin F_n, which means there is some kk with xVnkx \notin V_{nk}. But then xVnkx \notin V_{nk'} for all kkk' \ge k, so just take kmax{k,n}k' \ge \max \{k, n\} and xUkVnkx \notin U_{k'} \subseteq V_{nk'}. So Um=\bigcap U_m = \emptyset.

398

(P-space ∧ T3T_3 ∧ Pseudocompact)     \implies Finite

Added:

Apr 3, 2026

Difficulty:

We first show that if AA is countable and xAx \notin A, then xAx \notin \cl{A}. Just enumerate A={xn}A = \{x_n\} and let UnU_n be a nbd of xx with xnUnx_n \notin U_n. Then V=UnV = \bigcap U_n is a nbd of xx (using P-space) and VA=V \cap A = \emptyset. This proves every countable set is closed and discrete, since for any xAx \in A, B=A{x}B = A \setminus \{x\} is countable with xBx \notin B, so there must be a nbd VV of xx with VB=    VA={x}V \cap B = \emptyset \implies V \cap A = \{x\}.

The space is zero-dimensional (T351). Contrapositively, if A={xn}n=1A = \{x_n\}_{n=1}^\infty were to be a countably infinite set, being discrete, let UnU_n be a nbd of xnx_n with AUn={xn}A \cap U_n = \{x_n\}, then choose xBnUnx \in B_n \subseteq U_n where BnB_n is clopen. Being a P-space, note that B~nBnmnBm\tilde{B}_n \coloneqq B_n \setminus \bigcup_{m \ne n} B_m is also clopen with xnB~nx_n \in \tilde{B}_n, and {B~n}n=1\{\tilde{B}_n\}_{n=1}^\infty are pairwise-disjoint. B~0Xn<ωB~n\tilde{B}_0 \coloneqq X \setminus \bigcup_{n < \omega} \tilde{B}_n is also clopen. Then {B~n}\{\tilde{B}_n\} is a partition of clopen sets of XX and we can define f(x)=nf(x) = n for xB~nx \in \tilde{B}_n. This function must be continuous, so the space is not pseudocompact.

408

Submetrizable     \implies Functionally Hausdorff

Added:

Apr 3, 2026

Difficulty:

Let τ\tau be the current topology of XX and ττ\tau' \subseteq \tau a metrizable topology on XX with metric dd. If xyx \ne y, then d(p,x)+d(p,y)>0d(p, x) + d(p, y) > 0 for all pXp \in X. So define

f(p)=d(p,x)d(p,x)+d(p,y)f(p) = \frac{d(p, x)}{d(p, x) + d(p, y)}

Then f:(X,τ)[0,1]f : (X, \tau') \to [0, 1] is continuous with f(x)=0f(x) = 0 and f(y)=1f(y) = 1. Since ττ\tau' \subseteq \tau, f:(X,τ)[0,1]f : (X, \tau) \to [0, 1] is also continuous.

412

Has a coarser separable metrizable topology     \implies Cardinality c\leq\mathfrak c

Added:

Mar 27, 2026

Difficulty:

Consider XX with such a separable metrizable topology. Let AA be a countable dense subset. To prove the result, we wish to find a function f:XP(A)Nf : X \to \mathcal{P}(A)^{\N} which is injective, so that card(X)card(P(A)N)=(20)0=20=c\text{card}(X) \le \text{card}(\mathcal{P}(A)^{\N}) = (2^{\aleph_0})^{\aleph_0} = 2^{\aleph_0} = \mathfrak{c}. Such a function is f(x)=(f1(x),f2(x),)f(x) = (f_1(x), f_2(x), \dots) where each fn:XP(A)f_n : X \to \mathcal{P}(A) is defined as fn(x)=B(x,1/n)Af_n(x) = B(x, 1/n) \cap A. As AA is dense, fn(x)f_n(x) \ne \emptyset for all nn and all xx. For xyx \ne y, let n>2d(x,y)n > 2d(x, y) so that B(x,1/n)B(y,1/n)=B(x, 1/n) \cap B(y, 1/n) = \emptyset, and so fn(x)fn(y)=    f(x)f(y)f_n(x) \cap f_n(y) = \emptyset \implies f(x) \ne f(y).

425

k2k_2-Hausdorff     \implies US

Added:

Apr 4, 2026

Difficulty:

Suppose (xn)(x_n) is a sequence with xnxx_n \to x and xnyx_n \to y. ω+1\omega + 1 with the order topology is a compact space. Define f,g:ω+1Xf,g : \omega + 1 \to X as f(n)=g(n)=xnf(n) = g(n) = x_n, f(ω)=xf(\omega) = x, g(ω)=yg(\omega) = y. Then ff and gg are continuous. By k2k_2-Hausdorff, the set F={αω+1 : f(α)=g(α)}F = \{ \alpha \in \omega + 1 \ : \ f(\alpha) = g(\alpha) \} is closed. Clearly by definition ωF\omega \subseteq F, yet ω\omega is not closed, since ωω\omega \in \cl{\omega}. So F=ω+1F = \omega + 1 and x=yx = y.

426

(T1T_1 ∧ Has a dispersion point)     \implies Totally path disconnected

Added:

Apr 4, 2026

Difficulty:

Let pp be the dispersion point. Clearly if xyx \ne y are points in X{p}X \setminus \{p\} then there is no path from xx to yy (disconnected implies path disconnected). So the only possible non-constant paths are from pp to xpx \ne p. Let f:[0,1]Xf : [0, 1] \to X with f(0)=pf(0) = p and f(1)=xf(1) = x. Being T1T_1, we see that f1(p)f^{-1}(p) is closed, so let t=supf1(p)t = \sup f^{-1}(p) and then f(t)=pf(t) = p. But for any s>ts > t, the path f[s,t]f|_{[s, t]} lies within X{p}X \setminus \{p\} so it must be constant, proving f(s)=xf(s) = x for all s>ts > t, and so ff is discontinuous at tt: Take a nbd of pp not containing xx, yet every open interval containing tt must contain some s>ts > t.

442

(σ\sigma-compact ∧ KC)     \implies Metacompact

Added:

Apr 4, 2026

Difficulty:

Similar proof to (T427). Let {Kn}\{K_n\} be an increasing sequence of compact sets which cover XX. Let U\mathcal{U} be an open cover. For each nn, there exists a finite subset FnU\mathcal{F}_n \subseteq \mathcal{U} such that Fn\mathcal{F}_n covers KnK_n. Then define R0=F0\mathcal{R}_0 = \mathcal{F}_0 and Rn+1={UKn : UFn}\mathcal{R}_{n+1} = \{ U \setminus K_n \ : \ U \in \mathcal{F}_n \}. Clearly by construction, R=n<ωRn\mathcal{R} = \bigcup_{n < \omega} \mathcal{R}_n must be an open refinement of U\mathcal{U}. And for each xx, let nn be the smallest index so that xKnx \in K_n. This immediately implies xUx \notin U for any Rk\mathcal{R}_k with k>nk > n, and so xx intersects at most the nbds in knRn\bigcup_{k \le n} \mathcal{R}_n, which is finite.

445

(Compact ∧ Connected ∧ LOTS ∧ ¬ Empty)     \implies Fixed point property

Added:

Apr 5, 2026

Difficulty:

Firstly, note that a compact LOTS space must have minimum and maximum elements. If it didn’t have a maximum, the open intervals (,x)({\leftarrow}, x) would be an open cover with no finite subcover. Similarly for the minimum. So let x0x_0 be the minimum and y0y_0 the maximum elements.

We first see that A={xX : f(x)>x}A = \{ x \in X \ : \ f(x) > x \} is open. Given xAx \in A, if there is some x<z<f(x)x < z < f(x), then take U=(,z)U = ({\leftarrow}, z) and V=(z,)V = (z, {\rightarrow}). If there is no such zz, let U=(,f(x))U = ({\leftarrow}, f(x)) and V=(x,)V = (x, {\rightarrow}). In both cases, we have xUx \in U, f(x)Vf(x) \in V, and every element of VV is strictly greater than every element of UU. Let W=f1(V)UW = f^{-1}(V) \cap U. Then yW    f(y)>yy \in W \implies f(y) > y and so xWAx \in W \subseteq A. Through a similar proof, B={xX : f(x)<x}B = \{ x \in X \ : \ f(x) < x \} is open as well. Note that AB=A \cap B = \emptyset, y0Ay_0 \notin A, and x0Bx_0 \notin B. Because XX is connected, this means ABXA \cup B \ne X, and so there must be some pABp \notin A \cup B, so f(p)=pf(p) = p.

567

(Hereditarily connected ∧ Locally finite)     \implies Countable

Added:

Mar 13, 2026

Difficulty:

XX is a countable union of finite open sets. XX hereditarily connected, so this basis is linearly ordered and it’s possible to enumerate them as {Bn}\{B_n\} where n<m    BnBmn < m \implies B_n \subset B_m. Therefore, BnXB_n \nearrow X and XX is a union of finite sets.

702

(Locally injectively path connected ∧ ¬ Discrete)     \implies ¬ Biconnected

Added:

Mar 21, 2026

Difficulty:

If not discrete, there exists a non-isolated point xx. Let VV be its injectively path connected nbd, which must contain some yxy \ne x. Let f:[0,1]Xf : [0, 1] \to X be an injective path from xx to yy. Then f([0,1/2))f([0, 1/2)) and f((1/2,1])f((1/2, 1]) are connected and disjoint.