Let $x$ and $y$ be real numbers. And suppose that $ \frac{x}{y}$ is irrational.
Prove the following: for each $\varepsilon>0$, there exist integers a and b such that $0<ax+by< \varepsilon$.
Consider the set $S=${$ax+by>0$: $x,y \in R$, $ \frac{x}{y}$ is irrational, $a,b \in Z$}.
First to show $d= \inf S \ge 0$ exists we must show $S$ is non-empty and $0$ is lower bound of $S$. The set $S$ is obviously non-empty. Just consider $|x|+|y|=±1⋅x+(±1)⋅y>0$. And by definition, if $ax+by∈S$ then $ax+by>0$ so $0$ is a lower bound.
Assume that $c=min$ $S$. Then I claim that $x$ and $y$ are both integer multiples of $c$.
$x=cm$, $y=nm$ and $n,m \in Z$.
If not then $x=cm+r$ where $0\leq r<c$ and $ m \in Z$. From here we have
$r=x - mc= x - m(kx+ty)=(1-mk)x+(-tm) y$ and $k,t \in Z$. So $r \in S$ and $r<c$. It contradicts with the fact that $c =\min S$. Similarly we can show $y=cn$ for some $n \in Z$.
But $ \frac{x}{y} = \frac{m}{n}$ sould be irrational where $ m,n \in Z$ which is immposible. It means that the set $S$ has no minimum.
Now..... Suppose $d=\inf S≠0$. Then $\inf S>0$. That mean $\frac{3}{2}d>d$ so $2d>d$ is not a lower bound of $S$. We also know $d∈S$ is impossible as that would mean $d=\min S$ and we know $\min S$ doesn't exist.
So there exists $ax+by$ so that $d<ax+by<2d$. And as $ax+by>d$, $ax+by$ can't be a lower bound so there must exist $ex+fy$ so that $d<ex+fy<ax+by<2d$.
So $0<(a−e)x+(b−f)y<d=\inf S$ which is impossible as $0<(a−e)x+(b−f)y⟹(a−e)x+(b−f)y∈S$.
So $d=infS=0$.
.......
Which means for any $ϵ>0$, then $ϵ$ is not a lower bound of $S$ so there is an $ax+by∈S$ so that $0<ax+by<ϵ$.
$...$
. For example,$a_n = \sin(n)$
is easier to read than$a_n$=sin(n)
, and$x,y \in R$
looks better than$x,y$$\in$$R$
. – Ben Grossmann Jan 10 '21 at 19:18