0

$x, y\in R$, and $y>x$, prove: there exist $p\in Q$, such that $x<p<y$

Proof:

Since $y>x$ is equvalent with $y-x>0$, by Archimede's property, there exists positive integer $n$, such that

$$\begin{align*}n(y-x)>1.\tag{1}\end{align*}$$

why not $n (y - x) > 0$ since $y - x > 0$, how it becomes $1$ suddenly

and there exists positive integers $m_1,m_2$, such that $> n x,m_2>-n x$,i.e.

$$\begin{align*}-m_2<n x<m_1.\tag{2}\end{align*}$$

[How to think up this?, confusing at Minus $m_2>-n x$]

so, there exists positive integer $m\left(-m_2\leq m\leq m_1\right)$, such that

$$\begin{align*}m-1\leq n x<m.\tag{3}\end{align*}$$

following I understand,keypoint is how to understand and construct (3)

Hence $n x < m \leq 1 + n x < n y$.

Because n$>$0, we have $x<\frac{m}{n}<y$.

$p=\frac{m}{n}$ satisfy the condition.

1 Answers1

3

For any positive real $w$, and $z$ another real there is $n\in\Bbb N$ such that $nw>z$. We're applying the claim with $w=y-x>0,z=1$.

Recall that given any real number $x$, we define $n=\lfloor x\rfloor$ to be the greatest integer such that $n\leq x <n+1$.

Now, I claim that if $b-a>1$, there exists an integer $m'$ with $a< m'<b$. Indeed, let $m=\lfloor a\rfloor$. Then since $-m \geq -a$ we must have $b-m\geq b-a>1\implies b> m+1$ so, since $a< m+1$, $$a< m+1< b$$

and the claim is proven with $m'=m+1$. Now, since $nx-ny>1$, there must exist an integer $m'$ such that $ny<m'<nx$, so...?

Pedro
  • 122,002