How can I prove the equality of $\sup(A)$ and $sup(A\setminus B)?$

28 Views Asked by At

If $\emptyset\neq A\subseteq\mathbb{R}$ is a set bound from above, and $A$ does not have a maximal value, and $B\subseteq A$ and $B$ has a maximal value, how can I prove that $\sup(A)=\sup(A\setminus B)$?

Doesn't this seem impossible?

1

There are 1 best solutions below

0
On BEST ANSWER

Since $B$ has a maximum there exists some $a \in A$ such that $b \leq a$ for all $b \in B$. Since $A$ does not have a maximal value there exists some $x > a$ with $x \in A$, otherwise $a$ would be maximal. Since all $x > a$ are not in $B$ we have $\sup (A \setminus B) = \sup A$.