San José State University

applet-magic.com
Thayer Watkins
Silicon Valley
& Tornado Alley
USA

Real Numbers as Cauchy Convergent Sequences

Although it is tempting, and commonly done, to define real numbers as infinite sequences of digits there are insurmountable logical difficulties with that construction. The fact that some real numbers have two representations, such as unity being 1.000... and 0.999..., poses no real problem. The insurmountable problem is that the sum of two infinite sequences of digits cannot always be defined. Likewise the product and difference of two infinite sequences is not always defined. Furthermore the inverse (reciprocal) of a nonzero inifinite sequence may not be defined.

The above problems may be eliminated by taking a real number to be the limit of an infinite sequence. Thus the square root of 2 should not be thought of as a particular infinite sequence of digits, but instead as the limit of a sequence; e.g.,

But this sequence is not the only one that has √2 as its limit. There are an infinitude of convergent sequences that correspond to √2. The important point is that if √2 and √3 are thought of as particular infinite sequences of digits there is no way to define (√2 + √3). On the other hand, it is elementary to construct a convergent sequence for (√2 + √3) from any of the convergent sequences for √2 and √3.

The conceptual difficulty in defining real numbers as convergent sequences is that there is no entities to be taken as the limits of convergent sequences. There is nothing there to be the limit of the sequence. As Gertrude Stein said, "There is no there, there." Real numbers have to be equivalence classes of convergent sequences.

The Definition of the Convergence of a Sequence

Let {an: n=0, 1, 2, ...} be a sequence of rational numbers. A sequence converges if and only if for any rational ε>0 there is an integer N such that

It is essential to define equivalence classes of convergent sequences, but for now this task is postponed until some other constructions are introduced.

The Sum of Two Convergent Sequences

Let {an} and {bn} be two converent sequences. Define {cn} as {an+bn}. It is necessary to show that {cn} is convergent. Let ε be any positive rational number.

Consider for any n and m

Since {an} and {bn} are both convergent there exists two integers Na and Nb} such that

By choosing N=max(Na,Nb) the conditions for convergence of {cn}={an+bn} are assured. Thus {an+bn} is a convergent sequence.

If {bn} is convergent then so is {−bn} and so the difference of two convergent sequences is a convergent sequence; i.e., {an−bn}= {an+(−bn}},

The Product of Two Convergent Sequences

Again let {an} and {bn} be two convergent sequences. Consider {cn}={an*bn}.

Let A and B be bounds on {an} and {bn}, respectively. Then

By choosing Nb such that |bm−bn|<(ε/2)/A for all m,n>Nb and Na such that |am−an|<(ε/2)/B for all m,n>Na, and then N=max(Na, Nb) it is assured that |cm-cn|<ε. Thus the product of two convergent sequences is convergent.

Before extending the analysis to reciprocals (multiplicative inverses) it is necessary to define what it means for a sequence to be convergent to zero. Then it must be established that a convergent sequence not convergent to zero is bounded away from zero.

Sequences Convergent to Zero
 

-->

It is an essential part of the analysis that it is not necessary to specify what a convergent sequence converges to. If the sequence converges to a rational number there is no problem about dealing with limits. Zero is a special and important case.

A sequence {an} converges to zero if for any ε>0 there exists an N such that for all n≥N |an|<ε

Proof:

The Multiplicative Inverse of a Convergent Sequence

Let {an} be a convergent sequence that is not convergent to zero. There therefore exists a lower bound on the magnitude of |an|. Let A be such a lower bound.

For {an} define a reciprocal sequence {bn} as follows:

where M is some arbitrary large number. Its choice does not affect the analysis because beyond some point there are no cases of an=0.

Consider

Therefore is N is chosen so that |an−am|<εA² then |bm−bn| will be less than ε. Thus {bn} is a convergent sequence and hence any convergent sequence not convergent to zero will have an inverse. This means that the quotient of any two sequences is defined if the divisor sequence is not converent to zero.

Equivalence Classses

Any sequence convergent to zero is in the equivalence class of zero, denoted as [0]. Two convergent sequences are equivalent; i.e., belong to the same equivalence class, is their difference is in the equivalence class of zero.

After defining equivalence classes it is necessary to define the sum, difference, product and reciprocal of equivalence classes. This is done using representives from the equivalence classes, but it also must be shown that it does not matter which element of the class is chosen as representative. This shows the sum, difference, product and reciprocal are well defined.

(To be continued.)

The Axiomatic Definition of Real Numbers

This approach to the real numbers uses eleven axioms to define a complete ordered field, the real numbers. Let (S, +, *, <) be a set and two function, + and *, called addition and multiplication, respectively, and an order relation <, which is a boolean function. The functions are usually called operations and represented in infix notation, but they are nothing more than special binary functions. The first eight axioms define a field:

  1. Closedness of Addition and Multiplication: If a and b belong to S then so does a+b and a*b.
  2. Associativity:
    If a, b, and c belong to S then
    a + (b + c) = (a + b) + c
    a*(b*c) = (a*b)*c
  3. Commutativity of Addition and Multiplication:
    a + b = b + a
    a*b = b*a
  4. Distributivity of Multiplication Over Addition:
    If a, b, and c belong to S then a*(b + c) = a*b + a*c.
  5. Additive and Multiplicative Identities
    There exits two members of S, 0 and 1, such that
    for all a belonging to S, a + 0 = a
    and a*1 = a.
  6. Additive Inverses:
    For each a belonging to S there exists an element of S, say b, such that a + b = 0. The element b is usually denoted -a.
  7. Multiplicative Inverses:
    For each a belonging to S other than the additive identity 0 there exists an element of S, say b, such that a*b = 1. The element b is usually denoted a-1.
  8. Trichotomy:
    If a and b belong to S either a < b or b < a or a=b.
  9. Transitivity of the Order Relation:
    If a < b and b < c then a < c.
  10. Isotony of the Order Relation:
    If a < b then for all c belonging to S a + c < b +c.
    If a < b and 0 < c then a*c < b*c.
  11. Completion:
    If T is a subset of S with an upper bound b belonging to S such that for all a belonging to T, a < b, then there exist a least upper bound to T; i.e., an element c belonging to S such that c is less than or equal to every upper bound of T.

The first seven conditions can be shown to be satisfied for the equivalence classes of convergent sequences as a result of the rational numbers satisfying those conditions. Order relations require more analysis.

Order Relations for Cauchy Convergent Sequences

Order for two convergent sequences of rational numbers {an} and {bn} must be defined without any reference to the limits of the sequences. This is not too hard to do.

A convergent sequence {an} is greater than a convergent sequence {bn} if there exists an interger N such that for all i>N

It is first necessary to demonstrate that convergent sequences obey the trichotomy law; i.e.; for any two convergent sequences {an} and {bn} either {an} > {bn}, {bn} > {an} or {an} = {bn}. Equality in this context means that {an} is not greater than {bn} and {bn} is not greater than {an}. Stated in this form trichotomy is a logical requirement.

Transitivity is very simple to prove. If {an} > {an} then there exists an N1 such that for all n≥N1 an > bn. Likewise there is an N2 such that for all n ≥ N2 bn > cn. Thus for all n ≥ N=max(N1, N2) an > cn.

Isotony is similarly simple to prove. If {an} > {an} then there exists an N such that for all n≥N an > bn. The inequality holds true as well for

The existence of the necessary N is guaranteed and hence

For a convergent sequence {cn} > {0} it is only necessary that for some M all cn > 0 for all n≥M. If for {an} > {bn} N1 is the number such that for all n≥N1 an>bn, then by choosing N=max(N1, M) it is guaranteed that for all n≥N

(To be continued.)


HOME PAGE OF applet-magic
HOME PAGE OF Thayer Watkins