Apostol Calculus Vol1 10.4.29 Sequences

[dustbin]

Homework Statement

Assume that \{ a_n\}\rightarrow 0. Use the definition of limit to prove that \{ a_n^2\} \rightarrow 0.

Homework Equations

Definition of limit. For all ε>0 there exists N s.t. n>N implies |a_n - L|<ε.

The Attempt at a Solution

I know why this is true... if the sequence goes to zero then a_n<1. Therefore a_n^2 &lt; a_n &lt; 1. Then a_n^2 is bounded above by a_n and below by zero, so it also converges. Is this as simple as:

Assume that given an ε>0 we choose N s.t. for all n>N implies |a_n - 0|<sqrt(ε). Then since a_n &gt; a_n^2 we have |a_n^2|&lt;\varepsilon. Where L=0.

 

[LCKurtz]

Homework Statement

Assume that \{ a_n\}\rightarrow 0. Use the definition of limit to prove that \{ a_n^2\} \rightarrow 0.

Homework Equations

Definition of limit. For all ε>0 there exists N s.t. n>N implies |a_n - L|<ε.

The Attempt at a Solution

I know why this is true... if the sequence goes to zero then a_n<1.

Not quite. You weren't given $a_n$ nonnegative, nor is it true for all $n$. There exists $N>0$ such that $|a_n|<1$ if $n>N$.

Therefore a_n^2 &lt; a_n &lt; 1.

$a_n^2 < |a_n|<1$ if $n>N$.

Then a_n^2 is bounded above by a_n and below by zero, so it also converges. Is this as simple as:

Assume that given an ε>0 we choose N s.t. for all n>N implies |a_n - 0|<sqrt(ε). Then since a_n &gt; a_n^2 we have |a_n^2|&lt;\varepsilon. Where L=0.

Yes, it is pretty much that simple. Just write it up carefully.

 

[dustbin]

Okay, so how about:

Suppose that \{ a_n\}\rightarrow 0. Then given ε>0 there exists N s.t. |a_n|&lt;\sqrt{\varepsilon } whenever n>N. By hypothesis |a_n| &lt; 1 . Therefore a_n^2 &lt; |a_n| &lt; 1 and |a_n|&lt;\sqrt{\varepsilon } \Longrightarrow |a_n^2| &lt; \varepsilon . Therefore \{ a_n^2\} \rightarrow 0.

 

[LCKurtz]

Okay, so how about:

Suppose that \{ a_n\}\rightarrow 0. Then given ε>0 there exists N s.t. |a_n|&lt;\sqrt{\varepsilon } whenever n>N. By hypothesis |a_n| &lt; 1 . Therefore a_n^2 &lt; |a_n| &lt; 1 and |a_n|&lt;\sqrt{\varepsilon } \Longrightarrow |a_n^2| &lt; \varepsilon . Therefore \{ a_n^2\} \rightarrow 0.

Given the way you have started, which is good, why don't you just leave out everything in red?

 

[dustbin]

Ah I see. I am used to being overly detailed in explanations because my proof based class is a lower-div linear algebra course... we have to explain every possible detail.

Thank you for your help and insights!

 

[STEMucator]

Hm I see another way you could've done this.

You know : \forall ε&#039;&gt;0, \exists N&#039; \space | \space n&gt;N&#039; \Rightarrow |a_n - 0| &lt; ε&#039;

Simply because you are given that a_n → 0.

You want : \forall ε&gt;0, \exists N \space | \space n&gt;N \Rightarrow |a_{n}^{2} - 0| &lt; ε

So take what you want and massage it a bit :

|a_{n}^{2} - 0| = |a_{n}^{2}| = a_{n}^{2} ≤ ε \Rightarrow a_n ≤ \sqrt{ε}

Now choosing ε&#039; = \sqrt{ε}, what happens?

 

[dustbin]

Now choosing ε&#039; = \sqrt{ε}, what happens?

It implies that a_n^2 &lt; \varepsilon.


So now I am trying to extend this to;
Given \{a_n\}\rightarrow L show that \{a_n^2\}\rightarrow L^2. I have been playing around a bit and have come up with two ideas:

Making the standard assumption:
|a_n^2-L^2| = |a_n^2-a_nL-a_nL+L^2+a_nL-L^2+a_nL-L^2<br /> = |(a_n-L)^2 +2L(a_n-L)| &lt; \varepsilon ^2 + 2L\varepsilon.

I'm not 100% sure what can be done with that or that it implies anything based on the assumption that for n>N \{a_n\}\rightarrow L.

My other idea is this:

|a_n^2-L^2|=|a_n^2-a_nL+a_nL-L^2| \leq |a_n^2-a_nL|+|a_nL-L^2|<br /> =|a_n||a_n-L|+|L||a_n-L|<br />

If we now that \{a_n\}\rightarrow L and set up our hypothesis so that |a_n-L|&lt;\frac{\varepsilon}{2|L|} can we extend the stuff immediately above to |a_n||a_n-L|+|L||a_n-L| &lt; |a_n||\frac{ε}{2L}|+|L||\frac{ε}{2L}| &lt; |L||\frac{ε}{2L}|+|L||\frac{ε}{2L}| &lt; ε.

The above coming from the fact that the sequence is bounded by L.

 

[STEMucator]

It implies that a_n^2 &lt; \varepsilon.

Just like you wanted, right? So certainly we would have |a_{n}^{2} - 0| &lt; ε which would complete your proof.

Most of these styles of proofs involve stating the definition you already know is true ( Usually because you are given one of your limits to be true and you can take it for granted ) and then proving the definition you want is also true by using the assumed definition.

As for your second question :

You know : \forall ε&#039;&gt;0, \exists N&#039; \space | \space n&gt;N&#039; \Rightarrow |a_n - L| &lt; ε&#039; ( This is your given limit you can take for granted ).

You want : \forall ε&gt;0, \exists N \space | \space n&gt;N \Rightarrow |a_{n}^{2} - L^2| &lt; ε ( This is the limit you want to prove by using the limit you're taking for granted.

I'll also tell you that your 'other idea' is the path you want to take.

 

[jbunniii]

The above coming from the fact that the sequence is bounded by L.

No, this isn't necessarily true. a_n \rightarrow L does not imply |a_n| \leq |L|. Fortunately, you don't need |a_n| to be bounded by |L|. You just need it to be bounded by SOME bound, say M. And this IS true: a convergent sequence is bounded. (Can you prove it?)

 

[dustbin]

Thanks for the replies! I've thought about them and this is what I have come up with:

By hypothesis \{a_n\}\rightarrow L. Since the limit of a_n is L, we may chose N_2 such that \forall n&gt;N_2 \Longrightarrow |a_n|&lt;|L|+1. Furthermore, given ε>0 we may choose N_1 such that

\forall n&gt;N_1 \Longrightarrow |a_n-L|&lt; \frac{\varepsilon}{2|L|+1} .

Choose N=max(N_1,N_2).

Then
\forall n&gt;N \Longrightarrow |a_n^2-L^2|\leq |a_n-L|(|a_n|+|L|) \mbox{by triangle inequality} &lt; \frac{\varepsilon}{2|L|+1}(|a_n|+|L|)&lt; \frac{\varepsilon (2|L|+1)}{2|L|+1} = \varepsilon.

I appreciate your feedback! Thanks much.