Lecture 10 - More on Sequences

Last time we talked about the idea of being pedantic with sequences (and consequently series). We needed to be careful about our definition of Convergence of a Sequence:

Convergence of a sequence

A Sequence (an) of real numbers converges to some LR if:
ε>0NNnN(|anL|<ε)

Geometrically this is saying:

Given some error ε, you can always choose a start point in the sequence an at point N such that all further terms are within the range of anL and an+L .

We write:
L=limnan=limananL
when L is the limit of (an).

If L then we say (an) diverges; namely if (an) doesn't converge then it diverges.

Thus we get the Epsilon-Neighborhood for each limit L (or a for that note):

ε-neighborhood of a

Vε(a)=(aε,a+ε)={xR||xa|<ε}

More Notes on These

The definition of Convergence of a Sequence anL involves nested quantifiers. Namely we have where each of these quantifiers are being nested. For the definition for convergence we have:

(ε>0)(NN):nN|anL|<ε

The important thing here is that you construct your N based on ε, so N=f(ε) for some function on ε. The idea here is that we really need to work backwards here; the smaller the ε the bigger the N (so you'll use some inverse relationship most likely).

Example

Let an=n+2n+5. Show that an1.

Proof
Let ε>0. This will always be your first statement.

Scratch

We need to magically pull out an N out of our a** to be done. We have to do some scratch work here. We know that we want:

|an1|<ε

Now try to work backwards to get a result of nN:

|an1|<ε|n+2n+51|<ε|3n+5|<ε3n+5<ε(n+5>0)3ε<n+53ε5<n

But look! All we need is to construct some integer bigger than 3ε5 and we are done. As such, choose N>3ε5.

The Proof

Choose NN such that N>3ε5 (notice that N,ε are inverses, which is a good sign). We can always choose this N via the Cantor's Approach#^5404f9. Suppose that nN>3ε5 in this case:

|an1|=|n+2n+51|=|n+2n+5n+5n+5|=|3n+5|3N+5nN<3(3ε5)+5=ε

Thus |an1|<ε so we are done.

We don't want to always prove that limits of specific sequences like our an above have specific limits L. Instead, we'll want to prove some theorems and laws so that we can use those instead of the limit proof directly.

For example see how we can prove that Limits are Unique:

Unique Limits

If a sequence has a limit, then the limit is unique.

Proof
Let ana and anb are both true. We want to show that a=b. We know that then ε>0NN(|ana|<ε) and ε>0NN(|anb|<ε).

Here let ε>0 (I know we aren't proving convergence, but we want to prove that |ab|<ε since then a=b. If you're confused see Least Upper Bounds and Greatest Upper Bounds and namely the Suprema Lemma for context). Since ε>0, and thus ε2>0 then there are N1N such that for all nN1 that |ana|<ε2 (why not just ε? Later we'll have to add two $\varepsilons in the worst case, so then we need half of this to show that it's still possible). Similarly there is a N2N where for all nN2 then |anb|<ε2.

Now with that then:
|ab|=|(aan)+(anb)||aan|+|anb|Triangle Inequality=|ana|+|anb|<ε2+ε2=ε
Thus |ab|<ε so then a=b as required.