Xrfgtjtk

I know that this kind of question has been answered before in many places, but I'd like a proof with a little spin on it. In his book "A course of pure mathematics", Hardy defines a real number $alpha$ as a section composed by a lower class (a) (in which a is rational and a$lt$$alpha$) and an upper class (A) (in which A is rational and A$ge$$alpha$).

I'd like to prove that there are infinitely many rational numbers between any given two real numbers definied in this way by using this idea of sets.

I'm not sure if it's possible, but I believe so, because Hardy says "All these results are immediate consequences of our definitions" after a series of examples I managed to prove except for this one.

It might be useful to tell you that, according to thoses definitions, the relations of magnitude between two real numbers are defined in this way:

$alpha$$lt$$beta$ if, and only if, (a)$subset$(b) and (A)$supset$(B)

$alpha$$gt$$beta$ if, and only if, (a)$supset$(b) and (A)$subset$(B)

(where (a), (A) and (b), (B) are the lower and upper classes of $alpha$ and $beta$).

Evidently, if $alpha$$lt$$beta$ and x is a rational number between $alpha$ and $beta$, then x$in$(A)$cap$(b). Showing that there are infinitely many elements in (A)$cap$(b) would show that there are infinitely many rational numbers between $alpha$ and $beta$, but I'm stuck at this point and cannot find a way to develop the proof from this approach.

Both hints and solutions are welcome.

Greetings!

Let $a,binmathbb R$, WLOG $a< b$ then $b-a>0$. Let us assume that $x=b-a$ and $y=5$ then there exist (by Archimedean property) $ninmathbb N$ s.t $$nx>y$$
$$n(b-a)>5$$ $$nb-na>5$$. Since difference between $nb$ and $na$ is greater than $5$,then there exists atleast one $minmathbb Z$ s.t $$na<m<nb$$ $$a<frac mn<b$$
$$a<r<b$$,where $r=frac mninmathbb Q$ i.e there exist one rational number $r$ between $a$ and $b$.Again $a<r$,there exist $r_1inmathbb Q$ s.t $$a<r_1<r$$.Proceeding this way we can generate as many as rational number as we wish.

Hope this will help!!!

This is really an immediate consequence of the definition of real numbers as given by Hardy. To clarify I repeat the definition here:

A real number $alpha$ is a pair of sets $A, B$ such that

• 
  $Acap B=emptyset, Acup B=mathbb{Q}, Aneq emptyset neq B$.


• if $xin A, yin B$ then $x<y$.


• if $xin A$ then there is a $yin A$ with $x<y$. Note that repeated use of this property shows that there are infinitely many $yin A$ with $x<y$.

If $alpha=(A, B), beta=(C, D) $ are two real numbers defined in this manner then we say that $alpha$ is less than $beta$ and write $alpha<beta$ if $Asubset C$.

Also if $r$ is rational number then there is a corresponding real number $alpha_r$ defined as $(A_r, B_r) $ where $A_r={xmid xinmathbb {Q}, x<r} $ and $B_r={xmid xinmathbb {Q}, xgeq r} $.

Let's now suppose we are given two real numbers $alpha=(A, B), beta=(C, D) $ such that $alpha <beta$. By definition this means that $Asubset C$ and hence $S=Csetminus Aneq emptyset$. It is easy to show that the set $S$ contains infinitely many rationals.

Since $Sneq emptyset $ there is a member $xin S$ and then $xin C, xnotin A$. Since $beta=(C, D) $ is a real number it follows that there are infinitely many members $yin C$ with $y>x$. And none of these members $y$ are in $A$ because if $yin A$ then $x<y$ implies $xin A$ which is not the case. So all these members $yin S=Csetminus A$.

And if $r$ is one such rational number lying in this set $S=Csetminus A$ then the corresponding real number $alpha_r=(A_r, B_r) $ as defined earlier is such that $alpha<alpha_r<beta$. It is in this sense that there are infinitely many rational numbers between any two given real numbers.