AS HandMathFunc 2010
PDF · 967 pages · 27.8 MB
Open PDF file
A copy of the NIST Handbook of Mathematical Functions, edited by Olver, Lozier, Boisvert and Clark and published by Cambridge University Press in 2010. It has 36 chapters by many expert authors, covering Gamma, Bessel, Airy, hypergeometric, elliptic, theta and zeta functions, orthogonal polynomials, Painlevé transcendents and others. It is a published reference book, not Phil's own writing; the file name suggests it is a download kept for reference.
AI-written summary; may contain errors.
Extracted text (machine-read; may contain errors)
NIST Handbook of Mathematical Functions
Modern developments in theoretical and applied science depend on knowledge of the properties of mathematical
functions, from elementary trigonometric functions to the multitude of special functions. These functions appear
whenever natural phenomena are studied, engineering problems are formulated, and numerical simulations are per-
formed. They also crop up in statistics, financial models, and economic analysis. Using them effectively requirespractitioners to have ready access to a reliable collection of their properties.
This handbook results from a 10-year project conducted by the National Institute of Standards and Technology
with an international group of expert authors and validators. Printed in full color, it is destined to replace itspredecessor, the classic but long-outdated Handbook of Mathematical Functions , edited by Abramowitz and Stegun.
Included with every copy of the book is a CD with a searchable PDF.
Frank W. J. Olver is Professor Emeritus in the Institute for Physical Science and Technology and the Department
of Mathematics at the University of Maryland. From 1961 to 1986 he was a Mathematician at the National Bureau
of Standards in Washington, D.C. Professor Olver has published 76 papers in refereed and leading mathematics
journals, and he is the author of Asymptotics and Special Functions (1974). He has served as editor of SIAM
Journal on Numerical Analysis ,SIAM Journal on Mathematical Analysis ,Mathematics of Computation ,Methods
and Applications of Analysis , and the NBS Journal of Research .
Daniel W. Lozier leads the Mathematical Software Group in the Mathematical and Computational Sciences Division
of NIST. He received his Ph.D. in applied mathematics from the University of Maryland in 1979 and has been at
NIST since 1970. He is an active member of the SIAM Activity Group on Orthogonal Polynomials and SpecialFunctions, having served two terms as chair and one as vice-chair, and currently is serving as secretary. He has been
an editor of Mathematics of Computation and the NIST Journal of Research .
Ronald F. Boisvert leads the Mathematical and Computational Sciences Division of the Information Technology
Laboratory at NIST. He received his Ph.D. in computer science from Purdue University in 1979 and has been at
NIST since then. He has served as editor-in-chief of the ACM Transactions on Mathematical Software . He is currently
co-chair of the Publications Board of the Association for Computing Machinery (ACM) and chair of the International
Federation for Information Processing (IFIP) Working Group 2.5 (Numerical Software).
Charles W. Clark received his Ph.D. in physics from the University of Chicago in 1979. He is a member of the U.S.
Senior Executive Service and Chief of the Electron and Optical Physics Division and acting Group Leader of theNIST Synchrotron Ultraviolet Radiation Facility (SURF III). Clark serves as Program Manager for Atomic and
Molecular Physics at the U.S. Office of Naval Research and is a Fellow of the Joint Quantum Institute of NIST and
the University of Maryland at College Park and a Visiting Professor at the National University of Singapore.
Rainbow over Woolsthorpe Manor
From the frontispiece of the Notes and Records of the Royal Society of London , v. 36 (1981{82), with permission. Photograph
by Dr. Roy L. Bishop, Physics Department, Acadia University, Nova Scotia, Canada, with permission.
Commentary
The faint line below the main colored arc is a supernumerary rainbow , produced by the interference of
dierent sun-rays traversing a raindrop and emerging in the same direction. For each color, the intensity
prole across the rainbow is an Airy function. Airy invented his function in 1838 precisely to describe
this phenomenon more accurately than Young had done in 1800 when pointing out that supernumerary
rainbows require the wave theory of light and are impossible to explain with Newton's picture of light as
a stream of independent corpuscles. The house in the picture is Newton's birthplace.
Sir Michael V. Berry
H. H. Wills Physics Laboratory
Bristol, United Kingdom
NIST Handbook of Mathematical Functions
F r a n kW .J .O l v e r
Editor-in-Chief and Mathematics Editor
Daniel W. Lozier
General Editor
Ronald F. Boisvert
Information Technology Editor
Charles W. Clark
Physical Sciences Editor
and
cambridge university press
Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore,
S˜ao Paulo, Delhi, Dubai, Tokyo
Cambridge University Press
32 Avenue of the Americas, New York, NY 10013-2473, USA
www.cambridge.org
Information on this title: www.cambridge.org/9780521140638
c/circlecopyrtNational Institute of Standards and Technology 2010
Pursuant to Title 17 USC 105, the National Institute of Standards and Technology (NIST), United
States Department of Commerce, is authorized to receive and hold copyrights transferred to it by
assignment or otherwise. Authors of the work appearing in this publication have assigned copyright to
the work to NIST, United States Department of Commerce, as represented by the Secretary of
Commerce. These works are owned by NIST.
Limited copying and internal distribution of the content of this publication is permitted for research
and teaching. Reproduction, copying, or distribution for any commercial purpose is strictly prohibited.
Bulk copying, reproduction, or redistribution in any form is not permitted. Questions regarding this
copyright policy should be directed to NIST.
While NIST has made every effort to ensure the accuracy and reliability of the information in this
publication, it is expressly provided “as is.” NIST and Cambridge University Press together and
separately make no warranty of any type, including warranties of merchantability or fitness for a
particular purpose. NIST and Cambridge University Press together and separately make no warranties
or representations as to the correctness, accuracy, or reliability of the information. As a condition of
using it, you explicitly release NIST and Cambridge University Press from any and all liability for any
damage of any type that may result from errors or omissions.
Certain products, commercial and otherwise, are mentioned in this publication. These mentions are for
informational purposes only, and do not imply recommendation or endorsement by NIST.
All rights reserved.
This publication is in copyright. Subject to statutory exception
and to the provisions of relevant collective licensing agreements,
no reproduction of any part may take place without the written
permission of Cambridge University Press.
First published 2010
Printed in the United States of America
A catalog record for this publication is available from the British Library.
ISBN 978-0-521-19225-5 Hardback
ISBN 978-0-521-14063-8 Paperback
Additional resources for this publication at http://dlmf.nist.gov/.
Cambridge University Press and the National Institute of Standards
and Technology have no responsibility for the persistence or
accuracy of URLs for external or third-party Internet Web sites
referred to in this publication and do not guarantee that any
content on such Web sites is, or will remain, accurate or
appropriate.
Contents
Foreword . . . . . . . . . . . . . . . . . . vii
Preface . . . . . . . . . . . . . . . . . . . ix
Mathematical Introduction . . . . . . . xiii
1Algebraic and Analytic Methods
R. Roy, F. W. J. Olver, R. A. Askey, R. Wong 1
2Asymptotic Approximations
F. W. J. Olver, R. Wong . . . . . . . . . . 41
3Numerical Methods
N. M. Temme . . . . . . . . . . . . . . . . 71
4Elementary Functions
R. Roy, F. W. J. Olver . . . . . . . . . . . . 103
5Gamma Function
R. A. Askey, R. Roy . . . . . . . . . . . . . 135
6Exponential, Logarithmic, Sine, and
Cosine Integrals
N. M. Temme . . . . . . . . . . . . . . . . 149
7Error Functions, Dawson's and Fresnel
Integrals
N. M. Temme . . . . . . . . . . . . . . . . 159
8Incomplete Gamma and Related
Functions
R. B. Paris . . . . . . . . . . . . . . . . . . 173
9Airy and Related Functions
F. W. J. Olver . . . . . . . . . . . . . . . . 193
10 Bessel Functions
F. W. J. Olver, L. C. Maximon . . . . . . . 215
11 Struve and Related Functions
R. B. Paris . . . . . . . . . . . . . . . . . . 287
12 Parabolic Cylinder Functions
N. M. Temme . . . . . . . . . . . . . . . . 303
13 Con
uent Hypergeometric Functions
A. B. Olde Daalhuis . . . . . . . . . . . . . 321
14 Legendre and Related Functions
T. M. Dunster . . . . . . . . . . . . . . . . 351
15 Hypergeometric Function
A. B. Olde Daalhuis . . . . . . . . . . . . . 383
16 Generalized Hypergeometric Functions
and MeijerG-Function
R. A. Askey, A. B. Olde Daalhuis . . . . . . 403
17q-Hypergeometric and Related Func-
tions
G. E. Andrews . . . . . . . . . . . . . . . . 41918 Orthogonal Polynomials
T. H. Koornwinder, R. Wong, R. Koekoek,
R. F. Swarttouw . . . . . . . . . . . . . . . 435
19 Elliptic Integrals
B. C. Carlson . . . . . . . . . . . . . . . . 485
20 Theta Functions
W. P. Reinhardt, P. L. Walker . . . . . . . 523
21 Multidimensional Theta Functions
B. Deconinck . . . . . . . . . . . . . . . . 537
22 Jacobian Elliptic Functions
W. P. Reinhardt, P. L. Walker . . . . . . . 549
23 Weierstrass Elliptic and Modular
Functions
W. P. Reinhardt, P. L. Walker . . . . . . . 569
24 Bernoulli and Euler Polynomials
K. Dilcher . . . . . . . . . . . . . . . . . . 587
25 Zeta and Related Functions
T. M. Apostol . . . . . . . . . . . . . . . . 601
26 Combinatorial Analysis
D. M. Bressoud . . . . . . . . . . . . . . . 617
27 Functions of Number Theory
T. M. Apostol . . . . . . . . . . . . . . . . 637
28 Mathieu Functions and Hill's Equation
G. Wolf . . . . . . . . . . . . . . . . . . . 651
29 Lam e Functions
H. Volkmer . . . . . . . . . . . . . . . . . . 683
30 Spheroidal Wave Functions
H. Volkmer . . . . . . . . . . . . . . . . . . 697
31 Heun Functions
B. D. Sleeman, V. B. Kuznetsov . . . . . . 709
32 Painlev e Transcendents
P. A. Clarkson . . . . . . . . . . . . . . . . 723
33 Coulomb Functions
I. J. Thompson . . . . . . . . . . . . . . . 741
343j;6j;9jSymbols
L. C. Maximon . . . . . . . . . . . . . . . . 757
35 Functions of Matrix Argument
D. St. P. Richards . . . . . . . . . . . . . . 767
36 Integrals with Coalescing Saddles
M. V. Berry, C. J. Howls . . . . . . . . . . 775
Bibliography . . . . . . . . . . . . . . . . 795
Notations . . . . . . . . . . . . . . . . . 873
Index . . . . . . . . . . . . . . . . . . . . 887
v
Foreword
In 1964 the National Institute of Standards and Technology1published the Handbook of Mathe-
matical Functions with Formulas, Graphs, and Mathematical Tables , edited by Milton Abramowitz
and Irene A. Stegun. That 1046-page tome proved to be an invaluable reference for the many scien-
tists and engineers who use the special functions of applied mathematics in their day-to-day work,
so much so that it became the most widely distributed and most highly cited NIST publication
in the rst 100 years of the institution's existence.2The success of the original handbook, widely
referred to as \Abramowitz and Stegun" (\A&S"), derived not only from the fact that it provided
critically useful scientic data in a highly accessible format, but also because it served to standardize
denitions and notations for special functions. The provision of standard reference data of this type
is a core function of NIST.
Much has changed in the years since A&S was published. Certainly, advances in applied mathe-
matics have continued unabated. However, we have also seen the birth of a new age of computing
technology, which has not only changed how we utilize special functions, but also how we commu-
nicate technical information. The document you are now holding, or the Web page you are now
reading, represents an eort to extend the legacy of A&S well into the 21st century. The new
printed volume, the NIST Handbook of Mathematical Functions , serves a similar function as the
original A&S, though it is heavily updated and extended. The online version, the NIST Digital
Library of Mathematical Functions (DLMF) , presents the same technical information along with
extensions and innovative interactive features consistent with the new medium. The DLMF may
well serve as a model for the eective presentation of highly mathematical reference material on the
Web.
The production of these new resources has been a very complex undertaking some 10 years in
the making. This could not have been done without the cooperation of many mathematicians,
information technologists, and physical scientists both within NIST and externally. Their unfailing
dedication is acknowledged deeply and gratefully. Particular attention is called to the generous
support of the National Science Foundation, which made possible the participation of experts from
academia and research institutes worldwide.
Dr. Patrick D. Gallagher
Director, NIST
November 20, 2009
Gaithersburg, Maryland
1Then known as the National Bureau of Standards.
2D. R. Lide (ed.), A Century of Excellence in Measurement, Standards, and Technology , CRC Press, 2001.
vii
Preface
The NIST Handbook of Mathematical Functions , to-
gether with its Web counterpart, the NIST Digital Li-
brary of Mathematical Functions (DLMF) , is the cul-
mination of a project that was conceived in 1996 at the
National Institute of Standards and Technology (NIST).
The project had two equally important goals: to develop
an authoritative replacement for the highly successful
Handbook of Mathematical Functions with Formulas,
Graphs, and Mathematical Tables , published in 1964 by
the National Bureau of Standards (M. Abramowitz and
I. A. Stegun, editors); and to disseminate essentially the
same information from a public Web site operated by
NIST. The new Handbook and DLMF are the work of
many hands: editors, associate editors, authors, valida-
tors, and numerous technical experts. A summary of
the responsibilities of these groups may help in under-
standing the structure and results of this project.
Executive responsibility was vested in the editors:
Frank W. J. Olver (University of Maryland, College
Park, and NIST), Daniel W. Lozier (NIST), Ronald F.
Boisvert (NIST), and Charles W. Clark (NIST). Olver
was responsible for organizing and editing the mathe-
matical content after receiving it from the authors; for
communicating with the associate editors, authors, val-
idators, and other technical experts; and for assembling
theNotations section and the Index . In addition,
Olver was author or co-author of ve chapters. Lozier
directed the NIST research, technical, and support sta
associated with the project, administered grants and
contracts, together with Boisvert compiled the Soft-
ware sections for the Web version of the chapters,
conducted editorial and sta meetings, represented the
project within NIST and at professional meetings in
the United States and abroad, and together with Olver
carried out the day-to-day development of the project.
Boisvert and Clark were responsible for advising and
assisting in matters related to the use of information
technology and applications of special functions in the
physical sciences (and elsewhere); they also participated
in the resolution of major administrative problems when
they arose.
The associate editors are eminent domain experts
who were recruited to advise the project on strategy, ex-
ecution, subject content, format, and presentation, and
to help identify and recruit suitable candidate authors
and validators. The associate editors were:
Richard A. Askey
University of Wisconsin, MadisonMichael V. Berry
University of Bristol
Walter Gautschi (resigned 2002)
Purdue University
Leonard C. Maximon
George Washington University
Morris Newman
University of California, Santa Barbara
Ingram Olkin
Stanford University
Peter Paule
Johannes Kepler University
William P. Reinhardt
University of Washington
Nico M. Temme
Centrum voor Wiskunde en Informatica
Jet Wimp (resigned 2001)
Drexel University
The technical information provided in the Hand-
book and DLMF was prepared by subject experts from
around the world. They are identied on the title pages
of the chapters for which they served as authors and in
the table of Contents.
The validators played a critical role in the project,
one that was absent in its 1964 counterpart: to provide
critical, independent reviews during the development of
each chapter, with attention to accuracy and appropri-
ateness of subject coverage. These reviews have con-
tributed greatly to the quality of the product. The val-
idators were:
T. M. Apostol
California Institute of Technology
A. R. Barnett
University of Waikato, New Zealand
A. I. Bobenko
Technische Universit at, Berlin
B. B. L. Braaksma
University of Groningen
D. M. Bressoud
Macalester College
ix
x Preface
B. C. Carlson
Iowa State University
B. Deconinck
University of Washington
T. M. Dunster
University of California, San Diego
A. Gil
Universidad de Cantabria
A. R. Its
Indiana University{Purdue University, Indianapo-
lis
B. R. Judd
Johns Hopkins University
R. Koekoek
Delft University of Technology
T. H. Koornwinder
University of Amsterdam
R. J. Muirhead
Pzer Global R&D
E. Neuman
University of Illinois, Carbondale
A. B. Olde Daalhuis
University of Edinburgh
R. B. Paris
University of Abertay Dundee
R. Roy
Beloit College
S. N. M. Ruijsenaars
University of Leeds
J. Segura
Universidad de Cantabria
R. F. Swarttouw
Vrije Universiteit Amsterdam
N. M. Temme
Centrum voor Wiskunde en Informatica
H. Volkmer
University of Wisconsin, Milwaukee
G. Wolf
Universit at Duisberg-Essen
R. Wong
City University of Hong KongAll of the mathematical information contained in the
Handbook is also contained in the DLMF, along with
additional features such as more graphics, expanded ta-
bles, and higher members of some families of formulas;
in consequence, in the Handbook there are occasional
gaps in the numbering sequences of equations, tables,
and gures. The Web address where additional DLMF
content can be found is printed in blue at appropriate
places in the Handbook. The home page of the DLMF
is accessible at http://dlmf.nist.gov/ .
The DLMF has been constructed specically for
eective Web usage and contains features unique to
Web presentation. The Web pages contain many ac-
tive links, for example, to the denitions of symbols
within the DLMF, and to external sources of reviews,
full texts of articles, and items of mathematical soft-
ware. Advanced capabilities have been developed at
NIST for the DLMF, and also as part of a larger re-
search eort intended to promote the use of the Web
as a tool for doing mathematics. Among these capabili-
ties are: a facility to allow users to download LaTeX and
MathML encodings of every formula into document pro-
cessors and software packages (eventually, a fully seman-
tic downloading capability may be possible); a search
engine that allows users to locate formulas based on
queries expressed in mathematical notation; and user-
manipulable 3-dimensional color graphics.
Production of the Handbook and DLMF was a mam-
moth undertaking, made possible by the dedicated lead-
ership of Bruce R. Miller (NIST), Bonita V. Saunders
(NIST), and Abdou S. Youssef (George Washington
University and NIST). Miller was responsible for infor-
mation architecture, specializing LaTeX for the needs of
the project, translation from LaTeX to MathML, and
the search interface. Saunders was responsible for mesh
generation for curves and surfaces, data computation
and validation, graphics production, and interactive
Web visualization. Youssef was responsible for mathe-
matics search indexing and query processing. They were
assisted by the following NIST sta: Marjorie A. Mc-
Clain (LaTeX, bibliography), Joyce E. Conlon (bibliog-
raphy), Gloria Wiersma (LaTeX), Qiming Wang (graph-
ics generation, graphics viewers), and Brian Antonishek
(graphics viewers).
The editors acknowledge the many other individuals
who contributed to the project in a variety of ways.
Among the research, technical, and support sta at
NIST these are B. K. Alpert, T. M. G. Arrington, R.
Bickel, B. Blaser, P. T. Boggs, S. Burley, G. Chu, A.
Dienstfrey, M. J. Donahue, K. R. Eberhardt, B. R.
Fabijonas, M. Fancher, S. Fletcher, J. Fowler, S. P.
Frechette, C. M. Furlani, K. B. Gebbie, C. R. Hagwood,
A. N. Heckert, M. Huber, P. K. Janert, R. N. Kacker,
R. F. Kayser, P. M. Ketcham, E. Kim, M. J. Lieber-
Preface xi
man, R. R. Lipman, M. S. Madsen, E. A. P. Mai, W.
Mehuron, P. J. Mohr, S. Olver, D. R. Penn, S. Phoha,
A. Possolo, S. P. Ressler, M. Rubin, J. Rumble, C. A.
Schanzle, B. I. Schneider, N. Sedransk, E. L. Shirley,
G. W. Stewart, C. P. Sturrock, G. Thakur, S. Wakid,
and S. F. Zevin. Individuals from outside NIST are S. S.
Antman, A. M. Ashton, C. M. Bender, J. J. Benedetto,
R. L. Bishop, J. M. Borwein, H. W. Braden, C. Brezin-
ski, F. Chyzak, J. N. L. Connor, R. Cools, A. Cuyt,
I. Daubechies, P. J. Davis, C. F. Dunkl, J. P. Goed-
bloed, B. Gordon, J. W. Jenkins, L. H. Kellogg, C. D.
Kemp, K. S. K olbig, S. G. Krantz, M. D. Kruskal, W.
Lay, D. A. Lutz, E. L. Manseld, G. Marsaglia, B. M.
McCoy, W. Miller, Jr., M. E. Muldoon, S. P. Novikov,
P. J. Olver, W. C. Parke, M. Petkovsek, W. H. Reid, B.
Salvy, C. Schneider, M. J. Seaton, N. C. Severo, I. A.
Stegun, F. Stenger, M. Steuerwalt, W. G. Strang, P. R.
Turner, J. Van Deun, M. Vuorinen, E. J. Weniger, H.
Wiersma, R. C. Winther, D. B. Zagier, and M. Zelen.
Undoubtedly, the editors have overlooked some individ-
uals who contributed, as is inevitable in a large long-
lasting project. Any oversight is unintentional, and the
editors apologize in advance.
The project was funded in part by NSF Award
9980036, administered by the NSF's Knowledge and
Distributed Intelligence Program. Within NIST nan-
cial resources and sta were committed by the Informa-tion Technology Laboratory, Physics Laboratory, Sys-
tems Integration for Manufacturing Applications Pro-
gram of the Manufacturing Engineering Laboratory,
Standard Reference Data Program, and Advanced Tech-
nology Program.
Notwithstanding the great care that has been exer-
cised by the editors, authors, validators, and the NIST
sta, it is almost inevitable that in a work of the mag-
nitude and scope of the NIST Handbook and DLMF
errors will still be present. Users need to be aware that
none of these individuals nor the National Institute of
Standards and Technology can assume responsibility for
any possible consequences of such errors.
Lastly, the editors appreciate the skill, and long ex-
perience, that was brought to bear by the publisher,
Cambridge University Press, on the production and
publication of the new Handbook.
Frank W. J. Olver
Editor-in-Chief and Mathematics Editor
Daniel W. Lozier
General Editor
Ronald F. Boisvert
Information Technology Editor
Charles W. Clark
Physical Sciences Editor
Mathematical Introduction
Organization and Objective
The mathematical content of the NIST Handbook of
Mathematical Functions has been produced over a ten-
year period. This part of the project has been carried
out by a team comprising the mathematics editor, au-
thors, validators, and the NIST professional sta. Also,
valuable initial advice on all aspects of the project was
provided by ten external associate editors.
The NIST Handbook has essentially the same ob-
jective as the Handbook of Mathematical Functions that
was issued in 1964 by the National Bureau of Standards
as Number 55 in the NBS Applied Mathematics Series
(AMS). This objective is to provide a reference tool for
researchers and other users in applied mathematics, the
physical sciences, engineering, and elsewhere who en-
counter special functions in the course of their everyday
work.
The mathematical project team has endeavored to
take into account the hundreds of research papers and
numerous books on special functions that have appeared
since 1964. As a consequence, in addition to providing
more information about the special functions that were
covered in AMS 55, the NIST Handbook includes sev-
eral special functions that have appeared in the interim
in applied mathematics, the physical sciences, and en-
gineering, as well as in other areas. See, for example,
Chapters 16, 17, 18, 19, 21, 27, 29, 31, 32, 34, 35, and
36.
Two other ways in which this Handbook diers from
AMS 55, and other handbooks, are as follows.
First, the editors instituted a validation process for
the whole technical content of each chapter. This pro-
cess greatly extended normal editorial checking proce-
dures. All chapters went through several drafts (nine in
some cases) before the authors, validators, and editors
were fully satised.
Secondly, as described in the Preface , a Web ver-
sion (the NIST DLMF) is also available.
Methodology
The rst three chapters of the NIST Handbook and
DLMF are methodology chapters that provide detailed
coverage of, and references for, mathematical topics that
are especially important in the theory, computation,
and application of special functions. (These chapters
can also serve as background material for universitygraduate courses in complex variables, classical anal-
ysis, and numerical analysis.)
Particular care is taken with topics that are not dealt
with suciently thoroughly from the standpoint of this
Handbook in the available literature. These include, for
example, multivalued functions of complex variables, for
which new denitions of branch points and principal val-
ues are supplied ( xx1.10(vi), 4.2(i)); the Dirac delta (or
delta function), which is introduced in a more readily
comprehensible way for mathematicians ( x1.17); numer-
ically satisfactory solutions of dierential and dierence
equations (xx2.7(iv), 2.9(i)); and numerical analysis for
complex variables (Chapter 3).
In addition, there is a comprehensive account of the
great variety of analytical methods that are used for
deriving and applying the extremely important asymp-
totic properties of the special functions, including dou-
ble asymptotic properties (Chapter 2 and xx10.41(iv),
10.41(v)).
Notation for the Special Functions
The rst section in each of the special function chapters
(Chapters 5{36) lists notation that has been adopted
for the functions in that chapter. This section may also
include important alternative notations that have ap-
peared in the literature. With a few exceptions the
adopted notations are the same as those in standard
applied mathematics and physics literature.
The exceptions are ones for which the existing no-
tations have drawbacks. For example, for the hyperge-
ometric function we often use the notation F(a;b;c;z)
(x15.2(i)) in place of the more conventional 2F1(a;b;c;z)
orF(a;b;c;z). This is because Fis akin to the notation
used for Bessel functions ( x10.2(ii)), inasmuch as Fis an
entire function of each of its parameters a,b, andc: this
results in fewer restrictions and simpler equations. Sim-
ilarly in the case of con
uent hypergeometric functions
(x13.2(i)).
Other examples are: (a) the notation for the Fer-
rers functions|also known as associated Legendre func-
tions on the cut|for which existing notations can eas-
ily be confused with those for other associated Legendre
functions (x14.1); (b) the spherical Bessel functions for
which existing notations are unsymmetric and inelegant
(xx10.47(i) and 10.47(ii)); and (c) elliptic integrals for
which both Legendre's forms and the more recent sym-
metric forms are treated fully (Chapter 19).
xiii
xiv Mathematical Introduction
TheNotations section beginning on p. 873 includes
all the notations for the special functions adopted in this
Handbook. In the corresponding section for the DLMF
some of the alternative notations that appear in the rst
section of the special function chapters are also included.
Common Notations and Denitions
C complex plane (excluding innity).
D decimal places.
det determinant.
j;korjk Kronecker delta: 0 if j6=k; 1 if
j=k.
(or x) forward dierence operator:
f(x) =f(x+ 1) f(x).
r(orrx) backward dierence operator:
rf(x) =f(x) f(x 1). (See also
del operator in the Notations
section.)
empty sums zero.
empty products unity.
2 element of.
=2 not an element of.
8 for every.
=) implies.
() is equivalent to.
n! factorial: 1 23nif
n= 1;2;3;:::; 1 ifn= 0.
n!! double factorial: 2 46nif
n= 2;4;6;:::; 135nif
n= 1;3;5;:::; 1 ifn= 0; 1.
bxc
oor or integer part: the integer
such thatx 1<bxcx, withx
real.
dxe ceiling: the integer such that
xdxe<x+ 1, withxreal.
f(z)jC= 0 f(z) is continuous at all points of a
simple closed contour CinC.
<1 is nite, or converges.
much greater than.
= imaginary part.
i if and only if.
inf greatest lower bound (inmum).
sup least upper bound (supremum).
\ intersection.
[ union.
(a;b) open interval in R, or open
straight-line segment joining aandb
inC.
[a;b] closed interval in R, or closed
straight-line segment joining aandb
inC.
(a;b] or [a;b) half-closed intervals. is contained in.
is, or is contained in.
lim inf least limit point.
[aj;k] or [ajk] matrix with ( j;k)th element aj;kor
ajk.
A 1inverse of matrix A.
trA trace of matrix A.
ATtranspose of matrix A.
I unit matrix.
mod or modulo mn(modp) meanspdivides
m n, wherem,n, andpare
positive integers with m>n .
N set of all positive integers.
()nPochhammer's symbol:
(+ 1)(+ 2)(+n 1) if
n= 1;2;3;:::; 1 ifn= 0.
Q set of all rational numbers.
R real line (excluding innity).
< real part.
res residue.
S signicant gures.
signx 1 ifx<0; 0 ifx= 0; 1 ifx>0.
n set subtraction.
Z set of all integers.
nZ set of all integer multiples of n.
Graphics
Special functions with one real variable are depicted
graphically with conventional two-dimensional (2D) line
graphs. See, for example, Figures 10.3.1{10.3.4.
With two real variables, special functions are de-
picted as 3D surfaces, with vertical height correspond-
ing to the value of the function, and coloring added to
emphasize the 3D nature. See Figures 10.3.5{10.3.8 for
examples.
Special functions with a complex variable are de-
picted as colored 3D surfaces in a similar way to func-
tions of two real variables, but with the vertical height
corresponding to the modulus (absolute value) of the
function. See, for example, Figures 5.3.4{5.3.6. How-
ever, in many cases the coloring of the surface is chosen
instead to indicate the quadrant of the plane to which
the phase of the function belongs, thereby achieving a
4D eect. In these cases the phase colors that corre-
spond to the 1st, 2nd, 3rd, and 4th quadrants are ar-
ranged in alphabetical order: blue, green, red, and yel-
low, respectively, and a \Quadrant Colors" icon appears
alongside the gure. See, for example, Figures 10.3.9{
10.3.16.
Lastly, users may notice some lack of smoothness in
the color boundaries of some of the 4D-type surfaces;
see, for example, Figure 10.3.9. This nonsmoothness
arises because the mesh that was used to generate the
Mathematical Introduction xv
gure was optimized only for smoothness of the surface,
and not for smoothness of the color boundaries.
Applications
All of the special function chapters include sections de-
voted to mathematical, physical, and sometimes other
applications of the main functions in the chapter. The
purpose of these sections is simply to illustrate the im-
portance of the functions in other disciplines; no at-
tempt is made to provide exhaustive coverage.
Computation
All of the special function chapters contain sections
that describe available methods for computing the main
functions in the chapter, and most also provide refer-
ences to numerical tables of, and approximations for,
these functions. In addition, the DLMF provides refer-
ences to research papers in which software is developed,
together with links to sites where the software can be
obtained.
In referring to the numerical tables and approxima-
tions we use notation typied by x= 0(:05)1, 8D or 8S.
This means that the variable xranges from 0 to 1 in
intervals of 0.05, and the corresponding function values
are tabulated to 8 decimal places or 8 signicant gures.
Another numerical convention is that decimals fol-
lowed by dots are unrounded; without the dots they
are rounded. For example, to 4D is 3:1415:::(un-
rounded) and 3.1416 (rounded).Verication
For all equations and other technical information this
Handbook and the DLMF either provide references to
the literature for proof or describe steps that can be
followed to construct a proof. In the Handbook this in-
formation is grouped at the section level and appears
under the heading Sources in the References section.
In the DLMF this information is provided in pop-up
windows at the subsection level.
For equations or other technical information that ap-
peared previously in AMS 55, the DLMF usually in-
cludes the corresponding AMS 55 equation number, or
other form of reference, together with corrections, if
needed. However, none of these citations are to be re-
garded as supplying proofs.
Special Acknowledgment
I pay tribute to my friend and predecessor Milton
Abramowitz. His genius in the creation of the National
Bureau of Standards Handbook of Mathematical Func-
tions paid enormous dividends to the world's scientic,
mathematical, and engineering communities, and paved
the way for the development of the NIST Handbook of
Mathematical Functions and NIST Digital Library of
Mathematical Functions .
Frank W. J. Olver, Mathematics Editor
Chapter 1
Algebraic and Analytic Methods
R. Roy1, F. W. J. Olver2, R. A. Askey3and R. Wong4
Notation 2
1.1 Special Notation . . . . . . . . . . . . . 2
Areas 2
1.2 Elementary Algebra . . . . . . . . . . . . 2
1.3 Determinants . . . . . . . . . . . . . . . 3
1.4 Calculus of One Variable . . . . . . . . . 4
1.5 Calculus of Two or More Variables . . . . 7
1.6 Vectors and Vector-Valued Functions . . 9
1.7 Inequalities . . . . . . . . . . . . . . . . 12
1.8 Fourier Series . . . . . . . . . . . . . . . 13
1.9 Calculus of a Complex Variable . . . . . . 141.10 Functions of a Complex Variable . . . . . 18
1.11 Zeros of Polynomials . . . . . . . . . . . 22
1.12 Continued Fractions . . . . . . . . . . . . 24
1.13 Dierential Equations . . . . . . . . . . . 25
1.14 Integral Transforms . . . . . . . . . . . . 27
1.15 Summability Methods . . . . . . . . . . . 33
1.16 Distributions . . . . . . . . . . . . . . . . 35
1.17 Integral and Series Representations of the
Dirac Delta . . . . . . . . . . . . . . . . 37
References 39
1Department of Mathematics and Computer Science, Beloit College, Beloit, Wisconsin.
2Institute for Physical Science and Technology and Department of Mathematics, University of Maryland, College Park, Maryland.
3Department of Mathematics, University of Wisconsin, Madison, Wisconsin.
4Liu Bie Ju Centre for Mathematical Sciences, City University of Hong Kong, Kowloon, Hong Kong.
Acknowledgments : The authors thank Leonard Maximon and William Parke for their assistance with the writing of x1.17.
Copyright c
2009 National Institute of Standards and Technology. All rights reserved.
1
2 Algebraic and Analytic Methods
Notation
1.1 Special Notation
(For other notation see pp. xiv and 873.)
x;y real variables.
z real variable inxx1.5{1.6.
z;w complex variables in xx1.9{1.11.
j;k;` integers.
m;n nonnegative integers, unless specied
otherwise.
hf;gi distribution.
deg degree.
primes derivatives with respect to the variable,
except where indicated otherwise.
Areas
1.2 Elementary Algebra
1.2(i) Binomial Coecients
In (1.2.1){(1.2.5) kandnare nonnegative integers and
kn.
1.2.1n
k
=n!
(n k)!k!=n
n k
:
Binomial Theorem
1.2.2(a+b)n=an+n
1
an 1b+n
2
an 2b2
++n
n 1
abn 1+bn:
1.2.3n
0
+n
1
++n
n
= 2n:
1.2.4n
0
n
1
++ ( 1)nn
n
= 0:
1.2.5n
0
+n
2
+n
4
++n
k
= 2n 1;
wherekisnorn 1 according as nis even or odd.
In (1.2.6){(1.2.9) kandmare nonnegative integers
andnis unrestricted.
1.2.6n
k
=n(n 1)(n k+ 1)
k!
=( 1)k( n)k
k!= ( 1)kk n 1
k
:
1.2.7n+ 1
k
=n
k
+n
k 1
:
1.2.8mX
k=0n+k
k
=n+m+ 1
m
:1.2.9n
0
n
1
++( 1)mn
m
= ( 1)mn 1
m
:
1.2(ii) Finite Series
Arithmetic Progression
1.2.10a+ (a+d) + (a+ 2d) ++ (a+ (n 1)d)
=na+1
2n(n 1)d=1
2n(a+`);
where`= last term of the series = a+ (n 1)d.
Geometric Progression
1.2.11a+ax+ax2++axn 1
=a(1 xn)
1 x, x6= 1.
1.2(iii) Partial Fractions
Let1;2;:::;nbe distinct constants, and f(x) be a
polynomial of degree less than n. Then
1.2.12f(x)
(x 1)(x 2)(x n)
=A1
x 1+A2
x 2++An
x n;
where
1.2.13 Aj=f(j)Q
k6=j(j k):
Also,
1.2.14
f(x)
(x 1)n=B1
x 1+B2
(x 1)2++Bn
(x 1)n;
where
1.2.15 Bj=f(n j)(1)
(n j)!;
andf(k)is thek-th derivative of f(x1.4(iii)).
Ifm1;m2;:::;mnare positive integers and deg f <Pn
j=1mj, then there exist polynomials fj(x), degfj<
mj, such that
1.2.16
f(x)
(x 1)m1(x 2)m2(x n)mn
=f1(x)
(x 1)m1+f2(x)
(x 2)m2++fn(x)
(x n)mn:
To nd the polynomials fj(x),j= 1;2;:::;n , multiply
both sides by the denominator of the left-hand side and
equate coecients. See Chrystal (1959, pp. 151{159).
1.3 Determinants 3
1.2(iv) Means
The arithmetic mean ofnnumbersa1;a2;:::;anis
1.2.17 A=a1+a2++an
n:
The geometric mean Gand harmonic mean Hofn
positive numbers a1;a2;:::;anare given by
1.2.18 G= (a1a2an)1=n;
1.2.191
H=1
n1
a1+1
a2++1
an
:
Ifris a nonzero real number, then the weighted mean
M(r) ofnnonnegative numbers a1;a2;:::;an, andn
positive numbers p1;p2;:::;pnwith
1.2.20 p1+p2++pn= 1;
is dened by
1.2.21M(r) = (p1ar
1+p2ar
2++pnar
n)1=r;
with the exception
1.2.22 M(r) = 0,r<0 anda1a2:::an= 0.
1.2.23 lim
r!1M(r) = max(a1;a2;:::;an);
1.2.24 lim
r! 1M(r) = min(a1;a2;:::;an):
Forpj= 1=n,j= 1;2;:::;n ,
1.2.25 M(1) =A; M ( 1) =H;
and
1.2.26 lim
r!0M(r) =G:
The last two equations require aj>0 for allj.
1.3 Determinants
1.3(i) Denitions and Elementary Properties
1.3.1 det[ajk] =a11a12
a21a22=a11a22 a12a21:
1.3.2
det[ajk]
=a11a12a13
a21a22a23
a31a32a33
=a11a22a23
a32a33 a12a21a23
a31a33+a13a21a22
a31a32
=a11a22a33 a11a23a32 a12a21a33
+a12a23a31+a13a21a32 a13a22a31:
Higher-order determinants are natural generalizations.
The minorMjkof the entry ajkin thenth-order de-
terminant det[ ajk] is the (n 1)th-order determinant
derived from det[ ajk] by deleting the jth row and the
kth column. The cofactorAjkofajkis
1.3.3 Ajk= ( 1)j+kMjk:Annth-order determinant expanded by its jth row is
given by
1.3.4 det[ajk] =nX
`=1aj`Aj`:
If two rows (or columns) of a determinant are inter-
changed, then the determinant changes sign. If two rows
(columns) of a determinant are identical, then the de-
terminant is zero. If all the elements of a row (column)
of a determinant are multiplied by an arbitrary factor
, then the result is a determinant which is times the
original. If times a row (column) of a determinant is
added to another row (column), then the value of the
determinant is unchanged.
1.3.5 det[ajk]T= det[ajk];
1.3.6 det[ajk] 1=1
det[ajk];
1.3.7 det([ajk][bjk]) = (det[ajk])(det[bjk]):
Hadamard's Inequality
For real-valued ajk,
1.3.8a11a12
a21a222
(a2
11+a2
12)(a2
21+a2
22);
1.3.9 det[ajk]2 nX
k=1a2
1k! nX
k=1a2
2k!
::: nX
k=1a2
nk!
:
Compare also (1.3.7) for the left-hand side. Equality
holds i
1.3.10aj1ak1+aj2ak2++ajnakn= 0
for every distinct pair of j;k, or when one of the factorsPn
k=1a2
jkvanishes.
1.3(ii) Special Determinants
Analternant is a determinant function of nvariables
which changes sign when two of the variables are inter-
changed. Examples:
1.3.11 det[fk(xj)], j= 1;:::;n ;k= 1;:::;n ,
1.3.12 det[f(xj;yk)],j= 1;:::;n ;k= 1;:::;n .
Vandermonde Determinant or Vandermondian
1.3.131x1x2
1xn 1
1
1x2x2
2xn 1
2...............
1xnx2
nxn 1
n=Y
1j<kn(xk xj):
4 Algebraic and Analytic Methods
Cauchy Determinant
1.3.14
det1
aj bk
= ( 1)n(n 1)=2
Y
1j<kn(ak aj)(bk bj),nY
j;k=1(aj bk):
Circulant
1.3.15a1a2an
ana1an 1
............
a2a3a1
=nY
k=1(a1+a2!k+a3!2
k++an!n 1
k);
where!1;!2;:::;!nare thenth roots of unity (1.11.21).
Krattenthaler's Formula
For
1.3.16tjk= (xj+an)(xj+an 1)(xj+ak+1)
(xj+bk)(xj+bk 1)(xj+b2);
1.3.17 det[tjk] =Y
1j<kn(xj xk)Y
2jkn(bj ak):
1.3(iii) Innite Determinants
Letaj;kbe dened for all integer values of jandk, and
Dn[aj;k] denote the (2 n+ 1)(2n+ 1) determinant
1.3.18
Dn[aj;k] =a n; na n; n+1::: a n;n
a n+1; na n+1; n+1::: a n+1;n
............
an; nan; n+1::: an;n:
IfDn[aj;k] tends to a limit Lasn!1 , then we say
that the innite determinant D1[aj;k]converges and
D1[aj;k] =L.
Of importance for special functions are innite de-
terminants of Hill's type . These have the property that
the double series
1.3.191X
j;k= 1jaj;k j;kj
converges (x1.9(vii)). Here j;kis the Kronecker delta.
Hill-type determinants always converge.
For further information see Whittaker and Watson
(1927, pp. 36{40) and Magnus and Winkler (1966, x2.3).1.4 Calculus of One Variable
1.4(i) Monotonicity
Iff(x1)f(x2) for every pair x1,x2in an interval
Isuch thatx1< x 2, thenf(x) isnondecreasing onI.
If thesign is replaced by <, thenf(x) is increas-
ing(also called strictly increasing ) onI. Similarly for
nonincreasing anddecreasing (strictly decreasing ) func-
tions. Each of the preceding four cases is classied as
monotonic ; sometimes strictly monotonic is used for the
strictly increasing or strictly decreasing cases.
1.4(ii) Continuity
A function f(x) is continuous on the right (orfrom
above ) atx=cif
1.4.1 f(c+)lim
x!c+f(x) =f(c);
that is, for every arbitrarily small positive constant
there exists (>0) such that
1.4.2jf(c+) f(c)j<;
for allsuch that 0< . Similarly, it is continuous
on the left (orfrom below ) atx=cif
1.4.3 f(c )lim
x!c f(x) =f(c):
Andf(x) is continuous at cwhen both (1.4.1) and
(1.4.3) apply.
Iff(x) is continuous at each point c2(a;b), then
f(x) iscontinuous on the interval (a;b) and we write
f2C(a;b). If alsof(x) is continuous on the right
atx=a, and continuous on the left at x=b, then
f(x) iscontinuous on the interval [a;b], and we write
f(x)2C[a;b].
Aremovable singularity off(x) atx=coccurs when
f(c+) =f(c ) butf(c) is undened. For example,
f(x) = (sinx)=xwithc= 0.
Asimple discontinuity off(x) atx=coccurs when
f(c+) andf(c ) exist, but f(c+)6=f(c ). Iff(x)
is continuous on an interval Isave for a nite number
of simple discontinuities, then f(x) ispiecewise (orsec-
tionally ) continuous on I. For an example, see Figure
1.4.1
Figure 1.4.1 : Piecewise continuous function on [ a;b).
1.4 Calculus of One Variable 5
1.4(iii) Derivatives
The derivativef0(x) off(x) is dened by
1.4.4f0(x) =df
dx= lim
h!0f(x+h) f(x)
h:
When this limit exists fisdierentiable atx.
1.4.5 (f+g)0(x) =f0(x) +g0(x);
1.4.6 (fg)0(x) =f0(x)g(x) +f(x)g0(x);
1.4.7f
g0
(x) =f0(x)g(x) f(x)g0(x)
(g(x))2:
Higher Derivatives
1.4.8 f(2)(x) =d2f
dx2=d
dxdf
dx
;
1.4.9 f(n)=f(n)(x) =d
dxf(n 1)(x):
Iff(n)exists and is continuous on an interval I, then
we writef2Cn(I). Whenn1,fiscontinuously dif-
ferentiable onI. Whennis unbounded, fisinnitely
dierentiable onIand we write f2C1(I).
Chain Rule
Forh(x) =f(g(x)),
1.4.10 h0(x) =f0(g(x))g0(x):
Maxima and Minima
A necessary condition that a dierentiable function f(x)
has a local maximum (minimum ) atx=c, that is,
f(x)f(c), (f(x)f(c)) in a neighborhood c
xc+(>0) ofc, isf0(c) = 0.
Mean Value Theorem
Iff(x) is continuous on [ a;b] and dierentiable on ( a;b),
then there exists a point c2(a;b) such that
1.4.11 f(b) f(a) = (b a)f0(c):
Iff0(x)0 (0) (= 0) for all x2(a;b), thenfis
nondecreasing (nonincreasing) (constant) on ( a;b).
Leibniz's Formula
1.4.12(fg)(n)=f(n)g+n
1
f(n 1)g0+
+n
k
f(n k)g(k)++fg(n):
Fa a Di Bruno's Formula
1.4.13dn
dxnf(g(x))
=Xn!
m1!m2!mn!
f(k)(g(x))
g0(x)
1!m1g00(x)
2!m2
:::g(n)(x)
n!mn
;
where the sum is over all nonnegative integers
m1;m2;:::;mnthat satisfy m1+ 2m2++nmn=n,
andk=m1+m2++mn.L'H^ opital's Rule
If
1.4.14 lim
x!af(x) = lim
x!ag(x) = 0 (or1);
then
1.4.15 lim
x!af(x)
g(x)= lim
x!af0(x)
g0(x);
when the last limit exists.
1.4(iv) Indenite Integrals
IfF0(x) =f(x), thenR
fdx =F(x) +C, whereCis a
constant.
Integration by Parts
1.4.16Z
fgdx =Z
fdx
g ZZ
fdxdg
dxdx:
1.4.17Z
xndx=8
<
:xn+1
n+ 1+C; n6= 1;
lnjxj+C; n = 1:
For the function ln see x4.2(i).
Seexx4.10, 4.26(ii), 4.26(iv), 4.40(ii), and 4.40(iv)
for indenite integrals involving the elementary func-
tions.
For extensive tables of integrals, see Apelblat (1983),
Bierens de Haan (1867), Gradshteyn and Ryzhik (2000),
Gr obner and Hofreiter (1949, 1950), and Prudnikov
et al. (1986a,b, 1990, 1992a,b).
1.4(v) Denite Integrals
Supposef(x) is dened on [ a;b]. Leta=x0< x 1<
< xn=b, andjdenote any point in [ xj;xj+1],
j= 0;1;:::;n 1. Then
1.4.18Zb
af(x)dx= limn 1X
j=0f(j)(xj+1 xj)
as max(xj+1 xj)!0. Continuity, or piecewise conti-
nuity, off(x) on [a;b] is sucient for the limit to exist.
1.4.19Zb
a(cf(x) +dg(x))dx=cZb
af(x)dx+dZb
ag(x)dx;
canddconstants.
1.4.20Zb
af(x)dx= Za
bf(x)dx:
1.4.21Zb
af(x)dx=Zc
af(x)dx+Zb
cf(x)dx:
6 Algebraic and Analytic Methods
Innite Integrals
1.4.22Z1
af(x)dx= lim
b!1Zb
af(x)dx:
Similarly forRa
1. Next, iff(b) =1, then
1.4.23Zb
af(x)dx= lim
c!b Zc
af(x)dx:
Similarly when f(a) =1.
When the limits in (1.4.22) and (1.4.23) exist, the
integrals are said to be convergent . If the limits exist
withf(x) replaced byjf(x)j, then the integrals are ab-
solutely convergent . Absolute convergence also implies
convergence.
Cauchy Principal Values
Letc2(a;b) and assume thatRc
af(x)dxandRb
c+f(x)dxexist when 0 < < min(c a;b c), but
not necessarily when = 0. Then we dene
1.4.24Zb
af(x)dx=PZb
af(x)dx
= lim
!0+ Zc
af(x)dx+Zb
c+f(x)dx!
;
when this limit exists.
Similarly, assume thatRb
bf(x)dxexists for all -
nite values of b(>0), but not necessarily when b=1.
Then we dene
1.4.25Z1
1f(x)dx=PZ1
1f(x)dx= lim
b!1Zb
bf(x)dx;
when this limit exists.
Fundamental Theorem of Calculus
ForF0(x) =f(x) withf(x) continuous,
1.4.26Zb
af(x)dx=F(b) F(a);
1.4.27d
dxZx
af(t)dt=f(x):
Change of Variables
If0(x) is continuous or piecewise continuous, then
1.4.28Zb
af((x))0(x)dx=Z(b)
(a)f(t)dt:
First Mean Value Theorem
Forf(x) continuous and (x)0 and integrable on
[a;b], there exists c2[a;b], such that
1.4.29Zb
af(x)(x)dx=f(c)Zb
a(x)dx:Second Mean Value Theorem
Forf(x) monotonic and (x) integrable on [ a;b], there
existsc2[a;b], such that
1.4.30Zb
af(x)(x)dx=f(a)Zc
a(x)dx+f(b)Zb
c(x)dx:
Repeated Integrals
Iff(x) is continuous or piecewise continuous on [ a;b],
then
1.4.31Zb
adxnZxn
adxn 1Zx2
adx1Zx1
af(x)dx
=1
n!Zb
a(b x)nf(x)dx:
Square-Integrable Functions
A function f(x) issquare-integrable if
1.4.32kfk2
2Zb
ajf(x)j2dx<1:
Functions of Bounded Variation
Witha < b , the total variation off(x) on a nite or
innite interval ( a;b) is
1.4.33Va;b(f) = supnX
j=1jf(xj) f(xj 1)j;
where the supremum is over all sets of points x0<
x1<< xnin the closure of (a;b), that is, ( a;b)
witha;badded when they are nite. If Va;b(f)<1,
thenf(x) is of bounded variation on (a;b). In this case,
g(x) =Va;x(f) andh(x) =Va;x(f) f(x) are nonde-
creasing bounded functions and f(x) =g(x) h(x).
Iff(x) is continuous on the closure of ( a;b) andf0(x)
is continuous on ( a;b), then
1.4.34Va;b(f) =Zb
ajf0(x)dxj;
whenever this integral exists.
Lastly, whether or not the real numbers aandbsat-
isfya<b , and whether or not they are nite, we dene
Va;b(f) by (1.4.34) whenever this integral exists. This
denition also applies when f(x) is a complex function
of the real variable x. For further information on total
variation see Olver (1997b, pp. 27{29).
1.4(vi) Taylor's Theorem for Real Variables
Iff(x)2Cn+1[a;b], then
1.4.35f(x) =nX
k=0f(k)(a)
k!(x a)k+Rn;
1.4.36 Rn=f(n+1)(c)
(n+ 1)!(x a)n+1,a<c<x ,
and
1.4.37 Rn=1
n!Zx
a(x t)nf(n+1)(t)dt:
1.5 Calculus of Two or More Variables 7
1.4(vii) Maxima and Minima
Iff(x) is twice-dierentiable, and if also f0(x0) = 0 and
f00(x0)<0 (>0), thenx=x0is a local maximum
(minimum) (x1.4(iii)) of f(x). The overall maximum
(minimum) of f(x) on [a;b] will either be at a local
maximum (minimum) or at one of the end points aor
b.
1.4(viii) Convex Functions
A function f(x) isconvex on (a;b) if
1.4.38f((1 t)c+td)(1 t)f(c) +tf(d)
for anyc;d2(a;b), andt2[0;1]. See Figure 1.4.2. A
similar denition applies to closed intervals [ a;b].
Iff(x) is twice dierentiable, then f(x) is convex i
f00(x)0 on (a;b). A continuously dierentiable func-
tion is convex i the curve does not lie below its tangent
at any point.
Figure 1.4.2 : Convex function f(x).g(t) =f((1 t)c+
td),l(t) = (1 t)f(c) +tf(d),c;d2(a;b), 0t1.
1.5 Calculus of Two or More Variables
1.5(i) Partial Derivatives
A function f(x;y) iscontinuous at a point (a;b) if
1.5.1 lim
(x;y)!(a;b)f(x;y) =f(a;b);
that is, for every arbitrarily small positive constant
there exists (>0) such that
1.5.2jf(a+;b+) f(a;b)j<;
for allandthat satisfyjj;jj<.
A function is continuous on a point set Dif it is
continuous at all points of D. A function f(x;y) is
piecewise continuous onI1I2, whereI1andI2are in-
tervals, if it is piecewise continuous in xfor eachy2I2
and piecewise continuous in yfor eachx2I1.
1.5.3@f
@x=Dxf=fx= lim
h!0f(x+h;y) f(x;y)
h;
1.5.4@f
@y=Dyf=fy= lim
h!0f(x;y+h) f(x;y)
h:1.5.5@2f
@x@y=@
@x@f
@y
;@2f
@y@x=@
@y@f
@x
:
The function f(x;y) is continuously dierentiable if
f,@f/@x, and@f/@yare continuous, and twice-
continuously dierentiable if also@2f
@x2,@2f
@y2,
@2f=@x@y , and@2f=@y@x are continuous. In the lat-
ter event
1.5.6@2f
@x@y=@2f
@y@x:
Chain Rule
1.5.7d
dtf(x(t);y(t)) =@f
@xdx
dt+@f
@ydy
dt;
1.5.8@
@uf(x(u;v);y(u;v)) =@f
@x@x
@u+@f
@y@y
@u;
1.5.9@
@vf(x(u;v);y(u;v);z(u;v))
=@f
@x@x
@v+@f
@y@y
@v+@f
@z@z
@v:
Implicit Function Theorem
IfF(x;y) is continuously dierentiable, F(a;b) = 0,
and@F/@y6= 0 at (a;b), then in a neighborhood of
(a;b), that is, an open disk centered at a;b, the equa-
tionF(x;y) = 0 denes a continuously dierentiable
functiony=g(x) such that F(x;g(x)) = 0,b=g(a),
andg0(x) = Fx=Fy.
1.5(ii) Coordinate Systems
Polar Coordinates
With 0r<1, 02,
1.5.10 x=rcos; y =rsin;
1.5.11@
@x= cos@
@r sin
r@
@;
1.5.12@
@y= sin@
@r+cos
r@
@:
The Laplacian is given by
1.5.13r2f=@2f
@x2+@2f
@y2=@2f
@r2+1
r@f
@r+1
r2@2f
@2:
Cylindrical Coordinates
With 0r<1, 02, 1<z<1,
1.5.14x=rcos; y =rsin; z =z:
Equations (1.5.11) and (1.5.12) still apply, but
1.5.15
r2f=@2f
@x2+@2f
@y2+@2f
@z2=@2f
@r2+1
r@f
@r+1
r2@2f
@2+@2f
@z2:
8 Algebraic and Analytic Methods
Spherical Coordinates
With 0<1, 02, 0,
1.5.16x=sincos; y =sinsin; z =cos:
The Laplacian is given by
1.5.17r2f=@2f
@x2+@2f
@y2+@2f
@z2
=1
2@
@
2@f
@
+1
2sin2@2f
@2
+1
2sin@
@
sin@f
@
:
For applications and other coordinate systems see
xx12.17, 14.19(i), 14.30(iv), 28.32, 29.18, 30.13, 30.14.
See also Morse and Feshbach (1953a, pp. 655-666).
1.5(iii) Taylor's Theorem; Maxima and Minima
Iffisn+ 1 times continuously dierentiable, then
1.5.18f(a+;b+) =f+
@
@x+@
@y
f+
+1
n!
@
@x+@
@yn
f+Rn;
wherefand its partial derivatives on the right-hand
side are evaluated at ( a;b), andRn=(2+2)n=2!0
as (;)!(0;0).
f(x;y) has a local minimum (maximum ) at (a;b) if
1.5.19@f
@x=@f
@y= 0 at (a;b),
and the second-order term in (1.5.18) is positive denite
(negative denite) , that is,
1.5.20@2f
@x2>0 (<0) at (a;b),
and
1.5.21@2f
@x2@2f
@y2 @2f
@x@y2
>0 at (a;b):
1.5(iv) Leibniz's Theorem for Dierentiation of
Integrals
Finite Integrals
1.5.22
d
dxZ(x)
(x)f(x;y)dy=f(x;(x))0(x) f(x;(x))0(x)
+Z(x)
(x)@f
@xdy:
Sucient conditions for validity are: (a) fand@f/@x
are continuous on a rectangle axb,cyd;
(b) whenx2[a;b] both(x) and(x) are continuously
dierentiable and lie in [ c;d].Innite Integrals
Suppose that a;b;c are nite,dis nite or +1, and
f(x;y),@f/@xare continuous on the partly-closed rect-
angle or innite strip [ a;b][c;d). Suppose also thatRd
cf(x;y)dyconverges andRd
c(@f/@x)dyconverges
uniformly onaxb, that is, given any positive num-
ber, however small, we can nd a number c02[c;d)
that is independent of xand is such that
1.5.23Zd
c1(@f/@x)dy<;
for allc12[c0;d) and allx2[a;b]. Then
1.5.24d
dxZd
cf(x;y)dy=Zd
c@f
@xdy,a<x<b .
1.5(v) Multiple Integrals
Double Integrals
Letf(x;y) be dened on a closed rectangle R= [a;b]
[c;d]. For
1.5.25 a=x0<x1<<xn=b;
1.5.26 c=y0<y1<<ym=d;
let (j;k) denote any point in the rectangle [ xj;xj+1]
[yk;yk+1],j= 0;:::;n 1,k= 0;:::;m 1. Then the
double integral off(x;y) overRis dened by
1.5.27ZZ
Rf(x;y)dA
= limX
j;kf(j;k)(xj+1 xj)(yk+1 yk)
as max((xj+1 xj)+(yk+1 yk))!0. Sucient condi-
tions for the limit to exist are that f(x;y) is continuous,
or piecewise continuous, on R.
Forf(x;y) dened on a point set Dcontained in a
rectangleR, let
1.5.28f(x;y) =(
f(x;y);if (x;y)2D;
0; if (x;y)2RnD.
Then
1.5.29ZZ
Df(x;y)dA=ZZ
Rf(x;y)dA;
provided the latter integral exists.
Iff(x;y) is continuous, and Dis the set
1.5.30 axb; 1(x)y2(x);
with1(x) and2(x) continuous, then
1.5.31ZZ
Df(x;y)dA=Zb
aZ2(x)
1(x)f(x;y)dydx;
where the right-hand side is interpreted as the repeated
integral
1.5.32Zb
a Z2(x)
1(x)f(x;y)dy!
dx:
1.6 Vectors and Vector-Valued Functions 9
In particular, 1(x) and2(x) can be constants.
Similarly, if Dis the set
1.5.33 cyd; 1(y)x 2(y);
with 1(y) and 2(y) continuous, then
1.5.34ZZ
Df(x;y)dA=Zd
cZ 2(y)
1(y)f(x;y)dxdy:
Change of Order of Integration
IfDcan be represented in both forms (1.5.30) and
(1.5.33), and f(x;y) is continuous on D, then
1.5.35Zb
aZ2(x)
1(x)f(x;y)dydx =Zd
cZ 2(y)
1(y)f(x;y)dxdy:
Innite Double Integrals
Innite double integrals occur when f(x;y) becomes in-
nite at points in Dor whenDis unbounded. In the
cases (1.5.30) and (1.5.33) they are dened by taking
limits in the repeated integrals (1.5.32) and (1.5.34) in
an analogous manner to (1.4.22){(1.4.23).
Moreover, if a;b;c;d are nite or innite constants
andf(x;y) is piecewise continuous on the set ( a;b)
(c;d), then
1.5.36Zb
aZd
cf(x;y)dydx =Zd
cZb
af(x;y)dxdy;
whenever both repeated integrals exist and at least one
is absolutely convergent.
Triple Integrals
Finite and innite integrals can be dened in a similar
way. Often the ( x;y;z ) sets are of the form
1.5.37axb; 1(x)y2(x);
1(x;y)z 2(x;y):
1.5(vi) Jacobians and Change of Variables
Jacobian
1.5.38@(f;g)
@(x;y)=@f/@x @f /@y
@g/@x @g /@y;
1.5.39@(x;y)
@(r;)=r(polar coordinates) :
1.5.40@(f;g;h )
@(x;y;z )=@f/@x @f /@y @f /@z
@g/@x @g /@y @g /@z
@h/@x @h /@y @h /@z;
1.5.41@(x;y;z )
@(;; )=2sin(spherical coordinates) :Change of Variables
1.5.42ZZ
Df(x;y)dxdy
=ZZ
Df(x(u;v);y(u;v))@(x;y)
@(u;v)dudv;
whereDis the image of Dunder a mapping ( u;v)!
(x(u;v);y(u;v)) which is one-to-one except perhaps for
a set of points of area zero.
1.5.43ZZZ
Df(x;y;z )dxdydz
=ZZZ
Df(x(u;v;w );y(u;v;w );z(u;v;w ))
@(x;y;z )
@(u;v;w )dudvdw:
Again the mapping is one-to-one except perhaps for a
set of points of volume zero.
1.6 Vectors and Vector-Valued Functions
1.6(i) Vectors
1.6.1 a= (a1;a2;a3);b= (b1;b2;b3):
Dot Product (or Scalar Product)
1.6.2 ab=a1b1+a2b2+a3b3:
Magnitude and Angle of Vector a
1.6.3 kak=paa;
1.6.4 cos=ab
kakkbk;
is the angle between aandb.
Unit Vectors
1.6.5 i= (1;0;0);j= (0;1;0);k= (0;0;1);
1.6.6 a=a1i+a2j+a3k:
Cross Product (or Vector Product)
1.6.7 ij=k;jk=i;ki=j;
1.6.8 ji= k;kj= i;ik= j:
1.6.9
ab=i j k
a1a2a3
b1b2b3
= (a2b3 a3b2)i+ (a3b1 a1b3)j+ (a1b2 a2b1)k
=kakkbk(sin)n;
where nis the unit vector normal to aandbwhose
direction is determined by the right-hand rule; see Fig-
ure 1.6.1.
10 Algebraic and Analytic Methods
Figure 1.6.1 : Vector notation. Right-hand rule for cross
products.
Area of parallelogram with vectors aandbas sides
=kabk.
Volume of a parallelepiped with vectors a,b, and c
as edges =ja(bc)j.
1.6.10 a(bc) =b(ac) c(ab);
1.6.11 (ab)c=b(ac) a(bc):
1.6(ii) Vectors: Alternative Notations
The following notations are often used in the physics
literature; see for example Lorentz et al. (1923, pp. 122{
123).
Einstein Summation Convention
Much vector algebra involves summation over suces of
products of vector components. In almost all cases of
repeated suces, we can suppress the summation no-
tation entirely, if it is understood that an implicit sum
is to be taken over any repeated sux. Thus pairs of
indenite suces in an expression are resolved by being
summed over (or \traced" over).
Example
1.6.12 ajbj=3X
j=1ajbj=ab:
Next,
1.6.13e1= (1;0;0);e2= (0;1;0);e3= (0;0;1);
compare (1.6.5). Thus ajej=a.
Levi-Civita Symbol
1.6.14
jk`=8
><
>:+1;ifj;k;` is even permutation of 1 ;2;3;
1;ifj;k;` is odd permutation of 1 ;2;3;
0;otherwise:Examples
1.6.15123=312= 1; 213=321= 1; 221= 0:
1.6.16 jk``mn=j;mk;n j;nk;m;
wherej;kis the Kronecker delta.
1.6.17 ejek=jk`e`;
compare (1.6.8).
1.6.18 ajejbkek=jk`ajbke`;
compare (1.6.7){(1.6.8).
Lastly, the volume of a parallelepiped with vectors
a,b, and cas edges isjjk`ajbkc`j.
1.6(iii) Vector-Valued Functions
Del Operator
1.6.19r=i@
@x+j@
@y+k@
@z:
The gradient of a dierentiable scalar function
f(x;y;z ) is
1.6.20 gradf=rf=@f
@xi+@f
@yj+@f
@zk:
The divergence of a dierentiable vector-valued func-
tionF=F1i+F2j+F3kis
1.6.21 divF=rF=@F1
@x+@F2
@y+@F3
@z:
The curl ofFis
1.6.22curlF=rF=i j k
@
@x@
@y@
@z
F1F2F3
=@F3
@y @F2
@z
i+@F1
@z @F3
@x
j
+@F2
@x @F1
@y
k:
1.6.23r(fg) =frg+grf;
1.6.24r(f=g) = (grf frg)=g2;
1.6.25r(fF) =f(rF) +Frf;
1.6.26r(FG) =G(rF) F(rG);
1.6.27r(rF) = div curl F= 0;
1.6.28r(fF) =f(rF) + (rf)F;
1.6.29r(rf) = curl grad f= 0;
1.6.30 r2f=r(rf);
1.6.31r2(fg) =fr2g+gr2f+ 2(rfrg);
1.6.32 r(rfrg) = 0;
1.6.33r(frg grf) =fr2g gr2f;
1.6.34r(rF) = curl curl F=r(rF) r2F:
1.6 Vectors and Vector-Valued Functions 11
1.6(iv) Path and Line Integrals
Note: The terminology open andclosed sets andbound-
ary points in the (x;y) plane that is used in this sub-
section andx1.6(v) is analogous to that introduced for
the complex plane in x1.9(ii).
c(t) = (x(t);y(t);z(t)), withtranging over an inter-
val andx(t);y(t);z(t) dierentiable, denes a path.
1.6.35 c0(t) = (x0(t);y0(t);z0(t)):
The length of a path for atbis
1.6.36Zb
akc0(t)kdt:
The path integral of a continuous function f(x;y;z ) is
1.6.37Z
cfds=Zb
af(x(t);y(t);z(t))kc0(t)kdt:
The line integral of a vector-valued function F=F1i+
F2j+F3kalong cis given by
1.6.38Z
cFds=Zb
aF(c(t))c0(t)dt
=Zb
a
F1dx
dt+F2dy
dt+F3dz
dt
dt
=Z
cF1dx+F2dy+F3dz:
A path c1(t),t2[a;b], is a reparametrization ofc(t0),
t02[a0;b0], ifc1(t) =c(t0) andt0=h(t) withh(t) dier-
entiable and monotonic. If h(a) =a0andh(b) =b0, then
the reparametrization is called orientation-preserving ,
and
1.6.39Z
cFds=Z
c1Fds:
Ifh(a) =b0andh(b) =a0, then the reparametrization
isorientation-reversing and
1.6.40Z
cFds= Z
c1Fds:
In either case
1.6.41Z
cfds=Z
c1fds;
whenfis continuous, and
1.6.42Z
crfds=f(c(b)) f(c(a));
whenfis continuously dierentiable.
The geometrical image Cof a path cis called a sim-
ple closed curve ifcis one-to-one, with the exception
c(a) =c(b). The curve Cispiecewise dierentiable ifc
is piecewise dierentiable. Note that Ccan be given an
orientation by means of c.Green's Theorem
Let
1.6.43 F(x;y) =F1(x;y)i+F2(x;y)j
andSbe the closed and bounded point set in the ( x;y)
plane having a simple closed curve Cas boundary. If C
is oriented in the positive (anticlockwise) sense, then
1.6.44ZZ
S@F2
@x @F1
@y
dA=Z
CFds=Z
CF1dx+F2dy:
Sucient conditions for this result to hold are that
F1(x;y) andF2(x;y) are continuously dierentiable on
S, andCis piecewise dierentiable.
The area of Scan be found from (1.6.44) by taking
F(x;y) = yi,xj, or 1
2yi+1
2xj.
1.6(v) Surfaces and Integrals over Surfaces
Aparametrized surface Sis dened by
1.6.45 (u;v) = (x(u;v);y(u;v);z(u;v))
with (u;v)2D, an open set in the plane.
Forx,y, andzcontinuously dierentiable, the vec-
tors
1.6.46 Tu=@x
@u(u0;v0)i+@y
@u(u0;v0)j+@z
@u(u0;v0)k
and
1.6.47 Tv=@x
@v(u0;v0)i+@y
@v(u0;v0)j+@z
@v(u0;v0)k
are tangent to the surface at (u0;v0). The surface is
smooth at this point if TuTv6= 0. A surface is smooth
if it is smooth at every point. The vector TuTvat
(u0;v0) is normal to the surface at (u0;v0).
The areaA(S) of a parametrized smooth surface is
given by
1.6.48 A(S) =ZZ
DkTuTvkdudv;
and
1.6.49kTuTvk
=s@(x;y)
@(u;v)2
+@(y;z)
@(u;v)2
+@(x;z)
@(u;v)2
:
The area is independent of the parametrizations.
For a sphere x=sincos,y=sinsin,
z=cos,
1.6.50kTTk=2jsinj:
For a surface z=f(x;y),
1.6.51A(S) =ZZ
Ds
1 +@f
@x2
+@f
@y2
dA:
12 Algebraic and Analytic Methods
For a surface of revolution, y=f(x),x2[a;b],
about thex-axis,
1.6.52A(S) = 2Zb
ajf(x)jp
1 + (f0(x))2dx;
and about the y-axis,
1.6.53A(S) = 2Zb
ajxjp
1 + (f0(x))2dx:
The integral of a continuous function f(x;y;z ) over
a surfaceSis
1.6.54ZZ
Sf(x;y;z )dS=ZZ
Df((u;v))kTuTvkdudv:
For a vector-valued function F,
1.6.55ZZ
SFdS=ZZ
DF(TuTv)dudv;
wheredSis the surface element with an attached nor-
mal direction TuTv.
A surface is orientable if a continuously varying nor-
mal can be dened at all points of the surface. An
orientable surface is oriented if suitable normals have
been chosen. A parametrization (u;v) of an oriented
surfaceSisorientation preserving ifTuTvhas the
same direction as the chosen normal at each point of S,
otherwise it is orientation reversing .
If1and2are both orientation preserving or both
orientation reversing parametrizations of Sdened on
open setsD1andD2respectively, then
1.6.56ZZ
1(D1)FdS=ZZ
2(D2)FdS;
otherwise, one is the negative of the other.
Stokes's Theorem
SupposeSis an oriented surface with boundary @S
which is oriented so that its direction is clockwise rela-
tive to the normals of S. Then
1.6.57ZZ
S(rF)dS=Z
@SFds;
when Fis a continuously dierentiable vector-valued
function.
Gauss's (or Divergence) Theorem
SupposeSis a piecewise smooth surface which forms
the complete boundary of a bounded closed point set
V, andSis oriented by its normal being outwards from
V. Then
1.6.58ZZZ
V(rF)dV=ZZ
SFdS;
when Fis a continuously dierentiable vector-valued
function.Green's Theorem (for Volume)
Forfandgtwice-continuously dierentiable functions
1.6.59ZZZ
V(fr2g+rfrg)dV=ZZ
Sf@g
@ndA;
and
1.6.60ZZZ
V(fr2g gr2f)dV=ZZ
S
f@g
@n g@f
@n
dA;
where@g/@n=rgnis the derivative of gnormal to
the surface outwards from Vandnis the unit outer
normal vector.
1.7 Inequalities
1.7(i) Finite Sums
In this subsection AandBare positive constants.
Cauchy{Schwarz Inequality
1.7.10
@nX
j=1ajbj1
A2
0
@nX
j=1a2
j1
A0
@nX
j=1b2
j1
A:
Equality holds i aj=cbj,8j;c= constant.
Conversely, ifPn
j=1ajbj2
ABfor allbjsuch
thatPn
j=1b2
jB, thenPn
j=1a2
jA.
H older's Inequality
Forp>1,1
p+1
q= 1,aj0,bj0,
1.7.2nX
j=1ajbj0
@nX
j=1ap
j1
A1=p0
@nX
j=1bq
j1
A1=q
:
Equality holds i ap
j=cbq
j,8j;c= constant.
Conversely, ifPn
j=1ajbjA1=pB1=qfor allbjsuch
thatPn
j=1bq
jB, thenPn
j=1ap
jA.
Minkowski's Inequality
Forp>1,aj0,bj0,
1.7.30
@nX
j=1(aj+bj)p1
A1=p
0
@nX
j=1ap
j1
A1=p
+0
@nX
j=1bp
j1
A1=p
:
The direction of the inequality is reversed, that is, ,
when 0< p < 1. Equality holds i aj=cbj,8j;
c= constant.
1.7(ii) Integrals
In this subsection aandb(>a) are real constants that
can be1, provided that the corresponding integrals
converge. Also AandBare constants that are not si-
multaneously zero.
1.8 Fourier Series 13
Cauchy{Schwarz Inequality
1.7.4 Zb
af(x)g(x)dx!2
Zb
a(f(x))2dxZb
a(g(x))2dx:
Equality holds i Af(x) =Bg(x) for allx.
H older's Inequality
Forp>1,1
p+1
q= 1,f(x)0,g(x)0,
1.7.5Zb
af(x)g(x)dx
Zb
a(f(x))pdx!1=p Zb
a(g(x))qdx!1=q
:
Equality holds i A(f(x))p=B(g(x))qfor allx.
Minkowski's Inequality
Forp>1,f(x)0,g(x)0,
1.7.6 Zb
a(f(x) +g(x))pdx!1=p
Zb
a(f(x))pdx!1=p
+ Zb
a(g(x))pdx!1=p
:
The direction of the inequality is reversed, that is, ,
when 0<p< 1. Equality holds i Af(x) =Bg(x) for
allx.
1.7(iii) Means
For the notation, see x1.2(iv).
1.7.7 HGA;
with equality i a1=a2==an.
1.7.8 min(a1;a2;:::;an)M(r)max(a1;a2;:::;an);
with equality i a1=a2==an, orr<0 and some
aj= 0.
1.7.9 M(r)M(s), r<s;
with equality i a1=a2==an, ors0 and some
aj= 0.
1.7(iv) Jensen's Inequality
Forfintegrable on [0 ;1],a < f (x)< b, andconvex
on (a;b) (x1.4(viii)),
1.7.10Z1
0f(x)dx
Z1
0(f(x))dx;
1.7.11 expZ1
0ln(f(x))dx
<Z1
0f(x)dx:
For exp and ln see x4.2.1.8 Fourier Series
1.8(i) Denitions and Elementary Properties
Formally,
1.8.1f(x) =1
2a0+1X
n=1(ancos(nx) +bnsin(nx));
1.8.2an=1
Z
f(x) cos(nx)dx,n= 0;1;2;:::,
bn=1
Z
f(x) sin(nx)dx,n= 1;2;:::.
The series (1.8.1) is called the Fourier series off(x),
andan;bnare the Fourier coecients off(x).
Iff( x) =f(x), thenbn= 0 for alln.
Iff( x) = f(x), thenan= 0 for alln.
Alternative Form
1.8.3 f(x) =1X
n= 1cneinx;
1.8.4 cn=1
2Z
f(x)e inxdx:
Bessel's Inequality
1.8.51
2a2
0+1X
n=1(a2
n+b2
n)1
Z
(f(x))2dx:
1.8.61X
n= 1jcnj21
2Z
jf(x)j2dx:
Asymptotic Estimates of Coecients
Iff(x) is of period 2 , andf(m)(x) is piecewise contin-
uous, then
1.8.7 an;bn;cn=o
n m
,n!1 .
Uniqueness of Fourier Series
Iff(x) andg(x) are continuous, have the same period
and same Fourier coecients, then f(x) =g(x) for all
x.
Lebesgue Constants
1.8.8 Ln=1
Z
0sin
n+1
2
t
sin 1
2tdt,n= 0;1;:::.
Asn!1
1.8.9 Ln(4=2) lnn;
see Frenzen and Wong (1986).
14 Algebraic and Analytic Methods
Riemann{Lebesgue Lemma
Forf(x) piecewise continuous on [ a;b] and real,
1.8.10Zb
af(x)eixdx!0, as !1 .
(1.8.10) continues to apply if either aorbor both are
innite and/or f(x) has nitely many singularities in
(a;b), provided that the integral converges uniformly
(x1.5(iv)) ata;b, and the singularities for all suciently
large.
1.8(ii) Convergence
Letf(x) be an absolutely integrable function of period
2, and continuous except at a nite number of points in
any bounded interval. Then the series (1.8.1) converges
to the sum
1.8.111
2f(x ) +1
2f(x+)
at every point at which f(x) has both a left-hand deriva-
tive (that is, (1.4.4) applies when h!0 ) and a right-
hand derivative (that is, (1.4.4) applies when h!0+).
The convergence is non-uniform, however, at points
wheref(x )6=f(x+); seex6.16(i).
For other tests for convergence see Titchmarsh
(1962, pp. 405{410).
1.8(iii) Integration and Dierentiation
Ifanandbnare the Fourier coecients of a piecewise
continuous function f(x) on [0;2], then
1.8.12Zx
0(f(t) 1
2a0)dt=1X
n=1ansin(nx) +bn(1 cos(nx))
n,
0x2.
If a function f(x)2C2[0;2] is periodic, with pe-
riod 2, then the series obtained by dierentiating the
Fourier series for f(x) term by term converges at every
point tof0(x).
1.8(iv) Transformations
Parseval's Formula
1.8.131
Z
f(x)g(x)dx=1
2a0a0
0+1X
n=1(ana0
n+bnb0
n);
whenf(x) andg(x) are square-integrable and an;bnand
a0
n;b0
nare their respective Fourier coecients.Poisson's Summation Formula
Suppose that f(x) is twice continuously dierentiable
andf(x) andjf00(x)jare integrable over ( 1;1).
Then
1.8.14
1X
n= 1f(x+n) =1X
n= 1e2inxZ1
1f(t)e 2intdt:
An alternative formulation is as follows. Suppose
thatf(x) is continuous and of bounded variation on
[0;1). Suppose also that f(x) is integrable on [0 ;1)
andf(x)!0 asx!1 . Then
1.8.15
1
2f(0) +1X
n=1f(n) =Z1
0f(x)dx
+ 21X
n=1Z1
0f(x) cos(2nx)dx:
As a special case
1.8.161X
n= 1e (n+x)2!
=r
!
1 + 21X
n=1e n22=!cos(2nx)!
,
<!>0.
1.8(v) Examples
For collections of Fourier-series expansions see Prud-
nikov et al. (1986a, v. 1, pp. 725{740), Gradshteyn and
Ryzhik (2000, pp. 45{49), and Oberhettinger (1973).
1.9 Calculus of a Complex Variable
1.9(i) Complex Numbers
1.9.1 z=x+iy, x;y2R:
Real and Imaginary Parts
1.9.2 <z=x;=z=y:
Polar Representation
1.9.3 x=rcos; y =rsin;
where
1.9.4 r= (x2+y2)1=2;
and whenz6= 0,
1.9.5=!; !; +!;or !;
according as zlies in the 1st, 2nd, 3rd, or 4th quadrants.
Here
1.9.6 != arctan(jy=xj)2
0;1
2
:
1.9 Calculus of a Complex Variable 15
Modulus and Phase
1.9.7jzj=r;phz=+ 2n,n2Z.
The principal value of phzcorresponds to n= 0, that
is, phz. It is single-valued on Cnf0g, except
on the interval ( 1;0) where it is discontinuous and
two-valued. Unless indicated otherwise , these principal
values are assumed throughout this Handbook. (How-
ever, if we require a principal value to be single-valued,
then we can restrict <phz.)
1.9.8j<zjjzj;j=zjjzj;
1.9.9 z=rei;
where
1.9.10 ei= cos+isin;
seex4.14.
Complex Conjugate
1.9.11 z=x iy;
1.9.12 jzj=jzj;
1.9.13 phz= phz:
Arithmetic Operations
Ifz1=x1+iy1,z2=x2+iy2, then
1.9.14 z1z2=x1x2+i(y1y2);
1.9.15z1z2=x1x2 y1y2+i(x1y2+x2y1);
1.9.16z1
z2=z1z2
jz2j2=x1x2+y1y2+i(x2y1 x1y2)
x2
2+y2
2;
provided that z26= 0. Also,
1.9.17 jz1z2j=jz1jjz2j;
1.9.18 ph(z1z2) = phz1+ phz2;
1.9.19z1
z2=jz1j
jz2j;
1.9.20 phz1
z2= phz1 phz2:
Equations (1.9.18) and (1.9.20) hold for general values
of the phases, but not necessarily for the principal val-
ues.
Powers
1.9.21zn=
xn n
2
xn 2y2+n
4
xn 4y4
+in
1
xn 1y n
3
xn 3y3+
,
n= 1;2;:::.
DeMoivre's Theorem
1.9.22 cosn+isinn= (cos+isin)n,n2Z.Triangle Inequality
1.9.23jjz1j jz2jjjz1+z2jjz1j+jz2j:
1.9(ii) Continuity, Point Sets, and
Dierentiation
Continuity
A function f(z) is continuous at a point z0if
lim
z!z0f(z) =f(z0). That is, given any positive num-
ber, however small, we can nd a positive number
such thatjf(z) f(z0)j< for allzin the open disk
jz z0j<.
A function of two complex variables f(z;w) iscon-
tinuous at (z0;w0) if lim
(z;w)!(z0;w0)f(z;w) =f(z0;w0);
compare (1.5.1) and (1.5.2).
Point Sets in C
Aneighborhood of a point z0is a diskjz z0j<. An
open set inCis one in which each point has a neighbor-
hood that is contained in the set.
A pointz0is a limit point (limiting point oraccu-
mulation point ) of a set of points SinC(orC[1)
if every neighborhood of z0contains a point of Sdis-
tinct from z0. (z0may or may not belong to S.) As
a consequence, every neighborhood of a limit point of
Scontains an innite number of points of S. Also, the
union ofSand its limit points is the closure ofS.
AdomainD, say, is an open set in Cthat is con-
nected , that is, any two points can be joined by a polyg-
onal arc (a nite chain of straight-line segments) lying
in the set. Any point whose neighborhoods always con-
tain members and nonmembers of Dis aboundary point
ofD. When its boundary points are added the domain
is said to be closed , but unless specied otherwise a do-
main is assumed to be open.
Aregion is an open domain together with none,
some, or all of its boundary points. Points of a region
that are not boundary points are called interior points .
A function f(z) iscontinuous on a region Rif for
each pointz0inRand any given number (>0) we can
nd a neighborhood of z0such thatjf(z) f(z0)j<
for all points zin the intersection of the neighborhood
withR.
Dierentiation
A function f(z) isdierentiable at a pointzif the fol-
lowing limit exists:
1.9.24f0(z) =df
dz= lim
h!0f(z+h) f(z)
h:
Dierentiability automatically implies continuity.
16 Algebraic and Analytic Methods
Cauchy{Riemann Equations
Iff0(z) exists atz=x+iyandf(z) =u(x;y)+iv(x;y),
then
1.9.25@u
@x=@v
@y;@u
@y= @v
@x
at (x;y).
Conversely, if at a given point ( x;y) the partial
derivatives @u/@x,@u/@y,@v/@x, and@v/@yexist,
are continuous, and satisfy (1.9.25), then f(z) is dier-
entiable at z=x+iy.
Analyticity
A function f(z) is said to be analytic (holomorphic ) at
z=z0if it is dierentiable in a neighborhood of z0.
A function f(z) isanalytic in a domain Dif it is an-
alytic at each point of D. A function analytic at every
point of Cis said to be entire .
Iff(z) is analytic in an open domain D, then each
of its derivatives f0(z),f00(z),:::exists and is analytic
inD.
Harmonic Functions
Iff(z) =u(x;y)+iv(x;y) is analytic in an open domain
D, thenuandvareharmonic inD, that is,
1.9.26@2u
@x2+@2u
@y2=@2v
@x2+@2v
@y2= 0;
or in polar form ((1.9.3)) uandvsatisfy
1.9.27@2u
@r2+1
r@u
@r+1
r2@2u
@2= 0
at all points of D.
1.9(iii) Integration
AnarcCis given by z(t) =x(t) +iy(t),atb,
wherexandyare continuously dierentiable. If x(t)
andy(t) are continuous and x0(t) andy0(t) are piece-
wise continuous, then z(t) denes a contour .
A contour is simple if it contains no multiple points,
that is, for every pair of distinct values t1;t2oft,
z(t1)6=z(t2). A simple closed contour is a simple con-
tour, except that z(a) =z(b).
Next,
1.9.28Z
Cf(z)dz=Zb
af(z(t))(x0(t) +iy0(t))dt;
for a contour Candf(z(t)) continuous, atb. If
f(z(t0)) =1,at0b, then the integral is dened
analogously to the innite integrals in x1.4(v). Similarly
whena= 1 orb= +1.
Jordan Curve Theorem
Any simple closed contour Cdivides Cinto two open do-
mains that have Cas common boundary. One of these
domains is bounded and is called the interior domain
ofC; the other is unbounded and is called the exterior
domain of C.Cauchy's Theorem
Iff(z) is continuous within and on a simple closed con-
tourCand analytic within C, then
1.9.29Z
Cf(z)dz= 0:
Cauchy's Integral Formula
Iff(z) is continuous within and on a simple closed con-
tourCand analytic within C, and ifz0is a point within
C, then
1.9.30 f(z0) =1
2iZ
Cf(z)
z z0dz;
and
1.9.31
f(n)(z0) =n!
2iZ
Cf(z)
(z z0)n+1dz,n= 1;2;3;:::,
provided that in both cases Cis described in the posi-
tive rotational (anticlockwise) sense.
Liouville's Theorem
Any bounded entire function is a constant.
Winding Number
IfCis a closed contour, and z062C, then
1.9.321
2iZ
C1
z z0dz=N(C;z0);
whereN(C;z0) is an integer called the winding num-
ber ofCwith respect to z0. IfCis simple and oriented
in the positive rotational sense, then N(C;z0) is 1 or 0
depending whether z0is inside or outside C.
Mean Value Property
Foru(z) harmonic,
1.9.33 u(z) =1
2Z2
0u(z+rei)d:
Poisson Integral
Ifh(w) is continuous on jwj=R, then with z=rei
1.9.34u(rei) =1
2Z2
0(R2 r2)h(Rei)d
R2 2Rrcos( ) +r2
is harmonic injzj<R. Also withjwj=R, lim
z!wu(z) =
h(w) asz!wwithinjzj<R.
1.9(iv) Conformal Mapping
The extended complex plane ,C[f1g , consists of the
points of the complex plane Ctogether with an ideal
point1called the point at innity . A system of open
disks around innity is given by
1.9.35 Sr=fzjjzj>1=rg[f1g , 0<r<1.
EachSris aneighborhood of1. Also,
1.9.361z=z1 =1;
1.9 Calculus of a Complex Variable 17
1.9.37 1z=z1=1, z6= 0,
1.9.38 z=1= 0;
1.9.39 z=0 =1, z6= 0.
A function f(z) is analytic at1ifg(z) =f(1=z) is
analytic at z= 0, and we set f0(1) =g0(0).
Conformal Transformation
Supposef(z) is analytic in a domain DandC1;C2are
two arcs in Dpassing through z0. LetC0
1;C0
2be the
images ofC1andC2under the mapping w=f(z). The
angle between C1andC2atz0is the angle between the
tangents to the two arcs at z0, that is, the dierence of
the signed angles that the tangents make with the pos-
itive direction of the real axis. If f0(z0)6= 0, then the
angle between C1andC2equals the angle between C0
1
andC0
2both in magnitude and sense. We then say that
the mapping w=f(z) isconformal (angle-preserving)
atz0.
The linear transformation f(z) =az+b,a6= 0, has
f0(z) =aandw=f(z) maps Cconformally onto C.
Bilinear Transformation
1.9.40 w=f(z) =az+b
cz+d,ad bc6= 0,c6= 0.
1.9.41 f( d=c) =1; f(1) =a=c:
1.9.42 f0(z) =ad bc
(cz+d)2,z6= d=c.
1.9.43 f0(1) =bc ad
c2:
1.9.44 z=dw b
cw+a:
The transformation (1.9.40) is a one-to-one confor-
mal mapping of C[f1g onto itself.
The cross ratio ofz1;z2;z3;z42C[f1g is dened
by
1.9.45(z1 z2)(z3 z4)
(z1 z4)(z3 z2);
or its limiting form, and is invariant under bilinear
transformations.
Other names for the bilinear transformation are frac-
tional linear transformation ,homographic transforma-
tion, and M obius transformation .
1.9(v) Innite Sequences and Series
A sequencefzngconverges tozif lim
n!1zn=z. For
zn=xn+iyn, the sequencefzngconverges i the se-
quencesfxngandfyngseparately converge. A seriesP1
n=0znconverges if the sequence sn=Pn
k=0zkcon-
verges. The series is divergent ifsndoes not converge.
The series converges absolutely ifP1
n=0jznjconverges.A seriesP1
n=0znconverges (diverges) absolutely when
lim
n!1jznj1=n<1 (>1), or when lim
n!1jzn+1/znj<1
(>1). Absolutely convergent series are also convergent.
Letffn(z)gbe a sequence of functions dened on a
setS. This sequence converges pointwise to a function
f(z) if
1.9.46 f(z) = lim
n!1fn(z)
for eachz2S. The sequence converges uniformly onS,
if for every >0 there exists an integer N, independent
ofz, such that
1.9.47 jfn(z) f(z)j<
for allz2SandnN.
A seriesP1
n=0fn(z)converges uniformly onS, if the
sequencesn(z) =Pn
k=0fk(z) converges uniformly on S.
WeierstrassM-test
SupposefMngis a sequence of real numbers such thatP1
n=0Mnconverges andjfn(z)jMnfor allz2S
and alln0. Then the seriesP1
n=0fn(z) converges
uniformly on S.
A doubly-innite seriesP1
n= 1fn(z) converges
(uniformly) on Si each of the seriesP1
n=0fn(z) andP1
n=1f n(z) converges (uniformly) on S.
1.9(vi) Power Series
For a seriesP1
n=0an(z z0)nthere is a number R,
0R1 , such that the series converges for all zin
jz z0j< R and diverges for zinjz z0j> R. The
circlejz z0j=Ris called the circle of convergence of
the series, and Ris the radius of convergence . Inside
the circle the sum of the series is an analytic function
f(z). Forzinjz z0j(< R), the convergence is
absolute and uniform. Moreover,
1.9.48 an=f(n)(z0)
n!;
and
1.9.49 R= lim inf
n!1janj 1=n:
For the converse of this result see x1.10(i).
Operations
WhenPanznandPbnznboth converge
1.9.501X
n=0(anbn)zn=1X
n=0anzn1X
n=0bnzn;
and
1.9.51 1X
n=0anzn! 1X
n=0bnzn!
=1X
n=0cnzn;
where
1.9.52 cn=nX
k=0akbn k:
Next, let
1.9.53 f(z) =a0+a1z+a2z2+,a06= 0.
18 Algebraic and Analytic Methods
Then the expansions (1.9.54), (1.9.57), and (1.9.60) hold
for all suciently small jzj.
1.9.541
f(z)=b0+b1z+b2z2+;
where
1.9.55b0= 1=a0; b 1= a1=a2
0; b 2= (a2
1 a0a2)=a3
0;
1.9.56
bn= (a1bn 1+a2bn 2++anb0)=a0,n1.
Witha0= 1,
1.9.57 lnf(z) =q1z+q2z2+q3z3+;
(principal value), where
1.9.58q1=a1; q 2= (2a2 a2
1)=2;
q3= (3a3 3a1a2+a3
1)=3;
and
1.9.59
qn= (nan (n 1)a1qn 1 (n 2)a2qn 2
an 1q1)=n,
n2.
Also,
1.9.60 (f(z))=p0+p1z+p2z2+;
(principal value), where 2C,
1.9.61p0= 1; p 1=a1; p 2=(( 1)a2
1+ 2a2)=2;
and
1.9.62
pn= (( n+ 1)a1pn 1+ (2 n+ 2)a2pn 2+
+ ((n 1) 1)an 1p1+nan)=n,
n1.
For the denitions of the principal values of ln f(z) and
(f(z))seexx4.2(i) and 4.2(iv).
Lastly, a power series can be dierentiated any num-
ber of times within its circle of convergence:
1.9.63f(m)(z) =1X
n=0(n+ 1)man+m(z z0)n,
jz z0j<R,m= 0;1;2;:::.
1.9(vii) Inversion of Limits
Double Sequences and Series
A set of complex numbers fzm;ngwheremandntake
all positive integer values is called a double sequence . It
converges to zif for every >0, there is an integer N
such that
1.9.64 jzm;n zj<
for allm;nN. Supposefzm;ngconverges to zand
the repeated limits
1.9.65 lim
m!1
lim
n!1zm;n
;lim
n!1
lim
m!1zm;nexist. Then both repeated limits equal z.
Adouble series is the limit of the double sequence
1.9.66 zp;q=pX
m=0qX
n=0m;n:
If the limit exists, then the double series is convergent ;
otherwise it is divergent . The double series is absolutely
convergent if it is convergent when m;nis replaced by
jm;nj.
If a double series is absolutely convergent, then it
is also convergent and its sum is given by either of the
repeated sums
1.9.671X
m=0 1X
n=0m;n!
;1X
n=0 1X
m=0m;n!
:
Term-by-Term Integration
Suppose the seriesP1
n=0fn(z), wherefn(z) is contin-
uous, converges uniformly on every compact set of a
domainD, that is, every closed and bounded set in D.
Then
1.9.68Z
C1X
n=0fn(z)dz=1X
n=0Z
Cfn(z)dz
for any nite contour CinD.
Dominated Convergence Theorem
Let (a;b) be a nite or innite interval, and
f0(t);f1(t);:::be real or complex continuous functions,
t2(a;b). SupposeP1
n=0fn(t) converges uniformly in
any compact interval in ( a;b), and at least one of the
following two conditions is satised:
1.9.69Zb
a1X
n=0jfn(t)jdt<1;
1.9.701X
n=0Zb
ajfn(t)jdt<1:
Then
1.9.71Zb
a1X
n=0fn(t)dt=1X
n=0Zb
afn(t)dt:
1.10 Functions of a Complex Variable
1.10(i) Taylor's Theorem for Complex Variables
Letf(z) be analytic on the disk jz z0j<R. Then
1.10.1 f(z) =1X
n=0f(n)(z0)
n!(z z0)n:
The right-hand side is the Taylor series for f(z)at
z=z0, and its radius of convergence is at least R.
1.10 Functions of a Complex Variable 19
Examples
1.10.2 ez= 1 +z
1!+z2
2!+,jzj<1,
1.10.3 ln(1 +z) =z z2
2+z3
3 ,jzj<1,
1.10.4
(1 z) = 1 +z+(+ 1)
2!z2+(+ 1)(+ 2)
3!z3
+, jzj<1.
Again, in these examples ln(1 + z) and (1 z) have
their principal values; see xx4.2(i) and 4.2(iv).
Zeros
An analytic function f(z) has a zero of order (ormul-
tiplicity )m(1) atz0if the rst nonzero coecient in
its Taylor series at z0is that of (z z0)m. Whenm= 1
the zero is simple .
1.10(ii) Analytic Continuation
Letf1(z) be analytic in a domain D1. Iff2(z), analytic
inD2, equalsf1(z) on an arc in D=D1\D2, or on
just an innite number of points with a limit point in
D, then they are equal throughout Dandf2(z) is called
ananalytic continuation off1(z). We write ( f1;D1),
(f2;D2) to signify this continuation.
Supposez(t) =x(t) +iy(t),atb, is an arc and
a=t0< t1<< tn=b. Suppose the subarc z(t),
t2[tj 1;tj] is contained in a domain Dj,j= 1;:::;n .
The function f1(z) onD1is said to be analytically con-
tinued along the path z(t),atb, if there is a chain
(f1;D1), (f2;D2);:::; (fn;Dn).
Analytic continuation is a powerful aid in establish-
ing transformations or functional equations for complex
variables, because it enables the problem to be reduced
to: (a) deriving the transformation (or functional equa-
tion) with real variables; followed by (b) nding the
domain on which the transformed function is analytic.
Schwarz Re
ection Principle
LetCbe a simple closed contour consisting of a seg-
ment ABof the real axis and a contour in the upper
half-plane joining the ends of AB. Also, letf(z) be an-
alytic within C, continuous within and on C, and real
onAB. Thenf(z) can be continued analytically across
ABbyre
ection , that is,
1.10.5 f(z) =f(z):
1.10(iii) Laurent Series
Supposef(z) is analytic in the annulusr1<jz z0j<
r2, 0r1<r21, andr2(r1;r2). Then
1.10.6 f(z) =1X
n= 1an(z z0)n;where
1.10.7an=1
2iZ
jz z0j=rf(z)
(z z0)n+1dz;
and the integration contour is described once in the pos-
itive sense. The series (1.10.6) converges uniformly and
absolutely on compact sets in the annulus.
Letr1= 0, so that the annulus becomes the punc-
tured neighborhood N: 0<jz z0j< r2, and assume
thatf(z) is analytic in N, but not at z0. Thenz=z0
is an isolated singularity off(z). This singularity is re-
movable ifan= 0 for all n < 0, and in this case the
Laurent series becomes the Taylor series. Next, z0is a
pole ifan6= 0 for at least one, but only nitely many,
negativen. If nis the rst negative integer (counting
from 1) witha n6= 0, thenz0is apole of order (or
multiplicity )n. Lastly, if an6= 0 for innitely many
negativen, thenz0is an isolated essential singularity .
The singularities of f(z) at innity are classied in
the same way as the singularities of f(1=z) atz= 0.
An isolated singularity z0is always removable when
limz!z0f(z) exists, for example (sin z)=zatz= 0.
The coecient a 1of (z z0) 1in the Laurent series
forf(z) is called the residue off(z) atz0, and denoted
by resz=z0[f(z)], res
z=z0[f(z)], or (when there is no ambi-
guity) res[f(z)].
A function whose only singularities, other than the
point at innity, are poles is called a meromorphic func-
tion. If the poles are innite in number, then the point
at innity is called an essential singularity : it is the
limit point of the poles.
Picard's Theorem
In any neighborhood of an isolated essential singularity,
however small, an analytic function assumes every value
inCwith at most one exception.
1.10(iv) Residue Theorem
Iff(z) is analytic within a simple closed contour C, and
continuous within and on C|except in both instances
for a nite number of singularities within C|then
1.10.8
1
2iZ
Cf(z)dz= sum of the residues of f(z) withinC:
Here and elsewhere in this subsection the path Cis de-
scribed in the positive sense.
20 Algebraic and Analytic Methods
Phase (or Argument) Principle
If the singularities within Care poles and f(z) is ana-
lytic and nonvanishing on C, then
1.10.9N P=1
2iZ
Cf0(z)
f(z)dz=1
2C(phf(z));
whereNandPare respectively the numbers of zeros
and poles, counting multiplicity, of fwithinC, and
C(phf(z)) is the change in any continuous branch of
ph(f(z)) aszpasses once around Cin the positive sense.
For examples of applications see Olver (1997b, pp. 252{
254).
In addition,
1.10.10
1
2iZ
Czf0(z)
f(z)dz= (sum of locations of zeros)
(sum of locations of poles) ;
each location again being counted with multiplicity
equal to that of the corresponding zero or pole.
Rouch e's Theorem
Iff(z) andg(z) are analytic on and inside a simple
closed contour C, andjg(z)j<jf(z)jonC, thenf(z)
andf(z) +g(z) have the same number of zeros inside
C.
1.10(v) Maximum-Modulus Principle
Analytic Functions
Iff(z) is analytic in a domain D,z02Dandjf(z)j
jf(z0)jfor allz2D, thenf(z) is a constant in D.
LetDbe a bounded domain with boundary @Dand
letD=D[@D. Iff(z) is continuous on Dand analytic
inD, thenjf(z)jattains its maximum on @D.
Harmonic Functions
Ifu(z) is harmonic in D,z02D, andu(z)u(z0) for
allz2D, thenu(z) is constant in D. Moreover, if Dis
bounded and u(z) is continuous on Dand harmonic in
D, thenu(z) is maximum at some point on @D.
Schwarz's Lemma
Injzj<R, iff(z) is analytic,jf(z)jM, andf(0) = 0,
then
1.10.11jf(z)jMjzj
Randjf0(0)jM
R:
Equalities hold i f(z) =Az, whereAis a constant
such thatjAj=M=R .
1.10(vi) Multivalued Functions
Functions which have more than one value at a given
pointzare called multivalued (ormany-valued ) func-
tions. LetF(z) be a multivalued function and Dbe a
domain. If we can assign a unique value f(z) toF(z) at
each point of D, andf(z) is analytic on D, thenf(z) is
abranch ofF(z).Example
F(z) =pzis two-valued for z6= 0. IfD=Cn( 1;0]
andz=rei, then one branch isprei=2, the other
branch is prei=2, with < < in both cases.
Similarly if D=Cn[0;1), then one branch isprei=2,
the other branch is prei=2, with 0<< 2in both
cases.
Acut domain is one from which the points on nitely
many nonintersecting simple contours ( x1.9(iii)) have
been removed. Each contour is called a cut. Acut neigh-
borhood is formed by deleting a ray emanating from the
center. (Or more generally, a simple contour that starts
at the center and terminates on the boundary.)
SupposeF(z) is multivalued and ais a point such
that there exists a branch of F(z) in a cut neighborhood
ofa, but there does not exist a branch of F(z) in any
punctured neighborhood of a. Thenais abranch point
ofF(z). For example, z= 0 is a branch point ofpz.
Branches can be constructed in two ways:
(a) By introducing appropriate cuts from the branch
points and restricting F(z) to be single-valued in the cut
plane (or domain).
(b) By specifying the value of F(z) at a point z0(not
a branch point), and requiring F(z) to be continuous on
any path that begins at z0and does not pass through
any branch points or other singularities of F(z).
If the path circles a branch point at z=a ktimes
in the positive sense, and returns to z0without encir-
cling any other branch point, then its value is denoted
conventionally as F((z0 a)e2ki+a).
Example
Letandbe real or complex numbers that are not
integers. The function F(z) = (1 z)(1+z)is many-
valued with branch points at 1. Branches of F(z) can
be dened, for example, in the cut plane Dobtained
fromCby removing the real axis from 1 to 1and from
1 to 1; see Figure 1.10.1. One such branch is ob-
tained by assigning (1 z)and (1 +z)their principal
values (x4.2(iv)).
Figure 1.10.1 : DomainD.
Alternatively, take z0to be any point in Dand set
F(z0) =eln(1 z0)eln(1+z0)where the logarithms as-
sume their principal values. (Thus if z0is in the in-
terval ( 1;1), then the logarithms are real.) Then the
value ofF(z) at any other point is obtained by analytic
continuation.
1.10 Functions of a Complex Variable 21
Thus ifF(z) is continued along a path that circles
z= 1mtimes in the positive sense and returns to
z0without circling z= 1, thenF((z0 1)e2mi+
1) =eln(1 z0)eln(1+z0)e2im. If the path also circles
z= 1ntimes in the clockwise or negative sense be-
fore returning to z0, then the value of F(z0) becomes
eln(1 z0)eln(1+z0)e2ime 2in.
1.10(vii) Inverse Functions
Lagrange Inversion Theorem
Supposef(z) is analytic at z=z0,f0(z0)6= 0, and
f(z0) =w0. Then the equation
1.10.12 f(z) =w
has a unique solution z=F(w) analytic at w=w0, and
1.10.13 F(w) =z0+1X
n=1Fn(w w0)n
in a neighborhood of w0, wherenFnis the residue of
1=(f(z) f(z0))natz=z0. (In other words nFnis
the coecient of ( z z0) 1in the Laurent expansion
of 1=(f(z) f(z0))nin powers of ( z z0); compare
x1.10(iii).)
Furthermore, if g(z) is analytic at z0, then
1.10.14g(F(w)) =g(z0) +1X
n=1Gn(w w0)n;
wherenGnis the residue of g0(z)=(f(z) f(z0))nat
z=z0.
Extended Inversion Theorem
Suppose that
1.10.15f(z) =f(z0) +1X
n=0fn(z z0)+n;
where > 0,f06= 0, and the series converges in a
neighborhood of z0. (For example, when is an integer
f(z) f(z0) has a zero of order atz0.) Letw0=f(z0).
Then (1.10.12) has a solution z=F(w), where
1.10.16 F(w) =z0+1X
n=1Fn(w w0)n=
in a neighborhood of w0,nFnbeing the residue of
1=(f(z) f(z0))n=atz=z0.
It should be noted that dierent branches of ( w
w0)1=used in forming ( w w0)n=in (1.10.16) give rise
to dierent solutions of (1.10.12). Also, if in addition
g(z) is analytic at z0, then
1.10.17g(F(w)) =g(z0) +1X
n=1Gn(w w0)n=;
wherenGnis the residue of g0(z)=(f(z) f(z0))n=at
z=z0.1.10(viii) Functions Dened by Contour
Integrals
LetDbe a domain and [ a;b] be a closed nite segment
of the real axis. Assume that for each t2[a;b],f(z;t)
is an analytic function of zinD, and also that f(z;t)
is a continuous function of both variables. Then
1.10.18 F(z) =Zb
af(z;t)dt
is analytic in Dand its derivatives of all orders can be
found by dierentiating under the sign of integration.
This result is also true when b=1, or whenf(z;t)
has a singularity at t=b, with the following conditions.
For eacht2[a;b),f(z;t) is analytic in D;f(z;t) is a
continuous function of both variables when z2Dand
t2[a;b); the integral (1.10.18) converges at b, and this
convergence is uniform with respect to zin every com-
pact subset SofD.
The last condition means that given (>0) there
exists a number a02[a;b) that is independent of zand
is such that
1.10.19Zb
a1f(z;t)dt<;
for alla12[a0;b) and allz2S; comparex1.5(iv).
M-test
Ifjf(z;t)jM(t) forz2SandRb
aM(t)dtconverges,
then the integral (1.10.18) converges uniformly and ab-
solutely inS.
1.10(ix) Innite Products
Letpk;m=Qm
n=k(1 +an). If for some k1,pk;m!
pk6= 0 asm!1 , then we say that the innite prod-
uctQ1
n=1(1 +an)converges . (The integer kmay be
greater than one to allow for a nite number of zero
factors.) The convergence of the product is absolute ifQ1
n=1(1 +janj) converges. The productQ1
n=1(1 +an),
withan6= 1 for alln, converges iP1
n=1ln(1 +an)
converges; and it converges absolutely iP1
n=1janjcon-
verges.
Supposean=an(z),z2D, a domain. The conver-
gence of the innite product is uniform if the sequence
of partial products converges uniformly.
M-test
Suppose that an(z) are analytic functions in D. If there
is anN, independent of z2D, such that
1.10.20jln(1 +an(z))jMn,nN,
and
1.10.211X
n=1Mn<1;
then the productQ1
n=1(1 +an(z)) converges uniformly
to an analytic function p(z) inD, andp(z) = 0 only
22 Algebraic and Analytic Methods
when at least one of the factors 1 + an(z) is zero in D.
This conclusion remains true if, in place of (1.10.20),
jan(z)jMnfor alln, and againP1
n=1Mn<1.
Weierstrass Product
Iffzngis a sequence such thatP1
n=1jz 2
njis convergent,
then
1.10.22 P(z) =1Y
n=1
1 z
zn
ez=zn
is an entire function with zeros at zn.
1.10(x) Innite Partial Fractions
SupposeDis a domain, and
1.10.23 F(z) =1Y
n=1an(z), z2D,
wherean(z) is analytic for all n1, and the conver-
gence of the product is uniform in any compact subset
ofD. ThenF(z) is analytic in D.
If, also,an(z)6= 0 when n1 andz2D, then
F(z)6= 0 onDand
1.10.24F0(z)
F(z)=1X
n=1a0
n(z)
an(z):
Mittag-Leer's Expansion
Iffangandfzngare sequences such that zm6=zn
(m6=n) andP1
n=1janz 2
njis convergent, then
1.10.25 f(z) =1X
n=1an1
z zn+1
zn
is analytic in C, except for simple poles at z=znof
residuean.
1.11 Zeros of Polynomials
1.11(i) Division Algorithm
Horner's Scheme
Let
1.11.1f(z) =anzn+an 1zn 1++a0:
Then
1.11.2f(z) = (z )(bnzn 1+bn 1zn 2++b1)+b0;
wherebn=an,
1.11.3 bk=bk+1+ak,k=n 1;n 2;:::; 0,
1.11.4 f() =b0:Extended Horner Scheme
Withbkas in (1.11.1){(1.11.3) let cn=anand
1.11.5 ck=ck+1+bk,k=n 1;n 2;:::; 1.
Then
1.11.6 f0() =c1:
More generally, for polynomials f(z) andg(z), there
are polynomials q(z) andr(z), found by equating coef-
cients, such that
1.11.7 f(z) =g(z)q(z) +r(z);
where 0degr(z)<degg(z).
1.11(ii) Elementary Properties
A polynomial of degree nwith real or complex coef-
cients has exactly nreal or complex zeros counting
multiplicity. Every monic (coecient of highest power
is one) polynomial of odd degree with real coecients
has at least one real zero with sign opposite to that of
the constant term. A monic polynomial of even degree
with real coecients has at least two zeros of opposite
signs when the constant term is negative.
Descartes' Rule of Signs
The number of positive zeros of a polynomial with real
coecients cannot exceed the number of times the co-
ecients change sign, and the two numbers have same
parity. A similar relation holds for the changes in sign
of the coecients of f( z), and hence for the number
of negative zeros of f(z).
Example
1.11.8f(z) =z8+ 10z3+z 4;
f( z) =z8 10z3 z 4:
Both polynomials have one change of sign; hence for
each polynomial there is one positive zero, one negative
zero, and six complex zeros.
Next, letf(z) =anzn+an 1zn 1++a0. The
zeros ofznf(1=z) =a0zn+a1zn 1++anare recip-
rocals of the zeros of f(z).
The discriminant off(z) is dened by
1.11.9 D=a2n 2
nY
j<k(zj zk)2;
wherez1;z2;:::;znare the zeros of f(z). The elemen-
tary symmetric functions of the zeros are (with an6= 0)
1.11.10z1+z2++zn= an 1=an;
X
1j<knzjzk=an 2=an;
...
z1z2zn= ( 1)na0=an:
1.11 Zeros of Polynomials 23
1.11(iii) Polynomials of Degrees Two, Three,
and Four
Quadratic Equations
The roots of az2+bz+c= 0 are
1.11.11 bp
D
2a; D =b2 4ac:
The sum and product of the roots are respectively b=a
andc=a.
Cubic Equations
Setz=w 1
3ato reducef(z) =z3+az2+bz+c
tog(w) =w3+pw+q, withp= (3b a2)=3,q=
(2a3 9ab+ 27c)=27. The discriminant of g(w) is
1.11.12 D= 4p3 27q2:
Let
1.11.13A=3q
27
2q+3
2p
3D; B = 3p=A:
The roots of g(w) = 0 are
1.11.141
3(A+B);1
3(A+2B);1
3(2A+B);
with
1.11.15= 1
2+1
2p
3 =e2i=3; 2=e 2i=3:
Addition of 1
3ato each of these roots gives the roots
off(z) = 0.
Example
f(z) =z3 6z2+6z 2,g(w) =w3 6w 6,A= 33p
4,
B= 33p
2. Roots of f(z) = 0 are 2 +3p
4 +3p
2,
2 +3p
4+3p
22, 2 +3p
42+3p
2.
For another method see x4.43.
Quartic Equations
Setz=w 1
4ato reducef(z) =z4+az3+bz2+cz+d
to
1.11.16g(w) =w4+pw2+qw+r;
p= ( 3a2+ 8b)=8; q = (a3 4ab+ 8c)=8;
r= ( 3a4+ 16a2b 64ac+ 256d)=256:
The discriminant of g(w) is
1.11.17
D= 16p4r 4p3q2 128p2r2+ 144pq2r 27q4+ 256r3:
For the roots 1;2;3;4ofg(w) = 0 and the roots
1;2;3of the resolvent cubic equation
1.11.18 z3 2pz2+ (p2 4r)z+q2= 0;
we have
1.11.1921=p
1+p
2+p
3;
22=p
1 p
2 p
3;
23= p
1+p
2 p
3;
24= p
1 p
2+p
3:
The square roots are chosen so that
1.11.20p
1p
2p
3= q:
Add 1
4ato the roots of g(w) = 0 to get those of
f(z) = 0.Example
f(z) =z4 4z3+ 5z+ 2,g(w) =w4 6w2 3w+ 4.
Resolvent cubic is z3+ 12z2+ 20z+ 9 = 0 with roots
1= 1,2= 1
2(11 +p
85),3= 1
2(11 p
85),
andp 1= 1,p 2=1
2(p
17 +p
5),p 3=
1
2(p
17 p
5). So 21= 1 +p
17, 22= 1 p
17,
23= 1 +p
5, 24= 1 p
5, and the roots of
f(z) = 0 are1
2(3p
17),1
2(1p
5).
1.11(iv) Roots of Unity and of Other Constants
The roots of
1.11.21zn 1 = (z 1)(zn 1+zn 2++z+ 1) = 0
are 1,e2i=n,e4i=n;:::;e(2n 2)i=n, and ofzn+ 1 = 0
they areei=n;e3i=n;:::;e(2n 1)i=n.
The roots of
1.11.22 zn=a+ib, a;breal,
are
1.11.23np
R
cos+ 2k
n
+isin+ 2k
n
;
whereR= (a2+b2)1=2,= ph(a+ib), with the prin-
cipal value of phase ( x1.9(i)), and k= 0;1;:::;n 1.
1.11(v) Stable Polynomials
1.11.24 f(z) =a0+a1z++anzn;
with real coecients, is called stable if the real parts of
all the zeros are strictly negative.
Hurwitz Criterion
Let
1.11.25
D1=a1; D 2=a1a3
a0a2; D 3=a1a3a5
a0a2a4
0a1a3;
and
1.11.26 Dk= det[h(1)
k;h(3)
k;:::;h(2k 1)
k];
where the column vector h(m)
kconsists of the rst k
members of the sequence am;am 1;am 2;:::withaj=
0 ifj <0 orj >n .
Thenf(z), withan6= 0, is stable i a06= 0;
D2k>0,k= 1;:::;1
2n
; signD2k+1= signa0,
k= 0;1;:::;1
2n 1
2
.
24 Algebraic and Analytic Methods
1.12 Continued Fractions
1.12(i) Notation
The notation used throughout this Handbook for the
continued fraction
1.12.1b0+a1
b1+a2
b2+...
is
1.12.2 b0+a1
b1+a2
b2+:
1.12(ii) Convergents
1.12.3 C=b0+a1
b1+a2
b2+,an6= 0,
1.12.4Cn=b0+a1
b1+a2
b2+an
bn=An
Bn:
Cnis called the nthapproximant orconvergent to C.
AnandBnare called the nth(canonical) numerator
and denominator respectively.
Recurrence Relations
1.12.5Ak=bkAk 1+akAk 2,Bk=bkBk 1+akBk 2,
k= 1;2;3;:::,
1.12.6A 1= 1; A 0=b0; B 1= 0; B 0= 1:Determinant Formula
1.12.7
AnBn 1 BnAn 1= ( 1)n 1nY
k=1ak,n= 0;1;2;:::.
1.12.8Cn Cn 1=( 1)n 1Qn
k=1ak
Bn 1Bn,n= 1;2;3;:::,
1.12.9Cn=b0+a1
B0B1 + ( 1)n 1Qn
k=1ak
Bn 1Bn:
1.12.10an=An 1Bn AnBn 1
An 1Bn 2 An 2Bn 1,n= 1;2;3;:::,
1.12.11an=Bn
Bn 2Cn 1 Cn
Cn 1 Cn 2,n= 2;3;4;:::,
1.12.12bn=AnBn 2 An 2Bn
An 1Bn 2 An 2Bn 1,n= 1;2;3;:::,
1.12.13bn=Bn
Bn 1Cn Cn 2
Cn 1 Cn 2,n= 2;3;4;:::,
1.12.14b0=A0=C0; b 1=B1; a 1=A1 A0B1:
Equivalence
Two continued fractions are equivalent if they have the
same convergents.
b0+a1
b1+a2
b2+ is equivalent to b0
0+
a0
1
b0
1+a0
2
b0
2+if there is a sequence fdng1
n=0,d0= 1,
dn6= 0, such that
1.12.15 a0
n=dndn 1an,n= 1;2;3;:::,
and
1.12.16 b0
n=dnbn,n= 0;1;2;::::
Formally,
1.12.17b0+a1
b1+a2
b2+a3
b3+=b0+a1=b1
1 +a2=(b1b2)
1 +a3=(b2b3)
1 +an=(bn 1bn)
1 +
=b0+1
(1/a1)b1+1
(a1/a2)b2+1
(a2/(a1a3))b3+1
(a1a3/(a2a4))b4+:
Series
1.12.18 p0+nX
k=1p1p2pk=p0+p1
1 p2
1 +p2 p3
1 +p3 pn
1 +pn, n= 0;1;2;:::,
whenpk6= 0,k= 1;2;3;:::.
1.12.19nX
k=0ckxk=c0+c1x
1 (c2/c1)x
1 + (c2/c1)x (c3/c2)x
1 + (c3/c2)x (cn/cn 1)x
1 + (cn/cn 1)x,n= 0;1;2;:::,
whenck6= 0,k= 1;2;3;:::.
1.13 Differential Equations 25
Fractional Transformations
Dene
1.12.20 Cn(w) =b0+a1
b1+a2
b2+an
bn+w:
Then
1.12.21 Cn(w) =An+An 1w
Bn+Bn 1w; Cn(0) =Cn; Cn(1) =Cn 1=An 1
Bn 1:
1.12(iii) Existence of Convergents
A sequencefCngin the extended complex plane, C[f1g , can be a sequence of convergents of the continued fraction
(1.12.3) i
1.12.22 C06=1; Cn6=Cn 1, n= 1;2;3;:::.
1.12(iv) Contraction and Extension
Acontraction of a continued fraction Cis a continued fraction C0whose convergents fC0
ngform a subsequence of
the convergentsfCngofC. Conversely, Cis called an extension ofC0. IfC0
n=C2n,n= 0;1;2;:::, thenC0is called
theeven part ofC. The even part of Cexists ib2k6= 0,k= 1;2;:::, and up to equivalence is given by
1.12.23b0+a1b2
a2+b1b2 a2a3b4
a3b4+b2(a4+b3b4) a4a5b2b6
a5b6+b4(a6+b5b6) a6a7b4b8
a7b8+b6(a8+b7b8) :
IfC0
n=C2n+1,n= 0;1;2;:::, thenC0is called the odd part ofC. The odd part of Cexists ib2k+16= 0,
k= 0;1;2;:::, and up to equivalence is given by
1.12.24a1+b0b1
b1 a1a2b3=b1
a2b3+b1(a3+b2b3) a3a4b1b5
a4b5+b3(a5+b4b5) a5a6b3b7
a6b7+b5(a7+b6b7) :
1.12(v) Convergence
A continued fraction converges if the convergents Cn
tend to a nite limit as n!1 .
Pringsheim's Theorem
The continued fractiona1
b1+a2
b2+converges when
1.12.25 jbnjjanj+ 1,n= 1;2;3;:::.
With these conditions the convergents CnsatisfyjCnj<
1 andCn!CwithjCj1.
Van Vleck's Theorem
Let the elements of the continued fraction
1
b1+1
b2+satisfy
1.12.26 1
2+<phbn<1
2 ,n= 1;2;3;:::,
whereis an arbitrary small positive constant. Then
the convergents Cnsatisfy
1.12.27 1
2+<phCn<1
2 ,n= 1;2;3;:::,
and the even and odd parts of the continued fraction
converge to nite values. The continued fraction con-
verges i, in addition,
1.12.281X
n=1jbnj=1:In this casejphCj1
2.
1.12(vi) Applications
For analytical and numerical applictions of continued
fractions to special functions see x3.10.
1.13 Dierential Equations
1.13(i) Existence of Solutions
A domain in the complex plane is simply-connected if it
has no \holes"; more precisely, if its complement in the
extended plane C[f1g is connected.
The equation
1.13.1d2w
dz2+f(z)dw
dz+g(z)w= 0;
wherez2D, a simply-connected domain, and f(z),
g(z) are analytic in D, has an innite number of an-
alytic solutions in D. A solution becomes unique, for
example, when wanddw/dzare prescribed at a point
inD.
26 Algebraic and Analytic Methods
Fundamental Pair
Two solutions w1(z) andw2(z) are called a fundamental
pair if any other solution w(z) is expressible as
1.13.2 w(z) =Aw1(z) +Bw2(z);
whereAandBare constants. A fundamental pair can
be obtained, for example, by taking any z02Dand
requiring that
1.13.3
w1(z0) = 1; w0
1(z0) = 0; w 2(z0) = 0; w0
2(z0) = 1:
Wronskian
The Wronskian ofw1(z) andw2(z) is dened by
1.13.4Wfw1(z);w2(z)g=w1(z)w0
2(z) w2(z)w0
1(z):
Then
1.13.5 Wfw1(z);w2(z)g=ce R
f(z)dz;
wherecis independent of z. Iff(z) = 0, then the Wron-
skian is constant.
The following three statements are equivalent:
w1(z) andw2(z) comprise a fundamental pair in D;
Wfw1(z);w2(z)gdoes not vanish in D;w1(z) andw2(z)
arelinearly independent , that is, the only constants A
andBsuch that
1.13.6 Aw1(z) +Bw2(z) = 0,8z2D,
areA=B= 0.
1.13(ii) Equations with a Parameter
Assume that in the equation
1.13.7d2w
dz2+f(u;z)dw
dz+g(u;z)w= 0;
uandzbelong to domains UandDrespectively, the
coecients f(u;z) andg(u;z) are continuous functions
of both variables, and for each xed u(xedz) the two
functions are analytic in z(inu). Suppose also that at
(a xed)z02D,wand@w/@zare analytic functions
ofu. Then at each z2D,w,@w/@zand@2w
@z2are
analytic functions of u.
1.13(iii) Inhomogeneous Equations
The inhomogeneous (ornonhomogeneous ) equation
1.13.8d2w
dz2+f(z)dw
dz+g(z)w=r(z)
withf(z),g(z), andr(z) analytic in Dhas innitely
many analytic solutions in D. Ifw0(z) is any one
solution, and w1(z),w2(z) are a fundamental pair of
solutions of the corresponding homogeneous equation
(1.13.1), then every solution of (1.13.8) can be expressed
as
1.13.9w(z) =w0(z) +Aw1(z) +Bw2(z);
whereAandBare constants.Variation of Parameters
With the notation of (1.13.8) and (1.13.9)
1.13.10w0(z) =w2(z)Zw1(z)r(z)
Wfw1(z);w2(z)gdz
w1(z)Zw2(z)r(z)
Wfw1(z);w2(z)gdz:
1.13(iv) Change of Variables
Transformation of the Point at Innity
The substitution = 1=zin (1.13.1) gives
1.13.11d2W
d2+F()dW
d+G()W= 0;
where
1.13.12W() =w1
;
F() =2
1
2f1
;
G() =1
4g1
:
Elimination of First Derivative by Change of Dependent
Variable
The substitution
1.13.13w(z) =W(z) exp
1
2Z
f(z)dz
in (1.13.1) gives
1.13.14d2W
dz2 H(z)W= 0;
where
1.13.15 H(z) =1
4f2(z) +1
2f0(z) g(z):
Elimination of First Derivative by Change of Independent
Variable
In (1.13.1) substitute
1.13.16 =Z
exp
Z
f(z)dz
dz:
Then
1.13.17d2w
d2+g(z) exp
2Z
f(z)dz
w= 0:
Liouville Transformation
LetW(z) satisfy (1.13.14), (z) be any thrice-
dierentiable function of z, and
1.13.18 U(z) = (0(z))1=2W(z):
Then
1.13.19d2U
d2=
_z2H(z) 1
2fz;g
U:
1.14 Integral Transforms 27
Here dots denote dierentiations with respect to , and
fz;gis the Schwarzian derivative :
1.13.20fz;g= 2 _z1/2d2
d2( _z 1/2) =...z
_z 3
2z
_z2
:
Cayley's Identity
For arbitrary and,
1.13.21fz;g= (d/d)2fz;g+f;g:
1.13.22fz;g= (dz/d)2f;zg:
1.13(v) Products of Solutions
The product of any two solutions of (1.13.1) satises
1.13.23
d3w
dz3+ 3fd2w
dz2+ (2f2+f0+ 4g)dw
dz+ (4fg+ 2g0)w= 0:
IfU(z) andV(z) are respectively solutions of
1.13.24d2U
dz2+IU= 0;d2V
dz2+JV= 0;
thenW=UVis a solution of
1.13.25
d
dzW000+ 2(I+J)W0+ (I0+J0)W
I J
= (I J)W:
1.13(vi) Singularities
For classication of singularities of (1.13.1) and expan-
sions of solutions in the neighborhoods of singularities,
seex2.7.
1.13(vii) Closed-Form Solutions
For an extensive collection of solutions of dierential
equations of the rst, second, and higher orders see
Kamke (1977).
1.14 Integral Transforms
1.14(i) Fourier Transform
The Fourier transform of a real- or complex-valued
functionf(t) is dened by
1.14.1 F(x) =1p
2Z1
1f(t)eixtdt:
(Some references replace ixtby ixt.)
Iff(t) is absolutely integrable on ( 1;1), then
F(x) is continuous, F(x)!0 asx!1 , and
1.14.2jF(x)j1p
2Z1
1jf(t)jdt:Inversion
Suppose that f(t) is absolutely integrable on ( 1;1)
and of bounded variation in a neighborhood of t=u
(x1.4(v)). Then
1.14.31
2(f(u+) +f(u )) =1p
2Z1
1F(x)e ixudx;
where the last integral denotes the Cauchy principal
value (1.4.25).
In many applications f(t) is absolutely integrable
andf0(t) is continuous on ( 1;1). Then
1.14.4 f(t) =1p
2Z1
1F(x)e ixtdx:
Convolution
For Fourier transforms, the convolution (fg)(t) of two
functionsf(t) andg(t) dened on ( 1;1) is given by
1.14.5 (fg)(t) =1p
2Z1
1f(t s)g(s)ds:
Iff(t) andg(t) are absolutely integrable on ( 1;1),
then so is ( fg)(t), and its Fourier transform is
F(x)G(x), whereG(x) is the Fourier transform of g(t).
Parseval's Formula
Supposef(t) andg(t) are absolutely integrable on
( 1;1), andF(x) andG(x) are their respective
Fourier transforms. Then
1.14.6 (fg)(t) =1p
2Z1
1F(x)G(x)e itxdx;
1.14.7Z1
1F(x)G(x)dx=Z1
1f(t)g( t)dt;
1.14.8Z1
1jF(x)j2dx=Z1
1jf(t)j2dt:
(1.14.8) is Parseval's formula .
Uniqueness
Iff(t) andg(t) are continuous and absolutely inte-
grable on ( 1;1), andF(x) =G(x) for allx, then
f(t) =g(t) for allt.
1.14(ii) Fourier Cosine and Sine Transforms
These are dened respectively by
1.14.9 Fc(x) =r
2
Z1
0f(t) cos(xt)dt;
1.14.10 Fs(x) =r
2
Z1
0f(t) sin(xt)dt:
28 Algebraic and Analytic Methods
Inversion
Iff(t) is absolutely integrable on [0 ;1) and of bounded
variation (x1.4(v)) in a neighborhood of t=u, then
1.14.111
2(f(u+) +f(u )) =r
2
Z1
0Fc(x) cos(ux)dx;
1.14.121
2(f(u+) +f(u )) =r
2
Z1
0Fs(x) sin(ux)dx:
Parseval's Formula
IfR1
0jf(t)jdt <1,g(t) is of bounded variation on
(0;1) andg(t)!0 ast!1 , then
1.14.13Z1
0Fc(x)Gc(x)dx=Z1
0f(t)g(t)dt;
1.14.14Z1
0Fs(x)Gs(x)dx=Z1
0f(t)g(t)dt;
1.14.15Z1
0(Fc(x))2dx=Z1
0(f(t))2dt;
1.14.16Z1
0(Fs(x))2dx=Z1
0(f(t))2dt;
whereGc(x) andGs(x) are respectively the cosine and
sine transforms of g(t).
1.14(iii) Laplace Transform
Supposef(t) is a real- or complex-valued function and s
is a real or complex parameter. The Laplace transform
offis dened by
1.14.17 L(f(t);s) =Z1
0e stf(t)dt:
Alternative notations are L(f(t)),L(f;s), or even
L(f), when it is not important to display all the vari-
ables.
Convergence and Analyticity
Assume that on [0 ;1)f(t) is piecewise continuous and
ofexponential growth , that is, constants Mandexist
such that
1.14.18 jf(t)jMet, 0t<1.
ThenL(f(t);s) is an analytic function of sfor<s> .
Moreover,
1.14.19 L(f(t);s)!0,<s!1 .
Throughout the remainder of this subsection we as-
sume (1.14.18) is satised and <s> .
Inversion
Iff(t) is continuous and f0(t) is piecewise continuous
on [0;1), then
1.14.20
f(t) =1
2ilim
T!1Z+iT
iTetsL(f(t);s)ds,> .
Moreover, if L(f(t);s) =O
s K
in some half-plane
<s
andK > 1, then (1.14.20) holds for >
.Translation
If<s>max(<(a+);), then
1.14.21 L(f(t);s a) =L
eatf(t);s
:
Also, ifa0 then
1.14.22 L(H(t a)f(t a);s) =e asL(f(t);s);
whereHis the Heaviside function; see (1.16.13).
Dierentiation and Integration
Iff(t) is piecewise continuous, then
1.14.23
dn
dsnL(f(t);s) =L(( t)nf(t);s),n= 1;2;3;:::.
If also lim t!0+f(t)=texists, then
1.14.24Z1
sL(f(t);u)du=Lf(t)
t;s
:
Periodic Functions
Ifa>0 andf(t+a) =f(t) fort>0, then
1.14.25 L(f(t);s) =1
1 e asZa
0e stf(t)dt:
Alternatively if f(t+a) = f(t) fort>0, then
1.14.26 L(f(t);s) =1
1 +e asZa
0e stf(t)dt:
Derivatives
Iff(t) is continuous on [0 ;1) andf0(t) is piecewise
continuous on (0 ;1), then
1.14.27 L(f0(t);s) =sL(f(t);s) f(0+):
Iff(t) andf0(t) are piecewise continuous on [0 ;1)
with discontinuities at (0 =) t0<t1<<tn, then
1.14.28L(f0(t);s) =sL(f(t);s) f(0+)
nX
k=1e stk(f(tk+) f(tk )):
Next, assume f(t),f0(t),:::,f(n 1)(t) are contin-
uous and each satises (1.14.18). Also assume that
f(n)(t) is piecewise continuous on [0 ;1). Then
1.14.29
L
f(n)(t);s
=snL(f(t);s) sn 1f(0+)
sn 2f0(0+) f(n 1)(0+):
Convolution
For Laplace transforms, the convolution of two functions
f(t) andg(t), dened on [0 ;1), is
1.14.30 (fg)(t) =Zt
0f(u)g(t u)du:
Iff(t) andg(t) are piecewise continuous, then
1.14.31 L(fg) =L(f)L(g):
1.14 Integral Transforms 29
Uniqueness
Iff(t) andg(t) are continuous and L(f) =L(g), then
f(t) =g(t).
1.14(iv) Mellin Transform
The Mellin transform of a real- or complex-valued func-
tionf(x) is dened by
1.14.32 M(f;s) =Z1
0xs 1f(x)dx:
Alternative notations for M(f;s) areM(f(x);s)
andM(f).
Ifx 1f(x) is integrable on (0 ;1) for allin
a < < b , then the integral (1.14.32) converges and
M(f;s) is an analytic function of sin the vertical strip
a<<s<b . Moreover, for a<<b ,
1.14.33 lim
t!1M(f;+it) = 0:
Note: Iff(x) is continuous and andare real
numbers such that f(x) =O(x) asx!0+ and
f(x) =O
x
asx!1 , thenx 1f(x) is integrable
on (0;1) for all2( ; ).
Inversion
Suppose the integral (1.14.32) is absolutely convergent
on the line<s=andf(x) is of bounded variation in
a neighborhood of x=u. Then
1.14.34
1
2(f(u+) +f(u )) =1
2ilim
T!1Z+iT
iTu sM(f;s)ds:
Iff(x) is continuous on (0 ;1) andM(f;+it) is
integrable on ( 1;1), then
1.14.35f(x) =1
2iZ+i1
i1x sM(f;s)ds:
Parseval-type Formulas
Supposex f(x) andx 1g(x) are absolutely in-
tegrable on (0 ;1) and either M(g;+it) or
M(f; 1 it) is absolutely integrable on ( 1;1).
Then fory>0,
1.14.36Z1
0f(x)g(yx)dx
=1
2iZ+i1
i1y sM(f; 1 s)M(g;s)ds;
1.14.37Z1
0f(x)g(x)dx
=1
2iZ+i1
i1M(f; 1 s)M(g;s)ds:
Whenfis real and =1
2,
1.14.38Z1
0(f(x))2dx=1
2Z1
1M
f;1
2+it2dt:Convolution
Let
1.14.39 (fg)(x) =Z1
0f(y)gx
ydy
y:
Ifx 1f(x) andx 1g(x) are absolutely integrable on
(0;1), then fors=+it,
1.14.40Z1
0xs 1(fg)(x)dx=M(f;s)M(g;s):
1.14(v) Hilbert Transform
The Hilbert transform of a real-valued function f(t) is
dened in the following equivalent ways:
1.14.41H(f;x) =H(f(t);x) =H(f) =1
Z1
1f(t)
t xdt;
1.14.42H(f;x) = lim
y!0+1
Z1
1t x
(t x)2+y2f(t)dt;
1.14.43H(f;x) = lim
!0+1
Z1
f(x+t) f(x t)
tdt:
Inversion
Supposef(t) is continuously dierentiable on ( 1;1)
and vanishes outside a bounded interval. Then
1.14.44 f(x) = 1
Z1
1H(f;u)
u xdu:
Inequalities
Ifjf(t)jp,p >1, is integrable on ( 1;1), then so is
jH(f;x)jpand
1.14.45Z1
1jH(f;x)jpdxApZ1
1jf(t)jpdt;
whereAp= tan 1
2=p
when 1< p2, or cot 1
2=p
whenp2. These bounds are sharp, and equality holds
whenp= 2.
Fourier Transform
Whenf(t) satises the same conditions as those for
(1.14.44),
1.14.461p
2Z1
1H(f;t)eixtdt= i(signx)F(x);
whereF(x) is given by (1.14.1).
1.14(vi) Stieltjes Transform
The Stieltjes transform of a real-valued function f(t) is
dened by
1.14.47S(f;s) =S(f(t);s) =S(f) =Z1
0f(t)
s+tdt:
Sucient conditions for the integral to converge are
thatsis a positive real number, and f(t) =O
t
ast!1 , where>0.
30 Algebraic and Analytic Methods
If the integral converges, then it converges uniformly
in any compact domain in the complex s-plane not con-
taining any point of the interval ( 1;0]. In this case,
S(f;s) represents an analytic function in the s-plane
cut along the negative real axis, and
1.14.48dm
dsmS(f;s) = ( 1)mm!Z1
0f(t)dt
(s+t)m+1,
m= 0;1;2;::::
Inversion
Iff(t) is absolutely integrable on [0 ;R] for every nite
R, and the integral (1.14.47) converges, then
1.14.49lim
t!0+S(f; it) S(f; +it)
2i
=1
2(f(+) +f( ));
for all values of the positive constant for which the
right-hand side exists.
Laplace Transform
Iff(t) is piecewise continuous on [0 ;1) and the integral
(1.14.47) converges, then
1.14.50 S(f) =L(L(f)):1.14(vii) Tables
Table 1.14.1 : Fourier transforms.
f(t)1p
2Z1
1f(t)eixtdt
(
1;jtj<a;
0;otherwiser
2
sin(ax)
x
e ajtjr
2
a
a2+x2,a>0
te ajtjr
2
2iax
(a2+x2)2,a>0
jtje ajtjr
2
a2 x2
(a2+x2)2,a>0
e ajtj
jtj1=2(a+ (a2+x2)1=2)1=2
(a2+x2)1=2,a>0
sinh(at)
sinh(t)1p
2sina
coshx+ cosa, <
a<
cosh(at)
cosh(t)r
2
cos 1
2a
cosh 1
2x
coshx+ cosa, <
a<
e at2 1p
2ae x2=(4a),a>0
sin
at2
1p
2asinx2
4a
4
,a>0
cos
at2 1p
2acosx2
4a
4
,a>0
1.14 Integral Transforms 31
Table 1.14.2 : Fourier cosine transforms.
f(t)r
2
Z1
0f(t) cos(xt)dt,x>0
(
1;0<ta;
0;otherwiser
2
sin(ax)
x
1
a2+t2r
2e ax
a,<a>0
1
(a2+t2)2r
2(1 +ax)e ax
2a3,<a>0
4a3
4a4+t4pe axsin
ax+1
4
,<a>0
e atr
2
a
a2+x2,<a>0
e at2 1p
2ae x2=(4a),<a>0
sin
at2
1p
2asinx2
4a
4
,a>0
cos
at2 1p
2acosx2
4a
4
,a>0
ln
1 +a2
t2p
21 e ax
x,<a>0
lna2+t2
b2+t2p
2e bx e ax
x,<a>0,
<b>0Table 1.14.3 : Fourier sine transforms.
f(t)r
2
Z1
0f(t) sin(xt)dt,x>0
t 1r
2
t 1=2x 1=2
t 3=22x1=2
t
a2+t2r
2e ax,<a>0
t
(a2+t2)2r
8x
ae ax,<a>0
1
t(a2+t2)r
21 e ax
a2,<a>0
e at
tr
2
arctanx
a
,<a>0
e atr
2
x
a2+x2,<a>0
te atr
2
2ax
(a2+x2)2,<a>0
te at2(2a) 3=2xe x2=(4a),jphaj<1
2
sin(at)
t1p
2lnx+a
x a,a>0
arctant
ar
2e ax
x,a>0
lnt+a
t ap
2sin(ax)
x,a>0
32 Algebraic and Analytic Methods
Table 1.14.4 : Laplace transforms.
f(t)Z1
0e stf(t)dt
11
s,<s>0
tn
n!1
sn+1,<s>0
1p
t1ps,<s>0
e at1
s+a,<(s+a)>0
tne at
n!1
(s+a)n+1,<(s+a)>0
e at e bt
b a1
(s+a)(s+b),a6=b,
<s>