Can the sum of a zero sequence be bounded?

  • Thread starter Thread starter raphael3d
  • Start date Start date
  • Tags Tags
    Proof
raphael3d
Messages
45
Reaction score
0
proof with the definition of the limit the following assertion: if a_n is a zero sequence, so is b_n with b_n = (1/n)* sum{a_j} [from j=1 to n].

at first glance it seems trivial to me, since 1/n is a zero sequence so is b_n but apparently this doesn't satisfy the implication so how can i show that if a_n is a zero sequence, so b_n?
 
Physics news on Phys.org
seems so at first glance, let me think for any contradictions..
 
By a zero sequence do you mean its like {0, 0, 0, 0, 0...} or it converges to 0 as n\rightarrow\infty
 
Almost there...
1/n is a zero sequence so too is C/n for any constant C
consider C such that ||a_n||<C for all n (where ||a_n|| is the size of a_n
 
Last edited:
raphael3d said:
proof with the definition of the limit the following assertion: if a_n is a zero sequence, so is b_n with b_n = (1/n)* sum{a_j} [from j=1 to n].

at first glance it seems trivial to me, since 1/n is a zero sequence so is b_n but apparently this doesn't satisfy the implication so how can i show that if a_n is a zero sequence, so b_n?

Even though \{a_{n}\} might be a zero sequence, the sequence of partial sums:

<br /> S_{n} = \sum_{j = 1}^{n} {a_{j}}<br />

might not be convergent. A typical example is the harmonic series, which is divergent. So, if \{b_{n}\} is a zero sequence and S_{n} is divergent, you will get an indefinite form 0 \cdot \infty and it is not that trivial to show that this is a finite number.
 
Dickfore said:
...
That is needlessly complicated. It is trivial to show. S_n (which need not even be considered) may diverge, but it diverges like 1 thus S_n/n converges. It is like saying we need to consider an indeterminant form to decide if {1,1,...} converges since 1=n/n and n diverges, there is no such need.
 
Last edited:
lurflurf said:
That is needlessly complicated. It is trivial to show. S_n (which need not even be considered) may diverge, but it diverges like n thus S_n/n converges. It is like saying we need to consider an indeterminant form to decide if {1,1,...} converges since 1=n/n and n diverges, there is no such need.

Actually, you need to prove that S_{n} = o(n), n \rightarrow \infty, so that b_{n} would be a zero sequence.
 
Last edited:
1/n has limit 0, so per definition has b_n ( 0*the sum).
but the question is an implication, if a_n then b_n.

|a_n - 0| <= delta for all n >= N (limit 0, zero sequence)

the question is, is the sum of all the terms of the sequence a zero sequence, therefore limit 0.
 
(a is the limit):

choose delta so that |a_n - a| <= delta/n

so for the last two terms of the sum:

a_n+a_n-1 <= |a_n + a_n-1| =|a-(a-a_n)+a_n-1| <= |a_n -a| + |a_n-1 - a| < 2*delta/n (a=0 for the limit)

and this applies for the rest of the sum a_j so sum{a_j} [from j=1 to n] < delta
so far its convergence.
is this argumentation valid?
anyway, how can i show that its limit is zero (with the factor 1/n)?
 
  • #10
suppose (as we know since {a_n}->0)
for all epsilon>0 there exist an integer N (which may depend onepsilon) such that for all n>N
||a_n||<epsilon
b_n=(1/n)(a_1+a_2+...a_(n-1)+a_N+a_(N+1)+a_(N+2)+...+a_(n-1)+a_(n))
b_n=(1/n)(N*b_N+a_(N+1)+a_(N+2)+...+a_(n-1)+a_(n))
||b_n||=||(1/n)(N*b_N+a_(N+1)+a_(N+2)+...+a_(n-1)+a_(n))||
||b_n||<=(1/n)(||N*b_N||+||a_(N+1)||+||a_(N+2)||+...+||a_(n-1)||+||a_(n)||)
||b_n||<=(1/n)(||N*b_N||+(n-N)epsilon)
 
Last edited:
  • #11
lurflurf said:
b_n=(1/n)(a_1+a_2+...a_(n-1)+a_N+a_(N+1)+a_(N+2)+...+a_(n+1)+a_(n+2))

is this equivalent with the decleration b_n=(1/n)(a_1+a_2+...+a_n) ?
anyway i am not able to follow that, its likely a trivial fact which i cannot see, but someone could explain, please.
 
  • #12
raphael3d said:
is this equivalent with the decleration b_n=(1/n)(a_1+a_2+...+a_n) ?
anyway i am not able to follow that, its likely a trivial fact which i cannot see, but someone could explain, please.

Yes it should have been the same, but for my error. The idea is all the a_k past some point are small, so the arithmatic average can be made small though a combination of making some elements small and making the nonsmall elements few.
 
  • #13
jakncoke said:
By a zero sequence do you mean its like {0, 0, 0, 0, 0...} or it converges to 0 as n\rightarrow\infty

IMO "zero sequence" should mean 0,0,0,\ldots only, but I guess it means a sequence a_1,a_2,a_3,\ldots such that a_n\to 0 now...

Are you guys sure that that's standard terminology?
 
  • #14
is this a trivial proof?

bobn said:
seems so at first glance, let me think for any contradictions..

You cannot justify a claim being trivial by not finding a counter example! :-p You mean the claim seems true, but you are thinking about counter examples just in case there might be some?

Dickfore said:
...you will get an indefinite form 0 \cdot \infty and it is not that trivial to show that this is a finite number.

This answers the original question. The correct answer is that the claim is not trivial.

But it seems that the actual claim is true anyway... even though it's not trivial.
 
  • #15
well, the original question was to show the implication if a_0 then b_0.
although b_0 is a zero sequence because of the zero sequence factor (1/n), one has to show that the sum of a_k is bounded so that b_n does not grow arbitrary. the trick is to rearrange the sum properly but i didnt manage that sofar.
 
Back
Top