0% found this document useful (0 votes)
6 views5 pages

Analysis Assignment 1

The document presents a mathematical analysis assignment discussing convergence of sequences and limits. It includes detailed proofs and theorems regarding the behavior of sequences, particularly focusing on supremum and infimum properties. The assignment is authored by Rajeeva L. Karandikar and Soham Chatterjee, with specific roll numbers provided.

Uploaded by

Vũ Nhật Huy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views5 pages

Analysis Assignment 1

The document presents a mathematical analysis assignment discussing convergence of sequences and limits. It includes detailed proofs and theorems regarding the behavior of sequences, particularly focusing on supremum and infimum properties. The assignment is authored by Rajeeva L. Karandikar and Soham Chatterjee, with specific roll numbers provided.

Uploaded by

Vũ Nhật Huy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Analysis Assignment 1

- Rajeeva L. Karandikar
Soham Chatterjee
Roll: BMC202175

1
1. (i) We know that if bn = sup{ai | i ≥ n. i, n ∈ N} then α = lim bn . Hence ∃ N ∈ N such that
n→∞

|bn − α| <  =⇒ α −  < bn < α + 

for all n > N . Since α −  is less than supremum of the set {ai | i ≥ n, i, n ∈ N} there exists a
am where m ≥ n such that

α −  < am ≤ bn =⇒ α −  < am < α + 

Here m ≥ n > N =⇒ m > N . Now if we take max{N, k} = N1 , for all n > N1 , α− < bn < α+
and hence there exists a term of the sequence am where m ≥ n such that the inequality

α −  < am ≤ bn < α + 

satisfies where m ≥ n > N1 ≥ k. Hence ∀ k < ∞ and  > 0 ∃ m > k such that

α −  < am < α + 

(ii) Using the statement of previous problem ∀ > 0 and k < ∞ where k ∈ N ∃ m > k such that

α −  < am < α + 

Now given that ∃ {nj | 1 ≤ j ≤ t} where n1 < n2 < · · · < nt , t ∈ N such that
1 1
α− < anj < α +
j j
1
where j ∈ {1, 2, · · · , t}. Now if we choose  = t+1 and k = nt + 1 there exists m > k such that

1 1
α− < am < α +
t+1 t+1
Now take m = nt+1 then we have nt+1 > nt which satisfies the inequality
1 1
α− < ant+1 < α +
t+1 t+1
(iii) Using the statement in problem (i) we can say that for k1 = 1 and 1 = 1 there exists m > k1
such that
α − 1 < am < α + 1
Take m = n1 . Now if we choose k2 = m and 2 = 21 using the statement in previous problem
there exists a m0 > k2 such that
1 1
α − < am0 < α +
2 2
Take this m0 = n2 . Now if there exists {nj | 1 ≤ j ≤ t} where t ∈ N and n1 < n2 < · · · < nt such
that
1 1
α − < anj < α +
j j
j ∈ {1, 2, · · · , t} there exists nt+1 > nt such that the following inequality satisfies
1 1
α− < ant+1 < α +
t+1 t+1
Hence by Mathematical Induction we can say that ∀ k ∈ N there exists ank+1 > ank such that
1 1
α− < ank+1 < α +
k+1 k+1

2
Hence we get a sequence {ank } where nk > nk−1 such that ∀ k ∈ N

1 1
α− < ank < α +
k k
Hence the sequence {ank } converges to α. Therefore ∃ {nj | j ≥ 1} such that nj < nj+1 where
j ≥ 1 such that
lim anj = α [Proved]
j→∞

(iv) First take the sequence {cn }. Let c = lim sup cn . Therefore using the statement in previous
n→∞
problem we can say that ∃{nj | j ≥ 1. j ∈ N} such that nj < nj+1 where j ≥ 1 such that

lim cnj = c
j→∞

Given that any subsequence of the sequence {cn } converges to θ. Therefore we can say θ = c.
Now consider the sequence |−cn . Suppose d = lim sup(−cn ). Hence ∃{mj | j ≥ 1, j ∈ N}
n→∞
such that mj < mj+1 where j ≥ 1 such that

lim (−cmj ) = d
j→∞

Let bn = sup{(−ck ) | k ≥ n, k, n ∈ N}. Hence bn ≥ (−ck ) ∀ k ≥ n. Hence −bn ≤ ck


∀ k ≥ n. Hence −bn = inf{ck | k ≥ n}. Hence

−d = − lim sup(−cn ) = − lim bn = lim (−bn ) = lim inf cn


n→∞ n→∞ n→∞ n→∞

Therefore ∃{mj | j ≥ 1, j ∈ N} such that mj < mj+1 where j ≥ 1 such that

lim cmj = −d = lim inf cn


j→∞ n→∞

As any subsequence of the sequence {cn } converges to θ we can say −d = θ. Therefore

lim sup cn = lim inf cn = θ


n→∞ n→∞

Hence we can say


lim cn = θ
n→∞

2. (i) Given that {bn } is a decreasing sequence. Therefore b1 ≥ b2 ≥ b3 ≥ · · · . Now wk = uk +1 = 2k +1


and vk = 2k+1 hence there are exactly 2k terms from wk to vk . Now bwk ≥ bn for all n ≥ wk .
Therefore
Xvk Xvk
bj ≤ bwk = 2k bwk
j=wk j=wk

Again bvk ≤ bn for all n ∈ {1, 2, · · · , vk }. Hence


vk
X vk
X
bj ≥ bvk = 2k bvk
j=wk j=wk

Therefore
vk
X
2k bvk ≤ bj ≤ 2k bwk
j=wk

3

P k
P
(ii) As {bn } is a decreasing sequence. Therefore b1 ≥ b2 ≥ b3 ≥ · · · . Now bn = lim bn . Let
n=1 k→∞ n=1

2m < k ≤ 2m+1 where k ∈ N. Suppose Now suppose 2n b2n converges. Then
P
n=1

k
X 2i+1
X−1 2m+1
X−1
bn ≤ b1 + (b2 + b3 ) + (b4 + b5 + b6 + b7 ) + · · · + bn + · · · + bn
n=1 n=2i n=2m
2i+1
X−1
k k
!
X X
=⇒ bn ≤ bn
n=1 i=1 n=2i
2i+1
X−1
k m
!
X X
=⇒ bn ≤ b2i
n=1 i=0 n=2i
k
X m
X
=⇒ bn ≤ 2i b2i
n=1 i=0

Therefore

X k
X k
X ∞
X
bn = lim bn ≤ lim 2n b2n = 2n b2n
k→∞ k→∞
n=1 n=1 n=0 n=0
∞ ∞
2n b2n converges.
P P
Hence bn converges as
n=1 n=1

P
Now suppose bn converges. Then
n=1

i+1 m
k
X 2X 2
X
bn ≥ b1 + b2 + (b3 + b4 ) + · · · + bn + · · · + bn
n=1 n=2i +1 n=2m−1 +1
k
X 1
=⇒ b1 + b2 + 2b4 + · · · + 2i b2i+1 + · · · + 2m−1 b2m
bn ≥
n=1
2
k
" m−1 #
X 1 X i
=⇒ bn ≥ 2 b2i+1
n=1
2 i=0

Therefore
∞ k
" k−1 # " k−1
# " ∞ #
X X 1 X n 1 X
n 1 X n
bn = lim bn ≥ lim 2 b2n+1 = lim 2 b2n+1 = 2 b2n+1
k→∞ k→∞ 2 2 k→∞ n=0 2 n=1
n=1 n=1 n=0
"
∞ ∞
2n b2n+1 converges as
P P
Hence bn converges.
n=1 n=1
∞ ∞
2n b2n converges. [Proved]
P P
Therefore bn converges if and only if
n=1 n=1

1
P
(iii) Let p > 1. Using the statement in the previous problem we can say that np converges if and
n=1

2n (2n1 )p converges. Now
P
only if
n=1
∞ ∞ ∞
X 1 X X
2n = 2n(1−p) = (21−p )n
n=1
(2n )p n=1 n=1

4

As p > 1, 1 − p < 0 hence 21−p < 1. Hence (21−p )n is a geometric series which converges and
P
n=1
∞ ∞
2n (2n1 )p converges. Hence 1
P P
therefore np converges.
n=1 n=1
∞ ∞ ∞
1
2n (2n1 )p = 2n(1−p) . converges. Now if p ≤ 1 then
P P P
Let np converges. Therefore
n=1 n=1 n=1
1 − p ≥ 0. Hence

X ∞
X ∞
X k
X
2n(1−p) ≥ 2n·0 = 1 = lim 1 = lim k
k→∞ k→∞
n=1 n=1 n=1 n=1
∞ ∞
1 1
P P
Now lim k diverges. Then np will also diverge but we said that np converges. Contra-
k→∞ n=1 n=1
diction. Hence p > 1.

1
P
Therefore np converges if and only if p > 1. [Proved]
n=1

You might also like