π-base: IDs 200-299
IDs 200-299
200
Polish Completely metrizable
Added:
Mar 26, 2026
Difficulty:
By definition.
201
(Separable ∧ Completely metrizable) Polish
Added:
Mar 26, 2026
Difficulty:
By definition.
204
Discrete Homogeneous
Added:
Mar 13, 2026
Difficulty:
Any bijective function is a homeomorphism in discrete space. Just take the permutation that swaps and .
205
Radial Pseudoradial
Added:
Mar 13, 2026
Difficulty:
Essentially the same proof as Fréchet Urysohn Sequential (T184). Just swap “sequential closure” with “radial closure”.
206
Fréchet Urysohn Radial
Added:
Mar 13, 2026
Difficulty:
Fréchet Urysohn is stronger because it asserts there is a sequence, a.k.a a transfinite sequence of length .
207
Sequential Pseudoradial
Added:
Mar 13, 2026
Difficulty:
Any radially closed set must be, in particular, sequentially closed.
208
(Indiscrete ∧ Has multiple points) ¬ Has an isolated point
Added:
Mar 12, 2026
Difficulty:
Any open set has more than one point.
209
(Has an isolated point ∧ Homogeneous) Discrete
Added:
Mar 26, 2026
Difficulty:
Let be isolated and with a homeomorphism. Then is isolated. Do this for every .
210
(Locally countable ∧ Pseudoradial) Sequential
Added:
Mar 13, 2026
Difficulty:
Suppose a set is sequentially closed. Let and . Take a countable nbd of . If , then there is an ordinal for which for all . The set of ordinals is isomorphic to some . So we have , still with .
From a converging transfinite sequence within a countable set, we can extract a -sequence that still converges to the same value, this was done in (T211). So we construct a sequence with , and so as we wished to prove.
211
(Countably tight ∧ Radial) Fréchet Urysohn
Added:
Mar 13, 2026
Difficulty:
Given , choose countable with . Suppose is some transfinite sequence in with . We now construct a sequence in which converges to and we’re done (thanks to PatrickR).
If some is cofinal in , this means any neighborhood of must contain , so we can construct a constant sequence with . If no is cofinal, then each is finite and is a countable union of finite sets, so it is a countable ordinal. We can assume to be a regular cardinal, so it is already a sequence.
212
(Countable ∧ First countable) Second countable
Added:
Mar 13, 2026
Difficulty:
If each local basis is countable and is countable, then is a countable basis.
213
Collectionwise normal Normal
Added:
Mar 26, 2026
Difficulty:
If and are disjoint closed sets, then and so is a discrete family.
216
GO-space Radial
Added:
Mar 26, 2026
Difficulty:
Let be an order convex nbd of . If and , then we could assume either has no maximum or has no minimum. Otherwise, then we could take and then would be a nbd of and so (it would then suffice to take the constant sequence ). Without loss of generality, say is infinite.
Using the axiom of choice, specifically Zorn’s lemma, we can take the collection of all well-ordered subsets of , and any maximal element must be cofinal in . Since this set is well-ordered, there is an isomorphism from some ordinal and is a sequence with by cofinality.
218
Discrete Locally finite
Added:
Mar 12, 2026
Difficulty:
is a finite neighborhood of .
221
Countable sets are discrete
Added:
Mar 12, 2026
Difficulty:
For , is discrete, so some nbd of does not contain and vice-versa.
222
Countable sets are discrete Anticompact
Added:
Mar 26, 2026
Difficulty:
If is infinite, let be a countable subset. But then is discrete and sets of the form form a cover for with no finite subcover, so can’t be compact.
223
(Countably compact ∧ Sequential) Sequentially compact
Added:
Mar 20, 2026
Difficulty:
Let be a sequence. By contradiction, suppose it has no converging subsequence and for each , define . We first prove each is closed. As the space is sequential, it suffices to take a sequence in with and prove . Let for each . If some $Y(m) is infinite, we could construct a subsequence in such that , and so . Otherwise, each is finite and infinitely many are nonempty. So let be the least for which and . Inductively, let be the least such that and . Now we’ve chosen subsequences and such that . For any nbd of , there exists some such that for . But then is a nbd of , so for all . As this holds for all , that would imply , a contradiction!
So each is closed, and as the space is countably compact, let be an accumulation point of . Then clearly is a limit point of for all . Now consider the sets . If for some , that would imply , which is impossible since and is closed. So let and . We’ve contructed a sequence such that for all . Then for any nbd of , and that would imply .
224
(Weakly locally compact ∧ Regular) Locally relatively compact
Added:
Mar 27, 2026
Difficulty:
Take with open and compact. Let and be a separation of and the closed set . In particular, . The sets of the form where is open forms a local basis for and each closure is compact.
226
US
Added:
Mar 21, 2026
Difficulty:
Contrapositively, suppose there is no nbd of which doesn’t contain as well. Then for the constant sequence , and .
227
KC Weak Hausdorff
Added:
Mar 27, 2026
Difficulty:
If continuous and compact, is compact, so it is closed by KC.
228
-Hausdorff
Added:
Mar 27, 2026
Difficulty:
implies is closed. So is trivially closed in for any .
230
(First countable ∧ US)
Added:
Mar 21, 2026
Difficulty:
Let and be countable local bases of . Contrapositively, suppose for all , and choose . Then and .
231
Embeddable in Embeddable into Euclidean space
Added:
Mar 21, 2026
Difficulty:
is homeomorphic to .
232
(Totally path disconnected ∧ Embeddable in ) Zero dimensional
Added:
Mar 28, 2026
Difficulty:
If , for each , we shall assume is not minimum or maximum element of , so that it has a local basis of sets of the form for (otherwise the proof is similar but the intervals are either or ). Then there must be some with , otherwise would be a path connected subset1. Similarly, there must be some so that is a clopen nbd of in . So the clopen nbds of form a basis.
(1): This is the one time in the proof where we use the fact that we’re in , because connected path connected in . Otherwise, we could construct a very similar proof for (Totally disconnected ∧ GO-space) Zero dimensional
233
(Connected ∧ Embeddable in ) Locally path connected
Added:
Mar 28, 2026
Difficulty:
Not sure why they expected locally here. If is a homeomorphism and connected, then is connected. Every connected set in is path connected, so is path connected.
234
Strongly KC KC
Added:
Mar 12, 2026
Difficulty:
Compact sets are countably compact.
235
(Sequential ∧ US) Strongly KC
Added:
Mar 27, 2026
Difficulty:
Suppose is countably compact yet not closed. is sequential, so there is a sequence in and with . Then has some accumulation point . There cannot be infinitely many for which , otherwise we could extract a subsequence with , and by US, that would imply . Therefore, by taking a subsequence if necessary, we can assume for all . But then yet . So isn’t closed, which would imply there is some sequence in with and . Just as before, there can only be finitely many with or for any . So we could extract a subsequence such that is also a subsequence of and so , a contradiction.
236
(GO-space ∧ Countably tight) First countable
Added:
Mar 28, 2026
Difficulty:
Fix . If is isolated, is a local basis. Otherwise, and there is a countable with . So consider the intervals of the form , , or for which are open in . This must be countable and it is a local basis of since and it isn’t isolated in .
237
Hemicompact -compact
Added:
Mar 28, 2026
Difficulty:
By definition: -compact countable union of compacts . Hemicompact countable union of compacts such that any compact set lies inside some .
238
Countable Locally countable
Added:
Mar 12, 2026
Difficulty:
Globally implies locally.
241
-space Cosmic
Added:
Mar 28, 2026
Difficulty:
This is just “Has a countable -network Has a countable network” (T11) with added.
242
Cosmic -space
Added:
Mar 28, 2026
Difficulty:
This is just “Has a countable network Has a -locally finite network” (T29) with added.
243
-space -space
Added:
Mar 12, 2026
Difficulty:
This is just “Has a countable -network Has a -locally finite -network” (T352) with added.
244
-space -space
Added:
Mar 28, 2026
Difficulty:
This is just “Has a -locally finite -network Has a -locally finite network” (T34) with added.
245
Locally compact Weakly locally compact
Added:
Mar 28, 2026
Difficulty:
Just take one element from the local basis.
246
(Weakly locally compact ∧ Regular) Locally compact
Added:
Mar 28, 2026
Difficulty:
The proof is literally the same as (T224). I’d like to express my discontent with -base’s usage of the term “local basis”. To me, a local basis is by definition a collection of open sets, but what they mean by “locally compact” is: Each has a collection of compact sets whose interiors form a local basis for .
247
(Discrete ∧ Indiscrete) ¬ Has multiple points
Added:
Mar 12, 2026
Difficulty:
if and only if it has 0 or 1 point.
248
¬ Has multiple points Discrete
Added:
Mar 12, 2026
Difficulty:
There’s only one possible topology.
249
¬ Has multiple points Indiscrete
Added:
Mar 12, 2026
Difficulty:
There’s only one possible topology.
250
¬ Finite Has multiple points
Added:
Mar 12, 2026
Difficulty:
If you have an infinite amount of apples, then you have at least 2 apples.
251
Indiscrete Compact
Added:
Mar 28, 2026
Difficulty:
Any open cover must contain as an element.
252
Partition topology Pseudometrizable
Added:
Mar 13, 2026
Difficulty:
Define if belong to the same set in the partition, and 0 otherwise. This is a pseudometric.
253
(Has multiple points ∧ ) ¬ Indiscrete
Added:
Mar 12, 2026
Difficulty:
Some point has a neighborhood not containing another point.
254
Hereditarily Lindelöf Lindelöf
Added:
Mar 12, 2026
Difficulty:
A space is a subspace of itself.
255
(Lindelöf ∧ space) Hereditarily Lindelöf
Added:
Mar 28, 2026
Difficulty:
It suffices to prove any set is Lindelöf, as that implies every open set is Lindelöf in a space. This follows from two basic topological facts: (1) Closed sets of Lindelöf spaces are Lindelöf: If is closed and is a cover of , then is a cover of with a countable subcover, which induces a countable subcover of (2) A countable union of Lindelöf spaces is Lindelöf: If is a cover of , then it is a cover of each , which gives us a countable subcover of , and so is a countable subcover of .
256
Perfectly normal space
Added:
Mar 28, 2026
Difficulty:
Let be closed. Then there is a continuous map with . Thus, each is open and is a set.
257
(Normal ∧ space) Perfectly normal
Added:
Mar 28, 2026
Difficulty:
We prove any closed set is a zero set. Let be a set. Without loss of generality, assume is decreasing. Define , and by normality, let a function where and . We define as
It already has the property as we wished, since iff for all and implies for some and . To prove continuity, we use the Weierstrass M-test. Each and converges, so converges absolutely and uniformly. As each finite sum is continuous, their uniform limit is continuous.
258
(Regular ∧ Hereditarily Lindelöf) Perfectly normal
Added:
Mar 29, 2026
Difficulty:
We shall show is normal and (T257). The former is a result of (Regular ∧ Lindelöf) Normal, and the proof of this fact can be seen in the second-half of (T26). There, we merely use the fact that the space is regular and closed sets are Lindelöf, which is clearly true in a Lindelöf space.
Now let be closed. By regularity, for each there is a pair and of open sets with . By joining all such pairs into a collection , we see that is a cover of . By hereditarily Lindelöf, there is a countable subcollection in which, for any , there is some for which . Conversely, implies for all . So is a set.
259
Countable Has a countable network
Added:
Mar 12, 2026
Difficulty:
Singletons form a network.
260
Has a countable network Hereditarily Lindelöf
Added:
Mar 29, 2026
Difficulty:
Let be the countable network. Let and be an open cover of . We know for any there is a such that . Let be the set of such that for some , and for each , choose one such . Then is a countable subcover.
261
(Countable ∧ ) space
Added:
Mar 29, 2026
Difficulty:
In spaces, points are indistinguishable iff . Thus, if and is open, . So is an set, as is countable.
262
( ∧ Hyperconnected) Indiscrete
Added:
Mar 28, 2026
Difficulty:
If no nonempty disjoint open sets exist, implies all points are indistinguishable.
263
(Hereditarily Lindelöf ∧ Scattered) Countable
Added:
Mar 29, 2026
Difficulty:
Let be the set of points which have a countable nbd. Then is locally countable and Lindelöf, so it is countable (T499). This must imply is empty, as otherwise it would need to have an isolated point which has no countable nbd, so and would imply is uncountable (thanks to Almanzoris, I had proved it on my own but it was far more complicated than this nice argument).
264
Metrizable Pseudometrizable
Added:
Mar 12, 2026
Difficulty:
Every metric is a pseudometric.
265
(Pseudometrizable ∧ ) Metrizable
Added:
Mar 13, 2026
Difficulty:
By contraposition, if , then they both have the same neighborhoods.
266
Finite Locally finite
Added:
Mar 12, 2026
Difficulty:
Globally implies locally.
267
(Alexandrov ∧ ) Discrete
Added:
Mar 29, 2026
Difficulty:
Let be all nbds of . Then is an open set. For any , there is some nbd of with , so .
268
Pseudometrizable Perfectly normal
Added:
Mar 29, 2026
Difficulty:
We prove it is normal and (T257). For the latter, let be any closed set, and define . Let . For each there is an such that and therefore, . Since is closed, . This proves is .
To prove normality, we use the fact that for a closed set , . For any disjoint closed sets and , define for each and for each . Define and . It’s clear and . If , then and for some and . But then is a contradiction.
270
Second countable First countable
Added:
Mar 12, 2026
Difficulty:
A countable basis is a local basis for every point.
271
Second countable Has a countable -network
Added:
Mar 29, 2026
Difficulty:
Any network of open sets is a -network. If for some compact, we can take a finite subcollection of . Any basis is a network. Therefore, a countable basis is a countable -network.
272
Second countable -Lindelöf
Added:
Mar 29, 2026
Difficulty:
Let be a -cover and a countable basis. For any compact , for some , which can be written as a union of basis elements . This is an open cover of , so we can extract a finite subcover. This allows to conclude that if for each finite selection of basis elements, we select one element which contains their union, then this must be a -subcover, and the collection of all finite selections of basis elements is countable.
274
Discrete LOTS
Added:
Mar 29, 2026
Difficulty:
We use the axiom of choice (specifically the well-ordering principle) to denote a bijection where is some initial ordinal. If , the order topology on is discrete, so induces an order in which is discrete. If is infinite, then there is a bijection (the well-ordering of allows us to construct a bijection from to and then apply Schröder–Bernstein). The dictionary order on is discrete since the element is between and , so the bijection yields a discrete order in .
275
(LOTS ∧ Connected ∧ Separable) Second countable
Added:
Mar 29, 2026
Difficulty:
Let be countable and dense. Let be the finite intersections of open rays of the form or for . For any , assume it is not a minimum or maximum of and suppose . The proof is similar for those cases by taking or . Then , as otherwise would be disconnected. Furthermore, there must be some in this interval, otherwise some with would imply . Similarly, let and so . Since , this is a countable basis.
276
Hereditarily Lindelöf Has countable spread
Added:
Mar 29, 2026
Difficulty:
If is discrete, it can be covered by nbds which contain one element each. So if were to be Lindelöf, it has to have countably many elements.
279
(Hemicompact ∧ First countable) Weakly locally compact
Added:
Mar 30, 2026
Difficulty:
Let be the compact sets of which every compact for some , and define , which has the same property. Let be a local basis for some and is also a countable local basis. We wish to prove for some . By contradiction, assume there is no such . That means we can extract a sequence . Then and so is compact. But then for some , which contradicts .
281
Added:
Mar 12, 2026
Difficulty:
is with .
282
Regular
Added:
Mar 30, 2026
Difficulty:
and are indistinguishable iff either or . Suppose the former. Then regularity gives us and with , which is clearly a separation of and .
283
( ∧ )
Added:
Mar 12, 2026
Difficulty:
Any two distinct points are distinguishable in a space.
284
Alexandrov Locally compact
Added:
Mar 30, 2026
Difficulty:
If is the collection of all nbds of , is the smallest nbd of , so is a compact local basis of : for any open cover of , there must be some with , and then is a subcover.
285
Alexandrov First countable
Added:
Mar 30, 2026
Difficulty:
If is the collection of all nbds of , is the smallest nbd of , so is a local basis of .
286
Added:
Mar 13, 2026
Difficulty:
Immediate by definition.
287
Added:
Mar 13, 2026
Difficulty:
By definition, is and .
288
( ∧ )
Added:
Mar 13, 2026
Difficulty:
ensures any two points are distinguishable. This is an if and only if.
289
space
Added:
Mar 30, 2026
Difficulty:
To prove , it suffices to prove . Note that is a set, so there exists some such that , yet . That proves .
290
Finite Baire
Added:
Mar 30, 2026
Difficulty:
A countable union of subsets in a finite space can be assumed to be a finite union by removing duplicates. Now we just use the fact that for finitely many closed sets , that . That is, a finite union of nowhere dense sets is nowhere dense.
291
(Anticompact ∧ Countable) Hemicompact
Added:
Mar 30, 2026
Difficulty:
If is countable, define . Then and every compact/finite set is contained in some .
292
(Anticompact ∧ -space) Locally finite
Added:
Mar 30, 2026
Difficulty:
We first show the space is Alexandrov. Note that if is any family of open sets, and is any compact subspace, is open in and also finite. Thus, by removing duplicates, the family is finite and so is a finite intersection of open sets. Therefore, is open for every compact and so by the -space property, is open. Being Alexandrov, let be the smallest nbd of . Then it must be compact (T284), which is finite.
293
Locally finite Anticompact
Added:
Mar 30, 2026
Difficulty:
Cover a compact set with finite nbds. It has a finite subcover of finite sets, so it must be finite.
295
Has multiple points ¬ Empty
Added:
Mar 12, 2026
Difficulty:
Important result to solve the Riemann hypothesis.
296
Indiscrete Hereditarily connected
Added:
Mar 30, 2026
Difficulty:
Indiscrete spaces are connected and being indiscrete is hereditary.
297
Countably-many continuous self-maps Countable
Added:
Mar 30, 2026
Difficulty:
Every point is associated with the constant map , which is continuous. So has at most as many continuous self-maps.
299
Finite Countably-many continuous self-maps
Added:
Mar 12, 2026
Difficulty:
It has finitely many self-maps (continuous or not).