π-base: IDs 1-99
IDs 1-99
1
Compact Countably compact
Added:
Mar 12, 2026
Difficulty:
Evident.
2
Countably compact Weakly countably compact
Added:
Mar 11, 2026
Difficulty:
Let be infinite and countably infinite. If has no limit points, is closed and for each , choose a nbd with . Then is a cover. A finite subcover would imply is finite.
3
Sequentially compact Countably compact
Added:
Mar 14, 2026
Difficulty:
Contrapositively, suppose is a cover with no finite subcover. Then for , each is nonempty. So for each , choose . The sequence cannot have a converging subsequence: If , then for some and so for all .
4
Countably compact Pseudocompact
Added:
Mar 11, 2026
Difficulty:
For continuous, is a countable cover.
5
Exhaustible by compacts Hemicompact
Added:
Mar 14, 2026
Difficulty:
Let be a countable compact cover of of which for all , some is a compact nbd of . Let be compact. For each , let be the least element of which is a compact nbd. Then is a cover of , which must have a finite subcover, and so finitely many . Meaning for big enough .
So define . Clearly is a countable compact cover of and any compact is contained in some by above.
6
Compact Locally relatively compact
Added:
Mar 12, 2026
Difficulty:
Any closed set is compact, so any closure of a nbd is compact.
7
Locally relatively compact Weakly locally compact
Added:
Mar 12, 2026
Difficulty:
Take one nbd from the local basis. Its closure is compact.
8
Exhaustible by compacts Weakly locally compact
Added:
Mar 12, 2026
Difficulty:
By definition.
9
Compact Exhaustible by compacts
Added:
Mar 12, 2026
Difficulty:
Indeed.
10
(Extremally disconnected ∧ Locally Hausdorff) Sequentially discrete
Added:
Mar 14, 2026
Difficulty:
Contrapositively, suppose is a sequence with yet has infinitely many terms. If needed, take an injective subsequence. If is a nbd of that is , then there’s a with for . So by another subsequence, we can assume is an injective converging sequence in a space.
For each , it’s possible to construct a neighborhood which only contains and no other , nor : Let and with . for all , so apply the Hausdorff condition finitely many times to terms to construct such .
Now note that and , so if and , then any nbd of must intersect and , so . Yet by definition, , so the space is not extremally disconnected.
11
Has a countable -network Has a countable network
Added:
Mar 14, 2026
Difficulty:
We just have to argue a -netork is a network: Let be a -network. Singletons are compact. So in a -network, for each in an open set , we can find with (we don’t need to be finite here, so no need for the axiom of choice, just take every set of containing ). Thus,
13
Compact Strongly paracompact
Added:
Mar 12, 2026
Difficulty:
A subcover is a refinement. A finite subcover is star-finite.
14
Paracompact Metacompact
Added:
Mar 12, 2026
Difficulty:
If finitely many intersect a nbd around the point, finitely many will intersect the point.
15
Paracompact Countably paracompact
Added:
Mar 12, 2026
Difficulty:
If true for any covers, then true for countable ones.
16
Submetacompact Countably metacompact
Added:
Mar 12, 2026
Difficulty:
If true for any covers, then true for countable ones.
17
Countably compact Countably paracompact
Added:
Mar 12, 2026
Difficulty:
A subcover is a refinement. A finite subcover is star-finite.
18
Countably paracompact Countably metacompact
Added:
Mar 12, 2026
Difficulty:
This is Paracompact Metacompact, just countable this time.
19
( ∧ Weakly countably compact) Countably compact
Added:
Mar 14, 2026
Difficulty:
Let be an infinite set. Contrapositively, suppose every limit point of is not an -accumulation point. If were to be a limit point of , there exists a nbd of of which is finite. But now for each , there’s , a nbd of , so that (by being ). Then is a nbd of with . So is an infinite set with no limit points.
20
Pseudometrizable Has a -locally finite base
Added:
Apr 1, 2026
Difficulty:
Lemma. Every open cover has a -locally finite refinement which is also an open cover.
Proof. Using the axiom of choice, let be an open cover indexed by some ordinal . Let be fixed. For each , define . Then define . This way, is defined to not only be pairwise disjoint, but so that for : If and , with , then and , so .
So let . By definition, . To see why, if and with , then there exist and such that and . By above, , so we have that . By construction, noting the definition of , we see that , so is an open refinement of . It is locally finite because for any , the open ball can only intersect at most one , since any other element has distance at least .
Finally, take . By definition it is a -locally finite refinement of open sets, so we just have to prove it is also a cover. For , let be the minimum ordinal such that . As it is open, let be big enough so that . Then .
For each , let be the cover of -balls, and let be the -locally finite refinement which is also a cover, by above. Then is also -locally finite, and clearly a basis: If , then and so there is some element such that .
Source: Munkres, Topology: Lemma 39.2 (p. 246) + Theorem 40.3 at step 2 (p. 251)
21
Separable Countable chain condition
Added:
Mar 15, 2026
Difficulty:
Let be a collection of pairwise-disjoint nonempty open sets. Let be a dense countable set. For each , means it must be the nbd of some . So let if and only if . As the collection is pairwise-disjoint, this induces a function with that must be surjective, and so .
22
(Anticompact ∧ Countable) Has a countable -network
Added:
Mar 17, 2026
Difficulty:
Let be the network of singletons. The open sets don’t matter: If any compact is necessarily finite, then is finite and . Since is countable, so is .
23
(Regular ∧ Has a -locally finite base) Pseudometrizable
Added:
Apr 1, 2026
Difficulty:
This is, in essence, one of the directions of the Nagata-Smirnov theorem, which in its usual form, states
Note that if is the Kolmogorov quotient of , then is and the -locally finite basis of induces one on via the surjective open map . And if is metrizable, its metric induces a pseudometric on . So it suffices to prove the direction of the metrization theorem above and assume the space is .
Lemma 1. (Regular ∧ Has a -locally finite basis) (Normal ∧ space)
Proof. Let be the basis where each is locally finite. We use the following facts about locally finite families:
-
If is locally finite, then is locally finite.
-
If is locally finite, .
(1) is trivial and for (2), always holds in general. To prove , if is such that every nbd of intersects , note that for any fixed nbd , it intersects only finitely many . So because any intersects at most those sets, .
To prove , we’ll prove something a little stronger: Every open set is a countable union of closures of open sets (so in particular, it is ). Let be an open set. Define . is locally finite by (1). If we define , then by (2), . We wish to prove , and we’ve just proven . For , let . As the space is regular, there is an open nbd of such that . is a basis, so there is some such that , and so implies .
To prove normality, let be closed disjoint. By above, let be open sets with and be open sets with . We now construct the separation in a similar fashion to (T26). Define
Then , , and .
Lemma 2. If is and If is a map such that
-
is continuous for each .
-
For every and nbd of , there is some such that and .
Then is an embedding (a homeomorphism to its image).
Proof. As we’re taking with the product topology, (1) implies is continuous. Since is , for , let with and so for some , while by (2). Now let be open in . For each , let such that and . Then is a nbd of , so that . This proves is open.
Now we’re ready to prove: ( ∧ Has a -locally finite basis) Metrizable.
Let be the basis where each is locally finite. Let . By Lemma 1, and (T257), we see that each is a cozero set, so there exists a continuous map with . Using the axiom of choice, for each , choose a function such that . Then clearly the map with as each coordinate satisfies the statements in Lemma 2, since for , there is some with , and satisfies and .
However, is only a homeomorphism to as a subspace of the product topology on . We need to show it is as well as a subspace of the uniform topology on , which is the one induced by the metric . We already know it is injective, and if is open, is open in the product topology, so it is also open in the metric topology as it is finer. We merely have to show is still continuous.
Let and . Choose big enough so that . For , the range of lies in , so is immediate. For each , we know some nbd of intersects finitely many . This means for every other , yet for each . By continuity, choose a nbd of such that for all , . Then define and , which is open, and has the property that for any , we have as we wished, .
Source: Munkres, Topology: Theorems 39.1 (for Lemma 1), 34.2 (for Lemma 2), 40.3 (main result)
24
(Meta-Lindelöf ∧ Separable) Lindelöf
Added:
Mar 17, 2026
Difficulty:
Let be an open cover, and a point-countable open refinement. Let be countable with . For each , let be the finite set of elements containing . Then is countable. For each , choose a such that . Then is countable. Any must have some as an open neighborhood, and since is dense, for some , which proves and is a subcover.
25
Topological -manifold Locally -Euclidean
Added:
Mar 12, 2026
Difficulty:
By definition.
26
( ∧ Exhaustible by compacts)
Added:
Mar 23, 2026
Difficulty:
It suffices to show the space is normal. We first show regularity. Let be closed and . Let be a compact nbd of . is compact, and spaces separate points from compact sets. So let and with . Choose and . Then are open with and .
From this point, since the space is -compact, it’s possible to use other theorems of -base to prove normality: click here. It feels a bit like cheating, so we instead provide a more direct approach.
Let and be closed sets. By regularity, for each , there are nbds and which are disjoint. Thus, . If we define as the nbds of with this property, then it’s nonempty and is an open cover of . is closed and is -compact, which clearly implies it is Lindelöf (T122), so is Lindelöf and we can extract a countable subcover . We can do the exact same to , finding a countable open cover such that for each . We then define
and are open by construction. For each , for some and since , we have . So and through a similar argument, . Now we show . Assume , which means and . If , then and generates a contradiction, and would imply yet .
27
(Weakly locally compact ∧ ) Completely regular
Added:
Apr 1, 2026
Difficulty:
Denote to mean are indistinguishable. Let be the Kolmogorov quotient and the surjective map. Note that it is continuous and an open map, therefore a closed map, as it is surjective. This means two things.
-
If with closed, then with closed, and a function separating and induces a continuous function separating and . This proves completely regular completely regular.
-
If with open and compact, then , where is open as is open, and compact because is continuous. So weakly locally compact weakly locally compact.
Since is , then is . Joining facts (1) and (2), it suffices to prove (Weakly locally compact ∧ ) .
We first prove locally compactness. To do that, we’ll prove regularity and then then the result follows from (T246). Let with closed. Let with open and compact, by weakly locally compact. Note that spaces separate points from compact sets, so let and with . As is closed, we see that , and , which separates from .
Since is locally compact and , its one-point compactification is compact , which must be , since spaces separate compact sets and any closed sets of are compact. Normal spaces are completely regular (T37), so is completely regular. Let and closed. Then is also closed in , so let with and , and is still continuous with the same properties.
28
( ∧ Countably compact ∧ First countable)
Added:
Mar 17, 2026
Difficulty:
It suffices to show regularity. Let be closed and . Let be a countable basis of . Define the collection and . Clearly for each . is , so is an open cover of . A closed subspace of a countably compact space is countably compact, so let be a finite subcover and
29
Has a countable network Has a -locally finite network
Added:
Mar 18, 2026
Difficulty:
Any countable family is a countable union of finite sets. Finite sets are clearly locally finite. So any countable family is -locally finite.
31
(Locally -Euclidean ∧ ∧ Second countable) Topological -manifold
Added:
Mar 18, 2026
Difficulty:
By definition.
32
Added:
Mar 15, 2026
Difficulty:
If , then .
33
Added:
Mar 15, 2026
Difficulty:
Let . Since is , let and nbds with . This means and , so being regular, let be disjoint nbds with and and similarly disjoint nbds with and . Then and are the nbds of and of which (remember that ).
34
Has a -locally finite -network Has a -locally finite network
Added:
Mar 14, 2026
Difficulty:
A -netork is a network: This was done in (T11).
35
Completely regular Regular
Added:
Mar 14, 2026
Difficulty:
Let continuous with and . Then and are disjoint with and .
36
Completely normal Normal
Added:
Mar 14, 2026
Difficulty:
A space is a subspace of itself.
37
(Normal ∧ ) Completely regular
Added:
Mar 15, 2026
Difficulty:
Let be a closed set and . We argue : Every point of is indistinguishable from , as the space is , so would imply . So by Urysohn’s lemma, let with and . In particular, .
38
Ultraconnected Path connected
Added:
Mar 18, 2026
Difficulty:
Let . Note that cannot be empty, so let be in their intersection and define the path where
Any nbd of must contain both and , so if is any open set, is one of the following sets: , which are all open in .
39
Injectively path connected Path connected
Added:
Mar 15, 2026
Difficulty:
An injective path is a path.
40
Path connected Connected
Added:
Mar 15, 2026
Difficulty:
A path component is always a subset of a connected component: If is a path from to , then is a connected set containing and .
41
Has a dispersion point ¬ Empty
Added:
Mar 12, 2026
Difficulty:
If it has a dispersion point… it has… a point.
42
Discrete
Added:
Mar 12, 2026
Difficulty:
Singletons are clopen.
43
( ∧ Scattered) Totally disconnected
Added:
Mar 23, 2026
Difficulty:
Let be a connected component, and an isolated point of . is and is closed, so is closed in , and take the nbd of with . Then and is a separation of .
44
Partition topology Extremally disconnected
Added:
Mar 18, 2026
Difficulty:
In a partition topology, every open set is clopen, and equals its own closure.
45
(Extremally disconnected ∧ ) Totally separated
Added:
Mar 18, 2026
Difficulty:
If and with , then in particular, , which must be clopen.
46
Totally separated Totally disconnected
Added:
Mar 18, 2026
Difficulty:
Take . Then there’s some clopen with and , so cannot be in the connected component of .
47
Totally disconnected Totally path disconnected
Added:
Mar 18, 2026
Difficulty:
Path connected components are subsets of connected components. So path connected components are singletons, which implies constant paths.
48
Totally separated Functionally Hausdorff
Added:
Mar 18, 2026
Difficulty:
Let and with clopen. Then (indicator function of ) is continuous, since any preimage is one of and all are open. and .
49
Totally path disconnected
Added:
Mar 18, 2026
Difficulty:
Contrapositively, suppose every nbd of must contain . Then and for is continuous.
50
( ∧ Separable) Cardinality
Added:
Mar 17, 2026
Difficulty:
Let be a countable dense subset. For each , define , which is nonempty as it has itself. If , being ensures nbds of and of such that . Clearly , and implies , so . Therefore, the function defined as is injective, and
51
Hyperconnected Locally connected
Added:
Mar 20, 2026
Difficulty:
Every open set is connected: If were not to be, then with disjoint and open in , but then they must be open in as well.
52
(Totally disconnected ∧ Has multiple points) ¬ Connected
Added:
Mar 12, 2026
Difficulty:
The space is not a singleton.
53
(Lindelöf ∧ Weakly locally compact) Exhaustible by compacts
Added:
Mar 20, 2026
Difficulty:
By definition, it suffices to show the space is -compact. Let be the set of all compact neighborhoods. So forms an open cover. Let be countable such that is a countable subcover. Then .
54
Zero dimensional Completely regular
Added:
Mar 20, 2026
Difficulty:
Let be closed and . Then for some nbd of . Let be a clopen nbd of . Then (indicator function of ) is continuous, as any preimage is one of , with and .
55
Cosmic Has a countable network
Added:
Mar 20, 2026
Difficulty:
By definition.
57
Locally pseudometrizable First countable
Added:
Mar 20, 2026
Difficulty:
Let be a nbd of which is pseudometrizable. Then the open balls form a countable local basis.
58
Weakly locally compact -space
Added:
Mar 23, 2026
Difficulty:
Let such that is open in for every compact. We wish to show is open in . For , let where is open and is compact. As is open in , there exists some open such that . Thus, choose . Clearly it is open and .
59
Sequential -space
Added:
Mar 23, 2026
Difficulty:
Let such that, for any compact and continuous, then is closed. We wish to show is closed. To do that, we take a sequence in A such that and show (using that is sequential).
We use a nice trick: is compact and under the order topology. If we define as and , then is continuous: Note that is discrete, so clearly it is continuous at each , and for any nbd of , there is some such that for , so and is continuous at . This proves is closed. would imply , which is not a closed set ().
61
(Has a countable network ∧ ) Cosmic
Added:
Mar 20, 2026
Difficulty:
By definition.
63
Locally injectively path connected Locally path connected
Added:
Mar 21, 2026
Difficulty:
An injective path is a path.
64
Locally path connected Locally connected
Added:
Mar 21, 2026
Difficulty:
A path component is always a subset of a connected component (seen in T40).
66
LOTS GO-space
Added:
Mar 23, 2026
Difficulty:
A LOTS space is clearly . For , consider the nbds and . For any given , if , the sets are open. If , the sets are open. Otherwise, are open. In all three cases, we have a local basis for which is trivially order-convex (unless , but then the result is trivial).
67
Countable Cardinality
Added:
Mar 12, 2026
Difficulty:
This is obvious, so fun fact: The converse requires the continuum hypothesis.
68
Cardinality Cardinality
Added:
Mar 12, 2026
Difficulty:
Big brain stuff.
69
CGWH -space
Added:
Mar 23, 2026
Difficulty:
Nice. Let be a set such that for any compact and , is open in . It suffices to show is open in . We wish to prove so using the -space property, so let be any compact space and any continuous map. is immediately compact, so our objective is to prove it is . Once that’s done, that means is open, and so is open, proving is open.
is Weak Hausdorff, so is closed. Furthermore, for any , the inclusion map is continuous and is trivially compact and , so is closed, proving is , and consequently, is as well. We now verify that is a closed map: If is closed in , since it must be also compact and , is closed in , hence, in as well.
Now take in . Being , we know and are closed sets. They’re compact, and is , so let and with . Then let and . Being a closed map, these are open sets of . Clearly and . would imply with , so .
70
-space
Added:
Mar 23, 2026
Difficulty:
Let . If is compact , then is clearly closed in . This proves is closed.
71
Hyperconnected Strongly connected
Added:
Mar 23, 2026
Difficulty:
If is continuous and nonconstant, then for some there exists with and the sets and are disjoint, open, and nonempty.
72
Ultraconnected Collectionwise normal
Added:
Mar 23, 2026
Difficulty:
By definition, a discrete family must be disjoint, so in an ultraconnected space, it has at most one nonempty closed set . Then just choose to be the open set with .
73
(Zero dimensional ∧ ) Totally separated
Added:
Mar 23, 2026
Difficulty:
Take and suppose is a nbd of not containing . Let with clopen, so . Similarly, is clopen and .
74
Countable -compact
Added:
Mar 12, 2026
Difficulty:
Singletons are compact.
75
(Injectively path connected ∧ Has multiple points) ¬ Cardinality
Added:
Mar 12, 2026
Difficulty:
The path between two distinct points has at least points.
77
Completely metrizable Metrizable
Added:
Mar 23, 2026
Difficulty:
A complete metric is… a metric.
78
Biconnected Connected
Added:
Mar 23, 2026
Difficulty:
By definition.
79
Strongly connected Connected
Added:
Mar 23, 2026
Difficulty:
If is a clopen set, then the indicator function is continuous, so it must be constant equal to zero or one (meaning or ).
80
(Functionally Hausdorff ∧ Has multiple points) ¬ Strongly connected
Added:
Mar 12, 2026
Difficulty:
The continuous map with and is not constant.
81
(Weakly locally compact ∧ KC) Locally relatively compact
Added:
Mar 23, 2026
Difficulty:
Let with open and compact (in particular, is closed). Then the sets of the form where is any open set is a local basis for and are all compact.
82
Locally Euclidean Locally arc connected
Added:
Mar 23, 2026
Difficulty:
For each , let be a nbd with a homeomorphism to . Let be small enough such that . Any open ball is arc connected (consider ), so is a local basis of arc connected sets within which means have the same property (homeomorphisms preserve local bases and arc-connectedness). Now do this with every to form a basis.
83
(Locally injectively path connected ∧ ¬ Discrete) ¬ Cardinality
Added:
Mar 21, 2026
Difficulty:
If is not discrete, then some path is non-constant, so some is injective, meaning .
84
-space
Added:
Mar 23, 2026
Difficulty:
By definition.
85
Discrete Completely metrizable
Added:
Mar 13, 2026
Difficulty:
The discrete metric iff is complete: If , then .
86
Functionally Hausdorff
Added:
Mar 13, 2026
Difficulty:
Let with and . Take and . Then and . This proves .
87
Ultraconnected Ultranormal
Added:
Mar 13, 2026
Difficulty:
If no disjoint nonempty closed sets exist, one of the disjoint closed sets is empty, and the other is contained in , which is clopen.
88
(Path connected ∧ Has multiple points) ¬ Totally path disconnected
Added:
Mar 12, 2026
Difficulty:
Take a path between two points. It’s not constant.
89
(Locally path connected ∧ ¬ Discrete) ¬ Totally path disconnected
Added:
Mar 13, 2026
Difficulty:
Contrapositively, if all paths were constant, then any basis of path connected sets must be made up of singletons, proving it would be discrete.
90
Second countable Has a -locally finite base
Added:
Mar 23, 2026
Difficulty:
A countable family is a countable union of singletons, and a singleton is trivially locally finite.
91
(Hyperconnected ∧ Normal) Ultraconnected
Added:
Mar 13, 2026
Difficulty:
Contrapositively, assume are disjoint, nonempty, and closed. Then we could separate them with open sets, disproving hyperconnectivity.
92
Has a dispersion point Biconnected
Added:
Mar 13, 2026
Difficulty:
Let be partitioned into two sets with at least 2 elements each. One of them contains , and so the other is contained in , so it is disconnected.
93
Has a countable network Hereditarily separable
Added:
Mar 13, 2026
Difficulty:
Let be the countable network and . Ignore the network sets that don’t intersect and choose . Then has to be dense in : For any , for some so that .
94
(Injectively path connected ∧ Has multiple points) ¬ Biconnected
Added:
Mar 12, 2026
Difficulty:
If continuous, and are connected.
95
(Connected ∧ Locally path connected) Path connected
Added:
Mar 13, 2026
Difficulty:
If any path connected component is open, then there can only be one (as they form a partition of , disproving being connected). Take the path connected component of . For , let be a connected nbd. Then any is path connected to (just concatenate the paths and ). So .
96
Hyperconnected Extremally disconnected
Added:
Mar 13, 2026
Difficulty:
Every open set is dense, so is trivially clopen for any open .
97
(Extremally disconnected ∧ Connected) Hyperconnected
Added:
Mar 13, 2026
Difficulty:
Let be open. Then is clopen, so it is either empty or is dense (no other nonempty open sets are disjoint with ).
98
Added:
Mar 13, 2026
Difficulty:
is (hence, ) by definition.
99
( ∧ Normal)
Added:
Mar 13, 2026
Difficulty:
Let . implies and are closed, and normal implies there are and open sets with . So it is and normal.