Does any one-to-one function exist that satisfies this inequality for all real numbers? 
Does there exist a one-to-one function $f: \Bbb R \to \Bbb R $ such
  that  $f(x^2) - (f(x))^2 \geq \frac 1 4\ \ \forall x \in \Bbb R$ ?

I've tested this with many one-to-one functions but the inequality does not hold, so I believe that there's no such function. Any ideas on how I can prove this?
My first move was to test this with $x = 0$ and $x = 1$ and got $\frac {-1}2 \leq f(0), f(1) \leq \frac 1 2$. Still, I don't know how to carry on.
 A: For $x$ either $0$ or $1$, if we write $y = f(x)$, we get
$$ y - y^2 \geq \tfrac{1}{4}. $$
After completing the square, we find that
$$ 0 \geq (y - \tfrac{1}{2})^2, $$
so we must have $f(0) = f(1) = \tfrac{1}{2}$, a contradiction to the injectivity.

Here is a slightly different, yet trivial observation: Assume that $0 < a < 1 < b$ and $f : (a, b) \to \Bbb{R}$ satisfies
$$ f(x) \geq f(\sqrt{x})^{2} + \tfrac{1}{4} \quad \text{for } a < x < b. \tag{1} $$
(This makes sense since $\sqrt{x} \in (a, b)$ whenever $x \in (a, b)$.) First observation is that $f \geq \tfrac{1}{4}$ on $(a, b)$. In particular, $f$ is always positive.
Moreover, if we denote $g(t) = t^{2} + \frac{1}{4}$, then $g$ is increasing on $[0, \infty)$. So by iterating $(1)$ we have
$$ f(x) \geq g(f(x^{1/2})) \geq g^{2}(f(x^{1/2^{2}})) \geq \cdots \geq g^{n}(f(x^{1/2^{n}})) \geq g^{n}(0). $$
It is easy to check that $g^{n}(0) \to \frac{1}{2}$ as $n \to \infty$, so we have
$$ f(x) \geq \tfrac{1}{2}. $$
In particular, $f$ attains global minimum at $x = 1$. A consequence of this observation is that $f$ cannot be both injective and continuous.
