π-base: Latest proofs

Latest proofs

484

σ\sigma-connected   ⟹  \implies Connected

Added:

Apr 5, 2026

Difficulty:

By one of the equivalent definitions.

479

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

Added:

Apr 5, 2026

Difficulty:

Being a W-space is hereditary.

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

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)

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.

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\}.

466

(Alexandrov ∧ R0R_0)   ⟹  \implies Partition topology

Added:

Apr 5, 2026

Difficulty:

Denote x∼yx \sim y to mean xx and yy are indistinguishable. For each xx, let W(x)W(x) be its smallest nbd. Clearly x∼y  ⟹  y∈W(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 y∉Vy \notin V, so y∉W(x)y \notin W(x). Furthermore, this proves that ∼\sim is an equivalence relation, since x∼y  ⟺  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}i∈I\{X_i\}_{i \in I} is the partition for the topology of XX, then for each x∈Xx \in X, the set XiX_i such that x∈Xix \in X_i is the smallest nbd of xx.

460

Embeddable into Euclidean space   ⟹  \implies Metrizable

Added:

Apr 5, 2026

Difficulty:

If X≃Y⊆RnX \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 Y≃XY \simeq X is metrizable.

459

Embeddable into Euclidean space   ⟹  \implies Second countable

Added:

Apr 5, 2026

Difficulty:

If f:X→Y⊆Rnf : X \to Y \subseteq \R^n is a homeomorphism, the balls of the form B(r,1/n)B(r, 1/n) for r∈Qr \in \Q and n∈Nn \in \N form a countable basis for Rn\R^n, so f−1(B(r,1/n))f^{-1}(B(r, 1/n)) forms a basis for XX.

457

Corson compact   ⟹  \implies Compact

Added:

Apr 5, 2026

Difficulty:

By definition.

452

Has a cut point   ⟹  \implies Connected

Added:

Apr 5, 2026

Difficulty:

By definition.

448

Indiscrete   ⟹  \implies Partition topology

Added:

Apr 5, 2026

Difficulty:

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

447

Fixed point property   ⟹  \implies T0T_0

Added:

Apr 5, 2026

Difficulty:

If p≠qp \ne q were to be topologically indistinguishable, let f(x)=pf(x) = p for all x≠px \ne p and f(p)=qf(p) = q. Then ff 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={x∈X : f(x)>x}A = \{ x \in X \ : \ f(x) > x \} is open. Given x∈Ax \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 x∈Ux \in U, f(x)∈Vf(x) \in V, and every element of VV is strictly greater than every element of UU. Let W=f−1(V)∩UW = f^{-1}(V) \cap U. Then y∈W  ⟹  f(y)>yy \in W \implies f(y) > y and so x∈W⊆Ax \in W \subseteq A. Through a similar proof, B={x∈X : f(x)<x}B = \{ x \in X \ : \ f(x) < x \} is open as well. Note that A∩B=∅A \cap B = \emptyset, y0∉Ay_0 \notin A, and x0∉Bx_0 \notin B. Because XX is connected, this means A∪B≠XA \cup B \ne X, and so there must be some p∉A∪Bp \notin A \cup B, so f(p)=pf(p) = p.

443

Fixed point property   ⟹  \implies Connected

Added:

Apr 4, 2026

Difficulty:

If XX is disconnected, let AA be a clopen set with p∈Ap \in A and q∉Aq \notin A. Then the function f:X→Xf : X \to X defined as f(x)=qf(x) = q at x∈Ax \in A and f(x)=pf(x) = p at x∉Ax \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 g≠1g \ne 1, then the map x↦gxx \mapsto gx is continuous yet has no fixed point.

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 Fn⊆U\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={U∖Kn : U∈Fn}\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 x∈Knx \in K_n. This immediately implies x∉Ux \notin U for any Rk\mathcal{R}_k with k>nk > n, and so xx intersects at most the nbds in ⋃k≤nRn\bigcup_{k \le n} \mathcal{R}_n, which is finite.

441

Hereditarily separable   ⟹  \implies Countably tight

Added:

Apr 4, 2026

Difficulty:

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

439

(Compact ∧ Countable)   ⟹  \implies Sequentially compact

Added:

Apr 4, 2026

Difficulty:

Initially, for each x∈Xx \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 yn∉Vy_n \notin V. This means there are infinitely many nn for which yn∉Vy_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) ynk∉Vy_{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 ⋃k≤nVk\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.

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.

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 Kn⊆int(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 Fn⊆U\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)∖Kn−1U_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={Un∩F : F∈Fn}\mathcal{R}_n = \{ U_n \cap F \ : \ F \in \mathcal{F}_n \}, we get that R=⋃n=1∞Rn\mathcal{R} = \bigcup_{n=1}^\infty \mathcal{R}_n is an open refinement, where for each xx, take the smallest nn for which x∈int(Kn)x \in \text{int}(K_n) so that x∈Unx \in U_n and so xx intersects at least one and at most all (finitely many) elements of Rn\mathcal{R}_n.

426

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

Added:

Apr 4, 2026

Difficulty:

Let pp be the dispersion point. Clearly if x≠yx \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 x≠px \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 f−1(p)f^{-1}(p) is closed, so let t=sup⁡f−1(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.

425

k2k_2-Hausdorff   ⟹  \implies US

Added:

Apr 4, 2026

Difficulty:

Suppose (xn)(x_n) is a sequence with xn→xx_n \to x and xn→yx_n \to y. ω+1\omega + 1 with the order topology is a compact space. Define f,g:ω+1→Xf,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.

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.

424

k1k_1-Hausdorff   ⟹  \implies KC

Added:

Apr 4, 2026

Difficulty:

Let K⊆XK \subseteq X compact and x∉Kx \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 V∩K=∅V \cap K = \emptyset. So KK is closed.

423

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

Added:

Apr 3, 2026

Difficulty:

Let x∈U⊆Kx \in U \subseteq K and y∈V⊆K′y \in V \subseteq K' with U,VU,V open, K,K′K,K' compact, and x≠yx \ne y. Then L=K∪K′L = K \cup K' is compact, so it is T2T_2. Thus, let x∈Wx \in W and y∈W′y \in W' be nbds such that W∩W′∩L=∅W \cap W' \cap L = \emptyset. Then (U∩W)∩(V∩W′)=∅(U \cap W) \cap (V \cap W') = \emptyset separates xx and yy by open sets in XX.

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

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 x≠yx \ne y, then d(p,x)+d(p,y)>0d(p, x) + d(p, y) > 0 for all p∈Xp \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.

406

(Pseudonormal ∧ Countable)   ⟹  \implies Normal

Added:

Apr 3, 2026

Difficulty:

If A,BA,B are closed and disjoint, just apply the theorem to A⊆U=BCA \subseteq U = B^C, since AA must be countable. Then A⊆V⊆V‾⊆UA \subseteq V \subseteq \cl{V} \subseteq U so that B⊆W=V‾CB \subseteq W = \cl{V}^C and V∩W=∅V \cap W = \emptyset.

403

(Regular ∧ P-space)   ⟹  \implies Pseudonormal

Added:

Apr 3, 2026

Difficulty:

Let H={xn}H = \{x_n\} and H⊆UH \subseteq U open. Then xn∉F=UCx_n \notin F = U^C for each nn, so by regularity, let x∈Vnx \in V_n and F⊆UnF \subseteq U_n with Vn∩Un=∅V_n \cap U_n = \emptyset. Then A⊆V=⋃n<ωVnA \subseteq V = \bigcup_{n < \omega} V_n and F⊆W=⋂n<ωUnF \subseteq W = \bigcap_{n < \omega} U_n with V∩W=∅V \cap W = \emptyset. But that implies V‾∩F=∅\cl{V} \cap F = \emptyset, so H⊆V⊆V‾⊆UH \subseteq V \subseteq \cl{V} \subseteq U.

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 H⊆UH \subseteq U is open, then H∩UC=∅H \cap U^C = \emptyset, so there are open sets H⊆VH \subseteq V and UC⊆V′U^C \subseteq V' with V∩V′=∅V \cap V' = \emptyset. In particular, V‾⊆U\cl{V} \subseteq U.

400

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

Added:

Apr 3, 2026

Difficulty:

Contrapositively, let f:X→Rf : 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=f−1(α)A_1 = f^{-1}(\alpha) and A2=f−1(β)A_2 = f^{-1}(\beta) are disjoint. They are zero sets, since A1=g−1(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 A1⊆B1A_1 \subseteq B_1 and A2⊆B2A_2 \subseteq B_2 with B1,B2B_1,B_2 disjoint clopen sets, by strongly zero-dimensional. In particular, x∈B1⊂Xx \in B_1 \subset X, so the space is not connected.

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

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.

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.

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.

402

(T1T_1 ∧ Pseudonormal)   ⟹  \implies Regular

Added:

Apr 3, 2026

Difficulty:

Let x∉Ax \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 x∈V⊆V‾⊆ACx \in V \subseteq \cl{V} \subseteq A^C. Then A⊆V‾C=WA \subseteq \cl{V}^C = W with V∩W=∅V \cap W = \emptyset.

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

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.

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.

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

350

Alexandrov   ⟹  \implies P-space

Added:

Apr 3, 2026

Difficulty:

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

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.

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.

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.

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.

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.

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