Ask your own question, for FREE!
Mathematics 18 Online
OpenStudy (anonymous):

question set 2

OpenStudy (anonymous):

OpenStudy (anonymous):

question f ) show that every monotonic decreasing sequence which is bounded below ,is convergent

OpenStudy (anonymous):

@BSwan

OpenStudy (anonymous):

ok i found my old precious txt book of real analysis xD and it happend that this is a thm wanna meto type the proof ?

OpenStudy (anonymous):

take snap n post ne?

OpenStudy (anonymous):

my web cam is not working :O something wrong with its sitting ill type it

OpenStudy (anonymous):

oh okay

OpenStudy (anonymous):

its called MONOTONE CONVERGENCE THEOREM wait i might have a pdf ...

OpenStudy (anonymous):

okay

OpenStudy (anonymous):

lolz in book it only proved increasing xD decreasing =exercise xD

OpenStudy (anonymous):

oi you jumped to last question? :P see the image

OpenStudy (anonymous):

i thought u only wanted f

OpenStudy (anonymous):

no it wasnt clear,so i wrote it again

OpenStudy (anonymous):

sweet thanks

OpenStudy (anonymous):

ok "a" is sandwich thm for limit of a function , state the thm then apply it

OpenStudy (anonymous):

got it next/

OpenStudy (anonymous):

b- \(\lim_{n \rightarrow \infty} \text{inf } x_n\le \lim_{n \rightarrow \infty} \text{sup } x_n\) this need a proof :P do u know wats the sup and inf ?

OpenStudy (anonymous):

they would be two cases for \(x_n\) 1_ increasing 2_ decreasing

OpenStudy (anonymous):

supremum n infimum,well not much..not as in i'd use them as data for solution

OpenStudy (anonymous):

u should know the def of both :O why jugdar why u dnt know them :'(

OpenStudy (anonymous):

oh its not like i dont know? partialy ordered set's subset's greatest element is infimum?

OpenStudy (anonymous):

ok ill give u example :- let T be a set (5,8) then we would say \(S_1 \) is the least element of T \(S_1 \subset \) T so we would know S_1 would have elements like 5.0001 , 5.00001...ect then the inf =5 ( the least of the least ) which is the smallest elemnt of all \(S_1\)

OpenStudy (anonymous):

sorry imade a typo lim inf =5 cuz 5 not in T

OpenStudy (anonymous):

inf can be any number close to that

OpenStudy (anonymous):

oh the least one

OpenStudy (anonymous):

so inf of {1,2,3} would be 1,like that

OpenStudy (anonymous):

and sup would be 3

OpenStudy (anonymous):

yep, but u gave a distent set ( which is not familior to be given ) lolz

OpenStudy (anonymous):

try with seq like 1/x or stuff

OpenStudy (anonymous):

ok -.- so how do we solve this one

OpenStudy (anonymous):

by contradiction and epsilon delta def XD

OpenStudy (anonymous):

...

OpenStudy (anonymous):

okay so again u'd be trying to prove inverse but it contradicts so the given must be true?

OpenStudy (anonymous):

i hv to go out n buy some stuff -.- i will cya in 2 hours maybe :) thanks for helping me <3

OpenStudy (anonymous):

ok ill type the proof ^_^ for any \(X_n\) sup \( x_n \le\text{ inf } x_n\) so for all x\(\in\) upper bound inf < =x then limit inf <= x limit inf <= sup so for all x\(\in\) lower bound sup < =x then limit sup >= x limit sup >= inf>=limit inf limit sup >=limit inf

OpenStudy (anonymous):

oh these all are so easy answers wish i was tought these again,wouldnt even take lots of time to teach some basics

OpenStudy (anonymous):

how to prove c

OpenStudy (anonymous):

ok could u type the cauchy deff for me ?

OpenStudy (anonymous):

if <Xn> is sequence in R then it is cauchy sequence if ∀ϵ∈R:ϵ>0:∃N:∀m,n∈N:m,n≥N:|xn−xm|<ϵ

OpenStudy (anonymous):

if ϵ>0 is given we choose a natural number H = H(ϵ) such that H>2/ϵ , then if m,n >= H we have \(\large \frac{1}{n^2}\le 1/H < \frac{ϵ}{2}\) and similary \(\large \frac{1}{m^2} < \frac{ϵ}{2}\) therefore it follows that if m,n \(\geq H\) then :- \(\large |\frac{1}{n^2}-\frac{1}{m^2}| \le \frac{1}{n^2}+\frac{1}{m^2} <\frac{ϵ}{2} +\frac{ϵ}{2} =ϵ\) since ϵ > 0 is arbitrary , then 1/n^2 is a cauchy sequence

OpenStudy (anonymous):

wew !

OpenStudy (anonymous):

thats easy :O

OpenStudy (anonymous):

ikr :)

OpenStudy (anonymous):

will keep this proof in ur mind and only change the seqence lol but the rest of the proof would be the same each time :P

OpenStudy (anonymous):

yeah :D

OpenStudy (anonymous):

ok rest i knw

OpenStudy (anonymous):

thanks ^^

OpenStudy (anonymous):

cool :) np lol

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!