Definition 3.3.1: Sequence
	A sequence of real numbers is a function f: N R. In other words, a sequence can be written as f(1), f(2), f(3), ..... Usually, we will denote such a sequence by the symbol , where aj = f(j).

We now want to describe what the long-term behavior, or pattern, of a sequence is, if any.

Definition 3.1.2: Convergence
	A sequence of real (or complex) numbers is said to converge to a real (or complex) number c if for every > 0 there is an integer N > 0 such that if j > N then | aj - c | < The number c is called the limit of the sequence and we sometimes write aj c. If a sequence does not converge, then we say that it diverges.

Example 3.1.3:
	Consider the sequence . It converges to zero. Prove it. The sequence does not converge. Prove it. The sequence converges to zero Prove it.

We are going to establish several properties of convergent sequences, most of which are probably familiar to you. Many proofs will use an ' argument' as in the proof of the next result. This type of argument is not easy to get used to, but it will appear again and again, so that you should try to get as familiar with it as you can.

Proposition 3.1.4: Convergent Sequences are Bounded
	Let be a convergent sequence. Then the sequence is bounded, and the limit is unique. Proof

Example 3.1.5:
	The Fibonacci numbers are recursively defined as x1 = 1, x2 = 1, and for all n > 2 we set xn = xn - 1 + xn - 2. Show that the sequence of Fibonacci numbers {1, 1, 2, 3, 5, ...} does not converge.

Proposition 3.1.6: Algebra on Convergent Sequences

Suppose and are converging to a and b, respectively. Then Their sum is convergent to a + b, and the sequences can be added term by term. Their product is convergent to a * b, and the sequences can be multiplied term by term. Their quotient is convergent to a / b, provide that b # 0, and the sequences can be divided term by term (if the denominators are not zero). If an bn for all n, then a b Proof

This theorem states exactly what you would expect to be true. The proof of it employs the standard trick of 'adding zero' and using the triangle inequality. Try to prove it on your own before looking it up.

Note that the fourth statement is no longer true for strict inequalities. In other words, there are convergent sequences with a_n < b_n for all n, but strict inequality is no longer true for their limits. Can you find an example ?

While we now know how to deal with convergent sequences, we still need an easy criteria that will tell us whether a sequence converges. The next proposition gives reasonable easy conditions, but will not tell us the actual limit of the convergent sequence.

First, recall the following definitions:

Definition 3.1.7: Monotonicity
	A sequence is called monotone increasing if aj + 1 aj for all j. A sequence is called monotone decreasing if aj aj + 1 for all j.

• Monotone increasing:
  1. a_{j + 1} a_j
  2. a_{j + 1} - a_j 0
  3. a_{j + 1} / a_j 1, if a_j > 0
• Monotone decreasing:
  1. a_{j + 1} a_j
  2. a_{j + 1} - a_j 0
  3. a_{j + 1} / a_j 1, if a_j > 0

Examples 3.1.8:
	Is the sequence monotone increasing or decreasing ? Is the sequence monotone increasing or decreasing ? Is it true that a bounded sequence converges ? How about monotone increasing sequences ?

• If a sequence is bounded above, then c = sup(x_k) is finite. Moreover, given any > 0, there exists at least one integer k such that x_k > c - , as illustrated in the picture.
  

• If a sequence is bounded below, then c = inf(x_k) is finite. Moreover, given any > 0, there exists at least one integer k such that x_k < c + , as illustrated in the picture.
  

Proposition 3.1.9: Monotone Sequences
	If is a monotone increasing sequence that is bounded above, then the sequence must converge. If is a monotone decreasing sequence that is bounded below, then the sequence must converge. Proof

Using this result it is often easy to prove convergence of a sequence just by showing that it is bounded and monotone. The downside is that this method will not reveal the actual limit, just prove that there is one.

Examples 3.1.10:
	Prove that the sequences and converge. What is their limit? Define x1 = b and let xn = xn - 1 / 2 for all n > 1. Prove that this sequence converges for any number b. What is the limit ? Let a > 0 and x0 > 0 and define the recursive sequence xn+1 = 1/2 (xn + a / xn) Show that this sequence converges to the square root of a regardless of the starting point x0 > 0.

Theorem 3.1.11: The Pinching Theorem
	Suppose {aj} and {cj} are two convergent sequences such that lim aj = lim cj = L. If a sequence {bj} has the property that aj bj cj for all j, then the sequence {bj} converges and lim bj = L. Proof

Example 3.1.12:
	Show that the sequence sin(n) / n and cos(n) / n both converge to zero.