Cesaro summability implies bounded partial sums

stripes
Messages
262
Reaction score
0

Homework Statement



Suppose c_{n} > 0 for each n\geq 0. Prove that if \sum ^{\infty}_{n=0} c_{n} is Cesaro summable, then the partial sums S_{N} are bounded.

Homework Equations



--

The Attempt at a Solution



I tried contraposition; that was getting me nowhere. I have a few inequalities here and there but they don't tell me anything. I need to show that there exists an upperbound for the partial sums. This means there exists a least upperbound. I need to find that least upperbound. Becausec_{n} > 0 for each n\geq 0, then the series is nondecreasing, which means the partial sums are nondecreasing, so we are looking for an upperbound, not a lowerbound.
 
Physics news on Phys.org
stripes said:

Homework Statement



Suppose c_{n} > 0 for each n\geq 0. Prove that if \sum ^{\infty}_{n=0} c_{n} is Cesaro summable, then the partial sums S_{N} are bounded.

Homework Equations



--

The Attempt at a Solution



I tried contraposition; that was getting me nowhere. I have a few inequalities here and there but they don't tell me anything. I need to show that there exists an upperbound for the partial sums. This means there exists a least upperbound. I need to find that least upperbound.

That least upper bound, if it exists, is \lim_{n \to \infty} S_n, which is the definition of \sum_{n=0}^{\infty} c_n in the traditional sense.
 
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