π-base: IDs 400-499

IDs 400-499

400

(Connected ∧ Strongly zero-dimensional)     \implies Strongly connected

Added:

Apr 3, 2026

Difficulty:

Contrapositively, let f:XRf : X \to \R is continuous and non-constant. So f(x)=αf(x) = \alpha and f(y)=βf(y) = \beta with αβ\alpha \ne \beta. Clearly A1=f1(α)A_1 = f^{-1}(\alpha) and A2=f1(β)A_2 = f^{-1}(\beta) are disjoint. They are zero sets, since A1=g1(0)A_1 = g^{-1}(0) for g(x)=f(x)αg(x) = f(x) - \alpha and similarly, A2A_2 is a zero set. So A1B1A_1 \subseteq B_1 and A2B2A_2 \subseteq B_2 with B1,B2B_1,B_2 disjoint clopen sets, by strongly zero-dimensional. In particular, xB1Xx \in B_1 \subset X, so the space is not connected.

401

Normal     \implies Pseudonormal

Added:

Apr 3, 2026

Difficulty:

If you remove “countable” from the definition of pseudonormal, that’s precisely one property of normal spaces. If HH is closed and HUH \subseteq U is open, then HUC=H \cap U^C = \emptyset, so there are open sets HVH \subseteq V and UCVU^C \subseteq V' with VV=V \cap V' = \emptyset. In particular, VU\cl{V} \subseteq U.

402

(T1T_1 ∧ Pseudonormal)     \implies Regular

Added:

Apr 3, 2026

Difficulty:

Let xAx \notin A with AA closed. Being T1T_1, {x}\{x\} is a countable closed set, and {x}U=AC\{x\} \subseteq U = A^C is open. So let VV be open with xVVACx \in V \subseteq \cl{V} \subseteq A^C. Then AVC=WA \subseteq \cl{V}^C = W with VW=V \cap W = \emptyset.

403

(Regular ∧ P-space)     \implies Pseudonormal

Added:

Apr 3, 2026

Difficulty:

Let H={xn}H = \{x_n\} and HUH \subseteq U open. Then xnF=UCx_n \notin F = U^C for each nn, so by regularity, let xVnx \in V_n and FUnF \subseteq U_n with VnUn=V_n \cap U_n = \emptyset. Then AV=n<ωVnA \subseteq V = \bigcup_{n < \omega} V_n and FW=n<ωUnF \subseteq W = \bigcap_{n < \omega} U_n with VW=V \cap W = \emptyset. But that implies VF=\cl{V} \cap F = \emptyset, so HVVUH \subseteq V \subseteq \cl{V} \subseteq U.

406

(Pseudonormal ∧ Countable)     \implies Normal

Added:

Apr 3, 2026

Difficulty:

If A,BA,B are closed and disjoint, just apply the theorem to AU=BCA \subseteq U = B^C, since AA must be countable. Then AVVUA \subseteq V \subseteq \cl{V} \subseteq U so that BW=VCB \subseteq W = \cl{V}^C and VW=V \cap W = \emptyset.

407

Metrizable     \implies Submetrizable

Added:

Mar 12, 2026

Difficulty:

A topology is a coarser topology of itself.

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.

409

(Separable ∧ Submetrizable)     \implies Has a coarser separable metrizable topology

Added:

Apr 3, 2026

Difficulty:

The space has a coarser metrizable topology, and any coarser topology of a separable space is separable as well (a dense set remains dense in coarser topologies).

410

Has a coarser separable metrizable topology     \implies Submetrizable

Added:

Mar 12, 2026

Difficulty:

We’re just dropping the “separable”.

411

(Discrete ∧ Cardinality c\leq\mathfrak c)     \implies Has a coarser separable metrizable topology

Added:

Mar 27, 2026

Difficulty:

Let f:XRf : X \to \R be injective. Using the usual topology of R\R, we can define d(x,y)=f(x)f(y)d(x, y) = \abs{f(x) - f(y)} which is clearly a metric, and under this new metrizable topology for XX, ff is a homeomorphism from XX to f(X)Rf(X) \subseteq \R, and any subset of R\R has a countable dense subset. This separable metrizable topology is trivially coarser than the discrete topology.

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

413

(Anticompact ∧ T1T_1)     \implies Sequentially discrete

Added:

Mar 27, 2026

Difficulty:

Let (xn)(x_n) be a sequence with xnxx_n \to x. Then A={xn : n<ω}{x}A = \{ x_n \ : \ n < \omega\} \cup \{x\} is compact, since for any open cover of AA, some element VV nbd of xx must contain xnx_n for all nn0n \ge n_0 and {xn : n<n0}\{ x_n \ : \ n < n_0 \} is finite. But then AA is finite, and in a T1T_1 space, it must be discrete. So for some n0n_0, nn0    xn{x}    xn=xn \ge n_0 \implies x_n \in \{x\} \implies x_n = x.

414

Sequentially discrete     \implies US

Added:

Mar 27, 2026

Difficulty:

Any converging sequence is eventually constant, and this constant has to be unique.

415

(P-space ∧ T1T_1)     \implies Countable sets are discrete

Added:

Mar 27, 2026

Difficulty:

All countable sets are closed, since they are a countable union of singletons (closed by T1T_1). If AA is countable and some pAp \in A were not to be isolated, then pA{p}p \in \cl{A \setminus \{p\}}, which would imply A{p}A \setminus \{p\} is countable yet not closed.

416

(Sequential ∧ Sequentially discrete)     \implies Discrete

Added:

Mar 28, 2026

Difficulty:

Contrapositively, if pp is not an isolated point, then pX{p}p \in \cl{X \setminus \{p\}} and then there exists a sequence (xn)(x_n) in X{p}X \setminus \{p\} with xnpx_n \to p. But then this sequence cannot be eventually constant, since the constant would have to be pp itself.

417

(Separable ∧ Countable sets are discrete)     \implies Countable

Added:

Mar 28, 2026

Difficulty:

Let AA countable with A=X\cl{A} = X. For any xXx \in X, A{x}A \cup \{x\} is countable, so it is discrete. Since xAx \in \cl{A}, we have xAx \in A and so X=AX = A is countable.

418

(Countably tight ∧ Countable sets are discrete)     \implies Discrete

Added:

Mar 28, 2026

Difficulty:

Contrapositively, if pp is not an isolated point, then pX{p}p \in \cl{X \setminus \{p\}}, so there exists a countable DX{p}D \subseteq X \setminus \{p\} with pDp \in \cl{D}. But then D{p}D \cup \{p\} is countable yet not discrete.

419

Semi-Hausdorff     \implies T1T_1

Added:

Mar 21, 2026

Difficulty:

A regular open neighborhood is… an open neighborhood.

420

T2T_2     \implies Semi-Hausdorff

Added:

Mar 21, 2026

Difficulty:

If xUx \in U and yVy \in V with UV=U \cap V = \emptyset, in particular, yUy \notin \cl{U}. So xW=int(U)x \in W = \text{int}(\cl{U}) is regular and yWy \notin W. (blaze it)

421

(T1T_1 ∧ Semiregular)     \implies Semi-Hausdorff

Added:

Mar 21, 2026

Difficulty:

If xUx \in U is a nbd with yUy \notin U, let OO be a regular basis element with xOUx \in O \subseteq U.

422

(Semi-Hausdorff ∧ Has multiple points)     \implies ¬ Hyperconnected

Added:

Mar 21, 2026

Difficulty:

Let xU=int(U)x \in U = \text{int}(\cl{U}) with yUy \notin U. If UU were to be dense, we’d have U=X\cl{U} = X, but int(U)=UX=int(X)\text{int}(\cl{U}) = U \ne X = \text{int}(X).

423

(Weakly locally compact ∧ k1k_1-Hausdorff)     \implies T2T_2

Added:

Apr 3, 2026

Difficulty:

Let xUKx \in U \subseteq K and yVKy \in V \subseteq K' with U,VU,V open, K,KK,K' compact, and xyx \ne y. Then L=KKL = K \cup K' is compact, so it is T2T_2. Thus, let xWx \in W and yWy \in W' be nbds such that WWL=W \cap W' \cap L = \emptyset. Then (UW)(VW)=(U \cap W) \cap (V \cap W') = \emptyset separates xx and yy by open sets in XX.

424

k1k_1-Hausdorff     \implies KC

Added:

Apr 4, 2026

Difficulty:

Let KXK \subseteq X compact and xKx \notin K. Then K{x}K \cup \{x\} is compact and T2T_2. T2T_2 spaces separate points from compact sets, so there exists a nbd VV of xx with VK=V \cap K = \emptyset. So KK is closed.

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.

427

(Exhaustible by compacts ∧ KC)     \implies Paracompact

Added:

Apr 4, 2026

Difficulty:

Let {Kn}n=1\{K_n\}_{n=1}^\infty be a cover of compact nbds with Knint(Kn+1)K_n \subseteq \text{int}(K_{n+1}). Let U\mathcal{U} be any open cover. For each nn, there is a finite FnU\mathcal{F}_n \subseteq \mathcal{U} which covers KnK_n. Now we use the fact that each KnK_n is closed by KC, and so Un=int(Kn)Kn1U_n = \text{int}(K_n) \setminus K_{n-1} are all open (to define it at n=1n=1, denote K0=K_0 = \emptyset). Thus, each UnU_n is covered by the finite sets Fn\mathcal{F}_n, and if we define Rn={UnF : FFn}\mathcal{R}_n = \{ U_n \cap F \ : \ F \in \mathcal{F}_n \}, we get that R=n=1Rn\mathcal{R} = \bigcup_{n=1}^\infty \mathcal{R}_n is an open refinement, where for each xx, take the smallest nn for which xint(Kn)x \in \text{int}(K_n) so that xUnx \in U_n and so xx intersects at least one and at most all (finitely many) elements of Rn\mathcal{R}_n.

428

Cardinality 3\geq 3     \implies Has multiple points

Added:

Mar 12, 2026

Difficulty:

If you have at least 3 apples, then you have at least 2 apples.

429

(Connected ∧ ¬ Cardinality 3\geq 3 ∧ ¬ Empty)     \implies Has a dispersion point

Added:

Mar 20, 2026

Difficulty:

If XX has one or two points, clearly X{p}X \setminus \{p\} has either 1 point (trivially totally disconnected), or it’s empty (also totally disconnected, since there are no connected components).

430

Cardinality 4\geq 4     \implies Cardinality 3\geq 3

Added:

Mar 12, 2026

Difficulty:

If you have at least 4 apples, then you have at least 3 apples.

431

¬ Finite     \implies Cardinality 4\geq 4

Added:

Mar 12, 2026

Difficulty:

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

433

(Connected ∧ ¬ Cardinality 4\geq 4)     \implies Biconnected

Added:

Apr 4, 2026

Difficulty:

Vacuously true: there are no disjoint subsets with at least two points each.

437

Discrete     \implies Locally nn-Euclidean

Added:

Mar 21, 2026

Difficulty:

{x}\{x\} is homeomorphic to R0\R^0.

438

(Locally nn-Euclidean ∧ Has an isolated point)     \implies Discrete

Added:

Apr 4, 2026

Difficulty:

Some nbd around the isolated point has to be homeomorphic to R0\R^0. But that implies every point has a nbd homeomorphic to R0\R^0, and so every point is isolated.

439

(Compact ∧ Countable)     \implies Sequentially compact

Added:

Apr 4, 2026

Difficulty:

Initially, for each xXx \in X, if a sequence (yn)(y_n) does not converge to xx, then there exists a nbd VV of xx such that for all n0ωn_0 \in \omega, there exists some n>n0n > n_0 such that ynVy_n \notin V. This means there are infinitely many nn for which ynVy_n \notin V, and so we can construct a subsequence (ynk)(y_{n_k}) such that (1) it doesn’t have a converging subsequence either and (2) ynkVy_{n_k} \notin V for all kk.

Let X={xn}X = \{x_n\}. Contrapositively, let y=(yn)\mathbf{y} = (y_n) be a sequence with no converging subsequence. Let V0V_0 be a nbd of x0x_0 and construct a subsequence y0\mathbf{y}_0 of y\mathbf{y} such that every term in y0\mathbf{y}_0 lies outside V0V_0. Inductively, given yn\mathbf{y}_n, choose Vn+1V_{n+1} a nbd of xn+1x_{n+1}, and let yn+1\mathbf{y}_{n+1} be a subsequence of yn\mathbf{y}_n which lies entirely outside of Vn+1V_{n+1}. Note that by construction, each yn\mathbf{y}_n is a subsequence of yk\mathbf{y}_k for any k<nk < n, so all of its terms lie outside of knVk\bigcup_{k \le n} V_k. This way, we’ve constructed an open cover {Vn}\{V_n\} of XX with no finite subcover, and so XX is not compact.

440

Hereditarily separable     \implies Separable

Added:

Mar 21, 2025

Difficulty:

A space is a subspace of itself.

441

Hereditarily separable     \implies Countably tight

Added:

Apr 4, 2026

Difficulty:

For each AXA \subseteq X, as it is separable subspace, there is a countable DAD \subseteq A with ADA \subseteq \cl{D}. So then AD=D\cl{A} \subseteq \cl{\cl{D}} = \cl{D}.

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.

443

Fixed point property     \implies Connected

Added:

Apr 4, 2026

Difficulty:

If XX is disconnected, let AA be a clopen set with pAp \in A and qAq \notin A. Then the function f:XXf : X \to X defined as f(x)=qf(x) = q at xAx \in A and f(x)=pf(x) = p at xAx \notin A, then ff is continuous yet has no fixed point.

444

(Has a group topology ∧ Has multiple points)     \implies ¬ Fixed point property

Added:

Apr 4, 2026

Difficulty:

If g1g \ne 1, then the map xgxx \mapsto gx is continuous yet has no fixed point.

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.

446

Fixed point property     \implies ¬ Empty

Added:

Mar 12, 2026

Difficulty:

If it has a fixed point… it has… a point.

447

Fixed point property     \implies T0T_0

Added:

Apr 5, 2026

Difficulty:

If pqp \ne q were to be topologically indistinguishable, let f(x)=pf(x) = p for all xpx \ne p and f(p)=qf(p) = q. Then ff is continuous yet has no fixed point.

448

Indiscrete     \implies Partition topology

Added:

Apr 5, 2026

Difficulty:

The partition would be {X}\{X\} itself, the trivial partition.

450

Indiscrete     \implies Second countable

Added:

Mar 12, 2026

Difficulty:

In general, a countable topology is second countable.

451

(Indiscrete ∧ ¬ Cardinality <c\lt\mathfrak c)     \implies Locally injectively path connected

Added:

Mar 21, 2026

Difficulty:

If card(X)c=card([0,1])\text{card}(X) \ge \mathfrak{c} = \text{card}([0, 1]), then there exists an injective function f:[0,1]Xf : [0, 1] \to X, which is clearly continuous in the trivial space, and a path from f(0)f(0) to f(1)f(1).

452

Has a cut point     \implies Connected

Added:

Apr 5, 2026

Difficulty:

By definition.

454

Countably infinite     \implies Countable

Added:

Mar 12, 2026

Difficulty:

Can’t argue with that.

455

Countably infinite     \implies ¬ Finite

Added:

Mar 12, 2026

Difficulty:

Can’t argue with that.

456

(Countable ∧ ¬ Finite)     \implies Countably infinite

Added:

Mar 12, 2026

Difficulty:

Can’t argue with that.

457

Corson compact     \implies Compact

Added:

Apr 5, 2026

Difficulty:

By definition.

459

Embeddable into Euclidean space     \implies Second countable

Added:

Apr 5, 2026

Difficulty:

If f:XYRnf : X \to Y \subseteq \R^n is a homeomorphism, the balls of the form B(r,1/n)B(r, 1/n) for rQr \in \Q and nNn \in \N form a countable basis for Rn\R^n, so f1(B(r,1/n))f^{-1}(B(r, 1/n)) forms a basis for XX.

460

Embeddable into Euclidean space     \implies Metrizable

Added:

Apr 5, 2026

Difficulty:

If XYRnX \simeq Y \subseteq \R^n, note that Rn\R^n is metrizable because it’s a normed vector space, and being metrizable is hereditary, so YXY \simeq X is metrizable.

466

(Alexandrov ∧ R0R_0)     \implies Partition topology

Added:

Apr 5, 2026

Difficulty:

Denote xyx \sim y to mean xx and yy are indistinguishable. For each xx, let W(x)W(x) be its smallest nbd. Clearly xy    yW(x)x \sim y \implies y \in W(x) by definition, and for each y≁xy \not\sim x, there is a nbd VV of xx with yVy \notin V, so yW(x)y \notin W(x). Furthermore, this proves that \sim is an equivalence relation, since xy    W(x)=W(y)x \sim y \iff W(x) = W(y) and the sets [x]=W(x)[x]_{\sim} = W(x) form a partition of XX.

467

Partition topology     \implies Alexandrov

Added:

Apr 5, 2026

Difficulty:

If {Xi}iI\{X_i\}_{i \in I} is the partition for the topology of XX, then for each xXx \in X, the set XiX_i such that xXix \in X_i is the smallest nbd of xx.

468

(Partition topology ∧ Connected)     \implies Indiscrete

Added:

Apr 5, 2026

Difficulty:

Any set of the partition is a clopen set. So if XX is the only nonempty clopen set, the partition is {X}\{X\}.

469

Partition topology     \implies Ultraparacompact

Added:

Apr 5, 2026

Difficulty:

As the partition forms a basis for XX, it must refine any open cover, and each element of the partition is a clopen set.

471

(Has a group topology ∧ W-space)     \implies Embeds in a topological WW-group

Added:

Apr 5, 2026

Difficulty:

A space is a subspace of itself (and is homeomorphic to itself).

479

Embeds in a topological WW-group     \implies W-space

Added:

Apr 5, 2026

Difficulty:

Being a W-space is hereditary.

480

(Compact ∧ Connected ∧ T2T_2)     \implies Continuum

Added:

Mar 12, 2026

Difficulty:

By definition.

481

Continuum     \implies T2T_2

Added:

Mar 12, 2026

Difficulty:

By definition.

482

Continuum     \implies Compact

Added:

Mar 12, 2026

Difficulty:

By definition.

483

Continuum     \implies Connected

Added:

Mar 12, 2026

Difficulty:

By definition.

484

σ\sigma-connected     \implies Connected

Added:

Apr 5, 2026

Difficulty:

By one of the equivalent definitions.

489

Ordinal space     \implies LOTS

Added:

Mar 12, 2026

Difficulty:

It’s an order topology.

493

(Countable ∧ Discrete)     \implies Ordinal space

Added:

Mar 12, 2026

Difficulty:

It has a bijection f:Xnf: X \to n if finite, or f:Xωf : X \to \omega if infinite. It’s a homeomorphism either way.

499

(Locally countable ∧ Lindelöf)     \implies Countable

Added:

Mar 29, 2026

Difficulty:

We can cover the space with countable sets, and take a countable subcover.