Show that \frac{1}{n}\sum_{j=1}^{\infty}(1-p_{j})^{n})\rightarrow0 as n\rightarrow\infty

John Stewart

John Stewart

Answered question

2022-01-15

Show that 1nj=1(1pj)n)0 as n

Answer & Explanation

Corgnatiui

Corgnatiui

Beginner2022-01-16Added 35 answers

Step 1
From the inequality that OP observed, we get
(1pj)nmax{1npj,0}
and hence
1(1pj)nmin{npj,1} From this, we get
1nj=1(1(1pj)n)j=1min{pj,1n}
Since the jth summand of the last sum is always bounded by pj and j=1pj converges, by the dominated convergence theorem
limnj=1min{pj,1n}=j=1=j=1limnmin{pj,1n}=j=1min{pj,0}=0
So by the squeezing theorem,
limn1nj=1n(1pj)n)=0
intacte87

intacte87

Beginner2022-01-17Added 42 answers

Step 1
Applying the Stolz-Cesaro theorem, we have to compute
limn[j=1(1(1pj)n+1j=1(1(1pj)n)]
=limnj=1pj(1pj)n
From the given sum it follows that pj1. Thus, 0pj(1pj)npj
and we know j=1pj converges. This implies that we can switch the limit and the summation in the previous line.
limnpj(1pj)n=0
limnj=1pj(1pj)n=j=10=0
alenahelenash

alenahelenash

Expert2022-01-24Added 556 answers

Step 1 I think your bound suffices! In fact, we have that 1nj=k+1(1pj)n)1nj=k+1npj=j=k+1pj This way, for each k we can bound the total sum as 1nj=1(1(1pj)n)=1nj=1k(1pj)n)+1nj=k+1(1(1pj)n) 1n|sumj=1k1+j=k+1pj =kn+j=k+1pj Now, the result follows by truncating. Fix ϵ>0. Take k>0 such that the sum j=k+1pj is less than ϵ2, and then take n>2kϵ. The computation from above shows that 1nj=1(1pj)n)ϵ2+ϵ2=ϵ which proves the statement.

Do you have a similar question?

Recalculate according to your conditions!

New Questions in Analysis

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?