If E is a metric space, I call a subset C of E a cut if EC is not connected and if C is minimal for this property (which is obviously equivalent to "for every p in C, EC union p is connected". The empty set is a cut of any disconnected space, so the obvious conjecture is : every space of more than one point possesses a cut (this is almost obviously true for manifolds, for instance)... but this conjecture is in fact probably wrong, as it is not obvious at all to find cuts in convoluted spaces like, for instance, the common boundary of three open sets in the plane ; on the other hand, i was not able to prove it in this case either. Any hint on such a proof ? (by the way, Zorn's lemma dont apply here ; I wonder is there is any interesting example of a situation where the hypothesis of the lemma fail (ie, like here, the intersection of a decreasing family of sets having the property P does not necessarily have it), but the conclusion (the existence of a minimal such set) is still valid ?

Assume $E$ is what remains after the infinite number of the iterations above. This is an example of indecomposable continuum, so it can not be presented as a union of any two proper subcontinua. Assume there is a cut $C\subset E$. Then each connected component of $E\backslash C$ has $C$ as the boundary. In particular, $C$ is closed. Let us present $E\backslash C$ as a union of two disjoint open sets $A$ and $B$. Clearly both $\bar A =C\cup A$ and $\bar B=C\cup B$ are proper subcontinua of $E$, a contradiction. 

