I have an algorithm (or method) that attempts to find a solution ($x$) for a problem, and the existence of such solution is described by conditions in the following form:
Sufficient condition for $x$ to exist: $$ \text{Largest}[y_{i}]\leq x \leq \text{Smallest}[z_{j}] $$ Necessary condition for $x$ to exist: $$ \text{Smallest}[y_{i}]\leq x \leq \text{Largest}[z_{j}] $$ where $i$ and $j$ are integer indices over two sets, $\{y\}$ and $\{z\}$, of given real numbers of the same domain as $x$.
However, the sufficient condition stated above is impossible to meet in practice. What does it mean to have the sufficient condition impossible to meet and only the necessary (weaker) condition possible to meet? Does such cases arise normally in mathematical problems?
I am not sure about this, but it seems like a way to say that one has no guarantee of finding a solution and will have to try brute force search using some search algorithm (method), if only the necessary condition is met. Does that make sense?
UPDATE: Further, would it be possible that another sufficient condition may exist that is yet undiscovered? Is it possible to have more than one sufficient condition? And if so, what would it mean for one of them to fail or hold? For example, if we have 2 sufficient conditions and one of them failed, would the second necessarily/automatically fail; and if one held, would the other one necessarily/automatically hold too? I think if one sufficient condition is held then all others should hold, but not sure about the case if one is failed and whether more than one sufficient conditions is allowed in the first place. Or is it that if more than one sufficient conditions existed then they themselves would be related together depending on their respective strenght by other sufficient/necessary relations among themselves?