Real Analysis/Sequences
←Section 1 Exercises | Real Analysis Sequences |
Constructing the real numbers→ |
Definition[edit | edit source]
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 : N→R.
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 (x_{n}), a subsequence, notated as , is a sequence where (n_{j}) is strictly increasing sequence of natural numbers.
For example, taking n_{j}=2j would the subsequence consisting of every other element of the original sequence, that is (x_{2}, x_{4}, x_{6}, …).
Sequence Notation[edit | edit source]
However, we usually write a_{n} for the image of n under a, rather than a(n). The values a_{n} 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 (a_{n}). Some employ set notation and denote it as {a_{n}} When specifying a particular sequence, it may be written in the form (a_{1}, a_{2}, a_{3}, …), when the sequence is infinite, or (a_{1}, a_{2}, …, a_{n}) 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[edit | edit source]
(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 a_{n} 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 x_{1}=1, x_{2}=1, and x_{n} = x_{n−1} + x_{n−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 x_{0} 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[edit | edit source]
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 (x_{n}) and (y_{n}) and a real number c, we define the following operations:
Operator | Definition | Property |
---|---|---|
Addition | (x_{n}) + (y_{n}) | (x_{n} + y_{n}) |
Subtraction | (x_{n}) − (y_{n}) | (x_{n} − y_{n}) |
Multiplication | (x_{n}) ⋅ (y_{n}) | (x_{n} ⋅ y_{n}) |
Division | (x_{n}) ⁄ (y_{n}) | (x_{n}/y_{n}), if y_{n} ≠ 0 for all n in N |
Scalar | c ⋅ (x_{n}) | (c ⋅ x_{n}) |
Classification of Sequences[edit | edit source]
Some properties of sequence are so important that they are given special names.
Definition | Property |
---|---|
strictly increasing | if a_{n} < a_{n+1} for all n in N |
non-decreasing | if a_{n} ≤ a_{n+1} for all n in N |
strictly decreasing | if a_{n} > a_{n+1} for all n in N |
non-increasing | if a_{n} ≥ a_{n+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.
Definition | Property |
---|---|
bounded above | if there exists M in R such that a_{n}<M for all n in N |
bounded below | if there exists M in R such that a_{n}>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, |a_{m}-a_{n}| < ε |
Convergence[edit | edit source]
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 (x_{n}) be a sequence of real numbers. The sequence (x_{n}) is said to converge to a real number a.
- if for all ε>0, there exists N in N such that |x_{n}-a|<ε for all n≥N.
If (x_{n}) converges to a then we say a is the limit of (x_{n}) and write
or
- as .
This is read x_{n} approaches a as n approaches ∞. If it is clear which variable is playing the role of n then this may be abbreviated to simply x_{n}→a or lim x_{n}=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 x_{n}→∞ as n→∞ if for every M in R there is a natural number N so that x_{n}≥ M for all n≥N. We say x_{n}→−∞ as n→∞ if for every M in R there is a natural number N so that x_{n}≤ M for all n≥N.
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)[edit | edit source]
A sequence can have at most one limit. In other words: if x_{n} → a and x_{n} → b then a = b.
Proof[edit | edit source]
Suppose the sequence has two distinct limits, so a≠b. Let ε=|a−b|/3.
Certainly ε>0, using the definition of convergence twice we can find natural numbers N_{a} and N_{b} so that
- for all n > N_{a}.
and
- for all n > N_{b}.
Taking k=max(N_{a},N_{b}) then both of these conditions hold for x_{k}. Hence we deduce that |x_{k}−a|≤ε and |x_{k}−b|≤ε. Applying the triangle inequality, we see
which is a contradiction. Thus, any sequence has at most one limit.
Theorem (Convergent Sequences Bounded)[edit | edit source]
If the subsequence is a convergent sequence, then it is bounded.
Proof[edit | edit source]
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(|x_{1}|,|x_{2}|,|x_{3}|,…,|x_{N}|, |a|+1). It follows that −M ≤ x_{n} ≤ M for all n in N. Hence the sequence is bounded.
Theorem (Boundedness of Cauchy Sequences)[edit | edit source]
If is a Cauchy sequence, then it is bounded.
Proof[edit | edit source]
Let (x_{n}) be a Cauchy sequence. By the definition of a Cauchy sequence, there is a natural number N such that |x_{n}−x_{m}|<1 for all n,m > N. In particular, |x_{N+1}−x_{m}|<1 for all m > N. It follows by the reverse triangle inequality that |x_{m}| < |x_{N+1}| + 1. If we take M=max(|x_{1}|, |x_{2}|, …, |x_{N}|, |x_{N+1}| + 1), then |x_{n}| ≤ 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[edit | edit source]
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[edit | edit source]
If (x_{n}) and (y_{n}) are convergent sequences and a ∈ R, the following properties hold:
- .
- .
- .
- (assuming y_{n} ≠ 0 for all n in N and lim y_n ≠ 0).
- If x_{n} ≤ y_{n} for every n in N, then .
Proof[edit | edit source]
1. Let x=lim x_{n} and y=lim y_{n}. We need to show that for any ε>0 there is natural number N so that if n≥ N, then |(x_{n} + y_{n}) − (x + y)|≤ε. Given any ε>0 we have ε/3>0 so from the definition of convergence there is a natural number N_{x} so that |x_{n}−x|≤ε/3 for all n>N_{x}, similarly we can choose N_{y} |y_{n}−y|≤ε/3 for all n>N_{y}.
Let N=max(N_{x} ,N_{y}). If n>N, then by the triangle inequality we have
which is what we needed to show.
2. Let x=lim x_{n} and y=lim y_{n}. Since these sequences are convergent they are bounded. Let M_{x} be a bound for (x_{n}) and let M_{y} be a bound for (y_{n}). By increasing these quantities of necessary we may also assume M_{x} > x and M_{y} > y. Given ε>0, there exists some N_{x} and N_{y} such that
- for n > N_{x} and
- for n > N_{y}.
Then for every n > max(N_{x}, N_{y}),
3. Let y_{n} = a for all n in N. The statement now follows from 2.
4. We can reduce this to showing that lim (1/y_{n}) exists and equals 1/(lim y_{n}). Then it follows by 2 that we have:
Let y=lim y_{n}. By the exercises, since y and y_{n} are not 0, we can find δ > 0 so that |y_n| > δ and |y| > δ. It follows that 1/|y_{n}y|<1/δ^{2}. Given ε > 0 choose n in N so that |y_{n} − y| < δ^{2}ε. We have
- .
Hence,
5. We first can reduce to the case when one sequence is identically 0. To see this let z_{n} = x_{n} − y_{n}. Then z_{n} < 0 for all n in N. Let z = lim z_{n}. Suppose that z > 0 then we can then find a natural number N so that
- .
Since z_{N} ≤ 0 < z, the absolute value equals z − z_{N}. Subtracting z we find that −z_{N} < 0. Hence z_{N} is positive. Contradiction. Therefore we must have that z ≤ 0. Which means that by 1 we get:
Therefore lim x_{n} ≤ lim y_{n}
Theorem (Squeeze/Sandwich Limit Theorem)[edit | edit source]
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 (x_{n}), (y_{n}), and (w_{n}), if (x_{n}) and (y_{n}) converge to a and x_{n} ≤ w_{n} ≤ y_{n}, then w_{n} converges to a.
Proof[edit | edit source]
Fix ε > 0. We need to find an N such that |w_{n} − a| < ε if n > N. Since (x_{n}) → a and (y_{n}) → a the definition of convergence ensures that there exists integers N_{x} and N_{y} so that |x_{n} − a| < ε for n > N_{x} and |y_{n} − a| < ε for n > N_{y}.
Let N=max(N_{x}, N_{y}). Then, for all n > N we have −ε < x_{n} − a and y_{n} − a < ε. Since x_{n} < w_{n} < y_{n}, it follows that x_{n} − a < w_{n} − a < y_{n} − a.
Thus if n ≥ N, then −ε < x_{n} − a < w_{n} − a < y_{n} − a < ε. In other words, |w_{n} − a| < ε.
Completeness[edit | edit source]
The following results are closely related to the completeness of the real numbers.
Theorem (Convergence of Monotone sequences)[edit | edit source]
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
Proof[edit | edit source]
Let (x_{n}) be any monotone sequence that is bounded by a real number M. Without loss of generality, assume (x_{n}) is non-decreasing. Since (x_{n}) is bounded above, it has a least upper bound by the least upper bound axiom. Let x = sup {x_{n} | n ∈ N}. We will now show that (x_{n}) → 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 − ε < x_{N} < x.
For any n > N, since x_{n} is non-decreasing, we have that
- .
Thus |x − x_{n}| < ε and by the definition of convergence, (x_{n}) converges to x.
Theorem (Nested intervals property)[edit | edit source]
If there exists a sequence of closed intervals I_{n} = [a_{n}, b_{n}] = {x | a_{n} ≤ x ≤ b_{n}} such that I_{n+1} ⊆ I_{n} for all n, then ∩I_{n} is nonempty.
Proof[edit | edit source]
Since I_{n+1} ⊆ I_{n} it follows that a_{n} ≤ a_{n+1} and b_{n+1} ≤ b_{n}.
Since (a_{n}) and (b_{n}) are monotonic sequences they converge by the previous theorem. Furthermore, since a_{n} < b_{n} for all n, it follows that lim a_{n} ≤ lim b_{n }.
By the monotonicity of (a_{n}) and (b_{n}) we have for every n
Therefore lim a_{n} ∈ [a_{n}, b_{n}] for every n, which implies that
Thus the intersection is nonempty.
Theorem (Bolzano—Weierstrass)[edit | edit source]
Every bounded sequence of real numbers contains a convergent subsequence.
Proof[edit | edit source]
Let (x_{n}) be a sequence of real numbers bounded by a real number M, that is |x_{n}| < M for all n. We define the set A by A = {r | |r| ≤ M and r < x_{n} 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 x_{n} in the interval (x − ε, x + ε). Suppose not and fix an ε > 0 so that there are only finitely many values of x_{n} in the interval (x − ε, x + ε). Either x ≤ x_{n} for infinitely many n or x ≤ x_{n} for at most only finitely many n (possibly no n at all). Suppose x< x_{n} 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 < x_{n} for infinitely many n because there are only finitely many x_{n} in the set [x,r] and x must be less than infinitely many x_{n}, furthermore |r| < M. Thus r is in A, which contradicts that x is an upper bound for A. Now suppose x< x_{n} for at most finitely many n. Set y = x − ε/2. Then there are at most only finitely man n so that x_{n} ≥ y. Thus, if r < x_{n} 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 x_{n} in the interval (x − ε, x + ε).
Now we show there is a subsequence that converges to x. We define the subsequence inductively, choose any x_{n1} from the interval (x − 1, x + 1). Assuming we have chosen x_{n1}, …, x_{nk−1}, choose x_{nk} to be an element in the interval (x − 1/k, x + 1/k) so that n_{k}∉{n_{1}, …, n_{k−1}}, this is possible as there are infinitely many elements of (x_{n}) in the interval. Notice that for this choice of x_{nk} we have that |x − x_{nk}|<1/k. Hence for any ε>0, if we take any k > 1/ε, then |x_{nk}-x| < ε. That is the subsequence (x_{nk}) → x.
Theorem (Cauchy criterion)[edit | edit source]
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:
Proof[edit | edit source]
First we show that if (x_{n}) → x then x_{N} is Cauchy. Now suppose that for a given ε > 0 we wish to find an N so that |x_{n} − x_{m}| < ε for all n, m > N. We will choose N so that for all n ≥ N we have that |x_{n} − x| < ε/2. By the triangle inequality, for any n, m > N we have:
- .
Thus (x_{n}) is a Cauchy sequence.
Now we show that if (x_{n}) is a Cauchy sequence, then it converges to some x. Let (x_{n}) be a Cauchy sequence, and let ε > 0. By the definition of a Cauchy Sequence, there exits a natural number L so that |x_{n} − x_{m}| < ε/2 whenever n, m > L. Since (x_{n}) is a Cauchy sequence it is bounded. By the Bolzano—Weierstrass theorem, it has a convergent subsequence (x_{nk}) that converges to some point x. Now we will show that the whole sequence converges to x
Because (x_{nk}) converges, we can choose a natural number M so that if n_{k} > M, then |x_{nk} − x| < ε/2. Let N = max(L, M), and fix any n_{k} > N. For n > N we have that
- .
Thus by definition of convergence (x_{n}) → 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[edit | edit source]
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 (x_{n}) we define the limit superior, denoted lim sup by:
Similarly we define the limit inferior, deonoted by lim inf by:
If (x_{n}) is not bounded above, we say that lim sup x_{n} = ∞. If (x_{n}) is not bounded we say that lim inf x_{n} = −∞.
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)[edit | edit source]
Let (x_{n}) be a bounded sequence. Then (x_{n}) → x if and only if lim sup x_{n} = x = lim inf x_{n}.
Proof[edit | edit source]
First suppose (x_{n}) → x. Fix an ε > 0 choose a natural number N so that x − ε < x_{n} < x + ε for any n > N. Hence for any k > N we have that
and hence x − ε < lim sup x_{n} < x + ε. Since ε was arbitrary, this can only happen if lim sup x_{n} = x. A similar argument shows that lim inf x_{n} = x.
Now suppose lim inf x_{n} = x = lim sup x_{n}, and we wish to show that lim x_{n} = x.
First recall that the x=lim sup x_{n} is defined as:
Given an ε > 0, since we can get arbitrarily close to the infimum, we can choose we will choose N_{ls} so that
Similarly recall that the x=lim inf x_{n} is defined as:
Since we can get arbitrarily close to the supremum, we can choose we will choose N_{li} so that
Let N = max(N_{ls}, N_{li}). Now if n > N, then
Hence for any n > N
By our choice of N_{ls} and N_{li} this implies for any n > N