Taylor and Laurent Series

Total Page:16

File Type:pdf, Size:1020Kb

Taylor and Laurent Series 7 Taylor and Laurent Series Throughout this text we have compared and contrasted properties of complex func­ tions with functions whose domain and range lie entirely within the reals. There are many similarities, such as the standard differentiation formulas. On the other hand, there are some surprises, and in this chapter we will encounter one of the hallmarks distinguishing complex functions from their real counterparts. It is possible for a function defined on the real numbers to be differentiable everywhere and yet not be expressible as a power series (see Exercise 27 at the end of Section 7.2). In the complex case, however, things are much simpler! It turns out that if a complex function is analytic in the disk Dr(a), its Taylor series about a will converge to the function at every point in this disk. Thus, analytic functions are locally nothing more than glorified polynomials. We shall also see that complex functions are the key to unlocking many of the mysteries encountered when power series are first introduced in a calculus course. We begin by discussing an important property associated with power series— uniform convergence. 7.1 Uniform Convergence Recall that if we have a function/(z) defined on a set T, the sequence of functions {Sn(z}} converges to the function/at the point z = Zo e T provided lim Sn(zo) = n—>« /(zo). Thus, for the particular point zo> this means that for each e > 0, there exists a positive integer A^ro (which depends on both £ and zo) such that (1) if n > N^ then | S„(ZQ) - /fa>) \ < e. c If Sn(z) is the nth partial sum of the series 2^ k(z — ct)\ statement (1) becomes k=0 k (2) if n > N^, then 2 ck(zo - a) - f(z0) < e. It is important to stress that for a given value of £, the integer NEnZQ we need to satisfy statement (1) will often depend on our choice of zo- This is not the case if 208 7.1 Uniform Convergence 209 the sequence {Sn(z)} converges uniformly. For a uniformly convergent sequence, it is possible to find an integer JVe (which depends only on £) that guarantees statement (1) no matter which value for z0 e T we pick. In other words, if n is large enough, the function S„(z) is uniformly close to f(z). Formally, we have the following definition. DEFINITION 7.1 The sequence {Sn(z)} converges uniformly to f(z) on the set T if for every £ > 0, there exists a positive integer N£ (which depends only on £) such that (3) ifn > N€, then \ S„(z) - f(z) | < £ for all z e T. c we sa tnat If in the preceding, Sn(z) is the nth partial sum of a series 2 *(z "" °0*» Y A = 0 the series 2 c*(£ ~~ °0A converges uniformly to/(z) on the set T. £=0 z EXAMPLE 7.1 The sequence {Sn(z)} = \e + -> converges uniformly to f(z) = ez on the entire complex plane because for any £ > 0, statement (3) is satisfied for all z if Nt is any integer greater than 1/e. We leave the details for showing this as an exercise. A good example of a sequence of functions that does not converge uniformly is the sequence of partial sums comprising the geometric series. Recall that the geometric series has S„(z) = 2J zk = — converging to f(z) = for all *=o 1 — z 1 — z z e D\(0). Since the real numbers are a subset of the complex numbers, we can show statement (3) is not satisfied by demonstrating it does not hold when we restrict our attention to the real numbers. In that context, D\(0) becomes the open interval (-1, 1), and the inequality \Sn(z) — f(z)\ < £ becomes \Sn(x) - f(x) | < £, which for real variables is equivalent tof(x) — £ < S„(x) <f(x) + £. If statement (3) were to be satisfied, then given £ > 0, Sn(x) should (for large enough values of n) be within an £-bandwidth of the function f(x) for all x in the interval (— 1, 1). Figure 7.1 illustrates that there is an £ such that no matter how large n is, we can find XQ e (— 1, 1) such that Sn(xo) is outside this bandwidth. In other words, this figure illustrates the negation of statement (3), which in technical terms is (4) there exists £ > 0 such that for all positive integers N, there is some n > N and some zo e T such that | Sn(zo) — f(zo) | ^ £. We leave the verification of statement (4) when applied to the partial sums of a geometric series as an exercise. 210 Chapter 7 Taylor and Laurent Series y = Six) 0.5 x l y=f(x)-E FIGURE 7.1 The geometric series does not converge uniformly on (-1, 1). There is a useful procedure known as the Weierstrass M-test, which can help determine whether an infinite series is uniformly convergent. Theorem 7.1 (Weierstrass Af-Xest): Suppose the infinite series 2 uk(z) k = 0 has the property that for each k, | uk(z) | ^ Mkfor all zeT. If2jk = 0 Mk converges, u then /:=2 0 k(z) converges uniformly on T. Proof Let S„(z) = 2 uk(z) be the nth partial sum of the series. If n > m, k = 0 n-\ M \S„(z) - Sm(z)\ = \um(z) + w,„, \(z) + ••• + MW_I(Z)| < 2 k- Since the series 2 Mk converges, the last expression can be made as small as we k = 0 wish by choosing m large enough. Thus, given £ > 0, there is a positive integer N£ such that if n, m > N£i then | Sn(z) — Sm(z) \ < £. But this means that for all z e T, {Sn(z)} is a Cauchy sequence. According to Theorem 4.2, this sequence must con­ verge to a number which we might as well designate by f(z). That is, f(z) = lim S„(z) = 2 uk(z). 7.1 Uniform Convergence 211 This gives us a function to which the series 2 uk(z) converges; it remains to be shown that the convergence is uniform. Let e > 0 be given. Again, since 2 Mk converges, there exists NE such that if n > NZ9 then ^ Mk< z. Thus, if n > 7Ve, we have for all z e T that M \f(z)-Sn(z)\ 2 «A(Z) - 2 *(Z) *=0 * = 0 2 uk(z) k=n < e, which completes the argument. As an application of the Weierstrass M-test, we have the following. Theorem 7.2 Suppose the power series 2J Ck(z — a)* has radius of con- vergence p > 0. Then for each r, 0 < r < p, the series converges uniformly on the closed disk Dr(a) = {z: | z — a | < r}. Proof Given r with 0 < r < p, choose z0 c £>P(o0 such that j zo — oc | = r. c Since ^ *(z " oO* converges absolutely for z e Dp(a) (Theorems 4.9 and 4.11, k r part ii), we know that ^] I ck(zo - a) \ = 2 1^1 * converges. For all z e Dr(a) it is clear that k k \ck(z- a) \ = \ck\ \z- a|*< \ck\r . k The conclusion now follows from the Weierstrass M-test with Mk = \ck\ r . Corollary 7.1 For each r, 0 < r < 1, the geometric series converges uni­ formly on the closed disk Dr(0). The following theorem gives important properties of uniformly convergent sequences. Theorem 7.3 Suppose {Sk} is a sequence of continuous functions defined on a set T containing the contour C. If {Sk} converges uniformly to f on the set T, then (i) f is continuous on T, and 212 Chapter 7 Taylor and Laurent Series (ii) lim Sk(z) dz = lim Sk(z) dz = f(z) dz. £_»«, JC JC £_>«, JC Proof (i) Given zo e T, we must prove lim/(z) = f(zo). Let e > 0 be given. Z-*ZQ Since Sk converges uniformly on T, there exists a positive integer N£ such that i i £ for all z e T, \f{z) — Sk(z) \ < - whenever k > N£. Since SNg is continuous at zo, £ there exists 8 > 0 such that if | z — Zo \ < 8, then | SN((z) - SM£(ZQ) \ < ~z • Hence, if | z — Zo I < 8, we have | f(z) - /(zo) | = | f(z) - SNt(z) + SNt(z) - SNg(zo) + SNe(zo) - /(¾) | * \f(z) ~ SN((z)\ + \SNe(z) - SNe(z0)\ + \SN£(z0) -/(¾) | e e e <- + - + - = £. 3 3 3 (ii) Let e > 0 be given, and let L be the length of the contour C. Since {Sk} converges uniformly to/on T, there exists a positive integer Ne such that if k > JVe, then | S*(z) - /(z) I < - for all z e T. Since C C T, max I Sk(z) - f(z)\ < 7 , so if N£, jc Sk(z) dz - \c f(z) dz\ = \\c [Sk(z) ~ f(z)] dz < max I Sk(z) ~ f(z) I L (by Lemma 6.2) ZeC Corollary 7.2 7/" the series 2 c„(z ~~ oc)w converges uniformly to f(z) on n = 0 the set T, and C is a contour contained in T, then n = 0 JC JC „ = Q JC ^ 1 EXAMPLE 7.2 Show that -Log(l - z) = X " z" for a11 * G D' (°)- Solution Given z0 e Di(0), choose r such that 0 < | zo | < r < 1, thus rt ensuring that zo e £>r(0). By Corollary 7.1, the geometric series 2 z converges n=0 7.1 Uniform Convergence 213 uniformly to on Dr(0). If C is any contour contained in Dr(0), Corollary 7.2 gives dz = 2 \ zn dz.
Recommended publications
  • 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]
  • Inverse Polynomial Expansions of Laurent Series, II
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Computational and Applied Mathematics 28 (1989) 249-257 249 North-Holland Inverse polynomial expansions of Laurent series, II Arnold KNOPFMACHER Department of Computational & Applied Mathematics, University of the Witwatersrand, Johannesburg, Wits 2050, South Africa John KNOPFMACHER Department of Mathematics, University of the Witwatersrand, Johannesburg Wits ZOSO, South Africa Received 6 May 1988 Revised 23 November 1988 Abstract: An algorithm is considered, and shown to lead to various unusual and unique series expansions of formal Laurent series, as the sums of reciprocals of polynomials. The degrees of approximation by the rational functions which are the partial sums of these series are investigated. The types of series corresponding to rational functions themselves are also partially characterized. Keywords: Laurent series, polynomial, rational function, degree of approximation, series expansion. 1. Introduction Let ZP= F(( z)) denote the field of all formal Laurent series A = Cr= y c,z” in an indeterminate z, with coefficients c, all lying in a given field F. Although the main case of importance here occurs when P is the field @ of complex numbers, certain interest also attaches to other ground fields F, and almost all results below hold for arbitrary F. In certain situations below, it will be convenient to write x = z-l and also consider the ring F[x] of polynomials in x, as well as the field F(x) of rational functions in x, with coefficients in F. If c, # 0, we call v = Y(A) the order of A, and define the norm (or valuation) of A to be II A II = 2- “(A).
    [Show full text]
  • Laurent-Series-Residue-Integration.Pdf
    Laurent Series RUDY DIKAIRONO AEM CHAPTER 16 Today’s Outline Laurent Series Residue Integration Method Wrap up A Sequence is a set of things (usually numbers) that are in order. (z1,z2,z3,z4…..zn) A series is a sum of a sequence of terms. (s1=z1,s2=z1+z2,s3=z1+z2+z3, … , sn) A convergent sequence is one that has a limit c. A convergent series is one whose sequence of partial sums converges. Wrap up Taylor series: or by (1), Sec 14.4 Wrap up A Maclaurin series is a Taylor series expansion of a function about zero. Wrap up Importance special Taylor’s series (Sec. 15.4) Geometric series Exponential function Wrap up Importance special Taylor’s series (Sec. 15.4) Trigonometric and hyperbolic function Wrap up Importance special Taylor’s series (Sec. 15.4) Logarithmic Lauren Series Deret Laurent adalah generalisasi dari deret Taylor. Pada deret Laurent terdapat pangkat negatif yang tidak dimiliki pada deret Taylor. Laurent’s theorem Let f(z) be analytic in a domain containing two concentric circles C1 and C2 with center Zo and the annulus between them . Then f(z) can be represented by the Laurent series Laurent’s theorem Semua koefisien dapat disajikan menjadi satu bentuk integral Example 1 Example 1: Find the Laurent series of z-5sin z with center 0. Solution. menggunakan (14) Sec.15.4 kita dapatkan. Substitution Example 2 Find the Laurent series of with center 0. Solution From (12) Sec. 15.4 with z replaced by 1/z we obtain Laurent series whose principal part is an infinite series.
    [Show full text]
  • Chapter 4 the Riemann Zeta Function and L-Functions
    Chapter 4 The Riemann zeta function and L-functions 4.1 Basic facts We prove some results that will be used in the proof of the Prime Number Theorem (for arithmetic progressions). The L-function of a Dirichlet character χ modulo q is defined by 1 X L(s; χ) = χ(n)n−s: n=1 P1 −s We view ζ(s) = n=1 n as the L-function of the principal character modulo 1, (1) (1) more precisely, ζ(s) = L(s; χ0 ), where χ0 (n) = 1 for all n 2 Z. We first prove that ζ(s) has an analytic continuation to fs 2 C : Re s > 0gnf1g. We use an important summation formula, due to Euler. Lemma 4.1 (Euler's summation formula). Let a; b be integers with a < b and f :[a; b] ! C a continuously differentiable function. Then b X Z b Z b f(n) = f(x)dx + f(a) + (x − [x])f 0(x)dx: n=a a a 105 Remark. This result often occurs in the more symmetric form b Z b Z b X 1 1 0 f(n) = f(x)dx + 2 (f(a) + f(b)) + (x − [x] − 2 )f (x)dx: n=a a a Proof. Let n 2 fa; a + 1; : : : ; b − 1g. Then Z n+1 Z n+1 x − [x]f 0(x)dx = (x − n)f 0(x)dx n n h in+1 Z n+1 Z n+1 = (x − n)f(x) − f(x)dx = f(n + 1) − f(x)dx: n n n By summing over n we get b Z b X Z b (x − [x])f 0(x)dx = f(n) − f(x)dx; a n=a+1 a which implies at once Lemma 4.1.
    [Show full text]
  • Factorization of Laurent Series Over Commutative Rings ∗ Gyula Lakos
    Linear Algebra and its Applications 432 (2010) 338–346 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Factorization of Laurent series over commutative rings ∗ Gyula Lakos Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Pf. 127, H-1364, Hungary Institute of Mathematics, Eötvös University, Pázmány Péter s. 1/C, Budapest, H-1117, Hungary ARTICLE INFO ABSTRACT Article history: We generalize the Wiener–Hopf factorization of Laurent series to Received 3 May 2009 more general commutative coefficient rings, and we give explicit Accepted 12 August 2009 formulas for the decomposition. We emphasize the algebraic nature Available online 12 September 2009 of this factorization. Submitted by H. Schneider © 2009 Elsevier Inc. All rights reserved. AMS classification: Primary: 13J99 Secondary: 46S10 Keywords: Laurent series Wiener–Hopf factorization Commutative topological rings 0. Introduction Suppose that we have a Laurent series a(z) with rapidly decreasing coefficients and it is multi- − plicatively invertible, so its multiplicative inverse a(z) 1 allows a Laurent series expansion also with rapidly decreasing coefficients; say n −1 n a(z) = anz and a(z) = bnz . n∈Z n∈Z Then it is an easy exercise in complex function theory that there exists a factorization − + a(z) = a (z)a˜(z)a (z) such that −( ) = − −n ˜( ) =˜ p +( ) = + n a z an z , a z apz , a z an z , n∈N n∈N ∗ Address: Institute of Mathematics, Eötvös University, P´azm´any P ´eter s. 1/C, Budapest, H-1117, Hungary. E-mail address: [email protected] 0024-3795/$ - see front matter © 2009 Elsevier Inc.
    [Show full text]
  • Chapter 2 Complex Analysis
    Chapter 2 Complex Analysis In this part of the course we will study some basic complex analysis. This is an extremely useful and beautiful part of mathematics and forms the basis of many techniques employed in many branches of mathematics and physics. We will extend the notions of derivatives and integrals, familiar from calculus, to the case of complex functions of a complex variable. In so doing we will come across analytic functions, which form the centerpiece of this part of the course. In fact, to a large extent complex analysis is the study of analytic functions. After a brief review of complex numbers as points in the complex plane, we will ¯rst discuss analyticity and give plenty of examples of analytic functions. We will then discuss complex integration, culminating with the generalised Cauchy Integral Formula, and some of its applications. We then go on to discuss the power series representations of analytic functions and the residue calculus, which will allow us to compute many real integrals and in¯nite sums very easily via complex integration. 2.1 Analytic functions In this section we will study complex functions of a complex variable. We will see that di®erentiability of such a function is a non-trivial property, giving rise to the concept of an analytic function. We will then study many examples of analytic functions. In fact, the construction of analytic functions will form a basic leitmotif for this part of the course. 2.1.1 The complex plane We already discussed complex numbers briefly in Section 1.3.5.
    [Show full text]
  • Simple Zeros of the Zeta Function 2 Form Ρ, T R
    Simple Zeros Of The Zeta Function N. A. Carella Abstract: This note studies the Laurent series of the inverse zeta function 1/ζ(s) at any fixed nontrivial zero ρ of the zeta function ζ(s), and its connection to the simplicity of the nontrivial zeros. 1 Introduction The set of zeros of the zeta function ζ(s)= n−s, e(s) > 1 is defined by =# s n≥1 ℜ Z { ∈ C : ζ(s) = 0 . This subset of complex numbers has a disjoint partition as = , } P Z ZT ∪ZN the subset of trivial zeros and the subset of nontrivial zeros. The subset of trivial zeros of the zeta function is completely determined; it is the subset of negative even integers = 2n : ζ(s)=0 and n 1 . The trivial zeros are extracted ZT {− ≥ } using the symmetric functional equation π−s/2Γ(s/2)ζ(s)= π−(1−s)/2Γ((1 s)/2)ζ(1 s), (1) − − where Γ(t) = ∞ xt−1e−xdx is the gamma function, and s C is a complex number. 0 ∈ Various levels of explanations of the functional equation are given in [33, p. 222], [31, p. R 328], [17, p. 13], [22, p. 55], [17, p. 8], [41], [27], and other sources. In contrast, the subset of nontrivial zeros = s C : ζ(s)=0 and0 < e(s) < 1 (2) ZN { ∈ ℜ } and myriad of questions about its properties remain unknown. The nontrivial zeros are computed using the Riemann-Siegel formula, see [18, Eq. 25.10.3]. Some recent develop- ment in this area appears in [19] and [20].
    [Show full text]
  • Diagonalization and Rationalization of Algebraic Laurent Series
    DIAGONALIZATION AND RATIONALIZATION OF ALGEBRAIC LAURENT SERIES by Boris Adamczewski & Jason P. Bell Abstract. — We prove a quantitative version of a result of Furstenberg [21] and Deligne [14] stating that the diagonal of a multivariate algebraic power series with coefficients in a field of positive characteristic is algebraic. As a consequence, we obtain that for every prime p the reduction modulo p of the diagonal of a multivariate algebraic power series f with integer coefficients is an algebraic power series of degree at most pA and height at most ApA, where A is an effective constant that only depends on the number of variables, the degree of f and the height of f. This answers a question raised by Deligne [14]. R´esum´e. — Nous d´emontrons une version quantitative d’un r´esultat de Furstenberg [21] et Deligne [14] : la diagonale d’une s´erie formelle alg´ebrique de plusieurs variables `acoefficients dans un corps de caract´eristique non nulle est une s´erie formelle alg´ebrique d’une variable. Comme cons´equence, nous obtenons que, pour tout nombre premier p, la r´eduction modulo p de la di- agonale d’une s´erie formelle alg´ebrique de plusieurs variables f `acoefficients entiers est une s´erie formelle alg´ebrique de degr´eau plus pA et de hauteur au plus ApA, o`u A est une constante effective ne d´ependant que du nombre de variables, du degr´ede f et de la hauteur de f. Cela r´epond `aune question soulev´ee par Deligne [14]. 2000 Mathematics Subject Classification.
    [Show full text]
  • Laurent Series and Residue Calculus
    Laurent Series and Residue Calculus Nikhil Srivastava March 19, 2015 If f is analytic at z0, then it may be written as a power series: 2 f(z) = a0 + a1(z − z0) + a2(z − z0) + ::: which converges in an open disk around z0. In fact, this power series is simply the Taylor series of f at z0, and its coefficients are given by I 1 (n) 1 f(z) an = f (z0) = n+1 ; n! 2πi (z − z0) where the latter equality comes from Cauchy's integral formula, and the integral is over a positively oriented contour containing z0 contained in the disk where it f(z) is analytic. The existence of this power series is an extremely useful characterization of f near z0, and from it many other useful properties may be deduced (such as the existence of infinitely many derivatives, vanishing of simple closed contour integrals around z0 contained in the disk of convergence, and many more). The situation is not much worse when z0 is an isolated singularity of f, i.e., f(z) is analytic in a puncured disk 0 < jz − z0j < r for some r. In this case, we have: Laurent's Theorem. If z0 is an isolated singularity of f and f(z) is analytic in the annulus 0 < jz − z0j < r, then 2 b1 b2 bn f(z) = a0 + a1(z − z0) + a2(z − z0) + ::: + + 2 + ::: + n + :::; (∗) z − z0 (z − z0) (z − z0) where the series converges absolutely in the annulus. In class I described how this can be done for any annulus, but the most useful case is a punctured disk around an isolated singularity.
    [Show full text]
  • Lecture 8 Taylor and Laurent Series
    Lecture 8 Taylor and Laurent series Dr. Moataz El-Zekey Complex sequences An infinite sequence of complex numbers , , , , , denoted by , can be considered as a function defined on a set of positive integers into the complex plane. For example, we take = so that the complex sequence is Convergence of complex sequences ° Given a complex sequence , if for each positive quantity , there exists a positive integer N such that then the sequence is said to converge to the limt z. We write If there is no limit, we say that the sequence diverges . Complex sequences It is easy to show that Therefore, the study of the convergence of a complex sequence is equivalent to the consideration of two real sequences. The above theorem enables us to write whenever we know that both limits on the right exist or the one on the left exists. Infinite series of complex numbers ° An infinite series of complex numbers , , , , is the infinite sum of the sequence given by ° To study the properties of an infinite series, we define the sequence of partial sums by ° If the limit of the sequence converges to S, then the series is said to be convergent and S is its sum ; otherwise, the series is divergent . ° The sum, when it exists, is unique. ° The consideration of an infinite series is relegated to that of an infinite sequence of partial sums. Infinite series of complex numbers Hence, Σ is convergent if and only if Σ and Σ are convergent. There are many parallels with real series. Now if Σ and Σ are convergent, then → 0, → 0.
    [Show full text]
  • LAURENT SERIES and SINGULARITIES 1. Introduction So
    LAURENT SERIES AND SINGULARITIES 1. Introduction So far we have studied analytic functions. Locally, such functions are represented by power series. Globally, the bounded ones are constant, the ones that get large as their inputs get large are polynomials, and the ones that behave wildly as their inputs get large are transcendental. That is, nonconstant analytic functions diverge tamely or wildly at infinity. But the Cauchy integral representation formula involves integrands that diverge at a point inside the contour of integration. So next we will study how functions can diverge at a point in the plane. The result will be that they can diverge tamely or wildly at finite points as well. The functions that diverge tamely are called meromorphic, and their series expansions are Laurent series. 2. Some Handy Formulas let a and b be complex numbers. If jaj > jbj then 1 1 1 = · ; a − b a 1 − b=a and so 1 −∞ 1 X bn X an (1) = = ; jaj > jbj: a − b an+1 bn+1 n=0 n=−1 If jaj < jbj then 1 1 = − ; a − b b − a and so 1 −∞ 1 X an X bn (2) = − = − ; jaj < jbj: a − b bn+1 an+1 n=0 n=−1 Since 1 1 = ; a + b a − (−b) we also have the formulas 1 −∞ 1 X bn X an (3) = (−1)n = − (−1)n ; jaj > jbj; a + b an+1 bn+1 n=0 n=−1 and 1 −∞ 1 X an X bn (4) = (−1)n = − (−1)n ; jaj < jbj: a + b bn+1 an+1 n=0 n=−1 1 2 LAURENT SERIES AND SINGULARITIES 3.
    [Show full text]