Question #184017

Let a be a sequence of real numbers and let c ∈ R be a cluster point of a.

Let π:N → N be defined by

π(1) = min{k∈N||ak −c|<1},

π(n+1) = min{k∈N|k>π(n), |ak −c|< 1 } foralln∈N. n+1

(i) Justify the definition of π. (i.e Show that π is well defined.) (ii) Show that π is strictly increasing.

(iii) Prove that the subsequence (aπ(n))N of a converges to c


1
Expert's answer
2021-05-04T13:14:59-0400

Solution :-


Let an be the sequence of real numbers

And c ϵ\epsilon R

Π:NN\Pi : N\rightarrow N

Π(1)=min[KϵNakcI<1]\Pi(1) = min{[K\epsilon N || ak-c I < 1]} ,

Π\Pi (n+1) = min[k∈N|k>Π\Pi (n), |ak −c|< 1 ] for

all n∈N. n+1



(i) as we can see Π\Pi is defined :NN: N\rightarrow N


and minimum value of function Π\Pi comes in Π(1)=min[KϵNakcI<1]\Pi(1) = min{[K\epsilon N || ak-c I < 1]} ,

and also we can see that Π\Pi (n+1) = min[k∈N|k>Π\Pi (n), |ak −c|< 1 ] for

all n∈N. n+1

we can say that Π\Pi is well defined in the given interval


(ii) we can say that , when we do differentiation of the an and Π\Pi is well defined in the given interval

interval is given for Π\Pi

Π:NN\Pi : N\rightarrow N

Π(1)=min[KϵNakcI<1]\Pi(1) = min{[K\epsilon N || ak-c I < 1]} ,

Π\Pi (n+1) = min[k∈N|k>Π\Pi (n), |ak −c|< 1 ] for

all n∈N. n+1

we can say it is differentiaval in the given interval , by differentiation function Π is strictly increasing function


(iii)

 (aΠ\Pi (n))N of a converges to c

as we have limits and we can see that

Π:NN\Pi : N\rightarrow N

Π(1)=min[KϵNakcI<1]\Pi(1) = min{[K\epsilon N || ak-c I < 1]} ,

Π\Pi (n+1) = min[k∈N|k>Π\Pi (n), |ak −c|< 1 ] for

all n∈N. n+1

by this we can see that every bounded function is convrgence function

{an}n∈N is convergent. Then by Theorem we know that the limit is unique and so we can write it as l

limnan=llim_{n\rightarrow \infin}a_n=l

or anla_n \rightarrow l

as nn \rightarrow \infin

by this we have proved that  the subsequence (aΠ\Pi (n))N of a converges to c , AS c ϵR\boxed{c \space\epsilon R}



Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS