Powered by Blogger.
Welcome to online portal for learning pure mathematics.

Archimedean Property of Real Number

Let xxx be any real number. Then there exists a natural number nnn such that n>xnxn>x.
This theorem is known as the Archimedean property of real numbers. It is also sometimes called the axiom of Archimedes, although this name is doubly deceptive: it is neither an axiom (it is rather a consequence of the least upper bound property) nor attributed to Archimedes (in fact, Archimedes credits it to Eudoxus).
Proof.
Let xxx be a real number, and let S={a:ax}Sconditional-setaaxS=\{a\in\mathbb{N}:a\leq x\}. If SSS is empty, let n=1n1n=1; note that x<nxnx<n (otherwise 1S1S1\in S).
Assume SSS is nonempty. Since SSS has an upper bound, SSS must have a least upper bound; call it bbb. Now consider b-1b1b-1. Since bbb is the least upper bound, b-1b1b-1 cannot be an upper bound of SSS; therefore, there exists some ySySy\in S such that y>b-1yb1y>b-1. Let n=y+1ny1n=y+1; then n>bnbn>b. But yyy is a natural, so nnn must also be a natural. Since n>bnbn>b, we know nSnSn\not\in S; since nSnSn\not\in S, we know n>xnxn>x. Thus we have a natural greater than xxx. ∎
Corollary 1.
If xxx and yyy are real numbers with x>0x0x>0, there exists a natural nnn such that nx>ynxynx>y.
Proof.
Since xxx and yyy are reals, and x0x0x\neq 0, y/xyxy/x is a real. By the Archimedean property, we can choose an nnn\in\mathbb{N} such that n>y/xnyxn>y/x. Then nx>ynxynx>y. ∎
Corollary 2.
If www is a real number greater than 000, there exists a natural nnn such that 0<1/n<w01nw0<1/n<w.
Proof.
Using Corollary 1, choose nnn\in\mathbb{N} satisfying nw>1nw1nw>1. Then 0<1/n<w01nw0<1/n<w. ∎
Corollary 3.
If xxx and yyy are real numbers with x<yxyx<y, there exists a rational number aaa such that x<a<yxayx<a<y.
Proof.
First examine the case where 0x0x0\leq x. Using Corollary 2, find a natural nnn satisfying 0<1/n<(y-x)01nyx0<1/n<(y-x). Let S={m:m/ny}Sconditional-setmmnyS=\{m\in\mathbb{N}:m/n\geq y\}. By Corollary 1 SSS is non-empty, so let m0subscriptm0m_{0} be the least element of SSS and let a=(m0-1)/nasubscriptm01na=(m_{0}-1)/n. Then a<yaya<y. Furthermore, since ym0/nysubscriptm0ny\leq m_{0}/n, we have y-1/n<ay1nay-1/n<a; and x<y-1/n<axy1nax<y-1/n<a. Thus aaa satisfies x<a<yxayx<a<y.
Now examine the case where x<0<yx0yx<0<y. Take a=0a0a=0.
Finally consider the case where x<y0xy0x<y\leq 0. Using the first case, let bbb be a rational satisfying -y<b<-xybx-y<b<-x. Then let a=-baba=-b. ∎

  • Digg
  • Del.icio.us
  • StumbleUpon
  • Reddit
  • RSS

0 comments:

Post a Comment