I want to prove that $C=\{x\in\mathbb{Q}:x≤0 \ or \ x^2≤2\}$ do not have a least upper bound in $\mathbb{Q}$
The definition I'm working with is that a least upper bound, $b$ has to be an upper bound, so $b\in\mathbb{Q}$ where $b>x \ \forall x\in C$ and that its the smallest upper bound, so if $c$ is some upper bound, then $b≤c$
I think the proof is to show that while I can find upper bounds, $b$, I will always be able to find a smaller one. I can prove that upper bound exists by having $b$ be positive and $b^2>2$ but I would like to know how you would always be able to find a smaller one. I think I want to subtract $1/n$ to the bound for a small enough $n$ to create a smaller upper bound. And I would like to do this by avoiding $\sqrt{2}$ if possible