Scribd
Upload
15 views

sequences_proofs

The document provides a detailed explanation of convergence in sequences, defining it mathematically and discussing properties such as uniqueness of limits and rules for limits of sums, differences, products, and quotients. It also introduces the concept of Cauchy sequences and establishes that every convergent sequence is a Cauchy sequence, along with the converse. Additionally, it presents the Sandwich Theorem and various cases for convergence based on the value of x in sequences.

Uploaded by

Phanindra M 10A-43
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
15 views

sequences_proofs

The document provides a detailed explanation of convergence in sequences, defining it mathematically and discussing properties such as uniqueness of limits and rules for limits of sums, differences, products, and quotients. It also introduces the concept of Cauchy sequences and establishes that every convergent sequence is a Cauchy sequence, along with the converse. Additionally, it presents the Sandwich Theorem and various cases for convergence based on the value of x in sequences.

Uploaded by

Phanindra M 10A-43
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 15
Definition of Conve In some textbooks, the following definition is used for convergence. Pimms The sequence {an} converges to the number L if for every positive number © there corresponds a positive integer N such that for all n, n>N => |ay—Ll NV instead of n > N. When n > N we mean, we are whereas m > N we mean, we concerned about the terms of the sequence from IV +1 onwards ‘are concerned about the terms of the sequence from IN onwards. This does not affect the choice of WN. You will understand that the convergence divergence of a sequence which does not depend on first finitely many terms. A finite term can be a number (distance) from NITK to any city in India, in milimeters, Every convergence sequence has a unique point. That is, if {an} is a sequence of real numbers and, if La and Le are numbers such that anol, and an, lo, then ain In other words, a sequence cannot converge to more than one limit. We would like to show that |L1 — La| 0. Why is this useful ? For every © > 0, if we have |Li — Lo| 0.] How to show |L; — Lo| << for every «> 0? We have Iki — Lo) [Lt — ap + an — Lol S [an — Li] + [an — bol. A In order to show |L1 — Lo| 0 be given. Since a, —> Li, there is a positive integer Ny such that lan — La] <¢/2. forall n> My. Similarly, as an —> Lo, there is a positive integer Np such that Jan — Lo| < /2 for all n > No. Now, for V > max{Ni, No}, [lr — Lo] = [la — an+ an — Lol San — La| + Jan ~ bo < ¢/2+e/2=e. Hence 0<|Li-b| <2, foreverye > 0. () But if < is chosen to be “442! we get a contradiciton with (1). Thus, the sequence cannot converge to two limits. Note : In the above proof, we considered a partition of = as § + 5. If we consider the partition as 35 + {g5» we may get the some natural numbers M, and Mp (may be different from Nj and Np) satisfying inequalities. numbers. The following rules hold if lim a, = A and lim by = B. 1. Sum Rule : lim (an + bn) =A+B 2. Difference Rule: lim (an ~ bn) = A~B 3. Product Rule: lim (ap-bn) = A.B nto 4. Constant Multiple Rule: lim (k.b,)=.B (any number k) . pe an A 5. Quotient Rule : it =B if by #0 for all n and B40 Rough Work (nat necessarily to be written in exam) We have to find 2 positive integer NV such that [(@n-t Bo) = (A+ B)| <2 for all n> Nv Let © > 0 be given. | From the triangle inequality, we have | Ian + Ba) = (A+ B)| < |an~ Al + [bs ~ Bl Hence we can apply the defintion for #/2, for the sequences {25} and {bo} converging to A and B respectively Since an > A and by —> B, there are positive integers Ny and Nz respectively, such that an —Al <5 for alla > M% and for all n> No. Thus for all n > N= max{ Mi, No}, \(@n ~ bn) —(A=B)| San — Al + |bn ~ Bl on Hence {an — bn} converges to A— B. Proof (Product Rule) Let ¢ > 0 be given. ‘Rough Work (not necestarly to be writen i exam) Weave to find postive integer N'such that |ayby AB] < © forall n> N. 1B + ag68— AB| A and by —» B, there are positive integers Ny and Ne respectively, such that lan A Ny and € [bo B| <= for all n> No. Thus for all a > N= max{ Ny, Np}, |anbn — AB] = |anbp — anB + anB — AB| S_ |2n| [bo ~ Bl +|an ~ Al |B) SC |bn ~ B\ + |an —A| |B} < fa Case 2: B is zero Rough Work (not necessarily to be written in exam) We have to find a positive integer NV such that |anb, —0| <© for all n> N. From the triangle inequality, we have |a,b, — 0| = |an| |bn — 0). Hence one can apply the "s — MN" defintion for the sequence {bn} converging to 0. Since b, + B, there is a positive integer Ny such that |b —0| < c for all n> Ny. Thus for all n> Ni, lanby —0| = |an| |bn — 0| < C\bn— 0} <6 Hence {anb,} converges to 0 when B = 0. iret The next theorem is the sequence version of the Sandwich Theorem cue CRC WAS een une tous Let {an}, {Bn} and {cn} be sequences of real numbers. If an < Bn < Cn holds for all n beyond some index N, and if lim an = lim ty = then lim bn = L also. Since a, —+ L and cn —> L, there are positive integers Ni and No respectively, such that L-eM and Loe Np. Given that an by N. Thus for all n> N3 = max{Ny, No, N}, Lae < ag S by Seq N. Hence {ba} converges to L. Caan oo Let yi =1+ hy where hy > 0. Then for all n, (since hy > 0), we have n= (14 hy)? = 1 mhg + MOD yey eg ms MO Dig Hence h2 < for all n> 2, 0 |hgl < \/z2z, for all n> 2. Let ¢ > 0 be given. Then [Pal < 1+ 2/e? For any positive integer N greater than 1 +2/c?, we have lym 1)=|h,| N. Hence (/n— 1 Case: 0 1. Let y= 1+ hy, when hy > 0. y= Cem at ay ED > Lt Ahn (since fn > 0), forall So hy < %4, for all n. Let © > 0 be given. Then |hy| <%2 < ©, when n> 42, For any postive integer N greater than, #1 = 42-2, we have [VFA = [hu Case: x >1 By the argument given in the above case, for any given = > 0, there is an integer N greater than 1, we have [vR=1] NW. Case: x. ‘The case is trivial, since {x1!"} is the I-constant sequence, converging to 1 For given «> 0, any positive integer NV satisfying n>N>[l-1=0 0. Therefore [x|"= arbgpe < rp, fr allo Let ©> O be given. Then pig B=) For any postive integer WY greater than SL5=), we have wi o= ce rata Hance, (<9) converges to 0 Case i x When «= 1, evidently x” = 1. Therefore the sequence converges to 2 papa Let x =14h, 4 0. Then x” = (1+ )"> 1+ ab, fr all Let M be o positive number (however large) such thet 1-4 nh > G. For any G > 0, there & 2 positive integer Mauch that x > G. forall n> N. Hence the sequence diverges to oc. Case x= ‘When x = —1, the equation {(1)"} osclates finitely. Case: xc Let x =—y-sothat y> 1. “Thus we get the sequence ((—1)"y"} which have both postive and negative terme “The sequence is unbounded and the numerical values of the terms can be made greater than any number (however lrge). Thus, it oscillates infinite Hence the sequence {x"} converges only when —1 N—n>M_ _, 1-M n+1 Since ;2; <1 for every n, this proves that 1 is the least upper bound for the sequence {2;}. >M. aero) ‘Suppose we plot the points (1,21), (2, a2),...,(n, aq)... in the xy-plane. If M is an upper bound of the sequence, all these points will lie on below the line y = M. The line y = Lis the lowest such line. None of the points (n, ap) lies above y = L, but some do lie above any lower line y= L— 0, there exists at least one integer NV for whi av ok The fact that {a9} is nondecreasing tells us further that a» > ap > L—<, for all n > IV. Thus, all the numbers a, beyond the Mth number lie the e-band of L. This is precisely the condition for L be the limit of the sequence {an}: Reece Prove the ” zipper theorem’ for sequences : IF {an} and {be} both converge to L, then the sequence 1, bi, 82, be, «5 Any Bay converges to L. bp and cont = an, for n= 1,2,.... Since 2y—+ Land b, > L, there are posi respectively such that je integers Ny and Nz lan—L M and |bn—L\ Ny. Im > 1+ 2max{Ni,N1}, then lea-U N. Hence {¢n} converges to L. PY ood A sequence {a,} is said to be a Cauchy sequence if to every positive number e there corresponds an integer N such that for all m and n, m>N and n> N => |am—an| 0, there exists a positive integer m such that |am4p — m| < ¢, forall p >0,p EN. Prove that every convergent sequence is a Cauchy sequence. That is, prove that if {a,,} is a convergent sequence, then to every positive number < there corresponds an integer N such that for all m>N andn>N => |am—ar| <. Sto) Mate Let {a,} be a convergent sequence, converging to some L. Let ¢ > 0 be given. As a, —+ L, there is a positive integer NV such that lan —L| N. Hence for all n,m > N, we have lan — am| < lan —L| + am — L| 0, there exists a positive integer N such that Jam —an| N. We can apply definition to test convergence of a sequence to a given limit L. But in case, the limit L is not known, nor can any guess be made of the same, the above theorem can be used. It involves only the terms of the sequence and is useful for determining whether a sequence converges or not. ae 2 2

You might also like