Norms Equivalent to Absolute Value on Rational Numbers/Sufficient Condition

Theorem
Let $\alpha \in \R_{\gt 0}$.

Let $\norm{\,\cdot\,}:\Q \to \R$ be the mapping defined by:
 * $\forall x \in \Q: \norm{x} = \size {x}^\alpha$

where $\size {x}$ is the absolute value of $x$ in $\Q$.

Then:
 * $\alpha \le 1 \implies \norm{\,\cdot\,}$ is a norm on $\Q$

Proof
Suppose $\alpha \le 1$.

It is shown that $\norm{\,\cdot\,}$ satisfies the norm axioms (N1)-(N3).

(N1) Positive Definiteness
Let $x \in \Q$.

(N2) Multiplicativity
Let $x, y \in \Q$.

Then:

(N3) Triangle Inequality
Let $x, y \in \Q$.

let $\norm y \lt \norm x$.

If $\norm x = 0$ then $\norm y = 0$.

By (N1) above, $x = y = 0$.

Hence:

If $\norm x \gt 0$ then:
 * $\norm x \gt 0 \iff \size {x}^\alpha \gt 0 \iff \size x \gt 0$

Hence: