Lecture Fifteen
Math 101
August 2, 2019
Last time, we closed with a new concept, namely that of absolute or conditional convergence. We also saw that, to show that a series converges, it is enough to show that it converges absolutely – although, of course, not every convergent series is absolutely convergent. We briefly state the following theorem, which we will not need in this course.
∞ X Theorem 10.9 (Riemann series theorem). If an is conditionally n=1 convergent, then for any value c ∈ R∪{±∞}, there exists a reordering ∞ X of the terms aσ(n) (say) such that aσ(n) = c. n=1
Proof. (Idea) To be conditionally convergent, the series necessarily has infinitely many positive terms and infinitely many negative terms, both of which converge to zero (by the divergence test). With c > 0 fixed, we add positive terms until the partial sum exceeds c, then negative terms until the partial sum is less than c, and so on.
∞ X cos n Example 98: Determine whether or not the series is convergent. n2 n=1 Solution: The divergence test is unhelpful here, and the comparison, integral, and alternating series test cannot be applied (the series is neither alternating, nor made up of solely positive terms). However, we see that
cos n | cos n| 1 0 ≤ = ≤ , n2 n2 n2
1 ∞ ∞ X X cos n so the series |a | converges, by the comparison test. It follows that is n n2 n=1 n=1 absolutely convergent, and so in particular (by proposition 10.8) is convergent. ♣ We like absolute convergence because, unlike in the situation encountered in the Riemann series theorem, every absolutely convergent series converges to exactly one ∞ X value, no matter how the terms of the series are permuted. That is, if aσ(n) is n=1 ∞ X some permutation/rearrangement of the series an, then n=1
∞ ∞ X X aσ(n) = an. n=1 n=1 There are two special tests we have for absolute convergence, which turn out to be equivalent, meaning that one test will work if and only if the other test will work.
∞ X Theorem 10.10 (The ratio test). Suppose an satisfies an 6= 0 for n=1 |a | all n ≥ N, for some integer N, and let L = lim n+1 . n→∞ |an|
∞ X 1. If L < 1, then an converges absolutely. n=1
∞ X 2. If L > 1, then an diverges. n=1 3. If L = 1, then no information is gained.
∞ X Theorem 10.11 (The root test). Suppose an satisfies an 6= 0 for n=1 pn 1/n all n ≥ N, for some integer N, and let L = lim |an| = lim |an| . n→∞ n→∞
∞ X 1. If L < 1, then an converges absolutely. n=1
2 ∞ X 2. If L > 1, then an diverges. n=1 3. If L = 1, then no information is gained.
Both of these tests work by, essentially, telling us how far our series is from a geometric series.
∞ X n3 Example 99: Does (−1)n converge? 3n n=1 Solution: Our terms are all nonzero, so we may apply the ratio test. We have
n+1 (n+1)3 3 a (−1) n+1 1 n + 1 n+1 = 3 = , n3 an n 3 n (−1) 3n
1 and taking the limit as n → ∞ gives us L = 3 , using the notation of the ratio test. Because an+1 1 L = lim = < 1, n→∞ an 3 it follows from the ratio test that the series converges absolutely. ♣
∞ X n! Example 100: What about ? nn n=1 Solution: The presence of a factorial symbol is usually and indication that the ratio test may be applied. All our terms are again nonzero, so we may compute
(n+1)! n n an+1 (n+1)n+1 n 1 = = = 1 − , a n! n + 1 n n nn which we recall from the definition of the exponential function converges to e−1 < 1. It now follows from the ratio test that the series is (absolutely) convergent. ♣
∞ n X 2n + 3 Example 101: What about ? 3n + 4 n=1
3 Solution: This time, the exponent n indicates that we might want to try the root test (instead of the ratio test). Indeed,
n 1/n 1/n 2n + 3 2n + 3 n→∞ 2 |an| = = −→ < 1. 3n + 4 3n + 4 3
1/n 2 That is, lim |an| = , and so by the root test, the series is absolutely convergent n→∞ 3 (and therefore convergent). ♣ Fact: One has lim n1/n = 1. n→∞ This fact will often be useful in various applications of the root test, and can be used without proof on any quiz or exam. How can these tests fail? We consider three situations where no information is gained by applying the ratio test or the root test. 1 1. When an = n , we have