# Equivalence of Archimedian Fields Properties

I'm trying to prove that an Archimedian field is a subfield of the real numbers, my plan is to use the fact that the rationals are dense within the field and their Dedekind completion is the real numbers.

However, I seem to run into some trouble writing a neat proof for the fact that the two properties of Archimedian fields are equivalent:

Let $F$ be an ordered field, the following are equivalent:
1. For every $x\in F$ there exists a natural number $n$ such that $x < n$
2. The rationals are dense in $F$

(In fact, I only need $(1)\implies (2)$ to be proved)

I have the essence of the proof, assume by contradiction some $a<b$ are two numbers that have no rational numbers in between, wlog we can assume $a,b\in (0,1)$, take some $n$ which is large enough and show some $\frac{k}{n}$ has to be between $a$ and $b$ otherwise there is some $x$ which is an upper bound of $\mathbb{N}$ in the field. However it seems that I can't write it elegantly.

There is a positive integer $n$ greater than $(b-a)^{-1}$, and there is a least positive integer $k$ greater than $n\cdot a$. Thus $a\lt\frac{k}{n}$, and because $\frac{k-1}{n}\leq a$, $\frac{k}{n}=\frac{k-1}{n}+\frac{1}{n}\lt a +(b-a) = b$.

• Beat me to it, slightly more elegantly... Feb 10, 2011 at 21:42
• Much obliged :-) Feb 10, 2011 at 21:45
• You can also use the ceiling function to get a fraction between $x-\epsilon$ and $x+\epsilon$. See Proposition 6 of a previous answer of mine Feb 10, 2011 at 21:56
• This is simpler viewed geometrically: by AP we can scale the interval $\rm\ I = (a,b)\$ by an integer factor $\rm\:n\:$ to obtain $\rm\:n\:I = (na,nb)$ of length $> 1\:.\$ Thus by AP there is an integer $\rm\:k\in n\:I\:$ hence a rational $\rm\:k/n\in I\:.\$ QED $\$ Essentially we exploit the fact that the problem is invariant under rational scaling symmetries to reduce it to a floor/ceiling computation, which exists the (generalized) division algorithm. See answer for further elaboration. Feb 11, 2011 at 3:18
• @Bill: Thank you for your time and answer, I find geometrical interpretations unhelpful in most cases because I don't have a strong geometrical thinking. Jonas' proof fit perfectly into my thinking process. Feb 11, 2011 at 6:59

For my take on this, see the proof of Proposition 108 in these notes.

This is quite trivial if viewed correctly. In a nutshell it boils down to the observation that we can employ rational-based rulers, i.e. we can change our unit of measurement on the number line from $1$ to any rational $\rm\:s\:$. More precisely, suppose we wish to find a rational in the real interval $\rm\ (a,b),\ a,b\in \mathbb R\:$. Simply choose some rational $\rm\:r < a\$ and a positive rational step size $\rm\ s < b-a\:.\$ Now, starting from $\rm\:r\:,\$ keep taking steps of size $\rm\:s\:.\$ By the Archimedean Property (AP) eventually you'll surpass $\rm\:b\:$, and taking a step back from the first such point necessarily lands you at a rational point in $\rm\ (a,b)\:,\$ since the step size is smaller than the interval. Since the proof uses only the Archimedean property it works for any Archimedean field. Essentially it's simply employing the (Euclidean) division algorithm for rationals. Equivalently, instead of choosing the unit $1$ for our number line we instead choose the unit to be the rational number $\rm\:s\:$ that is our step size. In fact these ideas go all the way back to Euclid, who used it to (effectively) compute the gcd of rationals (greatest common measure of line segments).

It proves illuminating to examine the proof in JM's answer from this geometric viewpoint: by AP we can scale the interval $\rm\ I = (a,b)\$ by an integer factor $\rm\:n\:$ to obtain $\rm\:n\:I = (na,nb)$ of length $> 1\:.\$ Thus by AP there is an integer $\rm\:k\in n\:I\:$ hence a rational $\rm\:k/n\in I\:.\$ QED $\$ Notice how much more intuitive the proof is when presented in this geometric form. The key to its success is that the problem is invariant under rational scaling symmetries. Thus we can scale it to reduce it to what amounts to a trivial floor or ceiling computation (these functions exist by AP and induction).