π-base: IDs 100-199
IDs 100-199
100
Added:
Mar 13, 2026
Difficulty:
is (hence, ) by definition.
101
( ∧ Completely normal)
Added:
Mar 13, 2026
Difficulty:
In particular, is and normal, which implies (shown in T99), and so it must be by definition.
102
First countable Well-based
Added:
Mar 13, 2026
Difficulty:
Let be a countable local basis of . Let . Now just remove duplicates.
Rigorously, define for each open. Then and is a valid definition with well ordered by reverse-inclusion, unless some is empty, for which is finite, and that’s okay.
103
Well-based Radial
Added:
Mar 13, 2026
Difficulty:
Take a local basis of which is well-ordered by reverse inclusion. Then it’s isomorphic to some ordinal and it can be enumerated with . Since , use the axiom of choice to construct .
This is a similar proof to First countable Fréchet Urysohn (T183), just with transfinite sequences now (and using the full axiom of choice, not just countable).
104
Fully
Added:
Mar 13, 2026
Difficulty:
By definition.
105
( ∧ Fully normal) Fully
Added:
Mar 13, 2026
Difficulty:
By definition.
106
(Lindelöf ∧ Countably compact) Compact
Added:
Mar 12, 2026
Difficulty:
Shrink the cover twice.
107
(Countably compact ∧ Meta-Lindelöf) Compact
Added:
Mar 13, 2026
Difficulty:
Let be a point-countable open refinement of some open cover . Contrapositively, suppose no countable subcover exists. Recursively, define as any point and the countable collection of sets in containing . Then is nonempty and we can choose from that. Inductively, let of the sets containing , so that is countable and so .
The sequence is infinite and has no cluster point: If were to be, take and the minimum such that . By construction, it is the only element of in . For any sequence with no cluster point, we can construct a countable cover with no finite subcover. Take nbd of , let be the least element of which and a nbd of . Then if is the least element with , let a nbd of . Finally, if , then is a countable cover of with no finite subcover.
108
(Totally disconnected ∧ Locally connected) Discrete
Added:
Mar 13, 2026
Difficulty:
If only singletons are connected and has a basis of connected sets, then the basis must be all singletons.
109
(Ultraconnected ∧ ) Indiscrete
Added:
Mar 13, 2026
Difficulty:
If are indistinguishable, then . So no two distinct points are distinguishable.
110
(Normal ∧ Pseudocompact) Weakly countably compact
Added:
Mar 23, 2026
Difficulty:
Let be a countable, closed and discrete set. Then we could define as . This is clearly continuous ( is discrete), and we can extend it to via the Tietze extension theorem. But then must be bounded, so has to be finite.
111
(Biconnected ∧ Cardinality )
Added:
Mar 24, 2026
Difficulty:
By contradiction, suppose are topologically indistinguishable. Then must be disconnected, since is connected and has at least two points. Then there are open sets such that and . Note that can’t contain any of or , otherwise it must contain both and and are a separation of , which should be connected. Same goes for . So . But notice is connected: If is a separation by open sets with , then and the pair , is a separation of . Through a similar reasoning, is connected. But then is not biconnected.
112
Added:
Mar 13, 2026
Difficulty:
I’m not sure why this is here. implies (T100) and completely normal (T336). Completely normal implies normal (T36). and normal implies (T99).
113
Added:
Mar 24, 2026
Difficulty:
A space is normal and , in particular, . So by (T37), it is completely regular.
114
Functionally Hausdorff
Added:
Mar 24, 2026
Difficulty:
The space is , so given , is closed. It’s also completely regular, so there is a continuous map with and .
115
Added:
Mar 24, 2026
Difficulty:
The space is and completely regular. By (T35), it is regular.
116
-space Has a countable -network
Added:
Mar 24, 2026
Difficulty:
By definition.
117
(Has a countable -network ∧ ) -space
Added:
Mar 24, 2026
Difficulty:
By definition.
118
Added:
Mar 12, 2026
Difficulty:
Clear from their definitions.
119
Added:
Mar 12, 2026
Difficulty:
Clear from their definitions.
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.
121
Compact -compact
Added:
Mar 12, 2026
Difficulty:
A single set is trivially a countable union.
122
-compact Lindelöf
Added:
Mar 12, 2026
Difficulty:
If each compact has a finite subcover, a countable union of them will have a countable subcover.
123
(Lindelöf ∧ Countably paracompact) Paracompact
Added:
Mar 24, 2026
Difficulty:
Take any open cover. Apply Lindelöf, then apply countably paracompact.
124
(Lindelöf ∧ Countably metacompact) Metacompact
Added:
Mar 24, 2026
Difficulty:
Take any open cover. Apply Lindelöf, then apply countably metacompact.
125
(GO-space ∧ Compact) LOTS
Added:
Mar 24, 2026
Difficulty:
Let be the topology of and the order topology of . The open rays and are all open in , and they form a subbasis for , so . Then the identity map is continuous. But is compact and is Hausdorff (LOTS spaces are ), so this is a homeomorphism and .
126
(Compact ∧ ∧ Extremally disconnected) Stonean
Added:
Mar 24, 2026
Difficulty:
By definition.
128
Lindelöf Weakly Lindelöf
Added:
Mar 13, 2026
Difficulty:
A subcover is trivially, a subcolection with dense union.
131
(GO-space ∧ Connected) LOTS
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).
134
(Baire ∧ ¬ Empty) ¬ Meager
Added:
Mar 24, 2026
Difficulty:
If is a countable union of nowhere dense sets, then either it is a union of zero sets (so is empty), or can’t have empty interior (so is not Baire).
137
Has a -locally finite base Has a -locally finite -network
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 .
138
Cardinality ¬ Cardinality
Added:
Mar 12, 2026
Difficulty:
Left as an exercise for the reader.
139
Cardinality Cardinality
Added:
Mar 12, 2026
Difficulty:
Left as an exercise for the reader.
140
Menger Lindelöf
Added:
Mar 25, 2026
Difficulty:
Given an open cover , define for all and so is a countable cover, since each is finite.
143
Door
Added:
Mar 13, 2026
Difficulty:
Take . If is open, it’s a nbd of and not of . If it is closed, is a nbd of not of .
144
Discrete Door
Added:
Mar 13, 2026
Difficulty:
Every set is clopen.
146
Regular
Added:
Mar 13, 2026
Difficulty:
By definition.
147
-space Has a -locally finite network
Added:
Mar 23, 2026
Difficulty:
By definition.
148
(Regular ∧ )
Added:
Mar 13, 2026
Difficulty:
Let such that and for some open . Then , so by regularity, choose disjoint open sets with and . Since , this proves being . and regular is by definition.
149
Completely regular
Added:
Mar 25, 2026
Difficulty:
By definition.
150
(Has a -locally finite network ∧ ) -space
Added:
Mar 25, 2026
Difficulty:
By definition.
151
(Completely regular ∧ )
Added:
Mar 25, 2026
Difficulty:
It suffices to show . For . The space is , so by swapping and if needed, suppose has a nbd not of , which means . Completely regular implies there’s a separation between and , which is a separation of and .
152
Added:
Mar 13, 2026
Difficulty:
By definition.
153
( ∧ Perfectly normal)
Added:
Mar 13, 2026
Difficulty:
By definition.
154
Added:
Mar 13, 2026
Difficulty:
is and perfectly normal. Then it is completely normal (T156). and completely normal is (T101).
155
Regular Semiregular
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 .
157
Dowker
Added:
Mar 25, 2026
Difficulty:
Normal and is the definition of .
163
-compact -relatively-compact
Added:
Mar 25, 2026
Difficulty:
Any compact set is relatively compact.
169
Scattered
Added:
Mar 13, 2026
Difficulty:
Contrapositively, if were indistinguishable, then would have no isolated point.
171
(Locally Euclidean ∧ Has multiple points) ¬ Hyperconnected
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.
174
Sober
Added:
Mar 25, 2026
Difficulty:
Note that implies for any . So contrapositively, if , then the closed set is the closure of two distinct singletons (not unique), so the space is not sober.
175
(Locally Euclidean ∧ Lindelöf) Second countable
Added:
Mar 25, 2026
Difficulty:
If the space is locally euclidean, this means the open sets which are embeddable in some is an open cover, and being Lindelöf, we can take an countable subcover , where each has a homeomorphism . For each , consider
Because is dense in , the balls form a countable basis of , so is a countable basis of (since is homeomorphic). This gives us a countable basis of .
176
Spectral Sober
Added:
Mar 25, 2026
Difficulty:
By definition.
180
Perfectly normal Cozero complemented
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 .
181
Metrizable Locally metrizable
Added:
Mar 13, 2026
Difficulty:
Globally implies locally.
182
-space Has a -locally finite -network
Added:
Mar 26, 2026
Difficulty:
By definition.
183
First countable Fréchet Urysohn
Added:
Mar 13, 2026
Difficulty:
Take a countable local basis of . By constructing , is a shrinking local basis. Since , select for each and .
184
Fréchet Urysohn Sequential
Added:
Mar 13, 2026
Difficulty:
If denotes the sequential closure, then Fréchet Urysohn means “ for all ” and sequential means “ implies is closed for all ”. So if the former is true, then assuming , we have , proving is closed.
186
Locally countable Countably tight
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 .
187
Finite Countable
Added:
Mar 12, 2026
Difficulty:
That’s right, “countable” does not mean infinitely countable.
188
(Sequentially compact ∧ Sequentially discrete) Finite
Added:
Mar 13, 2026
Difficulty:
Contrapositively, if is infinite, let be countable. Since no subsequence of is eventually constant, any subsequence must not converge.
189
Finite Second countable
Added:
Mar 12, 2026
Difficulty:
Any topology is a subset of , so there are finitely many open sets.
190
Cardinality Cardinality
Added:
Mar 12, 2026
Difficulty:
By definition, is the smallest cardinality greater than . Assuming the continuum hypothesis, .
191
Cardinality ¬ Countable
Added:
Mar 12, 2026
Difficulty:
By definition, is the smallest uncountable cardinal.
192
(-space ∧ -Hausdorff) CGWH
Added:
Mar 26, 2026
Difficulty:
It suffices to prove Weak Hausdorff. Thus, let be compact and continuous. Using the -space property, we wish to show that for any other compact and continuous, that is closed. Let be the diagonal of . If we define the function as , then the set is closed, by the -Hausdorff property ( is compact ). If is the projection map, since is compact, is a closed map. But .
193
Locally Hausdorff
Added:
Mar 13, 2026
Difficulty:
Globally implies locally.
194
CGWH KC
Added:
Mar 26, 2026
Difficulty:
Let be compact. Using the -space property, we wish to show that for any compact and any continuous, that is closed. Our objectives are to show (1) is (2) is compact (3) prove is closed.
(1) The inclusion map is continuous and is clearly compact , so apply Weak Hausdorff.
(2) is compact since is continuous. Note that spaces separate compact sets, and since every closed set in is compact, is . Take . and are closed in by (1), so and are closed and can be separated by open nbds and . Note that is compact, so is closed and is a nbd of . Similarly, is a nbd of and .
(3) is compact. Since is , is closed in But is closed in by Weak Hausdorff, so is closed. Then clearly is closed.
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.
197
(Has a -locally finite -network ∧ ) -space
Added:
Mar 26, 2026
Difficulty:
By definition.
198
Finite Noetherian
Added:
Mar 12, 2026
Difficulty:
Every subspace is finite.
199
Polish Separable
Added:
Mar 26, 2026
Difficulty:
By definition.