- #36
- 3,486
- 257
Zondrina said:We would wind up with a singleton set... and we both know what happens when we only have a single dot lol.
Right, or at least you could end up with one, depending on the sets. Looking at it in terms of the deltas, the set [itex]\{\delta_1, \delta_2, \delta_3, \ldots\}[/itex] doesn't necessarily have a minimum if there are infinitely many deltas. For example, you could have [itex]\delta_n = 1/n[/itex], so you could never find a single [itex]\delta[/itex] that satisfies [itex]0 < \delta \leq \delta_n[/itex] for all [itex]n[/itex]. Therefore [itex]x[/itex] would not have any neighborhood contained in [itex]Q_o[/itex].
Cool, so it looks like you have a handle on this now. Don't forget that your original problem talked about a finite union of closed sets, and we translated that to an equivalent problem involving a finite intersection of open sets. So you still have a bit of work to do to relate the two. (Or maybe you already did that earlier, I can't remember.)