I would like to prove the following statement:
Let $A\subseteq\mathbb{R}$ be nonempty and bounded above, and let $s\in\mathbb{R}$ have the property that for all $n\in\mathbb{N}$, $s+\frac{1}{n}$ is an upper bound for $A$ and $s-\frac{1}{n}$ is not an upper bound for $A$. Prove that $s=\sup A$.
What I would like to know is if I can use the Archimedean property to "exchange" $\frac{1}{n}$ with some $\epsilon >0$. If I can accomplish this exchange successfully, the rest of the proof is trivial.
Here is my attempt: By the Archimedean property, for any $y>0$ there exists a number $n\in\mathbb{N}$ such that $y>\frac{1}{n}>0$. Therefore, for any $\epsilon_0>0$ we can choose $\epsilon=\frac{1}{n}$ such that $\epsilon_0>\epsilon>0$.
I'm not too sure how I can word this to make sense. Basically, how do I convey that the proof using $\frac{1}{n}$ is equivalent to the proof using $\epsilon$?
Yes you can do that.
Let $n > \frac 1{\epsilon}$. Then $\frac 1n < \epsilon$.
So for any $p < s$, let $\epsilon= s-p > 0$ then if $n > \frac 1 {\epsilon}$ then $p = s-\epsilon < s-\frac 1n$ so $p$ is not upper bound so $\sup A \ge s$.
For and $r >s$, let $\epsilon = r -s > 0$ and $n > \frac 1{\epsilon}$ so $s + \frac 1n < r$ so $s + \frac 1n$ is an upper bound so $r$ is an upper bound but not the least upper bound.
So $\sup A \not > s$ so $\sup A \le s$.
So $\sup A = s$.