# Q is dense in R question about proof

1. Aug 24, 2011

### A_B

Hi,

In Rudin's Principles of Mathematical Analysis there's the following proof that Q is dense in R.

Theorem: If $x,y\in \mathbb{R}$ and $x < y$ there exists a $p \in \mathbb{Q}$ such that $x<p<y.$

Proof: Since $x<y$, we have $y-x>0$. It follow from the Archimedian property that there is a positive integer $n$ such that
$$n(y-x)>1.$$
We again apply the Archimedian property to find positive integers $m_1$ a,d $m_2$ such that $m_1>nx$ and $m_2>-nx$. Then
$$-m_2<nx<m_1.$$
Hence there is an integer $m$ (with $-m_2\leq m\leq m_1$) such that
$$m-1\leq nx < m.$$

We combine the inequalities to get
$$nx < m \leq 1+nx < ny.$$
n is positive so
$$x < \frac{m}{n} < y.$$
Which proves that $\mathbb{Q}$ is dense in $\mathbb{R}$.

How one concludes that the m in the red bit exists is what's troubling me.

Thanks

2. Aug 24, 2011

### micromass

Hmm, you're not the first one to ask that very question.

Anyway, the key is to define

$$m=\min\{k\in \mathbb{Z}~\vert~nx<k\}$$

However, there are some things we need to show:

- Does the minimum exist?? I.e. is the set $\{k\in \mathbb{Z}~\vert~nx<k\}$ non-empty, does it have a lower bound? Why is the infimum a minimum?
- does $m-1\leq nx<m$ hold.

3. Aug 24, 2011

### mathwonk

i.e. are you aware of the well ordering principle?

4. Aug 27, 2011

### A_B

Thanks for the replies, seems I don't know enough about integers yet, so I've been looking into them.
I've found another book on analysis which does introduce the integers, it defines them as "those real numbers which are in every inductive set."

But this isn't how the integers are usually introduced is it?

What's a good book to learn enough about integers (and maybe a little more)?

Thanks

5. Aug 17, 2012

### scottbekerham

This is self evident .Any real number must lie between two successive integers . When You have the natural number system ,Irrationals fill the gaps between any 2 successive integers . It's very simple.

6. Aug 17, 2012