Lect-03 Sequence
Lect-03 Sequence
Lecture 2 (Sequence)
100
Ankur Kanaujiya
MA
I A sequence of real numbers or a sequence in R
is a mapping f : N → R.
1
100
MA
I A sequence of real numbers or a sequence in R
is a mapping f : N → R.
1
I Notation: We write xn for f (n), n ∈ N
100
and the notation for a sequence is (xn ).
MA
I A sequence of real numbers or a sequence in R
is a mapping f : N → R.
1
I Notation: We write xn for f (n), n ∈ N
100
and the notation for a sequence is (xn ).
I Examples:
1. Constant sequence: (a, a, a, ...), where a ∈ R
MA
MA
100
1
I A sequence of real numbers or a sequence in R
is a mapping f : N → R.
1
I Notation: We write xn for f (n), n ∈ N
100
and the notation for a sequence is (xn ).
I Examples:
1. Constant sequence: (a, a, a, ...), where a ∈ R
2. Sequence defined by listing: (1, 4, 8, 11, 52, ...)
MA
3. Sequence defined by rule: (xn ), where
xn = 3n2 for all n ∈ N
4. Sequence defined recursively: (xn ), where
x1 = 4 and xn+1 = 2xn − 5 for all n ∈ N
MA
100
1
MA
100
1
I Convergence: What does it mean?
1
100
MA
I Convergence: What does it mean?
I Think of the examples:
1
(2, 2, 2, ...)
( n1 )
100
((−1)n n1 )
(1, 2, 1, 2, ...)
((−1)n (1 − n1 ))
(n2 − 1)
MA
MA
100
1
I Convergence: What does it mean?
I Think of the examples:
1
(2, 2, 2, ...)
( n1 )
100
((−1)n n1 )
(1, 2, 1, 2, ...)
((−1)n (1 − n1 ))
(n2 − 1)
MA
Definition: The sequence (xn ) is convergent if there exists
` ∈ R such that for every ε > 0, there exists n0 ∈ N
satisfying |xn − `| < ε for all n ≥ n0 .
I We say: ` is a limit of (xn ): lim xn = ` or xn → `.
n→∞
MA
100
1
MA
100
1
A sequence which is not convergent is called divergent.
1
100
MA
A sequence which is not convergent is called divergent.
1
Result: The limit of a convergent sequence is unique.
100
n+1
Examples: (a) ( 2n+3 ) (b) (1, 2, 1, 2, ...) (c) (n3 + 1)
MA
MA
100
1
A sequence which is not convergent is called divergent.
1
Result: The limit of a convergent sequence is unique.
100
n+1
Examples: (a) ( 2n+3 ) (b) (1, 2, 1, 2, ...) (c) (n3 + 1)
Definition: The sequence (xn ) is bounded if there exists M > 0
such that |xn | ≤ M for all n ∈ N.
Otherwise (xn ) is called unbounded (not bounded).
MA
A sequence which is not convergent is called divergent.
1
Result: The limit of a convergent sequence is unique.
100
n+1
Examples: (a) ( 2n+3 ) (b) (1, 2, 1, 2, ...) (c) (n3 + 1)
Definition: The sequence (xn ) is bounded if there exists M > 0
such that |xn | ≤ M for all n ∈ N.
Otherwise (xn ) is called unbounded (not bounded).
MA
Examples: (a) ( 3n+2
2n+5
) (b) (1, 2, 1, 3, 1, 4, ...)
MA
100
1
A sequence which is not convergent is called divergent.
1
Result: The limit of a convergent sequence is unique.
100
n+1
Examples: (a) ( 2n+3 ) (b) (1, 2, 1, 2, ...) (c) (n3 + 1)
Definition: The sequence (xn ) is bounded if there exists M > 0
such that |xn | ≤ M for all n ∈ N.
Otherwise (xn ) is called unbounded (not bounded).
MA
Examples: (a) ( 3n+2
2n+5
) (b) (1, 2, 1, 3, 1, 4, ...)
Result: Every convergent sequence is bounded.
So, Not bounded implies Not convergent.