Archimedean Properties

Recall that the positive integers are well ordered. I.e., any non-empty set of positive integers has a
smallest element. (This is the basis for induction.)

Archimedean Property If x ∈ R, then there exists nx ∈ N such that x < nx .

Proof (By contradiction.) If not, then x is an upper bound for N; consequently, there is a least
upper bound for N, say u = sup N.
Now u − 1 < u = sup N implies that there exists m ∈ N such that m > u − 1. But since m + 1 ∈ N
and m + 1 > u, this contradicts u = sup N.

Corollary If S := { 1/n : n ∈ N }, then inf S = 0.

Proof We know S is bounded below by 0, so let w = inf S.

For any � > 0, the Archimedean Property implies there exists n ∈ N such that n > 1/�. Conse-
quently,
0 ≤ w ≤ 1/n < �.
Since � > 0 is arbitrary, it follows that w = 0.

Corollary If y > 0, there exists ny ∈ N such that ny − 1 ≤ y < ny .

Proof The Archimedean Property (there is always a larger integer) says that Ey := { m ∈ N : m >
y } is not empty.
By the Well-Ordering Property, Ey has a smallest element, say ny . So y < ny .
By minimality of ny , ny − 1 does not belong to Ey , so ny − 1 ≤ y.
Therefore ny − 1 ≤ y < ny .

Theorem (Density Theorem): If x and y are any real numbers with x < y, then there exists a
rational number r ∈ Q such that x < r < y.

Proof
We may assume x > 0.
Since y − x > 0, there exists n ∈ N such that 1/n < y − x.
(I.e., find denominator. Now, how many of these do we need?)
Let S = { k ∈ N : k × (1/n) > x }.
The Archimedean Property tells us that S is not empty, and Well-Ordering says there is a smallest
element, say m.
So x < m/n.
Also, by minimality, (m − 1)/n < x, so m/n − 1/n < x. Thus m/n < x + 1/n < x + (y − x) < y.
Therefore x < m/n < y.