4.1 Sequences & Convergence

A sequence is an infinitely long ordered list of real numbers. The precise definition is as follows.

Definition 4.1.

A sequence of real numbers is a function

f:.

We denote f(n) as xn and write the sequence as

(xn)n,(xn)n,(xn)n=1,(x1,x2,).

The elements of a sequence can be given by a formula for the n-th term, a recurrence relation, or a pattern given by the first few terms.

(2,4,6,8,)=(2n)ni.e.xn=2n,(1,12,13,14,)=(1n)ni.e.xn=1n. (4.1)

4.1.1 Defining Convergence

Some sequences converge to a fixed value, or limit, meaning that as n gets larger and larger, xn gets closer and closer to the limit. An important question to ask is how do we define if a sequence converges or not, or how do we find the limit if it is only reached after an infinite amount of steps? For example, the sequence (1n)n from above intuitively converges to 0 as n tends to infinity, but how can we prove this mathematically?

Definition 4.2.

Let (xn)n be a sequence of real numbers and let x.

  1. 1.

    (xn)n is a convergent sequence with limit x if

    ε>0,N:nN|xnx|ε. (4.2)

    In english this says that ‘for all ε>0, there exists a natural number N such that for nN the distance between xn and the limit is less than ε’. We say (xn)n tends to x as n tends to infinity.

  2. 2.

    (xn)n tends to infinity as n tends to infinity if

    K>0,N:nNxnK. (4.3)
  3. 3.

    Likewise, (xn)n tends to minus infinity as n tends to infinity if

    K>0,N:nNxnK. (4.4)
  4. 4.

    A sequence is divergent if the limit does not exist or it tends to plus/minus infinity.

Let’s take a closer look at definition 4.2.1. Being unfamiliar with techniques in analysis, it might look very confusing, but it is actually quite a simple and clever idea. The key thing to realise is that converging sequences never actually reach their limit (unless they are constant), so in order to capture this idea of reaching a limit after infinitely many terms in concrete mathematics, we introduce this idea of bounding the elements of the sequence within a certain distance of the limit. Therefore, what this definition is really saying is that no matter how small epsilon is, there exists a step in the sequence such that from that point onwards all values in the sequence are inside the interval (xε,x+ε). Once this idea is understood, everything in analysis starts to make sense! Let us now look at a few examples.

Example 4.1.

Claim: The sequence (1n)n tends to 0 as n tends to infinity.
Proof. Let ε>0 and choose N>1ε. Then for nN we have

|xnx|=|1n0|=1n1N<ε. (4.5)
Example 4.2.

Claim: (1n2)n0 as n.
Proof. Let ε>0 and choose N>1ε. Then for nN we have

|xnx|=|1n20|=1n21N2<ε. (4.6)

It is important to note that we do not have to always use the most optimal value for N. In this proof, choosing N>1ε would have been sufficient because 1N21N.

Example 4.3.

Claim: xn=2n+13n+5, (xn)n32 as n.
Proof. Let ε>0 and choose N>79ε. Then for nN we have

|xnx| =|2n+13n+523|=|3(2n+1)2(3n+5)3(3n+5)| (4.7)
=|6n6n+3109n+15|=|79n+15|=79n+15 (4.8)
79N+1579N<ε. (4.9)
Example 4.4.

Claim: (n3)n as n.
Proof. Let K>0 and choose N>K3. Then for nN we have

xn=n3N3>K. (4.10)
Example 4.5.

Claim: xn=(1)n, (xn)n is divergent.
Proof. Suppose by way of contradiction that there is a limit x.
Let ε=12, then since the limit exists there exists N such that nN implies |xnx|<12.
Since there are arbitrarily large even numbers, there is always some nN (for example n=2N) such that xn=1, so |1x|<12x>12.
Also, since there are arbitrarily large odd numbers, there is always some nN (n=2N+1) such that xn=1, so |1x|<12x<12.
But then 12<x<12, which is impossible, so the limit cannot exist.

4.1.2 Standard Sequences

Theorem 4.1 (Standard Sequences)

Let a.

  1. (i)

    Let xn=a, then (xn)na as n (constant sequence).

  2. (ii)

    If |a|<1, then (an)n0 as n.

  3. (iii)

    If a>1, then (an)n as n.

Proof.
  1. (i)

    Let ε>0. Then given N, nN implies

    |xnx|=|xx|=0<ε. (4.11)
  2. (ii)

    Let ε>0 and choose N>lnεln|a|. Then for nN we have

    |xnx|=|an0|=|an||aN|<ε. (4.12)
  3. (iii)

    Let K>0 and choose N>lnKlna. Then for nN we have

    anaN>K. (4.13)