Quadrant II - Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101
Paper Title: DSC1A Calculus and Numerical methods
Unit: Real Sequences
Module Name: Convergence of a sequence - Part 2
Module No: 34
Name of the Presenter:Ms. Winita Janardhan Rawool

Notes

Example on establishing the convergence of a sequence:

 
1
1) Show that → 0.
n2
Solution: Let  > 0 be any given number.
 
1 
We want to find N ∈ N such that for all n ≥ N ,  2 − 0 < 
n
   
1  1 1
Consider  2 − 0 =  2  = 2 < 
n rn n
1 1
=⇒ < n2 that is <n
 
r
1
By Archimedean property corresponding to  > 0 there exist N ∈ N such that N >

 
1
Choose N = √ + 1

 
1 
Therefore given  > 0 there exist N ∈ N such that for all n ≥ N ,  2 − 0 < 

n
 
1
Hence → 0.
n2

 
1
2) Show that √ → 0.
n
Solution: Let  > 0 be any given number.
 
 1 
We want to find N ∈ N such that for all n ≥ N ,  √ − 0 < 
n
   
 1   1  1
Consider  √ − 0 =  √  = √ < 
n n n

1
 1 √ 1
=⇒ < n that is 2 < n
 
1
By Archimedean property corresponding to  > 0 there exist N ∈ N such that N > 2

 
1
Choose N = 2 + 1

 
 1 
Therefore given  > 0 there exist N ∈ N such that for all n ≥ N ,  √ − 0 < 
n
 
1
Hence √ → 0.
n

2
 Quadrant II - Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101
Paper Title: DSC1A Calculus and Numerical methods
Unit: Real Sequences
Module Name: Convergence of a sequence - Part 3
Module No: 35
Name of the Presenter:Ms. Winita Janardhan Rawool

Notes

Example on establishing the convergence of a sequence:

 
3n − 1 3
1) Show that →
4n + 5 4
 
 3n − 1 3 
Solution: We want N ∈ N such that  − <
4n + 5 4 
   
 3n − 1 3   −19  19
 4n + 5 − 4  =  16n + 20  = 16n + 20 < 
   
 
1 19
=⇒ − 20 < n
16 
 
1 19
By Archimedean property there exist N ∈ N such that − 20 < N
16 
  
1 19
Choose N = − 20 + 1
16 
 
 3n − 1 3 
Then for all n ≥ N we have  − <
4n + 5 4 
 
3n − 1 3
Hence →
4n + 5 4

 
2n + 3 2
2) Show that →
3n + 4 3
 
 2n + 3 2 
Solution: We want N ∈ N such that   − <
3n + 4 3 
   
 2n + 3 2   1  1
 3n + 4 − 3  =  3(3n + 4)  = 3(3n + 4) < 
   
 
1 1
=⇒ −4 <n
3 3
 
1 1
By Archimedean property there exist N ∈ N such that −4 <N
3 3

1
   
1 1
Choose N = −4 +1
3 3
 
 2n + 3 2 
Then for all n ≥ N we have 
 − <
3n + 4 3 
 
2n + 3 2
Hence → .
3n + 4 3

2
 Quadrant II - Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101
Paper Title: DSC1A Calculus and Numerical methods
Unit: Real Sequences
Module Name: Convergence of a sequence - Part 4
Module No: 36
Name of the Presenter:Ms. Winita Janardhan Rawool

Notes

Example on establishing the convergence of a sequence:

 2 
n +1 1
1) Show that 2
→
2n + 5 2
 2 
 n +1 1
Solution: We want N ∈ N such that  2 −  < 
2n + 5 2
 2   
 n +1 1   −3  3
 2n2 + 5 − 2  =  4n2 + 10  = 4n2 + 10


Next n < n2

This implies 4n + 10 < 4n2 + 10

3 3
Therefore 2
< <
4n + 10 4n + 10
 
1 3
=⇒ − 10 < n
4 
 
1 3
By Archimedean property there exist N ∈ N such that − 10 < N
4 
  
1 3
Choose N = − 10 + 1
4 
 2 
 n +1 1 
Then for all n ≥ N we have  2
 − <
2n + 5 2 
 2 
n +1 1
Hence 2
→
2n + 5 2

n2 + 1
 
1
2) Show that →
3n2 + 2 3
 2 
 n +1 1 
Solution: We want N ∈ N such that  2  − <
3n + 2 3 
 2   
 n +1 1   1  1
 3n2 + 2 − 3  =  9n2 + 6  = 9n2 + 6


1
Next n < n2

This implies 9n + 6 < 9n2 + 6

1 1
Therefore 2
< <
9n + 6 9n + 6
 
1 1
=⇒ −6 <n
9 
 
1 1
By Archimedean property there exist N ∈ N such that −6 <N
9 
  
1 1
Choose N = −6 +1
9 
 2 
 n +1 1 
Then for all n ≥ N we have  2
 − <
3n + 2 3 
 2 
n +1 1
Hence →
3n2 + 2 3

2
 Quadrant II – G

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101

Paper Title: Calculus and Numerical methods

Unit: 02
Module Name: Sandwich Lemma - Part 1
Module No: 42
Name of the Presenter: Ms. Ranisha Fernandes

Notes:

Lemma: If {𝑎𝑛 } is a sequence such that lim 𝑎𝑛 = 𝑙 and 𝑎𝑛 ≥ 0 ∀𝑛 then 𝑙 ≥ 0.

𝑛→∞

Proof: given that lim 𝑎𝑛 = 𝑙 and 𝑎𝑛 ≥ 0

𝑛→∞

Suppose 𝑙 < 0
 −𝑙 > 0
−𝑙
Let 𝜀 = >0
2

Since lim 𝑎𝑛 = 𝑙;
𝑛→∞

∃ 𝑛0 ∈ 𝑁, ∋ ∀𝑛 ≥ 𝑛0  |𝑎𝑛 − 𝑙| < 𝜀
−𝜀 < 𝑎𝑛 − 𝑙 < 𝜀 ∀𝑛 ≥ 𝑛0
−𝜀 + 𝑙 < 𝑎𝑛 < 𝜀 + 𝑙 ∀𝑛 ≥ 𝑛0
−𝑙 −𝑙
− ( ) + 𝑙 < 𝑎𝑛 < ( ) + 𝑙
2 2
3𝑙 𝑙
< 𝑎𝑛 < ∀𝑛 ≥ 𝑛0
2 2

𝑎𝑛 ≤ 0 ∀𝑛 ≥ 𝑛0
This gives a contradiction.
Therefore, 𝑙 ≥ 0.

Lemma 2: If {𝑎𝑛 } 𝑎𝑛𝑑 {𝑏𝑛 } are sequences such that𝑎𝑛 ≤ 𝑏𝑛 ∀𝑛 , lim 𝑎𝑛 = 𝑙

𝑛→∞
and lim 𝑏𝑛 = 𝑚 then 𝑙 ≤ 𝑚
𝑛→∞

Proof: Given that 𝑎𝑛 ≤ 𝑏𝑛 ∀𝑛

𝑏𝑛 − 𝑎𝑛 ≥ 0 ∀𝑛
lim 𝑏𝑛 − 𝑎𝑛 ≥ 0
𝑛→∞

𝑚−𝑙 ≥0
∴ 𝑙≤𝑚
 Quadrant II – Notes

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101

Paper Title: Calculus and Numerical methods

Unit: 02
Module Name: Sandwich Lemma - Part 2
Module No: 43
Name of the Presenter: Ms. Ranisha Fernandes

Theorem:
If {𝑎𝑛 }, {𝑏𝑛 } 𝑎𝑛𝑑 {𝑐𝑛 } are sequences such that 𝑎𝑛 ≤ 𝑏𝑛 ≤ 𝑐𝑛 ∀𝑛 and
{𝑎𝑛 } 𝑎𝑛𝑑 {𝑐𝑛 } converge to the same limit L, Then {𝑏𝑛 } also converges to L.
Proof:
Given {𝑎𝑛 } 𝑎𝑛𝑑 {𝑐𝑛 } converge to the same limit L lim 𝑎𝑛 = 𝑙 = lim 𝑐𝑛
𝑛→∞ 𝑛→∞

And, 𝑎𝑛 ≤ 𝑏𝑛 ≤ 𝑐𝑛 ∀𝑛
For 𝜀 > 0,
∵ lim 𝑎𝑛 = 𝐿 ∃ 𝑛1 ∈ 𝑁, ∋ ∀𝑛 ≥ 𝑛1 |𝑎𝑛 − 𝐿| < 𝜀
𝑛→∞

𝐿 − 𝜀 < 𝑎𝑛 < 𝐿 + 𝜀 ∀𝑛 ≥ 𝑛1 ------- (1)

∵ lim 𝑐𝑛 = 𝐿  ∃ 𝑛2 ∈ 𝑁, ∋ ∀𝑛 ≥ 𝑛2 |𝑐𝑛 − 𝐿| < 𝜀

𝑛→∞

𝐿 − 𝜀 < 𝑐𝑛 < 𝐿 + 𝜀 ∀𝑛 ≥ 𝑛2 ------- (2)

Choose 𝑛0 = max{𝑛1 , 𝑛2 }
For all n ≥ 𝑛0
𝐿 − 𝜀 < 𝑎𝑛 ≤ 𝑏𝑛 ≤ 𝑐𝑛 < 𝐿 + 𝜀

𝐿 − 𝜀 < 𝑏𝑛 < 𝐿 + 𝜀 for all n ≥ 𝑛0

−𝜀 < 𝑏𝑛 − 𝐿 < 𝜀 for all n ≥ 𝑛0

|𝑏𝑛 − 𝐿| < 𝜀 𝑓𝑜𝑟 𝑎𝑙𝑙 n ≥ 𝑛0

Therefore, {𝑏𝑛 } also converges to L.

 Quadrant II – Notes

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101

Paper Title: Calculus and Numerical methods

Unit: 02
Module Name: -Algebra of sequences - Part 1
Module No: 45
Name of the Presenter: Ms. Ranisha Fernandes

Notes:
Theorem: Let {𝑎𝑛 } and {𝑏𝑛 } be convergent sequences such that lim 𝑎𝑛 = 𝑙 and
𝑛→∞

lim 𝑏𝑛 = 𝑚, then lim 𝑎𝑛 + 𝑏𝑛 = 𝑙 + 𝑚

𝑛→∞ 𝑛→∞

Proof: Given {𝑎𝑛 } converges to l and {𝑏𝑛 } converges to m.

∵ 𝑎𝑛 ⟶ 𝑙
𝜀
For 𝜀 > 0, ∃ 𝑛1 ∈ 𝑁 ∋ ∀ 𝑛 ≥ 𝑛1 |𝑎𝑛 − 𝑙| < ----- (1)
2

∵ 𝑏𝑛 ⟶ 𝑙
𝜀
For 𝜀 > 0, ∃ 𝑛2 ∈ 𝑁 ∋ ∀ 𝑛 ≥ 𝑛2 |𝑏𝑛 − 𝑚| < ------ (2)
2

Choose 𝑛0 = max{𝑛1 , 𝑛2 }
For all n≥ 𝑛0 ,
|(𝑎𝑛 + 𝑏𝑛 ) − (𝑙 + 𝑚)| = |(𝑎𝑛 − 𝑙) + (𝑏𝑛 − 𝑚)|
≤ |𝑎𝑛 − 𝑙| + |𝑏𝑛 − 𝑚|
 𝜀 𝜀
< + =𝜀
2 2

𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 , lim 𝑎𝑛 + 𝑏𝑛 = 𝑙 + 𝑚
𝑛→∞
 Quadrant II – Notes

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101

Paper Title: Calculus and Numerical methods

Unit: 02
Module Name: -Algebra of sequences - Part 2
Module No: 46
Name of the Presenter: Ms. Ranisha Fernandes

Notes:
Theorem: Let {𝑎𝑛 } and {𝑏𝑛 } be convergent sequences such that lim 𝑎𝑛 = 𝑙 and
𝑛→∞

lim 𝑏𝑛 = 𝑚, then lim 𝑎𝑛 − 𝑏𝑛 = 𝑙 − 𝑚

𝑛→∞ 𝑛→∞

Proof: Given {𝑎𝑛 } converges to l and {𝑏𝑛 } converges to m.

∵ 𝑎𝑛 ⟶ 𝑙
𝜀
For 𝜀 > 0, ∃ 𝑛1 ∈ 𝑁 ∋ ∀ 𝑛 ≥ 𝑛1 |𝑎𝑛 − 𝑙| < ----- (1)
2

∵ 𝑏𝑛 ⟶ 𝑙
𝜀
For 𝜀 > 0, ∃ 𝑛2 ∈ 𝑁 ∋ ∀ 𝑛 ≥ 𝑛2 |𝑏𝑛 − 𝑚| < ------ (2)
2

Choose 𝑛0 = max{𝑛1 , 𝑛2 }
For all n≥ 𝑛0 ,
|(𝑎𝑛 − 𝑏𝑛 ) − (𝑙 − 𝑚)| = |(𝑎𝑛 − 𝑙) − (𝑏𝑛 − 𝑚)|
≤ |𝑎𝑛 − 𝑙| + |𝑏𝑛 − 𝑚|
 𝜀 𝜀
< + =𝜀
2 2

𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 , lim 𝑎𝑛 − 𝑏𝑛 = 𝑙 − 𝑚
𝑛→∞
 Quadrant II – Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101
Paper Title: DSC 1A Calculus and Numerical Methods
Unit: Real Sequences
Module Name: Convergence of 𝑥 𝑛 , 𝑥 ∈ ℝ - Part 1
Module No: 50
Name of the Presenter: Ms. Vaibhavi Vinayak Neugi

Notes
 Quadrant II – Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101
Paper Title: DSC 1A Calculus and Numerical Methods
Unit: Real Sequences
Module Name: Convergence of 𝑥 𝑛 , 𝑥 ∈ ℝ - Part 2
Module No: 51
Name of the Presenter: Ms. Vaibhavi Vinayak Neugi

Notes
 Quadrant II – Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101
Paper Title: DSC 1A Calculus and Numerical Methods
Unit: Real Sequences
1
Module Name: Convergence of 𝑛𝑛 , 𝑛 ∈ ℕ
Module No: 52
Name of the Presenter: Ms. Vaibhavi Vinayak Neugi

Notes
Note: In equation 3, 𝑛0 = max{2, 𝑛0 }. So 𝑛0 = 2, if maximum is 2 and 𝑛0 = 𝑛0 , if
maximum is 𝑛0 .
 Quadrant II – Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101
Paper Title: DSC 1A Calculus and Numerical Methods
Unit: 2
Module Name: Monotone sequence and their convergence – part 1
Module No: 53
Name of the Presenter: Mr. Brandon Fernandes

Notes
Monotone Sequences
Definition: A sequence (𝑥𝑛 ) of real number is increasing if

∀ 𝑛 ∈ ℕ 𝑥𝑛 ≤ 𝑥𝑛+1 .
Definition: A sequence (𝑥𝑛 ) of real number is decreasing if

∀ 𝑛 ∈ ℕ 𝑥𝑛 ≥ 𝑥𝑛+1 .

Remark:
1. An increasing sequence is bounded below by 𝑥1 . Hence it is bounded iff
it is bounded above.
2. Similarly a decreasing sequence is bounded above by 𝑥1 . Hence it is
bounded iff it is bounded below.

Definition: A sequence (𝑥𝑛 ) is said to be monotone if it is either increasing or

decreasing
 Quadrant II – Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101
Paper Title: DSC 1A Calculus and Numerical Methods
Unit: 2
Module Name: Monotone sequence and their convergence – part 3
Module No: 55
Name of the Presenter: Mr. Brandon Fernandes

Notes

Result: A monotonically increasing sequence which is bounded above is

convergent.
Proof:
Let (𝑥𝑛 ) be a sequence which is monotonically increasing and bounded above.
To show that: (𝑥𝑛 ) is convergent.

Let 𝑥 (ℕ) = {𝑥𝑛 : 𝑛 ∈ ℕ} be the image of the sequence.

𝑥1 ∈ 𝑥 (ℕ) ∴ 𝑥 (ℕ) ≠ ∅
and 𝑥 (ℕ) is bounded above
Hence 𝑥 (ℕ) has a least upper bound. (By LUB property of ℝ)

Let 𝑙𝑢𝑏(𝑥 (ℕ)) = 𝑙 - - - - - - - -(1)

Claim: 𝑥𝑛 ⟶ 𝑙
Let 𝜀 > 0 be given.
Then 𝑙 − 𝜀 is not an upper bound of 𝑥 (ℕ).

Hence ∃ 𝑁 ∈ ℕ ∋ 𝑥𝑁 > 𝑙 − 𝜀 - - - - - - - -(2)

The sequence (𝑥𝑛 ) is increasing.

Hence ∀ 𝑛 ≥ 𝑁 𝑥𝑛 ≥ 𝑥𝑁 - - - - - - - -(3)

Also, 𝑙𝑢𝑏(𝑥 (ℕ)) = 𝑙

Hence ∀ 𝑛 ∈ ℕ 𝑥𝑛 ≤ 𝑙 < 𝑙 + 𝜀 - - - - - - - -(4)

Thus by (2), (3) & (4)

∀ 𝑛 ≥ 𝑁 𝑙 − 𝜀 < 𝑥𝑁 ≤ 𝑥𝑛 ≤ 𝑙 < 𝑙 + 𝜀
i.e. ∀ 𝑛 ≥ 𝑁 𝑙 − 𝜀 < 𝑥𝑛 < 𝑙 + 𝜀

i.e. ∀ 𝑛 ≥ 𝑁 |𝑥𝑛 − 𝑙| < 𝜀

Hence for given 𝜀 > 0 ∃ 𝑁 ∈ ℕ ∋ ∀ 𝑛 ≥ 𝑁 |𝑥𝑛 − 𝑙| < 𝜀

⟹ 𝑥𝑛 ⟶ 𝑙
 Quadrant II – Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics
Paper Code: MTC 101
Paper Title: DSC 1A Calculus and Numerical Methods
Unit: 2
Module Name: Monotone sequence and their convergence – part 4
Module No: 56
Name of the Presenter: Mr. Brandon Fernandes

Notes
Result: A monotonically decreasing sequence which is bounded below is
convergent.
Proof:
Let (𝑢𝑛 ) be a sequence which is monotonically decreasing and bounded below.
To show that: (𝑢𝑛 ) is convergent.

Let 𝑢(ℕ) = {𝑢𝑛 : 𝑛 ∈ ℕ} be the image of the sequence.

𝑢1 ∈ 𝑢(ℕ) ∴ 𝑢 (ℕ) ≠ ∅
and 𝑢(ℕ) is bounded below.
Hence 𝑢(ℕ) has a greatest lower bound. (By GLB property of ℝ)

Let 𝑔𝑙𝑏(𝑢(ℕ)) = 𝑚 - - - - - - - -(1)

Claim: 𝑢𝑛 ⟶ 𝑚
Let 𝜀 > 0 be given.
Then 𝑚 + 𝜀 is not a lower bound of 𝑢 (ℕ).

Hence ∃ 𝑁 ∈ ℕ ∋ 𝑢𝑁 < 𝑚 + 𝜀 - - - - - - - -(2)

The sequence (𝑢𝑛 ) is decreasing.

Hence ∀ 𝑛 ≥ 𝑁 𝑢𝑛 ≤ 𝑢𝑁 - - - - - - - -(3)

Also, 𝑔𝑙𝑏(𝑢(ℕ)) = 𝑚

Hence ∀ 𝑛 ∈ ℕ 𝑚 − 𝜀 < 𝑚 ≤ 𝑢𝑛 - - - - - - - -(4)

Thus by (2), (3) & (4)

∀ 𝑛 ≥ 𝑁 𝑚 − 𝜀 < 𝑚 ≤ 𝑢𝑛 ≤ 𝑢𝑁 < 𝑚 + 𝜀
i.e. ∀ 𝑛 ≥ 𝑁 𝑚 − 𝜀 < 𝑢𝑛 < 𝑚 + 𝜀

i.e. ∀ 𝑛 ≥ 𝑁 |𝑢𝑛 − 𝑚| < 𝜀

Hence for given 𝜀 > 0 ∃ 𝑁 ∈ ℕ ∋ ∀ 𝑛 ≥ 𝑁 |𝑢𝑛 − 𝑚| < 𝜀

⟹ 𝑢𝑛 ⟶ 𝑚
Quadrant II – Transcript and Related Materials

Programme: Bachelor of Science (First Year)

Subject: Mathematics

Paper Code: MTC 101

Paper Title: DSC 1A: Calculus and Numerical Methods

Unit: Unit 2: Real Sequences

Module Name: Properties of Subsequence

Module No: 62

Name of the Presenter: Ms. Smita Kuncolienkar

Glossary of terms/words:

Additional Examples/Illustrations

Properties of Subsequence
Property 1.If a sequence is convergent to limit 𝑙 then all its subsequences also converge to
same limit 𝑙.
For example : Consider sequence (𝑥𝑛 ) where 𝑥𝑛 = (−1)𝑛
Above sequence is not convergent because it’s susequences (𝑥2𝑛 ) and
(𝑥2𝑛−1 ) converges to two different limits 1 and -1 respectively
Property2. If every subsequence of (𝑥𝑛 ) converge to 𝑙 then the sequence (𝑥𝑛 )
Itself converge to 𝑙
𝟏
For Example : Consider (𝑥𝑛 ) where 𝑥𝑛 =
𝒏

All subsequences of (𝑥𝑛 ) converges to 0

∴ (𝑥𝑛 ) converges to 0

Theorem: Let (𝑥𝑛 ) be a sequence in R.

If lim (𝑥2𝑛 ) = 𝑙 = lim (𝑥2𝑛−1 ) then lim (𝑥𝑛 ) = 𝑙
Proof: Let 𝜖 > 0 be any given number.
Since 𝑥2𝑛 → 𝑙 ,by definition , there exists 𝑘1 ∈N such that
 whenever ≥ 𝑘1 , |𝑥2𝑘 − 𝑙| < 𝜖 (i)
Since 𝑥2𝑛−1 → 𝑙 ,there exists 𝑘2 ∈N such that
whenever 𝑘 ≥ 𝑘2 , |𝑥2𝑘−1 − 𝑙| < 𝜖 (ii)
Let 𝑘0 =Max {𝑘1 , 𝑘2 } and let 𝑛0 = 2𝑘0
If 𝑛 ≥ 𝑛0 , then 𝑛 ≥ 2𝑘0 ≥ 2𝑘1 and 𝑛 ≥ 2𝑘0 ≥ 2𝑘2
Suppose n is even, n=2m say, then 2𝑚 ≥ 2𝑘1
Hence 𝑚 ≥ 𝑘1
∴ by (i) , |𝑥2𝑚 − 𝑙| < 𝜖
Since 𝑥2𝑛−1 → 𝑙 ,there exists 𝑘2 ∈N such that
whenever𝑘 ≥ 𝑘2 , |𝑥2𝑘−1 − 𝑙| < 𝜖 (ii)
Let 𝑘0 =Max {𝑘1 , 𝑘2 } and let 𝑛0 = 2𝑘0
If 𝑛 ≥ 𝑛0 , then 𝑛 ≥ 2𝑘0 ≥ 2𝑘1 and 𝑛 ≥ 2𝑘0 ≥ 2𝑘2
Suppose n is even, n=2m say, then 2𝑚 ≥ 2𝑘1
Hence 𝑚 ≥ 𝑘1
∴ by (i) , |𝑥2𝑚 − 𝑙| < 𝜖
Thus from (iii) and (iv), we conclude that
if 𝑛 ≥ 𝑛0 , then |𝑥𝑛 − 𝑙 | < 𝜖
Hence 𝑥𝑛 → 𝑙
i.e. lim (𝑥𝑛 )= 𝑙
Property 3: If (𝑥𝑛 ) is any sequence of real numbers then it has a monotone subsequence
For Example: 1 Consider sequence (𝑥𝑛 ) where 𝑥𝑛 = 𝑛2
i.e. (𝑥𝑛 ) = (1,4,9,16,25,36,49,………..)
(𝑥2𝑛 ) = ( 4,16,36,…..) is a monotone increasing subsequence of (𝑥𝑛 )
1 1 1 1
2. Consider sequence (𝑥𝑛 ) where 𝑥𝑛 = = (1, , , ,………..)
𝑛 2 3 4
1 1 1
(𝑥2𝑛 ) = (𝑛 , 𝑛 , 𝑛 ,……)is a monotone decreasing subsequence of (𝑥𝑛 )

Definition: Peak term of a sequence

Let (𝑥𝑛 ) be a sequence in R.
Then 𝑚𝑡ℎ term 𝑥𝑚 is said to be a peak if 𝑥𝑚 ≥ 𝑥𝑛 for all 𝑛 ≥ 𝑚
1 1 1 1
For Example: Consider (𝑥𝑛 ) =(1, 0 , 2 ,2,3, , , 6,……………)
4 5

Consider 𝑥1 =1 By definition, it is not a peak since 𝑥1 ≩ 𝑥𝑛 for all 𝑛 ≥ 𝑚

1
Similarly 𝑥2 =0 , 𝑥3 = , 𝑥4 = 2 are not peaks
2
But 𝑥5 =3 is a peak
1 1
Similarly 𝑥6 = 4 , 𝑥7 = 5
, … are all peaks

Remark : Any sequence can have finite peaks or infinite peaks

Monotone Subsequence Theorem
Theorem: Every real sequence has a monotone subsequence
Proof: Let (𝑥𝑛 ) be any sequence of real numbers.
Then (𝑥𝑛 ) can have finite peaks or infinite peaks
Case (i) Let (𝑥𝑛 ) have infinitely many peaks say 𝑥𝑚1 , 𝑥𝑚2 𝑥𝑚3 ……𝑥𝑚𝑘 …..
These subscripts are increasing order
i.e. 𝑚1 < 𝑚2 < 𝑚3 < ……… 𝑚𝑘 …….
Clearly (𝑥𝑚𝑘 ) is a monotone decreasing subsequence of (𝑥𝑛 )
Case (ii) Let (𝑥𝑛 ) have finitely many peaks say 𝑥𝑚1 , 𝑥𝑚2 𝑥𝑚3 ……𝑥𝑚𝑟
and 𝑚1 < 𝑚2 < 𝑚3 < ……… 𝑚𝑟
(Assume next term to 𝑚𝑟 is 𝑚𝑟+1)
Let 𝑆1 = 𝑚𝑟+1
∴ 𝑥𝑆1 is not a peak
i.e.we will find a term which is greater than 𝑥𝑆1

Therefore, there exists 𝑆2 > 𝑆1 such that 𝑥𝑆2 > 𝑥𝑆1

Again since 𝑥𝑆2 is not a peak, there exists 𝑆3 > 𝑆2 such that 𝑥𝑆3 > 𝑥𝑆2
Hence we get 𝑥𝑆3 > 𝑥𝑆2 > 𝑥𝑆1
Similarly we get𝑥𝑆4 , 𝑥𝑆5 , 𝑥𝑆6 ,…….
Continuing this way we obtain a increasing subsequence (𝑥𝑆𝑛 ) of (𝑥𝑛 )
i.e. (𝑥𝑆𝑛 ) is a monotone increasing subsequence of (𝑥𝑛 )
Hence in both the cases (𝑥𝑛 ) has monotone subsequence.