Suppose a mysterious adversary has captured me and challenged me to the following topological game. We fix some finite set, say, $X = \{1, 2, 3, \ldots, n\}$, and my adversary secretly constructs a topology $T$ on $X$. My job is to determine $T$ by asking my opponent, as many times as I wish, for the boundary $\partial S$ in $T$ of any subset $S \subset X$, but for every answer I receive, a portion of my anatomy is forcibly removed. I cannot answer until I am absolutely sure of $T$ (no guessing!), and I will be freed as soon as I answer correctly.
Question: What strategy should I use to maximize the number of body parts I expect to walk away with?
The case $n=1$ is trivial, as there is only one topology on a singleton. In the case $n=2$, my strategy is particularly simple: I ask for the boundary of $\{1\}$. There are four possible boundaries, each uniquely determining $T$:
- If $\partial \{1\} = \emptyset$, then $T$ is the discrete topology on $X$.
- If $\partial \{1\} = X$, then $T$ is the indiscrete topology on $X$.
- If $\partial \{1\} = \{1\}$, then $T = \{\emptyset, \{2\}, X\}$.
- If $\partial \{1\} = \{2\}$, then $T = \{\emptyset, \{1\}, X\}$.
In any case, I lose just one body part. I have determined via computer search that for $n=3$, it suffices to check $$ \{1\}, \{1,3\}, \{3\} $$ and for $n=4$, $$ \{1\}, \{1,2,4\}, \{1,3,4\}, \{4\} $$ though I am not sure if these are optimal, and I do not know if the pattern generalizes.