Problem statement:
Let $p \in \{r\in\mathbb{Q}:0<r<1\}$. Then prove that $ \exists n\in\mathbb{N}$ such that $p<1-\frac{1}{n+1}$.
Context:
Source. Although it seems like a trivial thing to say, I don't feel comfortable just accepting it especially when I'm trying to get a firm foundation for analysis. Hence, my question.
Proof Attempt:
Suppose for a contradiction, there is no such $n\in\mathbb{N}$. $\forall n\in\mathbb{N},\hspace{1mm}p\geq 1-\frac{1}{n+1}$.
$\underline{\text{Establish a supremum}}$:
Let $A = \{r\in\mathbb{Q}: \exists n\in\mathbb{N},\hspace{1mm} r = 1-\frac{1}{n+1}\}$. Since $a=1-\frac{1}{2}\in A$ and $a=1-\frac{1}{n+1}\leq 1$, $A$ is nonempty and bounded.
$\underline{\text{Claim lub}(A)=1}$:
Since this is with reference to rational numbers, I can't use the axiom of completeness. However, I should still be able to produce a least upper bound.
Clearly an upper bound for $A$ is $1$ since $1>1-\frac{1}{n+1}$ for all $n\in\mathbb{N}$. Suppose there is an upper bound $\beta<1$. Then $\beta<\frac{\beta+1}{2}<1$ which means $\beta$ is not an upper bound.
$\underline{\text{Contradiction}}$:
Since $\forall n\in\mathbb{N}$, $p\geq1-\frac{1}{n+1}$, $p\not\in A$. Then $p\geq\text{lub}(A)=1$ which contradicts our initial assumption that $p \in \{r\in\mathbb{Q}:0<r<1\}$.
Is this a correct proof? Is there an easier way to do this?
Choose $p= \frac{1}{n+2}$, then you have $\frac{1}{n+2} \geq 1 - \frac{1}{n+1}$ which is equivent to $\frac{1}{n+2} \geq \frac{n}{n+1}$
However $\frac{1}{n+1} > \frac{1}{n+2}$ and thus combining this with the previous result will get us $1 > n$.
This is a contradiction to $n\in\mathbb{N}$.
– Evan William Chandra May 10 '19 at 06:42