DOCSLIB.ORG

Complex Analysis Qual Sheet

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Complex Analysis Qual Sheet Complex Analysis Qual Sheet Robert Won \Tricks and traps. Basically all complex analysis qualifying exams are collections of tricks and traps." - Jim Agler 1 Useful facts 1 X zn 1. ez = n! n=0 1 X z2n+1 1 2. sin z = (−1)n = (eiz − e−iz) (2n + 1)! 2i n=0 1 X z2n 1 3. cos z = (−1)n = (eiz + e−iz) 2n! 2 n=0 1 4. If g is a branch of f −1 on G, then for a 2 G, g0(a) = f 0(g(a)) 5. jz ± aj2 = jzj2 ± 2Reaz + jaj2 6. If f has a pole of order m at z = a and g(z) = (z − a)mf(z), then 1 Res(f; a) = g(m−1)(a): (m − 1)! 7. The elementary factors are defined as z2 zp E (z) = (1 − z) exp z + + ··· + : p 2 p Note that elementary factors are entire and Ep(z=a) has a simple zero at z = a. 8. The factorization of sin is given by 1 Y z2 sin πz = πz 1 − : n2 n=1 9. If f(z) = (z − a)mg(z) where g(a) 6= 0, then f 0(z) m g0(z) = + : f(z) z − a g(z) 1 2 Tricks 1. If f(z) nonzero, try dividing by f(z). Otherwise, if the region is simply connected, try writing f(z) = eg(z). 2. Remember that jezj = eRez and argez = Imz. If you see a Rez anywhere, try manipulating to get ez. 3. On a similar note, for a branch of the log, log reiθ = log jrj + iθ. 4. Let z = eiθ. 5. To show something is analytic use Morera or find a primitive. 6. If f and g agree on a set that contains a limit point, subtract them to show they're equal. 7. Tait: \Expand by power series." 8. If you want to count zeros, either Argument Principle or Rouch´e. 9. Know these M¨obiustransformations: 1 − z (a) To map the right half-plane to the unit disk (or back), . 1 + z z − a (b) To map from the unit disk to the unit disk, remember ' (z) = . This is a bijective a 1 − az 1 − jaj2 map with inverse ' (z). Also, ' (a) = 0, '0 (z) = , '0 (0) = 1 − jaj2, and −a a a (1 − az)2 a 1 '0 (a) = . a 1 − jaj2 10. If f(z) is analytic, then f(z) is analytic (by Cauchy-Riemann). So if, for example, f(z) is real on the real axis, then f(z) = f(z). 11. To prove that a function defined by an integral is analytic, try Morera and reversing the R 1 −t z−1 R R 1 −t z−1 R 1 R −t z−1 integral. (e.g. e t dt is analytic since T e t dtdz = T e t dzdt = 0:) 12. If given a point of f (say f(0) = a) and some condition on f 0 on a simply connected set, try R 0 [0;z] f = f(z) − f(0). 13. To create a non-vanishing function, consider exponentiating. 3 Theorems 1. Cauchy Integral Formula: Let G be region and f : G ! C be analytic. If γ1; : : : ; γm Pm are closed rectifiable curves in G with k=0 n(γk; w) = 0 for all w 2 C n G, then for a 2 m G n ([k=1fγkg), m m X n! X Z f(z) f (n)(a) · n(γ ; a) = dz: k 2πi (z − a)n+1 k=0 k=1 γk 2 2. Cauchy's Theorem: Let G be a region and f : G ! C be analytic. If γ1; : : : ; γm are closed Pm rectifiable curves in G with k=0 n(γk; w) = 0 for all w 2 C n G, then m X Z f(z)dz = 0 k=1 γk 3. Liouville's Theorem: If f is a bounded entire function, then f is constant. 4. Maximum Modulus Theorem: Let G be a region and f : G ! C be analytic. If there exists an a 2 G such that jf(a)j ≥ jf(z)j for all z 2 G, then f is constant on G. R 5. Morera's Theorem: Let G be a region and f : G ! C be continuous. If T f = 0 for every triangular path T in G, then f is analytic on G. 6. Goursat's Lemma: Let G be a region and let f : G ! C. If f is differentiable, then f is analytic on G. 7. Cauchy-Riemann Equations: Let f(x; y) = u(x; y) + iv(x; y) for real-valued functions u and v. Then f is analytic if and only if @u @v @u @v = and = − @x @y @y @x 8. Constant functions: Let f : G ! C be analytic. Then the following are equivalent (i) f(z) ≡ α; (ii) fz 2 G j f(z) = αg has a limit point in G; (iii) there exists a 2 G such that f (n)(a) = 0 for all n ≥ 1. 0 9. Conformality: Let f : G ! C be analytic. Then if z 2 G and f (z) 6= 0, f is conformal at z. 10. Roots of an analytic function: Let f : G ! C be analytic. If f(a) = 0, then there exists a unique m ≥ 1 and g analytic such that f(z) = (z − a)mg(z) with g(a) 6= 0. 11. Power series: A function f is analytic on B(a; R) if and only if there exists a power series P1 n f(z) = n=0 an(z − a) where we compute f (n)(a) 1 Z f(z) an = = n+1 dz: n! 2πi γ (z − a) The series converges absolutely on B(a; R) and uniformly on B(a; r) for 0 ≤ r < R. 12. Cauchy's Estimate: If f analytic on B(a; R), and jf(z)j ≤ M for each z 2 B(a; R), then n!M f (n)(a) ≤ : Rn 3 13. Winding Number: To compute the index of a closed curve about a point a, 1 Z dz n(γ; a) = 2 Z: 2πi γ z − a 14. Open Mapping Theorem: Let G be a region, f a non-constant analytic function. If U is an open subset of G, then f(U) is open. 15. Zero-Counting Theorem: Let G be a region, f : G ! C analytic with roots a1; : : : am. If fγg ⊆ G and ak 62 fγg for all k, and γ ≈ 0 in G, then m 1 Z f 0(z) X dz = n(γ; a ) 2πi f(z) k γ k=1 Corollary: If f(a) = α, then f(z) − α has a root at a. So if f(ak) = α, then m 1 Z f 0(z) X dz = n(γ; a ) 2πi f(z) − α k γ k=1 Corollary 2: If σ = f ◦ γ and α 62 fσg and ak are the points where f(ak) = α, then m X n(σ; α) = n(γ; ak) or k=1 m X n(f ◦ γ; f(a)) = n(γ; ak) k=1 16. Roots of analytic functions: Suppose f is analytic on B(a; R) and let f(a) = α. If f(z)−α has a zero of order m at z = a, then there exist > 0 and δ > 0 such that if 0 < jζ − αj < δ, the equation f(z) = ζ has exactly m simple roots in B(a; ). 17. Existence of Logarithm: Let f(z) be analytic and f(z) 6= 0 on G, a simply connected region. Then there is analytic function g(z) on G such that f(z) = eg(z) for all z 2 G. 18. Existence of Primitive: Let f(z) be analytic on G, a simply connected region. Then f has a primitive. 19. Laurent Series: Let f be analytic on R1 < jz − aj < R2, then there exists a sequence 1 fangn=−∞ and 1 X n f(z) = an(z − a) n=−∞ with absolute convergence in the open annulus and uniform convergence on every compact subset of the annulus. This series is called a Laurent series, and if γ is a closed curve in the annulus, then 1 Z f(z) an = n+1 dw: 2πi γ (z − a) (Note that this is just the same as number 11). 4 20. Classification of Singularities: Suppose f analytic on B(a; R) n fag and f has an isolated singularity at a. Then a is (a) Removable singularity if there is a function g analytic on B(a; R) such that f(z) = g(z) for all z 2 B(a; R) n fag. The singularity is removable if and only if lim(z − a)f(z) = 0. z!a Also, the singularity is removable if and only if the Laurent series of f has no coefficients an for n < 0. (b) Pole if lim jf(z)j = 1. z!a If a is a pole, then there is a unique m ≥ 1 and an analytic function g such that g(z) f(z) = for all z 2 B(a; R) n fag and g(a) 6= 0. (z − a)m The singularity is a pole if and only if the Laurent series of f has only finitely many coefficients an for n < 0. The partial series for these coefficients is called the singular part of f. (c) Essential singularity if a is not removable and not a pole. The singularity is essential if and only if the Laurent series of f has infinitely many coefficients an for n < 0.
Load more

Recommended publications
  • Class 1/28 1 Zeros of an Analytic Function
    Math 752 Spring 2011 Class 1/28 1 Zeros of an analytic function Towards the fundamental theorem of algebra and its statement for analytic functions. Definition 1. Let f : G → C be analytic and f(a) = 0. a is said to have multiplicity m ≥ 1 if there exists an analytic function g : G → C with g(a) 6= 0 so that f(z) = (z − a)mg(z). Definition 2. If f is analytic in C it is called entire. An entire function has a power series expansion with infinite radius of convergence. Theorem 1 (Liouville’s Theorem). If f is a bounded entire function then f is constant. 0 Proof. Assume |f(z)| ≤ M for all z ∈ C. Use Cauchy’s estimate for f to obtain that |f 0(z)| ≤ M/R for every R > 0 and hence equal to 0. Theorem 2 (Fundamental theorem of algebra). For every non-constant polynomial there exists a ∈ C with p(a) = 0. Proof. Two facts: If p has degree ≥ 1 then lim p(z) = ∞ z→∞ where the limit is taken along any path to ∞ in C∞. (Sometimes also written as |z| → ∞.) If p has no zero, its reciprocal is therefore entire and bounded. Invoke Liouville’s theorem. Corollary 1. If p is a polynomial with zeros aj (multiplicity kj) then p(z) = k k km c(z − a1) 1 (z − a2) 2 ...(z − am) . Proof. Induction, and the fact that p(z)/(z − a) is a polynomial of degree n − 1 if p(a) = 0. 1 The zero function is the only analytic function that has a zero of infinite order.
    [Show full text]
  • A Property of the Derivative of an Entire Function
    A property of the derivative of an entire function Walter Bergweiler∗ and Alexandre Eremenko† July 21, 2011 Abstract We prove that the derivative of a non-linear entire function is un- bounded on the preimage of an unbounded set. MSC 2010: 30D30. Keywords: entire function, normal family. 1 Introduction and results The main result of this paper is the following theorem conjectured by Allen Weitsman (private communication): Theorem 1. Let f be a non-linear entire function and M an unbounded set in C. Then f ′(f −1(M)) is unbounded. We note that there exist entire functions f such that f ′(f −1(M)) is bounded for every bounded set M, for example, f(z)= ez or f(z) = cos z. Theorem 1 is a consequence of the following stronger result: Theorem 2. Let f be a transcendental entire function and ε > 0. Then there exists R> 0 such that for every w C satisfying w >R there exists ∈ | | z C with f(z)= w and f ′(z) w 1−ε. ∈ | | ≥ | | ∗Supported by the Deutsche Forschungsgemeinschaft, Be 1508/7-1, and the ESF Net- working Programme HCAA. †Supported by NSF grant DMS-1067886. 1 The example f(z)= √z sin √z shows that that the exponent 1 ε in the − last inequality cannot be replaced by 1. The function f(z) = cos √z has the property that for every w C we have f ′(z) 0 as z , z f −1(w). ∈ → → ∞ ∈ We note that the Wiman–Valiron theory [20, 12, 4] says that there exists a set F [1, ) of finite logarithmic measure such that if ⊂ ∞ zr = r / F and f(zr) = max f(z) , | | ∈ | | |z|=r | | then ν(r,f) z ′ ν(r, f) f(z) f(zr) and f (z) f(z) ∼ zr ∼ r −1/2−δ for z zr rν(r, f) as r .
    [Show full text]
  • Variants on the Berz Sublinearity Theorem
    Aequat. Math. 93 (2019), 351–369 c The Author(s) 2018 0001-9054/19/020351-19 published online November 16, 2018 Aequationes Mathematicae https://doi.org/10.1007/s00010-018-0618-8 Variants on the Berz sublinearity theorem N. H. Bingham and A. J. Ostaszewski To Roy O. Davies on his 90th birthday. Abstract. We consider variants on the classical Berz sublinearity theorem, using only DC, the Axiom of Dependent Choices, rather than AC, the Axiom of Choice, which Berz used. We consider thinned versions, in which conditions are imposed on only part of the domain of the function—results of quantifier-weakening type. There are connections with classical results on subadditivity. We close with a discussion of the extensive related literature. Mathematics Subject Classification. Primary 26A03, 39B62. Keywords. Dependent Choices, Homomorphism extension, Subadditivity, Sublinearity, Steinhaus–Weil property, Thinning, Quantifier weakening. 1. Introduction: sublinearity We are concerned here with two questions. The first is to prove, as directly as possible, a linearity result via an appropriate group-homomorphism analogue of the classical Hahn–Banach Extension Theorem HBE [5]—see [18]forasur- vey. Much of the HBE literature most naturally elects as its context real Riesz spaces (ordered linear spaces equipped with semigroup action, see Sect. 4.8), where some naive analogues can fail—see [19]. These do not cover our test- case of the additive reals R, with focus on the fact (e.g. [14]) that for A ⊆ R a dense subgroup, if f : A → R is additive (i.e. a partial homomorphism) and locally bounded (see Theorem R in Sect.
    [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]
  • Pincherle's Theorem in Reverse Mathematics and Computability Theory
    PINCHERLE’S THEOREM IN REVERSE MATHEMATICS AND COMPUTABILITY THEORY DAG NORMANN AND SAM SANDERS Abstract. We study the logical and computational properties of basic theo- rems of uncountable mathematics, in particular Pincherle’s theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e. one of the first ‘local-to-global’ principles. It is well-known that such principles in analysis are intimately connected to (open-cover) com- pactness, but we nonetheless exhibit fundamental differences between com- pactness and Pincherle’s theorem. For instance, the main question of Re- verse Mathematics, namely which set existence axioms are necessary to prove Pincherle’s theorem, does not have an unique or unambiguous answer, in con- trast to compactness. We establish similar differences for the computational properties of compactness and Pincherle’s theorem. We establish the same differences for other local-to-global principles, even going back to Weierstrass. We also greatly sharpen the known computational power of compactness, for the most shared with Pincherle’s theorem however. Finally, countable choice plays an important role in the previous, we therefore study this axiom together with the intimately related Lindel¨of lemma. 1. Introduction 1.1. Compactness by any other name. The importance of compactness cannot be overstated, as it allows one to treat uncountable sets like the unit interval as ‘almost finite’ while also connecting local properties to global ones. A famous example is Heine’s theorem, i.e. the local property of continuity implies the global property of uniform continuity on the unit interval.
    [Show full text]
  • Applications of Entire Function Theory to the Spectral Synthesis of Diagonal Operators
    APPLICATIONS OF ENTIRE FUNCTION THEORY TO THE SPECTRAL SYNTHESIS OF DIAGONAL OPERATORS Kate Overmoyer A Dissertation Submitted to the Graduate College of Bowling Green State University in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY August 2011 Committee: Steven M. Seubert, Advisor Kyoo Kim, Graduate Faculty Representative Kit C. Chan J. Gordon Wade ii ABSTRACT Steven M. Seubert, Advisor A diagonal operator acting on the space H(B(0;R)) of functions analytic on the disk B(0;R) where 0 < R ≤ 1 is defined to be any continuous linear map on H(B(0;R)) having the monomials zn as eigenvectors. In this dissertation, examples of diagonal operators D acting on the spaces H(B(0;R)) where 0 < R < 1, are constructed which fail to admit spectral synthesis; that is, which have invariant subspaces that are not spanned by collec- tions of eigenvectors. Examples include diagonal operators whose eigenvalues are the points fnae2πij=b : 0 ≤ j < bg lying on finitely many rays for suitably chosen a 2 (0; 1) and b 2 N, and more generally whose eigenvalues are the integer lattice points Z×iZ. Conditions for re- moving or perturbing countably many of the eigenvalues of a non-synthetic operator which yield another non-synthetic operator are also given. In addition, sufficient conditions are given for a diagonal operator on the space H(B(0;R)) of entire functions (for which R = 1) to admit spectral synthesis. iii This dissertation is dedicated to my family who believed in me even when I did not believe in myself.
    [Show full text]
  • Smooth Versus Analytic Functions
    Smooth versus Analytic functions Henry Jacobs December 6, 2009 Functions of the form X i f(x) = aix i≥0 that converge everywhere are called analytic. We see that analytic functions are equal to there Taylor expansions. Obviously all analytic functions are smooth or C∞ but not all smooth functions are analytic. For example 2 g(x) = e−1/x Has derivatives of all orders, so g ∈ C∞. This function also has a Taylor series expansion about any point. In particular the Taylor expansion about 0 is g(x) ≈ 0 + 0x + 0x2 + ... So that the Taylor series expansion does in fact converge to the function g˜(x) = 0 We see that g andg ˜ are competely different and only equal each other at a single point. So we’ve shown that g is not analytic. This is relevent in this class when finding approximations of invariant man- ifolds. Generally when we ask you to find a 2nd order approximation of the center manifold we just want you to express it as the graph of some function on an affine subspace of Rn. For example say we’re in R2 with an equilibrium point at the origin, and a center subspace along the y-axis. Than if you’re asked to find the center manifold to 2nd order you assume the manifold is locally (i.e. near (0,0)) defined by the graph (h(y), y). Where h(y) = 0, h0(y) = 0. Thus the taylor approximation is h(y) = ay2 + hot. and you must solve for a using the invariance of the manifold and the dynamics.
    [Show full text]
  • Interpolation and Approximation by Entire Functions
    Interpolation and Approximation by Entire Functions Friedrich Littmann Abstract. In this note we study the connection between best ap- proximation and interpolation by entire functions on the real line. A general representation for entire interpolants is outlined. As an illustration, best upper and lower approximations from the class of functions of fixed exponential type to the Gaussian are constructed. §1. Approximation Background The Fourier transform of ϕ ∈ L1(R) is defined by Z ∞ −2πixt ϕb(t) = ϕ(x)e dx. −∞ This article considers the following problem: given a function f : R → R and a sequence of points {aj}j∈N from R (not necessarily distinct), find entire functions A and F such that F has its real zeros at the values aj and such that the equality f(x) − A(x) = F (x)H(x) (1) holds with a function H which is real-valued and of one sign on the real line. Classically, this is often done by defining A with aid of an interpola- tion series and then estimating the difference on the left-hand side of (1). Investigations by Holt and Vaaler [5], Li and Vaaler [7], and the author [8] suggest that a generalization of this approach is needed which allows for non-equally spaced node sets. The starting point is a relation between F and a function g given by Z ∞ 1 = F (x) extg(t)dt, (2) −∞ Conference Title 1 Editors pp. 1–6. Copyright Oc 2005 by Nashboro Press, Brentwood, TN. ISBN 0-0-9728482-x-x All rights of reproduction in any form reserved.
    [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]
  • Lecture Note for Math 220A Complex Analysis of One Variable
    Lecture Note for Math 220A Complex Analysis of One Variable Song-Ying Li University of California, Irvine Contents 1 Complex numbers and geometry 2 1.1 Complex number field . 2 1.2 Geometry of the complex numbers . 3 1.2.1 Euler's Formula . 3 1.3 Holomorphic linear factional maps . 6 1.3.1 Self-maps of unit circle and the unit disc. 6 1.3.2 Maps from line to circle and upper half plane to disc. 7 2 Smooth functions on domains in C 8 2.1 Notation and definitions . 8 2.2 Polynomial of degree n ...................... 9 2.3 Rules of differentiations . 11 3 Holomorphic, harmonic functions 14 3.1 Holomorphic functions and C-R equations . 14 3.2 Harmonic functions . 15 3.3 Translation formula for Laplacian . 17 4 Line integral and cohomology group 18 4.1 Line integrals . 18 4.2 Cohomology group . 19 4.3 Harmonic conjugate . 21 1 5 Complex line integrals 23 5.1 Definition and examples . 23 5.2 Green's theorem for complex line integral . 25 6 Complex differentiation 26 6.1 Definition of complex differentiation . 26 6.2 Properties of complex derivatives . 26 6.3 Complex anti-derivative . 27 7 Cauchy's theorem and Morera's theorem 31 7.1 Cauchy's theorems . 31 7.2 Morera's theorem . 33 8 Cauchy integral formula 34 8.1 Integral formula for C1 and holomorphic functions . 34 8.2 Examples of evaluating line integrals . 35 8.3 Cauchy integral for kth derivative f (k)(z) . 36 9 Application of the Cauchy integral formula 36 9.1 Mean value properties .
    [Show full text]
  • Notes on Analytic Functions
    Notes on Analytic Functions In these notes we define the notion of an analytic function. While this is not something we will spend a lot of time on, it becomes much more important in some other classes, in particular complex analysis. First we recall the following facts, which are useful in their own right: Theorem 1. Let (fn) be a sequence of functions on (a; b) and suppose that each fn is differentiable. 0 If (fn) converges to a function f uniformly and the sequence of derivatives (fn) converges uniformly to a function g, then f is differentiable and f 0 = g. So, the uniform limit of differentiable functions is itself differentiable as long as the sequence of derivatives also converges uniformly, in which case the derivative of the uniform limit is the uniform limit of the derivatives. We will not prove this here as the proof is not easy; however, note that the proof of Theorem 26.5 in the book can be modified to give a proof of the above theorem in the 0 special case that each derivative fn is continuous. Note that we need the extra assumption that the sequence of derivatives converges uniformly, as the following example shows: q 2 1 Example 1. For each n, let fn :(−1; 1) be the function fn(x) = x + n . We have seen before that (fn) converges uniformly to f(x) = jxj on (−1; 1). Each fn is differentiable at 0 but f is not, so the uniform limit of differentiable functions need not be differentiable. We shouldn't expect that the uniform limit of differentiable functions be differentiable for the fol- lowing reason: differentiability is a local condition which measures how rapidly a function changes, while uniform convergence is a global condition which measures how close functions are to one another.
    [Show full text]
  • A New Entire Factorial Function
    A new entire factorial function Matthew D. Klimek Laboratory for Elementary Particle Physics, Cornell University, Ithaca, NY, 14853, USA Department of Physics, Korea University, Seoul 02841, Republic of Korea Abstract We introduce a new factorial function which agrees with the usual Euler gamma function at both the positive integers and at all half-integers, but which is also entire. We describe the basic features of this function. The canonical extension of the factorial to the complex plane is given by Euler's gamma function Γ(z). It is the only such extension that satisfies the recurrence relation zΓ(z) = Γ(z + 1) and is logarithmically convex for all positive real z [1, 2]. (For an alternative function theoretic characterization of Γ(z), see [3].) As a consequence of the recurrence relation, Γ(z) is a meromorphic function when continued onto − the complex plane. It has poles at all non-positive integer values of z 2 Z0 . However, dropping the two conditions above, there are infinitely many other extensions of the factorial that could be constructed. Perhaps the second best known factorial function after Euler's is that of Hadamard [4] which can be expressed as sin πz z z + 1 H(z) = Γ(z) 1 + − ≡ Γ(z)[1 + Q(z)] (1) 2π 2 2 where (z) is the digamma function d Γ0(z) (z) = log Γ(z) = : (2) dz Γ(z) The second term in brackets is given the name Q(z) for later convenience. We see that the Hadamard gamma is a certain multiplicative modification to the Euler gamma.
    [Show full text]