Let $S$ and $T$ be subsets of $\mathbb R$ such that $s \lt t$ for each $s \in S$ and each $t \in T$. Prove carefully that $$\sup S \le \inf T$$
Best way to prove such a question?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.Sign up to join this community
Suppose this is not true. Let $\sup S \gt \inf T$. By the denseness of reals, there exists some $k\in\mathbb R$ such that $$\inf T \lt k \lt \sup S$$
Suppose $k\in S$. Then, for all $x\lt k$, $x\notin T$, since we must have $k$ less than any element of $T$. Then, for all $t\in T$, $k\le t$. Thus, $k$ becomes a lower bound of $T$ greater than $\inf T$, which is a contradiction. Thus, $k\notin S$. Similarly, it can be shown that $k\notin T$.
Thus, for all $t\in T$, $t\notin (\inf T,\sup S)$. But $t\gt \inf T$. Then, we have $\sup S\lt t$ for all $t\in T$. Thus, we have a lower bound of $T$ which is greater than $\inf T$ which is a contradiction.
Thus, the assumption is incorrect and $$\sup S\le\inf T$$