The statement of the proposition:
Proposition. For every rational number $\epsilon > 0$, there exists a non-negative rational number $x$ such that $x^{2} < 2 < (x+\epsilon)^2$.
The most common approach to proving the proposition is by using contradiction (1,2).
My question is: is it possible to prove the proposition directly? More concretely, is it possible to find a function $f: \mathbb Q^+\rightarrow \mathbb Q^+$ such that for arbitrary positive rational $\epsilon$, we have
$$f(\epsilon)^2 < 2 < (f(\epsilon) + \epsilon)^2 $$
?
Define $f(\varepsilon)$ to be the truncation of $\sqrt{2}$ to $n$ decimal places, where $10^{-n} \leq \varepsilon$ is the nearest power of $10$ from below.
This ensures that $$f(\varepsilon) < \sqrt{2} < f(\varepsilon) + 10^{-n} \leq f(\varepsilon) + \varepsilon$$
To illustrate, if $\varepsilon=0.2$ then $n=1$ and the inequality reads $$1.4 < \sqrt{2} < 1.5 \leq 1.6$$