Real Analysis/Sequences

Real Analysis



Sequences occur frequently in analysis, and they appear in many contexts. While we are all familiar with sequences, it is useful to have a formal definition.

Definition A sequence of real numbers is any function a : NR.

Often sequences such as these are called real sequences, sequences of real numbers or sequences in R to make it clear that the elements of the sequence are real numbers. Analogous definitions can be given for sequences of natural numbers, integers, etc.

Given a sequence (xn), a subsequence, notated as  , is a sequence where (nj) is strictly increasing sequence of natural numbers.

For example, taking nj=2j would the subsequence consisting of every other element of the original sequence, that is (x2x4x6, …).

Sequence Notation


However, we usually write an for the image of n under a, rather than a(n). The values an are often called the elements of the sequence. To make a distinction between a sequence and one of its values it is often useful to denote the entire sequence by  , or just (an). Some employ set notation and denote it as {an} When specifying a particular sequence, it may be written in the form (a1, a2, a3, …), when the sequence is infinite, or (a1, a2, …, an) when the sequence is finite. We tend only to discretely write down enough elements is so that the pattern is clear, which is typically 3 times.

Examples of Sequences


(1, 2, 3, 4, …), (1, -2, 3, -4, …), and (1, π, π2, π3, π4, …) are all examples of sequences. Note, however, that there need not be any particular pattern to the elements of the sequence. For example, we may specify an to be the n-th digit of π. Often sequences are defined recursively. That is, to specify some initial values of the sequence, and then to specify how to get the next element of the sequence from the previous elements. For example, consider the sequence x1=1, x2=1, and xn = xn−1 + xn−2 for n ≥ 3. This sequences is known as the Fibonacci sequence, and its first few terms are given by (1, 1, 2, 3, 5, 8, 13, …). Another familiar example of a recursive sequence is Newton's method. With an initial guess x0 for the zero of a function, Newton's method tells you how to construct the next guess. In this way you generate a sequence which (hopefully) converges to the zero of the function.

Operations on Sequences


We can also perform algebraic operations on sequences. In other words, we can add, subtract, multiply, divide sequences. These operations are simply performed element by element, for completeness we give the definitions.

Definition Given two sequences (xn) and (yn) and a real number c, we define the following operations:
Sequence operators
Operator Definition Property
Addition (xn) + (yn) (xn + yn)
Subtraction (xn) − (yn) (xnyn)
Multiplication (xn) ⋅ (yn) (xnyn)
Division (xn) ⁄ (yn) (xn/yn), if yn ≠ 0 for all n in N
Scalar c ⋅ (xn) (cxn)

Classification of Sequences


Some properties of sequence are so important that they are given special names.

Different types of monotone sequences
Definition Property
strictly increasing if an < an+1 for all n in N
non-decreasing if an ≤ an+1 for all n in N
strictly decreasing if an > an+1 for all n in N
non-increasing if an ≥ an+1 for all n in N
Definition Property
monotone if it satisfies any above definition for all n in N
strictly monotone if it is either strictly increasing or strictly decreasing;

Some of these terms are prefixed with strictly because the term increasing is used in some contexts with meaning either that of strictly increasing or of non-decreasing, and similarly decreasing can mean the same as either strictly decreasing, or non-increasing. As a result, these ambiguous terms are usually prefixed with and strictly. We will try adhere to using this unambiguous term.

From here, we will also describe properties of sequences based on boundedness, a word which we will define for sequences below.

Different types of boundedness
Definition Property
bounded above if there exists M in R such that an<M for all n in N
bounded below if there exists M in R such that an>M for all n in N
bounded if the sequence is both bounded above and bounded below
Cauchy if for all ε>0 there exists a natural number N so that, for all n, m > N, |am-an| < ε

Convergence and Limits


A further important property of sequences (arguably the most important property from the perspective of analysis) is the property of convergence. This property can be easily described by extending the epsilon-delta definition. However, because sequences are relative to counting numbers, there exists an additional way to imagine convergence. Both methods are described below.

Definition Let (xn) be a sequence of real numbers. The sequence (xn) is said to converge to a real number a.
if for all ε>0, there exists N in N such that |xn-a|<ε for all nN.

If (xn) converges to a then we say a is the limit of (xn) and write



  as  .

This is read xn approaches a as n approaches ∞. If it is clear which variable is playing the role of n then this may be abbreviated to simply xna or lim xn=a.

If a sequence converges, then it is called convergent.

It is also useful to extend this concept and allow sequences whose limits are either ∞ or −∞

Definition We say xn→∞ as n→∞ if for every M in R there is a natural number N so that xn≥ M for all nN. We say xn→−∞ as n→∞ if for every M in R there is a natural number N so that xn≤ M for all nN.

Despite this, we do not refer to sequences such as these as convergent. They are instead called divergent.

Although convergence can be proven using the epsilon-delta definition as proof, another method to prove convergences of sequences is through mathematical induction, since sequences are referenced using counting numbers. Through this method, some theorems are easier to prove. However, proof using mathematical induction cannot generalize to real numbers like a proof using epsilon-delta can.

The following theorems will prove that variations of a convergent sequence, expressed either through inductive notation, limit notation, or Cauchy notation, converges to exactly one number. This may seem intuitively clear, but remember that intuition often fails us when it comes to limits. It is also in proper mathematical style to rigorously prove every mathematical notion presented to us.

Theorem (Uniqueness of limits)


A sequence can have at most one limit. In other words: if xn → a and xn → b then a = b.


Suppose the sequence has two distinct limits, so ab. Let ε=|ab|/3.

Certainly ε>0, using the definition of convergence twice we can find natural numbers Na and Nb so that

  for all n > Na.


  for all n > Nb.

Taking k=max(Na,Nb) then both of these conditions hold for xk. Hence we deduce that |xka|≤ε and |xkb|≤ε. Applying the triangle inequality, we see


which is a contradiction. Thus, any sequence has at most one limit.  

Theorem (Convergent Sequences Bounded)


If the subsequence   is a convergent sequence, then it is bounded.


Let  , and let ε = 1.

From the definition of convergence there exists a natural number N such that

  for all n ≥ N.

The sequence   is bounded above by a+1 and below by a−1. Let M = max(|x1|,|x2|,|x3|,…,|xN|, |a|+1). It follows that −M ≤ xn ≤ M for all n in N. Hence the sequence is bounded.  

Theorem (Boundedness of Cauchy Sequences)


If   is a Cauchy sequence, then it is bounded.



Let (xn) be a Cauchy sequence. By the definition of a Cauchy sequence, there is a natural number N such that |xnxm|<1 for all n,m > N. In particular, |xN+1xm|<1 for all m > N. It follows by the reverse triangle inequality that |xm| < |xN+1| + 1. If we take M=max(|x1|, |x2|, …, |xN|, |xN+1| + 1), then |xn| ≤ M for all n in N.  

The following theorem tells us that algebraic operations on sequences commute with the taking limits. This simple theorem is a useful tool in computing limits.

Properties of Sequences


Given our new definition of convergence, it should be essential that we can use the values we get from them algebraically and whether or not we can apply algebraic intuition in regards to converging sequences as well.

Algebraic Operations


If (xn) and (yn) are convergent sequences and a ∈ R, the following properties hold:

  1.  .
  2.  .
  3.  .
  4.   (assuming yn ≠ 0 for all n in N and lim y_n ≠ 0).
  5. If xn ≤ yn for every n in N, then  .



1. Let x=lim xn and y=lim yn. We need to show that for any ε>0 there is natural number N so that if nN, then |(xn + yn) − (x + y)|≤ε. Given any ε>0 we have ε/3>0 so from the definition of convergence there is a natural number Nx so that |xnx|≤ε/3 for all n>Nx, similarly we can choose Ny |yny|≤ε/3 for all n>Ny.

Let N=max(Nx ,Ny). If n>N, then by the triangle inequality we have


which is what we needed to show.  

2. Let x=lim xn and y=lim yn. Since these sequences are convergent they are bounded. Let Mx be a bound for (xn) and let My be a bound for (yn). By increasing these quantities of necessary we may also assume Mx > x and My > y. Given ε>0, there exists some Nx and Ny such that

  for n > Nx and
  for n > Ny.

Then for every n > max(NxNy),



3. Let yn = a for all n in N. The statement now follows from 2.  

4. We can reduce this to showing that lim (1/yn) exists and equals 1/(lim yn). Then it follows by 2 that we have:


Let y=lim yn. By the exercises, since y and yn are not 0, we can find δ > 0 so that |y_n| > δ and |y| > δ. It follows that 1/|yny|<1/δ2. Given ε > 0 choose n in N so that |yn − y| < δ2ε. We have



5. We first can reduce to the case when one sequence is identically 0. To see this let zn = xn − yn. Then zn < 0 for all n in N. Let z = lim zn. Suppose that z > 0 then we can then find a natural number N so that


Since zN ≤ 0 < z, the absolute value equals z − zN. Subtracting z we find that −zN < 0. Hence zN is positive. Contradiction. Therefore we must have that z ≤ 0. Which means that by 1 we get:


Therefore lim xn ≤ lim yn  

Theorem (Squeeze/Sandwich Limit Theorem)


This is the important squeeze theorem that is a cornerstone of limits. Since converging sequences can also be thought of through limit notions and notations, it should also be wise if this important theorem applies to converging sequences as well.

Given sequences (xn), (yn), and (wn), if (xn) and (yn) converge to a and xn ≤ wn ≤ yn, then wn converges to a.



Fix ε > 0. We need to find an N such that |wn − a| < ε if n > N. Since (xn) → a and (yn) → a the definition of convergence ensures that there exists integers Nx and Ny so that |xn − a| < ε for n > Nx and |yn − a| < ε for n > Ny.

Let N=max(NxNy). Then, for all n > N we have −ε < xn − a and yn − a < ε. Since xn < wn < yn, it follows that xn − a < wn − a < yn − a.

Thus if n ≥ N, then −ε < xn − a < wn − a < yn − a < ε. In other words, |wn − a| < ε. 



The following results are closely related to the completeness of the real numbers.

Theorem (Convergence of Monotone sequences)


Any monotone, bounded sequence converges. If the sequence is non-decreasing, then the sequence converges to the least upper bound of the elements of the sequence. If the sequence is non-increasing, then the sequence converges to the greatest lower bound of the elements of the sequence



Let (xn) be any monotone sequence that is bounded by a real number M. Without loss of generality, assume (xn) is non-decreasing. Since (xn) is bounded above, it has a least upper bound by the least upper bound axiom. Let x = sup {xn | n ∈ N}. We will now show that (xn) → x.

Fix ε > 0. As was shown in the exercises, if s = sup(A), then for any ε > 0 there is an element a in A so that s − ε < a < s. Hence, it follows that there exists an N in N so that x − ε < xN < x.

For any n > N, since xn is non-decreasing, we have that


Thus |x − xn| < ε and by the definition of convergence, (xn) converges to x.  

Theorem (Nested intervals property)


If there exists a sequence of closed intervals In = [anbn] = {x | an ≤ x ≤ bn} such that In+1 ⊆ In for all n, then ∩In is nonempty.



Since In+1 ⊆ In it follows that an ≤ an+1 and bn+1 ≤ bn.

Since (an) and (bn) are monotonic sequences they converge by the previous theorem. Furthermore, since an < bn for all n, it follows that lim an ≤ lim bn .

By the monotonicity of (an) and (bn) we have for every n


Therefore lim an ∈ [anbn] for every n, which implies that


Thus the intersection is nonempty.  

Theorem (Bolzano—Weierstrass)


Every bounded sequence of real numbers contains a convergent subsequence.



Let (xn) be a sequence of real numbers bounded by a real number M, that is |xn| < M for all n. We define the set A by A = {r | |r| ≤ M and r < xn for infinitely many n}. We note that A is non-empty since it contains −M and A is bounded above by M. Let x = sup A.

We claim that, for any ε > 0, there must be infinitely many points of xn in the interval (x − ε, x + ε). Suppose not and fix an ε > 0 so that there are only finitely many values of xn in the interval (x − ε, x + ε). Either x ≤ xn for infinitely many n or x ≤ xn for at most only finitely many n (possibly no n at all). Suppose xxn for infinitely many n. Clearly in this case x ≠ M. If necessary restrict ε so that x + ε ≤ M. Set r = x + ε/2 we have that r < xn for infinitely many n because there are only finitely many xn in the set [x,r] and x must be less than infinitely many xn, furthermore |r| < M. Thus r is in A, which contradicts that x is an upper bound for A. Now suppose xxn for at most finitely many n. Set y = x − ε/2. Then there are at most only finitely man n so that xn ≥ y. Thus, if r < xn for infinitely many n, we have that r ≤ y. This means that y is an upper bound for A that is less than x, contradicting that x wast the least upper bound of A. In either case we arrive at a contradiction, thus we must have that for any ε > 0, there must be infinitely many points of xn in the interval (x − ε, x + ε).

Now we show there is a subsequence that converges to x. We define the subsequence inductively, choose any xn1 from the interval (x − 1, x + 1). Assuming we have chosen xn1, …, xnk−1, choose xnk to be an element in the interval (x − 1/k, x + 1/k) so that nk∉{n1, …, nk−1}, this is possible as there are infinitely many elements of (xn) in the interval. Notice that for this choice of xnk we have that |x − xnk|<1/k. Hence for any ε>0, if we take any k > 1/ε, then |xnk-x| < ε. That is the subsequence (xnk) → x.  

Theorem (Cauchy criterion)


A sequence converges if and only if it is Cauchy. Although this seems like a weaker property than convergence, it is actually equivalent, as the following theorem shows:



First we show that if (xn) → x then xN is Cauchy. Now suppose that for a given ε > 0 we wish to find an N so that |xn − xm| < ε for all nm > N. We will choose N so that for all n ≥ N we have that |xn − x| < ε/2. By the triangle inequality, for any nm > N we have:


Thus (xn) is a Cauchy sequence.

Now we show that if (xn) is a Cauchy sequence, then it converges to some x. Let (xn) be a Cauchy sequence, and let ε > 0. By the definition of a Cauchy Sequence, there exits a natural number L so that |xn − xm| < ε/2 whenever nm > L. Since (xn) is a Cauchy sequence it is bounded. By the Bolzano—Weierstrass theorem, it has a convergent subsequence (xnk) that converges to some point x. Now we will show that the whole sequence converges to x

Because (xnk) converges, we can choose a natural number M so that if nk > M, then |xnk − x| < ε/2. Let N = max(LM), and fix any nk > N. For n > N we have that


Thus by definition of convergence (xn) → x.  

These theorems all describe different aspects of the completeness of the real numbers. The reader will notice that the least upper bound property was used heavily in this section, and it is the axiom that separates the real numbers from the rational numbers. While these theorems would be false for the rational numbers, not all of them can substitute for the least upper bound property. The Cauchy criterion and the nested intervals property are not strong enough to imply the least upper bound property without additional assumptions, while the Convergence of Monotone sequences theorem and the Bolzano—Weierstrass property do imply the least upper bound property.

Limit superior and limit inferior


Limits turn out to be a very useful tool in analysis, their primary draw back is that they may not always exist. Occasionally it is useful to have some notion of limit that makes sense for any sequence. To this end we introduce the limit superior (often just called the "lim sup") and the limit inferor (often called the "lim inf").

Definition For a sequence (xn) we define the limit superior, denoted lim sup by:


Similarly we define the limit inferior, denoted by lim inf by:


If (xn) is not bounded above, we say that lim sup xn = ∞. If (xn) is not bounded we say that lim inf xn = −∞.

Notice that for bounded sequences the lim sup and the lim inf always exist. As we know general bounded sequence the limit doesn't always exist. But in the case when the lim sup and lim inf are equal, life is nicer as the next theorem shows.

Theorem (Limit Superior and Inferior)


Let (xn) be a bounded sequence. Then (xn) → x if and only if lim sup xn = x = lim inf xn.



First suppose (xn) → x. Fix an ε > 0 choose a natural number N so that x − ε < xn < x + ε for any n > N. Hence for any k > N we have that


and hence x − ε < lim sup xn < x + ε. Since ε was arbitrary, this can only happen if lim sup xn = x. A similar argument shows that lim inf xn = x.

Now suppose lim inf xn = x = lim sup xn, and we wish to show that lim xn = x.

First recall that the x=lim sup xn is defined as:


Given an ε > 0, since we can get arbitrarily close to the infimum, we can choose we will choose Nls so that


Similarly recall that the x=lim inf xn is defined as:


Since we can get arbitrarily close to the supremum, we can choose we will choose Nli so that


Let N = max(NlsNli). Now if n > N, then


Hence for any n > N


By our choice of Nls and Nli this implies for any n > N