π-base: IDs 300-399

IDs 300-399

300

Cardinality <c\lt\mathfrak c   ⟹  \implies Strongly zero-dimensional

Added:

Mar 30, 2026

Difficulty:

Let A=f−1(0)A = f^{-1}(0) and B=g−1(0)B = g^{-1}(0) be disjoint cozero sets, where f,g:X→Rf,g : X \to \R are continuous. Then the function

h(x)=∣f(x)∣∣f(x)+g(x)∣h(x) = \frac{\abs{f(x)}}{\abs{f(x) + g(x)}}

is continuous, since the denominator would only be zero at xx if x∈A∩Bx \in A \cap B. hh maps XX to [0,1][0, 1]. Furthermore, A=h−1(0)A = h^{-1}(0) and B=h−1(1)B = h^{-1}(1). Note that {h−1(t)}0≤t≤1\{h^{-1}(t)\}_{0 \le t \le 1} is an uncountable family, yet XX is countable, so h−1(r)=∅h^{-1}(r) = \emptyset for some rr. Then h−1([0,r))h^{-1}([0, r)) and h−1((r,1])h^{-1}((r, 1]) are clopen disjoint sets of XX which separate AA and BB.

303

(Anticompact ∧ Compact)   ⟹  \implies Finite

Added:

Mar 12, 2026

Difficulty:

A space is a subspace of itself.

304

(Anticompact ∧ σ\sigma-compact)   ⟹  \implies Countable

Added:

Mar 30, 2026

Difficulty:

The space is a countable union of finite sets.

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 y≠xy \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, tnk→tt_{n_k} \to t for some subsequence and then ynk→f(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.

306

(Scattered ∧ ¬ Empty)   ⟹  \implies Has an isolated point

Added:

Mar 12, 2026

Difficulty:

If XX itself is not dense, then some point is isolated.

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 V⊆AV \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+1∉Ux_{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 (U∩V)∩F={y}(U \cap V) \cap F = \{y\}.

308

(R0R_0 ∧ Has an isolated point ∧ Has multiple points)   ⟹  \implies ¬ Connected

Added:

Mar 31, 2026

Difficulty:

Let pp be the isolated point with nbd VV so that V∩X={p}V \cap X = \{p\}. Every other point x≠px \ne p has a nbd not containing pp, so if UU is the union of all open sets not containing pp, we have U∩V=∅U \cap V = \emptyset and U∩V=XU \cap V = X.

310

T2T_2   ⟹  \implies Has closed retracts

Added:

Mar 31, 2026

Difficulty:

Let f:X→Af : X \to A be a continuous map with f∣A=idAf|_A = \text{id}_A. Define h:X→X2h : X \to X^2 as h(x)=(x,f(x))h(x) = (x, f(x)). If U×V⊆X2U \times V \subseteq X^2, then h(U∩f−1(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 h−1(Δ)={x∈X : f(x)=x}=Ah^{-1}(\Delta) = \{ x \in X \ : \ f(x) = x \} = A is closed.

311

Has closed retracts   ⟹  \implies T1T_1

Added:

Mar 31, 2026

Difficulty:

Every singleton is a retract: the constant function f:X→{p}f : X \to \{p\} is continuous.

312

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

Added:

Apr 2, 2026

Difficulty:

Let A⊆XA \subseteq X such that there is some continuous f:X→Af : X \to A with f∣A=idAf|_A = \text{id}_A. To prove AA is closed, we use the k1k_1-space property, and prove K∩AK \cap A is closed in KK for each compact K⊆XK \subseteq X. KK is closed, so f−1(K)f^{-1}(K) is closed, and so is K′=f−1(K)∩KK' = f^{-1}(K) \cap K. Then f(K′)=K∩Af(K') = K \cap A is compact, so it is closed.

313

Hyperconnected   ⟹  \implies Countable chain condition

Added:

Apr 2, 2026

Difficulty:

The only family of disjoint nonempty open sets is empty, which is countable.

314

Has an isolated point   ⟹  \implies ¬ Meager

Added:

Apr 2, 2026

Difficulty:

If pp is isolated, any set containing pp cannot be nowhere empty, since it contains the open set {p}\{p\}.

315

Empty   ⟹  \implies Meager

Added:

Mar 12, 2026

Difficulty:

X=⋃∅X = \bigcup \emptyset where ∅\emptyset is countable and each A∈∅A \in \emptyset is nowhere dense.

316

Alexandrov   ⟹  \implies Locally path connected

Added:

Apr 2, 2026

Difficulty:

Let WW be the smallest nbd of xx. Then WW must be path connected since it is indiscrete as a subspace topology, and so any function f:[0,1]→Wf : [0, 1] \to W must be continuous.

318

(Anticompact ∧ T1T_1)   ⟹  \implies k1k_1-Hausdorff

Added:

Apr 2, 2026

Difficulty:

In a T1T_1 space, finite sets are discrete, in particular, they are T2T_2.

319

(Countable ∧ ¬ Has an isolated point ∧ T1T_1)   ⟹  \implies Meager

Added:

Apr 2, 2026

Difficulty:

XX is a countable union of singletons. For each xx, {x}‾={x}\cl{\{x\}} = \{x\} because XX is T1T_1, and int({x})=∅\text{int}(\{x\}) = \emptyset because no point is isolated.

320

Ultraconnected   ⟹  \implies σ\sigma-connected

Added:

Apr 2, 2026

Difficulty:

The space cannot be a partition of more than one nonempty closed set.

321

kω,1k_{\omega,1}-space   ⟹  \implies Hemicompact

Added:

Apr 2, 2026

Difficulty:

By definition, let XX be a countable union of increasing compact sets {Kn}\{K_n\}. Now define the sequence of sets

Ln={x∈X : {x}‾∩Kn≠∅}L_n = \{ x \in X \ : \ \cl{\{x\}} \cap K_n \ne \emptyset \}

Clearly by construction, Kn⊆LnK_n \subseteq L_n for each nn, {Ln}\{L_n\} is increasing, and X=⋃n<ωLnX = \bigcup_{n < \omega} L_n. Now let U\mathcal{U} be an open cover of LnL_n. Since it also covers KnK_n, let {U1,…,Um}\{U_1, \dots, U_m\} be a countable subcover of KnK_n. For any x∈Lnx \in L_n, there is some y∈{x}‾∩Kny \in \cl{\{x\}} \cap K_n. Thus, y∈Ujy \in U_j for some 1≤j≤m1 \le j \le m, but that implies x∈Ujx \in U_j. So this is also a finite subcover of LnL_n, proving each LnL_n is compact.

By contraposition, suppose KK is not contained in any LnL_n. So choose xn∈X∖Lnx_n \in X \setminus L_n for each nn, so that {xn}‾∩Kn=∅\cl{\{x_n\}} \cap K_n = \emptyset. Then define Vn=X∖⋃k=n∞{xk}‾V_n = X \setminus \bigcup_{k=n}^\infty \cl{\{x_k\}}. We see that {xk}‾\cl{\{x_k\}} will only intersect KmK_m for k<mk < m, so that Vn∩Km=Km∖⋃k=nm−1{xk}‾V_n \cap K_m = K_m \setminus \bigcup_{k=n}^{m-1} \cl{\{x_k\}}, which is open in KmK_m. By the kω,1k_{\omega,1}-space property, {Vn}\{V_n\} is an open cover of KK: for any xx, x∈Knx \in K_n for some nn and so x∉{xn}‾  ⟹  x∈Vnx \notin \cl{\{x_n\}} \implies x \in V_n. Note that it is also increasing, which means if it had a finite subcover, we’d have K⊆VnK \subseteq V_n for some nn, which would imply xn∉Kx_n \notin K. So KK is not compact.

Source: M W on stack exchange, awesome trick

323

kω,1k_{\omega,1}-space   ⟹  \implies k1k_1-space

Added:

Apr 2, 2026

Difficulty:

If K∩AK \cap A is closed for every compact KK, in particular Kn∩AK_n \cap A is closed for each {Kn}\{K_n\} stipulated by the kω,1k_{\omega,1}-space property, proving AA is closed.

324

k3k_3-space   ⟹  \implies k2k_2-space

Added:

Apr 2, 2026

Difficulty:

Suppose that for every KK compact T2T_2 and f:K→Xf : K \to X continuous, that f−1(A)f^{-1}(A) is open. In particular, for each K⊆XK \subseteq X compact T2T_2, the inclusion ι:K→X\iota : K \to X is continuous, and so ι−1(A)=K∩A\iota^{-1}(A) = K \cap A is open. So AA is open.

325

k2k_2-space   ⟹  \implies k1k_1-space

Added:

Apr 2, 2026

Difficulty:

Suppose that for every KK compact and f:K→Xf : K \to X continuous, that f−1(A)f^{-1}(A) is open. In particular, for each KK compact and T2T_2, f−1(A)f^{-1}(A) is open. So AA is open.

326

Pseudometrizable   ⟹  \implies Locally pseudometrizable

Added:

Mar 12, 2026

Difficulty:

Globally implies locally.

327

Locally metrizable   ⟹  \implies Locally pseudometrizable

Added:

Mar 12, 2026

Difficulty:

Every metric is a pseudometric.

328

Locally metrizable   ⟹  \implies Locally Hausdorff

Added:

Apr 2, 2026

Difficulty:

A metric space is Hausdorff: For x≠yx \ne y, let r=d(x,y)/2r = d(x, y)/2 and then B(x,r)∩B(y,r)=∅B(x, r) \cap B(y, r) = \emptyset.

329

Locally Euclidean   ⟹  \implies Locally metrizable

Added:

Apr 2, 2026

Difficulty:

Rn\R^n is a normed space, so it is metrizable.

330

Locally pseudometrizable   ⟹  \implies R0R_0

Added:

Apr 2, 2026

Difficulty:

Let x≠yx \ne y and VV a pseudometrizable nbd of xx. If y∉Vy \notin V, we’re done. Otherwise, if they are indistinguishable, we have r=d(x,y)>0r = d(x, y) > 0 and then y∉B(x,r)y \notin B(x, r).

331

(Locally pseudometrizable ∧ T0T_0)   ⟹  \implies Locally metrizable

Added:

Apr 2, 2026

Difficulty:

This is just “(Pseudometrizable ∧ T0T_0)   ⟹  \implies Metrizable” (T265) but for local nbds.

332

Locally Euclidean   ⟹  \implies Locally compact

Added:

Apr 2, 2026

Difficulty:

Let VV be a nbd such that V≃W⊆RnV \simeq W \subseteq \R^n. If Rn\R^n is locally compact, W≃VW \simeq V is as well. But that holds since the balls B(x,δ)B(x, \delta) form a basis and B(x,δ)‾\cl{B(x, \delta)} is compact in finite-dimensional metric spaces.

333

Topological nn-manifold   ⟹  \implies T2T_2

Added:

Mar 12, 2026

Difficulty:

By definition.

334

(Has a countable network ∧ T0T_0)   ⟹  \implies Cardinality ≤c\leq\mathfrak c

Added:

Apr 2, 2026

Difficulty:

Let N\mathcal{N} be a countable network. For each x∈Xx \in X, define f(x)={N∈N : x∈N}f(x) = \{ N \in \mathcal{N} \ : \ x \in N \}. If x≠yx \ne y, by T0T_0 and without loss of generality, assume x∈Ux \in U and y∉Uy \notin U for some open UU. Since UU is a union of network elements, there is some NN with x∈Nx \in N yet y∉Ny \notin N. Then f:X→P(N)f : X \to \mathcal{P}(\mathcal{N}) is injective, and so card(X)≤card(P(N))=2ℵ0=c\card{X} \le \card{\mathcal{P}(\mathcal{N})} = 2^{\aleph_0} = \mathfrak{c}.

335

T4T_4   ⟹  \implies Normal

Added:

Mar 12, 2026

Difficulty:

By definition.

336

T5T_5   ⟹  \implies Completely normal

Added:

Mar 12, 2026

Difficulty:

By definition.

337

Fully T4T_4   ⟹  \implies Fully normal

Added:

Mar 12, 2026

Difficulty:

By definition.

338

T6T_6   ⟹  \implies Perfectly normal

Added:

Mar 12, 2026

Difficulty:

By definition.

339

Spectral   ⟹  \implies Compact

Added:

Mar 25, 2026

Difficulty:

By definition.

340

Topological nn-manifold   ⟹  \implies Second countable

Added:

Mar 12, 2026

Difficulty:

By definition.

342

Ultraparacompact   ⟹  \implies Strongly paracompact

Added:

Apr 2, 2026

Difficulty:

If an open refinement is a partition, its elements are pairwise-disjoint, so trivially star-finite.

343

Strongly paracompact   ⟹  \implies Paracompact

Added:

Apr 2, 2026

Difficulty:

Take a star-finite open cover. xx is in some element UU, which is open. So for any nbd VV of xx, U∩VU \cap V is a nbd which intersects finitely many elements. So it is locally finite.

344

(Lindelöf ∧ Zero dimensional)   ⟹  \implies Ultraparacompact

Added:

Apr 2, 2026

Difficulty:

Let B\mathcal{B} be a basis of clopen sets and let U\mathcal{U} be an open cover. For each U∈UU \in \mathcal{U}, define BU={B∈B : B⊆U}\mathcal{B}_U = \{ B \in \mathcal{B} \ : \ B \subseteq U \}. Then V=⋃U∈UBU\mathcal{V} = \bigcup_{U \in \mathcal{U}} \mathcal{B}_U is an open refinement of clopen sets. By Lindelöf, let {Bn}\{B_n\} be a countable subrefinement of V\mathcal{V}. If Bn∗=Bn∖⋃k<nBkB^*_n = B_n \setminus \bigcup_{k < n} B_k, then {Bn∗}\{B^*_n\} are all clopen and pairwise disjoint, so it is a clopen refinement which partitions XX.

346

Has a group topology   ⟹  \implies ¬ Empty

Added:

Mar 12, 2026

Difficulty:

Groups/monoids are nonempty by definition.

347

Has a group topology   ⟹  \implies Homogeneous

Added:

Apr 2, 2026

Difficulty:

The map ϕ(x)=(ba−1)x\phi(x) = (ba^{-1})x satisfies ϕ(a)=b\phi(a) = b, is bijective, continuous, and ϕ−1(x)=(ab−1)x\phi^{-1}(x) = (ab^{-1})x is also continuous.

349

Indiscrete   ⟹  \implies Homogeneous

Added:

Apr 3, 2026

Difficulty:

Any bijective function is a homeomorphism. Just take Φ\Phi as the permutation that swaps aa and bb.

350

Alexandrov   ⟹  \implies P-space

Added:

Apr 3, 2026

Difficulty:

Any intersection of open sets is open, including countable ones.

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 x∈B⊆Vx \in B \subseteq V. Define U0=VU_0 = V. By regularity, there some x∈U1x \in U_1 and U0C⊆U1∗U_0^C \subseteq U_1^* such that U1∩U1∗=∅U_1 \cap U_1^* = \emptyset. Inductively, given x∈Unx \in U_n, there exists x∈Un+1x \in U_{n+1} and UnC⊆Un+1∗U_n^C \subseteq U_{n+1}^* with Un+1∩Un+1∗=∅U_{n+1} \cap U_{n+1}^* = \emptyset. Thus, we construct a decreasing sequence (Un)(U_n) such that x∈B≔⋂n<ωUnx \in B \coloneqq \bigcap_{n < \omega} U_n and Un+1‾⊆Un\cl{U_{n+1}} \subseteq U_n for all nn. BB is open by P-space, and closed because B=⋂n<ωUn‾B = \bigcap_{n < \omega} \cl{U_n}.

352

Has a countable kk-network   ⟹  \implies Has a σ\sigma-locally finite kk-network

Added:

Mar 14, 2026

Difficulty:

Any countable family is a countable union of finite sets. Finite sets are clearly locally finite. So any countable family is σ\sigma-locally finite.

360

ω\omega-Lindelöf   ⟹  \implies Lindelöf

Added:

Apr 3, 2026

Difficulty:

Let U\mathcal{U} be an open cover. Let F\mathcal{F} be the collection of finite subsets of U\mathcal{U} and define a function v(F)=⋃Fv(F) = \bigcup F on F\mathcal{F}. Then {v(F)}F∈F\{v(F)\}_{F \in \mathcal{F}} is an ω\omega-cover, since U\mathcal{U} is a cover of any finite (compact) set KK, which has a finite subcover, meaning K⊆⋃FK \subseteq \bigcup F for some finite F⊆UF \subseteq \mathcal{U}. Let A⊆F\mathcal{A} \subseteq \mathcal{F} be countable so that {v(F)}F∈A\{v(F)\}_{F \in \mathcal{A}} is a countable ω\omega-subcover. Then ⋃A⊆U\bigcup \mathcal{A} \subseteq \mathcal{U} is a countable subcover.

376

(Has a σ\sigma-locally finite network ∧ Lindelöf)   ⟹  \implies Has a countable network

Added:

Apr 3, 2026

Difficulty:

A locally-finite collection in a Lindelöf space is countable, seen in the proof of (T387), and so the network is a countable union of countable networks, hence, countable.

387

(Has a σ\sigma-locally finite kk-network ∧ Lindelöf)   ⟹  \implies Has a countable kk-network

Added:

Apr 3, 2026

Difficulty:

A locally-finite collection in a Lindelöf space is countable: If A\mathcal{A} is locally finite, the sets U\mathcal{U} which intersect finitely many elements of A\mathcal{A} is an open cover, so if U∗\mathcal{U}^* is a countable subcover, then every element of A\mathcal{A} intersects some U∈U∗U \in \mathcal{U}^*, yet only finitely many intersect each UU, so A\mathcal{A} is countable.

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=⋂n≤mVnmU_m = \bigcap_{n \le m} V_{nm}. Clearly Fm=⋂n≤mFn⊆⋂n≤mVnm=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 x∉Fnx \notin F_n, which means there is some kk with x∉Vnkx \notin V_{nk}. But then x∉Vnk′x \notin V_{nk'} for all k′≥kk' \ge k, so just take k′≥max⁡{k,n}k' \ge \max \{k, n\} and x∉Uk′⊆Vnk′x \notin U_{k'} \subseteq V_{nk'}. So ⋂Um=∅\bigcap U_m = \emptyset.

389

(Countably metacompact ∧ Normal)   ⟹  \implies Countably paracompact

Added:

Apr 5, 2026

Difficulty:

We first prove that for every decreasing sequence {Fn}\{F_n\} of closed sets with ⋂n<ωFn=∅\bigcap_{n < \omega} F_n = \emptyset, there exists a sequence {An}\{A_n\} of closed GδG_\delta-sets such that ⋂n<ωAn=∅\bigcap_{n < \omega} A_n = \emptyset and Fn⊆AnF_n \subseteq A_n for all nn. Let {Fn}\{F_n\} be such a sequence. Using Ishikawa’s characterization, there exists a sequence of open sets {Un}\{U_n\} with Fn⊆UnF_n \subseteq U_n and ⋂n<ωUn=∅\bigcap_{n < \omega} U_n = \emptyset. That means Fn∩Fn′=∅F_n \cap F'_n = \emptyset where Fn′=UnCF'_n = U_n^C. By Urysohn’s lemma, let fn:X→[0,1]f_n : X \to [0, 1] with f(Fn)⊆{0}f(F_n) \subseteq \{0\} and f(Fn′)⊆{1}f(F'_n) \subseteq \{1\}. Then define Vnk=fn−1([0,1/k))V_{nk} = f_n^{-1}([0, 1/k)), which proves An=⋂k=1∞Vnk=f−1(0)A_n = \bigcap_{k=1}^\infty V_{nk} = f^{-1}(0) is a closed GδG_\delta-set with Fn⊆AnF_n \subseteq A_n. Now to show {An}\{A_n\} has empty intersection, we just have to show An⊆UnA_n \subseteq U_n for each nn. But x∉Un  ⟹  f(x)=1  ⟹  f(x)≠0  ⟹  x∉Anx \notin U_n \implies f(x) = 1 \implies f(x) \ne 0 \implies x \notin A_n.

Now let {Un}\{U_n\} be a countable open cover. Define Fn=X∖⋃k≤nUnF_n = X \setminus \bigcup_{k \le n} U_n. Then {Fn}\{F_n\} is decreasing and must have empty intersection. Let {An}\{A_n\} be the closed GδG_\delta-sets with empty intersection such that Fn⊆AnF_n \subseteq A_n. Then each Bn=X∖AnB_n = X \setminus A_n is an FσF_\sigma-set, so we write Bn=⋃k<ωFnk′B_n = \bigcup_{k < \omega} F'_{nk}. Note that by the way we constructed the VnkV_{nk} above, we could ensure that Vnk⊇Vn(k+1)‾V_{nk} \supseteq \cl{V_{n(k+1)}}. So here, we can assume {Fnk′}k<ω\{F'_{nk}\}_{k < \omega} is increasing with Fnk′⊆int(Fn(k+1)′)F'_{nk} \subseteq \text{int}(F'_{n(k+1)}). Define Hnk=int(Fnk′)H_{nk} = \text{int}(F'_{nk}). Then Bn=⋃k<ωHnkB_n = \bigcup_{k < \omega} H_{nk} and Fnk′⊆Bn⊆⋃k≤nUnF'_{nk} \subseteq B_n \subseteq \bigcup_{k \le n} U_n.

If we define Vn=Un∖⋃k<nFnk′V_n = U_n \setminus \bigcup_{k < n} F'_{nk}, each VnV_n is open. For each xx, let nn be the first index with x∈Unx \in U_n and so x∉⋃k<nUk  ⟹  x∉Fnk′x \notin \bigcup_{k < n} U_k \implies x \notin F'_{nk} for each k<nk < n, so that x∈Vnx \in V_n, proving {Vn}\{V_n\} is an open refinement of {Un}\{U_n\}. Finally, since ⋂n<ωAn=∅\bigcap_{n < \omega} A_n = \emptyset, there must be some nn with x∉Anx \notin A_n, meaning x∈Fn(k−1)′⊆Hnkx \in F'_{n(k-1)} \subseteq H_{nk} for some kk. Then for i>max⁡{n,k}i > \max \{n, k\}, Hnk⊆Fni′H_{nk} \subseteq F'_{ni} so that Hnk∩Vi=∅H_{nk} \cap V_i = \emptyset. So HnkH_{nk} is a nbd of xx which intersects at most VnV_n with n<in < i, proving it is locally finite.

Source: C. H. Dowker, On Countably Paracompact Spaces, Theorem 2 (d) ⇒ (a)

390

Cardinality ≤c\leq\mathfrak c   ⟹  \implies Cardinality ≤2c\leq 2^{\mathfrak c}

Added:

Mar 12, 2026

Difficulty:

κ<2κ\kappa < 2^\kappa is true for any cardinal.

391

(¬ Cardinality <c\lt\mathfrak c ∧ ¬ Cardinality =c=\mathfrak c)   ⟹  \implies ¬ Cardinality ≤c\leq\mathfrak c

Added:

Apr 3, 2026

Difficulty:

≤\leq means <\lt or ==.

395

(P-space ∧ Lindelöf ∧ T2T_2)   ⟹  \implies Normal

Added:

Apr 3, 2026

Difficulty:

Start by showing regularity. Let x∉Ax \notin A and AA closed. Construct the pairs (U,V)(U, V) of nbds such that x∈Ux \in U and y∈Vy \in V for some y∈Ay \in A with U∩V=∅U \cap V = \emptyset. Then the sets VV form an open cover of AA. Closed sets are Lindelöf, so take {(Un,Vn)}\{(U_n, V_n)\} a countable subcollection with {Vn}\{V_n\} still covering AA. Then x∈U≔⋂n<ωUnx \in U \coloneqq \bigcap_{n < \omega} U_n is open in a P-space, and A⊆V≔⋃n<ωVnA \subseteq V \coloneqq \bigcup_{n < \omega} V_n, with U∩V=∅U \cap V = \emptyset.

Now let A,BA,B be closed and disjoint. Construct the pairs (U,V)(U, V) of nds such that A⊆UA \subseteq U and x∈Vx \in V for some x∈Bx \in B with U∩V=∅U \cap V = \emptyset. Similarly, we take {(Un,Vn)}\{(U_n, V_n)\} such that B⊆V≔⋃n<ωVnB \subseteq V \coloneqq \bigcup_{n < \omega} V_n and A⊆U≔⋂n<ωUnA \subseteq U \coloneqq \bigcap_{n < \omega} U_n, which is open in a P-space, and U∩V=∅U \cap V = \emptyset.

396

(P-space ∧ Functionally Hausdorff)   ⟹  \implies Totally separated

Added:

Apr 3, 2026

Difficulty:

Given x≠yx \ne y, let f:X→[0,1]f : X \to [0, 1] such that f(x)=0f(x) = 0 and f(y)=1f(y) = 1. Then Vn=f−1([0,1/n))V_n = f^{-1}([0, 1/n)) are all open. Then x∈B=⋂n=1∞Vnx \in B = \bigcap_{n=1}^\infty V_n is open in a P-space, and BB is closed, since B=f−1(⋂n=1∞[0,1/n))=f−1(0)B = f^{-1}\left( \bigcap_{n=1}^\infty [0, 1/n) \right) = f^{-1}(0).

397

(Countable sets are discrete ∧ Countably compact)   ⟹  \implies Finite

Added:

Mar 17, 2026

Difficulty:

Countably compact implies every sequence has an accumulation point, which would contradict being discrete.

398

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

Added:

Apr 3, 2026

Difficulty:

We first show that if AA is countable and x∉Ax \notin A, then x∉A‾x \notin \cl{A}. Just enumerate A={xn}A = \{x_n\} and let UnU_n be a nbd of xx with xn∉Unx_n \notin U_n. Then V=⋂UnV = \bigcap U_n is a nbd of xx (using P-space) and V∩A=∅V \cap A = \emptyset. This proves every countable set is closed and discrete, since for any x∈Ax \in A, B=A∖{x}B = A \setminus \{x\} is countable with x∉Bx \notin B, so there must be a nbd VV of xx with V∩B=∅  ⟹  V∩A={x}V \cap B = \emptyset \implies V \cap A = \{x\}.

The space is zero-dimensional (T351). Contrapositively, if A={xn}n=1∞A = \{x_n\}_{n=1}^\infty were to be a countably infinite set, being discrete, let UnU_n be a nbd of xnx_n with A∩Un={xn}A \cap U_n = \{x_n\}, then choose x∈Bn⊆Unx \in B_n \subseteq U_n where BnB_n is clopen. Being a P-space, note that B~n≔Bn∖⋃m≠nBm\tilde{B}_n \coloneqq B_n \setminus \bigcup_{m \ne n} B_m is also clopen with xn∈B~nx_n \in \tilde{B}_n, and {B~n}n=1∞\{\tilde{B}_n\}_{n=1}^\infty are pairwise-disjoint. B~0≔X∖⋃n<ω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 x∈B~nx \in \tilde{B}_n. This function must be continuous, so the space is not pseudocompact.