2.3. Sequences and Series

This section collects results on sequences and series of real numbers.

Definition 2.28

A sequence of real numbers is a function $f:\mathbb{N}\to \mathbb{R}$.

A sequence can be thought of as an ordered (countable) list of real numbers.

Definition 2.29 (Convergence)

A sequence $\{x_n\}$ of real numbers is said to converge to $x\in \mathbb{R}$ if for every $ϵ>0$, there exists a natural number $n_0$ (depending upon $ϵ$) such that

$$|x_n-x|<ϵ\mathrm{\forall }n>n_0.$$

The real number $x$ is called the limit of the sequence $\{x_n\}$, and we write $x_n\to x$ or $x=\underset{n\to \mathrm{\infty }}{lim}{x}_n$.

In other words, a sequence of real numbers $\{x_n\}$ converges to some real number $x$ if and only if for each $ϵ>0$, the terms $x_n$ are eventually $ϵ$-close to $x$.

Example 2.6 (Sequence convergence)

Consider the sequence $\{x_n\}$, where $x_n=\frac{1}{\sqrt{n}}$. For a given $ϵ>0$, choose $n_0>\frac{1}{{ϵ}^2}$. Then, for every $n>n_0$, we have

$$|\frac{1}{n^2}-0|=\frac{1}{n^2}<ϵ.$$

Thus, the sequence converges to 0.

Definition 2.30 (Divergence)

A sequence which doesn’t converge, is said to diverge.

Theorem 2.4 (Sequence Limit Uniqueness)

A sequence of real numbers can have utmost one limit.

Proof. If a sequence diverges, then there is nothing to prove. Otherwise, suppose a sequence $\{x_n\}$ converges to two limits $x$ and $y$. Thus, for every $ϵ>0$, there exist $n_1,n_2\in \mathbb{N}$ such that $|x_n-x|<ϵ\mathrm{\forall }n>n_1$ and $|x_n-y|<ϵ\mathrm{\forall }n>n_2$. Now, choose $n_0=max(n_1,n_2)$. Then, by triangle inequality, for every $n>n_0$

$$0\le |x-y|\le |x-x_n|+|x_n-y|<ϵ+ϵ=2ϵ.$$

Since this is true for all $ϵ>0$, hence $x=y$. Since $x,y$ are arbitrarily close, they must be equal.

Recall that the notion of $sup$ and $inf$ was introduced in the Definition 2.5. The same notation can be used for sequences also.

Definition 2.31 (Upper and lower bounds )

Let $X=\{x_n\}$ be a sequence of $\mathbb{R}$.

• An upper bound of $X$ is any $u\in \mathbb{R}$ such that $x_n\le u\mathrm{\forall }n\in \mathbb{N}$.

• A lower bound of $X$ is any $l\in \mathbb{R}$ such that $x_n\ge l\mathrm{\forall }n\in \mathbb{N}$.

• If $X$ has an upper bound it is said to be bounded from above.

• If $X$ has a lower bound it is said to be bounded from below.

• If $X$ is both bounded from above and below, then $X$ is said to be bounded.

• A real number is called a least upper bound or supremum of $X$ if it is an upper bound of $X$, and it is less than or equal to every other upper bound of $X$.

• The least upper bound is denoted by $sup(X)$.

• A real number is called a greatest lower bound or infimum of $X$ if it is a lower bound of $X$, and it is greater than or equal to every other lower bound of $X$.

• The greatest lower bound is denoted by $inf(X)$.

Remark 2.6

Due to the completeness axiom, if a sequence $\{x_n\}$ has an upper bound, it has a least upper bound denoted by $sup\{x_n\}$ and if it has a lower bound, it has a greatest lower bound denoted by $inf\{x_n\}$.

The notion of upper boundedness and lower boundedness can be subsumed into a single definition.

Definition 2.32 (Boundedness)

A sequence $\{x_n\}$ is said to be bounded if there exists a number $M>0$ such that $|x_n|\le M\mathrm{\forall }n\in \mathbb{N}$.

Theorem 2.5

Every convergent sequence is bounded.

Proof. Let $\{x_n\}$ converge to $x$. Choosing a particular value of $ϵ=1$, there exists $n_0\in \mathbb{N}$ such that $|x_n-x|<1\mathrm{\forall }n>n_0$. Thus, $x_n\in (x-1,x+1)$. This means that

$$|x_n|<|x|+1\mathrm{\forall }n>n_0.$$

Now define $M=max\{|x_1|,|x_2|,\dots ,|x_{n_0}|,|x|+1\}$. It follows that $|x_n|\le M\mathrm{\forall }n\in \mathbb{N}$ as desired.

Definition 2.33 (Unbounded above )

A sequence $\{x_n\}$ is said to be unbounded above if there exists no $u\in \mathbb{R}$ such that $x_n\le u\mathrm{\forall }n\in \mathbb{N}$.

In other words, for every $u\in \mathbb{R}$, there exists an $x_n>u$.

Definition 2.34 (Unbounded below )

A sequence $\{x_n\}$ is said to be unbounded below if there exists no $l\in \mathbb{R}$ such that $x_n\ge l\mathrm{\forall }n\in \mathbb{N}$.

In other words, for every $l\in \mathbb{R}$, there exists an $x_n<l$.

2.3.1. Monotone Sequences

Definition 2.35 (Monotone sequences)

• A sequence $\{x_n\}$ is said to be increasing if $x_n\le x_{n+1}$ for each $n$.

• A sequence $\{x_n\}$ is said to be decreasing if $x_n\ge x_{n+1}$ for each $n$.

• A sequence $\{x_n\}$ is said to be monotone if it is either increasing or decreasing.

• The notation $x_n\uparrow x$ means $\{x_n\}$ is increasing and $x=sup\{x_n\}$. It applies if $\{x_n\}$ is bounded from above.

• The notation $x_n\downarrow x$ means $\{x_n\}$ is decreasing and $x=inf\{x_n\}$. It applies if $\{x_n\}$ is bounded from below.

• If a sequence $\{x_n\}$ satisfies $x_n=c$ for all $n$, then it is called a constant sequence.

An increasing sequence is bounded from below. Its greatest lower bound is $x_1$.

A decreasing sequence is bounded from above. Its least upper bound is $x_1$.

Remark 2.7 (Unbounded increasing sequences)

Let $\{x_n\}$ be an increasing and unbounded sequence. Then for every $M>0$, there exists $n_0\in \mathbb{N}$ such that for every $n>n_0$, $x_n>M$.

Remark 2.8 (Unbounded decreasing sequences)

Let $\{x_n\}$ be an decreasing and unbounded sequence. Then for every $M<0$, there exists $n_0\in \mathbb{N}$ such that for every $n>n_0$, $x_n<M$.

Theorem 2.6 (Convergence of bounded monotone sequences)

Every monotone bounded sequence of real numbers is convergent.

Proof. Let $\{x_n\}$ be increasing and bounded sequence. From completeness axiom it follows that there exists $x=sup\{x_n\}$. We claim that $x$ itself is the limit of $\{x_n\}$. From Proposition 2.6 we recall that for every $ϵ>0$, there exists a number $x_{n_0}\in \{x_n\}$, such that

$$x-ϵ<x_{n_0}\le x.$$

Since $\{x_n\}$ is increasing, hence

$$x-ϵ<x_n\le x\mathrm{\forall }n\ge n_0.$$

This means that $|x-x_n|=x-x_n<ϵ\mathrm{\forall }n\ge n_0$. Thus $x$ is indeed the limit. We follow similar steps to prove for decreasing sequence.

Theorem 2.7 (Convergence of constant sequences)

Let $\{x_n\}$ be a constant sequence with $x_n=c$. Then $lim\{x_n\}=c$.

Proof. For all $ϵ>0$, $|x_n-c|=0<ϵ$ for all $n\in \mathbb{N}$.

2.3.2. The Calculus of Limits

Let $\{x_n\}$ and $\{y_n\}$ be convergent sequences of $\mathbb{R}$. Our concern here is to understand what happens to the limits if the sequences are combined.

Let $lim\{x_n\}=x$ and $lim\{y_n\}=y$. Then:

Theorem 2.8 (Scaling a sequence)

$$lim\{\alpha x_n\}=\alpha x\mathrm{\forall }\alpha \in \mathbb{R}.$$

Proof. If $\alpha =0$, then we have a constant sequence and the result is trivial. So assume that $\alpha \ne 0$. Then:

$$|\alpha x_n-\alpha x|=|\alpha ||x_n-x|.$$

Let $ϵ>0$ and choose $n_0\in \mathbb{N}$ such that $|x-x_n|<\frac{ϵ}{|\alpha |}$ for all $n>n_0$. Then

$$|\alpha x_n-\alpha x|=|\alpha ||x_n-x|<|\alpha |\frac{ϵ}{|\alpha |}=ϵ\mathrm{\forall }n>n_0.$$

Corollary 2.4 (Negating a sequence)

$$lim\{-x_n\}=-x.$$

We get this result by choosing $\alpha =-1$.

Theorem 2.9 (Addition of sequences)

$$lim\{x_n+y_n\}=x+y.$$

Proof. From triangle inequality we get:

$$|x_n+y_n-(x+y)|\le |x_n-x|+|y_n-y|.$$

For any $ϵ>0$, choose $n_1$ such that $|x_n-x|<\frac{ϵ}{2}\mathrm{\forall }n>n_1$. Similarly, choose $n_2$ such that $|y_n-y|<\frac{ϵ}{2}\mathrm{\forall }n>n_2$. Now choose $n_0=max(n_1,n_2)$. Then:

$$|x_n+y_n-(x+y)|\le |x_n-x|+|y_n-y|<\frac{ϵ}{2}+\frac{ϵ}{2}=ϵ\mathrm{\forall }n>n_0.$$

Corollary 2.5 (Subtraction of sequences)

$$lim\{x_n-y_n\}=x-y.$$

Negate $\{y_n\}$ and add to $\{x_n\}$.

Theorem 2.10 (Multiplication of sequences)

$$lim\{x_n{y}_n\}=xy.$$

Proof. First let us assume that $x\ne 0$. We note that:

$$\begin{array}{rl}|x_n{y}_n-xy|& =|x_n{y}_n-x{y}_n+x{y}_n-xy|\\ & \le |x_n{y}_n-x{y}_n|+|x{y}_n-xy|\\ & =|y_n||x_n-x|+|x||y_n-y|.\end{array}$$

Let $ϵ>0$ be arbitrary. Choose $n_1>0$ such that

$$n>n_1⟹|y_n-y|<\frac{1}{|x|}\frac{ϵ}{2}.$$

Since every convergent sequence is bounded, let $M>0$ be a bound of $\{y_n\}$ (i.e. $-M\le y_n\le M$). Choose $n_2>0$ such that

$$n>n_2⟹|x_n-x|<\frac{1}{M}\frac{ϵ}{2}.$$

Further choose $n_0=max(n_1,n_2)$. Then, we have

$$|x_n{y}_n-xy|\le |y_n||x_n-x|+|x||y_n-y|<|y_n|\frac{1}{M}\frac{ϵ}{2}+|x|\frac{1}{|x|}\frac{ϵ}{2}\le \frac{ϵ}{2}+\frac{ϵ}{2}=ϵ.$$

Since $ϵ$ is arbitrary, hence we have shown that $lim\{x_n{y}_n\}=xy$.

Now consider the case where $x=0$. We need to show that $lim\{x_n{y}_n\}=0$. Let $ϵ>0$ and choose $n_0$ such that $|x_n-0|=|x_n|<\frac{ϵ}{M}$ for all $n>n_0$. Then

$$|x_n{y}_n-0|\le |x_n||y_n|\le |x_n|M<\frac{ϵ}{M}M=ϵ.$$

Theorem 2.11 (Division of sequences)

$$lim\{x_n/y_n\}=x/y\text{ provided }y\ne 0.$$

Proof. If we can prove that $y_n\to y$ implies that $\frac{1}{y_n}\to \frac{1}{y}$ whenever $y\ne 0$, then the division of sequences reduces to multiplication of sequences $\{x_n\}$ and $\{\frac{1}{y_n}\}$. But

$$|\frac{1}{y_n}-\frac{1}{y}|=\frac{|y-y_n|}{|y||y_n|}.$$

Choose ${ϵ}_0=|y|/2$. Then there exists $n_1\in \mathbb{N}$ such that $|y-y_n|<{ϵ}_0=|y|/2$ whenever $n>n_1$. This gives us, $|y_n|>|y|/2$ whenever $n>n_1$ (i.e. $y_n$ is so close to $y$ that its magnitude is much larger than $|y|/2$). Equivalently, we have

$$\frac{1}{|y_n|}<\frac{2}{|y|}\mathrm{\forall }n>n_1.$$

Next, for arbitrary $ϵ>0$, we choose $n_2$ such that for all $n>n_2$

$$|y_n-y|<\frac{ϵ|y{|}^2}{2}.$$

Finally, pick $n_0=max(n_1,n_2)$. Then $n>n_0$ implies

$$|\frac{1}{y_n}-\frac{1}{y}|=\frac{|y-y_n|}{|y||y_n|}<\frac{ϵ|y{|}^2}{2}\frac{1}{|y|}\frac{2}{|y|}=ϵ.$$

Thus, $y_n\to y$ implies that $\frac{1}{y_n}\to \frac{1}{y}$ whenever $y\ne 0$. Now division reduces to multiplication and we are done.

Although some elements of $\{y_n\}$ may be zero, but eventually $y_n$ becomes arbitrarily close to $y$ and since $y\ne 0$, hence,

$$0<\frac{|y|}{2}<|y_n|<|y|\mathrm{\forall }n>\text{ some }m.$$

In other words, there comes a point $m$ in the sequence $Y$ so that all elements in $Y$ after $y_m$ are non-zero with magnitude larger than $|y|/2$. We can practically throw away the first $m$ terms from both the sequences $X$ and $Y$ and focus on the convergence of remaining sequence.

Next, we examine some of the order properties of the limits of sequences.

Theorem 2.12 (Order limit theorem)

Assume $lim{x}_n=x$ and $lim{y}_n=y$.

1. If $x_n\ge 0$ for all $n\in \mathbb{N}$, then $x\ge 0$.

2. If $x_n\le y_n$ for all $n\in \mathbb{N}$, then $x\le y$.

3. If there exists $\alpha \in \mathbb{R}$ for which $\alpha \le y_n$ for all $n\in \mathbb{N}$, then $\alpha \le y$. Similarly if $x_n\le \alpha$ for all $n\in \mathbb{N}$, then $x\le \alpha$.

In words,

1. If a sequence is non-negative, then its limit is non-negative.

2. If one sequence is less than equal to another sequence for every term in the sequence, then its limit is also less than equal to the other sequence.

3. A lower bound of a sequence is less than equal to its limit. An upper bound of a sequence is greater than equal to its limit.

Proof. (1) By contradiction, assume that $x<0$. Then $x+|x|=0$. Now consider $ϵ=|x|$. Since $\{x_n\}$ is convergent, there exists $n_0\in \mathbb{N}$ such that $|x_n-x|<ϵ=|x|$. Thus,

$$|x_n-x|<|x|⟹x-|x|<x_n<x+|x|⟹x_n<0.$$

This is a contradiction. Hence $x\ge 0$.

(2) By Corollary 2.5 we have, $lim(y_n-x_n)=y-x$. Since $y_n\ge x_n$, hence $y_n-x_n\ge 0$. From (1), we get $y-x\ge 0$. This implies $y\ge x$.

(3) Take $x_n=\alpha$. Then $y_n\ge \alpha =x_n⟹y\ge \alpha$ (using (2)).

Corollary 2.6 (Order limit theorem extension)

Assume $lim{x}_n=x$ and $lim{y}_n=y$.

1. If $x_n\ge 0$ for all $n>n_0$, then $x\ge 0$.

2. If $x_n\le y_n$ for all $n>n_0$, then $x\le y$.

3. If there exists $\alpha \in \mathbb{R}$ for which $\alpha \le y_n$ for all $n>n_0$, then $\alpha \le y$. Similarly if $x_n\le \alpha$ for all $n>n_0$, then $x\le \alpha$.

We throw away the first $n_0$ terms from each sequence and apply the theorem on the remaining part(s).

Example 2.7 (Limits don’t preserve strict inequality)

Consider $x_n=\frac{1}{n}$ and $y_n=\frac{1}{n+1}$. $lim{x}_n=0$. $lim{y}_n=0$.

Thus, $x_n>y_n$ doesn’t imply $lim{x}_n>lim{y}_n$. We only have $x_n>y_n⟹x_n\ge y_n⟹lim{x}_n\ge lim{y}_n$.

Similarly, $x_n>0$ implies that $lim{x}_n\ge 0$. Or $x_n<r$ implies that $lim{x}_n\le r$.

Theorem 2.13 (Squeeze theorem for sequences)

If $x_n\le y_n\le z_n$ for all $n\in \mathbb{N}$ and if $lim{x}_n=lim{z}_n=l$, then $lim{y}_n=l$.

Proof. Let $lim{y}_n=y$. Using order limit theorem, $x_n\le y_n$ gives us $l\le y$ and $y_n\le z_n$ gives us $y\le l$. Thus, $l\le y\le l⟹y=l$.

Corollary 2.7 (Squeeze theorem for sequences extension)

Let $lim{x}_n=lim{z}_n=l$. If there exists $n_0\in \mathbb{N}$ such that for all $n>n_0$, $x_n\le y_n\le z_n$, then $lim{y}_n=l$.

Drop the first $n_0$ terms from all the three sequences and then apply the theorem on remaining sequences.

Theorem 2.14 (Convergence of absolute sequence)

If $x_n\to x$, then $|x_n|\to x$. But the converse is not true.

Proof. Since $x_n\to x$, for every $ϵ>0$, there exists $n_0\in \mathbb{N}$ such that $n>0$ implies $|x_n-x|<ϵ$. By triangle inequality

$$||x_n|-|x||\le |x_n-x|<ϵ.$$

This completes the proof.

Now consider the sequence

$$\{1,-1,1,-1,1,-1,\dots \}.$$

Although in absolute value it converges to $1$, the sequence itself doesn’t converge. Thus, the converse is not true.

2.3.3. Infinite Series

Definition 2.36

Let $\{x_n\}$ be a sequence. An infinite series is a formal expression of the form

$$\sum _{n=1}^{\mathrm{\infty }}{x}_n=x_1+x_2+x_3+x_4+\dots .$$

The corresponding sequence of partial sums $\{s_m\}$ is defined as

$$s_m=x_1+\cdots +x_m.$$

We say that the series $\sum _{n=1}^{\mathrm{\infty }}{x}_n$ converges to some $s\in \mathbb{R}$ if the sequence $\{s_m\}$ converges to $s$. In this case we write

$$\sum _{n=1}^{\mathrm{\infty }}{x}_n=s.$$

Example 2.8 (Convergent series)

Consider

$$\sum _{n=1}^{\mathrm{\infty }}\frac{1}{n^2}.$$

Looking at the partial sums, we observe:

$$\begin{array}{rl}{s}_m& =1+\frac{1}{4}+\frac{1}{9}\cdots +\frac{1}{m^2}\\ & <1+\frac{1}{2\cdot 1}+\frac{1}{3\cdot 2}+\dots \frac{1}{m\cdot (m-1)}\\ & =1+(1-\frac{1}{2})+(\frac{1}{2}-\frac{1}{3})+\cdots +(\frac{1}{m-1}-\frac{1}{m})\\ & =1+1-\frac{1}{m}\\ & <2.\end{array}$$

Thus, $2$ is an upper bound of the sequence of partial sums. Hence, by monotone convergence theorem, the series converges to some (unknown) limit less than 2.

Example 2.9 (Harmonic series)

Consider

$$\sum _{n=1}^{\mathrm{\infty }}\frac{1}{n}.$$

We note that

$$s_4=1+\frac{1}{2}+(\frac{1}{3}+\frac{1}{4})>1+\frac{1}{2}+(\frac{1}{4}+\frac{1}{4})=2.$$

Similarly, we find that $s_8>2\frac{1}{2}$. Further, we note that:

$$\begin{array}{rl}{s}_{2^k}& =1+\frac{1}{2}+(\frac{1}{3}+\frac{1}{4})+(\frac{1}{5}+\cdots +\frac{1}{8})+\cdots +(\frac{1}{2^{k-1}+1}+\cdots +\frac{1}{2^k})\\ & >1+\frac{1}{2}+(\frac{1}{4}+\frac{1}{4})+(\frac{1}{8}+\cdots +\frac{1}{8})+\cdots +(\frac{1}{2^k}+\cdots +\frac{1}{2^k})\\ & =1+\frac{1}{2}+2\frac{1}{4}+4\frac{1}{8}+\cdots +2^{k-1}\frac{1}{2^k}\\ & =1+\frac{1}{2}+\frac{1}{2}+\frac{1}{2}+\cdots +\frac{1}{2}\\ & =1+k\frac{1}{2}.\end{array}$$

Thus, the harmonic series is unbounded.

Theorem 2.15 (Cauchy condensation test)

Suppose $\{x_n\}$ is decreasing and satisfies $x_n\ge 0$ for all $n\in \mathbb{N}$. Then, the series $\sum _{n=1}^{\mathrm{\infty }}{x}_n$ converges if and only if the series

$$\sum _{n=0}^{\mathrm{\infty }}{2}^n{x}_{2^n}=x_1+2x_2+4x_4+8x_8+16x_{16}+\dots$$

converges.

Proof. Let $y_n=2^{n-1}{x}_{2^{n-1}}$. Then, the second series is $\sum _{n=1}^{\mathrm{\infty }}{y}_n$. Let the partial sums of $\{x_n\}$ be $s_m$ and the partial sums of $\{y_n\}$ be $t_k$.

First, assume that $\sum _{n=1}^{\mathrm{\infty }}{y}_n$ converges. Thus, the sequence $\{t_k\}$ converges. Since every convergent sequence is bounded, the sequence $\{t_k\}$ is bounded. Thus, there exists $M>0$ such that $t_k\le M$ for all $k\in \mathbb{N}$. Since $x_n\ge 0$, the partial sums $s_m$ are increasing. Thus, if we show that $\{s_m\}$ is bounded, then by monotone convergence theorem, we would have shown that $\{s_m\}$ converges, hence the series $\sum _{n=1}^{\mathrm{\infty }}{x}_n$ converges.

Let us fix $m$ and choose $k$ to be large enough so that $m\le 2^{k+1}-1$. Then $s_m\le s_{2^{k+1}-1}$. Now,

$$\begin{array}{rl}{s}_{2^{k+1}-1}& =x_1+(x_2+x_3)+(x_4+\dots x_7)+\cdots +\cdots +(x_{2^k}+\cdots +x_{2^{k+1}-1})\\ & \le x_1+(x_2+x_2)+(x_4+x_4+x_4+x_4)+\cdots +(x_{2^k}+\cdots +x_{2^k})\\ & =x_1+2x_2+\cdots +2^k{x}_{2^k}\\ & =y_1+y_2+\cdots +y_k\\ & =t_k.\end{array}$$

Thus, $s_m\le t_k\le M$. $\{s_m\}$ is bounded, hence convergent.

We now show that if $\sum _{n=1}^{\mathrm{\infty }}{y}_n$ diverges, then $\sum _{n=1}^{\mathrm{\infty }}{x}_n$ diverges too.

Consider the sum

$$\begin{array}{rl}{s}_{2^k}& =x_1+x_2+(x_3+x_4)+(x_5+\cdots +x_8)+\cdots +(x_{2^{k-1}+1}+\dots x^{2^k})\\ & \ge x_1+x_2+(x_4+x_4)+(x_8+\cdots +x_8)+\cdots +(x_{2^k}+\dots x_{2^k})\\ & =x_1+x_2+2x_4+4x_8+\dots 2^{k-1}{x}_{2^k}\\ & =\frac{1}{2}{x}_1+\frac{1}{2}(x_1+2x_2+4x_4+8x_8+\cdots +2^k{x}^{2^k})\\ & =\frac{1}{2}{x}_1+t_k\ge t_k.\end{array}$$

Now, since $\{t_k\}$ diverges, hence $\{s_{2^k}\}$ too diverges. Thus, the series diverges.

Definition 2.37 (Absolutely summable)

A series $\sum x_n$ is called absolutely summable if $\sum |x_n|$ converges.

A sequence $\{x_n\}$ is called absolutely summable if $\sum |x_n|$ converges.

2.3.4. Subsequences

Theorem 2.16 (Subsequence convergence)

Subsequences of a convergent sequence converge to the same limit as the original sequence. If $\underset{n\to \mathrm{\infty }}{lim}{x}_n=x$, then $\underset{n\to \mathrm{\infty }}{lim}{y}_n=x$ for every subsequence $\{y_n\}$ of $\{x_n\}$.

Conversely, if two different subsequences of $\{x_n\}$ converge to different limits, then the sequence $\{x_n\}$ does not converge.

Proof. Since $\underset{n\to \mathrm{\infty }}{lim}{x}_n=x$, for every $ϵ>0$, there exists $n_0\in \mathbb{N}$ such that $|x-x_n|<ϵ\mathrm{\forall }n>n_0$. Now, if $\{y_n\}$ is a subsequence, then there exists a strictly increasing sequence $\{k_n\}$ of natural numbers (i.e. $1\le k_1<k_2<k_3<\dots )$ such that $y_n=x_{k_n}$ holds for each $n$. Clearly, there exists a $k_0>0$ such that $k_n\ge n_0\mathrm{\forall }n>k_0$. Then, $|x-y_n|<ϵ\mathrm{\forall }n>k_0$. Thus, $\{y_n\}$ converges to $x$ too.

Theorem 2.17 (Bolzano Weierstrass theorem)

Every bounded sequence contains a convergent subsequence.

The proof of this theorem follows a constructive approach (i.e., we will construct a subsequence and show that it is convergent). We construct a sequence of nested closed intervals with increasingly smaller lengths and pick a point in each such interval to form a subsequence.

Proof. Let $\{x_n\}$ be a bounded sequence. Thus, there exists $M>0$ such that $|x_n|\le M$ for all $n\in \mathbb{N}$. Divide the interval $[-M,M]$ into two equal closed intervals $[-M,0]$ and $[0,M]$. At least one of the two halves must have an infinite number of points in $\{x_n\}$ (since if both halves had finite number of points, then the total number of points in the sequence would be finite which is a contradiction). Choose a half for which this is true, and label this half as $I_1$. Choose a point $x_{n_1}\in I_1$. Now divide $I_1$ into two equal closed intervals. Again, since $I_1$ contains infinite number of points, hence at least one of the halves must have infinite number of points. Pick a half which contains infinite number of points and label it as $I_2$. Now, pick a point $x_{n_2}$ from $I_2$ such that $n_2>n_1$. In general, construct a closed interval $I_k$ from a half of $I_{k-1}$ containing infinite number of points. Further, we choose a point $x_{n_k}$ such that $n_k>n_{k-1}>\cdots >n_2>n_1$ and $x_{n_k}\in I_k$. We claim that the subsequence $\{x_{n_k}\}$ is a convergent subsequence. For this, we need a limit for the sequence. Since

$$I_1\supseteq I_2\supseteq \cdots \supseteq I_k\supseteq \dots$$

are a nested sequence of closed intervals, hence by nested interval property, their intersection $I=\bigcap _{k=1}^{\mathrm{\infty }}{I}_k$ is non-empty. Actually, it’s easy to show that this $I$ is a singleton too. If there were two distinct points $x,y$ in $I$, then considering $d=|x-y|>0$, we could find an interval $I_j$ whose length is smaller than $d$. Thus both $x,y$ could not fit in $I_j$. Hence $I$ contains only one point. Let $I=\{x\}$. We now show that $x_{n_k}\to x$.

Let $ϵ>0$. By construction, the length of $I_k$ is $M\frac{1}{2^{k-1}}$. Since it converges to 0, hence, we can choose $n_0\in \mathbb{N}$ such that for every $k>n_0$, the length of $I_k$ is less than $ϵ$. Since $x$ and $x_{n_k}$ are both in $I_k$, hence it follows that $|x_{n_k}-x|<ϵ$.

2.3.5. Cauchy Sequence

Definition 2.38 (Cauchy sequence)

A sequence $\{x_n\}$ in $\mathbb{R}$ is called a Cauchy sequence if, for every $ϵ>0$, there exists $n_0\in \mathbb{N}$ (depending on $ϵ$) such that whenever $m,n>n_0$ it follows that $|x_m-x_n|<ϵ$.

Remark 2.9

A little thought would show that saying $m,n>n_0$ or $m,n\ge n_1$ doesn’t make much difference in the definition. The two thresholds can be related by : $n_1=n_0+1$.

Theorem 2.18 (Boundedness of Cauchy sequences)

A Cauchy sequence is bounded.

Proof. Let $\{x_n\}$. Choose $ϵ=1$. Then there exists $n_0\in \mathbb{N}$ such that $|x_n-x_m|<1$ whenever $m,n\ge n_0$. In particular, the statement is valid when $m=n_0$. i.e. $|x_n-x_{n_0}|<1$ . But,

$$|x_n-x_{n_0}|<1⟹||x_n|-|x_{n_0}||<1⟹|x_n|<1+|x_{n_0}|\mathrm{\forall }n\ge n_0.$$

Choosing $M=max(|x_1|,\dots ,|x_{n_0-1}|,|x_{n_0}|+1)$, it is clear that $|x_n|\le M$, hence $\{x_n\}$ is bounded.

Theorem 2.19 (Convergence of Cauchy sequences)

A Cauchy sequence is convergent.

Proof. Let $\{x_n\}$ be a Cauchy sequence. Hence it is bounded. Hence, by Bolzano Weierstrass theorem, it has a convergent subsequence.

Let $\{x_{n_k}\}$ be such a convergent subsequence with the limit $lim{x}_{n_k}=x$.

Thus, for any $ϵ>0$, there exists $n_1\in \mathbb{N}$ such that for all $k>n_1$,

$$|x_{n_k}-x|<\frac{ϵ}{2}.$$

Also, since $\{x_n\}$ is Cauchy, there exists $n_2\in \mathbb{N}$ such that for all $n,m>n_2$,

$$|x_n-x_m|<\frac{ϵ}{2}.$$

Pick any $k>n_1$ such that $n_k>n_2$. Then, for all $n>n_2$,

$$|x_n-x|\le |x_n-x_{n_k}|+|x_{n_k}-x|<\frac{ϵ}{2}+\frac{ϵ}{2}=ϵ.$$

Thus, $lim{x}_n=x$.

Theorem 2.20 (Convergence and Cauchyness)

A sequence of real numbers converges if and only if it is a Cauchy sequence.

Proof. Let a sequence $\{x_n\}$ converge to $ϵ$. Then for every $ϵ>0$, there exists $n_0\in \mathbb{N}$ such that $|x_n-x|<ϵ/2$ for all $n>n_0$. Clearly, if $m,n>n_0$, then

$$|x_m-x_n|\le |x_m-x|+|x-x_n|<\frac{ϵ}{2}+\frac{ϵ}{2}=ϵ.$$

Thus, $\{x_n\}$ is Cauchy.

For the converse, in the previous theorem, we proved that a Cauchy sequence is convergent.

Remark 2.10

Let $\{x_n\}$ be a Cauchy sequence with $lim{x}_n=x$. Let $ϵ>0$. Choose $n_0$ such that $m,n>n_0$ implies $|x_m-x_n|<ϵ$.

Then

$$|x_n-x|\le ϵ\mathrm{\forall }n>n_0.$$

Proof. We have, for all $m,n>n_0$

$$|x_m-x_n|<ϵ⟺x_m-ϵ<x_n<x_m+ϵ.$$

We will fix $n$ and vary $n$ to compute the limit inequalities.

1. Consider the strict inequality: $x_m-ϵ<x_n$ for all $m>n_0$.

2. Taking the limit on the sequence $x_m$ (in L.H.S.), we get: $x-ϵ\le x_n$.

3. Consider the strict inequality: $x_n<x_m+ϵ$ for all $m>n_0$.

4. Taking the limit on the sequence $x_m$ (in R.H.S.), we get: $x_n\le x+ϵ$.

5. Together, we get: $x-ϵ\le x_n\le x+ϵ$.

6. Combining, we get $|x_n-x|\le ϵ$ for all $n>n_0$.

See also Example 2.7.

2.3.6. Limit Inferior and Limit Superior

Theorem 2.21 (Sequences of partial suprema and infima)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$. Define

$$s_n=sup\{x_k|k\ge n\}$$

and

$$t_n=inf\{x_k|k\ge n\}.$$

If $\{x_n\}$ is not bounded above, then

$$\underset{n\to \mathrm{\infty }}{lim}{s}_n=\mathrm{\infty }.$$

If $\{x_n\}$ is not bounded below, then

$$\underset{n\to \mathrm{\infty }}{lim}{t}_n=-\mathrm{\infty }.$$

If $\{x_n\}$ is bounded from above, then $\{s_n\}$ is a nonincreasing sequence.

If $\{x_n\}$ is bounded from below, then $\{t_n\}$ is a nondecreasing sequence.

If $\{x_n\}$ is bounded, then both the sequences $\{s_n\}$ and $\{t_n\}$ are convergent.

Proof. Let $\{x_n\}$ not be bounded from above.

1. Then, for any $n\in \mathbb{N}$, the set $\{x_k|k\ge n\}$ is also not bounded from above.

2. Thus, $s_n=sup\{x_k|k\ge n\}=\mathrm{\infty }$ for all $n\in \mathbb{N}$.

3. Thus, $\underset{n\to \mathrm{\infty }}{lim}{s}_n=\mathrm{\infty }$.

Let $\{x_n\}$ not be bounded from below.

1. Then, for any $n\in \mathbb{N}$, the set $\{x_k|k\ge n\}$ is also not bounded from below.

2. Thus, $t_n=inf\{x_k|k\ge n\}=-\mathrm{\infty }$ for all $n\in \mathbb{N}$.

3. Thus, $\underset{n\to \mathrm{\infty }}{lim}{t}_n=-\mathrm{\infty }$.

We note that for $m<n$,

$$\{x_k|k\ge n\}\subseteq \{x_k|k\ge m\}.$$

Now, assume that $\{x_n\}$ is bounded from above.

1. Then, $sup\{x_k|k\ge n\}\le sup\{x_k|k\ge m\}$.

2. Or $s_n\le s_m$.

3. Thus, $m<n$ implies that $s_m\ge s_n$.

4. Thus, $\{s_n\}$ is a nonincreasing sequence.

Now, assume that $\{x_n\}$ is bounded from below.

1. Then, $inf\{x_k|k\ge n\}\ge inf\{x_k|k\ge m\}$.

2. Or $t_n\ge t_m$.

3. Thus, $m<n$ implies that $t_m\le t_n$.

4. Thus, $\{t_n\}$ is a nondecreasing sequence.

Now, assume that $\{x_n\}$ is bounded.

1. From Theorem 2.6, a monotone bounded sequence is convergent.

2. Since $\{x_n\}$ is bounded, hence $\{s_n\}$ is bounded too.

3. Since $\{x_n\}$ is bounded, hence $\{t_n\}$ is bounded too.

4. Thus, both $\{s_n\}$ and $\{t_n\}$ are bounded and monotone.

5. Thus, both of them are convergent sequences.

Definition 2.39 (Limit superior and inferior)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$. The limit superior of the sequence is defined as:

$$\underset{n\to \mathrm{\infty }}{lim sup}{x}_n\triangleq \underset{n\to \mathrm{\infty }}{lim}sup\{x_k|k\ge n\}.$$

Similarly, the limit inferior of the sequence is defined as:

$$\underset{n\to \mathrm{\infty }}{lim inf}{x}_n\triangleq \underset{n\to \mathrm{\infty }}{lim}inf\{x_k|k\ge n\}.$$

If we define

$$s_n=sup\{x_k|k\ge n\}\text{ and }{t}_n=inf\{x_k|k\ge n\}$$

then,

$$\underset{n\to \mathrm{\infty }}{lim sup}{x}_n=\underset{n\to \mathrm{\infty }}{lim}{s}_n$$

and

$$\underset{n\to \mathrm{\infty }}{lim inf}{x}_n=\underset{n\to \mathrm{\infty }}{lim}{t}_n.$$

It is imperative to establish that the definition of limit inferior and limit superior is justified.

1. If $\{x_n\}$ is not bounded from above, then $s_n=\mathrm{\infty }$.

2. If $\{x_n\}$ is bounded from above then $\{s_n\}$ is nondecreasing.

3. In this case, if $\{x_n\}$ is bounded from below, then $\{s_n\}$ converges, otherwise it diverges to $-\mathrm{\infty }$.

Similar justification applies for the limit inferior too.

Remark 2.11 (Limit superior and inferior for unbounded sequences)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$.

If $\{x_n\}$ is not bounded from above, then

$$\underset{n\to \mathrm{\infty }}{lim sup}{x}_n=\mathrm{\infty }.$$

If $\{x_n\}$ is not bounded from below, then

$$\underset{n\to \mathrm{\infty }}{lim inf}{x}_n=-\mathrm{\infty }.$$

Theorem 2.22 (Limit superior $\ge$ limit inferior)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$. Then,

$$\underset{n\to \mathrm{\infty }}{lim inf}{x}_n\le \underset{n\to \mathrm{\infty }}{lim sup}{x}_n.$$

Proof. If we define

$$s_n=sup\{x_k|k\ge n\}\text{ and }{t}_n=inf\{x_k|k\ge n\}$$

then, $t_n\le s_n$ for every $n$.

Then, by Theorem 2.12,

$$\underset{n\to \mathrm{\infty }}{lim}{t}_n\le \underset{n\to \mathrm{\infty }}{lim}{s}_n.$$

Thus,

$$\underset{n\to \mathrm{\infty }}{lim inf}{x}_n=\underset{n\to \mathrm{\infty }}{lim}{t}_n\le \underset{n\to \mathrm{\infty }}{lim}{s}_n=\underset{n\to \mathrm{\infty }}{lim sup}{x}_n.$$

Theorem 2.23 (Relationship between limit superior and inferior)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$. Then,

$$\underset{n\to \mathrm{\infty }}{lim sup}(-x_n)=-\underset{n\to \mathrm{\infty }}{lim inf}{x}_n.$$

Proof. We recall that

$$inf(-1\cdot A)=-1\cdot sup(A)\text{ and }sup(-1\cdot A)=-1\cdot infsup(A)$$

Thus,

$$\begin{array}{rl}\underset{n\to \mathrm{\infty }}{lim sup}(-x_n)& =\underset{n\to \mathrm{\infty }}{lim}sup\{-x_k|k\ge n\}\\ & =\underset{n\to \mathrm{\infty }}{lim}-inf\{x_k|k\ge n\}\\ & =-\underset{n\to \mathrm{\infty }}{lim}inf\{x_k|k\ge n\}\\ & =-\underset{n\to \mathrm{\infty }}{lim inf}{x}_n.\end{array}$$

Theorem 2.24 (Characterization of limit superior)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$. Let $u\in \mathbb{R}$. The following are equivalent.

1. $\underset{n\to \mathrm{\infty }}{lim sup}{x}_n=u$.

2. For any $ϵ>0$, there exists $n_0\in \mathbb{N}$ such that

   $$x_n<u+ϵ\mathrm{\forall }n\ge n_0.$$

   and there exists a subsequence $\{x_{k_n}\}$ of $\{x_n\}$ such that $\underset{n\to \mathrm{\infty }}{lim}{x}_{k_n}=u$.

Proof. TBD

Theorem 2.25 (Characterization of limit inferior)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$. Let $l\in \mathbb{R}$. The following are equivalent.

1. $\underset{n\to \mathrm{\infty }}{lim inf}{x}_n=l$.

2. For any $ϵ>0$, there exists $n_0\in \mathbb{N}$ such that

   $$x_n>l-ϵ\mathrm{\forall }n\ge n_0.$$

   and there exists a subsequence $\{x_{k_n}\}$ of $\{x_n\}$ such that $\underset{n\to \mathrm{\infty }}{lim}{x}_{k_n}=l$.

Proof. TBD

This leads us to the fact that the limit of a sequence exists if and only if its limit inferior and limit superior are identical.

2.3.6.1. Existence of Limit

Theorem 2.26 (Limit = limit superior = limit inferior)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$. Then,

$$\underset{n\to \mathrm{\infty }}{lim}{x}_n=l\text{ if and only if }\underset{n\to \mathrm{\infty }}{lim sup}{x}_n=\underset{n\to \mathrm{\infty }}{lim inf}{x}_n=l.$$

In other words the limit of a sequence exists if and only if both limit superior and limit inferior are equal and in this case, the limit of sequence equals the limit superior and inferior.

Proof. TBD

2.3.6.2. Subsequences

Theorem 2.27 (Convergent subsequences and limit superior/inferior)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$. Let $\{x_{k_n}\}$ be an arbitrary subsequence of $\{x_n\}$.

Suppose $lim sup{x}_n=u$. If $\{x_{k_n}\}$ converges then

$$\underset{n\to \mathrm{\infty }}{lim}{x}_{k_n}\le u.$$

Suppose $lim inf{x}_n=l$. If $\{x_{k_n}\}$ converges then

$$\underset{n\to \mathrm{\infty }}{lim}{x}_{k_n}\ge l.$$

Proof. Assume that $lim sup{x}_n=u$.

1. Let $ϵ>0$.

2. By Theorem 2.24, there exists $n_0$ such that for all $n>n_0$

   $$x_n<u+ϵ.$$

3. Let $\underset{n\to \mathrm{\infty }}{lim}{x}_{k_n}=s$.

4. Then, there exists $n_1$ such that for all $k_n>n_1$

   $$s-ϵ<x_{k_n}<s+ϵ.$$

5. Let $n_2=max(n_0,n_1)$.

6. Then, for all $k_n>n_2$

   $$s-ϵ<x_{k_n}<u+ϵ.$$

7. Thus, $s<u+2ϵ$ for every $ϵ>0$.

8. Thus, $s\le u$.

The proof for limit inferior is similar.

Remark 2.12 (The set of subsequential limits for bounded sequences)

Let $\{x_n\}$ be a bounded sequence of $\mathbb{R}$. Define

$$A=\{x\in \mathbb{R}|\text{ there exists a subsequence }\{x_{k_n}\}\text{ with }lim{x}_{k_n}=x\}.$$

This is the set of limits of convergent subsequences of $\{x_n\}$. By Theorem 2.17 $\{x_n\}$ has a convergent subsequence since it is bounded. Hence, $A$ is not empty.

Each element of $A$ is called a subsequential limit of $\{x_n\}$. Due to Theorem 2.21, both $lim sup{x}_n$ and $lim inf{x}_n$ are finite since $\{x_n\}$ is bounded.

Let $a\in A$. Then, by Theorem 2.27:

$$lim inf{x}_n\le a\le lim sup{x}_n.$$

By Theorem 2.24, there exists $u\in A$ such that

$$lim sup{x}_n=u.$$

By Theorem 2.25, there exists $l\in A$ such that

$$lim inf{x}_n=l.$$

Thus,

$$lim sup{x}_n=maxA\text{ and }lim inf{x}_n=minA.$$

2.3.6.3. Arithmetic

Theorem 2.28 (Arithmetic of limit superior and inferior)

Let $\{a_n\}$ and $\{b_n\}$ be sequences of $\mathbb{R}$.

The limit superior satisfies subadditivity.

$$\underset{n\to \mathrm{\infty }}{lim sup}(a_n+b_n)\le \underset{n\to \mathrm{\infty }}{lim sup}{a}_n+\underset{n\to \mathrm{\infty }}{lim sup}{b}_n.$$

The limit inferior satisfies superadditivity.

$$\underset{n\to \mathrm{\infty }}{lim inf}(a_n+b_n)\ge \underset{n\to \mathrm{\infty }}{lim inf}{a}_n+\underset{n\to \mathrm{\infty }}{lim inf}{b}_n.$$

If both $\{a_n\}$ and $\{b_n\}$ are nonnegative, then

$$\underset{n\to \mathrm{\infty }}{lim sup}(a_n{b}_n)\le \left(\underset{n\to \mathrm{\infty }}{lim sup}{a}_n\right)\left(\underset{n\to \mathrm{\infty }}{lim sup}{b}_n\right)$$

and

$$\underset{n\to \mathrm{\infty }}{lim inf}(a_n{b}_n)\ge \left(\underset{n\to \mathrm{\infty }}{lim inf}{a}_n\right)\left(\underset{n\to \mathrm{\infty }}{lim inf}{b}_n\right).$$

2.3.6.4. Order

Theorem 2.29 (Order properties of limit superior and inferior)

Let $\{x_n\}$ and $\{y_n\}$ be sequences of $\mathbb{R}$.

1. If $x_n\ge 0$ for all $n\in \mathbb{N}$, then $\underset{n\to \mathrm{\infty }}{lim inf}x\ge 0$.

2. If $x_n\le 0$ for all $n\in \mathbb{N}$, then $\underset{n\to \mathrm{\infty }}{lim sup}x\le 0$.

3. If $x_n\le y_n$ for all $n\in \mathbb{N}$, then $lim sup{x}_n\le lim sup{y}_n$.

4. If $x_n\ge y_n$ for all $n\in \mathbb{N}$, then $lim inf{x}_n\ge lim inf{y}_n$.

Proof. Assume that $x_n\ge 0$.

1. Then, $inf\{x_k|k\ge n\}\ge 0$.

2. Thus,

   $$\underset{n\to \mathrm{\infty }}{lim inf}{x}_n=\underset{n\to \mathrm{\infty }}{lim}inf\{x_k|k\ge n\}\ge \underset{n\to \mathrm{\infty }}{lim}0=0.$$

Assume that $x_n\le 0$.

1. Then, $sup\{x_k|k\ge n\}\le 0$.

2. Thus,

   $$\underset{n\to \mathrm{\infty }}{lim sup}{x}_n=\underset{n\to \mathrm{\infty }}{lim}sup\{x_k|k\ge n\}\le \underset{n\to \mathrm{\infty }}{lim}0=0.$$

Assume that $x_n\le y_n$ for all $n\in \mathbb{N}$.

1. Choose any $k\in \mathbb{N}$.

2. Let $M_n=sup\{y_k|k\ge n\}$.

3. Then, $y_k\le M_n$ for every $k\ge n$.

4. Then, $x_k\le y_k\le M_n$ for every $k\ge n$.

5. Taking supremum over $k\ge n$, $m_n=sup\{x_k|k\ge n\}\le M_n$.

6. Thus, $m_n\le M_n$ for every $n$.

7. Thus, by Theorem 2.12, $lim{m}_n\le lim{M}_n$.

8. Thus, $lim sup{x}_n\le lim sup{y}_n$.

A similar argument can be used for $x_n\ge y_n$ also.

2.3.6.5. Damping and Growing Sequences

Theorem 2.30 (Damping sequences)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$ such that $x_n>0$ for every $n$.

Assume that the following holds:

$$\underset{n\to \mathrm{\infty }}{lim sup}\frac{x_{n+1}}{x_n}=u<1.$$

Then, $\underset{n\to \mathrm{\infty }}{lim}{x}_n=0$.

Proof. We proceed as follows.

1. Since $\frac{x_{n+1}}{x_n}>0$, hence $u\ge 0$.

2. Since $u<1$, we can choose an $ϵ>0$ such that $u+ϵ<1$.

3. Let $q=u+ϵ$. Then, $0<q<1$.

4. By Theorem 2.24, there exists $n_0\in \mathbb{N}$ such that for all $n\ge n_0$

   $$\frac{x_{n+1}}{x_n}<u+ϵ=q.$$

5. Thus, $x_{n+1}<q{x}_n$ for every $n\ge n_0$.

6. Let $x=x_{n_0}$.

7. Then, we have $x_n<q^{n-n_0}x$ for every $n>n_0$.

8. Also, $\underset{n\to \mathrm{\infty }}{lim}{q}^{n-n_0}x=0$ since $q<1$.

9. We have $0<x_n<q^{n-n_0}x$ for all $n>n_0$.

10. Hence, due to the squeeze theorem, $\underset{n\to \mathrm{\infty }}{lim}{x}_n=0$.

Theorem 2.31 (Growing sequences)

Let $\{x_n\}$ be a sequence of $\mathbb{R}$ such that $x_n>0$ for every $n$.

Assume that the following holds:

$$\underset{n\to \mathrm{\infty }}{lim inf}\frac{x_{n+1}}{x_n}=l>1.$$

Then, $\underset{n\to \mathrm{\infty }}{lim}{x}_n=\mathrm{\infty }$.

Proof. We proceed as follows.

1. Since $l>1$, we can choose an $ϵ>0$ such that $l-ϵ>1$.

2. Let $q=l-ϵ$. Then, $q>1$.

3. By Theorem 2.25, there exists $n_0\in \mathbb{N}$ such that for all $n\ge n_0$

   $$\frac{x_{n+1}}{x_n}>l-ϵ=q.$$

4. Thus, $x_{n+1}>q{x}_n$ for every $n\ge n_0$.

5. Let $x=x_{n_0}$.

6. Then, we have $x_n>q^{n-n_0}x$ for every $n>n_0$.

7. Also, $\underset{n\to \mathrm{\infty }}{lim}{q}^{n-n_0}x=\mathrm{\infty }$ since $q>1$.

8. We have $x_n>q^{n-n_0}x$ for all $n>n_0$.

9. Hence, $lim{x}_n\ge lim{q}^{n-n_0}x=\mathrm{\infty }$.

10. Thus, $lim{x}_n=\mathrm{\infty }$.