What is the Bound for ∑an2 and Why?

  • Thread starter Thread starter saddlepoint
  • Start date Start date
  • Tags Tags
    Proof
saddlepoint
Messages
6
Reaction score
0

Homework Statement



Show if an > 0 for each n\inN and if ∑an converges, then ∑an2 converges and that ∑1/an diverges.

NB. all ∑ are between n=1 and ∞

Homework Equations





The Attempt at a Solution



Let partial sums of ∑an2 be Sk = a1 + ... + ak

To say ∑an2 is absolutely convergent is to say ∑|an2| is convergent.

It follows that partial sums Tk = |a12| + |a22| + ... + |ak2| of the series are bounded above by M.

Then by an extended form of the Triangle Inequality we have:

|Sk|

= a12 + a22 + ... + ak2

≤ |a12| + |a22| + ... + |ak2|

= Tk

≤ M

Hence the sequence {|Sk2} is bounded above by M. It is bounded below by 0 as an > 0 so an2 > 0. Therefore it is bounded.

It is therefore convergent.

Is this correct so far? Would a similar proof follow for showing ∑1/an is divergent?

Can anyone help with this please? :redface:
 
Physics news on Phys.org
I think you're missing a simple solution. Think of what happens to a_n as n gets large.

I don't follow your proof. (How are you using the convergence of the series a_n?)
 
saddlepoint said:

Homework Statement



Show if an > 0 for each n\inN and if ∑an converges, then ∑an2 converges and that ∑1/an diverges.

NB. all ∑ are between n=1 and ∞

Homework Equations





The Attempt at a Solution



Let partial sums of ∑an2 be Sk = a1 + ... + ak

To say ∑an2 is absolutely convergent is to say ∑|an2| is convergent.

It follows that partial sums Tk = |a12| + |a22| + ... + |ak2| of the series are bounded above by M.

What is ##M## and why does it bound the ##T_k##?
You have only established that ##\sum a_n^2## being absolutely convergent is the same as saying that ##\sum|a_n|^2## converges. But you have not established the fact that ##\sum a_n^2## actually absolutely converges!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top