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 .
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.
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,
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.
86
Functionally Hausdorff
Added:
Mar 13, 2026
Difficulty:
Let with and . Take and . Then and . This proves .
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 .
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 .
120
Embeddable in GO-space
Added:
Mar 13, 2026
Difficulty:
Let be a homeomorphism. is , so is as well. Define order on by iff . If is a nbd of , then and , where for some . Let . Suppose and . Then with , so and as we wished, to prove is order-convex.
195
Locally Hausdorff
Added:
Mar 13, 2026
Difficulty:
Take any and a nbd which is . We wish to find a neighborhood not containing some other . If , just take . Otherwise, take with since is . But then is also open in , so we’re done.
659
(Noetherian ∧ ) Partition topology
Added:
Mar 13, 2026
Difficulty:
Let iff they are indistinguishable. The equivalent classes form a basis for a topology which must be finer than (if is a nbd of , it must contain all ). It suffices to show each is an open set. But is compact, and any points of are distinguishable from , so it’s possible to find and nbds with (this is analogous to the result that for spaces, any point and a compact can be separated)