Suppose we have $\mathbb{R}$ with the standard topology, and we remove a ball $(a- \epsilon, a+\epsilon)$ from the topology, then what topology do we get, provided we remove only the minimum number of sets to keep it a topology?
This is a thought experiment I came up with, so the wording may be tricky. I'll try to explain what I mean. Suppose we had the set $ \{ 0,1,2 \} $ with the following topology $$\tau = \{ \varnothing, \{ 0 \} , \{1 \} , \{1, 0 \} ,\{ 0 ,1,2 \} \}$$
Now, if I were to remove the element $\{1,0 \}$, and were to end up with a topology after removal, then I would have to neccesarily remove either $\{1 \}$ or $\{0 \}$. It could also be that we remove both, but then we would be violating the "minimum removal condition".
I believe that if we do a process for $\mathbb{R}$ , then we would neccesarily end up with the trivial topology. My intuition is based on the fact that the epsilon interval about $a$ I wrote, can be written by intersection of many other pairs of intervals intervals, now these intervals can be written as intersection of infinitely many other pairs of intervals. Going on, we see we must remove all the open sets completely.
How do I show this process would terminate/does not?
Difficulties in this question:
Well, I guess, to properly answer this question, one would have to explain have to formalize the idea of the intuitive removal procedure. Which is not so clear to do, hence I tagged as application.
After some discussion offsite, I find that the result of a removal process can just be rephrased into finding "maximal sub topology which doesn't contain an interval".
If the problem can be solved in other formalizations, I welcome those as solutions too.