Three Lectures on Hypergeometric Functions
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Tsinghua Lectures on Hypergeometric Functions (Unfinished and Comments Are Welcome)
Tsinghua Lectures on Hypergeometric Functions (Unfinished and comments are welcome) Gert Heckman Radboud University Nijmegen [email protected] December 8, 2015 1 Contents Preface 2 1 Linear differential equations 6 1.1 Thelocalexistenceproblem . 6 1.2 Thefundamentalgroup . 11 1.3 The monodromy representation . 15 1.4 Regular singular points . 17 1.5 ThetheoremofFuchs .. .. .. .. .. .. 23 1.6 TheRiemann–Hilbertproblem . 26 1.7 Exercises ............................. 33 2 The Euler–Gauss hypergeometric function 39 2.1 The hypergeometric function of Euler–Gauss . 39 2.2 The monodromy according to Schwarz–Klein . 43 2.3 The Euler integral revisited . 49 2.4 Exercises ............................. 52 3 The Clausen–Thomae hypergeometric function 55 3.1 The hypergeometric function of Clausen–Thomae . 55 3.2 The monodromy according to Levelt . 62 3.3 The criterion of Beukers–Heckman . 66 3.4 Intermezzo on Coxeter groups . 71 3.5 Lorentzian Hypergeometric Groups . 75 3.6 Prime Number Theorem after Tchebycheff . 87 3.7 Exercises ............................. 93 2 Preface The Euler–Gauss hypergeometric function ∞ α(α + 1) (α + k 1)β(β + 1) (β + k 1) F (α, β, γ; z) = · · · − · · · − zk γ(γ + 1) (γ + k 1)k! Xk=0 · · · − was introduced by Euler in the 18th century, and was well studied in the 19th century among others by Gauss, Riemann, Schwarz and Klein. The numbers α, β, γ are called the parameters, and z is called the variable. On the one hand, for particular values of the parameters this function appears in various problems. For example α (1 z)− = F (α, 1, 1; z) − arcsin z = 2zF (1/2, 1, 3/2; z2 ) π K(z) = F (1/2, 1/2, 1; z2 ) 2 α(α + 1) (α + n) 1 z P (α,β)(z) = · · · F ( n, α + β + n + 1; α + 1 − ) n n! − | 2 with K(z) the Jacobi elliptic integral of the first kind given by 1 dx K(z)= , Z0 (1 x2)(1 z2x2) − − p (α,β) and Pn (z) the Jacobi polynomial of degree n, normalized by α + n P (α,β)(1) = . -
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. -
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 -
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. -
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. -
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). -
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. -
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. -
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. -
Transformation Formulas for the Generalized Hypergeometric Function with Integral Parameter Differences
CORE Metadata, citation and similar papers at core.ac.uk Provided by Abertay Research Portal Transformation formulas for the generalized hypergeometric function with integral parameter differences A. R. Miller Formerly Professor of Mathematics at George Washington University, 1616 18th Street NW, No. 210, Washington, DC 20009-2525, USA [email protected] and R. B. Paris Division of Complex Systems, University of Abertay Dundee, Dundee DD1 1HG, UK [email protected] Abstract Transformation formulas of Euler and Kummer-type are derived respectively for the generalized hypergeometric functions r+2Fr+1(x) and r+1Fr+1(x), where r pairs of numeratorial and denominatorial parameters differ by positive integers. Certain quadratic transformations for the former function, as well as a summation theorem when x = 1, are also considered. Mathematics Subject Classification: 33C15, 33C20 Keywords: Generalized hypergeometric function, Euler transformation, Kummer trans- formation, Quadratic transformations, Summation theorem, Zeros of entire functions 1. Introduction The generalized hypergeometric function pFq(x) may be defined for complex parameters and argument by the series 1 k a1; a2; : : : ; ap X (a1)k(a2)k ::: (ap)k x pFq x = : (1.1) b1; b2; : : : ; bq (b1)k(b2)k ::: (bq)k k! k=0 When q = p this series converges for jxj < 1, but when q = p − 1 convergence occurs when jxj < 1. However, when only one of the numeratorial parameters aj is a negative integer or zero, then the series always converges since it is simply a polynomial in x of degree −aj. In (1.1) the Pochhammer symbol or ascending factorial (a)k is defined by (a)0 = 1 and for k ≥ 1 by (a)k = a(a + 1) ::: (a + k − 1). -
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. -
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.