Processing math: 80%
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

1.4: Real Numbers

( \newcommand{\kernel}{\mathrm{null}\,}\)

Let C be the set of all Cauchy sequences of rational numbers. We define a relation on C as follows: If {ai}iI and {bj}jJ are Cauchy sequences in Q, then {ai}iI{bj}jJ, which we will write more simply as aibi, if for every rational number ϵ>0, there exists an integer N such that

|aibi|<ϵ

whenever i>N. This relation is clearly reflexive and symmetric. To show that it is also transitive, and hence an equivalence relation, suppose aibi and bici. Given ϵQ+, choose N so that

|aibi|<ϵ2

for all i>N and M so that

|bici|<ϵ2

for all i>M. Let L be the larger of N and M. Then, for all i>L,

|aici||aibi|+|bici|<ϵ2+ϵ2=ϵ.

Hence aici.

Definition: set of equivalence classes

Using the equivalence relation just defined, we call the set of equivalence classes of C the real numbers, denoted R.

Note that if aQ, we may identify a with the equivalence class of the sequence {bi}i=1 where bi=a,i=1,2,3,, and thus consider Q to be a subset of R.

Exercise 1.4.1

Suppose {ai}iI and {bi}iJ are sequences in Q with

limiai=limibi.

Show that aibi.

1.4.1 Field Properties

Suppose {ai}iI and {bj}jJ are both Cauchy sequences of rational numbers. Let K=IJ and define a new sequence {sk}kK by setting sk=ak+bk. Given any rational ϵ>0, choose integers N and M such that

|aiaj|<ϵ2

for all i,j>N and

|bibj|<ϵ2

for all i,j>M. If L is the larger of N and M, then, for all i,j>L,

|sisj|=|(aiaj)+(bibj)||aiaj|+|bibj|<ϵ2+ϵ2=ϵ,

showing that {si}kK is also a Cauchy sequence. Moreover, suppose aici and bidi. Given ϵQ+, choose N so that

|aici|<ϵ2

for all i>N and choose M so that

|bidi|<ϵ2

for all i>M. If L is the larger of N and M, then, for all i>L,

|(ai+bi)(ci+di)||aici|+|bidi|<ϵ2+ϵ2=ϵ.

Hence ai+bici+di. Thus if u,vR, with u being the equivalence class of {ai}iI and v being the equivalence class of {bj}jJ, then we may unambiguously define u+v to be the equivalence class of {ai+bi}iK, where K=IJ.

Suppose {ai}iI and {bj}jJ are both Cauchy sequences of rational numbers.

Let K=IJ and define a new sequence {pk}kK by setting pk=akbk. Let B>0 be an upper bound for the set {|ai|:iI}{|bj|:jJ}. Given ϵ>0 choose integers N and M such that

|aiaj|<ϵ2B

for all i,j>N and

|bibj|<ϵ2B

for all i,j>M. If L is the larger of N and M, then, for all i,j>L,

|pipj|=|aibiajbj|=|aibiajbi+ajbiajbj|=|bi(aiaj)+aj(bibj)||bi(aiaj)|+|aj(bibj)|=|bi||aiaj|+|aj||bibj|<Bϵ2B+Bϵ2B=ϵ

Hence {pk}kK is a Cauchy sequence.

Now suppose {ci}iH and {di}iG are Cauchy sequences with aici and bidi. Let B>0 be an upper bound for the set {|bj|:jJ}{|ci|:iH}. Given ϵ>0, choose integers N and M such that

|aici|<ϵ2B

for all i>N and

|bidi|<ϵ2B

for all i>M. If L is the larger of N and M, then, for all i>L,

|aibicidi|=|aibibici+bicicidi|=|bi(aici)+ci(bidi)||bi(aici)|+|ci(bidi)|=|bi||aici|+|ci||bidi|<Bϵ2B+Bϵ2B=ϵ.

Hence aibicidi. Thus if u,vR, with u being the equivalence class of {ai}iI and v being the equivalence class of {bj}jJ, then we may unambiguously define uv to be the equivalence class of {aibi}iK, where K=IJ.

If uR, we define u=(1)u. Note that if {ai}iI is a Cauchy sequence of rational numbers in the equivalence class of u, then {ai}iI is a Cauchy sequence in the equivalence class of u.

We will say that a sequence {ai}iI is bounded away from 0 if there exists a rational number δ>0 and an integer N such that |ai|>δ for all i>N. It should be clear that any sequence which converges to 0 is not bounded away from 0. Moreover, as a consequence of the next exercise, any Cauchy sequence which does not converge to 0 must be bounded away from 0.

Exercise 1.4.2

Suppose {ai}iI is a Cauchy sequence which is not bounded away from 0. Show that the sequence converges and limiai=0.

Exercise 1.4.3

Suppose {ai}iI is a Cauchy sequence which is bounded away from 0 and aibi. Show that {bj}jJ is also bounded away from 0.

Now suppose {ai}iI is a Cauchy sequence which is bounded away from 0 and choose δ>0 and N so that |ai|>δ for all i>N. Define a new sequence {ci}i=N+1+1 by setting

ci=1ai,i=N+1,N+2,

Given ϵ>0, choose M so that

|aiaj|<ϵδ2

for all i,j>M. Let L be the larger of N and M. Then, for all i,j>L, we have

|cicj|=|1ai1aj|=|ajaiaiaj|=|ajai||aiaj|<ϵδ2δ2=ϵ.

Hence {ci}i=N+1 is a Cauchy sequence.

Now suppose {bj}jJ is a Cauchy sequence with aibi. By Exercise 1.4.3 we know that {bj}jJ is also bounded away from 0, so choose γ>0 and K such that |bj|>γ for all j>K. Given ϵ>0, choose P so that

|aibi|<ϵδγ.

for all i>P. Let S be the larger of N,K, and P. Then, for all i,j>S, we have

|1ai1bi|=|biaiaibi|=|biai||aibi|<ϵδγδγ=ϵ.

Hence 1ai1bi. Thus if u0 is a real number which is the equivalence class of {ai}iI( necessarily bounded away from 0), then we may define

a1=1a

to be the equivalence class of

{1ai}i=N+1,

where N has been chosen so that |ai|>δ for all i>N and some δ>0.

It follows immediately from these definitions that R is a field. That is:

1. a+b=b+a for all a,bR;

2. (a+b)+c=a+(b+c) for all a,b,cR;

3. ab=ba for all a,bR;

4. (ab)c=a(bc) for all a,b,cR;

5. a(b+c)=ab+ac for all a,b,cR;

6. a+0=a for all aR;

7. a+(a)=0 for all aR;

8. 1a=a for all aR;

9. if aR,a0, then aa1=1.

1.4.2 Order and Metric Properties

Definition

Given uR, we say that u is positive, written u>0, if u is the equivalence class of a Cauchy sequence {ai}iI for which there exists a rational number ϵ>0 and an integer N such that ai>ϵ for every i>N. A real number uR is said to be negative if u>0. We let R+ denote the set of all positive real numbers.

Exercise 1.4.4

Show that if uR, then one and only one of the following is true: (a)u>0,(b)u<0, or (c)u=0.

Exercise 1.4.5

Show that if a,bR+, then a+bR+.

Definition

Given real numbers u and v, we say u is greater than v, written u>v, or, equivalently, v is less than u, written, v<u, if uv>0. We write uv, or, equivalently, vu, to indicate that u is either greater than or equal to v. We say that u is nonnegative if u0.

Exercise 1.4.6

Show that R is an ordered field, that is, verify the following:

a. For any a,bR, one and only one of the following must hold: (i)a<b, (ii) a=b,( iii) a>b.

b. If a,b,cR with a<b and b<c, then a<c.

c. If a,b,cR with a<b, then a+c<b+c.

d. If a,bR with a>0 and b>0, then ab>0.

Exercise 1.4.7

Show that if a,bR with a>0 and b<0, then ab<0.

Exercise 1.4.8

Show that if a,b,cR with a<b, then ac<bc if c>0 and ac>bc if c<0.

Exercise 1.4.9

Show that if a,bR with a<b, then for any real number λ with 0<λ<1,a<λa+(1λ)b<b.

Definition

For any aR, we call

|a|={a, if a0,a, if a<0,

the absolute value of a.

Exercise 1.4.10

Show that for any aR,|a|a|a|.

Proposition 1.4.1

For any a,bR,|a+b||a|+|b|.

Proof

If a+b0, then

|a|+|b||a+b|=|a|+|b|ab=(|a|a)+(|b|b).

Both of the terms on the right are nonnegative by Exercise 1.4.10. Hence the sum is nonnegative and the proposition follows. If a+b<0, then

|a|+|b||a+b|=|a|+|b|+a+b=(|a|+a)+(|b|+b).

Again, both of the terms on the right are nonnegative by Exercise 1.4.10. Hence the sum is nonnegative and the proposition follows. Q.E.D.

It is now easy to show that the absolute value function satisfies

1. |ab|0 for all a,bR, with |ab|=0 if and only if a=b,

2. |ab|=|ba| for all a,bR,

3. |ab||ac|+|cb| for all a,b,cR.

These properties show that the function

d(a,b)=|ab|

is a metric, and we will call |ab| the distance from a to b.

Proposition 1.4.2

Given aR+, there exist r,sQ such that 0<r<a<s.

Proof

Let {u}iI be a Cauchy sequence in the equivalence class of a. Since a>0, there exists a rational ϵ>0 and an integer N such that ui>ϵ for all i>N. Let r=ϵ2. Then uir>ϵ2 for every i>N, so ar>0, that is, 0<r<a.

Now choose an integer M so that |uiuj|<1 for all i,j>M. Let s=uM+1+2. Then

sui=uM+1+2ui>1

for all i>M. Hence s>a. Q.E.D.

Proposition 1.4.3

R is an archimedean ordered field.

Proof

Given real numbers a and b with 0<a<b, let r and s be rational numbers for which 0<r<a<b<s. since Q is a an archimedean field, there exists an integer n such that nr>s. Hence

na>nr>s>b.

Q.E.D.

Proposition 1.4.4

Given a,bR with a<b, there exists rQ such that a<r<b.

Proof

Let \{u\}_{i \in I} be a Cauchy sequence in the equivalence class of a and let \{v\}_{j \in J} be in the equivalence class of b . Since b-a>0, there exists a rational \epsilon>0 and an integer N such that v_{i}-u_{i}>\epsilon for all i>N . Now choose an integer M so that \left|u_{i}-u_{j}\right|<\frac{e}{4} for all i, j>M . Let r=u_{M+1}+\frac{\epsilon}{2} . Then

\begin{aligned} r-u_{i} &=u_{M+1}+\frac{\epsilon}{2}-u_{i} \\ &=\frac{\epsilon}{2}-\left(u_{i}-u_{M+1}\right) \\ &>\frac{\epsilon}{2}-\frac{\epsilon}{4} \\ &=\frac{\epsilon}{4} \end{aligned}

for all i>M and

\begin{aligned} v_{i}-r &=v_{i}-u_{M+1}-\frac{\epsilon}{2} \\ &=\left(v_{i}-u_{i}\right)-\left(u_{M+1}-u_{i}\right)-\frac{\epsilon}{2} \\ &>\epsilon-\frac{\epsilon}{4}-\frac{\epsilon}{2} \\ &=\frac{\epsilon}{4} \end{aligned}

for all i larger than the larger of N and M . Hence a<r<b . \quad Q.E.D.

1.4.3 Upper and Lower Bounds

Definition

Let A \subset \mathbb{R}. If s \in \mathbb{R} is such that s \geq a for every a \in A, then we call s an upper bound for A. If s is an upper bound for A with the property that s \leq t whenever t is an upper bound for A, then we call s the supremum, or least upper bound, of A, denoted s=\sup A. Similarly, if r \in \mathbb{R} is such that r \leq a for every a \in A, then we call r a lower bound for A . If r is a lower bound for A with the property that r \geq t whenever t is a lower bound for A, then we call r the infimum, or greatest lower bound, of A, denoted r=\inf A .

Theorem \PageIndex{5}

Suppose A \subset \mathbb{R}, A \neq \emptyset, has an upper bound. Then sup A exists.

Proof

Let a \in A and let b be an upper bound for A . Define sequences \left\{a_{i}\right\}_{i=1}^{\infty} and \left\{b_{i}\right\}_{i=1}^{\infty} as follows: Let a_{1}=a and b_{1}=b . For i>1, let

c=\frac{a_{i-1}+b_{i-1}}{2}.

If c is an upper bound for A, let a_{i}=a_{i-1} and let b_{i}=c_{i} otherwise, let a_{i}=c and b_{i}=b_{i-1} . Then

\left|b_{i}-a_{i}\right|=\frac{|b-a|}{2^{i-1}}

for i=1,2,3, \ldots Now, for i=1,2,3, \ldots, let r_{i} be a rational number such that a_{i}<r_{i}<b_{i} . Given any \epsilon>0, we may choose N so that

2^{N}>\frac{|b-a|}{\epsilon}.

Then, whenever i>N and j>N,

\left|r_{i}-r_{j}\right|<\left|b_{N+1}-a_{N+1}\right|=\frac{|b-a|}{2^{N}}<\epsilon.

Hence \left\{r_{i}\right\}_{i=1}^{\infty} is a Cauchy sequence. Let s \in \mathbb{R} be the equivalence class of \left\{r_{i}\right\}_{i=1}^{\infty} . Note that, for i=1,2,3, \ldots, a_{i} \leq s \leq b_{i}.

Now if s is not an upper bound for A, then there exists a \in A with a>s . Let \delta=a-s and choose an integer N such that

2^{N}>\frac{|b-a|}{\delta}.

Then

b_{N+1} \leq s+\frac{|b-a|}{2^{N}}<s+\delta=a.

But, by construction, b_{N+1} is an upper bound for A . Thus s must be an upper bound for A .

Now suppose t is another upper bound for A and t<s . Let \delta=s-t and choose an integer N such that

2^{N}>\frac{|b-a|}{\delta}.

Then

a_{N+1} \geq s-\frac{|b-a|}{2^{N}}>s-\delta=t,

which implies that a_{N+1} is an upper bound for A . But, by construction, a_{N+1} is not an upper bound for A. Hence s must be the least upper bound for A, that is, s=\sup A . \quad Q.E.D.

Exercise \PageIndex{11}

Show that if A \subset \mathbb{R} is nonempty and has a lower bound, then inf A exists. (Hint: You may wish to first show that inf A=-\sup (-A), where -A=\{x:-x \in A\}) .


This page titled 1.4: Real Numbers is shared under a CC BY-NC-SA 1.0 license and was authored, remixed, and/or curated by Dan Sloughter via source content that was edited to the style and standards of the LibreTexts platform.

Support Center

How can we help?