Skip to main content

Question 2.4.7

Solutions

TZ
leumasicOfficial

7 months ago

(a) Notice that the sequence yny_{n} is decreasing since supposing the opposite would lead to a contradiction. For contradiction, suppose that yn+1>yny_{n + 1} > y_{n}. Then,

yn+1>yn    sup{ak:kn+1}>sup{ak:kn}y_{n + 1} > y_{n} \implies \sup \{ a_{k} : k \geq n + 1 \} > \sup \{ a_{k} : k \geq n \}

and this would then imply that yny_{n} is a smaller upper bound for {ak:kn+1}\{ a_{k}: k \geq n + 1\}, directly contradicting the definition of a supremum.

Furthermore, since the sequence ana_{n} is bounded below (from simply being bounded), then yny_{n} also is. Using ll to denote the lower bound of ana_{n}, that is because

nN,lminknaksupknan=yn.\forall n \in \mathbb{N}, \quad l \leq \min_{k \geq n} a_{k} \leq \sup_{k \geq n} a_{n} = y_{n}.

Therefore, by applying MCT, we know that yny_{n} converges.

(b) We define liminfyn\lim \inf y_{n} as

liminfyn=inf{ak:kn}.\lim \inf y_{n} = \inf \{ a_{k} : k \geq n \}.

The reason why it always exists for bounded sequences is analog to the reason given in (a). That is, yny_{n} is increasing and is bounded above, thereby allowing us to apply MCT.

(c) Consider any bounded sequence ana_{n}. Then, notice that

nN,inf{ak:kn}sup{ak:kn}.\forall n \in \mathbb{N}, \inf \{ a_{k} : k \geq n \} \leq \sup \{ a_{k} : k \geq n \} .

Additionally, knowing from (a) and (b) that both sequences formed converge (with the inf and sup functions*), we can apply the Order Limit Theorem to obtain

liminf{ak:kn}limsup{ak:kn}.\lim \inf \{ a_{k} : k \geq n \} \leq \lim \sup \{ a_{k} : k \geq n \}.

A sequence for which is inequality is strict is the alternating sequence

an=(0,1,0,1,0,1,).a_{n} = (0, 1, 0, 1, 0, 1, \dots).

Clearly, liminfan=0\lim \inf a_{n} = 0 and limsupan=1\lim \sup a_{n} = 1.

(d) In the forward direction (    )(\implies), suppose a bounded sequence ana_{n} for which

liminfan=limsupan=l.\lim \inf a_{n} = \lim \sup a_{n} = l.

Then, we can apply the Squeeze Theorem previously proved since

nN,xnanyn.\forall n \in \mathbb{N}, x_{n} \leq a_{n} \leq y_{n}.

This then means that ana_{n} converges to the same limit as ll.
Now, for the converse (    )(\impliedby), assume that ana_{n} converges to ll. Then, construct the sequences xnx_{n} and yny_{n}, defined as

xn=inf{ak:kn}x_{n} = \inf \{ a_{k} : k \geq n \}

and

yn=sup{ak:kn}.y_{n} = \sup \{ a_{k} : k \geq n \} .
0
Submit a solution
Optional • Markdown

Sign in to share your solution for this question.

Sign in

Navigate

Q 2.4.7

Navigate

Q 2.4.7