Mathematical_Methods_for_Physicists_7th
PDF · 1206 pages · 10.7 MB
Open PDF file
Commercial textbook (Academic Press/Elsevier, 2013) by George Arfken, Hans Weber and Frank Harris, kept in the archive's folder of downloaded math methods books. The contents list covers infinite series, determinants and matrices, vector analysis, tensors and differential forms, vector spaces, eigenvalue problems, ordinary differential equations and Sturm-Liouville theory, with further chapters beyond the part of the text seen here. No notes by Phil are evident in the extracted text.
AI-written summary; may contain errors.
Extracted text (machine-read; may contain errors)
MATHEMATICAL
METHODS
PHYSICISTS
an
A
ARFKEN, WEBER, wwHARRIS
ArfKen_FM-9780123846549.tex
MATHEMATICAL
METHODS FOR
PHYSICISTS
SEVENTH EDITION
ArfKen_FM-9780123846549.tex
MATHEMATICAL
METHODS FOR
PHYSICISTS
A Comprehensive Guide
SEVENTH EDITION
George B. Arfken
Miami University
Oxford, OH
Hans J. Weber
University of Virginia
Charlottesville, VA
Frank E. Harris
University of Utah, Salt Lake City, UT
and
University of Florida, Gainesville, FL
AMSTERDAM •BOSTON •HEIDELBERG •LONDON
NEW YORK •OXFORD •PARIS •SAN DIEGO
SAN FRANCISCO •SINGAPORE •SYDNEY •TOKYO
Academic Press is an imprint of Elsevier
ArfKen_FM-9780123846549.tex
Academic Press is an imprint of Elsevier
225 Wyman Street, Waltham, MA 02451, USA
The Boulevard, Langford Lane, Kidlington, Oxford, OX5 1GB, UK
© 2013 Elsevier Inc. All rights reserved.
No part of this publication may be reproduced or transmitted in any form or by any means, electronic or
mechanical, including photocopying, recording, or any information storage and retrieval system, without
permission in writing from the publisher. Details on how to seek permission and further information
about the Publisher’s permissions policies and our arrangements with organizations such as the Copyright
Clearance Center and the Copyright Licensing Agency, can be found at our website:
www.elsevier.com/permissions .
This book and the individual contributions contained in it are protected under copyright by the Publisher
(other than as may be noted herein).
Notices
Knowledge and best practice in this field are constantly changing. As new research and experience
broaden our understanding, changes in research methods, professional practices, or medical treatment
may become necessary.
Practitioners and researchers must always rely on their own experience and knowledge in evaluating and
using any information, methods, compounds, or experiments described herein. In using such information
or methods they should be mindful of their own safety and the safety of others, including parties for
whom they have a professional responsibility.
To the fullest extent of the law, neither the Publisher nor the authors, contributors, or editors, assume any
liability for any injury and/or damage to persons or property as a matter of products liability, negligence
or otherwise, or from any use or operation of any methods, products, instructions, or ideas contained in
the material herein.
Library of Congress Cataloging-in-Publication Data
Application submitted.
British Library Cataloguing-in-Publication Data
A catalogue record for this book is available from the British Library.
ISBN: 978-0-12-384654-9
For information on all Academic Press publications,
visit our website: www.elsevierdirect.com
Typeset by : diacriTech, India
Printed in the United States of America
12 13 14 9 8 7 6 5 4 3 2 1
v
CONTENTS
PREFACE ............................................................................................................................... ............ XI
1. MATHEMATICAL PRELIMINARIES ...................................................................................................... 1
1.1. Infinite Series .................................................................................................................. 1
1.2. Series of Functions ....................................................................................................... 21
1.3. Binomial Theorem ........................................................................................................ 33
1.4. Mathematical Induction ............................................................................................... 40
1.5. Operations of Series Expansions of Functions .............................................................. 41
1.6. Some Important Series ................................................................................................. 45
1.7. Vectors ......................................................................................................................... 46
1.8. Complex Numbers and Functions ................................................................................. 53
1.9. Derivatives and Extrema .............................................................................................. 62
1.10. Evaluation of Integrals ................................................................................................. 65
1.11. Dirac Delta Functions ................................................................................................... 75
Additional Readings .................................................................................................... 82
2. DETERMINANTS AND MATRICES .................................................................................................... 83
2.1 Determinants ............................................................................................................... 83
2.2 Matrices ....................................................................................................................... 95
Additional Readings .................................................................................................. 121
3. VECTOR ANALYSIS .................................................................................................................... 123
3.1 Review of Basics Properties ........................................................................................ 124
3.2 Vector in 3 ‐ D Spaces ................................................................................................. 126
3.3 Coordinate Transformations ...................................................................................... 133
vi
3.4 Rotations in 3 ........................................................................................................ 139
3.5 Differential Vector Operators ..................................................................................... 143
3.6 Differential Vector Operators: Further Properties ...................................................... 153
3.7 Vector Integrations .................................................................................................... 159
3.8 Integral Theorems ...................................................................................................... 164
3.9 Potential Theory ......................................................................................................... 170
3.10 Curvilinear Coordinates .............................................................................................. 182
Additional Readings .................................................................................................. 203
4. TENSOR AND DIFFERENTIAL FORMS .............................................................................................. 205
4.1 Tensor Analysis .......................................................................................................... 205
4.2 Pseudotensors, Dual Tensors ..................................................................................... 215
4.3 Tensor in General Coordinates ................................................................................... 218
4.4 Jacobians .................................................................................................................... 227
4.5 Differential Forms ...................................................................................................... 232
4.6 Differentiating Forms ................................................................................................. 238
4.7 Integrating Forms ...................................................................................................... 243
Additional Readings .................................................................................................. 249
5. VECTOR SPACES ....................................................................................................................... 251
5.1 Vector in Function Spaces .......................................................................................... 251
5.2 Gram ‐ Schmidt Orthogonalization ............................................................................. 269
5.3 Operators ................................................................................................................... 275
5.4 Self‐Adjoint Operators ................................................................................................ 283
5.5 Unitary Operators ...................................................................................................... 287
5.6 Transformations of Operators.................................................................................... 292
5.7 Invariants ................................................................................................................... 294
5.8 Summary – Vector Space Notations ........................................................................... 296
Additional Readings .................................................................................................. 297
6. EIGENVALUE PROBLEMS ............................................................................................................. 299
6.1 Eigenvalue Equations ................................................................................................. 299
6.2 Matrix Eigenvalue Problems ...................................................................................... 301
6.3 Hermitian Eigenvalue Problems ................................................................................. 310
6.4 Hermitian Matrix Diagonalization ............................................................................. 311
6.5 Normal Matrices ........................................................................................................ 319
Additional Readings .................................................................................................. 328
7. ORDINARY DIFFERENTIAL EQUATIONS ........................................................................................... 329
7.1 Introduction ............................................................................................................... 329
7.2 First ‐ Order Equations ............................................................................................... 331
7.3 ODEs with Constant Coefficients ................................................................................ 342
7.4 Second‐Order Linear ODEs ......................................................................................... 343
7.5 Series Solutions‐ Frobenius‘ Method .......................................................................... 346
7.6 Other Solutions .......................................................................................................... 358
vii
7.7 Inhomogeneous Linear ODEs ..................................................................................... 375
7.8 Nonlinear Differential Equations ................................................................................ 377
Additional Readings .................................................................................................. 380
8. STURM – LIOUVILLE THEORY ....................................................................................................... 381
8.1 Introduction ............................................................................................................... 381
8.2 Hermitian Operators .................................................................................................. 384
8.3 ODE Eigenvalue Problems .......................................................................................... 389
8.4 Variation Methods ..................................................................................................... 395
8.5 Summary, Eigenvalue Problems ................................................................................. 398
Additional Readings .................................................................................................. 399
9. PARTIAL DIFFERENTIAL EQUATIONS .............................................................................................. 401
9.1 Introduction ............................................................................................................... 401
9.2 First ‐ Order Equations ............................................................................................... 403
9.3 Second – Order Equations .......................................................................................... 409
9.4 Separation of Variables ............................................................................................. 414
9.5 Laplace and Poisson Equations .................................................................................. 433
9.6 Wave Equations ......................................................................................................... 435
9.7 Heat – Flow, or Diffution PDE ..................................................................................... 437
9.8 Summary .................................................................................................................... 444
Additional Readings .................................................................................................. 445
10. GREEN’ FUNCTIONS .................................................................................................................. 447
10.1 One – Dimensional Problems .................................................................................... 448
10.2 Problems in Two and Three Dimensions .................................................................... 459
Additional Readings .................................................................................................. 467
11. COMPLEX VARIABLE THEORY ...................................................................................................... 469
11.1 Complex Variables and Functions .............................................................................. 470
11.2 Cauchy – Riemann Conditions .................................................................................... 471
11.3 Cauchy’s Integral Theorem ........................................................................................ 477
11.4 Cauchy’s Integral Formula ......................................................................................... 486
11.5 Laurent Expansion ...................................................................................................... 492
11.6 Singularities ............................................................................................................... 497
11.7 Calculus of Residues ................................................................................................... 509
11.8 Evaluation of Definite Integrals .................................................................................. 522
11.9 Evaluation of Sums ..................................................................................................... 544
11.10 Miscellaneous Topics .................................................................................................. 547
Additional Readings .................................................................................................. 550
12. FURTHER TOPICS IN ANALYSIS ..................................................................................................... 551
12.1 Orthogonal Polynomials ............................................................................................. 551
12.2 Bernoulli Numbers ..................................................................................................... 560
12.3 Euler – Maclaurin Integration Formula ...................................................................... 567
12.4 Dirichlet Series ........................................................................................................... 571
viii
12.5 Infinite Products ......................................................................................................... 574
12.6 Asymptotic Series ....................................................................................................... 577
12.7 Method of Steepest Descents ..................................................................................... 585
12.8 Dispertion Relations ................................................................................................... 591
Additional Readings .................................................................................................. 598
13. GAMMA FUNCTION ................................................................................................................... 599
13.1 Definitions, Properties ................................................................................................ 599
13.2 Digamma and Polygamma Functions ........................................................................ 610
13.3 The Beta Function ...................................................................................................... 617
13.4 Stirling’s Series ........................................................................................................... 622
13.5 Riemann Zeta Function .............................................................................................. 626
13.6 Other Ralated Function .............................................................................................. 633
Additional Readings .................................................................................................. 641
14. BESSEL FUNCTIONS ................................................................................................................... 643
14.1 Bessel Functions of the First kind, Jν(x) ....................................................................... 643
14.2 Orthogonality ............................................................................................................. 661
14.3 Neumann Functions, Bessel Functions of the Second kind ........................................ 667
14.4 Hankel Functions ........................................................................................................ 674
14.5 Modified Bessel Functions, Iν(x) and Kν(x) ................................................................ 680
14.6 Asymptotic Expansions .............................................................................................. 688
14.7 Spherical Bessel Functions ......................................................................................... 698
Additional Readings .................................................................................................. 713
15. LEGENDRE FUNCTIONS ............................................................................................................... 715
15.1 Legendre Polynomials ................................................................................................ 716
15.2 Orthogonality ............................................................................................................. 724
15.3 Physical Interpretation of Generating Function ......................................................... 736
15.4 Associated Legendre Equation ................................................................................... 741
15.5 Spherical Harmonics................................................................................................... 756
15.6 Legendre Functions of the Second Kind ...................................................................... 766
Additional Readings .................................................................................................. 771
16. ANGULAR MOMENTUM ............................................................................................................. 773
16.1 Angular Momentum Operators .................................................................................. 774
16.2 Angular Momentum Coupling .................................................................................... 784
16.3 Spherical Tensors ....................................................................................................... 796
16.4 Vector Spherical Harmonics ....................................................................................... 809
Additional Readings .................................................................................................. 814
17. GROUP THEORY ....................................................................................................................... 815
17.1 Introduction to Group Theory .................................................................................... 815
17.2 Representation of Groups .......................................................................................... 821
17.3 Symmetry and Physics ................................................................................................ 826
17.4 Discrete Groups .......................................................................................................... 830
ix
17.5 Direct Products ........................................................................................................... 837
17.6 Simmetric Group ........................................................................................................ 840
17.7 Continous Groups ....................................................................................................... 845
17.8 Lorentz Group ............................................................................................................ 862
17.9 Lorentz Covariance of Maxwell’s Equantions ............................................................. 866
17.10 Space Groups ............................................................................................................. 869
Additional Readings .................................................................................................. 870
18. MORE SPECIAL FUNCTIONS ......................................................................................................... 871
18.1 Hermite Functions ...................................................................................................... 871
18.2 Applications of Hermite Functions ............................................................................. 878
18.3 Laguerre Functions ..................................................................................................... 889
18.4 Chebyshev Polynomials .............................................................................................. 899
18.5 Hypergeometric Functions ......................................................................................... 911
18.6 Confluent Hypergeometric Functions ......................................................................... 917
18.7 Dilogarithm ................................................................................................................ 923
18.8 Elliptic Integrals .......................................................................................................... 927
Additional Readings .................................................................................................. 932
19. FOURIER SERIES ........................................................................................................................ 935
19.1 General Properties ..................................................................................................... 935
19.2 Application of Fourier Series ...................................................................................... 949
19.3 Gibbs Phenomenon .................................................................................................... 957
Additional Readings .................................................................................................. 962
20. INTEGRAL TRANSFORMS ............................................................................................................. 963
20.1 Introduction ............................................................................................................... 963
20.2 Fourier Transforms ..................................................................................................... 966
20.3 Properties of Fourier Transforms ............................................................................... 980
20.4 Fourier Convolution Theorem ..................................................................................... 985
20.5 Signal – Proccesing Applications ................................................................................ 997
20.6 Discrete Fourier Transforms ..................................................................................... 1002
20.7 Laplace Transforms .................................................................................................. 1008
20.8 Properties of Laplace Transforms ............................................................................. 1016
20.9 Laplace Convolution Transforms .............................................................................. 1034
20.10 Inverse Laplace Transforms ...................................................................................... 1038
Additional Readings ................................................................................................ 1045
21. INTEGRAL EQUATIONS ............................................................................................................. 1047
21.1 Introduction ............................................................................................................. 1047
21.2 Some Special Methods ............................................................................................. 1053
21.3 Neumann Series ....................................................................................................... 1064
21.4 Hilbert – Schmidt Theory .......................................................................................... 1069
Additional Readings ................................................................................................ 1079
x
22. CALCULUS OF VARIATIONS ........................................................................................................ 1081
22.1 Euler Equation .......................................................................................................... 1081
22.2 More General Variations .......................................................................................... 1096
22.3 Constrained Minima/Maxima .................................................................................. 1107
22.4 Variation with Constraints ....................................................................................... 1111
Additional Readings ................................................................................................ 1124
23. PROBABILITY AND STATISTICS .................................................................................................... 1125
23.1 Probability: Definitions, Simple Properties ............................................................... 1126
23.2 Random Variables .................................................................................................... 1134
23.3 Binomial Distribution ............................................................................................... 1148
23.4 Poisson Distribution ................................................................................................. 1151
23.5 Gauss’ Nomal Distribution ....................................................................................... 1155
23.6 Transformation of Random Variables ...................................................................... 1159
23.7 Statistics ................................................................................................................... 1165
Additional Readings ................................................................................................ 1179
INDEX ............................................................................................................................... ............ 1181
ArfKen_Preface-9780123846549.tex
PREFACE
This, the seventh edition of Mathematical Methods for Physicists , maintains the tradition
set by the six previous editions and continues to have as its objective the presentation of all
the mathematical methods that aspiring scientists and engineers are likely to encounter as
students and beginning researchers. While the organization of this edition differs in some
respects from that of its predecessors, the presentation style remains the same: Proofs are
sketched for almost all the mathematical relations introduced in the book, and they are
accompanied by examples that illustrate how the mathematics applies to real-world physics
problems. Large numbers of exercises provide opportunities for the student to develop skill
in the use of the mathematical concepts and also show a wide variety of contexts in which
the mathematics is of practical use in physics.
As in the previous editions, the mathematical proofs are not what a mathematician would
consider rigorous, but they nevertheless convey the essence of the ideas involved, and also
provide some understanding of the conditions and limitations associated with the rela-
tionships under study. No attempt has been made to maximize generality or minimize the
conditions necessary to establish the mathematical formulas, but in general the reader is
warned of limitations that are likely to be relevant to use of the mathematics in physics
contexts.
TO THE STUDENT
The mathematics presented in this book is of no use if it cannot be applied with some skill,
and the development of that skill cannot be acquired passively, e.g., by simply reading the
text and understanding what is written, or even by listening attentively to presentations
by your instructor. Your passive understanding needs to be supplemented by experience
in using the concepts, in deciding how to convert expressions into useful forms, and in
developing strategies for solving problems. A considerable body of background knowledge
xi
ArfKen_Preface-9780123846549.tex
xii Preface
needs to be built up so as to have relevant mathematical tools at hand and to gain experi-
ence in their use. This can only happen through the solving of problems, and it is for this
reason that the text includes nearly 1400 exercises, many with answers (but not methods
of solution). If you are using this book for self-study, or if your instructor does not assign
a considerable number of problems, you would be well advised to work on the exercises
until you are able to solve a reasonable fraction of them.
This book can help you to learn about mathematical methods that are important in
physics, as well as serve as a reference throughout and beyond your time as a student.
It has been updated to make it relevant for many years to come.
WHAT’SNEW
This seventh edition is a substantial and detailed revision of its predecessor; every word of
the text has been examined and its appropriacy and that of its placement has been consid-
ered. The main features of the revision are: (1) An improved order of topics so as to reduce
the need to use concepts before they have been presented and discussed. (2) An introduc-
tory chapter containing material that well-prepared students might be presumed to know
and which will be relied on (without much comment) in later chapters, thereby reducing
redundancy in the text; this organizational feature also permits students with weaker back-
grounds to get themselves ready for the rest of the book. (3) A strengthened presentation of
topics whose importance and relevance has increased in recent years; in this category are
the chapters on vector spaces, Green’s functions, and angular momentum, and the inclu-
sion of the dilogarithm among the special functions treated. (4) More detailed discussion
of complex integration to enable the development of increased skill in using this extremely
important tool. (5) Improvement in the correlation of exercises with the exposition in the
text, and the addition of 271 new exercises where they were deemed needed. (6) Addition
of a few steps to derivations that students found difficult to follow. We do not subscribe
to the precept that “advanced” means “compressed” or “difficult.” Wherever the need has
been recognized, material has been rewritten to enhance clarity and ease of understanding.
In order to accommodate new and expanded features, it was necessary to remove or
reduce in emphasis some topics with significant constituencies. For the most part, the
material thereby deleted remains available to instructors and their students by virtue of
its inclusion in the on-line supplementary material for this text. On-line only are chapters
on Mathieu functions, on nonlinear methods and chaos, and a new chapter on periodic sys-
tems. These are complete and newly revised chapters, with examples and exercises, and
are fully ready for use by students and their instuctors. Because there seems to be a sig-
nificant population of instructors who wish to use material on infinite series in much the
same organizational pattern as in the sixth edition, that material (largely the same as in
the print edition, but not all in one place) has been collected into an on-line infinite series
chapter that provides this material in a single unit. The on-line material can be accessed at
www.elsevierdirect.com.
ArfKen_Preface-9780123846549.tex
Preface xiii
PATHWAYS THROUGH THE MATERIAL
This book contains more material than an instructor can expect to cover, even in a
two-semester course. The material not used for instruction remains available for reference
purposes or when needed for specific projects. For use with less fully prepared students,
a typical semester course might use Chapters 1 to 3, maybe part of Chapter 4, certainly
Chapters 5 to 7, and at least part of Chapter 11. A standard graduate one-semester course
might have the material in Chapters 1 to 3 as prerequisite, would cover at least part of
Chapter 4, all of Chapters 5 through 9, Chapter 11, and as much of Chapters 12 through
16 and/or 18 as time permits. A full-year course at the graduate level might supplement
the foregoing with several additional chapters, almost certainly including Chapter 20 (and
Chapter 19 if not already familiar to the students), with the actual choice dependent on
the institution’s overall graduate curriculum. Once Chapters 1 to 3, 5 to 9, and 11 have
been covered or their contents are known to the students, most selections from the remain-
ing chapters should be reasonably accessible to students. It would be wise, however, to
include Chapters 15 and 16 if Chapter 17 is selected.
ACKNOWLEDGMENTS
This seventh edition has benefited from the advice and help of many people; valuable
advice was provided both by anonymous reviewers and from interaction with students at
the University of Utah. At Elsevier, we received substantial assistance from our Acqui-
sitions Editor Patricia Osborn and from Editorial Project Manager Kathryn Morrissey;
production was overseen skillfully by Publishing Services Manager Jeff Freeland. FEH
gratefully acknowledges the support and encouragement of his friend and partner Sharon
Carlson. Without her, he might not have had the energy and sense of purpose needed to
help bring this project to a timely fruition.
ArfKen_Ch01-9780123846549.tex
CHAPTER 1
MATHEMATICAL
PRELIMINARIES
This introductory chapter surveys a number of mathematical techniques that are needed
throughout the book. Some of the topics (e.g., complex variables) are treated in more detail
in later chapters, and the short survey of special functions in this chapter is supplemented
by extensive later discussion of those of particular importance in physics (e.g., Bessel func-
tions). A later chapter on miscellaneous mathematical topics deals with material requiring
more background than is assumed at this point. The reader may note that the Additional
Readings at the end of this chapter include a number of general references on mathemati-
cal methods, some of which are more advanced or comprehensive than the material to be
found in this book.
1.1 I NFINITE SERIES
Perhaps the most widely used technique in the physicist’s toolbox is the use of infinite
series (i.e., sums consisting formally of an infinite number of terms) to represent functions,
to bring them to forms facilitating further analysis, or even as a prelude to numerical eval-
uation. The acquisition of skill in creating and manipulating series expansions is therefore
an absolutely essential part of the training of one who seeks competence in the mathemat-
ical methods of physics, and it is therefore the first topic in this text. An important part of
this skill set is the ability to recognize the functions represented by commonly encountered
expansions, and it is also of importance to understand issues related to the convergence of
infinite series.
1
Mathematical Methods for Physicists.
©2013 Elsevier Inc. All rights reserved.
ArfKen_Ch01-9780123846549.tex
2 Chapter 1 Mathematical Preliminaries
Fundamental Concepts
The usual way of assigning a meaning to the sum of an infinite number of terms is by
introducing the notion of partial sums. If we have an infinite sequence of terms u1,u2,u3,
u4,u5, . . . , we define the ith partial sum as
siDiX
nD1un: (1.1)
This is a finite summation and offers no difficulties. If the partial sums siconverge to a
finite limit as i!1 ,
lim
i!1siDS; (1.2)
the infinite seriesP1
nD1unis said to be convergent and to have the value S. Note that
wedefine the infinite series as equal to Sand that a necessary condition for convergence
to a limit is that limn!1unD0. This condition, however, is not sufficient to guarantee
convergence.
Sometimes it is convenient to apply the condition in Eq. (1.2) in a form called the
Cauchy criterion, namely that for each " >0there is a fixed number Nsuch that
jsj sij<"for all iandjgreater than N. This means that the partial sums must cluster
together as we move far out in the sequence.
Some series diverge, meaning that the sequence of partial sums approaches 1; others
may have partial sums that oscillate between two values, as for example,
1X
nD1unD1 1C1 1C1 . 1/nC:
This series does not converge to a limit, and can be called oscillatory. Often the term
divergent is extended to include oscillatory series as well. It is important to be able to
determine whether, or under what conditions, a series we would like to use is convergent.
Example 1.1.1 THEGEOMETRIC SERIES
The geometric series, starting with u0D1and with a ratio of successive terms rD
unC1=un, has the form
1CrCr2Cr3CC rn 1C:
Itsnth partial sum sn(that of the first nterms) is1
snD1 rn
1 r: (1.3)
Restricting attention to jrj<1, so that for large n,rnapproaches zero, and snpossesses
the limit
limn!1snD1
1 r; (1.4)
1Multiply and divide snDPn 1
mD0rmby1 r.
ArfKen_Ch01-9780123846549.tex
1.1 In/f_inite Series 3
showing that forjrj<1, the geometric series converges. It clearly diverges (or is oscilla-
tory) forjrj1, as the individual terms do not then approach zero at large n.
Example 1.1.2 THEHARMONIC SERIES
As a second and more involved example, we consider the harmonic series
1X
nD11
nD1C1
2C1
3C1
4CC1
nC: (1.5)
The terms approach zero for large n, i.e., limn!11=nD0, but this is not sufficient to
guarantee convergence. If we group the terms (without changing their order) as
1C1
2C1
3C1
4
C1
5C1
6C1
7C1
8
C1
9CC1
16
C;
each pair of parentheses encloses pterms of the form
1
pC1C1
pC2CC1
pCp>p
2pD1
2:
Forming partial sums by adding the parenthetical groups one by one, we obtain
s1D1;s2D3
2;s3>4
2;s4>5
2;:::; sn>nC1
2;
and we are forced to the conclusion that the harmonic series diverges.
Although the harmonic series diverges, its partial sums have relevance among other
places in number theory, where HnDPn
mD1m 1are sometimes referred to as harmonic
numbers.
We now turn to a more detailed study of the convergence and divergence of series,
considering here series of positive terms. Series with terms of both signs are treated later.
Comparison Test
If term by term a series of terms unsatisfies 0unan, where the anform a convergent
series, then the seriesP
nunis also convergent. Letting siandsjbe partial sums of the
useries, with j>i, the difference sj siisPj
nDiC1un, and this is smaller than the
corresponding quantity for the aseries, thereby proving convergence. A similar argument
shows that if term by term a series of terms vnsatisfies 0bnvn, where the bnform a
divergent series, thenP
nvnis also divergent.
For the convergent series anwe already have the geometric series, whereas the harmonic
series will serve as the divergent comparison series bn. As other series are identified as
either convergent or divergent, they may also be used as the known series for comparison
tests.
ArfKen_Ch01-9780123846549.tex
4 Chapter 1 Mathematical Preliminaries
Example 1.1.3 A DIVERGENT SERIES
TestP1
nD1n p,pD0:999 , for convergence. Since n 0:999>n 1andbnDn 1forms
the divergent harmonic series, the comparison test shows thatP
nn 0:999is divergent.
Generalizing,P
nn pis seen to be divergent for all p1.
Cauchy Root Test
If.an/1=nr<1for all sufficiently large n, with rindependent of n, thenP
nanis
convergent. If .an/1=n1for all sufficiently large n, thenP
nanis divergent.
The language of this test emphasizes an important point: The convergence or divergence
of a series depends entirely on what happens for large n. Relative to convergence, it is the
behavior in the large- nlimit that matters.
The first part of this test is verified easily by raising .an/1=nto the nth power. We get
anrn<1:
Since rnis just the nth term in a convergent geometric series,P
nanis convergent by the
comparison test. Conversely, if .an/1=n1, then an1and the series must diverge. This
root test is particularly useful in establishing the properties of power series (Section 1.2).
D’Alembert (or Cauchy) Ratio Test
IfanC1=anr<1for all sufficiently large nandris independent of n, thenP
nanis
convergent. If anC1=an1for all sufficiently large n, thenP
nanis divergent.
This test is established by direct comparison with the geometric series .1CrCr2C/.
In the second part, anC1anand divergence should be reasonably obvious. Although not
quite as sensitive as the Cauchy root test, this D’Alembert ratio test is one of the easiest to
apply and is widely used. An alternate statement of the ratio test is in the form of a limit: If
limn!1anC1
an8
><
>:<1; convergence,
>1; divergence,
D1; indeterminate.(1.6)
Because of this final indeterminate possibility, the ratio test is likely to fail at crucial points,
and more delicate, sensitive tests then become necessary. The alert reader may wonder how
this indeterminacy arose. Actually it was concealed in the first statement, anC1=anr<
1. We might encounter anC1=an<1for all finite nbut be unable to choose an r<1
and independent of n such that anC1=anrfor all sufficiently large n. An example is
provided by the harmonic series, for which
anC1
anDn
nC1<1:
Since
limn!1anC1
anD1;
no fixed ratio r<1exists and the test fails.
ArfKen_Ch01-9780123846549.tex
1.1 In/f_inite Series 5
Example 1.1.4 D’ALEMBERT RATIO TEST
TestP
nn=2nfor convergence. Applying the ratio test,
anC1
anD.nC1/=2nC1
n=2nD1
2nC1
n:
Since
anC1
an3
4forn2;
we have convergence.
Cauchy (or Maclaurin) Integral Test
This is another sort of comparison test, in which we compare a series with an integral.
Geometrically, we compare the area of a series of unit-width rectangles with the area under
a curve.
Letf.x/be a continuous, monotonic decreasing function in which f.n/Dan. ThenP
nanconverges ifR1
1f.x/dx is finite and diverges if the integral is infinite. The ith
partial sum is
siDiX
nD1anDiX
nD1f.n/:
But, because f.x/is monotonic decreasing, see Fig. 1.1(a),
siiC1Z
1f.x/dx:
On the other hand, as shown in Fig. 1.1(b),
si a1iZ
1f.x/dx:
Taking the limit as i!1 , we have
1Z
1f.x/dx1X
nD1an1Z
1f.x/dxCa1: (1.7)
Hence the infinite series converges or diverges as the corresponding integral converges or
diverges.
This integral test is particularly useful in setting upper and lower bounds on the remain-
der of a series after some number of initial terms have been summed. That is,
1X
nD1anDNX
nD1anC1X
nDNC1an; (1.8)
ArfKen_Ch01-9780123846549.tex
6 Chapter 1 Mathematical Preliminaries
4 3 2 1f(x) f(x)
(a)xf(1)=a1 f(1)=a1
f(2)=a2
4 3 2 1
(b)xi=
FIGURE 1.1 (a) Comparison of integral and sum-blocks leading. (b) Comparison of
integral and sum-blocks lagging.
and
1Z
NC1f.x/dx1X
nDNC1an1Z
NC1f.x/dxCaNC1: (1.9)
To free the integral test from the quite restrictive requirement that the interpolating func-
tion f.x/be positive and monotonic, we shall show that for any function f.x/with a
continuous derivative, the infinite series is exactly represented as a sum of two integrals:
N2X
nDN1C1f.n/DN2Z
N1f.x/dxCN2Z
N1.x TxU/f0.x/dx: (1.10)
HereTxUis the integral part of x, i.e., the largest integer x, sox TxUvaries sawtoothlike
between 0 and 1. Equation (1.10) is useful because if both integrals in Eq. (1.10) converge,
the infinite series also converges, while if one integral converges and the other does not,
the infinite series diverges. If both integrals diverge, the test fails unless it can be shown
whether the divergences of the integrals cancel against each other.
We need now to establish Eq. (1.10). We manipulate the contributions to the second
integral as follows:
1. Using integration by parts, we observe that
N2Z
N1x f0.x/dxDN2f.N2/ N1f.N1/ N2Z
N1f.x/dx:
2. We evaluate
N2Z
N1TxUf0.x/dxDN2 1X
nDN1nnC1Z
nf0.x/dxDN2 1X
nDN1nh
f.nC1/ f.n/i
D N2X
nDN1C1f.n/ N1f.N1/CN2f.N2/:
Subtracting the second of these equations from the first, we arrive at Eq. (1.10).
ArfKen_Ch01-9780123846549.tex
1.1 In/f_inite Series 7
An alternative to Eq. (1.10) in which the second integral has its sawtooth shifted to be
symmetrical about zero (and therefore perhaps smaller) can be derived by methods similar
to those used above. The resulting formula is
N2X
nDN1C1f.n/DN2Z
N1f.x/dxCN2Z
N1.x TxU 1
2/f0.x/dx
C1
2h
f.N2/ f.N1/i
:(1.11)
Because they do not use a monotonicity requirement, Eqs. (1.10) and(1.11) can be
applied to alternating series, and even those with irregular sign sequences.
Example 1.1.5 RIEMANN ZETA FUNCTION
The Riemann zeta function is defined by
.p/D1X
nD1n p; (1.12)
providing the series converges. We may take f.x/Dx p, and then
1Z
1x pdxDx pC1
pC11
xD1;p6D1;
Dlnx1
xD1; pD1:
The integral and therefore the series are divergent for p1, and convergent for p>1.
Hence Eq. (1.12) should carry the condition p>1. This, incidentally, is an independent
proof that the harmonic series ( pD1) diverges logarithmically. The sum of the first million
termsP1;000;000
nD1n 1is only 14:392 726:
While the harmonic series diverges, the combination
Dlimn!1 nX
mD1m 1 lnn!
(1.13)
converges, approaching a limit known as the Euler-Mascheroni constant.
Example 1.1.6 A SLOWLY DIVERGING SERIES
Consider now the series
SD1X
nD21
nlnn:
ArfKen_Ch01-9780123846549.tex
8 Chapter 1 Mathematical Preliminaries
We form the integral
1Z
21
xlnxdxD1Z
xD2dlnx
lnxDln lnx1
xD2;
which diverges, indicating that Sis divergent. Note that the lower limit of the integral is
in fact unimportant so long as it does not introduce any spurious singularities, as it is the
large- xbehavior that determines the convergence. Because nlnn>n, the divergence is
slower than that of the harmonic series. But because lnnincreases more slowly than n",
where"can have an arbitrarily small positive value, we have divergence even though the
seriesP
nn .1C"/converges.
More Sensitive Tests
Several tests more sensitive than those already examined are consequences of a theorem
by Kummer. Kummer’s theorem, which deals with two series of finite positive terms, un
andan, states:
1. The seriesP
nunconverges if
limn!1
anun
unC1 anC1
C>0; (1.14)
where Cis a constant. This statement is equivalent to a simple comparison test if the
seriesP
na 1
nconverges, and imparts new information only if that sum diverges. The
more weaklyP
na 1
ndiverges, the more powerful the Kummer test will be.
2. IfP
na 1
ndiverges and
limn!1
anun
unC1 anC1
0; (1.15)
thenP
nundiverges.
The proof of this powerful test is remarkably simple. Part 2 follows immediately from
the comparison test. To prove Part 1, write cases of Eq. (1.14) fornDNC1through any
larger n, in the following form:
uNC1.aNuN aNC1uNC1/=C;
uNC2.aNC1uNC1 aNC2uNC2/=C;
:::::::::::::::::::::::::::;
un.an 1un 1 anun/=C:
ArfKen_Ch01-9780123846549.tex
1.1 In/f_inite Series 9
Adding, we get
nX
iDNC1uiaNuN
C anun
C(1.16)
<aNuN
C: (1.17)
This shows that the tail of the seriesP
nunis bounded, and that series is therefore proved
convergent when Eq. (1.14) is satisfied for all sufficiently large n.
Gauss’ test is an application of Kummer’s theorem to series un>0when the ratios of
successive unapproach unity and the tests previously discussed yield indeterminate results.
If for large n
un
unC1D1Ch
nCB.n/
n2; (1.18)
where B.n/is bounded for nsufficiently large, then the Gauss test states thatP
nuncon-
verges for h>1and diverges for h1: There is no indeterminate case here.
The Gauss test is extremely sensitive, and will work for all troublesome series the physi-
cist is likely to encounter. To confirm it using Kummer’s theorem, we take anDnlnn. The
seriesP
na 1
nis weakly divergent, as already established in Example 1.1.6.
Taking the limit on the left side of Eq. (1.14), we have
limn!1
nlnn
1Ch
nCB.n/
n2
.nC1/ln.nC1/
Dlimn!1
.nC1/lnnC.h 1/lnnCB.n/lnn
n .nC1/ln.nC1/
Dlimn!1
.nC1/lnnC1
n
C.h 1/lnn
: (1.19)
Forh<1, both terms of Eq. (1.19) are negative, thereby signaling a divergent case of
Kummer’s theorem; for h>1, the second term of Eq. (1.19) dominates the first and is pos-
itive, indicating convergence. At hD1, the second term vanishes, and the first is inherently
negative, thereby indicating divergence.
Example 1.1.7 LEGENDRE SERIES
The series solution for the Legendre equation (encountered in Chapter 7) has successive
terms whose ratio under certain conditions is
a2jC2
a2jD2j.2jC1/
.2jC1/.2jC2/:
To place this in the form now being used, we define ujDa2jand write
uj
ujC1D.2jC1/.2jC2/
2j.2jC1/ :
ArfKen_Ch01-9780123846549.tex
10 Chapter 1 Mathematical Preliminaries
In the limit of large j, the constant becomes negligible (in the language of the Gauss test,
it contributes to an extent B.j/=j2, where B.j/is bounded). We therefore have
uj
ujC1!2jC2
2jCB.j/
j2D1C1
jCB.j/
j2: (1.20)
The Gauss test tells us that this series is divergent.
Exercises
1.1.1 (a) Prove that if limn!1npunDA<1;p>1, the seriesP1
nD1unconverges.
(b) Prove that if limn!1nunDA>0, the series diverges. (The test fails for AD0.)
These two tests, known as limit tests, are often convenient for establishing the
convergence of a series. They may be treated as comparison tests, comparing with
X
nn q;1q<p:
1.1.2 Iflimn!1bn
anDK, a constant with 0<K<1, show that6nbnconverges or diverges
with6an.
Hint. If6anconverges, rescale bntob0
nDbn
2K. If6nandiverges, rescale to b00
nD2bn
K.
1.1.3 (a) Show that the seriesP1
nD21
n.lnn/2converges.
(b) By direct additionP100;000
nD2Tn.lnn/2U 1D2:02288 . Use Eq. (1.9) to make a five-
significant-figure estimate of the sum of this series.
1.1.4 Gauss’ test is often given in the form of a test of the ratio
un
unC1Dn2Ca1nCa0
n2Cb1nCb0:
For what values of the parameters a1andb1is there convergence? divergence?
ANS: Convergent for a1 b1>1,
divergent for a1 b11.
1.1.5 Test for convergence
(a)1X
nD2.lnn/ 1(d)1X
nD1Tn.nC1/U 1=2
(b)1X
nD1nW
10n(e)1X
nD01
2nC1
(c)1X
nD11
2n.2nC1/
ArfKen_Ch01-9780123846549.tex
1.1 In/f_inite Series 11
1.1.6 Test for convergence
(a)1X
nD11
n.nC1/(d)1X
nD1ln
1C1
n
(b)1X
nD21
nlnn(e)1X
nD11
nn1=n
(c)1X
nD11
n2n
1.1.7 For what values of pandqwillP1
nD21
np.lnn/qconverge?
ANS: Convergent for(p>1;allq;
pD1;q>1;divergent for(p<1; allq;
pD1; q1:
1.1.8 GivenP1;000
nD1n 1D7:485 470:::set upper and lower bounds on the Euler-Mascheroni
constant.
ANS: 0:5767<
< 0:5778 .
1.1.9 (From Olbers’ paradox.) Assume a static universe in which the stars are uniformly
distributed. Divide all space into shells of constant thickness; the stars in any one shell
by themselves subtend a solid angle of !0.Allowing for the blocking out of distant
stars by nearer stars, show that the total net solid angle subtended by all stars, shells
extending to infinity, is exactly 4. [Therefore the night sky should be ablaze with
light. For more details, see E. Harrison, Darkness at Night: A Riddle of the Universe.
Cambridge, MA: Harvard University Press (1987).]
1.1.10 Test for convergence
1X
nD1135.2n 1/
246.2n/2
D1
4C9
64C25
256C:
Alternating Series
In previous subsections we limited ourselves to series of positive terms. Now, in contrast,
we consider infinite series in which the signs alternate. The partial cancellation due to
alternating signs makes convergence more rapid and much easier to identify. We shall
prove the Leibniz criterion, a general condition for the convergence of an alternating series.
For series with more irregular sign changes, the integral test of Eq. (1.10) is often helpful.
TheLeibniz criterion applies to series of the formP1
nD1. 1/nC1anwith an>0, and
states that if anismonotonically decreasing (for sufficiently large n) and limn!1anD0,
then the series converges. To prove this theorem, note that the remainder R2nof the series
beyond s2n, the partial sum after 2nterms, can be written in two alternate ways:
R2nD.a2nC1 a2nC2/C.a2nC3 a2nC4/C
Da2nC1 .a2nC2 a2nC3/ .a2nC4 a2nC5/ :
ArfKen_Ch01-9780123846549.tex
12 Chapter 1 Mathematical Preliminaries
Since the anare decreasing, the first of these equations implies R2n>0, while the second
implies R2n<a2nC1, so
0<R2n<a2nC1:
Thus, R2nis positive but bounded, and the bound can be made arbitrarily small by taking
larger values of n. This demonstration also shows that the error from truncating an alter-
nating series after a2nresults in an error that is negative (the omitted terms were shown to
combine to a positive result) and bounded in magnitude by a2nC1. An argument similar to
that made above for the remainder after an odd number of terms, R2nC1, would show that
the error from truncation after a2nC1is positive and bounded by a2nC2. Thus, it is generally
true that the error in truncating an alternating series with monotonically decreasing terms
is of the same sign as the last term kept and smaller than the first term dropped.
The Leibniz criterion depends for its applicability on the presence of strict sign
alternation. Less regular sign changes present more challenging problems for convergence
determination.
Example 1.1.8 SERIES WITH IRREGULAR SIGN CHANGES
For0<x<2, the series
SD1X
nD1cos.nx/
nD ln
2 sinx
2
(1.21)
converges, having coefficients that change sign often, but not so that the Leibniz criterion
applies easily. To verify the convergence, we apply the integral test of Eq. (1.10), inserting
the explicit form for the derivative of cos.nx/=n(with respect to n) in the second integral:
SD1Z
1cos.nx/
ndnC1Z
1
n TnU
x
nsin.nx/ cos.nx/
n2
dn: (1.22)
Using integration by parts, the first integral in Eq. (1.22) is rearranged to
1Z
1cos.nx/
ndnDsin.nx/
nx1
1C1
x1Z
1sin.nx/
n2dn;
and this integral converges because
1Z
1sin.nx/
n2dn<1Z
1dn
n2D1:
Looking now at the second integral in Eq. (1.22), we note that its term cos.nx/=n2also
leads to a convergent integral, so we need only to examine the convergence of
1Z
1
n TnUsin.nx/
ndn:
ArfKen_Ch01-9780123846549.tex
1.1 In/f_inite Series 13
Next, setting .n TnU/sin.nx/Dg0.n/, which is equivalent to defining g.N/DRN
1.n
TnU/sin.nx/dn, we write
1Z
1
n TnUsin.nx/
ndnD1Z
1g0.n/
ndnDg.n/
n1
nD1C1Z
1g.n/
n2dn;
where the last equality was obtained using once again an integration by parts. We do not
have an explicit expression for g.n/, but we do know that it is bounded because sinx
oscillates with a period incommensurate with that of the sawtooth periodicity of .n TnU/.
This boundedness enables us to determine that the second integral in Eq. (1.22) converges,
thus establishing the convergence of S.
Absolute and Conditional Convergence
An infinite series is absolutely convergent if the absolute values of its terms form a con-
vergent series. If it converges, but not absolutely, it is termed conditionally convergent.
An example of a conditionally convergent series is the alternating harmonic series,
1X
nD1. 1/n 1n 1D1 1
2C1
3 1
4CC. 1/n 1
nC: (1.23)
This series is convergent, based on the Leibniz criterion. It is clearly not absolutely con-
vergent; if all terms are taken with + signs, we have the harmonic series, which we already
know to be divergent. The tests described earlier in this section for series of positive terms
are, then, tests for absolute convergence.
Exercises
1.1.11 Determine whether each of these series is convergent, and if so, whether it is absolutely
convergent:
(a)ln 2
2 ln 3
3Cln 4
4 ln 5
5Cln 6
6 ;
(b)1
1C1
2 1
3 1
4C1
5C1
6 1
7 1
8C;
(c) 1 1
2 1
3C1
4C1
5C1
6 1
7 1
8 1
9 1
10C1
11C1
15 1
16 1
21C:
1.1.12 Catalan’s constant .2/ is defined by
.2/D1X
kD0. 1/k.2kC1/ 2D1
12 1
32C1
52:
Calculate.2/ to six-digit accuracy.
ArfKen_Ch01-9780123846549.tex
14 Chapter 1 Mathematical Preliminaries
Hint. The rate of convergence is enhanced by pairing the terms,
.4k 1/ 2 .4kC1/ 2D16k
.16k2 1/2:
If you have carried enough digits in your summation,P
1kN16k=.16k2 1/2, addi-
tional significant figures may be obtained by setting upper and lower bounds on the tail
of the series,P1
kDNC1. These bounds may be set by comparison with integrals, as in
the Maclaurin integral test.
ANS: .2/D0:9159 6559 4177.
Operations on Series
We now investigate the operations that may be performed on infinite series. In this connec-
tion the establishment of absolute convergence is important, because it can be proved that
the terms of an absolutely convergent series may be reordered according to the familiar
rules of algebra or arithmetic:
If an infinite series is absolutely convergent, the series sum is independent of the order
in which the terms are added.
An absolutely convergent series may be added termwise to, or subtracted termwise
from, or multiplied termwise with another absolutely convergent series, and the result-
ing series will also be absolutely convergent.
The series (as a whole) may be multiplied with another absolutely convergent series.
The limit of the product will be the product of the individual series limits. The product
series, a double series, will also converge absolutely.
No such guarantees can be given for conditionally convergent series, though some of
the above properties remain true if only one of the series to be combined is conditionally
convergent.
Example 1.1.9 REARRANGEMENT OF ALTERNATING HARMONIC SERIES
Writing the alternating harmonic series as
1 1
2C1
3 1
4CD 1 1
2 1
3
1
4 1
5
; (1.24)
it is clear thatP1
nD1. 1/n 1n 1<1. However, if we rearrange the order of the terms, we
can make this series converge to3
2. We regroup the terms of Eq. (1.24), as
1C1
3C1
5
1
2
C1
7C1
9C1
11C1
13C1
15
1
4
C1
17CC1
25
1
6
C1
27CC1
35
1
8
C:(1.25)
ArfKen_Ch01-9780123846549.tex
1.1 In/f_inite Series 15
Partial sum, sn1.500
1.400
1.3001.200
1.100
Number of terms in sum, n10 9 8 7 6 5 4 3 2 1
FIGURE 1.2 Alternating harmonic series. Terms are rearranged to give
convergence to 1.5.
Treating the terms grouped in parentheses as single terms for convenience, we obtain the
partial sums
s1D1:5333 s2D1:0333
s3D1:5218 s4D1:2718
s5D1:5143 s6D1:3476
s7D1:5103 s8D1:3853
s9D1:5078 s10D1:4078:
From this tabulation of snand the plot of snversus nin Fig. 1.2, the convergence to3
2is
fairly clear. Our rearrangement was to take positive terms until the partial sum was equal
to or greater than3
2and then to add negative terms until the partial sum just fell below3
2
and so on. As the series extends to infinity, all original terms will eventually appear, but
the partial sums of this rearranged alternating harmonic series converge to3
2.
As the example shows, by a suitable rearrangement of terms, a conditionally convergent
series may be made to converge to any desired value or even to diverge. This statement is
sometimes called Riemann’s theorem.
Another example shows the danger of multiplying conditionally convergent series.
Example 1.1.10 SQUARE OF A CONDITIONALLY CONVERGENT SERIES MAY DIVERGE
The seriesP1
nD1. 1/n 1
pnconverges by the Leibniz criterion. Its square,
"1X
nD1. 1/n 1
pn#2
DX
n. 1/n1p
11pn 1C1p
21pn 2CC1pn 11p
1
;
ArfKen_Ch01-9780123846549.tex
16 Chapter 1 Mathematical Preliminaries
has a general term, in T:::U, consisting of n 1additive terms, each of which is bigger than
1pn 1pn 1, so the entireT:::Uterm is greater thann 1
n 1and does not go to zero. Hence the
general term of this product series does not approach zero in the limit of large nand the
series diverges.
These examples show that conditionally convergent series must be treated with caution.
Improvement of Convergence
This section so far has been concerned with establishing convergence as an abstract math-
ematical property. In practice, the rate of convergence may be of considerable importance.
A method for improving convergence, due to Kummer, is to form a linear combination of
our slowly converging series and one or more series whose sum is known. For the known
series the following collection is particularly useful:
1D1X
nD11
n.nC1/D1;
2D1X
nD11
n.nC1/.nC2/D1
4;
3D1X
nD11
n.nC1/.nC2/.nC3/D1
18;
::::::::::::::::::::::::::::::
pD1X
nD11
n.nC1/.nCp/D1
p pW: (1.26)
These sums can be evaluated via partial fraction expansions, and are the subject of
Exercise 1.5.3.
The series we wish to sum and one or more known series (multiplied by coefficients)
are combined term by term. The coefficients in the linear combination are chosen to cancel
the most slowly converging terms.
Example 1.1.11 RIEMANN ZETA FUNCTION(3)
From the definition in Eq. (1.12), we identify .3/ asP1
nD1n 3. Noting that 2of
Eq. (1.26) has a large- ndependencen 3, we consider the linear combination
1X
nD1n 3Ca2D.3/Ca
4: (1.27)
We did not use 1because it converges more slowly than .3/. Combining the two series
on the left-hand side termwise, we obtain
1X
nD11
n3Ca
n.nC1/.nC2/
D1X
nD1n2.1Ca/C3nC2
n3.nC1/.nC2/:
ArfKen_Ch01-9780123846549.tex
1.1 In/f_inite Series 17
Table 1.1 Riemann Zeta
Function
s .s/
2 1:64493 40668
3 1:20205 69032
4 1:08232 32337
5 1:03692 77551
6 1:01734 30620
7 1:00834 92774
8 1:00407 73562
9 1:00200 83928
10 1:00099 45751
If we choose aD 1 , we remove the leading term from the numerator; then, setting this
equal to the right-hand side of Eq. (1.27) and solving for .3/,
.3/D1
4C1X
nD13nC2
n3.nC1/.nC2/: (1.28)
The resulting series may not be beautiful but it does converge as n 4, faster than n 3.
A more convenient form with even faster convergence is introduced in Exercise 1.1.16.
There, the symmetry leads to convergence as n 5.
Sometimes it is helpful to use the Riemann zeta function in a way similar to that
illustrated for the pin the foregoing example. That approach is practical because the
zeta function has been tabulated (see Table 1.1).
Example 1.1.12 CONVERGENCE IMPROVEMENT
The problem is to evaluate the seriesP1
nD11=.1Cn2/. Expanding.1Cn2/ 1Dn 2.1C
n 2/ 1by direct division, we have
.1Cn2/ 1Dn 2
1 n 2Cn 4 n 6
1Cn 2
D1
n2 1
n4C1
n6 1
n8Cn6:
Therefore
1X
nD11
1Cn2D.2/ .4/C.6/ 1X
nD11
n8Cn6:
The remainder series converges as n 8. Clearly, the process can be continued as desired.
You make a choice between how much algebra you will do and how much arithmetic the
computer will do.
ArfKen_Ch01-9780123846549.tex
18 Chapter 1 Mathematical Preliminaries
Rearrangement of Double Series
An absolutely convergent double series (one whose terms are identified by two summation
indices) presents interesting rearrangement opportunities. Consider
SD1X
mD01X
nD0an;m: (1.29)
In addition to the obvious possibility of reversing the order of summation (i.e., doing the m
sum first), we can make rearrangements that are more innovative. One reason for doing this
is that we may be able to reduce the double sum to a single summation, or even evaluate
the entire double sum in closed form.
As an example, suppose we make the following index substitutions in our double series:
mDq,nDp q. Then we will cover all n0,m0by assigning pthe range.0;1/,
andqthe range.0;p/, so our double series can be written
SD1X
pD0pX
qD0ap q;q: (1.30)
In the nmplane our region of summation is the entire quadrant m0,n0; in the pq
plane our summation is over the triangular region sketched in Fig. 1.3. This same pqregion
can be covered when the summations are carried out in the reverse order, but with limits
SD1X
qD01X
pDqap q;q:
The important thing to note here is that these schemes all have in common that, by allowing
the indices to run over their designated ranges, every an;mis eventually encountered, and
is encountered exactly once.
4q
2
0
024p
FIGURE 1.3 Thepqindex space.
ArfKen_Ch01-9780123846549.tex
1.1 In/f_inite Series 19
Another possible index substitution is to set nDs,mDr 2s. If we sum over sfirst,
its range must be .0;Tr=2U/, whereTr=2Uis the integer part of r=2, i.e.,Tr=2UD r=2forr
even and.r 1/=2 forrodd. The range of ris.0;1/. This situation corresponds to
SD1X
rD0Tr=2UX
sD0as;r 2s: (1.31)
The sketches in Figs. 1.4 to1.6show the order in which the an;mare summed when using
the forms given in Eqs. (1.29), (1.30), and (1.31), respectively.
If the double series introduced originally as Eq. (1.29) is absolutely convergent, then all
these rearrangements will give the same ultimate result.
m
23
1
0
024 n
FIGURE 1.4 Order in which terms are summed with m;nindex set, Eq. (1.29).
4m
23
1
0
02 3 14 n
FIGURE 1.5 Order in which terms are summed with p;qindex set, Eq. (1.30).
ArfKen_Ch01-9780123846549.tex
20 Chapter 1 Mathematical Preliminaries
46m
2
0
02 3 1 n
FIGURE 1.6 Order in which terms are summed with r;sindex set, Eq. (1.31).
Exercises
1.1.13 Show how to combine .2/DP1
nD1n 2with1and2to obtain a series converging
asn 4.
Note..2/ has the known value 2=6. See Eq. (12.66).
1.1.14 Give a method of computing
.3/D1X
nD01
.2nC1/3
that converges at least as fast as n 8and obtain a result good to six decimal places.
ANS: .3/D1:051800:
1.1.15 Show that (a)P1
nD2T.n/ 1UD 1, (b)P1
nD2. 1/nT.n/ 1UD1
2,
where.n/is the Riemann zeta function.
1.1.16 The convergence improvement of 1.1.11 may be carried out more expediently (in this
special case) by putting 2, from Eq. (1.26), into a more symmetric form: Replacing n
byn 1, we have
0
2D1X
nD21
.n 1/n.nC1/D1
4:
(a) Combine .3/ and0
2to obtain convergence as n 5.
(b) Let0
4be4with n!n 2. Combine.3/;0
2, and0
4to obtain convergence
asn 7.
ArfKen_Ch01-9780123846549.tex
1.2 Series of Functions 21
(c) If.3/ is to be calculated to six-decimal place accuracy (error 510 7), how
many terms are required for .3/ alone? combined as in part (a)? combined as in
part (b)?
Note. The error may be estimated using the corresponding integral.
ANS: .a/ .3/D5
4 1X
nD21
n3.n2 1/.
1.2 S ERIES OF FUNCTIONS
We extend our concept of infinite series to include the possibility that each term unmay
be a function of some variable, unDun.x/. The partial sums become functions of the
variable x,
sn.x/Du1.x/Cu2.x/CC un.x/; (1.32)
as does the series sum, defined as the limit of the partial sums:
1X
nD1un.x/DS.x/Dlimn!1sn.x/: (1.33)
So far we have concerned ourselves with the behavior of the partial sums as a function of
n. Now we consider how the foregoing quantities depend on x. The key concept here is
that of uniform convergence.
Uniform Convergence
If for any small ">0there exists a number N,independent of xin the intervalTa;bU
(that is, axb) such that
jS.x/ sn.x/j<"; for all nN; (1.34)
then the series is said to be uniformly convergent in the intervalTa;bU. This says that
for our series to be uniformly convergent, it must be possible to find a finite Nso that
the absolute value of the tail of the infinite series,P1
iDNC1ui.x/, will be less than an
arbitrary small "for all xin the given interval, including the endpoints.
Example 1.2.1 NONUNIFORM CONVERGENCE
Consider on the interval T0;1Uthe series
S.x/D1X
nD0.1 x/xn:
ArfKen_Ch01-9780123846549.tex
22 Chapter 1 Mathematical Preliminaries
For0x<1, the geometric seriesP
nxnis convergent, with value 1=.1 x/, soS.x/D
1for these xvalues. But at xD1, every term of the series will be zero, and therefore
S.1/D0. That is,
1X
nD0.1 x/xnD1;0x<1;
D0;xD1: (1.35)
SoS.x/is convergent for the entire interval T0;1U, and because each term is nonnegative,
it is also absolutely convergent. If x6D0, this is a series for which the partial sum sN
is1 xN, as can be seen by comparison with Eq. (1.3). Since S.x/D1, the uniform
convergence criterion is
1 .1 xN/DxN<":
No matter what the values of Nand a sufficiently small "may be, there will be an xvalue
(close to 1) where this criterion is violated. The underlying problem is that xD1is the
convergence limit of the geometric series, and it is not possible to have a convergence rate
that is bounded independently of xin a range that includes xD1.
We note also from this example that absolute and uniform convergence are independent
concepts. The series in this example has absolute, but not uniform convergence. We will
shortly present examples of series that are uniformly, but only conditionally convergent.
And there are series that have neither or both of these properties.
Weierstrass M(Majorant) Test
The most commonly encountered test for uniform convergence is the Weierstrass Mtest.
If we can construct a series of numbersP1
iD1Mi, in which Miju i.x/jfor all xin the
intervalTa;bUandP1
iD1Miis convergent, our series ui.x/will be uniformly convergent
inTa;bU.
The proof of this Weierstrass Mtest is direct and simple. SinceP
iMiconverges, some
number Nexists such that for nC1N,
1X
iDnC1Mi<":
This follows from our definition of convergence. Then, with jui.x/jMifor all xin the
interval axb,
1X
iDnC1ui.x/<":
Hence S.x/DP1
nD1ui.x/satisfies
jS.x/ sn.x/jD1X
iDnC1ui.x/<"; (1.36)
ArfKen_Ch01-9780123846549.tex
1.2 Series of Functions 23
we see thatP1
nD1ui.x/is uniformly convergent in Ta;bU. Since we have specified absolute
values in the statement of the Weierstrass Mtest, the seriesP1
nD1ui.x/is also seen to
be absolutely convergent. As we have already observed in Example 1.2.1, absolute and
uniform convergence are different concepts, and one of the limitations of the Weierstrass
Mtest is that it can only establish uniform convergence for series that are also absolutely
convergent.
To further underscore the difference between absolute and uniform convergence, we
provide another example.
Example 1.2.2 UNIFORMLY CONVERGENT ALTERNATING SERIES
Consider the series
S.x/D1X
nD1. 1/n
nCx2; 1<x<1: (1.37)
Applying the Leibniz criterion, this series is easily proven convergent for the entire inter-
val 1<x<1, but it is notabsolutely convergent, as the absolute values of its terms
approach for large nthose of the divergent harmonic series. The divergence of the absolute
value series is obvious at xD0, where we then exactly have the harmonic series. Never-
theless, this series is uniformly convergent on 1<x<1, as its convergence is for all
xat least as fast as it is for xD0. More formally,
jS.x/ sn.x/j<junC1.x/jjunC1.0/j:
Since unC1.0/is independent of x, uniform convergence is confirmed.
Abel’s Test
A somewhat more delicate test for uniform convergence has been given by Abel. If un.x/
can be written in the form anfn.x/, and
1. The anform a convergent series,P
nanDA,
2. For all xinTa;bUthe functions fn.x/are monotonically decreasing in n, i.e., fnC1.x/
fn.x/,
3. For all xinTa;bUall the f.n/are bounded in the range 0fn.x/M, where Mis
independent of x,
thenP
nun.x/converges uniformly in Ta;bU.
This test is especially useful in analyzing the convergence of power series. Details of
the proof of Abel’s test and other tests for uniform convergence are given in the works
by Knopp and by Whittaker and Watson (see Additional Readings listed at the end of this
chapter).
ArfKen_Ch01-9780123846549.tex
24 Chapter 1 Mathematical Preliminaries
Properties of Uniformly Convergent Series
Uniformly convergent series have three particularly useful properties. If a seriesP
nun.x/
is uniformly convergent in Ta;bUand the individual terms un.x/are continuous,
1. The series sum S.x/DP1
nD1un.x/is also continuous.
2. The series may be integrated term by term. The sum of the integrals is equal to the
integral of the sum:
bZ
aS.x/dxD1X
nD1bZ
aun.x/dx: (1.38)
3. The derivative of the series sum S.x/equals the sum of the individual-term deriva-
tives:
d
dxS.x/D1X
nD1d
dxun.x/; (1.39)
provided the following additional conditions are satisfied:
dun.x/
dxis continuous inTa;bU;
1X
nD1dun.x/
dxis uniformly convergent in Ta;bU:
Term-by-term integration of a uniformly convergent series requires only continuity of
the individual terms. This condition is almost always satisfied in physical applications.
Term-by-term differentiation of a series is often not valid because more restrictive condi-
tions must be satisfied.
Exercises
1.2.1 Find the range of uniform convergence of the series
(a).x/D1X
nD1. 1/n 1
nx, (b).x/D1X
nD11
nx.
ANS: (a)0<sx<1.
(b)1<sx<1.
1.2.2 For what range of xis the geometric seriesP1
nD0xnuniformly convergent?
ANS: 1<