Skip to content
Topos Uranos

Summary

The preceding lesson decided the convergence of a series with positive terms by comparing it with another whose nature is known. This lesson takes the geometric series as the series of comparison, and obtains from it two tests that look only at the series itself: the root test, which studies the limit superior of ann\sqrt[n]{a_n}, and the ratio test, which studies the limits superior and inferior of an+1an\frac{a_{n + 1}}{a_n}. Both are stated with the limits superior and inferior from the unit on sequences, which always exist, and not with limits, which may fail to exist. The lesson proves the sequence of inequalities between those four numbers, from which it follows that the root test decides whenever the ratio test decides, and shows series on which only the root test decides. When the number studied by the test equals 11, that number does not decide: the series ∑n=1∞1n\sum_{n=1}^{\infty} \frac{1}{n} and ∑n=1∞1n(n+1)\sum_{n=1}^{\infty} \frac{1}{n(n + 1)} give 11 in both tests and have opposite natures. The reason is that both tests prove convergence only for series whose term tends to 00 at a geometric rate; that same rate gives remainder bounds, with which a sum can be computed to any desired precision. Finally, the two tests extend to series with terms of arbitrary sign, applied to the absolute values.

Learning objectives

  1. Translate the conditions on the limits superior and inferior into inequalities that hold from some index on, and bound a series by a geometric one.
  2. Prove the root test and the ratio test in their versions with limits superior and inferior, also for series with terms of arbitrary sign, and recognize when they do not decide.
  3. Prove the inequality between the limits of the ratios and of the roots, and deduce that the root test decides whenever the ratio test decides.
  4. Bound the remainder of a series that converges by these tests and compute how many terms suffice for a given precision.

Limits superior and inferior and bounds from some index on

The lesson on subsequences and the limits superior and inferior defined the limit superior of a sequence (xn)(x_n) bounded above as the limit of the suprema of its tails, un=sup⁡k≥nxku_n = \sup_{k \geq n} x_k (there they are called sns_n; here the letter is changed so as not to confuse them with the partial sums SnS_n), which exist by the completeness axiom and form a decreasing sequence; if the unu_n are not bounded below, the limit superior is −∞-\infty, and if (xn)(x_n) is not bounded above, it is ∞\infty. The limit inferior is defined in the same way with the infima tn=inf⁡k≥nxkt_n = \inf_{k \geq n} x_k, which form an increasing sequence. These numbers always exist, even if the sequence has no limit, and that is why the tests of this lesson are stated with them. The sequences of interest here, ann\sqrt[n]{a_n} and an+1an\frac{a_{n + 1}}{a_n}, are not negative, but they may be unbounded, and the theorem on the characterization of the limit superior and the limit inferior, from that lesson, assumes the sequence bounded. The following lemma gives what is needed in all cases. We adopt the convention that −∞<x<∞-\infty < x < \infty for every real xx; thus “lim sup⁡n→∞xn<c\limsup_{n \to \infty} x_n < c” is false if the limit superior is ∞\infty, and true if it is −∞-\infty.

LemmaBounds from some index on

Let (xn)(x_n) be a sequence and cc a real number. Then:

  1. if lim sup⁡n→∞xn<c\limsup_{n \to \infty} x_n < c, there is a natural number NN such that xn<cx_n < c for every n≥Nn \geq N;
  2. if lim sup⁡n→∞xn>c\limsup_{n \to \infty} x_n > c, for every natural number NN there is some n≥Nn \geq N with xn>cx_n > c;
  3. if there is a natural number NN such that xn≤cx_n \leq c for every n≥Nn \geq N, then lim sup⁡n→∞xn≤c\limsup_{n \to \infty} x_n \leq c;
  4. if lim inf⁡n→∞xn>c\liminf_{n \to \infty} x_n > c, there is a natural number NN such that xn>cx_n > c for every n≥Nn \geq N; and if there is a natural number NN such that xn≥cx_n \geq c for every n≥Nn \geq N, then lim inf⁡n→∞xn≥c\liminf_{n \to \infty} x_n \geq c.

A limit superior less than cc leaves below cc all the terms from some index on; one greater than cc leaves above cc infinitely many terms.

Proof

  1. n≥N→xn≤un≤uN<cn \geq N \rightarrow x_n \leq u_n \leq u_N < \resaltar{c}

    Let lim sup⁡n→∞xn<c\limsup_{n \to \infty} x_n < c. The limit superior is not ∞\infty, and by the definition the sequence is bounded above; the suprema unu_n exist and form a decreasing sequence. The number cc is not a lower bound of the unu_n: if they are not bounded below, by the definition; if they are, because their limit is their infimum, by the monotone convergence theorem, from the lesson on monotonic sequences and the number e, and that infimum is less than cc. There is, therefore, some NN with uN<cu_N < c, and since (un)(u_n) is decreasing, the bound follows.

  2. (∀N∈N)(∃n≥N)(xn>c)(\forall N \in \mathbb{N})(\exists n \geq N)\left(\resaltar{x_n > c}\right)

    Let lim sup⁡n→∞xn>c\limsup_{n \to \infty} x_n > c and let NN be a natural number. If the limit superior is ∞\infty, the sequence is not bounded above, and neither is its tail from NN on: if a number MM bounded that tail, the greatest of MM and of the terms preceding NN would bound the sequence. If it is a real number LL, then LL is the infimum of the unu_n, by the monotone convergence theorem, and uN≥L>cu_N \geq L > c; since uNu_N is the least upper bound of the tail from NN on, the number cc is not an upper bound of it. In both cases, some term of the tail exceeds cc.

  3. un≤c(n≥N)→lim sup⁡n→∞xn≤cu_n \leq c \quad (n \geq N) \rightarrow \resaltar{\limsup_{n \to \infty} x_n \leq c}

    Suppose that xn≤cx_n \leq c for every n≥Nn \geq N. The sequence is bounded above by the greatest of cc and of the terms preceding NN, and for n≥Nn \geq N the number cc is an upper bound of the tail from nn on, so that un≤cu_n \leq c. If the unu_n are not bounded below, the limit superior is −∞-\infty, less than cc; if they are, the preservation of inequalities, from the theorem stating that the limit theorems hold for sequences, from the lesson on sequences and their limit, gives the bound.

  4. n≥N→xn≥tn≥tN>c,tn≥c(n≥N)→lim inf⁡n→∞xn≥cn \geq N \rightarrow x_n \geq t_n \geq t_N > \resaltar{c}, \qquad t_n \geq c \quad (n \geq N) \rightarrow \resaltar{\liminf_{n \to \infty} x_n \geq c}

    For the limit inferior one argues in the same way with the infima tnt_n, which form an increasing sequence. If lim inf⁡n→∞xn>c\liminf_{n \to \infty} x_n > c, the limit inferior is not −∞-\infty, the sequence is bounded below, and cc is not an upper bound of the tnt_n: if they are not bounded above, by the definition, and if they are, because their limit, greater than cc, is their supremum. There is some NN with tN>ct_N > c, and the first bound follows. If xn≥cx_n \geq c for every n≥Nn \geq N, the sequence is bounded below and tn≥ct_n \geq c for n≥Nn \geq N; the limit inferior is ∞\infty if the tnt_n are not bounded above, and otherwise the preservation of inequalities gives the second bound.

The third item does not hold with strict inequalities: if xn<cx_n < c for every nn, the limit superior may be equal to cc, like that of xn=1−1nx_n = 1 - \frac{1}{n} with c=1c = 1. That is why the tests of this lesson require the limit superior to be less than 11, and not the terms.