Principles of Power Series

Total Page:16

File Type:pdf, Size:1020Kb

Principles of Power Series POWER SERIES JAMES KEESLING 1. Introduction In this summary we will cover the basic features of power series. Power series is an important way to analyze functions in various settings. When a function agrees with its power series it is said to be analytic. Sometimes one specifies the interval over which the function is analytic. The functions with power series representation take us beyond the polynomials. The analytic functions include polynomials, rational functions, the loga- rithm function, the exponential function, the trigonometric functions, among many others. Virtually every function with major applications is in this category. 2. The Geometric Series Of first importance is the geometric series. We will prove the convergence of this series in this section. The proof is simple, but it is fundamental in what will follow. Theorem 1. Suppose that jxj < 1, then 1 X 1 xn = : 1 − x n=0 1 P1 n Furthermore, if 0 < " < 2 , then n=0 x converges uniformly to its limit on the interval [−1 + "; 1 − "]. If jxj ≥ 1, then the series diverges. PN n Proof. Assume that jxj < 1. Let N be a positive integer and let SN = n=0 x . Then N N+1 X n+1 X n x · SN = x = x n=0 n=1 and N N+1 X n X n N+1 (1 − x) · SN = x − x = 1 − x n=0 n=1 which gives us 1 − xN+! S = : N 1 − x 1 2 JAMES KEESLING n 1 Since jxj < 1, limn!1 x = 0 and thus limn!1 SN = 1−x . This is precisely what we mean by 1 X 1 xn = : 1 − x n=0 1 For the second part of the proof, let δ > 0 and suppose that 0 < " < 2 . Let x 2 P1 n (1−")K [−1 + "; 1 − "]. Let N be such that for all K ≥ N, n=K (1 − ") = " < δ. Now for any 0 ≤ jxj < 1 − " and K ≥ N, 1 1 1 X xK X jxjK X (1 − ")K xn = ≤ jxjn = ≤ (1 − ")n = < δ: 1 − x 1 − jxj " n=K n=K n=K P1 n 1 Thus, n=0 x converges uniformly to 1−x on [−1 + "; 1 − "]. P1 n It is easy to show that if jxj ≥ 1, then n=0 x diverges. We will leave that to the reader. 3. General Power Series and the Radius of Convergence P1 n Suppose that n=0 anx is any power series centered at 0. Let pn lim sup janj = α n!1 1 where 0 ≤ α ≤ 1. Let R = α , 0 ≤ R ≤ 1. Then we have the following theorem. P1 n Theorem 2. The series n=0 anx converges for all jxj < R. Furthermore, it converges uniformly on any interval [−M; M] with 0 ≤ M < R. If jxj > R, then the series diverges. For x = R or x = −R, the series may converge or it may not converge. Proof. The case R = 0 is trivial. The proof for R finite can be modified for the case that R = 1. So, we assume that R is finite. Let jxj < R. Suppose that N is such that for pn 1 1 1 pn n jxj all n ≥ N, janj < jxj . Note that jxj > α = R . So, for all n ≥ N, janjjxj < R . Of course, this implies that n jxjn pn ja jjxjn < n R and thus that 1 1 1 n X n X X jxj pn ja jjxjn = ja jjxjn < n n R n=N n=N n=N P1 n converges. This implies that n=N anx converges for jxj < R. This implies that P1 n n=0 anx converges for jxj < R since this last sum adds only a finite number of terms to the series. POWER SERIES 3 The fact that this series converges uniformly on any interval [−M; M] with 0 ≤ M < R follows from the proof for that case in the proof of Theorem 1. The fact that the series diverges for jxj > R is easy to prove and we leave it as an exercise for the reader. There are examples where the series may converge or diverge at x = R or x = −R. We say that R as defined above is the radius of convergence for the power series P1 n n=0 anx . Note that the radius of convergence R can be characterized as the largest R such that the series converges for all x 2 (−R; R) and diverges for jxj > R. The formula pn 1 lim supn!1 janj = α with R = α gives us a way to calculate the value of R, but if we could determine a value M by any means such the series converges for all x 2 (−M; M) and diverges for jxj > M, then M would be the radius of convergence for the series. In x9 we will give another way which is sometimes useful in determining the radius of convergence. 4. Antiderivatives and Integration of Power Series P1 n Theorem 3. Let f(x) = n=0 anx and suppose that the radius of convergence for this P1 an n+1 series is R > 0. Let g(x) = n=0 n+1 x . Then the radius of convergence for g(x) is also R and for all jxj < R, g0(x) = f(x). P1 n Proof. Consider the power series n=0 anx with radius of convergence R. Note that if R = 0, then the series only converges for x = 0. So, for a meaningful discussion, we have P1 n assumed that 0 < R ≤ 1. Now f(x) = n=0 anx is well-defined on the interval (−R; R). P1 an n+1 Let g(x) = n=0 n+1 x . It is easy to check that g(x) is represented by a power series that also has radius of convergence R. Let jxj < R. Then note that Z x Z x 1 ! Z x N ! X n X n (1) f(t)dt = ant dt = lim ant dt N!1 0 0 n=0 0 n=0 Z x N ! X n (2) = lim ant dt N!1 0 n=0 N+1 X an+1 (3) = lim xn N!1 n + 1 n=0 1 X an+1 (4) = xn n + 1 n=0 = g(x)(5) P1 n Going from the first to the second step is because the convergence of n=0 ant is uniform on the interval over which the integration takes place. So, this proves that g(x) is an 0 antiderivative of f(x) and that g (x) = f(x). We can apply this theorem to several examples. We know from elementary Calculus d 1 P1 n that dx ln(1 + x) = 1+x = n=0(−x) . By integrating term by term as above we get 4 JAMES KEESLING 1 X xn ln(1 + x) + C = (−1)n+1 n n=1 for all jxj < 1 for some constant C. By evaluating both sides of the equation at x = 0 we obtain that C = 0. Thus, 1 X xn ln(1 + x) = (−1)n+1 : n n=1 d 1 P1 2 n Similarly, dx arctan(x) = 1+x2 = n=0(−x ) . Again, by integrating term by term we get 1 X x2n+1 arctan(x) + C = (−1)n+1 2n + 1 n=1 for some constant C for all jxj < 1. By evaluating both sides of the equation at x = 0 we get that C = 0. Thus, 1 X x2n+1 arctan(x) = (−1)n+1 : 2n + 1 n=1 5. Derivatives of Power Series P1 n Now just because the power series n=0 anx converges on (−R; R) and even uniformly on [−M; M] ⊂ (−R; R) does not mean that the series which is the term-by-term derivative of that series would necessarily be the derivative of the series. It turns out that this is the case, but it requires a proof. The proof that we give is indirect. P1 n Theorem 4. Let f(x) = n=0 anx and suppose that f(x) has radius of convergence P1 n R. Let g(x) = n=1(n + 1)an+1x . Then g(x) also has radius of convergence R and f 0(x) = g(x) for all x 2 (−R; R). P1 n P1 n Proof. Let f(x) = n=0 anx and let g(x) = n=1(n + 1)an+1x . Note that g(x) is the term by term derivative of f(x). Suppose that R is the radius of convergence for the series that defines f(x). Then 1 pn = lim sup janj = α: R n!1 However, it is easy to show that 1 pn = lim sup (n + 1)jan+1j = α R n!1 as well. So, the series representing f(x) and that representing g(x) both have radius of convergence R. Since f(x) is the term by term integral of g(x), it must be that it is the 0 antiderivative of g(x). Thus, f (x) = g(x) as was to be proved. POWER SERIES 5 1 P1 n We have examples of this as well. Since the Geometric Series 1−x = n=0 x has radius of convergence R = 1, 1 1 X = (n + 1)xn (1 − x)2 n=0 also has radius of convergence R = 1. 6. Power Series Centered at an Arbitrary Point We have been discussing power series centered at 0. We could have defined a power series centered at a for any real a. This would take the form 1 X n an(x − a) : n=0 We calculate the radius of convergence the same way as in x3 using the coefficients an of the series.
Recommended publications
  • Calculus and Differential Equations II
    Calculus and Differential Equations II MATH 250 B Sequences and series Sequences and series Calculus and Differential Equations II Sequences A sequence is an infinite list of numbers, s1; s2;:::; sn;::: , indexed by integers. 1n Example 1: Find the first five terms of s = (−1)n , n 3 n ≥ 1. Example 2: Find a formula for sn, n ≥ 1, given that its first five terms are 0; 2; 6; 14; 30. Some sequences are defined recursively. For instance, sn = 2 sn−1 + 3, n > 1, with s1 = 1. If lim sn = L, where L is a number, we say that the sequence n!1 (sn) converges to L. If such a limit does not exist or if L = ±∞, one says that the sequence diverges. Sequences and series Calculus and Differential Equations II Sequences (continued) 2n Example 3: Does the sequence converge? 5n 1 Yes 2 No n 5 Example 4: Does the sequence + converge? 2 n 1 Yes 2 No sin(2n) Example 5: Does the sequence converge? n Remarks: 1 A convergent sequence is bounded, i.e. one can find two numbers M and N such that M < sn < N, for all n's. 2 If a sequence is bounded and monotone, then it converges. Sequences and series Calculus and Differential Equations II Series A series is a pair of sequences, (Sn) and (un) such that n X Sn = uk : k=1 A geometric series is of the form 2 3 n−1 k−1 Sn = a + ax + ax + ax + ··· + ax ; uk = ax 1 − xn One can show that if x 6= 1, S = a .
    [Show full text]
  • Topic 7 Notes 7 Taylor and Laurent Series
    Topic 7 Notes Jeremy Orloff 7 Taylor and Laurent series 7.1 Introduction We originally defined an analytic function as one where the derivative, defined as a limit of ratios, existed. We went on to prove Cauchy's theorem and Cauchy's integral formula. These revealed some deep properties of analytic functions, e.g. the existence of derivatives of all orders. Our goal in this topic is to express analytic functions as infinite power series. This will lead us to Taylor series. When a complex function has an isolated singularity at a point we will replace Taylor series by Laurent series. Not surprisingly we will derive these series from Cauchy's integral formula. Although we come to power series representations after exploring other properties of analytic functions, they will be one of our main tools in understanding and computing with analytic functions. 7.2 Geometric series Having a detailed understanding of geometric series will enable us to use Cauchy's integral formula to understand power series representations of analytic functions. We start with the definition: Definition. A finite geometric series has one of the following (all equivalent) forms. 2 3 n Sn = a(1 + r + r + r + ::: + r ) = a + ar + ar2 + ar3 + ::: + arn n X = arj j=0 n X = a rj j=0 The number r is called the ratio of the geometric series because it is the ratio of consecutive terms of the series. Theorem. The sum of a finite geometric series is given by a(1 − rn+1) S = a(1 + r + r2 + r3 + ::: + rn) = : (1) n 1 − r Proof.
    [Show full text]
  • Formal Power Series - Wikipedia, the Free Encyclopedia
    Formal power series - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Formal_power_series Formal power series From Wikipedia, the free encyclopedia In mathematics, formal power series are a generalization of polynomials as formal objects, where the number of terms is allowed to be infinite; this implies giving up the possibility to substitute arbitrary values for indeterminates. This perspective contrasts with that of power series, whose variables designate numerical values, and which series therefore only have a definite value if convergence can be established. Formal power series are often used merely to represent the whole collection of their coefficients. In combinatorics, they provide representations of numerical sequences and of multisets, and for instance allow giving concise expressions for recursively defined sequences regardless of whether the recursion can be explicitly solved; this is known as the method of generating functions. Contents 1 Introduction 2 The ring of formal power series 2.1 Definition of the formal power series ring 2.1.1 Ring structure 2.1.2 Topological structure 2.1.3 Alternative topologies 2.2 Universal property 3 Operations on formal power series 3.1 Multiplying series 3.2 Power series raised to powers 3.3 Inverting series 3.4 Dividing series 3.5 Extracting coefficients 3.6 Composition of series 3.6.1 Example 3.7 Composition inverse 3.8 Formal differentiation of series 4 Properties 4.1 Algebraic properties of the formal power series ring 4.2 Topological properties of the formal power series
    [Show full text]
  • The Discovery of the Series Formula for Π by Leibniz, Gregory and Nilakantha Author(S): Ranjan Roy Source: Mathematics Magazine, Vol
    The Discovery of the Series Formula for π by Leibniz, Gregory and Nilakantha Author(s): Ranjan Roy Source: Mathematics Magazine, Vol. 63, No. 5 (Dec., 1990), pp. 291-306 Published by: Mathematical Association of America Stable URL: http://www.jstor.org/stable/2690896 Accessed: 27-02-2017 22:02 UTC JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at http://about.jstor.org/terms Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to Mathematics Magazine This content downloaded from 195.251.161.31 on Mon, 27 Feb 2017 22:02:42 UTC All use subject to http://about.jstor.org/terms ARTICLES The Discovery of the Series Formula for 7r by Leibniz, Gregory and Nilakantha RANJAN ROY Beloit College Beloit, WI 53511 1. Introduction The formula for -r mentioned in the title of this article is 4 3 57 . (1) One simple and well-known moderm proof goes as follows: x I arctan x = | 1 +2 dt x3 +5 - +2n + 1 x t2n+2 + -w3 - +(-I)rl2n+1 +(-I)l?lf dt. The last integral tends to zero if Ix < 1, for 'o t+2dt < jt dt - iX2n+3 20 as n oo.
    [Show full text]
  • AN INTRODUCTION to POWER SERIES a Finite Sum of the Form A0
    AN INTRODUCTION TO POWER SERIES PO-LAM YUNG A finite sum of the form n a0 + a1x + ··· + anx (where a0; : : : ; an are constants) is called a polynomial of degree n in x. One may wonder what happens if we allow an infinite number of terms instead. This leads to the study of what is called a power series, as follows. Definition 1. Given a point c 2 R, and a sequence of (real or complex) numbers a0; a1;:::; one can form a power series centered at c: 2 a0 + a1(x − c) + a2(x − c) + :::; which is also written as 1 X k ak(x − c) : k=0 For example, the following are all power series centered at 0: 1 x x2 x3 X xk (1) 1 + + + + ::: = ; 1! 2! 3! k! k=0 1 X (2) 1 + x + x2 + x3 + ::: = xk: k=0 We want to think of a power series as a function of x. Thus we are led to study carefully the convergence of such a series. Recall that an infinite series of numbers is said to converge, if the sequence given by the sum of the first N terms converges as N tends to infinity. In particular, given a real number x, the series 1 X k ak(x − c) k=0 converges, if and only if N X k lim ak(x − c) N!1 k=0 exists. A power series centered at c will surely converge at x = c (because one is just summing a bunch of zeroes then), but there is no guarantee that the series will converge for any other values x.
    [Show full text]
  • Zeros and Coefficients
    Zeros and coefficients Alexandre Eremenko∗ 10.28.2015 Abstract Asymptotic distribution of zeros of sequences of analytic functions is studied. Let fn be a sequence of analytic functions in a region D in the complex plane. The case of entire functions, D = C will be the most important. Sup- pose that there exist positive numbers Vn → ∞, such that the subharmonic functions 1 log |fn| areuniformlyboundedfromabove (1) Vn on every compact subset of D, and for some z0 ∈ D the sequence 1 log |fn(z0)| isboundedfrombelow. (2) Vn Under these conditions, one can select a subsequence such that for this sub- sequence 1 log |fn| → u, (3) Vn where u is a subharmonic function in D, u =6 −∞. This convergence can be understood in various senses, for example, quasi-everywhere, which means at every point except a set of points of zero logarithmic capacity, and also in ′ p D (Schwartz distributions), or in Lloc, 1 ≤ p< ∞. The corresponding Riesz measures converge weakly. The limit measure, −1 which is (2π) ∆u, describes the limit distribution of zeros of fn. ∗Supported by NSF grant DMS-1361836. 1 For all these facts we refer to [9] or [10]. This setting is useful in many cases when one is interested in asymptotic distribution of zeros of sequences of analytic functions. Let us mention several situations to which our results apply. 1. Let fn be monic polynomials of degree n, and Vn = n. We denote by µn the so-called empirical measures, which are the Riesz measures of (1/n)log |fn|. The measure µn is discrete, with finitely many atoms, with an atom of mass m at every zero of fn of multiplicity m.
    [Show full text]
  • Calculus Terminology
    AP Calculus BC Calculus Terminology Absolute Convergence Asymptote Continued Sum Absolute Maximum Average Rate of Change Continuous Function Absolute Minimum Average Value of a Function Continuously Differentiable Function Absolutely Convergent Axis of Rotation Converge Acceleration Boundary Value Problem Converge Absolutely Alternating Series Bounded Function Converge Conditionally Alternating Series Remainder Bounded Sequence Convergence Tests Alternating Series Test Bounds of Integration Convergent Sequence Analytic Methods Calculus Convergent Series Annulus Cartesian Form Critical Number Antiderivative of a Function Cavalieri’s Principle Critical Point Approximation by Differentials Center of Mass Formula Critical Value Arc Length of a Curve Centroid Curly d Area below a Curve Chain Rule Curve Area between Curves Comparison Test Curve Sketching Area of an Ellipse Concave Cusp Area of a Parabolic Segment Concave Down Cylindrical Shell Method Area under a Curve Concave Up Decreasing Function Area Using Parametric Equations Conditional Convergence Definite Integral Area Using Polar Coordinates Constant Term Definite Integral Rules Degenerate Divergent Series Function Operations Del Operator e Fundamental Theorem of Calculus Deleted Neighborhood Ellipsoid GLB Derivative End Behavior Global Maximum Derivative of a Power Series Essential Discontinuity Global Minimum Derivative Rules Explicit Differentiation Golden Spiral Difference Quotient Explicit Function Graphic Methods Differentiable Exponential Decay Greatest Lower Bound Differential
    [Show full text]
  • Power Series and Convergence Issues
    POWER SERIES AND CONVERGENCE ISSUES MATH 153, SECTION 55 (VIPUL NAIK) Corresponding material in the book: Section 12.8, 12.9. What students should definitely get: The meaning of power series. The relation between Taylor series and power series, the notion of convergence, interval of convergence, and radius of convergence. The theorems for differentiation and integration of power series. Convergence at the boundary and Abel’s theorem. What students should hopefully get: How notions of power series provide an alternative interpre- tation for many of the things we have studied earlier in calculus. How results about power series combine with ideas like the root and ratio tests and facts about p-series. Executive summary Words ... P∞ k (1) The objects of interest here are power series, which are series of the form k=0 akx . Note that for power series, we start by default with k = 0. If the set of values of the index of summation is not specified, assume that it starts from 0 and goes on to ∞. The exception is when the index of summation occurs in the denominator, or some other such thing that forces us to exclude k = 0. 0 (2) Also note that x is shorthand for 1. When evaluating a power series at 0, we simply get a0. We do not actually do 00. (3) If a power series converges for c, it converges absolutely for all |x| < |c|. If a power series diverges for c, it diverges for all |x| > |c|. P k (4) Given a power series akx , the set of values where it converges is either 0, or R, or an interval that (apart from the issue of inclusion of endpoints) is symmetric about 0.
    [Show full text]
  • Calculus 1120, Fall 2012
    Calculus 1120, Fall 2012 Dan Barbasch November 13, 2012 Dan Barbasch () Calculus 1120, Fall 2012 November 13, 2012 1 / 5 Absolute and Conditional Convergence We need to consider series with arbitrary terms not just positive (nonnegative) ones. For such series the partial sums sn = a1 + ··· + an are not necessarily increasing. So we cannot use the bounded monotone convergence theorem. We cannot use the root/ratio test or the integral test directly on such series. The notion of absolute convergence allows us to deal with the problem. Dan Barbasch () Calculus 1120, Fall 2012 November 13, 2012 2 / 5 Absolute and Conditional Convergence P Definition: A series an is said to converge absolutely, if the series P janj converges. For convergence without absolute values, we say plain convergent. For plain convergence, but the series with absolute values does not converge, we say conditionally convergent. Theorem: If a series is absolutely convergent, then it is convergent. Note the difference between if and only if and if then. Typically we apply the root/ratio integral test and comparison test for absolute convergence, and use the theorem. REMARK: NOTE the precise definitions of the terms and the differences. Dan Barbasch () Calculus 1120, Fall 2012 November 13, 2012 2 / 5 Alternating Series Test P1 n−1 Theorem: (Alternating Series Test) Suppose n=1(−1) an satisfies 1 an ≥ 0; (series is alternating) 2 an is decreasing 3 limn!1 an = 0: Then the series is (possibly only conditionally) convergent. Error Estimate: jS − snj ≤ an+1. P1 i−1 S − sn = i=n+1(−1) ai . an+1 − an+2 + an+3 − · · · =(an+1 − an+2) + (an+3 − an+4) + ··· = =an+1 − (an+2 − an+3) − (an+4 − an+5) − ::: So 0 ≤ jS − snj = an+1 − an+2 + an+3 − · · · ≤ an+1 The proof is in the text and in the previous slides (also every text on calculus).
    [Show full text]
  • Fun Power Series Problems
    FUN POWER SERIES PROBLEMS Joseph Breen Solutions will be periodically added at the bottom. Problems 1. Evaluate each of the following infinite series. Don’t just show they converge, actually evaluate them! (a) 1 X n 2n n=1 (b) 1 X n2 2n n=1 (c) 1 X n + 1 n! n=0 (d) 1 X 1 (2n)! n=0 2. Let f(x) = x sin(x2). What is f (147)(0)? What about f (148)(0)? Hint: you probably don’t want to take 147 derivatives of f. 3. Evaluate the following integral as an infinite series: Z 1 1 x dx: 0 x 4. Determine whether the following series converge or diverge. (The point of these exercises is that thinking about Maclaurin series can help you!) (a) 1 X 1 arctan : n2 n=1 (b) 1 X − 1 1 − 3 n : n=1 (c) 1 X 1 sin3 p : n n=1 (d) 1 1 ! X Z n sin(x2) dx : x n=1 0 1 (e) 1 ! X 1 ln 2 1 : n=1 1 − sin n (f) 1 1 X arcsin n : (ln n)2 n=1 (g) 1 X − 1 −1 tan n 2 sin n : n=1 (h) 1 1 1 1 1 X ln 1 + 1 + + + ··· + n 2 3 n : n n=1 5. Determine the interval of convergence for each of the following power series. (a) 1 X n!(x − 2)2n : nn n=1 (b) 1 X x3n : (2n)! n=1 (c) 1 X 3n n!(x − 1)n : nn n=1 6.
    [Show full text]
  • Formal Power Series License: CC BY-NC-SA
    Formal Power Series License: CC BY-NC-SA Emma Franz April 28, 2015 1 Introduction The set S[[x]] of formal power series in x over a set S is the set of functions from the nonnegative integers to S. However, the way that we represent elements of S[[x]] will be as an infinite series, and operations in S[[x]] will be closely linked to the addition and multiplication of finite-degree polynomials. This paper will introduce a bit of the structure of sets of formal power series and then transfer over to a discussion of generating functions in combinatorics. The most familiar conceptualization of formal power series will come from taking coefficients of a power series from some sequence. Let fang = a0; a1; a2;::: be a sequence of numbers. Then 2 the formal power series associated with fang is the series A(s) = a0 + a1s + a2s + :::, where s is a formal variable. That is, we are not treating A as a function that can be evaluated for some s0. In general, A(s0) is not defined, but we will define A(0) to be a0. 2 Algebraic Structure Let R be a ring. We define R[[s]] to be the set of formal power series in s over R. Then R[[s]] is itself a ring, with the definitions of multiplication and addition following closely from how we define these operations for polynomials. 2 2 Let A(s) = a0 + a1s + a2s + ::: and B(s) = b0 + b1s + b1s + ::: be elements of R[[s]]. Then 2 the sum A(s) + B(s) is defined to be C(s) = c0 + c1s + c2s + :::, where ci = ai + bi for all i ≥ 0.
    [Show full text]
  • 9.8 Power Series ∞ Let {An}N=0 Be a Sequence of Numbers
    Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan 9.8 Power Series 1 Let fangn=0 be a sequence of numbers. Then a power series about x = a is a series of the form 1 X n 2 an(x − a) = a0 + a1(x − a) + a2(x − a) + ··· n=0 Note that a power series about x = a always converges at x = a with sum equals to a0. Example 9.8.1 Which of the following is a power series? (a) A polynomial of degree m: (b) The geometric series 1 + x + x2 + ··· : 1 1 1 (c) The series x + x2 + x3 + ··· : (d) The series 1 + x + (x − 1)2 + (x − 2)3 + (x − 3)4 + ··· : Solution. (a) A polynomial of degree m is a power series about x = 0 since 2 m p(x) = a0 + a1x + a2x + ··· + amx : Note that an = 0 for n ≥ m + 1: (b) The geometric series 1 + x + x2 + ··· is a power series about x = 0 with an = 1 for all n. 1 1 1 (c) The series x + x2 + x3 + ··· is not a power series since it has negative powers of x: (d) The series 1 + x + (x − 1)2 + (x − 2)3 + (x − 3)4 + ··· is not a power series since each term is a power of a different quantity Convergence of Power Series To study the convergence of a power series about x = a one starts by fixing x and then constructing the partial sums S0(x) =a0 S1(x) =a0 + a1(x − a) 2 S2(x) =a0 + a1(x − a) + a2(x − a) .
    [Show full text]