π-base: Difficulty 3
Difficulty: 3
For proofs that are somewhat easy, maybe takes few minutes figure it out.
3 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 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 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 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. 21 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 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 . 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 ). 37 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, . 43 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 . 51 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. 53 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 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 . 66 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). 82 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. 86 Added: Mar 13, 2026 Difficulty: Let with and . Take and . Then and . This proves . 93 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 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 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. 131 Added: Mar 24, 2026 Difficulty: A GO-space has a basis of order-convex neighborhoods. A LOTS space has a basis containing all open intervals. So by contraposition, suppose is some order-convex neighborhood of a point that contains no open intervals. Then it must be closed. If and , then there is some . But then either or . The same holds if . But then is a proper nonempty clopen set, and is not connected (unless , but then the result is trivial). 137 Added: Mar 24, 2026 Difficulty: It suffices to show a basis is a -network: If with open and compact, then , where is a set of basis elements. being compact means there exists a finite subset with . 155 Added: Mar 25, 2026 Difficulty: It suffices to show that for with open, there is some regular open set with . By regularity, let and open sets with . In particular, , so . Then just pick . 171 Added: Mar 25, 2026 Difficulty: Let be an embedding with nbd of . If for every choice of , the space is discrete with two or more points, so clearly not hyperconnected. If for some , then is an open set with infinitely many points, so by taking any two points with disjoint nbds and ( is ), we have and disjoint, open, nonempty. 180 Added: Mar 26, 2026 Difficulty: Let be a cozero set. Then by perfect normality, let be continuous with (since is closed, so we chose it as the set where , this is in fact why every closed set is a zero set in perfectly normal spaces). It follows that is cozero with and . 186 Added: Mar 26, 2026 Difficulty: Let and choose a countable basis nbd of . Then is a countable subset of such that if is any open nbd of , is open, so . 195 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. 213 Added: Mar 26, 2026 Difficulty: If and are disjoint closed sets, then and so is a discrete family. 224 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. 236 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 . 246 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 . 255 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 Added: Mar 28, 2026 Difficulty: Let be closed. Then there is a continuous map with . Thus, each is open and is a set. 260 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 Added: Mar 29, 2026 Difficulty: In spaces, points are indistinguishable iff . Thus, if and is open, . So is an set, as is countable. 272 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. 282 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 . 289 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 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. 334 Added: Apr 2, 2026 Difficulty: Let be a countable network. For each , define . If , by and without loss of generality, assume and for some open . Since is a union of network elements, there is some with yet . Then is injective, and so . 344 Added: Apr 2, 2026 Difficulty: Let be a basis of clopen sets and let be an open cover. For each , define . Then is an open refinement of clopen sets. By Lindelöf, let be a countable subrefinement of . If , then are all clopen and pairwise disjoint, so it is a clopen refinement which partitions . 360 Added: Apr 3, 2026 Difficulty: Let be an open cover. Let be the collection of finite subsets of and define a function on . Then is an -cover, since is a cover of any finite (compact) set , which has a finite subcover, meaning for some finite . Let be countable so that is a countable -subcover. Then is a countable subcover. 376 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 Added: Apr 3, 2026 Difficulty: A locally-finite collection in a Lindelöf space is countable: If is locally finite, the sets which intersect finitely many elements of is an open cover, so if is a countable subcover, then every element of intersects some , yet only finitely many intersect each , so is countable. 395 Added: Apr 3, 2026 Difficulty: Start by showing regularity. Let and closed. Construct the pairs of nbds such that and for some with . Then the sets form an open cover of . Closed sets are Lindelöf, so take a countable subcollection with still covering . Then is open in a P-space, and , with . Now let be closed and disjoint. Construct the pairs of nds such that and for some with . Similarly, we take such that and , which is open in a P-space, and . 396 Added: Apr 3, 2026 Difficulty: Given , let such that and . Then are all open. Then is open in a P-space, and is closed, since . 400 Added: Apr 3, 2026 Difficulty: Contrapositively, let is continuous and non-constant. So and with . Clearly and are disjoint. They are zero sets, since for and similarly, is a zero set. So and with disjoint clopen sets, by strongly zero-dimensional. In particular, , so the space is not connected. 401 Added: Apr 3, 2026 Difficulty: If you remove “countable” from the definition of pseudonormal, that’s precisely one property of normal spaces. If is closed and is open, then , so there are open sets and with . In particular, . 402 Added: Apr 3, 2026 Difficulty: Let with closed. Being , is a countable closed set, and is open. So let be open with . Then with . 403 Added: Apr 3, 2026 Difficulty: Let and open. Then for each , so by regularity, let and with . Then and with . But that implies , so . 411 Added: Mar 27, 2026 Difficulty: Let be injective. Using the usual topology of , we can define which is clearly a metric, and under this new metrizable topology for , is a homeomorphism from to , and any subset of has a countable dense subset. This separable metrizable topology is trivially coarser than the discrete topology. 413 Added: Mar 27, 2026 Difficulty: Let be a sequence with . Then is compact, since for any open cover of , some element nbd of must contain for all and is finite. But then is finite, and in a space, it must be discrete. So for some , . 415 Added: Mar 27, 2026 Difficulty: All countable sets are closed, since they are a countable union of singletons (closed by ). If is countable and some were not to be isolated, then , which would imply is countable yet not closed. 416 Added: Mar 28, 2026 Difficulty: Contrapositively, if is not an isolated point, then and then there exists a sequence in with . But then this sequence cannot be eventually constant, since the constant would have to be itself. 417 Added: Mar 28, 2026 Difficulty: Let countable with . For any , is countable, so it is discrete. Since , we have and so is countable. 418 Added: Mar 28, 2026 Difficulty: Contrapositively, if is not an isolated point, then , so there exists a countable with . But then is countable yet not discrete. 422 Added: Mar 21, 2026 Difficulty: Let with . If were to be dense, we’d have , but . 423 Added: Apr 3, 2026 Difficulty: Let and with open, compact, and . Then is compact, so it is . Thus, let and be nbds such that . Then separates and by open sets in . 424 Added: Apr 4, 2026 Difficulty: Let compact and . Then is compact and . spaces separate points from compact sets, so there exists a nbd of with . So is closed. 443 Added: Apr 4, 2026 Difficulty: If is disconnected, let be a clopen set with and . Then the function defined as at and at , then is continuous yet has no fixed point. 466 Added: Apr 5, 2026 Difficulty: Denote to mean and are indistinguishable. For each , let be its smallest nbd. Clearly by definition, and for each , there is a nbd of with , so . Furthermore, this proves that is an equivalence relation, since and the sets form a partition of . 605 Added: Mar 25, 2026 Difficulty: A hyperconnected set cannot have two isolated points. Let be the only non-isolated point. Then the hyperconnected sets are only the ones of the form and with for some . Suppose they’re closed. Then clearly , and is a closed subset of that contains , so . 607 Added: Mar 27, 2026 Difficulty: Let be non-isolated with discrete. Let be countably compact. If , then is finite, so it is closed by . If , then for any , is a nbd, so is closed. 608 Added: Mar 26, 2026 Difficulty: If is hyperconnected, it’s in particular connected, so it’s a singleton. Evidently it must be the closure of itself (connected components are closed). 659 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) 683 Added: Mar 17, 2026 Difficulty: Let and such that is discrete. Then all points of are isolated except for potentially . That is, . We wish to show where scl denotes the sequential closure. Clearly . If is not closed, then there is some sequence in such that for some . But must be necessarily , so . 793 Added: Mar 27, 2026 Difficulty: If is infinite, let countably infinite, which must be discrete, so for is a countable cover with no finite subcover. Thus, countably compact sets must be finite, which are closed, as is (T221). 802 Added: Mar 24, 2026 Difficulty: It suffices to show it’s totally disconnected. This follows from (T45) and (T46), but the whole argument is: Let . Then and with . So , which is clopen. Then can’t be in the connected component containing , since and would be disjoint nonempty open sets.Sequentially compact Countably compact
Exhaustible by compacts Hemicompact
Has a countable -network Has a countable network
( ∧ Weakly countably compact) Countably compact
Separable Countable chain condition
(Anticompact ∧ Countable) Has a countable -network
(Normal ∧ ) Completely regular
( ∧ Scattered) Totally disconnected
Hyperconnected Locally connected
(Lindelöf ∧ Weakly locally compact) Exhaustible by compacts
Zero dimensional Completely regular
LOTS GO-space
Locally Euclidean Locally arc connected
Functionally Hausdorff
Has a countable network Hereditarily separable
(Connected ∧ Locally path connected) Path connected
Embeddable in GO-space
(GO-space ∧ Connected) LOTS
Has a -locally finite base Has a -locally finite -network
Regular Semiregular
(Locally Euclidean ∧ Has multiple points) ¬ Hyperconnected
Perfectly normal Cozero complemented
Locally countable Countably tight
Locally Hausdorff
Collectionwise normal Normal
(Weakly locally compact ∧ Regular) Locally relatively compact
(GO-space ∧ Countably tight) First countable
(Weakly locally compact ∧ Regular) Locally compact
(Lindelöf ∧ space) Hereditarily Lindelöf
Perfectly normal space
Has a countable network Hereditarily Lindelöf
(Countable ∧ ) space
Second countable -Lindelöf
Regular
space
Finite Baire
(Has a countable network ∧ ) Cardinality
(Lindelöf ∧ Zero dimensional) Ultraparacompact
-Lindelöf Lindelöf
(Has a -locally finite network ∧ Lindelöf) Has a countable network
(Has a -locally finite -network ∧ Lindelöf) Has a countable -network
(P-space ∧ Lindelöf ∧ ) Normal
(P-space ∧ Functionally Hausdorff) Totally separated
(Connected ∧ Strongly zero-dimensional) Strongly connected
Normal Pseudonormal
( ∧ Pseudonormal) Regular
(Regular ∧ P-space) Pseudonormal
(Discrete ∧ Cardinality ) Has a coarser separable metrizable topology
(Anticompact ∧ ) Sequentially discrete
(P-space ∧ ) Countable sets are discrete
(Sequential ∧ Sequentially discrete) Discrete
(Separable ∧ Countable sets are discrete) Countable
(Countably tight ∧ Countable sets are discrete) Discrete
(Semi-Hausdorff ∧ Has multiple points) ¬ Hyperconnected
(Weakly locally compact ∧ -Hausdorff)
-Hausdorff KC
Fixed point property Connected
(Alexandrov ∧ ) Partition topology
Almost discrete Sober
(Almost discrete ∧ ) Strongly KC
Totally disconnected Sober
(Noetherian ∧ ) Partition topology
(Almost discrete ∧ Sequential) Fréchet Urysohn
Countable sets are discrete Strongly KC
Stonean Stone space