Lecture -

IC - 0
 of
↳- sequence a

-tions:
· Given sets D, E, a
fatien
f: DE assigns to each NED,
a
unique
element of E, denoted
D is called domain
flu). Here, -

② is called co-domain.
of f and -

<fall: "ED3 is called

· The set
Imay set
f
or
Im
the
range m of t
-

·
f h called one-one ( or injective)
- -

if fInD = flnsl => (

= 0

· f is called onto
-
(c surjective)
-

it its is #
range
 bijective itf it is
• f- is one one
-

and into

then it has
• If f- is bijective ,

inverse E →D St
an
g :

identity
-

functions , 2-5

) if NED and
glfcns =x

f c- E.
f- ( gig ) ) =
y y
Definition ( sequence )

A function f- : { 1,2 ,
3
,
- - .

} → IR

is called of real
a
sequence
numbers .

we write fins = Rn and the

denoted
is
by 0972;
" '
"

sequence ,

ten] We call
or
simply by
.

an the nth term of the sequence .

E✗amble:_
In ] 1,2 , 3 , -

1.
= -

% ¥
-
-

(2) %
-
-
-

= 1, , ,
2.

( EDM)
-1 -11 , - -
-

-1 -11
-

3. =
, , ,

(1-1)=91 -1-2,1-1-3
-
- -

4 '
,

Ion)
1.01 1.001 -

1.1
µ
- -

b- .
-1 = , , ,
 knvergenceofaoegeience
Definition : we
say
that a
sequence
St
ten)
converges if I ✗◦ C- IR

for
every Eyo , there exists a
positive
integer N ( depending on e) such

that

sent Leo -
& Kote ) ( or ten -
Kol 2
E) n
≥N
,

Convergence of a
sequence Inn) to a

real number ko mean that the

term Xn is as close to No as we

like for sufficiently large n .

Remaster : It can be
easily verified
that it such a number no exists
,
 it is this
then unique .
In case

we that ten ]
say converges tono

or no is the limit of cent and

we write

Tim xn= Xo or sen → Xo Las n → a)

If a
sequence does not
converges ,

that the
sequence diverges
we
say
it is
or
divergent .

Examtple : ① Let a c- IR and an :=a

fne IN . Then an → a. we

can take N=1 .

IN Then xn→o
② In it NE
.

xn= .

want to
We
Let E> 0 be given .

find N c- IN At
N
Itn -
ol ce f n
}
 Choose
any
NEIN St N > te .

( This is possible
because of the

property of IR )
Archimedean .

③ xn= I -

In .
Then Rn → 1 .

11 - sent = 11 -

n÷ / =
In ≤E

f n > N ,
where N > %
Then an → o

④ xn=n÷+ ,
.

E.io/--n2-+in2-zr-na-N
choose N C- IN St N >
%z .
Then

Ixn -01 < E f n

≥ ☒ .
 Limit theorems:
-

↳rem: Suppose cute and

fury. Then

1.Centyn -> <<+y

20 >nin -> cay

into Un
3.
In ->
If it to

caret th
↑

-
Example set can
it
Then can: 1-t+ -E++ to t
=
1-T2 -> 1

theorem (Sandwich theorem).

-

com), (3), (2) are

suppose that
st Fmard
requences Pn1on [In

that canter and Infilo. Then Yo- 400

Proof .
Let E> 0 be given . Since

& 2m → No 7 Ni & N2
Jen → No
,

ˢᵗ
Ixn - Kol < E f n > Ni
and
Not <E tf n } Nz .

12m -

Choose N= Max { Nl , Nz } . Then since

,

we hone
In ≤ Yn ≤ 2m ,

1 Yn -
Ro I CE if n > N .

Henie Yn → Xo .

Examtple : ① since -

In ≤
ˢi%- ≤ In
,

by sandwich theorem
sing → o .

Yn=;÷n+ .tn?I-n+z+-----+??-+zn'
Then
② At

??÷n+
m2 and hence one .

n
≤
.

'n
≤
E.
,
 Let ✗ C- IR and OCK < 1 we
③
.

that xn→o Write

show
.

> 0 Then
for
¥a
a
some
.

✗ =

by Bernoulli 's inequality

MEIN )
( for a > -1
,
C+x≥ I -1mn it

Kai
__¥a)n≤ Fina
◦ < in -

theorem xn→o
By sandwich

xn=n"n Then In → 1
④ Let .
.

some km > 0
Let n4n= I -1km for ,

when n >1 .

Binomial
Home n= ①+ knjh > 1 .

By
?
theorem ,
it m > 1, n
≥ 11-12-11 kn
 ?
non 1.)
Cn 1) 7,12 kn
-
-

and hence Knt ≤ Em .

therein kn→o
sandwich
By
n"n → 1
therefore
.

and

Ratio test )
:
1
theorem
Let inn be a
sequence of seal

that an > 0 Fn
numbers sleek

%÷
and lim Also Then .

n→•

1 .
if 1<1 then time xn=0 ,

m→o

2. it a >1 then limen -_ • .

n→o

aLrL1
Proof
'

Choose 8 St .

: 1 .

exists
n→•%=a
tim there no
As ,
 3. t Cn+1
cy for all 73,40·
-

cn

Hence

25 ithot
I've ntnot?
0 <3n+Mg

.....
I won

since rc1, him vo.

o
n-
cnto.
sandwich theorem
Hence
by
VEIR st 1UL3.
2. Choose
noEIN st xn+19 Wan
We get
all Hence
for n3,40·

cutuo> NY CCo

since vs t, lime zoo and therefore

n+ N

line Rn = 0.

n- A
Examples:
-

on
the

horfare
(1)
Let Sen

into
low on
(2) Let cn=nght for some yt (91).

Them
liment and endon
=>

(3) Let by 7 and can

be then

n-
lim
oo
nt b. Therefore limexin
he d

#ninction A requence (in)

is

said to be
-
bounded if F M30

f4 IN.
St Ki 1M

Herem: A
convergent sequence is
bounded

Pof: Exercise
 het xn=Ñ then Cxn) is a
,

bounded sequence
but not
convergent .

Question :

Boundedness + ?? = convergence .

Definitions ( Monotone sequences )

that can] is
we
say a sequence
it ≤ xnei for all n

in
an

it
and
st.FE.org anaemia

for all n .

Similarly ,
we define decreasing
and stIiÑqnces
that can] is monotone if it is
we say
either
increasing
or Hsing .
Theorems : Let can] be a bounded

Then
and
increasing sequence .

the least upper bound of the set

sarin c- IN } is the limit of cans .

Proof : Let supxn = M .

Then for
N

E ≤ ✗
most
'

7 M
for EYO no
-

given ,

is ≤ Int
increasing
✗
since Cn) , no

n ≥ No .

Hence
Mt E F n >, no .

M ≤
M -
E ≤ am ≤

M t ≥ no
pen et
n
≤
.

an → in
Therefore
.
Theorems : Let can] be a bounded

Then
and
decreasing sequence
.

libber bound of the set

the greatest
sarin c- IN } is the limit of cans .

Proof : Exercise

Examtpe :
Let an __ J2 and
C)
Then
Ftm For n > 1 .

Xn =
≥

induction ≤ rn≤ 2 and

by using
◦
,

can]
is
increasing .
Therefore
an → 7
Cn) converges
.

Suppose .

This implies that

Then 1=52+5 .

1=2 .
 34= 8
and Inti= tPut2.
& Let
Here
Note
that
te 21.

the sequence
is decreasing.
is
Since 130, the sequence

bounded below. Therefore (un)

sn-3. Then
Suppose
converges.
b =
272. Therefore, 3=2.