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:
Yeah.
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.
25
Topological -manifold Locally -Euclidean
Added:
Mar 12, 2026
Difficulty:
By definition.
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.
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.
52
(Totally disconnected ∧ Has multiple points) ¬ Connected
Added:
Mar 12, 2026
Difficulty:
The space is not a singleton.
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.
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.
80
(Functionally Hausdorff ∧ Has multiple points) ¬ Strongly connected
Added:
Mar 12, 2026
Difficulty:
The continuous map with and is not constant.
85
Discrete Completely metrizable
Added:
Mar 13, 2026
Difficulty:
The discrete metric iff is complete: If \abs{x_n - x_m} < 1/2, 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.
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.