Essentials of Mathematical Methods in Science and Engineering
S. Selguk Bayin Middle Etrst Technical University Ankurc...
318 downloads
4334 Views
23MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
Essentials of Mathematical Methods in Science and Engineering
S. Selguk Bayin Middle Etrst Technical University Ankurcl, T w k q
WILEY A JOHN WILEY & SONS, INC., PUBLICATION
This Page Intentionally Left Blank
Essentials of Mathematical Methods in Science and Engineering
This Page Intentionally Left Blank
Essentials of Mathematical Methods in Science and Engineering
S. Selguk Bayin Middle Etrst Technical University Ankurcl, T w k q
WILEY A JOHN WILEY & SONS, INC., PUBLICATION
Copyright C 2008 by John Wiley & Sons, Inc. All rights reserved Published by John Wiley & Sons, Inc., Hoboken, New Jersey. Published simultaneously in Canada.
No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means. electronic, mechanical, photocopying, recording, scanning, or otherwise, except as permitted under Section 107 or 108 of the 1976 United States Copyright Act, without either the prior written peimission of the Publisher, or authorization through payment of the appropriate per-copy fee to the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, (978) 750-8400, fax (978) 750-4470, or on the web at www.copyright.com. Requests to the Publisher for permission should be addressed to the Perniissions Department, John Wiley & Sons, Inc., 11 1 River Street, Hoboken, NJ 07030. (201) 748-601 I , fax (201) 748-6008, or online at http://www.wiley.com/go/permission. Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or completeness of the contents of this book and specifically disclaim any implied warranties of merchantability or fitness for a particular purpose. No warranty may be created or extended by sales representatives or written sales materials. The advice and strategies contained herein may not be suitable for your situation. You should consult with a professional where appropriate. Neither the publisher nor author shall be liable for any loss of profit or any other commercial damages, including but not limited to special, incidental. consequential, or other damages. For general information on our other products and services or for technical support, please contact our Customer Care Department within the United States at (800) 762-2974, outside the United States at (3 17) 572-3993 or fax (3 17) 572-4002. Wiley also publishes its books in a variety of electronic formats. Some content that appears in print may not be available in electronic format. For information about Wiley products, visit our web site at www.wiIey.com.
Library of Congress Cataloging-in-Publication Data:
Bayin, $. SelGuk, 1951Essentials of mathematical methods in science and engineering / $. SelGuk Bayin. p. cm. Includes bibliographical references and index. ISBN 978-0-470-34379- I (cloth) I . Science-Mathematics. 2. Science-Methodology. 3. Engineering mathematics. 1. Title. Q158.5.B39 2008 501'S l L d c 2 2 2008004313
Printed in the United States of America. I 0 9 8 7 6 5 4 3 2 1
To my father, Omer Bayan
This Page Intentionally Left Blank
Contents in Brief
1
FUNCT I0NA L ANALYSIS
2
VECTOR ANALYSIS
3
GENERALIZED COORDINATES and TENSORS
139
4
DETERMINANTS and MATRICES
207
5
LINEAR ALGEBRA
241
6
SEQUENCES and SERIES
303
7
COMPLEX NUMBERS and FUNCTIONS
331
8
COMPLEX ANALYSIS
369
9
0RDINARY DIFFER ENT IA L EQ UAT I 0NS
407
1
57
10 SECOND-ORDER DIFFERENTIAL EQUATIONS and SPECIAL FUNCTIONS
11 BESSEL’S EQUATION and BESSEL FUNCTIONS
12 PARTIAL DIFFERENTIAL EQUATIONS and SEPARATION of VARIABLES
469 509 541
13 FOURIER SERIES
585
14 FOURIER and LAPLACE TRANSFORMS
607
15 CALCULUS of VARIATIONS
637
16 PROBABILITY THEORY and DISTRIBUTIONS
667
17 INFORMATION THEORY
721
vii
This Page Intentionally Left Blank
CONTENTS
Preface
xxi
Acknowledgments 1
xxvii
FUNCTIONAL ANALYSIS
1
1.1 1.2 1.3 1.4 1.5 1.G 1.7 1.8 1.9 1.10 1.11 1.12 1.13
1
Concept of Function Continuity and Limits Partial Differentiation Total Differential Taylor Series Maxima and Minima of Functions Extrema of Functions with Conditions Derivatives and Differentials of Composite Functions Implicit Function Theorem Inverse Functions Integral Calculus and the Definite Integral Riernann Integral Improper Integrals
4 6 8 10
14 18 22
24 30 32 34 37 ix
X
CONTENTS
1.14 1.15 1.16 1.17 1.18 1.19
Cauchy Principal Value Integrals Integrals Involving a Parameter Limits of Integration Depending on a Parameter Double Integrals Properties of Double Integrals Triple and Multiple Integrals Problcms
VECTOR ANALYSIS
2.1 2.2 2.3 2.4
2.5
2.6
2.7
2.8
2.9 2.10
Vector Algebra: Geometric Method 2.1.1 Multiplication of Vectors Vector Algebra: Coordinate Representation Lines and Planes Vector Differential Calculus 2.4.1 Scalar Fields and Vector Fields 2.4.2 Vcctor Differentiation Gradient Operator 2.5.1 Meaning of the Gradient 2.5.2 Directional Derivative Divergence and Curl Operators 2.6.1 Meaning of Divergence and the Divergence Theorem Vector Integral Calculus in Two Dimensions 2.7.1 Arc Length and Line Integrals Surface Area and Surface Integrals 2.7.2 An Alternate Way to Write Line Integrals 2.7.3 2.7.4 Green’s Theorem 2.7.5 Interpretations of Green’s Theorem Extension to Multiply Connected Domains 2.7.6 Curl Operator and Stokes’s Theorem 2.8.1 On the Plane 2.8.2 In Space 2.8.3 Geometric Interpretation of Curl Mixed Operations with the Del Operator Potential Theory 2.10.1 Gravitational Field of a Spherically Symmetric Star 2.10.2 Work Done by Gravitational Force
40 42 46 47 49 50 51
57 57 60 62 68 70 70 72 73 74 75 77 78 83 83 87 89 91 93 94 97 97 102 105 105 108 111 112
CONTENTS
2.10.3 Path Independence and Exact Differentials 2.10.4 Gravity and Conservative Forces 2.10.5 Gravitational Potential 2.10.6 Gravitational Potential Energy of a System 2.10.7 Helmholtz Theorem 2.10.8 Applications of the Helmholtz Theorem 2.10.9 Examples from Physics Problems
3
GENERALIZED COORDINATES and TENSORS
3.1
3.2
3.3
3.4
3.5
Transformations Between Cartesian Coordinates 3.1.1 Basis Vectors and Direction Cosines Transformation Matrix and the Orthogonality 3.1.2 Relation 3.1.3 Inverse Transformation Matrix Cartesian Tensors 3.2.1 Algebraic Properties of Tensors 3.2.2 Kronecker Delta and the Permutation Symbol Generalized Coordinates 3.3.1 Coordinate Curves and Surfaces Why Upper and Lower Indices 3.3.2 General Tensors 3.4.1 Einstein Summation Convention Line Element 3.4.2 Metric Tensor 3.4.3 How to Raise and Lower Indices 3.4.4 3.4.5 Metric Tensor and the Basis Vectors Displacement Vector 3.4.6 Transformation of Scalar Functions and Line 3.4.7 Integrals 3.4.8 Area Element in Generalized Coordinates Area of a Surface 3.4.9 3.4.10 Volume Element in Generalized Coordinates 3.4.11 Invariance and Covariance Differential Operators in Generalized Coordinates 3.5.1 Gradient 3.5.2 Divergence 3.5.3 Curl
xi
114 116 118 120 122 123 127 130
139 140 140 142 144 145 148 151 154 154 159 160 163 164 164 165 166 168 169 171 173 177 178 179 179 180 182
xii
CONTENTS
3.6
4
D E T E R M I N A N T S and M A T R I C E S
4.1 4.2 4.3 4.4 4.5 4.6 4.7 -1.8 -1.9 4.10
5
3.5.4 Laplacian Orthogonal Generalized Coordinates 3.6.1 Cylindrical Coordinates 3.6.2 Spherical Coordinates Problems
Basic Definitions Operations with Matrices Subinatrix and Partitioned Matrices Systems of Linear Equations Gauss’s Method of Elimination Determinants Properties of Determinants Cramer’s Rule Iiivcrse of a Matrix Homogeneous Linear Equations Problems
LINEAR ALGEBRA
5.1 5.2 5.3 5.4 5.5 5.6 5.7 5.8 5.9 5.10 5.11 5.12 5.13 5.11 5.15 5.16 5.17 5.18
Fields and Vector Spaces Linear Combinations, Generators, and Bases Coniponents Linear Transformations Matrix Representation of Transformations Algebra of Transformations Change of Basis Irivariants Under Similarity Transformations Eigenvalues and Eigenvectors Moment of Inertia Tensor Inner product Spaces The Inner Product Orthogonality and Completeness Gram -Schmidt Ort hogonalization Eigenvalue Problem for Real Symmetric Matrices Prcsciice of Degenerate Eigenvalues CJiiatlratic Forms Herniitian bIatrices
186 186 187 193 198 207 207 208 214 216 217 22 1 223 226 230 233 234
241 241 244 246 249 250 252 254 256 256 265 270 271 274 276 277 278 285 289
CONTENTS
5.19 5.20 5.21 5.22
6
SEQUENCES and SERIES
6.1 6.2 6.3
6.4 6.5 6.6 6.7 6.8 6.9 6.10
7
Matrix Representation of Linear Transformations Functions of Matrices Function Space and Hilbert Space Dirac’s Bra and Ket vectors Problems
Sequences Infinite Series Absolute and Conditional Convergence 6.3.1 Comparison Test 6.3.2 Limit Comparison Test 6.3.3 Integral Test 6.3.4 Ratio Test 6.3.5 Root Test Operations with Series Sequences and Series of Functions Ail-Test for Uniform Convergence Properties of Uniformly Convergent Series Power Series Taylor Series and Maclaurin Series Indeterminate Forms and Series Problems
COMPLEX NUMBERS and FUNCTIONS
7.1 7.2 7.3 7.3 7.5 7.G 7.7 7.8 7.9 7.10
The Algebra of Complex Numbers Roots of a Complex Number Infinity and the Extended Complex Plane Complex Functions Limits and Continuity Differentiation in the Complex Plane Analytic Functions Harmonic Functions Basic Differentiation Formulas Elementary Functions 7.10.1 Polynomials 7.10.2 Exponential Function 7.10.3 Trigonometric Functions
xiii
293 294 296 297 298 303 304 308 309 309 309 309 310 310 314 316 318 319 32 1 324 324 326
331 332 336 339 342 344 345 349 350 352 353 353 354 356
xiv
CONTENTS
7.10.4 Hyperbolic Functions 7.10.5 Logarithmic Function 7.10.6 Powers of Complex Numbers 7.10.7 Inverse Trigonometric Functions Problems
8
CO MPL EX ANALYSIS 8.1 8.2 8.3 8.4
8.5 8.6 8.7
8.8
8.9 8.10 8.11
9
Contour Integrals Types of Contours The Caucl-iy-Goursat Theorem Iiidefinit e Integrals Simply and Multiply Connected Domains The Cauchy Integral Formula Derivatives of Analytic Functions Coniplex Power Series 8.8.1 Taylor Series with the Remainder 8.8.2 Laurent Series with the Remainder Convergelice of Power Series Classification of Singular Points Residue Theorem Problems
0 R DI N A R Y DIFFER ENTIA L EQ UAT1 0 NS 9.1 9.2 9.3
9.4
Basic Definitions for Ordinary Differential Equations First-Order Differential Equations First-Order Differential Equations: Methods of Solution 9.3.1 Dependent Variable Is Missing 9.3.2 Independent Variable Is Missing The Case of Separable f ( z ,y) 9.3.3 9.3.4 Homogeneous f ( ~y), of Zeroth Degree 9.3.5 Solution When f ( z ,y) Is a Rational Function 9.3.6 Linear Equations of First-Order 9.3.7 Exact Equations 9.3.8 Integrating Factors 9.3.9 Bernoulli Equation 9.3.10 Riccati Equation 9.3.11 Equations That Cannot Be Solved for y’ Second-Order Differential Equations
357 358 359 362 362
369 370 372 376 379 381 381 384 385 385 389 393 394 397 40 1
407 408 410 412 412 412 412 413 413 416 417 419 423 424 426 429
9.5
9.6
9.7 9.8
10
CONTENTS
xv
Second-Order Differential Equations: Methods of Solution 9.5.1 Linear Homogeneous Equations with Constant Coefficients 9.5.2 Operator Approach 9.5.3 Linear Homogeneous Equations with Variable Coefficients 9.5.4 Cauchy -Euler Equation 9.5.5 Exact Equations and Integrating Factors 9.5.6 Linear Nonhomogeneous Equations 9.5.7 Variation of Parameters 9.5.8 Method of Undetermined Coefficients Linear Differential Equations of Higher Order 9.6.1 With Constant Coefficients 9.6.2 With Variable Coefficients 9.6.3 Nonhomogeneous Equations Initial Value Problem and Uniqueness of the Solution Series Solutions: Froberiius Method 9.8.1 Frobenius Method and First-Order Equations Problems
430 431 437 438 44 1 442 444 445 446 450 450 451 451 452 452 462 463
SECOND-ORDER DIFFERENTIAL EQUATIONS and SPECIAL 469 FUNCTIONS
10.1
10.2
Legendre Equation 10.1.1 Series Solution 10.1.2 Effect of Boundary Conditions 10.1.3 Legendre Polynomials 10.1.4 Rodriguez Formula 10.1.5 Generating Function 10.1.6 Special Values 10.1.7 Recursion Relations 10.1.8 Orthogonality 10.1.9 Legendre Series Hermite Equation 10.2.1 Series Solution 10.2.2 Hermite Polynomials 10.2.3 Contour Integral Representation 10.2.4 Rodriguez Formula 10.2.5 Generating Function
4 70 470 473 474 477 4 78 480 48 1 482 484 487 487 491 492 493 494
xvi
CONTENTS
10.3
11
BESSEL’S EQUATION and BESSEL FUNCTIONS
11.1
11.2
12
10.2.6 Special Values 10.2.7 Recursion Relations 10.2.8 Orthogonality 10.2.9 Series Expansions in Hermite Polynomials Laguerre Equation 10.3.1 Series Solution 10.3.2 Laguerre Polynomials 10.3.3 Contour Integral Representation 10.3.4 Rodriguez Formula 10.3.5 Generating Function 10.3.6 Special Values and Recursion Relations 10.3.7 Orthogonality 10.3.8 Series Expansions in Laguerre Polynomials Problems
Bessel’s Equation and Its Series Solution 11.1.1 Bessel Functions J*,(z), N,(z), and H:’”(x) 11.1.2 Recursion Relations 11.1.3 Generating Function 11.1.4 Integral Definitions 11.1.5 Linear Independence of Bessel Functions 11.1.6 Modified Bessel Functions I m ( z )and K,(z) 11.1.7 Spherical Bessel Functions jl(x),nl(z), and h1(1’2)(x) Orthogonality and the Roots of Bessel Functions 11.2.1 Expansion Theorem 11.2.2 Boundary Conditions for the Bessel Functions Problems
495 495 496 499 500 500 502 502 503 504 504 505 506 507
509 510 514 518 519 521 522 523 525 527 531 531 535
PARTIAL DIFFERENTIAL EQUATIONS and SEPARATION of VARIABLES 541
12.1
12.2
Separation of Variables in Cartesian Coordinates 12.1.1 Wave Equation 12.1.2 Laplace Equation 12.1.3 Diffusion and Heat Flow Equations Separation of Variables in Spherical Coordinates 12.2.1 Laplace Equ at ion ’
542 544 546 550 553 557
CONTENTS
12.3
13
14
12.2.2 Boundary Conditions for a Spherical Boundary 12.2.3 Helmholtz Equation 12.2.4 Wave Equation 12.2.5 Diffusion and Heat Flow Equations 12.2.6 Time-Independent Schrodinger Equation 12.2.7 Time-Dependent Schrodinger Equation Separation of Variables in Cylindrical Coordinates 12.3.1 Laplace Equation 12.3.2 Helmholtz Equation 12.3.3 Wave Equation 12.3.4 Diffusion and Heat Flow Equations Problems
xvii
558 563 563 564 565 566 567 569 570 570 572 580
FOURIER SERIES
585
13.1 13.2 13.3 13.4 13.5 13.6 13.7 13.8
Orthogonal Systems of Functions Fourier Series Exponential Forni of the Fourier Series Convergence of Fourier Series Sufficient Conditions for Convergence The Fundamental Theorem Uniqueness of Fourier Series Examples of Fourier Series 13.8.1 Square Wave 13.8.2 Triangular Wave 13.8.3 Periodic Extension 13.9 Fourier Sine and Cosine Series 13.10 Change of Interval 13.11 Integration and Differentiation of Fourier Series Problems
585 59 1 592 593 595 596 597 597 597 599 600 601 602 603 604
FOURIER and LAPLACE TRANSFORMS
607
14.1 14.2 14.3 14.4 14.5 14.6 14.7
Types of Signals Spectral Analysis and Fourier Transforms Correlation with Cosines and Sines Correlation Functions and Fourier Transforms Inverse Fourier Transform Frequency Spectrums Dirac-Delta Function
607 610 611 615 615 617 618
xviii
CONTENTS
14.8 14.9 14.10 14.11 14.12 14.13
15
General Fourier Transforms and Their Properties Basic Definition of Laplace Transform Diffcrcntial Equations arid Laplace Transforms Transfer Functions and Signal Processors Coririectiori of Signal Processors Problems
CALCULUS of VARIATIONS 15.1 15.2 15.3 15.4 15.5 15.6 15.7 15.8 15.9 15.10
16
A Case with Two Cosines
A Siiiiple Case Variational Analysis Alternate Form of Euler Equation Variational Notation A Nore General Case Hamilton’s Principle Lagrange’s Equations of Motion Definition of Lagrangian Prescrice of Constraints in Dynamical Systems Conservation Laws Problems
PROBABILITY T H E O R Y and DISTRIBUTIONS 16.1
16.2
Introduction t o Probability Theory 16.1.1 Fundamental Concepts 16.1.2 Basic Axioms of Probability 16.1.3 Basic Theorems of Probability 16.1.4 Statistical Definition of Probability 16.1.5 Conditional Probability and Multiplication Theorem 16.1.6 Bayes’ Theorem 16.1.7 Geometric Probability and Buffon’s Needle Problem Permutations and Combinations 16.2.1 The Case of Distinguishable Balls with Replacement 16.2.2 The Case of Distinguishable Balls Without Replacement 16.2.3 The Case of Indistinguishable Balls
619 620 622 625 627 629 632 637 638 639 642 645 647 65 1 653 657 659 662 663 667 668 668 669 669 672 673 674 677 678 678 679 680
CONTENTS
16.2.4 Binomial and Multinomial Coefficients Applications to Statistical Mechanics 16.3.1 Boltzmann Distribution for Solids 16.3.2 Boltzmann Distribution for Gases 16.3.3 Bose-Einstein Distribution for Perfect Gases 16.3.4 Fermi -Dirac Distribution 16.4 Statistical Mechanics and Thermodynamics 16.4.1 Probability and Entropy 16.4.2 Derivation of p 16.5 Random Variables and Distributions 16.6 Distribution Functions and Probability 16.7 Examples of Continuous Distributions 16.7.1 Uniform Distribution 16.7.2 Gaussian or Normal Distribution 16.7.3 Gamma Distribution 16.8 Discrete Probability Distributions 163.1 Uniform Distribution 16.8.2 Binomial Distribution 16.8.3 Poisson Distribution 16.9 Fundamental Theorem of Averages 16.10 Moments of Distribution Functions 16.10.1 Moments of the Gaussian Distribution 16.10.2 Moments of the Binomial Distribution 16.10.3 Moments of the Poisson Distribution 16.11 Chebyshev’s Theorem 16.12 Law of Large Numbers Problenis
681 682 684 686 687 688 689 689 691 693 696 698 698 699 699 700 70 1 701 703 704 705 706 707 708 710 712 713
INFORMATION THEORY
721
16.3
17
xix
17.1 17.2
Elements of Information Processing Mechanisms Classical Information Theory 17.2.1 Prior Uncertainty and Entropy of Information 17.2.2 Joint and Conditional Entropies of Information 17.2.3 Decision Theory 17.2.4 Decision Theory and Game Theory 17.2.5 Traveler’s Dilemma and Nash Equilibrium 17.2.6 Classical Bit or Cbit 17.2.7 Operations on Cbits
724 726 729 731 735 736 742 746 750
XX
CONTENTS
17.3
Quantum Information Theory 17.3.1 Basic Quantum Theory 17.3.2 Single-Particle Systems and Quantum Information 17.3.3 Mach- Zchnder Interferometer 17.3.4 Mathematics of the Mach-Zehnder Interferometer 17.3.5 Quantum Bit or Qbit 17.3.6 The No-Cloning Theorem 17.3.7 Entanglement and Bell States 17.3.8 Quantum Dense Coding 17.3.9 Quantum Teleportation Problems
752 752 758 760 763 767 770 771 776 777 780 787
I11dcs
793
Prefa ce
After a year of freshman calculus, the basic mathematics training in science and engineering is accomplished during the second and third years of college education. Students are usually required to take a sequence of three courses on the subjects of advanced calculus, differential equations, complex calculus, and introductory mathematical physics. The majority of science and engineering departments today are finding it convenient t o use a single book that assures uniform formalism and a topical coverage in tune with their average needs. The objective of Essentials of Mathematical Methods in Science and Engineering is to equip students with the basic mathematical skills that are required by the majority of science and engineering undergraduate programs. Some of the basic courses taught in these programs are on the subjects of classical electrodynamics, classical mechanics, statistical mechanics, thermodynamics, modern physics, quantum mechanics, and relativity. The entire book contains a sufficient amount of material for a three-semester course meeting three or four hours a week. All this being said, respecting the disparity of the mathematics courses taught throughout the world, the topical coverage and the modular structure of the book make it versatile enough to be adopted for a number of mathematics courses and allows instructors the flexibility to individualize their own teaching while maintaining the integrity xxi
xxii
PREFACE
of the discussions in the book for their students.
About the Book
We give a coherent treatment of the selected topics with a style that makes the essential mathematical skills easily accessible to a multidisciplinary audience. Sirice t,he book is written in modular format, each chapter covers its subject thoroughly and thus can be read independently. This makes the book very useful as a reference or refresher for scientists. It is assumed that the reader has been exposed to two semesters of freshman calculus, which is usually taught, at the level of Thomas’ Calculus by Thomas, Jr. and Finney, or has acquired an equivalent level of mathematical maturity. The derivations and discussions are usually presented in sufficient detail so that the reader can follow the mathematics without much pause. Occasionally, when the proofs get t,oo technical for our purposes, we quote them without proof but refer to an appropriate book. All t,he references are collected at the back in alphabetical order with their full titles. Whenever there is credit due or some special reference worth pointing out, it is cited within the text. However, most of the references in our list are included as extra resources for the interested reader who wants to dwell on these topics further. Along with these references, students and researchers can use the websites http://en.wikipedia.org and http://scienceworld.wolfram.com/ for further resources. Of course, the website litt,p://lanl.arxiv.org/ is an indipensible tool for researchers on any subject,. This book concentrates on the analytic techniques. Computer programs like MathematicaO and MapleTh’arc capable of performing symbolic as well as numerical calculations. Even though they are extremely useful to scientists, one still needs a full grasp of the basic mathematical techniques to produce the desired result and to interpret it correctly. There are books specifically writt,eri for niatheniatical methods with these programs. The books by Kelly on Matheniatica and by Wang on Maple are included in our list of references at the back.
Summary of the Book
Chapter 1. Functional Analysis: This chapter aims to fill the gap between the introductory calculus and advanced mathematical analysis courses. It introduces the basic techniques that are used throughout mathematics. Limits, derivatives, integrals, extremum of functions, implicit function theorem, inverse functions, and improper integrals are among the topics discussed. Chapter 2. Vector Analysis: Since most of the classical theories can
PREFACE
xxiii
tie introduced in terms of vectors, we present a rather detailed treatment of vectors and their techniques. Vector algebra, vector differentiation, gradient, divergence and curl operators, vector integration, Green’s theorem, integral theorems, and the essential elements of the potential theory are among the topics discussed. Chapter 3. Generalized Coordinates and Tensors: Starting with the Cartesian coordinates, we discuss generalized coordinate systems and their transformations. Basis vectors, transformation matrix, line element, reciprocal basis vectors, covariant and contravariant components, differential operators in generalized coordinates, and introduction t o Cartesian and general tensors are among the other essential topics of mathematical methods. Chapter 4. Determinants and Matrices: A systematic treatment of the basic properties and methods of determinants and matrices that are much needed in science and engineering applications are presented here with examples. Chapter 5. Linear Algebra: We start with a discussion of abstract linear spaces, also called vector spaces, and then continue with systems of linear equations, inner product spaces, eigenvalue problems, quadratic forms, Hermitian matrices, and Dirac’s bra and ket vectors. Chapter 6. Sequences and Series: This chapter starts with sequences and series of numbers and then introduces absolute convergence and tests for convergence. We then extend our discussion to series of functions and introduce the concept of uniform convergence. Power series and Taylor series are discussed in detail with applications. Chapter 7. Complex Numbers and Functions: After the complex number system is introduced and their algebra is discussed, complex functions, complex differentiation, Cauchy-Riemann conditions and analytic functions are the main topics of this chapter. Chapter 8. Complex Analysis: We introduce the complex integral theorems and discuss residues, Taylor series and Laurent series along with their convergence properties. Chapter 9. Ordinary Differential Equations: We start with the general properties of differential equations, their solutions and their boundary conditions. Most commonly encountered differential equations in applications are either first- or second-order. Hence, we discuss these two cases separately in detail and introduce methods of finding their analytic solutions. We also study linear equations of higher order. We finally conclude with the Frobenius method applied to first- and second-order differential equations with interesting and carefully selected examples. Chapter 10. Second-Order Differential Equations and Special Functions: In this chapter, we discuss three of the most frequently encountered second-order differential equations of physics and engineering, that is, Legendre, Hermite, and Laguerre equations. We study these equations in detail from the viewpoint of the Frobenius method. By using the boundary conditions, we then show how the corresponding orthogonal polynomial sets
xxiv
PREFACE
arc constriictcd. We also discuss how and under what conditions these polynomial sets can be used to represent a general solution. Chapter 11. Bessel’s Equation and Bessel Functions: Bessel functions are among t,lie most frequently used special functions of mathernatical physics. Siiice their orthogonality is with respect to their roots and not with respect to it parameter in the differential equation, they are discussed here sepa,rately in great detail. Chapter 12. Partial Differential Equations and Separation of Variables: Most of the second-order ordinary differential equations of physics and engineering are obtained from partial differential equations via the method of separation of variables. We introduce the most commonly encountered partial differential equations of physics and engineering and show how the method of separation of variables is used in Cartesian, spherical, and cylindrical coordinates. Interesting examples help the reader connect with the knowledge gained in the previous three chapters. Chapter 13. Fourier Series: We first introduce orthogonal systems of functions and then concentrate on trigonometric Fourier series. We discuss their convergence and uniqueness properties along with specific examples. Chapter 14. Fourier and Laplace Transforms: After a basic introduction t,o signal analysis and correlation functions, we introduce the Fourier transforms and their inverses. We also introduce Laplace transforms and their applicat,ions to differential equations. We discuss met hods of finding inverse Lapla.cc transforms and their applications to transfer functions and signal proccssors. Chapter 15. Calculus of Variations: We introduce basic variational analysis for different types of boundary conditions. Applications to Hamilton‘s principle and to Lagrangian mechanics is investigated in detail. The presciicc of const,raiiits in dynaniical systems along with the inverse problem are discusscd with examples. Chapter 16. Probability Theory and Distributions: Some of the interest,ing t,opics covered in this chapter include the basic theory of probability, permutations and combinations, applications to statistical mechanics, and the connection with thermodynamics. We also discuss Bayes’ theorem, random variables, distributions, distribution functions and probability, fundamental theorem of averages, moments, Chebyshev’s theorem, and the law of large numbers. Chapter 17. Information Theory: The first part of this chapter is devoted to classical information theory, where we discuss topics from Shannon‘s tlieory, dccision theory, game theory, Nash equilibrium, and traveler’s dileninia. The definition of Cbits and operations with them are also introduced. Thc second part of this chapter is on quantum information theory. After a general survey of quantum mechanics, we discuss Mach-Zehnder interferometer, Qbits, entanglement, and Bell states. Along with the no-cloning theorem. quantum cryptology, quantum dense coding, and quantum teleportation arc amoiig the other interesting topics discussed in this chapter. This
PREFACE
XXV
chapter is written with a style that makes these interesting topics accessible to a wide range of audiences with minimum prior exposure t o quantum mechanics.
Course Suggestions Chapters 1-15 consist of the contents of the three, usually sequentially taught, core mathematical methods courses meeting 3-4 hours a week that most science and engineering departments require. These chapters consist of the basic mathematical skils needed for the majority of undergraduate science and engineering courses. Chapters 1-8 can be taught during the second year as a two-semester course. During the first or the second semester of the third year, a course composed of the Chapters 9-15 can complete the sequence. Chapters 9 through 12 can also be used in a separate one-semester course on differential equations and special functions. The two extensive chapters on probability theory and information theory (Chapters 16 and 17) are among the special chapters of the book. Even though most of the mathematical methods textbooks have chapters on probability, we have treated the subject with a style and level that prepares the reader for the following chapter on information theory. We have also included sections on applications to statistical mechanics and thermodynamics. The chapter on information theory is unusual for the mathematical methods textbooks at both the graduate and the undergraduate levels. By selecting certain sections, Chapters 16 and 17 can be incorporated into the advanced undergraduate curriculum. In their entirety, they are more suitable t o be used in a graduate course. Since we review the basic quantum mechanics needed, we require no prior exposure to quantum mechanics. In this regard, Chapter 17 is also designed to be useful to beginning researchers from a wide range of disciplines in science and engineering. Even though it is not meant to be complete, we have a rich list of references a t the back on probability theory, decision theory, game theory, and classical and quantum information theories. Others can be traced from these. Examples and exercises are always an integral part of any learning process, hence the topics are introduced with an ample number of examples. To maintain continuity of the discussions, we have collected excercises at the end of each chapter, where they are predominantly listed in the same order that they are discussed within the text. Occasionally, when proofs or extensions of certain results are too technical to be discussed within the text, they are assigned as exercises. Hence, it is recomended that the entire problem sections be read quickly before their solutions are attempted. Parts of this book are based on my lectures delivered at Canisius College, Buffalo, NY, during the years 1984-1986 and the Middle East Technical University, Ankara, Turkey, on various occasions. With their exclusive chap-
xxvi
PREFACE
ters, uniform level of formalism and coordinated, and complenientary coverage of topics, Essentzals of Mathematacal Methods an Scsence and Enganeerang connects with rny graduate textbook, Mathematzcal Methods zn Scaence and Engzneering, thus forming a complete set spanning a wide range of basic mathematical techniques for students, instructors, and researchers. For communications about the book and for some relevant sites to our readers, we will usc the website http://www.physics.metu.edu.tr/" bayin.
5.
Selquk Bayin ODTU Ankara, Turkey April 2008
Ac knowIedgment s
I would like to thank Prof. J.P. Krisch of the University of Michigan for always being there whenever I needed advice and for sharing my excitement at all phases of the project. My special thanks go to Prof. J.C. Lauffenburger and Assoc. Prof. K.D. Scherkoske at Canisius College. I am grateful to Prof. R.P. Langlands of the Institute for Advanced Study at Princeton for his support and for his cordial and enduring contributions t o METU culture. I am indebted to Prof. P.G.L. Leach for his insightful comments and for meticulously reading two of the chapters. I am grateful to Wiley for a grant to prepare the camera-ready copy, and I would like to thank my editor Susanne SteitzFiller for sharing my excitement. My work on the two books Mathematical Meth,ods in Science and Engineering and Essentials of Mathematical Methods in Science and Engineering has spanned an uninterrupted period of 6 years. With the time spent on my two books in Turkish published in the years 2000 and 2004, which were basically the forerunners of my first book, this project has dominated my life for almost a decade. In this regard, I cannot express enough gratitude to my darling young scientist daughter Sumru and beloved wife Adalet, for always being there for me during this long and strenuous journey, which also involved many sacrifices for them.
8.S.B. xxvii
This Page Intentionally Left Blank
CHAPTER 1
FUNCTIONAL ANALYSIS
A function is basically a rule that relates the members of one set of objects to the members of another set. In this regard, it has a very wide range of applications in both science and mathematics. Functional analysis is basically the branch of mathematics that deals with the functions of numbers. In this chapter, we confine ourselves t o the real domain and introduce some of the most commonly used techniques in functional analysis. 1.1 CONCEPT OF FUNCTION We start with a quick review of the basic concepts of set theory. Let S be a set of objects of any kind: points, numbers, functions, vectors, etc. When s is an element of the set S , we show it as s E
s.
(1.1)
For finite sets we may define S by listing its elements as SE
{Sl,SZ,...
>%I-.
Essentials of Mathematical Methods in Science and Engineering. By Copyright @ 2008 John Wiley & Sons, Inc.
(1.2)
9. S e l p k Bayin
1
2
FUNCTIONAL ANALYSIS
For infinite sets, S is usually defined by a phrase describing the condition to be a member of the set, for example,
S = {All points on the sphere of radius R } .
(1.3)
When there is no room for confusion, we may also write a n infinite set as
S = { l , 3 , 5 ,." } .
(1.4)
When each member of a set A is also a member of set B, we say that A is a subset of B and write
A
c B.
(1.5)
The phrase B covers or contains A is also used. The union of two sets,
A
U B,
(1.6)
consists of the elements of both A and B. The intersection of two sets, A and B,is defined as
A n B = {All elements common t o A and B } .
(1.7)
When two sets have no common element, their intersection is called the null set or the empty set, which is usually shown by 4. The neighborhood of a point, ( x l , y l ) , in the zy-plane is the set of all points, ( x , y ) , inside a circle centered at (zl, y1) and with the radius 6:
An open set is defined as the set of points with neighborhoods entirely within the set. The interior of a circle defined by
x2 + y2 < 1
(1.9)
is an open set. A boundary point is a point whose every neighborhood contains at least one point in the set and at least one point that does not belong to the set. The boundary of the set in Equation (1.9) is the set of points on the circumference, that is,
x2 + y2
= 1.
(1.10)
An open set plus its boundary is a closed set. A function, f , is in general a rule, a relation that uniquely associates members of one set, A , with the members of another set, B. The concept of function is essentially the same as that of mapping, which in general is so broad that it allows mathematicians to work with them without any resemblance to the simple class of functions with numerical values. The set
CONCEPT OF FUNCTION
3
A that f acts upon is called the domain, and the set B composed of the elements that f can produce is called the range. For single-valued functions the common notation used is f :z
+f(z).
(1.11)
Here f stands for the function or mapping that acts upon a single number z, which is an element of the domain, and produces f ( z ) ,which is an element of the range. In general, f refers to the function itself and f ( x ) refers to the value it returns. However, in practice, f ( z ) is also used t o refer to the function itself. In this chapter we basically concern ourselves with functions that take numerical values as f ( z ) ,where the argument, z, is called the independent variable. We usually define a new variable, y, as
which is called the dependent variable. Functions with multiple variables, that is, multivariate functions, can also be defined. For example, for each point (z,y) in some region of the zy-plane we may assign a unique real number, f ( z ,y), according t o the rule
We now say that f (z, y) is a function with two independent variables, 2 and y. In applications, f ( z ,y) may represent physical properties like the temperature or the density distribution of a flat disc with negligible thickness. Definition of function can be extended to cases with several independent variables as
where rL stands for the number of independent variables. The term function is also used for the objects that associate more than one element in the domain to a single element in the range. Such objects are called multiple-to-one relations. For example,
f ( z ,y) = 2zy + x2: f ( z ) = sinz: f ( z ,y) = z + x2: f ( z ) = x 2 , z # 0: f(z, y) = sin zy:
single-valued or one-to-one, many- t o-one, single-valued, two-to-one, many-to-one.
Sometimes the term “function” is also used for relations that map a single point in its domain to multiple points in its range. As we shall discuss in Chapters 7 and 8, such functions are called multivalued functions, which are predominantly encountered in complex analysis.
4
1.2
FUNCTIONAL ANALYSIS
CONTINUITY AND LIMITS
Similar to its usage in everyday language, the word continuity in mathematics also implies the absence of abrupt changes. In astrophysics, pressure and density distributions inside a solid neutron star are represented by continuous functions of the radial position: P ( r ) and p ( r ) , respectively. This means that small changes in the radial position inside the star also result in small changes in the pressure and density. At the surface, r = R, where the star meets the outside vacuum, pressure has to be continuous. Otherwise, there will be a net force on the surface layer, which will violate the static equilibrium condition. In this regard, in static neutron star models pressure has t o be a monotonic decreasing function of T , which smoothly drops to zero at the surface:
P ( R ) = 0.
(1.15)
On the other hand, the density at the surface can change abruptly from a finite value to zero. This is also in line with our everyday experiences, where solid objects have sharp contours marked by density discontinuities. For gaseous stars, both pressure and density have t o vanish continuously at the surface. In constructing physical models, deciding on which parameters are going to be taken as continuous at the boundaries requires physical reasoning and some insight. Usually, a collection of rules that have to be obeyed at the boundaries are called the junction conditions or the boundary conditions. We are now ready to give a formal definition of continuity as follows: Continuity: A numerically valued function f ( z ) defined in some domain D , is said to be continuous at the point 20 E D if, for any positive number E > 0, there is a neighborhood N about z g such that If(.) - f(zo)l < E for every point common to both N and D , that is N fl D. If the function f ( z ) is continuous at every point of D , we say it is continuous in D. We finally quote two theorems, proofs of which can be found in books on advanced calculus: Theorem 1.1. Let f ( z ) be a continuous function at z and let {z,} be a sequence of points in the domain of f ( z ) with the limit lim zn
n+cc
42 ;
(1.16)
then the following is true:
(1.17) Theorem 1.2. For a function f(x) defined in D , if the limit (1.18) exists whenever x, E D and lim
n-cc
2, +z E
D,
(1.19)
CONTINUITY AND LIMITS
5
then the function f(z)is continuous a t z. For the limit in Equation (1.18) to exist, it is sufficient t o show that the right and the left limits agree, that is, lim f(z- E )
E’O
=
+E),
(1.20)
f(.).
(1.21)
lim f(z
E+O
f (z-1 = f(.+)
=
In practice, the second theorem is more useful in showing that a given function is continuous. If a function is discontinuous at a finite number of points in its interval of definition, [z,,zb], it is called piecewise continuous. Generalization of these theorems t o multivariate functions is easily accomplished by taking z to represent a point in a space with n independent variables as
(1.22)
z = (z1, 5 2 , . . . ,z n ) .
However, with more than one independent variable one has to be careful. Consider the simple function
(1.23) which is finite at the origin. Depending on the direction of approach to the origin, f(h,y) takes different values: lim(z,y)+(o,o)f(z,y) lim(z,y)+(o,o)f(z,y) lim(z,y~+(o,o) f ( z ,y)
+0
if we approach along the y = z line, 1 if we approach along the z axis, + -1 if we approach along the y axis. +
Hence the limit lim(z,y)+(o,o) f(s, y) does not exist and the function f ( z , y ) is not continuous at the origin. Limits: Basic properties of limits, which we give for functions with two variables, also hold for a general multivariate function: Let u = f ( z , y ) and ‘u = g(z,y) be two functions defined in the domain D of the zy-plane. If the limits
exist, then we can write =
fo + go,
(1.26)
= f o . go, =
fo
-, go
go
(1.25)
# 0.
(1.27)
6
FUNCTIONAL ANALYSIS
If the functions f ( x , y ) and g ( x , y ) are continuous a t (xo,yo), then the functions
are also continuous at (zo, yo), provided that in the last case g(x,y) is different from zero at ( 5 0 yo). , Let F ( u , v ) be a continuous function defined in some domain Do of the uv-plane and let F ( f ( z ,y), g(x,y)) be defined for (x,y) in D. Then, if ( f o , go) is in Do, we can write (1.29) If f ( x ,y) and g(x,y) are continuous at ( 2 0 , yo), then so is F ( f ( z ,y ) , g(x,y)). In evaluating limits of functions that can be expressed as ratios, L’HBpital’s rule is very useful. L’Hbpital’s rule: Let f and g be differentiable functions on the interval a 5 x < b with g’(z) # 0 there, where the upper limit b could be finite or infinite. If f and g have the limits lim f(x) = 0 and lim g(x) = 0
(1.30)
lim f(x) = 03 and lim g ( x ) = 00,
(1.31)
f’(x) = L lim -
(1.32)
x-b
x-b
or x-b
x-b
and if the limit x+b
g’(Z)
exists, where L could be zero or infinity, then = L.
1.3
(1.33)
PARTIAL DIFFERENTIATION
A necessary and sufficient condition for the derivative of f(x) to exist at xo is that the left, f L ( z ~ )and , the right, f$(xo), derivatives exist and be equal (Fig. 1.1),that is, fL(It.0) =
f’(Zo),
(1.34)
where (1.35) (1.36)
7
PARTIAL DIFFERENTIATION
t'
line.
Figure
When the derivative exists, we always mean a finite derivative. If f ( x ) has derivative a t xo, it means that it is continuous a t that point. When the derivative of f (x)exists a t every point in the interval (a, b ) , we say that f (x) is differentiable in (a, b ) and write its derivative as (1.37) Geometrically, derivative a t a point is the slope of the tangent line at that point:
(1.38) When a function depends upon two variables: z
=
f (z, Y),
(1.39)
the partial derivative with respect to x at (xo,yo) is defined as the limit lim Ax-0
f
(20
+ Ax,Yo) Ax
-
f ( 2 0 , Yo)
(1.40)
and we show it as in one of the following forms:
Similarly, the partial derivative with respect to y at
( 2 0 yo) ,
is defined as
(1.42)
8
FUNCTIONAL ANALYSIS
A geometric interpretation of the partial derivative is that the section of the surface z = f ( x , y ) with the plane y = yo is the curve z = f(x,yo); hence the partial derivative ~ ( X yo) O , is the slope of the tangent line (Fig. 1.2) t o z = f (x, yo) at ( 2 0 ,yo). Similarly, the partial derivative ~ ( x oyo) , is the slope of the tangent line to the curve z = f(x0, y) at (XO, yo). For a multivariate function the partial derivative with respect to the i t h independent variable is defined as df(X1,.
=
. . , x i , . . . , xn) 8x2 f(x1,. . . , x i
lim
+ Axz,. . . , x n )
-
f ( x 1 , . . . , x i , .. .
AX^
A z , -0
'xn).
(1.43)
For a given f ( x , y) the partial derivatives fz and fy are functions of x and y and they also have partial derivatives which are written as f
--=--
22 -
a2f ax2
YI
--=.["i d2f
f xy
When f C c gand
- dxdy
fyz
dx dy
["I
- y dy=dy-' -
y y - a2f d
ax ax
I
f
yx -
dydx a2f
-
i"
dy a x
(1.44) (1.45)
are continuous at (20,yo), then the relation fzy
(1.46)
=fyz
holds at (20,yo). Under similar conditions this result can be extended to cases with more than two independent variables and to higher-order mixed partial derivatives.
1.4 TOTAL DIFFERENTIAL When a function depends on two or more variables, we have seen that the limit at a point may depend on the direction of approach. Hence, it is important that we introduce a nondirectional derivative for functions with several variables. Given the function
for a displacement of Ar = (Ax, Ay, Az) we can write its new value as
f(r
+ A r ) = (X + Ax)(z + Az)
-
(y
+A Y ) ~
(1.48)
+ X A Z+ Z A X+ AXAZ y2 - 2yAy ( A Y ) ~ (1.49) = (xz y2) + (ZAX 2yAy + XAZ)+ AXAZ ( A Y ) ~ , (1.50) = xz
-
-
-
-
-
TOTAL DIFFERENTIAL
Figure 1.2
Partial derivative, f z , is the slope of the tangent line to
9
z = f(z,yo).
where r stands for the point (x,y, z ) and A r is the displacement (Ax, Ay, Az). For small. A r the change in f (x,y, z ) to first order can be written as
A f = f ( +~AT) - f ( r ) = (XZ - y 2 ) + (zAx - 2yAy + ZAZ)- ( I C Z - y2), (1.51)
Af
=
ZAX- 2yAy + X A Z .
(1.52)
Considering that the first-order partial derivatives of f are given as
af = z , -a f-- -2y, -
af = 2 , -
(1.53)
a f + -Az. af + -Ay dY dz
(1.54)
aY
dX
dz
Equation (1.52) is nothing but
af Af = -Ax dX
In general, if a function f (x,y, z ) is differentiable at (x,y, z ) in some domain D with the partial derivatives (1.55) then the change in f(x,y, z ) in D t o first order in (Ax, Ay, as
Af
2
-Ax df dX
+ -Ay a f + -Az. af dY
dz
Az) can be written (1.56)
10
FUNCTIONAL ANALYSIS
Figure 1.3
Total differential gives a local approximationto the change in a function.
In the limit as A r
-+
0 we can write Equation (1.56) as (1.57)
which is called the total differential of f (2, y, z ) . In the case of a function with one variable, f (x),the differential reduces to
Af
N
dfAx,
(1.58)
dx
which gives the local approximation to the change in the function at the point x via the value of the tangent line (Fig. 1.3) at that point. The smaller the value of Ax, the better the approximation. In cases with several independent variables, Af is naturally approximated by using the tangent plane at that point.
1.5
TAYLOR SERIES
The Taylor series of a function about
1?(x n.
50, when
it exists, is given as
00
f(x)=
-
(1.59)
x0)n
n=O
= a0
a2 + al(x - 2 0 ) + -(x 2!
-
2
XO)
+ .' .
.
(1.60)
To evaluate the coefficients, we differentiate repeatedly and set x = xo to find
11
TAYLOR SERIES
(1.61)
where (1.62) and the zeroth derivative is defined as the function itself, that is,
f'O'(x) = f ( x ) .
(1.63)
Hence the Taylor series of a function with a single variable is written as (1.64) This formula assumes that f ( x ) is infinitely differentiable in an open domain including X O . Functions that are equal to their Taylor series in the neighborhood of any point xo in their domain are called analytic functions. Taylor series about xo = 0 are called Maclaurin series. Using the Taylor series, we can approximate a given differentiable function in the neighborhood of zo to orders beyond the linear term in Equation (1.58). For example, to second order we obtain
(1.66) (1.67) Since xo is any point in the open domain that the Taylor series exists, we can drop the subscript in xo and write
df A ( 2 ' f (= ~ )-AX dx
1d2f + --(AX) 2 dx2
2
,
(1.68)
where A(')f denotes the differential of f to the second order. Higher-order differentials are obtained similarly.
12
FUNCTIONAL ANALYSIS
The Taylor series of a function depending on several independent variables is also possible under similar conditions and in the case of two independent variables it is given as
(1.69) n=O
where the derivatives are to be evaluated at (x0,yo). For functions with two independent variables and to second order in the neighborhood of (x,y ) , Equation (1.69)gives
which yields the differential, A(2)f (x, y) = f (x
+ Ax, y + Ay)
-
f ( x , y), as
(1.71)
For the higher-order terms note how the powers in Equation (1.69)are expanded. Generalization to n independent variables is obvious.
Example 1.1. Partial derivatives: Consider the function
z(x,y)
= xy2
Partial derivatives are written as dz
- = y2
dX dz
+ ex.
+ ex,
(1.74) (1.75)
- = 2xy,
d
&
dY dz
(&)
d22 = @ = ex,
&)=v d
dz
$($)=z&-
d2z
= 22,
d2z -
d 2z
(1.73)
2Y,
(1.76) (1.77) (1.78)
&($)=a-
2y.
(1.79)
TAYLOR SERIES
13
Example 1.2. Taylor series: Using the partial derivatives obtained in the previous example, we can write the first two terms of the Taylor series [Eq. (1.69)] of z = zy2 + e" about the point (0, I). First, the required derivatives at ( 0 , l ) are evaluated as
z ( 0 , l ) = 1,
(1.80) (1.81)
Using these derivatives we can write the first two terms of the Taylor series about the point (0,1>as
z(x, y) = z ( 0 , I )
($) (")
+
(Y-1)
0
+ - (1- ) 0 d 22 2+ z
x ( y - l ) + - ( -1) d 2 z ( y - 1 I 2 + . dXdY 0 2 dY2 0 1 1 = 1 + 22 + O(y - 1) + -x2 22(y - 1) -O(y - 1 ) 2 2 2 (1.87) 1 (1.88) = 1 22 -x2 2x(y - 1) + . .. . 2 2
8x2
+
+ +
+
+
t . .
+
where the subscript 0 indicates that the derivatives are to be evaluated at the point ( 0 , l ) . To find A(2)z(0,l ) ,which is good to the second order, we first write Lwz(0,l) =
(g)o + ($) ay Ax
(1.89)
0
= 2Ax
(1.90)
14
FUNCTIONAL ANALYSIS
Figure 1.4
Maximum and minimum points of a function.
and then obtain
(1.91)
1 = 2Ax + - (Ax)’ 2
+ 2AxAy.
(1.92)
1.6 M A X I M A A N D M I N I M A OF F U N C T I O N S We are frequently interested in the maximum or the minimum values that a function, f ( z ) , attains in a closed domain [a,b].The absolute maximum, M I , is the value of the function at some point, XO, if the inequality MI
=f(X0)
2 f(.)
(1.93)
holds for all x in [a,b]. An absolute minimum is also defined similarly. In general we can quote the following theorem (Fig. 1.4): Theorem 1.3. If a function, f(x), is continuous in the closed interval [a,b], then it possesses an absolute maximum, M I , and an absolute minimum, Adz, in that interval. Proof of this theorem requires a rather detailed analysis of the real number system, which can be found in books on advanced calculus. On the other hand, we are usually interested in the extremum values, that is, the local maximum or the minimum values of a function. Operationally, we can determine whether a given point, XO, corresponds to an extremum or not by
MAXIMA AND MINIMA OF FUNCTIONS
Figure 1.5
15
Analysis of critical points.
looking at the change or the variation in the function in the neighborhood of 2 0 . The total differential introduced in the previous sections is just the tool needed for this. We have seen that in one dimension we can write the first, Af('), the second, A(2)f , and the third, A(3)f , differentials of a function with single independent variable as (1.94) (1.95)
Extremum points are defined as the points where the first differential vanishes, which means (1.97) In other words, the tangent line a t an extremum point is horizontal (Fig. 1.5a,b). In order to decide whether an extremum point corresponds t o a local maximum or minimum we look at the second differential: (1.98) For a local maximum the function decreases for small displacements about the extremum point (Fig. 1.5a), which implies A(2)f(xo)< 0. For a local minimum a similar argument yields Ac2)f (xg) > 0. Thus we obtain the following criteria: = 0 and
(s) < 0 d2f
for a local maximum
(1.99)
for a local minimum.
(1.100)
50
and = 0 and
(z) d2f
xo
>0
16
FUNCTIONAL ANALYSIS
Figure 1.6
Plot of y(z) = z3.
In cases where the second derivative also vanishes, we look at the third differential, ~ l ( ~ ) f (We z ~now ) . say that we have an inflection point; and depending on the sign of the third differential, we have either the third or the fourth shape in Figure 1.5. Consider the function
f(.) = x 3 ,
(1.101)
where the first derivative, f ’ ( z ) = 3x2, vanishes at zo = 0 . However, the second derivative, f ” ( z ) = 622, also vanishes there, thus making 20 = 0 a point of inflection. From the third differential: (1.102)
1 3!
= -6(Az)3,
(1.103)
we see that A(3)f(zo)> 0 for Ax > 0 and A(3)f(zo)< 0 for Az < 0. Thus we choose the third shape in Figure 1.5 and plot f ( z ) = z3 as in Figure 1.6. Points where the first derivative of a function vanishes are called the critical points. Usually the potential in one-dimensional conservative systems can be represented by a (scalar) function, V ( z ) .Negative of the derivative of the potential gives the z component of the force on the system:
F,(z)
=
dV dz
--.
(1.104)
Thus the critical points of a potential function, V ( z ) correspond , t o the points where the net force on the system is zero. In other words, the critical points are the points where the system is in equilibrium. Whether an equilibrium is stable or unstable depends on whether the critical point is a minimum or maximum, respectively. Analysis of the extrema of functions depending on more than one variable follows the same line of reasoning. However, since we can now approach the
MAXIMA AND MINIMA OF FUNCTIONS
17
critical point from infinitely many different directions, one has to be careful. Consider a continuous function
z = f(X,Y),
(1.105)
defined in some domain D. We say this function has a local maximum at ( 2 0 , yo) if the inequality S(X,Y)
5 f(X0,Yo)
is satisfied for all points in some neighborhood of minimum if the inequality
(1.106) ( 5 0 , yo)
and to have a local
f ( x , Y) 2 f(z0,Yo)
(1.107)
is satisfied. In the following argument we assume that all the necessary partial derivatives exist. Critical points are now defined as the points where the first differential, A(')f(z, y), vanishes:
A ( l ) f ( ~ , y=) AX :[
+3 A y ] dY
= 0.
(1.108)
Since the displacements A x and Ay are arbitrary, the only way to satisfy this equation is to have both partial derivatives, fz and fv, vanish. Hence at the critical point ( I C O , yo), shown with the subscript 0, one has
(g)o
= 0,
(1.109)
($)o
= 0.
(1.110)
To study the nature of these critical points, we again look at the second differential, A(2)f(xo,yo), which is now given as
For a local maximum the second differential has to be negative, A(2)f(xo,yo) < 0, and for a local minimum positive, ~ I ( ~ ) f ( xyo) o , > 0. Since we can approach the point (50,yo) from different directions, we substitute (Fig. 1.7)
Ax
= Ascosd
and Ay
= Assind
(1.112)
to write Equation (1.111) as 1
A(2)f(xo,yo)= - [ A c o s 2 d + 2 B c o s d s i n ~ + C s i n 2 d ]AS)^, 2
(1.113)
18
FUNCTIONAL ANALYSIS
Figure 1.7
Definition of As.
where we have defined
A=
(g)o,(g)o> (w),’ f B=
‘=
d2
(1.114)
Now the analysis of the nature of the critical points reduces to investigating the sign of ~ I ( ~ ) f ( yo) z o ,[Eq. (1.113)]. We present the final result as a theorem (Kaplan). Theorem 1.4. Let z = f(z, y) and its first and second partial derivatives be continuous in a domain D and let (20,yo) be a point in D , where the partial derivatives (&)nand
($)
vanish. Then, we have the following cases:
n
I. For B2 - AC-< 0 and A % C < 0 we have a local maximum at (20,yo). 11. For B2 - AC < 0 and A + C > 0 we have a local minimum at (zo, yo). 111. For B2 - AC > 0 , we have a saddle point a t (z0,yo). IV. For B2 - AC = 0 , the nature of the critical point is undetermined. When B2 - AC > 0 at (z0,yO) we have what is called a saddle point. In this case for some directions A ( 2 ) f ( z ~ , y ois) positive and negative for the others. When B2 - AC = 0 , for some directions A(’)f(zo,yo) will be zero, hence one must look at higher-order derivatives to study the nature of the critical point. When A , B , and C are all zero, then A(2)f ( 2 0 , yo) also vanishes. Hence we need to investigate the sign of A(3)f (zo,yo).
1.7
EXTREMA OF FUNCTIONS W I T H CONDITIONS
A problem of significance is finding the critical points of functions while satisfying one or more conditions. Consider finding the extremums of
w
= f(z,y,z)
(1.115)
gl(z,Y,z) = 0
(1.116)
while satisfying the conditions
EXTREMA OF FUNCTIONS WITH CONDITIONS
19
In principle the two conditions define two surfaces, the intersection of which can be expressed as (1.118) (1.119) (1.120) where we have used the variable x as a parameter. We can now substitute this parametric equation into w = f (x,y, z ) and write it entirely in terms of 2 as
extremum points of which can now be found by the technique discussed in the previous section. Geometrically, this problem corresponds to finding the y, z ) on the curve defined by the intersection of extremum points of w = f(z, g1(.r, y, z ) = 0 and g2(x, y, z ) = 0. Unfortunately, this method rarely works to yield a solution analytically. Instead, we introduce the following method: At a critical point we have seen that the change in w to first order in the differentials Ax, Ay, and Az is zero:
Aw
=
af -Ax dX
8.f af + -Az + -Ay dY dz
= 0.
(1.122)
We also write the differentials of g1(x, y, z ) and g2(2,y, z ) as
%ax + -Ay ag1 dX
dY
-Ax dg2
+ -Ay ag2
dX
dY
+ -Az 891
=0
dz
(1.123)
and
+dg2 az
= 0.
dz
We now multiply Equation (1.123) with A 1 and Equation (1.124) with add to Equation (1.122) to write
(1.124) A2
and
(1.125) Because of the given conditions in Equations (1.116) and (1.117), Ax,Ay, and Az are not independent. Hence their coefficients in Equation (1.122)
20
FUNCTIONAL ANALYSIS
cannot be set to zero directly. However, the values of A 1 and X2, which are called the Lagrange undetermined multipliers, can be chosen so that the coefficients of A x ,Ay, and Az are all zero in Equation (1.125):
(1.126) (1.127) (1.128) Along with the two conditions, g1(x, y,z ) = 0 and g2(x, y,z ) = 0, these three equations are t o be solved for the five unknowns:
The values that A 1 and A2 assume are used to obtain the x,y, and z values needed, which correspond to the locations of the critical points. Analysis of the critical points now proceeds as before. Note that this method is quite general and as long as the required derivatives exist and the conditions are compatible, it can be used with any number of conditions.
Example 1.3. E x t r e m u m problems: We now find the dimensions of a rectangular swimming pool with fixed volume Vo and minimal area of its base and sides. If we denote the dimensions of its base with x and y and its height with z , the fixed volume is
vo = xyz
(1.130)
and the total area of the base and the sides is
a
= xy
+ 2x2 + 2yz.
(1.131)
Using the condition of fixed volume we write a as a function of x and y as
avo + -.avo
a = xy+ -
Y
X
(1.132)
Now the critical points of a are determined from the equations
(1.133) which give the following two equations:
(1.134) (1.135)
21
EXTREMA OF FUNCTIONS WITH CONDITIONS
or
yz2 - 2vo = 0,
(1.136)
2vo = 0.
( 1.137)
zy2
-
If we subtract Equation (1.137) from Equation (1.136), we obtain
(1.138)
Y = 5,
which when substituted back into Equation (1.136) gives the critical dimensions
(1.139) (1.140)
.=(?)
1/3
,
(1.141)
where the final dimension is obtained from Vo = xyz. To assure ourselves that this corresponds to a minimum, we evaluate the second-order derivatives at the critical point,
(1.142) (1.143)
(I.144) and find
B2 - AC
=
1-4
=
- 3 < 0 and A + C = 2 + 2 = 4 > 0.
(1.145)
Thus the critical dimensions we have obtained [Eqs. (1.139)-(1.141)] are indeed for a minimum by Theorem 1.4.
Example 1.4. Lagrange undetermined multipliers: We now solve the above problem by using the method of Lagrange undetermined multipliers. The equation to be minimized is now f(5, y, z ) = xy
+ 2zz + 2yz
(1.146)
with the condition g(z, g, 2 ) =
& - xyz = 0.
(1.147)
22
FUNCTIONAL ANALYSIS
The equations to be solved are obtained from Equations (1.126)-(1.128) as
y x 22
+ 22 - yzx = 0, + 22 xzx = 0, + 2y xxy = 0. -
(1.148) (1.149)
-
(1.150)
Along with VO= xyz, these give 4 equations to be solved for the critical dimensions x , y , z , and A. Multiplying the first equation by x and the second one by y and then subtracting gives
x
= y.
(1.151)
Substituting this into the third equation [Eq. (1.150)] gives the value of the Lagrange undetermined multiplier as A = 4/x, which when substituted into Equations (1,148)-(1.150) gives
xy
+ 2x2 4yz = 0, x + 22 - 42 = 0, 22 + 2y 4y = 0. -
-
(1.152) (1.153) (1.154)
Using the condition Vo = xyz and equation (1.151) these three equations [Eqs. (1.152)-(1.154)] can be solved easily to yield the critical dimensions in terms of Vo as =
(1.155)
y=
(1.156)
(T)
1/3
z=
(1.157)
Analysis of the critical point is done as in the previous example by using Theorem 1.4.
1.8 DERIVATIVES A N D DIFFERENTIALS OF COMPOSITE FUNCTIONS
In what follows we assume that the functions are defined in their appropriate domains and have continuous first partial derivatives. Chain rule: If z = f ( x , y) and x = x ( t ) , y = y(t), then
dz - -_ dzdx dt
Similarly, if z
= f ( x , y)
dx dt
+--ddyz ddty
and x = g ( u , v) and y = h(u,v), then
(1.158)
DERIVATIVES AND DIFFERENTIALS OF COMPOSITE FUNCTIONS
23
(1.159) (1.160)
A better notation t o use is
(1.162) This notation is particularly useful in thermodynamics, where z may also be expressed with another choice of variables, such as
(1.163) (1.164) (1.165) Hence, when we write the derivative
dz -
dX’
(1.166)
we have t o clarify whether we are in the ( ~ , y or ) the ( x , w ) space by writing
(1.167) These formulas can be extended to any number of variables. Using Equation (1.158) we can write the differential dz as
dz =
(”ax at +--d y ”) dt at dz
= -dx
ax
dz + -dy. dy
(1.168) (1.169)
We now treat x,y and z as functions of (u, v) and write the differential dz as
dz dU
dz
dz = - du + - dv
=
(g)
dV
(1.170) (1.171)
24
FUNCTIONAL ANALYSIS
Since z and y are also functions of u and u,we have the differentials (1.173) and (1.174) which allow us to write Equation (1.172) as dz
=
dz
dz
dX
dY
- dX + - dy.
(1.175)
This result can be extended t o any number of variables. In other words, any equation in differentials that is true in one set of independent variables is also true for another choice of variables. Formal proofs of these results can be found in books on advanced calculus (Apostol, Kaplan). 1.9
IMPLICIT FUNCTION THEOREM
A function given as
can be used to describe several functions of the form
z = f(X,Y), y = g(x,z ) , etc.
(1.177)
+ z2
(1.179)
(1.178)
For example,
x2 +y2
-
9=0
can be used to define the function
z
=
JW'
(1.180)
or (1.181) both of which are defined in the domain x2 + y2 + z 2 5 9. We say these functions are implicitly defined by Equation (1.179). In order t o be able to define a differentiable function. = f ( x ,Y),
(1.182)
IMPLICIT FUNCTION THEOREM
25
by the implicit function F ( x ,y, z ) = 0, the partial derivatives
a f and ax
af
(I.183)
-
ay
should exist in some domain so that we can write the differential (1.184) Using the implicit function F ( x ,y, z ) = 0, we write
F, dx
+ Fu d y + F, dz = 0
(1.185)
and F X
dz = -- dx F,
-
3 dy,
(1.186)
Fz
where
dF F --, F
,-ax
dF
--
dy
y -
andF,=-
dF dz
(1.187)
Comparing the two differentials [Eqs. (1.184) and (1.186)], we obtain the partial derivatives (1.188) Hence? granted that F, # 0, we can use the implicit function F ( x ,y , z ) = 0 to define a function of the form z = f ( x , y ) . We now consider a more complicated case, in which we have two implicit functions: (1.189) (1.190) Using these two equations in terms of four variables, we can solve, in principle, for two of the variables in terms of the remaining two as (1.191) (1.192) For f (x,y ) and g(x,y) to be differentiable, certain conditions must be met by F ( x ,y, z , w) and G ( x ,y, z , w). First we write the differentials
+
+
+
F, dx Fy dy F, dz F, dw = 0 , G, dx+Gy dy+G, dz+G, dw=O
(1.193) (1.194)
26
FUNCTIONAL ANALYSIS
and rearrange them as
+
F, d z Fw d w G, dz + Gw d w
-Fz d x - Fy d y ; = -G, d x - G, dy. =
We now have a system of two linear equations dur to be solved simultaneously. We can either determinants and the Cramer’s rule to write -F, d x - Fy dy -G, d x - Gy d y dz =
(1.195) (1.196)
for the differentials d z and solve by elimination or use
Gw Fw
I
(1.197)
and
F, dw =
~
G,
-F, d x -G, d x
Fy d y - G, d y -
(1.198)
Using the properties of determinants, we can write these as
and
For differentiable functions, z = f (x,y ) and w = g ( x , y ) , with existing firstorder partial derivatives we can write (1.201) (1.202) Thus by comparison with Equations (1.199) and (l.200), we obtain the partial derivatives
d ( F ,G) a ( F ,G) d f - - a(xlw) 3f - - d(Y,W) d(F,G)’ & d(F,G) dx q z , w) a ( z , w)
(1.203)
IMPLICIT FUNCTION THEOREM
27
and
(1.204)
(1.205) are called the Jacobi determinants. In summary, given two implicit equations
we can define two differentiable functions = f ( x , y ) and
w
= g(Z,Y)
(1.207)
with the partial derivatives given as in Equations (1.203)-(1.204), provided that the Jacobian
(1.208) is different from zero in the domain of definition. This useful technique can be generalized t o a set of m equations in n number of unknowns:
+m
(1.209)
(1.210)
28
FUNCTIONAL ANALYSIS
and obtain a set of m linear equations to be solved for the m differentials, d y i , i = 1,.. . ! nz, of the dependent variables. Using Cramer’s rule, we can solve for dyi if and only if the determinant of the coefficients is different from zero, that is,
To obta.in closed expressions for the partial derivatives,
(1.213)
we take partial derivatives of the Equations (1.209) to write
(1.2 14)
dYi
which gives the solubion for - as dXj
and similar expressions for the other partial derivatives can be obtained. In general, granted that. the Jacobi determinant does not vanish, namely
IMPLICIT FUNCTION THEOREM
29
dYi we can obtain the partial derivatives - as dXj
8% dXj
q y 1 , . . . ,yi-1, Xj,yi+1,. ‘ . ,Ym) d(F1,. ,Fm)
>
( 1.217)
”
a(vl,.. . > Ym) where i = 1 , .. . , m and j = 1,.. . n.We conclude this section by stating the implicit function theorem, a proof of which can be found in Kaplan: Implicit function theorem: Let the functions
Fi(y1,. . . , y m , x l , . . . ,xn)= 0, i = 1 , . . . ,m,
(1.218)
be defined in the neighborhood of the point
with continuous first-order partial derivatives existing in this neighborhood. If (1.220) then in an appropriate neighborhood of Po,there is a unique set of continuous functions yi = fi(zl,.. . ,x,), i = l , ,. . ,m,
(1.221)
with continuous partial derivatives,
where i = 1 , .. . , m and j = 1 , . . . n,such that ;yoi = fi(z01,. . . , ZO,),
i = 1 , .. . , m,
(1.223)
and
Fi(fl(zl,. . . , z n ) ., . . , f m ( z l , . . . , z n ) , z l , . . . ,x,) = 0, i = l , ,. . , m , (1.224) in the neighborhood of Po. Note that if the Jacobi determinant [Eq. (1.120)] is zero at the point of interest, then we search for a different set of dependent variables to avoid the difficulty.
30
FUNCTIONAL ANALYSIS
1.10 INVERSE FUNCTIONS
A pair of functions, (1.225) (1.226) can be considered as a mapping from the xy space to the uu space. Under certain conditions, this maps a certain domain D,, in the xy space t o a certain domain D,, in the uu space on a one-to-one basis. Under such conditions, an inverse mapping should also exist. However, analytically it may not always be possible to find the inverse mapping or the functions: (1.227)
( 1.228) In such cases, we may consider Equations (1.225) and (1.226) as implicit functions and write them a s
We can now use Equation (1.215) with y1 = u,y2 = u and x1 write the partial derivatives of the inverse functions as
= x, x2 = y
to
a F 1 , F2) (1.231)
(1.232)
(1.233) Similarly, the other partial derivatives can be obtained. As seen, the inverse function or the inverse mapping is well-defined only when the Jacobi determinant J is different from zero, that is, (1.234) where J is also called the Jacobian of the mapping. We will return to this point when we discuss coordinate transformations in Chapter 3. Note that
INVERSE FUNCTIONS
31
the Jacobian of the inverse mapping is 1/J.In other words,
(1.235)
Example 1.5. Change of independent variable: We now transform the Laplace equation:
(1.236) into polar coordinates, that is, to a new set of independent variables defined by the equations
x = r cos 4,
(1.237) (1.238)
y = r sin 4,
4 E [0,27r]. We first
where r E (0, cm)and of 2 = z(x,y) :
write the partial derivatives
dz d z d x dzdy - -+ --, dr dxdr dydr dz d z d x dzdy --a$ - dxdcp +--> dyd$
(1.239) (1.240)
which lead to d z = dz
-cos$+-sin$, dz .
dY
dx
dr
d z = -(-rsind) dz
a$
ax
+ -(rcosd). dz dY
(1.241) (1.242)
Solving for dzldx and dzldy,we obtain
dz
dz
- = -cosq!dx dr dz az . - = -sin$ dy dr
dz 1 --sin$,
(1.243)
dz 1 + -cos$.
(1.244)
84
84 r
32
FUNCTIONAL ANALYSIS
We now repeat this process with dz/dx to obtain the second derivative d 2 z / d z 2 as
[
1
sin4 d d z -cos+--sin4 r 84 ar 84 r . d 2z d2z 2 d2z 1 - -cos2 4 - -cos 4 sin 4 + -- sin2 4 dr drd4 r r2 1dz 2 dz 2 +--sin 4+--sin@cos4. (1.245) r dr 84 r2
A similar procedure for dz/dy yields d 2 z / d y 2 : d22 d2z . 2 822 2 d2z 1 -=-sin 4+-sin 4cos 4 -- cos2 4 dy2 dr2 drd4 r d42 r2 182 2 a2 2 -- cos 4 - -- sin4cos4. (1.246) r dr dd r2
+
,
+
Adding Equations (1.245) and (1.246), we obtain the transformed equation as
d 2 z ( r ,6 ) dr
( r ,0) z ( r ,6 ) + -r1-d z dr + -r21 d 2&b2 = 0.
(1.247)
Since the Jacobian of the mapping is different from zero, that is, J = - -d(x,Y)
d ( r , Q )-
I
- rc0s4 sin$
rcos4
= r, r
# 0,
(1.248)
the inverse mapping exists and it is given as
r=d
1.11
m
(1.249)
4= tan-' 2. 5
(1.250)
INTEGRAL CALCULUS A N D T H E D E F I N I T E INTEGRAL
Let f ( x ) be a continuous function in the interval [x,, 561. By choosing (n- 1) points in this interval, xl,z 2 , . . , ~ ~ - we 1 ,can subdivide it into n subintervals, Ax1 , Ax2, . . . , Az,, which are not necessarily all equal in length. From
INTEGRAL CALCULUS AND THE DEFINITE INTEGRAL
33
-z
AX, Ax2 Ax3 xo
XI
x2
Figure 1.8
Ax4
x3
.-.X b
*
Upper (left) and lower (right) Darboux sums.
Theorem 1.3 we know that f(x) assumes a maximum, M , and a minimum, m,in [x,,xb].Let Mi represent the maximum and mi the minimum values that f (x)assumes in Axi. We now denote a particular subdivision by d and write the sum of the rectangles shown in Figure 1.8 (left) as n
S ( d )= C M Z A X ,
(1.251)
i=l
and in Figure 1.8 (right) as n
~ ( d=)
C
(1.252)
miAXi.
i=l
The sums S ( d ) and s ( d ) are called the upper and the lower Darboux sums, respectively. Naturally, their values depend on the subdivision d. We pick the smallest of all S ( d ) and call it the upper integral of f(x) in [x,,xb]: (1.253) Similarly, the largest of all s ( d ) is called the lower integral of f(x) in [x,,xb] : (1.254) When these two integrals are equal, we say the definite integral of f (x)in the interval [x,,xb] exists and we write
I:'
-f ( x ) dx = l y f ( x ) dx = -
l:
f(x) dx.
( 1.255)
34
FUNCTIONAL ANALYSIS
T' Figure 1.9
Riemann integral
This definition of integral is also called the Riemann integral, and the function f(x) is called the integrand. Darboux sums are not very practical to work with. Instead, for a particular subdivision we write the sum n
a(d) =
f(zk)axk,
(1.256)
k=l
where 5 k is an arbitrary point in Axk (Fig. 1.9). It is clear that the inequality
s ( d ) 5 a ( d )5 S ( d )
(1.257)
is satisfied. For a given subdivision the largest value of Axi is called the norm of d , which we will denote as n ( d ) . 1.12
R I E M A N N INTEGRAL
We now give the basic definition of the Riemann integral as follows: Definition 1.1. Given a sequence of subdivisions d l , dz, . . . of the interval [x(~ q,] , such that the sequence of norms n ( d l ) ,n ( d z ) , . . . has the limit lim n(&)
---f
k-oo
( 1.258)
0
and if f ( ~ is ) integrable in [ x , , z ~ ] then , the Riemann integral is defined as
f(x) dx = lim a ( & ) , k-cc
(1.259)
where lim S ( d k ) = lim s ( d k ) = lim a ( & ) .
k-cc
k-cc
k-cc
(1.260)
RIEMANN INTEGRAL
35
Theorem 1.5. For the existence of the Riemann integral
L-b
f(x) dx,
where x, and xb are finite numbers, it is sufficient t o satisfy one of the following conditions: i) f ( x ) is continuous in [x,,zb]. ii) f(z)is bounded and piecewise continuous in [x,,z b ] . From these definitions we can deduce the following properties of Riemann integrals. Their formal proofs can be found in books on mathematical analysis such as Apostol: I. If fl(z)and fi(z) are integrable in [z,,zb],then their sum is also integrable and we can write
JI:'
[fl
(z)
+ f 2 ( ~ ) 1 dx =
l"
fl(z) dx +
Ixb
f2(z) dz.
(1.261)
2,
11. If f(x) is integrable in [z,, zb],then the following are true: a f ( z )dz = a
i:'
f(z)d z , a is a constant,
(1.262)
(1.263)
(1.264)
(1.265)
111. If f(z)is continuous and f(x) 2 0 in [z,,xb],then
f(z)dx = 0 means . f ( z ) = 0. IV. -The average or the mean, defined as
(f), of f(z)in the interval
(1.266)
[z,,zb]
is
(1.267)
36
FUNCTIONAL ANALYSIS
If f ( x ) is continuous, then there exist a t least one point z* E [x,,xb] such that
1:
f ( ~dx) = f ( ~ * ) ( b - a).
(1.268)
This is also called the mean value theorem or Rolle's theorem. V. If f ( x ) is integrable in [x,,xb]and if x, < z,< X b , then
l:
f ( z ) dx =
l:
f ( x )d z
+
1"
f ( x ) dx.
( 1.269)
VI. If f ( z ) 2 g(z) in [x,,xb],then ( 1.270) VII. Fundamental theorem of calculus: If f ( z ) is continuous in [x,,zb], then the function
(1.271) is also a continuous function of x in [z,, zb]. The function F ( x ) is differentiable for every point in [x,,zb] and its derivative at x is f ( x ) :
(1.272)
F ( z ) is called the primitive or the antiderivative of f ( x ) .Given a primitive, F (x),then F ( x ) + constant
(1.273)
is also a primitive. If a primitive is known for [x,,xb], then we can write
l:
f(x) dx
=
1:'
dx
(1.274) (1.275) (1.276)
When the region of integration is not specified, we write the indefinite in-
tegral
1
f ( x ) dx = F ( x )
+ C,
where C is an arbitrary constant and F ( z ) is any function the derivative of which is f(x).
37
IMPROPER INTEGRALS
VIII. If f(x) is continuous and f(x) 2 0 in [z,, zb], then geometrically the integral (1.277) Jza
is the area under f (x)between 2, and 2 6 . IX. A very useful inequality in deciding whether a given integral is convergent or not is the Schwarz inequality:
(1.278)
X. One of the most commonly used techniques in integral calculus is the integration by parts:
i:'
uddx = [UW];~
(1.279)
or
I:'
u du = [ U U ] ; ~-
1'"
u du,
(1.280)
where the derivatives u' and v' and u and v are continuous in [x,,xb]. XI. In general the following inequality holds:
szab
sxxab
that is, if the integral If(x)l dx converges, then the integral f(x) dx also converges. A convergent integral, f(x) dx, is said to be absolutely convergent, if If(x)l dx also converges. Integrals that converge but do not converge absolutely are called conditionally convergent.
sz:
s'y
1.13
IMPROPER INTEGRALS
We introduced Riemann integrals for bounded functions with finite intervals. Improper integrals are basically their extension to cases with infinite range and to functions that are not necessarily bounded. Definition 1.2. Consider the integral rc
(1.281) which exists in the Riemann sense in the interval [a,c],where a < c < b. If the limit
(1.282)
38
FUNCTIONAL ANALYSIS
exists, where the function f ( x ) could be unbounded in the left neighborhood b of b, then we say the integral f ( x )dx exists, or converges, and write
sa
[/(XI
dx = A .
(1.283)
Example 1.6. Improper integrals: Consider the improper integral (1.284) where the integrand, x / ( l - x ) l l 2 , is unbounded at the end point x = 1. We write I1 as the limit (1.285) =
lim
2(1 - x)3/2
(1.286)
c-1-
thereby obtaining the value of I1 as 413. We now consider the integral (1.288) which does not exist since 12 =
lim
1': 5
(1.289)
(1 - 2 ) = lim [-1n(l - x ) ] : c-1-
0
(1.290)
C-1-
=
lirn [-In(1 - c)] 4
00.
c-1-
(1.291)
In this case we say the integral does not exist or is divergent, and for its value we give fco.
A parallel argument is given if the integral
ib
f ( x ) dx
(1.292)
exists in the interval [c,b ] , where a < c < b. We now write the limit b
I = lim c-a+
f ( x ) dx,
(1.293)
IMPROPER INTEGRALS
39
where f(x) could be unbounded in the right neighborhood of a. If the limit (1.294) exists, we write
{ f(x) dx
= B.
(1.295)
We now present another useful result from integral calculus: Theorem 1.6. Let c be a point in the interval ( a , b ) and let f(x) be integrable in the intervals [a,a’] and [b’, b ] , where a < a’ < c < b’ < b. Furthermore, f(x) could be unbounded in the neighborhood of c. Then the integral (1.296) exists if the integrals (1.297) and b
I2 =
f(x) dx
(1.298)
both exist and when they exist, their sum is equal to I : I = 11 + 1 2 .
If either 11 or
12
(1.299)
diverges, then I also diverges.
Example 1.7. I m p r o p e r integrals: Consider the integral (1.300) (1.301) which converges provided that the integrals in Equation (1.301) converge. However, they both diverge: = lim
dx - = lim [ln1x1]: x c40-
- lim 1nIcl + -a (1.302) - c-0-
40
FUNCTIONAL ANALYSIS
and similarly,
i3e+
lim
2
c-o+
dx = lirn ; c+o+
[In 1x11:
-
In 3 - lim In IcI c-o+
--j
+a, (1.303)
hence the integral,
l:J $, also diverges.
When the range of the integral is infinite, we use the following results: If f(x) is integrable in [ q b ] and the limit rb
exists, we can write
La
f(x) dx = A.
(1.305)
f(x) dz
(1.306)
Similarly, we define the integral = B.
If the integrals (1.307) and (1.308) both exist, then we can write (1.309)
1.14
CAUCHY PRINCIPAL VALUE INTEGRALS
In Example 1.7, since the integrals
11 = l ! J
$ and 12 = Ji% both diverge,
-
%
we used Theorem 1.6 to conclude that the integral I = J !l is divergent. However, notice that I1 diverges as 1nIe -00, while I , diverges as lim,,o+(- In Icl) +cm.In other words, if we consider the two integrals
-
CAUCHY PRINCIPAL VALUE INTEGRALS
41
together, the two divergences offset each other, thus yielding a finite result for the value of the integral as (1.310) =
lim In IcI - In 1
C-0-
+ In3 -
lim In IcI -+ In3
(1.311)
c-o+
= ln3.
(1.312)
J21
The problem with $ is that the integrand, 1/x, diverges at the origin. However, at all the other points in the range [-1,3] it is finite. In Riemann integrals (Theorem 1.6), divergence of either I I or I2 is sufficient to conclude that the integral I does not exist. However, as in the above case, sometimes by considering the two integrals, I1 and 1 2 , together, one may obtain a finite result. This is called taking the Cauchy principal value of the integral. Since it corresponds t o a modification of the Riemann definition of integral, it has to be mentioned explicitly that we are taking the Cauchy principal value as X
= ln3.
(1.313)
Another example is the integral cc
I =
[
( 1.314)
x3dx,
J -co
which is divergent in the ordinary sense, since a4 + 00. x3dx = lim l a x 3 d x = lim a-cc a-co 4
(1.315)
However, if we take its Cauchy principal value, we obtain lim x3dx = a-cc
[Ta + la x3dx
x’dx]
(1.316) (1.317)
Example 1.8. Cauchy principal value: Considering the integral O3
( 1 + x ) dx
(1.318)
we write
( 1.319)
42
FUNCTIONAL ANALYSIS
For a finite c we obtain the integral (1.320) = tan-'
c
+ -21 l o g ( l + c'),
(1.321)
+
+
log(1 c')] 00. which in the limit as c + 00 diverges as [tan-' c Hence the integral I also diverges in the Riemann sense by Theorem 1.6. However, since the other integral also diverges, but this time as tan-'(-c)
00'C
-
C-00
1 2
- log(1
1
+ c') ,
--f
(1.322)
we consider the two integrals in Equation (1.319) together to obtain the Cauchy principal value of I as O0
1.15
( 1 + x ) dx
(1.323)
=T.
INTEGRALS I N V O L V I N G A P A R A M E T E R
Integrals given in terms of a parameter play an important role in applications. In particular, integrals involving a parameter and with infinite range are of considerable significance. In this regard, we quote three useful theorems: Theorem 1.7. If there exists a positive function Q(x) satisfying the inequality /f(cr,x)I Q(x) for all cy E [ a 1 , c r 2 ] ,and if Q(x)dx is convergent, then the integral
s,"
<
da)=
00
f ( a , x ) dx
(1.324)
is uniformly convergent in the interval [al,cra]. This is also called the Weierstrass M-test for uniform convergence. If an integral, Jamf(a, x)dx, is uniformly convergent in [cy1,cy2], then for any given E > 0, there exists a number co depending on E but independent of cr such that f ( a ,z)dxl < E for all c > cg > a.
IsCm
Example 1.9. Uniform convergence: Consider the integral
I =
lo
(1.325)
e-"" sinx dx,
which is uniformly convergent for cr E this we choose Q(x) as e c E Z so that
[ E , o ~ ) for
le-"" sinxi 5 e P Z
every
E
> 0. To show (1.326)
INTEGRALS INVOLVING A PARAMETER
is true for all a
43
2 E. Uniform convergence of I follows, since the integral (1.327)
is convergent. Note that by using integration by parts twice we can evaluate the integral I as 1
f”
(1.328) The case where Q = 0 may be excluded, since the integral does not converge at all.
Theorem 1.8. Let f ( o , x )and and x E [a,m). If the integral
”d(a’ a
sinx dx
be continuous for all a E
[QI, Q Z ]
(1.329) exists for all a E [ a l ,CYZ] and if the integral
(1.330) is uniformly convergent for all Q E [ a 1 , a ~then ] , g ( a ) is differentiable in [ a l ,a21 (at a1 from the right and a t a2 from the left) with the derivative
(1.331) In other words, we can interchange the order of differentiation with respect to Q and integration with respect to x as
(1.332) This is also called the Leibnitz’s rule (Kaplan). Theorem 1.9. Let f(cu,x) be continuous for all a E [a,m). Also let the integral
[al,cu2]and LC
E
(1.333) be uniformly convergent for all a E [al,a2]. Then, (a) g ( a )is continuous in [ C Y ~ , Q(at ~ ]a1 from the right and at left).
a2
from the
44
FUNCTIONAL ANALYSIS
(b) The relation
that is,
Jdm [/""
1: [I"
f(a', x) dx] da' =
1
f ( z ,a') da' dx,
(1.335)
is true for all a E [ a l , a 2 ]In . other words, the order of the integrals with respect to z and a' can be interchanged. Note that in case (a) the interval for cy does not have to be finite. Remark: In the above theorems, if the limits of integration are finite but the function f ( a ,x) or its partial derivative d f ( a ,x ) / d a is not bounded in the neighborhood of the segment defined by x = b and a E [a1,a2],we say that the integral
s(a)=
Jd
b
(1.336)
f ( a , x )dx
is uniformly convergent for all a E [ a l ,a2],if for every 60 > 0 independent of LY such that the inequality
E
> 0 we can find
a
(1.337) is true for all S E [0,So].We can now apply the above theorems with the upper limit 03 in the integrals replaced by b and the domain x E [a,00) by x E [a,b]. Example 1.10. Integrals depending on a parameter: Given the integral
(1.338) we differentiate with respect to a to write (1.339) However, this is not correct. The integral on the right-hand side of
1 dcr [--] O0
d
sinax
dx=l"cosaxdx
(1.340)
does not exist, since the limit lim
6+m
sin ax cos ax dx = lim -
(1.341)
INTEGRALS INVOLVING A PARAMETER
45
dg is not justified (Theorem does not exist. Hence the differentiation da
1.8). On the other hand, given the integral
dx
p / 2
J,
a2
cos2 x
7r
a>o, 2ff ' + sin2 x - -
(1.342)
we can write
1
dx
r/2 a2
cos2 x
d
+ sin2 x
(1.343)
to obtain the integral 2cr cos2 x dx
- --7r
2 -
2cr2'
(1.344)
Example 1.11. Integrals depending on a parameter: Consider >
f(ff,x)=
XfO, x
(1.345)
= 0,
which is continuous for all x and a.Since (1.346) which is also continuous for all x and a,and the integral (1.347) converges uniformly for all a > 0 (Example 1.9), using Theorem 1.8 we conclude that (1.348) exists and can be differentiated to write
da
X
dx =
1
" d
sin x [ e C a X T ] dx
(1.349)
( 1.350) where we have used the result in Equation (1.328). We now use Theorem 1.9 to integrate g'(a) [Eq. (1.349)], which is continuous for all a > 0 to obtain
46
FUNCTIONAL ANALYSIS
However, we can also write
Lm
g’(a)dcy= -
Lm[I*
e--az sinxdx] da
=-La[- I, e-ax sin x x
=
-
Lm[/I
-L
03
dx,
=
1
eCaXsinxda d x
sin x Tdx,
a > 0, (1.352)
which along with Equation (1.351) yields the definite integral sin x
dx = n/2.
( 1.353)
1.16 LIMITS OF INTEGRATION DEPENDING ON A PARAMETER Let A ( x ) and B ( x ) be two continuous functions with continuous derivatives
] , B ( x ) > A ( x ) . Also let f ( t , x ) and a f ( t ’ x ) be continuous in in [ x 1 , x 2 with dX the region defined by [x1,x2]and [ X I = A(x),x2 = B ( x ) ] .We can now write the intcgral ~
(1.354) and its partial derivative with respect to x as (1.355) Using the relations [Eq. (1.272)] (1.356) (1.357) we can write (1.358) (1.359) We can also write
DOUBLE INTEGRALS
47
Ai
Y;
X
Figure 1.10 The double integral.
Thus obtaining the useful formula
1.17 DOUBLE INTEGRALS Consider a continuous and bounded function, f ( ~y), , defined in a closed region R of the xy-plane. It is important that R be bounded, that is, we can enclose it with a circle of sufficiently large radius. We subdivide R into rectangles by drawing parallels t o the z and the y axes (Fig. 1.10). We choose only the rectangles in R and numerate them from 1 to n. Area of the i t h rectangle is shown as AAi and the largest of the diagonals, h, is called the norm of the mesh. We now form the sum n
(1.362) i=l
where, as in the one-dimensional integrals, (x:, y,2) is a point arbitrarily chosen in the i t h rectangle. If the sum converges to a limit as h + 0, we define the double integral as the limit n
f ( ~ 5 yT)AAi ,
lim
h-0
i=l
+
ss
f ( x , y) dxdy.
R
(1.363)
48
FUNCTIONAL ANALYSIS
Figure 1.11
Ranges in the iterated integrals.
When the region R can be described by the inequalities Yl(2)
IY I YZ(Z),
51 I
Zl(Y)
Iz I5 2 ( Y ) ,
Y1
5
I52
(1.364)
or
IY 5 Y2,
(1.365)
where Y ~ ( s ) , Y ~ ( zand ) z1(y),22(y) are continuous functions (Fig. l.ll),we can write the double integral for the first case as the iterated integral (1.366) The definite integral inside the square brackets will yield a function F ( z ) , which reduces I to a one-dimensional definite integral:
l:
F(x) dx.
(1.367)
A similar argument can be given for the second case [Eq. (1.365)]. We now present these results in terms of a theorem: Theorem 1.10. If f ( z , y) is continuous and bounded in a closed interval described by the region Yl(Z)
IY I YZ(X),
51
I2 I 52,
(1.368)
then (1.369)
PROPERTIES OF DOUBLE INTEGRALS
49
is a continuous function of x and
Similarly, if
R is described by Zl(Y)
F 2 L 52(Y), Y1 I YI Y2,
(1.371)
then we can write
A formal proof of this theorem can be found in books on advanced calculus. 1.18
PROPERTIES OF DOUBLE INTEGRALS
We can summarize the basic properties of double integrals, which are essentially same as the definite integrals of functions with single variable as follows:
I.
(1.373)
f(x,y) dxdy, c is a constant;
cf(x,y ) dxdy = c
(1.374)
R
(1.375) where
R is composed of R1 and R2,which overlap only at
the boundary.
11. There exists a point (XI,y1) in R such that
where A is the area of R.The value f(xl,yl) is also the mean value, ( f ) , of the function in the region R : (1.377)
50
FUNCTIONAL ANALYSIS
(1.378) where A l is the absolute maximum, that is,
in R and A is the area of R. IV. Uses of double integrals: If we set f ( z , y ) = 1 in J J f ( z , y ) dzdy, the double integral corresponds to the area of the region R :
R
dzdy = area of R.
(1.380)
R
For f ( : r , y ) 2 0 we can interpret the double integral as the volume between the surface z = f ( z , y ) and the region R in the zy-plane. If we interpret f(z, y ) as the mass density of a flat object lying on the zy-plane covering the region R, the double integral (1.381) gives its total mass M TRIPLE A N D MULTIPLE INTEGRALS
1.19
Methods and results developed for double integrals can easily be extended to triple and multiple integrals:
/ / If(.,
y, z ) dzdydz,
J’J’J’/f(x,
R
y, z , w) dxdydzdw . . . .
(1.382)
R
Following the arguments given for the single and the double integrals, for a continuous and bounded function f (2, y, z ) in a bounded region R defined by
we can define the triple integral
(1.384)
PROBLEMS
An obvious application of the triple integral is when f ( x , y , z ) gives the volume of the region R :
SJ'S R
d x d y d z = volume of R.
=
51
1, which (1.385)
In physical applications, total amount of mass, charge, etc., with the density p(z,y, z ) are given as the triple integral
( 1.386) The average value of a function f ( z ,y, z ) in the region R with the volume V is defined as
(1.387) Example 1.12. Volume between two surfaces: To find the volume between the cone z = d G 5and the paraboloid z = x 2 + y', we first write the triple integral
L'I'[L2+g2 L' [ &GiF
I/ = =
dz] dxdy
,/'= - x2 - y2] d x d y .
(1.388) (1.389)
We now use plane polar coordinates to write this as (1.390) (1.391) (1.392) (1.393)
PROBLEMS 1. Determine the critical points as well as the absolute maximum and minimum of the functions y = Inz, 0 < z 5 2, (i)
(iii)
+ 2x2 + 1, -2
y = z3
< x < 1.
52
FUNCTIONAL ANALYSIS
2. Determine the critical points of the functions (i)
z =z3
(ii)
z
=1
(iii)
z
= z2 - 42y
-
62y2 + y 3 ,
+ z2 + y2, -
y2.
and test for maximum or minimum.
3. Find the maximum and minimum points of z = x2
subject to the condition x2
+ 24xy + 8y2
+ y2 = 25.
4. Find the critical points of w=x+y subject to
x2
+ y2 + z 2 = 1
and identify whether they are maximum or minimum.
5. Express the partial differential equation
in spherical coordinates (r,I9,d) defined by the equations
x y
4, = r sin I9 sin 4, = r sin I9 cos
z = rcose.
where r E [0,co),I9 E [O,7r] , E [0,an]. Next, first show that the inverse transformation exists and then find it.
6. Given the mapping x
= u2 -
2,
y = 2uv,
(i) Write the Jacobian. (ii) Evaluate the derivatives
(e)z
and
($)z.
PROBLEMS
7. Find
(g)y
and
53
( h ) for dY
eu + x u - yv - 1 = 0, e” - xu yu - 2 = 0.
+
8. Given the transformation functions
show that the inverse transformations = u(x,Y),
4 2 ,Y)
=
satisfy
du
1 dy d u - _--1 ax _ dv 1 dy dv 1 dx - --- _ - -J d v ’ dy J d v ’ dx J d u ’ dy Jdu’
-- --
dx
where J = a(x ’). Apply your result t o Problem 1.6.
9. Given the transformation functions
x
= z ( u ,V ’w), = y ( u , ‘u, w),
z = z ( u ,v,w) with the Jacobian
J = a(x’”
show that the inverse transformation
v,w)’
functions have the derivatives
d u - 1 d(z,x) d u - -~ 1 d(x,y) J d ( v , w ) ’ dy Jd(v,w)’ dz Jd(v,w)’ 1 d ( y , z ) dv - 1 d(z,x) dv 1 d(x,y) - -~ J d(w, u)’ dy J d(w, u)’ d z J d(w, u)’
du 1 d(y,z) -
dx dv dx dw _ dz
-
d ( y_ , z )__ dw -- -1 _
J d ( u , v ) ’ dy
-
1 d(z,x) dw
Jd(u,v)’ dz
-
1d(x,y) -
Jd(u,v)’
Verify your result in Problem 1.5. 10. In one-dimensional conservative systems the potential can be represented by a (scalar) function, V(x),where the negative of the derivative of the potential gives the x component of the force on the system:
dV F3:(x)= -dx
54
FUNCTIONAL ANALYSIS
With the aid of a sketch, analyze the forces on a system when it is displaced from its equilibrium position by a small amount and show that a minimum corresponds to stable equilibrium and a maximum corresponds to unstable equilibrium. 11. In one-dimensional potential problems show that near equilibrium potential can be approximated by the harmonic oscillator potential V ( 2 )= -1k ( z 2
where k is a constant and
20 is
-20)
2
,
the equilibrium point. What is k?
12. Expand z(z, y) = x3 sin y
+ y2 cos z
in Taylor series up to third order about the origin. 13. If z
= z ( u ,v)
and y
= y(u, u ) , then
show the following:
14. Show the integrals
Hint: Use
som9 dx = 4.
15. Evaluate the improper integrals: dx
.I
'I2
fi(1
dx -
22)
16. First show the following: - coverges if and only if p
(ii)
(iii)
11$,
coverges if and only if p
.IC&?
> 1,
< 1,
coverges if and only if p
<1
PROBLEMS
55
and then check the convergence of
17. Check the integral
1’
x2dx (1 - x2)1/2(2x3 1)
+
for convergence.
18. Show that the integral
lco sin x
dx
is convergent by using integration by parts. 19. Using the integral
I ( a ,b ) =
1
T/2
dx a2 cos2 x + b2 sin2x
-
7r
2ab’
a>0,b > 0 ,
where a and b are two parameters, show the integral
.i
dx
T/2
20. Determine the convergent:
(u2
a!
cos2 x
2=&(+2+$).
+ b2 sin2 x>
values for which the following integrals are uniformly
21. Can the order of integration be interchanged in the following integral (explain):
1
x-a!
dx da.
22. Use the result
.I
03
g(a)
=
sin xa! dx x(x2 1)
+
=
iT
-(1 2
-
e-a),
a!
> 0,
56
FUNCTIONAL ANALYSIS
to deduce the integrals sin x a
dx
=
7r
-(122
e P Q ) ,c
>0
and
23. Evaluate the double integral
I = //2y
dxdy
over the triangle with vertices (-1,0), (0, l ) ,and (2,O).
24. Evaluate I = J’Szy
dzdy
over the triangle with vertices (0,0), (1,l),and ( 1 , 3 ) .
25. Evaluate the integral
26. First evaluate the integral
and then repeat the integration over the same region but with the x integral taken first.
27. Test the following integral for convergence:
CHAPTER 2
VECTOR ANALYSIS
Certain properties in nature like mass, charge, temperature, etc., are scalars. They can be defined at a point by just giving a single number, that is, their magnitude. On the other hand, properties like velocity and acceleration are vector quantities which have both direction and magnitude. Most of the Newtonian mechanics and Maxwell's electrodynamics are formulated in terms of the language of vector analysis. In this chapter, we introduce the basic properties of scalars, vectors, and their fields. 2.1
VECTOR ALGEBRA: GEOMETRIC M E T H O D
Abstract vectors on a plane are defined by directed line segments. The length of the line segment describes the magnitude of the physical property and the arrow indicates its direction. As long as we preserve their magnitude and * 3 in direction, we can move vectors freely in space. In this regard, A and A Figure 2.1 are equivalent vectors:
' A =3 A. Essentials of Mathematical Methods in Science and Engineering. By Copyright @ 2008 John Wiley & Sons, Inc.
8. SelGuk Bayin 57
58
VECTOR ANALYSIS
Figure 2.1
Abstract vectors.
We use Latin letters with an arrow to show vector quantities:
It is also customary to use boldface letters, A, B , a,b, . . . , for vector quantities, as we use in the figures. Magnitude or norm of a vector is a positive number and is shown as
lXl,1Z1,IZl... or simply as A , B , a , .. . Multiplication of a vector with a positive number, cr > 0, multiplies the magnitude by the same number while leaving the direction untouched:
Multiplication of a vector with a negative number, /3 < 0, reverses the direction while changing the magnitude as
Two vectors can be added by using the parallelogram method (Fig. 2.2). A convenient way to add vectors is to draw them head to tail as in Figure 2.3. This allows us to define a null vector d as -+
A
+ (-1)X = d.
(2.8)
Using the cosine and the sine theorems, we can find the magnitude, r, and the angle, 4, of the resultant,
T+=x+z,
(2.9)
VECTOR ALGEBRA: GEOMETRIC METHOD
59
r=A+B
k5-A
B Figure 2.2
Addition of vectors, r = A
+ B.
0
Figure 2.3
Addition of vectors by drawing them head to tail.
as T =
(A2+B2+2ABcosB)1’2,
4 = arcsin
(t
sind) .
(2.10) (2.11)
With respect to addition, vectors commute:
x+3=z+x and associate:
+z 3 + ( B + + Z ) .
( X + 3) A set of vectors,
=
(2.12)
(2.13)
{ x,z,5 , .. . } , can be added by drawing them head t o
tail. In Figure 2.3 (left), the resultant is ?;’=
x + 3+z+a’.
(2.14)
60
VECTOR ANALYSIS
Figure 2.4
Force problems.
If the resultant is a null vector, then the head of the last vector added and the tail of the first vector added meet (Fig. 2.3, right): d = 3 + 2 + 3 +
i?+Z+T.
Example 2.1. Point of application: In physics the point of application of
a vector is important. Hence we have t o be careful when we move them around to find their resultant. In some equilibrium problems, where the forces act at the center of mass, the net force is zero (Fig. 2.4, left). In Figure 2.4 (right), where there is a net force, the resultant also acts a t the point 0. 2.1.1
Multiplication of Vectors
For the product of two vectors there are two types of multiplication: The scalar product, which is also known as the dot or the inner product, is
defined as +
A
. Z= A B C O ~ O (2.15)
where 0 is the angle between the two vectors. The dot product is also shown as (2,S‘). If we write -ri’ . as
Tt
(2.16) + Ag = A .EB = ACOSO,
2,
(2.17)
where 2~ is a unit vector along the direction of the dot product becomes a convenient way to find the projection of a vector along another vector, that is, the component, AB, of 2 along EB.
VECTOR ALGEBRA: GEOMETRIC METHOD
Figure 2.5
61
Dot or scalar product.
In physics, work is a scalar quantity defined as the force times the displacement along the direction of force. In other words, it is the dot product of the force with the displacement. For a particle in motion, the infinitesimal work is written as the dot product of the force, 3, with the infinitesimal displacement vector along the trajectory of the particle, d s ’ , as (Fig. 2.5)
sW=T.db.
(2.18)
We have chosen to write 6W instead of dW t o emphasize the fact that, in general, work is path-dependent. To find the total work done between two points A and B, we have to integrate over a specific path C connecting the two points: (2.19) JA
c
A different path connecting A to B in general yields a different value for the work done. Another type of vector multiplication is called the vector product or the cross product, which is defined as the binary operation (2.20)
3,
The result is a new vector, which is perpendicular to the plane defined by + A and 3 with the magnitude defined as (Fig. 2.6)
C = ABsinO.
(2.21)
The direction is found by the right-hand rule, that is, when we curl the fingers of your right hand from the first vector to the second, the direction of our
62
VECTOR ANALYSIS
Figure 2.6
Cross or vector product.
3.
thumb gives the direction of Note that when the order of the vectors multiplied is reversed, the direction of also reverses. Angular momentum
3
+
L = 7 x T
(2.22)
+ r = 7 x 3
(2.23)
and t,orque (Fig. 2.6)
are two important physical properties that are defined in terms of the vector product. In the above expressions, 7 is the position vector defined with respect to an origin 0 and and are the momentum and the force vectors, respectively. In celestial mechanics we usually choose the origin as the center of attraction, M . The gravitational force is central and directed toward the center of attraction; hence the torque is zero. Since the rate of change of the angular momentum is equal to the torque, in central force problems angular momentum is conserved, that is, its magnitude and direction remains fixed. This means that the orbit of a planet always remains in the plane defined by the two vectors 7 and 3. This allows us to use plane polar coordinates in orbit calculations thereby simplifying the algebra significantly.
3
Tg
2.2
VECTOR ALGEBRA: COORDINATE REPRESENTATION
A convenient way to approach vector algebra came with Descartes through the introduction of Cartesian coordinates. We define a Cartesian coordinate system by choosing three mutually orthogonal straight lines, which we identify as the 21,x2,x3-axes, respectively. We also draw three unit basis vectors, Zl,E2,E3, along these axes (Fig. 2.7). A point P in space can now be represented by the position vector 7, which can be written as the sum of three vectors, x1E1,x222, and 2323, along their respective axes as + T = XI21
+ x2s2 + 2323,
(2.24)
VECTOR ALGEBRA: COORDINATE REPRESENTATION
63
A
e.
..
\
\'
' 1
/-----__I/
Figure 2.7
Cartesian coordinates.
where z1,22,z3 are called the coordinates of the point P or the components ---f of 7. We also use 2 for the position vector. In general any vector, A , can be written as the sum of three vectors:
--f
where A l , A2, A3 are called the components of A . We can also write a vector as the set of ordered numbers
Since the unit basis vectors are mutually orthogonal, they satisfy the relations
el . e l = 1, e l . e2 = 0, 21 .23 = 0, e2 . e l = 0, e2 . e2 = 1, e2 . e3 = 0, e3 . e l = 0, e3 . e2 = 0, 23 .23 = 1, A , - .
A
h
A
A
-
h
A
A
-
A
-
h
(2.27) (2.28) (2.29)
which can be summarized as
e2. . 23. - 6.. 2 3 , i , j = 1,2,3.
h
(2.30)
The right-hand side, S i j , is called the Kronecker delta, which is equal to 1 when the two indices are equal and 0 when the two indices are different:
(2.31)
64
VECTOR ANALYSIS
Using Equation (2.30), we can write the square of the magnitude of a vector, + A , in the following equivalent ways:
The components, Ai, are obtained from the scalar products of unit basis vectors:
Ai
+
A . 2i, i
1
1
1,2,3.
2 with
the
(2.34)
In component notation, two vectors are added by adding their respective components:
Multiplication of a vector with a scalar a is accomplished by multiplying each component with that scalar:
Dot product of two vectors is written as --i
A 3 = ( X , T I ) = A l B l + A2B2 + A3B3
(2.39) (2.40)
3
=
C AiBi.
(2.41)
i=l
Using component notation one can prove the following properties of the dot product:
65
VECTOR ALGEBRA: COORDINATE REPRESENTATION
Properties of the dot product
(2.42) (2.43) (2.44) (2.45) (2.46) (2.47) (2.48) Equation (2.47) is known as the Schwarz inequality. Equation (2.48) is the triangle inequality, which says that the sum of the lengths of the two sides of a triangle is always greater than or equal to the length of the third side. Before we write the cross product of two vectors in component notation, we write the following relations for the basis vectors: el x El = 0, e2 x el = -e3, e3 x el = e2,
h
-
,
A
-
.
A
A
h
h
h
el x e2
A
= e3,
A
e2 x Z 2 = 0, h
h
h
h
e3 x e2 = -el,
h
h
el x e3 = -e2, e2 x e3 = e l , e3 x 23 = 0.
,
h
-
.
A
,
-
.
(2.49)
The cross product of two vectors can now be written as +
A x
I? = (AiEl+ A2Z2 + A3E3) x (BlEl+ B 2 E Z + B3E3) =
(AZB3 - A3B2)21+ (&B1 - AlB3)22
We now introduce the permutation symbol
& ZJk ..
=
{
0 1 -1
&ijk,
+ (All32
(2.50) -
A2Bl)E3.
which is defined as
When any two indices are equal. For even (cyclic) permutations: 123, 231, 312. For odd (anticyclic) permutations: 213, 321, 132.
(2.51)
An important identity that the permutation symbol satisfies is 3
(2.52) i=l Using the permutation symbol, we can write the i t h component of a cross product as 3
3
(2.53) j=1 k=l
66
VECTOR ANALYSIS
Using determinants we can also write a cross product as (2.54)
Note that we prefer to use the index notation ( Z ~ , I C ~ , over Z ~ ) labeling of the axes as ( ~ , y , z )and show the unit basis vectors as (21,&,23) instead of ( 2 , j , k ) . The advantages will become clear when we introduce generalized coordinates and tensors in n dimensions. A
h
-
Example 2.2. Triple product: In applications we frequently encounter the scalar triple product +
A
‘
(3x 3)= Al(B2C3 B3C2) + A2(B3Cl + A3(BlC2 B2C1), -
-
B1C3) (2.56)
-
which is geomet$ally by the vectors A ,
equal t o the volume of a parallelepiped defined Note that
3,and 3 (Fig. 2.8).
UBC =
1 3 x 31= B h l = B ( C s i n 4 )
(2.57)
is the area of the base and h2 = Acos0 is the perpendicular height t o the base thereby giving the volume as
V = h2 . UBC = (A cos 0) BC sin q5 =
(2.58) (2.59)
2 .(3x 3).
(2.60)
Using index notation, one can easily show that
v = X (3x 3) = 3. (3x X ) = 3. (2x 3). ’
(2.61)
The triple product can also be expressed as the determinant
X . ( x x 3)= d e t
(i
A2
l3;
E;
A3
)
.
Properties of the cross product can be summarized as follows:
(2.62)
VECTOR ALGEBRA: COORDINATE REPRESENTATION
67
B Figure 2.8
Triple product.
Properties of the cross product --f
AxI?=-ZXX,
(2.63)
2 x ( T ? + z ) = x X x + f x x ,
(2.64)
(02)x 3 = o ( X x 31,a is a scalar, 2 x (Z x 3)= Z(2. 3)- Z(Z.Z), (2x 3). (2x 2)= A2B2- (2.Z)2,
(2.65) (2.66) (2.67)
~ x ( Z x z ) + ~ x ( ~ x x ) + z x ( 2 x Z ) = 0 . (2.68)
Using the index notation, we can prove Equation (2.66) as 3
3
3
j=1 k = l 3
3
1=1 m=l 3
r 3
j = 1 1=1 m = l Lk=l 3
3
3
3
1
J
68
VECTOR ANALYSIS
Figure 2.9
2.3
Equation of a line.
LINES A N D PLANES
We define the parametric equation of a line passing through a point + ( ~ 0 1 , : ~ 0 2 , 2 0 2and ) in the direction of the vector A as
3 = 3 +tx,
3= (2.71)
where 3 = ( z 1 , x 2 , ~ 3 )is a point on the line and t is a parameter (Fig. 2.9). + If the components of A are (al, a 2 , a 3 ) , we obtain the parametric equation of a line in space as
(2.72) (2.73) (2.74) In two dimensions, say on the xlx2-plane, the third equation above is absent. Thus by eliminating t among the remaining two equations, we can express the equation of a line in one of the following forms: (2.75)
(2.76) a122 - a 2 2 1
=
(202a1 - z o 1 a 2 ) .
(2.77)
Consider a plane that contains the point P with the coordinates ( 1 ~ 0 1 , 2 0 2 , 2 0 2 ) . Let 3 be any nonzero vector normal to the plane at P and let 3 be any
LINES AND PLANES
Figure 2.10
69
Equation of a plane.
point on the plane (Fig. 2.10). Since ( 2- ?) is a vector on the plane whose dot product with 2 is zero, we can write
2 = 0.
(3 - ?),
(2.78)
Since any 2 perpendicular to the plane satisfies this equation, we can also write this equation as
( 2- 3). ti? = 0,
(2.79)
where t is a parameter and i? is the unit normal in the direction of write 6 as
6 = (721,722, 723),
72;
+ + 72; 72;
= 1,
we can write the equation of a plane, that includes the point and with its normal pointing in the direction i? as 721x1
+
72222
+
72323 = [zolnl
+
202722
+
5037233.
2. If we (2.80)
(~01,2025 , 02)
(2.81)
Example 2.3. Lines and planes: The parametric equation ofthe line passing through the point ? = (3,1,1) and in the direction of A = (1,5,2) is 2l(t)
=3
+t,
+ 5t, Q ( t ) = 1 + 2t. 22(t) =
1
(2.82) (2.83) (2.84)
70
VECTOR ANALYSIS
For a line in the z122-plane passing through 3 = ( 2 , 1 , 0 ) and in the + direction of A = (1,5,0) we write the parametric equation as
2 l ( t )= 2 52(t) =
1
+t,
(2.85) (2.86)
+ 5t.
We can now eliminate t to write the equation of the line as 22 =
52,
-
9.
(2.87)
For a plane including the point 7 = (2,1,-2) and with the normal = (-1,1, I ) the equation is written as [Eq. (2.8l)l
3
+ 2 2 + 5 3 = -3.
-21
(2.88)
In general, a line in the zlzs-plane is given as a51
+ b Z 2 = c.
(2.89)
Comparing with Equation (2.77), we can now interpret the vector ( a ,b) as a vector orthogonal to the line, that is,
( a , b ) .(a1,a2) = (-a2,a1).
(a1,a2)
= 0.
(2.90)
To find the angle between two planes,
+ + = 2, + + 223 = 1,
221 -21
22
(2.91) (2.92)
23
22
we find the angle between their normals, 3 1
= (2,1,1),
(2.93)
3
= (-1,1,2),
(2.94)
2
as (2.95)
e=cos-l =
2.4
[
-2+1+2
1 cos-1 6
436
]
(2.96) (2.97)
VECTOR DIFFERENTIAL CALCULUS
2.4.1 Scalar Fields and Vector Fields We have mentioned that temperature is a scalar quantity, hence a single number is sufficient to define it at a given point. In general, the temperature inside
VECTOR DIFFERENTIAL CALCULUS
71
a system varies with position. Hence in order t o define temperature in a system completely, we have to give the temperature at each point of the system. This is equivalent to giving temperature as a function of position:
This is an example of what we call a scalar field. In general, a scalar field is a single-valued differentiable function,
f(m, z2,23),
(2.99)
representing a physical property defined in some domain of space. In short, for f ( 2 1 , 2 2 , ~ we 3 ) also write f(7) or f(2). In thermodynamics temperature is a well-defined property only for systems in thermal equilibrium, that is, when the entire system has reached the same temperature. However, granted that the temperature is changing sufficiently slowly within a system, we can treat a small part of the system as in thermal equilibrium with the rest and define a meaningful temperature distribution as a differentiable scalar field. This is called the local thermodynamic equilibrium assumption and it is one of the main assumptions of the theory of stellar structure. Another example for a scalar field is the gravitational potential in Newton’s theory, a(?). For a point mass M located at the origin, the gravitational potential is written as
a(?)
=
M -G-, r
(2.100)
where G is the gravitational constant. For a massive scalar field, the potential is given as
a(?)
e-Pr
=
k-,
r
(2.101)
where p-lis the mass of the field quanta and k is a coupling constant. We now consider compressible flow in some domain of space. Assume that the flow is smooth so that the fluid elements, which are small compared to the body of the fluid but large enough to contain many molecules, are following well-defined paths called the streamlines. Such flows are called irrotational or streamline flows. At each point of the streamline we can associate a vector tangent to the streamline corresponding to the velocity of the fluid element at that point. In order to define the velocity of the fluid, we have to give the velocity vector of the fluid elements at each point of the fluid as
This is an example of a vector field. In general, we can define a vector field by assigning a vector to every point of a domain in space (Fig. 2.11).
72
VECTOR ANALYSIS
Figure 2.11
2.4.2
Flow problems.
Vector Differentiation
Trajectory of a particle can be defined in terms of the position vector ? ( t ) , where t is a parameter, which is usually taken as the time. The velocity 3 ( t ) and the acceleration 2 ( t )are now defined as the derivatives (Fig. 2.12)
7(t + v ( t )= lim
+ At)
7 ( t )d?(t) dt
(2.103)
3 ( t )d27(t) dt2 '
(2.104)
-
at
At-0
and
3(t + a ( t )= lim
+ At)
-
At
At-0
In general, for a differentiable vector field given in terms of a single parameter
t, +
+
+
A ( t )= Ai(t)Zi A2(t)Z2 A3(t)Z3,
(2.105)
we can differentiate componentwise as
(2.106) Higher-order derivatives are found similarly according t o the rules of calculus. Basic properties of vector differentiation
d +
-(A dt
dx dx + 3)= + -, dt dt
(2.107) (2.108)
d +
-(A dt
. Z )= -ddt.xZ +
-+ d 3
A . -, dt
d + d z dx - ( A x ~ ) = X X -dt+ - Xdt Z dt
(2.109) (2.110)
GRADIENT OPERATOR
73
J Figure 2.12
Vector differentiation.
Vector fields depending on more than one parameter can be differentiated partially. Given the vector field +
A (7) = A i ( 7 ) Z I + A 2 ( 7 ) Z 2 + A3(?)Z2,
since each component is a differentiable function of the coordinates, we can differentiate it as
(2.111) x 1 , x 2 , z3,
(2.112) (2.113)
2.5
GRADIENT OPERATOR
Given a scalar field @(7) defined in some domain of space described by the Cartesian coordinates ( x l , z 2 , z 3 ) ,we can write the change in a(?) for an infinitesimal change in the position vector as
@(7 +A?)
-
@(7) =d@(7)
(2.114)
If we define two vectors: (2.1 16)
74
VECTOR ANALYSIS
x A 3
/ x1
Figure 2.13
Equipotential surfaces.
and
d?
=
(dzl,d22,d ~ g ) ,
(2.117)
Va. d?.
(2.118)
we can write d@ as dQ,(?)
=
Note that even though Q, is a scalar field, introduce the differential operator
a‘@ is a vector
field. We now
(2.119) which is called the gradient or the del operator. On its own the del operator is meaningless. However, as we shall see shortly, it is a very useful operator. 2.5.1
Meaning of the Gradient
In applications we associate a scalar field, a(?), with a physical property like the temperature, gravitational, or the electrostatic potential. Usually we are interested in surfaces on which a scalar quantity takes a single value. In thermodynamics, surfaces on which temperature takes a single value are called the isotherms. In potential theory equipotentials are surfaces on which potential is a constant, that is,
GRADIENT OPERATOR
75
If we treat C as a parameter, we obtain a family of surfaces as shown in Figure 2.13. Since (a(?;') is a single-valued function, none of these surfaces intersect each other. For two infinitesimally close points, ?;'I and ?;'2, on one of the surfaces, @(XI, ~ 2 ~ x = 3 )C , the difference (Fig. 2.14), d?;' = 7
2
(2.121)
-71,
is a vector on the surface. Thus the equation
T(a.d?;'
=0
(2.122)
indicates that ?(a is a vector perpendicular to the surface This is evident in the special case of a family of planes: (a(?;')
= 12121
+
72252
+
12323
=
(a = C
(Fig. 2.14).
c,
(2.123)
where the gradient:
T@= ( n l , n 2 , 1 2 3 ) >
(2.124)
is clearly normal to the plane. For a general family of surfaces, naturally the normal vectors depend on the position in a given surface.
Example 2.4. Equation of the tangent plane to a surface: Since the normal to a surface, F ( z 1 , ~ 2 , 2 3 ) = C, and the normal t o the tangent plane at a given point, ? = ( 2 0 1 , 5 0 2 , I C O ~ ) ,coincide, we can write the equation of the tangent plane at P as
( 2- 9 ).TF = 0,
(2.125)
where 2 is a point on the tangent plane. In the limit as 2 can write ( 2- ?) = d 2 . Hence the above equation becomes
---f
a'F. d 2
? we
= 0.
In other words, in the neighborhood of a point 3 ,the tangent plane approximately coincides with the surface. To be precise, this approximation is good to first order in ( 2- ?). 2.5.2
Directional Derivative
We now consider a case where ?;'I is on the surface (a(?) = C1 and 7 2 is on the neighboring surface (a( 7) = C2. In this case the scalar product T(a.d?;' is different from zero (Fig. 2.15). Defining a unit vector in the direction of d? as B = d 7 / Id?;'l, we write (2.126)
76
VECTOR ANALYSIS
Figure 2.14 Gradient.
which is called the directional derivative of @ in the direction of G. If we move along a path, A , that intersects the family of surfaces iP = Ci, it is apparent from Figure 2.15 tha,t the directional derivative, (2.127) is zero when ct = 7 ~ 1 2 that , is, when we stay on the same surface. It is a maximum when we are moving through the surfaces in the direction of the gradient. In other words, the gradient indicates the direction of maximum change in as we move through the surfaces (Fig. 2.15). The gradient of a scalar field is very important in applications and usually defines the direction of certain processes. In thermodynamics heat flows from regions of high temperatures to low temperatures. Hence, the heat current density, is defined as proportional to the tempcrature gradient as
f,
J’(7;f)= - k v T ( ? ) ,
(2.128)
where k is the thermal conductivity. In transport problems mass flows from regions of high concentration to low. Hence, the current density of the flowing material is taken as proportional to the gradient of concentration, p C ( ? ) , as
7(7) = -KVC(?), where
ti
is the diffusion constant.
(2.129)
DIVERGENCE AND CURL OPERATORS
Figure 2.15
2.6
77
Directional derivative.
DIVERGENCE A N D CURL OPERATORS
The del operator,
d d 7= z1+ /.a e2 -+ z3 -, 8x1 8x2 ax3
(2.130)
+ can also be used to operate on a given vector field A either as
v.2,
(2.131)
7x 2.
(2.132)
or as
The first operation results n a scalar field:
7
dAl A=8x1
4
dA2 +-+8x2
dA3 8x3
(2.133)
is called the divergence o the vector field 3,and the operator V. is called the div y e r a t o r . The second operation gives another vector field, called the curl of A , components of which are given as
(2.134)
78
VECTOR ANALYSIS
or as
dA3
dA2
dAz
where
Vx
dA1
dA3
dA1
(2.135)
is called the curl operator and di stands for d / d x i .
Basic properties of the gradient, divergence, and the curl operators
a'(d$)
=
$Vd + dV$,
(2.136) (2.137) (2.138)
V x ( X + 3)= V x x + V x 3,
(2.139) (2.140)
2.6.1 Meaning of Divergence and the Divergence Theorem For a physical understanding of the divergence operator we consider a tangible case like the flow of a fluid. The density of the fluid, p ( 7 , t ) , is a scalar field and gives the amount of fluid per unit volume as a function of position and time. The current density, J(?,t ) ,is a vector field that gives the amount of fluid flowing per unit area per unit time. Another critical parameter related t o the current density is the flux of the flowing material through an area element A b . Naturally, flux depends on the relative orientation of 7 and A d . For an infinitesimal area, d 3 ,flux is defined as (2.141) (2.142) (2.143) which gives the amount of matter that flows through the infinitesimal area element da per unit time in the direction of the unit normal 5i to the surface (Fig. 2.16). Notice that when the area element is perpendicular to the flow, that is, 0 = ./a, the flux is zero. We now consider a compressible flow such as a gas flowing in some domain of space, which is described by the current density = ( J l ,J2,J3) and the
7
DIVERGENCE AND CURL OPERATORS
79
/
Figure 2.16
Flux through a surface.
matter density p. Take a small rectangular volume element
Ar = A x ~ A x ~ A x ~
(2.144)
centered at 7= (*, *, *) as shown in Figure 2.17. The net amount of matter flowing per unit time in the x2 direction into this volume element, that is, the net flux 4 2 in the 2 2 direction, is equal to the sum of the fluxes from the surfaces 1 and 2:
A42
= [ J ( x l ,0
+ Ax2)
23,
t)
+ T1\(X1,0,23,t ) ] 6AzlAx3 '
(2.145)
(2.147) where for the flux through the second surface we have used the Maclaurin series expansion of J ' ( 7 , t )for 2 2 and kept only the first-order terms for a sufficiently small volume element. Note that the flux through the first surface is negative, since 5 2 and the normal 6 to the surface are opposite in direction. Similar terms are obtained for the other two pairs of surfaces. Thus their sum gives us the net amount of material flowing into the volume element:
a4 = a41 + A42 + A43
(2.148)
Since the choice for the location of our rectangular volume element is arbitrary, for an arbitrary point in our domain we can write (2.150)
80
VECTOR ANALYSIS
"3
Figure 2.17
which is nothing but
Ad
=
Flux through a cube.
"
'
J'(7,t p r .
(2.151)
Notice that when the net flux A 4 is positive, it corresponds to a net loss of dP matter within the volume element Ar. Hence we equate it t o ----Or. Since dt
d 7
the position of the volume element is fixed, that is, dt = 0, we can write
-!&AT dt
=-
-
d p dx2 [dp& +--+--+-
8x1 dt
8x2 dt
dp d ~ 8x3 dt
dP
3
"I
dt
AT
(2.152)
--AT
at
to obtain (2.153) Since the volume element AT is in general different from zero, we can also write
a'
'
J'(?,t)
+ d P ( 7 , t ) = 0,
(2.154)
DIVERGENCE AND CURL OPERATORS
81
For a compressible fluid flow, current density can be related to the velocity field of the fluid as
7(?,t)
=p(?,t)T+(T,t),
(2.155)
where 3 ( ? , t ) is the velocity of the fluid element at ? and t. Equation (2.154) is called the equation of continuity and it is one of the most frequently encountered equations of science and engineering. It is a general expression for conserved quantities. In the fluid flow case it represents conservation of mass. In the electromagnetic theory, p stands for the electric charge density and is the electric current density. Now the continuity equation becomes an expression of the conservation of charge. In quantum mechanics, the continuity equation is an expression for the conservation of probability, where p = 99*is the probability density, while is the probability current density. For a finite rectangular region R with the surface area S we can use a network of n small rectangular volume elements, each of which satisfies
7
7
(2.156)
where the subscript i denotes the i t h volume element at T i . When we take the sum over all such cells and consider the limit as n -+ 03, fluxes through the adjacent sides will cancel each other, thus giving the integral version of the continuity equation as
Since the integral on the right-hand side is convergent, we can interchange the order of the derivative and the integral t o write
(2.158)
sv
where in the last step we have used total derivative since p ( 7 , t ) d r is only a function of time. The right-hand side is the rate of change of the total
dm
amount of matter, m, within the volume V . When m is conserved, - = 0. dt In other words, unless there is a net gain or loss of matter from the region, the divergence is zero. If there is net gain or loss of matter in a region, it implies the presence of sources or sinks within that region. That is, a nonzero divergence is an indication of the presence of sources or sinks in that region.
82
VECTOR ANALYSIS
It is important to note that if the divergence of a field is zero in a region, it does not necessarily mean that the field there is also zero, it just means that the sources are elsewhere. Divergence theorem: Another way to write the left-hand side of Equation (2.158) is by using the definition of the total flux, j SJ’ . 6 do,that is, the net amount of material flowing in or out of the surface, S , per unit time, where S encloses the region R with the volume V . Equating the left-hand side of Equation (2.158) with the total flux gives
9 . f ( T + t, ) d r =
f
.??do,
(2.159)
where 6 is the outward unit normal to the surface S bounding the volume V and do is the area element of the surface (Fig. 2.18). Equation (2.159), which is valid for any piecewise smooth surface S with the volume V and the outward normal 6, is called Gauss’s theorem or the divergence theorem, which can be used for any differentiable and integrable vector field Gauss’s theorem should not be confused with Gauss’s law in electrodynamics, which is a physical law. A formal proof of the divergence theorem for any piecewise smooth surface that forms a closed boundary with an outward unit normal 6 can be found in Kaplan. Using the divergence theorem for an infinitesimal region, we can write an integral or an operational definition for the divergence of a vector field f as
7.
(2.160)
where S is a closed surface enclosing the volume V. In summary, the divergence is a measure of the net in or out flux of a vector field over the closed surface S enclosing the volume V. I t is for this reason that a vector field with zero divergence is called solenoidal in that region. Derivation of the divergence theorem has been motivated on the physical model of a fluid flow. However, the result is a mathematical identity valid for a general differentiable vector field. Even though f . 6 da represents the flux of f through d d , may not represent any physical flow. As a mathematical identity, divergence theorem allows us to convert a volume integral to an integral over a closed surface, which then can be evaluated by using whichever is easier.
7
VECTOR INTEGRAL CALCULUS IN TWO DIMENSIONS
Figure 2.18
2.7
2.7.1
83
Area element on S.
VECTOR INTEGRAL CALCULUS IN T W O DIMENSIONS Arc Length and Line Integrals
A familiar line integral is the integral that gives the length of a curve as 1=
]c d s ] d d x f + d x i , =
(2.161)
C
where C denotes the curve the length of which is to be measured and s is the arc length. If the curve is parameterized as
(2.162) (2.163) we can write 1 as
1 We can also use either
=
21
.I,
/(%)2
or
22
+ (%)
2
dt.
(2.164)
as a parameter and write
(2.165) or
(2.166)
84
VECTOR ANALYSIS
Line integrals are frequently encountered in applications with linear densities. For example, for a wire with linear mass density ~ ( s )we, can write the total mass as the line integral
(2.167) or in parametric form as
Extension of these formulas to n dimensions is obvious. In particular, for a curve parameterized as ( z l ( t )z,2 ( t ) x, 3 ( t ) )in three dimensions, the arc length can be written as
(2.169) If the coordinate
z1
is used as the parameter, then the arc length becomes
(2.170) Example 2.5. W o r k done o n a particle: An important application of the line integral is the expression for the work done on a particle moving along a trajectory under the influence of a force 3 as
W=
ds,
(2.171)
where FT is the tangential component of the force, that is, the component along the displacement ds. We can also write W as
(2.172)
(2.173)
(2.174)
(2.175)
VECTOR INTEGRAL CALCULUS IN TWO DIMENSIONS
85
Normal and tangential components of force.
Figure 2.19
Using the relations (Fig. 2.19) F1 =
FT cos
+ FNcos
F2 =
FT sin a
-
(5 (5
- a ) = FTcos a
- a ) = FTsin a
FN sin
+ FN sin a ;
(2.176)
FN cos a ,
(2.177)
-
and
dxl = d s c o s a , dxz = d s s i n a ,
(2.178)
we can easily show the following equivalences:
W
=
L +L
+
[ F ~ c o s a F ~ s i n ac]o s a ds
[FTsin a
=
-
FNcos a]sin a ds
FT ds.
(2.179) (2.180)
In most applications, line integrals appear in combinations as
(2.181) which we also write as
(2.182)
Jc
We can consider P and Q as the components of a vector field Ti? as iij’ =
p(xi,xz)gi + Q(xi,x2)22.
(2.183)
86
VECTOR ANALYSIS
Figure 2.20
Unit tangent vector.
Now the line integral [Eq. 2.1811 can be written as
L
+ Q ( x 1 , m )dx2 =
P ( x I , x ~dzl )
LWT
ds,
(2.184)
where WT denotes the tangential component of %3 in the direction of the unit tangent vector ?(Fig. 2.20):
-t = -eldx1,
dxz+ -e2 ds + (sin a )2 2 ,
ds = (cos a )
(2.185) (2.186)
Using Equation (2.186) we write A
~ ~ = 8 ~ t = P c o s a + Q s i n a ,
(2.187)
hence proving
L
wT ds = =
(PcosQ
P dxl
+ Q sin a )ds
+ Q dxz
(2.188) (2.189)
If we represent the path in terms of a parameter t , we can write .d?
=L
P dzl + Q dx2
(2.190) (2.191) (2.192)
Example 2.6. Change i n kinetic energy: If we take 7 as the position of a particle of mass m moving under the influence of a force the
2,
VECTOR INTEGRAL CALCULUS IN TWO DIMENSIONS
87
work done on the particle is written as
W=L?.d?
(2.193)
= L T . d?=
dt.
(2.194)
d 3 d 3 . Substituting the second law of Newton, 3 = m-, where - is the dt dt acceleration of the particle, we can write W as
(2.195) (2.196) (2.197) (2.198) (2.199) The quantity we have defined as
T
= -mv 1 2
2
,
(2.200)
is nothing but the kinetic energy of the particle. Hence the work done on the particle is equal to the change in kinetic energy.
2.7.2
Surface Area and Surface Integrals
We have given the expressions for the arc length of a curve in space. Our main aim is now to find the corresponding expressions for the area of a surface in space, which could either be given as x3 = X S ( X ~ , X or ~ ) in parametric form as
(2.201) (2.202) (2.203) Generalizations of the formulas [Eqs. (2.170) and (2.169)] to the area of a given surface are now written as
88
VECTOR ANALYSIS
or as
S where
..’.J’
(2.205)
dudv,
=
+(z) +($), (z)2+(z)2+(z)2 2
2
2
E = ( 2 )
(2.206)
8x1 8x1 F = --+--+--
du dv
G=
8x2
8 x 3 ax3
du dv
du dv
ax2
(2.207)
(2.208)
A propcr treatment of the derivation of this result is far too technical for our purposes. However, it can be found in pages 371-378 of Treatise on Adva~iced Calculus by Franklin. An intuitive geometric derivation can be found in Advanced Calculus by Kaplan. We give a rigorous derivation when we introduce the generalized coordinates and tensors in the following chapter. For the surface analog of the line integral
(2.209) we write
I
=
/ s, ?
.db.
(2.210)
Consider a sniooth surface S with the outer unit normal defined as ~ = c o s f f ~ ~ + c o s ~ & + c o s y ~ ~
(2.211)
and take ? = (V1, V2,V3) to be a continuous vector field defined on S. We can now write the surface integral I as
/ /;(7
.6)d a =
/s,
(V1 cos 0
+ v2c o s p + v3cosy) d a
where we used the fact that projections of the surface area element d b = %a onto the coordinate planes are given as cosa d a = dx2dx3, cosp d o = dx3dx1, and cos y d a = d x l dx2. Similar to line integrals, a practical application of surface integrals is with surface densities. For example, the mass of a sheet described by the equation
VECTOR INTEGRAL CALCULUS IN TWO DIMENSIONS
89
x3 = x3(x1,2 2 ) with the surface density o ( x ~ , xx3) ~ ,is found by the surface integral
or in terms of the parameters u and v as (2.2 14)
2.7.3
An Alternate Way to Write Line Integrals
We can also write the line integral
L P d x l + Q dx2
(2.2 15)
as
(2.216) where the vector field
3 is defined
as + v = QZ1- P2z
(2.217)
and 2 is the unit normal to the curve, that is, the perpendicular to 2.21):
(Fig.
Fi=txz3
-
dx2-el ds
-
dxi-e2. ds
(2.218)
3 now becomes v, = 3 . 6
The normal component of
=z
(QE1- P&) . d ~ 2 dxl + P-,ds ds
= Q-
(2.2 19) el
-
-e2 ds
(2.220) (2.221)
which gives
(2.222)
90
VECTOR ANALYSIS
8
Figure 2.21
If we take
3
1
Normal and the tangential components.
3 as + u -
P dxl
+ Q dx2,
(2.223)
we get
(2.224) =
L
-Q dxl
+ P dx2.
(2.2 25)
Example 2.7. Line integrals: Let C be the arc y = x 3 from (0,O) t o (- 1,l).T h e line integral
I =
Ic
can be evaluated as
.I
-1
I =
+ x3y d y
(2.226)
+ 3 ~ ' )dx
(2.227)
xy2 dx
(x'
2'
-
(2.228)
8 -
_1 - - 1 8
3
(2.229) (2.230)
Example 2.8. Closed paths: Consider the line integral
I
=
P
y3 d x + x 2 d y
(2.231)
VECTOR INTEGRAL CALCULUS IN TWO DIMENSIONS
Figure 2.22
91
Closed path in Example 2.8.
over the closed path in Figure 2.22. The first integral from (0,O) to (1,O) is zero, since y = 0 along this path. In the second part of the path from (1,O) to (1.1) we use y as our parameter and find
1'
1 dy = 1.
(2.232)
We use x as a parameter t o obtain the integral over y = x as
lo
x3 dx
+ x2 dx
-
(2.234) 7 -_
(2.235)
12'
Finally, adding all these we obtain I 2.7.4
(2.233)
=
A.
Green's Theorem
Theorem 2.1. Let D be a simply connected domain of the xlz2-plane and let C be a simple (does not intersect itself) smooth closed curve in D with its interior also in D. If P ( z l , x 2 ) and Q(x1,z2) are continuous functions with continuous first partial derivatives in D , then (2.236) where R is the closed region enclosed by C. Proof: We first represent R by two curves,
a 5x15 4
fl(X1)
5 2 2 F f2(x1),
(2.237)
as shown in Figure 2.23 and write the second double integral in Equation (2.236) as
92
VECTOR ANALYSIS
I
I
I
l
a
b
Figure 2.23
*x
1
Green’s theorem.
The integral over x2 can be taken immediately to yield
(2.240) P(Xi,X2) dXl.
=
(2.241)
Similarly, we can write the other double integral in Equation (2.236)as
(2.242) thus proving Green’s theorem. Example 2.9. Green’s Theorem: Using Green’s theorem [Eq. (2.236)], we can evaluate
I =
16xy3 dx + 24x2y2dy,
where C is the unit circle, x2+y2 = 1, and P I
=
/
=
(2.243)
16xy3and Q = 24x2y2as
L(48xy2 - 48xy2) dxdy = 0.
(2.244)
93
VECTOR INTEGRAL CALCULUS IN TWO DIMENSIONS
Example 2.10. Green’s Theorem: For the integral 2y
dx+-
X
22
+ y2
dY,
(2.245)
+
where C is the circle x2 y2 = 2, we cannot apply Green’s theorem since P and Q are not continuous at the origin.
Example 2.11. Green’s Theorem:
For the integral
(32 - y) dx
I =
+ (X + 5y) dy
/L(1+
1) dxdy
= 2A.
(2.246)
(2.247) (2.248)
where A is the area enclosed by the closed path C.
2.7.5
Interpretations of Green’s Theorem
I. If we take
in [Eq. (2.184)] (2.250)
where W T is the tangential component of 3, that is, W T = 3 . T a n d notice that the right-hand side of Green’s theorem [Eq. (2.236)] is the 2 3 component of the curl of that is,
a,
(2.251)
we can write Green’s theorem as (2.252)
This is a special case of Stokes’s theorem that is discussed in Section 2.8. 11. We have seen that if we take 3 as + v = QZ1 - P&,
(2.253)
94
VECTOR ANALYSIS
we can write the integral
I =
P dxl + Q dx2
(2.254)
as [Eq. (2.2lG)l
I=Lg.??ds=
(2.255)
Now, the Green’s theorem for 5 can be written as (2.256) (2.257) This is the two-dimensional version of the divergence theorem [Eq. (2.159)]. 111. Area inside a closed curve: If we take P = 2 2 in Equation (2.241) or Q = x1 in Equation (2.242), we obtain the area of a closed curve as
/J
dxldx2 = R
i
52
=i x 1
dxl
dx2.
(2.258) (2.259)
Taking the arithmetic mean of these two equal expressions for the area of a region R enclosed by the closed curve C, we obtain another expression for the area A as
which the reader can check with Green’s theorem [Eq. (2.236)]. 2.7.6
Extension to Multiply Connected Domains
When the closed Dath C in Green’s theorem encloses Doints a t which one or dP both of the derivatives - and - do not exist, Green’s theorem is not
aQ
817:1
8x2
applicable. However, by a simple modification of the path, we can still use Green’s theorem to evaluate the integral
I
=
fc P dxl + Q dx2.
(2.261)
Consider the doubly connected domain D shown in Figure 2.24 (left) defined by the boundaries a and b, where the closed path C1 encloses the hole in the
VECTOR INTEGRAL CALCULUS IN TWO DIMENSIONS
Figure 2.24
95
Doubly connected domain and the modified path.
domain. As it is, Green’s theorem is not applicable. However, if we modify our path as shown in Figure 2.24 (right), so that the closed path is inside the region, where the functions P, Q and their first derivatives exist, we can apply Green’s theorem to write
[Pdxl + Q d ~ z ] (2.262) (2.263) where R is now the simply connected region bounded by the closed curve C = C1 L1 + L2 C2.We can choose the two paths L1 and L2 as close as possible. Since they are traversed in opposite directions, their contributions cancel each other, thereby yielding
+
+
In particular, when (2.265) we obtain
96
VECTOR ANALYSIS
“‘r
tx2
Figure 2.25
Paths in Example 2.12.
The advantage of this result is that by choosing a suitable path C2, such as a circle, we can evaluate the desired integral I , where the first path, C1, may be awkward in shape (Fig. 2.24, left). Example 2.12 Multiply-connected domains: Consider the line integral
where C1 and C2 are two closed paths inside the domain D defined by two concentric circles x: + xz = a2 and xf xz = b2 as shown in Figure 2.25 (left). For the path C1, P, Q, and their first derivatives exist inside aP C1.Furthermore, since and - are equal:
+
aQ
8x2
8x1
(2.269)
I is zero. For the second path C2, which encloses the hole at the center, we modify it as shown in Figure 2.25 (right), where C, is chosen as a circle with radius T ( T > a),so that the integral on the right-hand side of (2.270)
97
CURL OPERATOR AND STOKES'S THEOREM
L
Figure 2.26
Curl of a vector field
can be evaluated analytically. The value of the integral over 6'3, x? xi = r 2 , can be found easily by introducing a new variable 6' :
I
=
.d'
+
x1 = T C O S ~ ,
(2.271)
x2 = T sin 0, Q E [O, 2 ~ ]
(2.272)
[ P dxl
+ Q dxz]=
(2.273)
.1c3
2.8
CURL OPERATOR AND STOKES'S THEOREM
2.8.1 On the Plane Consider a vector field on the plane and its line integral over the closed rectangular path shown in Figure 2.26 as
We first consider the integral over C1, where
22 = 2 0 2 :
98
VECTOR ANALYSIS
Figure 2.27
Infinitesimal rectangular path.
Expanding 7 ( 5 1 , 2 2 ) in Taylor series about linear terms, we write
+
( ~ 0 1 , 5 0 2and )
(22
keeping only the
(2.276)
- 2021,
which, when substituted into Equation (2.275), gives
We now take the integral over C3, where Ax1 to 501:
201
+
2 2 = x02
+ Ax2 and x1 varies from
xo1 i 3 d ( z 1 , x 2 ) . d 7 = /
dZiVi(x1,xoz
+ Axz).
(2.278)
zoi+A~i
Substituting the Taylor series expansion [Eq. (2.276)] of ( 2 0 1 , xo2) evaluated at 2 2 = 2 0 2 Ax2:
+
Vl(x1, x2)
about
(2.279) into Equation (2.278) and integrating gives
-
AX2AX1.
(2.280)
CURL OPERATOR AND STOKES’S THEOREM
99
Note the minus sign coming from the dot product in the integral. Combining these results [Eqs. (2.277) and (2.280)] we obtain
L
.k
T ( x 1 , ~ 2 ) . d 7 + T‘(xi,x2).d?=
I
-
Ax~Ax~.
dV1(x11x2) dx2 (xo1 J 0 2 )
A similar procedure for the paths
C2
(2.281)
and C, yields
(2.282) which, after combining with Equation (2.281), gives
Since the location of 7 0 is arbitrary on the xlx2-plane, we can drop the subscript 0. If we also notice that the quantity inside the square brackets is the 2 3 component of x we can write
a‘ d,
(2.284) The approximation we have made by ignoring the higher-order terms in the Taylor series expansion is justified in the limits as Ax1 0 and Ax2 -+ 0. For an infinitesimal rectangle we can replace Axl with dxl and Ax2 with dx2. Similarly, AD= Ax1Ax2 can be replaced with the infinitesimal area element da12. For a finite rectangular path C, we can sum over the infinitesimal paths as shown in Figure 2.27. Integrals over the adjacent sides cancel, thereby leaving only the integral over the boundary C as -+
=
/l(7 7) x
.6da12,
(2.285)
where C is now a finite rectangular path. The right-hand side is a surface integral to be taken over the surface bounded by C , which in this case is the region on the xlx2-plane bounded by the rectangle C, with its outward normal 6 defined by the right-hand rule as the Z3 direction. Using Green’s theorem [Eq. (2.252)] in Equation (2.284), we see that this result is also valid for an arbitrary closed simple path C on the xlx2-plane as (2.286)
100
VECTOR ANALYSIS
tz3
Figure 2.28
Different surfaces with the same boundary C.
tf
where VT is the tangential component of along C and R is the region bounded by C. The integral on the right-hand side is basically a surface integral over a surface bounded by the curve C , which we have taken as S 1 lying on the zlzz-plane, with its normal 6 as defined by the right-hand rule (Fig. 2.28, left). We now ask the question, What if we use a surface Sz in three dimensions (Fig. 2.28, right), which also has the same boundary as the planar surface in Figure 2.28 (left)? Does the value of the surface integral on the right-hand side in Equation (2.286) change? Since the surface integral in Equation (2.286) is equal to the line integral (2.287) which depends only on and C, its value should not depend on which surface we use. In fact, it does not, provided that the surface is oriented. An oriented surface has two sides: an inside and an outside. The outside is defined by the right-hand rule. As in the first two surfaces in Figure 2.29, in an oriented surface one cannot go from one side to the other without crossing over the boundary. In the last surface in Figure 2.29 we have a Mobius strip, which has only one side. Following a closed path, one can go from one “side” with the normal 6i to the other side with the normal 60,which points exactly in the opposite direction, without ever crossing a boundary. Consider two orientable surfaces S 1 and S, with the same boundary C and cover them both with a network of simple closed paths Ci with small areas, Aa,, each (Fig. 2.30). In the limit as Aai 4 0, each area element naturally coincides with the tangent plane to the surface of which it belongs at that point. Depending on their location, normals point in different directions. For
CURL OPERATOR AND STOKES'S THEOREM
Figure 2.29
101
Orientable surfaces versus the Mobius strip.
each surface element we can write
?.d7
=
(? x 74) .%iAui,
(2.288)
where i denotes the ith surface element on either 5'1 or 5'2, with the boundary Ci.For the entire surface we have t o sum these as
l and for S (2.290) for S2. Since the surfaces have different surface areas, 1 and m are different in general. In the limit as 1 and m go to infinity, contributions coming from adjacent sides will cancel. Thus the sums on the left-hand sides of Equations (2.289) and (2.290) reduce t o the same line integral over their common boundary C : (2.291) On the other hand, the sums on the right-hand sides become surface integrals over their respective surfaces, S 1 and S2. Hence, in general we can write (2.292) where S is any oriented surface with the boundary C.
102
VECTOR ANALYSIS
Figure 2.30
2.8.2
Two orientable surfaces
In Space
In Equation (2.292) even though we took S as a surface in three-space, its boundary C is still on the zlx2-plane. We now generalize this result by taking the closed simple path C also in space. Stokes’s Theorem: Consider a smooth oriented surface S in space with a smooth simple curve C as its boundary. Then for a given continuous and differentiable vector field (2.293) in some domain D of space, which includes S, we can write
(2.294)
where 6 is the outward normal to S. Proof: We first write Equation (2.294) as
i
? . d?
=
V, dzl
+ V, dz2 + V3 dz3
(2.295)
CURL OPERATOR AND STOKES’S THEOREM
103
P-7 C
I I
I
I
I I
Figure 2.31
Stokes’s theorem in space.
which can be proven by proving three separate equations:
(2.298) We also assume that the surface S can be written in the form x3 = f(z1,xz)
(2.299)
and as shown in Figure 2.31, C12 is the projection of C onto the xlx2-plane. Hence, when (x1,~ 2 ~ x goes 3 ) around C a full loop, the corresponding point ( X I , 2 2 , O ) also completes a full loop in C l2 in the same direction. We choose the direction of 2 with the right-hand rule as the outward direction. Using Green’s theorem [Eq. (2.236)l with Q = 0, we can write
=
-
1L,,[9 9x1
We now use Equation (2.212) with
ax2
+
ax3
ax2
dxldx2.
(2.300)
7taken as (2.301)
104
VECTOR ANALYSIS
7
Note that in Equation (2.212) is an arbitrary vector field. Since the normal 75’ to d a is just the gradient to the surface 23
-
f (51,XZ)= 0,
(2.302)
that is,
*=
af
(--,--,I),
8x1
af
(2.303)
ax2
we write Equation (2.212) as
Since
where y is the angle between ?3 and 3, d a co s y is the projection of the area element, d b ,onto the xlx2-plane, that is,
We can now rewrite the left-hand side of Equation (2.304) as an integral over Rl2 to obtain the relation -
/ 1,2[zg + 21
dxldx2=
/ ./,2
dx3dx1 - dV1 dxldx2. 8x2 (2.307)
Substituting Equation (2.307) into (2.300), we obtain
which is Equation (2.296). In a similar fashion we also show Equations (2.297) and (2.298). Finally, adding Equations (2.296)-(2.298) we establish Stokes’s theorem.
MIXED OPERATIONS WITH THE DEL OPERATOR
105
A
n
Figure 2.32
2.8.3
Unit normal to circular path.
Geometric Interpretation of Curl
We have seen that the divergence of a vector field ? is equal to the ratio of the flux through a closed surface S to the volume enclosed by S in the limit as the surface area of S goes to zero [Eq. (2.160)], that is, (2.309) Similarly, we can give an integral definition for the value of the curl of a vector field in the direction G as
7
=
lim
r-0
jCr7. d 7 A,
(2.310) 1
where C, is a circular path with radius r and area A,, and G is the unit normal to A, determined by the right-hand rule (Fig. 2.32). In the limit as the size of the path shrinks to zero, the surface enclosed by the circular path can be replaced by a more general surface with the normal 6. Note that this is also an operational definition that can be used to construct a “curl-meter,” that is, an instrument that can be used to measure the value of the curl of a vector field in the direction of the axis of the instrument, 6.
2.9
MIXED OPERATIONS W I T H T H E DEL OPERATOR
3
By paying attention to the vector nature of the operator and also by keeping in mind that it is meaningless on its own, we can construct several other useful operators and identities. For a scalar field, @(7), a very useful operator can be constructed by taking the divergence of a gradient as
3.3@(7) = 32@(7),
a‘
(2.311)
where the operator is called the Laplacian or the Laplace operator, which is one of the most commonly encountered operators in science. Two
106
VECTOR ANALYSIS
very important vector identities used in potential theory are ~ ' . ( V+ AX )=O
(2.312)
and
Txvk=o,
(2.313)
where 2 and Q? are differentiable vector and scalar fields, respectively. In other words, the divergence of a curl and the curl of a gradient are zero. Using the definition of the operator, proofs can be written immediately. For Equation (2.312) we write
a'
a ' . ( v x x ) = d e t ( : A1
Az
2 ), A3
(2.314)
and obtain
(2.315)
(2.316)
(2.317) Since the vector field is differentiable, the order of differentiation in Equation (2.317) is unimportant and so the divergence of a curl is zero. For the second identity [Eq. (2.313)], we write (2.318)
(2.319) = 0.
(2.320)
Since for a differentiable Q? the mixed derivatives are equal, we obtain zero in the last step, thereby proving the identity.
107
MIXED OPERATIONS WITH THE DEL OPERATOR
Another useful identity is
a'.( U V V ) = a'u . a'v + u w u ,
(2.321)
where u and u are two differentiable scalar fields. We leave the proof of this identity as an exercise, but by using it we prove two very useful relations. We first switch u and u in Equation (2.321):
a'.(ua'u)= v u . vu + va'2u;
(2.322)
then we subtract this from the original equation [Eq. (2.32l)l to write
a'.( U V U ) - a'.(va'u)= ua'2u
-
va'2u.
(2.323)
Integrating both sides over a volume V bounded by the surface S and using the divergence theorem (2.324) we obtain Green's first identity:
d 2 . [ua'u - ua'u] =
d r [ua"u
-
ua'"u] .
(2.325)
Applying the similar process directly to Equation (2.321), we obtain Green's second identity:
~ d d - u ~ u - ~ d r [ ~ u - a ' ~ - u a ' ~ u(2.326) ]. Useful vector identities (2.327)
a'Xa'f=O,
9 .(T x 3 )= o ,
(2.328) (2.329)
(2.330) a' x a' x 2 = a'(T.2) v22, a ' . ( X x 3)= Z . ( ( a ' X 2 )- 2 . ( V x 3), (2.331) V ( 2 .3)= 2 x (a'x 3)+ 3 x (a'x 2)+ ( 2 .T ) 3+ (8. V)2, -
(2.332)
3 x (2x 3)= X p . 3) 3 p .2)+ (8. a')X - (2. V)3. -
(2.333)
108
VECTOR ANALYSIS
A
Figure 2.33
Gravitational force and gravitational field.
2.10 POTENTIAL THEORY The gravitational force that a point mass M located a t the origin exerts on another point mass m a t ? is given by Newton’s law (Fig. 2.33) as
Mm, 3 = -G-er, r2
(2.334)
where G is the gravitational constant and Zr is a unit vector along the radial direction. Since mass is always positive, the minus sign in Equation (2.334) indicates that the gravitational force is attractive. Newton’s law also indicates that the gravitational force is central, that is, the force is directed along the line joining the two masses. We now introduce the gravitational field 3 due to the mass M as +
M, r2
g = -G-er,
(2.335)
which assigns a vector to each point in space, with a magnitude that decreases with the inverse square of the distance and always points toward the central mass M (Fig. 2.33). Gravitational force that M exerts on another mass m can now be written as
F’
=m
3.
(2.336)
In other words, M attracts m through its gravitational field, which eliminates the need for action at a distance. Field concept is a very significant step in understanding interactions in nature. Its advantages become even more clear with the introduction of the Lagrangian formulation of continuum mechanics and then the relativistic theories, where the speed of light is the maximum speed with which any effect in nature can propagate. Of course, in Newton’s theory the speed of light is infinite and the changes in a gravitational field at
POTENTIAL THEORY
109
a given point are felt everywhere in the universe instantaneously. Today the field concept is an indispensable part of physics, at both the classical and the quantum level. We now write the flux 4 of the gravitational field of a point mass over a closed surface S enclosing the mass M (Fig. 2.34, left) as
(2.337) Since the solid angle, do, subtended by the area element du is (2.338) (2.339) (2.340) we can write the flux as
(2.341) = -GM i d , , ,
whcre dA is the area element in the direction of surface gives
(2.342)
&. Integration over the entire
4 = -4rGM,
(2.343)
where the solid angle subtended by the entire surface is 47r. We now use the divergence theorem [Eq. (2.159)] to write the flux of the gravitational field as
(2.344) which gives
7 .T d r = -47rGM,
(2.345)
where V is the volume enclosed by the closed surface S. An important property of classical gravity is linearity; that is, when there are more than one particles interacting with m, the net force that m feels is the
110
VECTOR ANALYSIS
Figure 2.34
Flux of the gravitational field.
sum of the forces that each particle exerts on m as if it were alone. Naturally, for a continuous distribution of matter with density p ( 7 ) interacting with a point mass m, the mass M in Equation (2.345) is replaced by an integral:
M
+
L
p ( 7 ) dr.
We now write Equation (2.345) as
.If 3 . T or as
d r = -47rG
L (7.+ T
L
(2.346)
p ( 7 ) dr
(2.347)
I r G p ( 7 ) ) d r = 0.
(2.348)
For an arbitrary but finite volume element, the only way to satisfy this equality is to have the integrand vanish, that is,
3 . ?J’+ 47rGp( 7)= 0,
(2.349)
which is usually written as
3 .3 = -47rGp(7).
(2.350)
This is the classical gravitational field equation to which Einstein’s theory of gravitation reduces in the limit of weak fields and small velocities. Given the
POTENTIAL THEORY
111
mass distribution p(?), it gives a partial differential equation to be solved for the gravitational field T . If we choose a closed surface that does not include the mass M , then the net flux over the entire surface is zero. If we concentrate on a pair of area elements, dAl and d A 2 , in the figure on the right (Fig. 2.34), we write the total flux as
+
(2.351)
d412 = d d i d4z = - G M d R l + GMdR2.
(2.352)
Since the solid angles, dR1 and dR2, subtended at the center by dA1 and Az, respectively, are equal, d41 and dq52 cancel each other. Since the total flux is the sum of such pairs, the total flux is also zero. The gravitational field equation to be solved for a region that does not include any mass is given as
T.7j+=O0.
(2.353)
As we have mentioned before, this does not mean the gravitational field is zero in that region, but it means that the sources are outside the region of interest.
2.10.1
Gravitational Field of a Spherically Symmetric Star
For a spherically symmetric star with density p ( r ) , the gravitational field depends only on the radial distance from the origin. Hence we can write ++
(
'
(2.354)
= g(')cT,
where ZT is a unit vector pointing radially outwards. To find g ( r ) ,we choose a spherical Gaussian surface, S ( T ) ,with radius r. Since the outward normal to a sphere is also in the ZT direction, we utilize the divergence theorem to convert the volume integral in Equation (3.347) to a surface integral,
JI,,, 7 .T
dr
and write
g ( r ) (ZT . G ) do
=
-4rG
f ' g ( r ) r z dR = -47rG
g(r)r2
T . d*,
=
f' dR = -47rG
L(T)
dr,
(2.356)
p(r)r2drdR,
(2.357)
f' dR,
(2.358)
P(T)
s,,) 1
(2.355)
p(r)r2 d r
where d o = r2dR = r2 sin 9 d9d+ is the infinitesimal surface area element of the sphere. Since $dR = 4n, we obtain the magnitude of the gravitational
112
VECTOR ANALYSIS
Figure 2.35
Work done by the gravitational field.
field as
(2.359) (2.360) (2.361) An important feature of this result is that part of the mass lying outside the Gaussian surface, which is a sphere of radius r, does not contribute to the field at r and the mass inside the Gaussian surface acts as if it is concentrated at the center. Note that dm, is the mass of an infinitesimal shell at r with thickness dr. Similarly, if we find the gravitational field of a spherical shell of radius R, we find that for points outside, r 2 R, the shell behaves as if its entire mass is concentrated a t the center. For points inside the shell, the gravitational field is zero. These interesting features of Newton’s theory of gravity also remain intact in Einstein’s theory, where they are summarized in terms of Birkhoff’s theorem.
2.10.2 Work Done by Gravitational Force We now approach the problem from a different direction. Consider a test particle of mass m moving along a closed path C in the gravitational field of another point particle of mass M (Fig. 2.35). The work done by the
POTENTIAL THEORY
113
gravitational field on the test particle is (2.362) (2.363) where gT is the tangential component of the gravitational field of M along the path. Using Stokes’s theorem [Eq. (2.294)], we can also write this as
W
=m
i 3. d 7
(2.364) (2.365)
If we calculate 3 x for the gravitational field of the point mass M located at the origin, we find
a‘~y=v’x =-GMTx
(2.366)
[
X l G (Lc;
+
x2z2
+ x323
+ x$ + x 3 3 / 2
= 0.
1
(2.367) (2.368)
3 T
Substituting x = 0 into Equation (2.365), we obtain the work done by the gravitational field on a point particle m moving on a closed path as zero. If we split a closed path into two parts as C1 and C2, as shown in Figure 2.35, we can write (2.369) CZ
c1
Interchanging the order of integration, we obtain r2
r2
(2.370) Since C1 and C2 are two arbitrary paths connecting points 1 and 2, this means that the work done by the gravitational field is path-independent. As the test particle moves under the influence of the gravitational field, it also satisfies the second law of Newton, that is, (2.371) (2.372)
114
VECTOR ANALYSIS
Using this in Equation (2.370), we can write the work done by gravity as (2.373)
(2.374)
(2.375)
(2.376)
(2.377)
(2.378)
(2.379) In other words, the work done by gravity is equal to the change in the kinetic energy,
T
=
1 2 -mu , 2
(2.380)
7
of the particle as it moves from point 1 to 2. This result, x 3 = 0, obtained for the gravitational field of a point mass M has several important consequences. First of all, since the gravitational interaction is linear, the gravitational field of an arbitrary mass distribution can be constructed from the gravitational fields of point masses by linear superposition. Hence Vx?j+=0
(2.381)
is a general property of Newtonian gravity, independent of the source and the coordinates used.
2.10.3 Path Independence and Exact Differentials We have seen that for an arbitrary vector field 3, if the curl is identically zero, then we can write 3 as the gradient of a scalar field, that is, if 7 X ? = O ,
(2.382)
POTENTIAL THEORY
we can always find a scalar field,
a(?),
such that
37 = ?a. The existence of a differentiable of 3, that is, by the conditions
115
(2.383)
is guaranteed by the vanishing of the curl
dVl
dV2
8x2
8x1
=0,
(2.384) (2.385)
dV3
dUl
8x1
8x3
1
v1 dxl
= 0.
(2.386)
+ v2 dx2 + u3 dx3.
(2.387)
We consider the line integral
l2
3. d 7=
If we can find a scalar function, are
2
@(XI,
x 2 , 2 3 ) , such
that its partial derivatives
(2.388) then the line integral [Eq. (2.387)] can be evaluated as
(2.389) (2.390) (2.391) = @(2) - @(l).
(2.392)
In other words, when such a @ can be found, the value of the line integral; J;” 37 .d?, depends only on the values that Q, takes at the end points, that is, it is path-independent. When such a function exists, vldxl + v2dxz + v3dx3 is called an exact differential and can be written as
116
VECTOR ANALYSIS
The existence of (a is guaranteed by the following sufficient and necessary differentiability conditions:
(2.394) (2.395) (2.396)
(2.397) (2.398) (2.399) which are nothing but the conditions [Eqs. (2.384)-(2.386)] for
2.10.4
Gravity and Conservative Forces
We are now ready t o apply all this t o gravitation. Since introduce a scalar function @ such that + g =-?(a, where
9 x 3 = 0.
(a(?)
9x3
=
0, we
(2.400)
is called the gravitational potential:
a(?)
= -G-
M r
(2.401)
The minus sign is introduced to assure that the force is attractive, that is, it is always toward the central mass M . We can now write Equation (2.370) as
(2.402) = -m[@(2) - @(I)].
(2.403)
Using this with Equation (2.379), we can write
[:
-m [@(a)- @(I)]= -mu
2]2-
[+U2l1.
(2.404)
POTENTIAL THEORY
117
If we rewrite this as (2.405) we see that the quantity 1 -mu2 +ma(?) = E 2
(2.406)
is a constant throughout the motion of the particle. This constant, E , is nothing but the conserved total energy of the particle. The first term, + m u 2 ,is the familiar kinetic energy. Hence we interpret ma(?) as the gravitational potential energy, 0, of the particle m,
R(?)
= m@(?),
(2.407)
and write 1 -mu2fR=E. 2
(2.408)
To justify our interpretation of R , consider m at a height of h from the surface of the Earth (Fig. 2.36) and write
R = m@(7) -
-m-
GM ( R+ h ) (2.409)
<< R, we
can use the binomial
GMm (1 __ ! I ,) R
(2.410)
where R is the radius of the Earth. For h expansion to write -
RE--GMm R + m ( g ) h .
(2.411)
If we identify GM/R2 as the gravitational acceleration g , the average numerical value of which is 9.8 m/s2, the second term becomes the gravitational potential energy, mgh, familiar from elementary physics. The first term on the right is a constant. Since from 3 = -q@, adding or subtracting a constant to @ does not effect the fields and hence the forces, which are the directly accessible quantities to measurement, we can always choose the zero level of the gravitational potential energy. Thus, when R >> h we can take the gravitational potential energy as
R
= mgh.
(2.412)
118
VECTOR ANALYSIS
tm I
Ih I
Figure 2.36
Gravitational potential energy.
From the definition of the gravitational field of a point particle, + MA g = -G-er,
(2.4 13)
r 2
it is seen that operationally the gravitational field at a point is basically the force on a unit test mass. Mathematically, the gravitational field of a mass distribution given by the density p ( 7 ) is determined by the field equation
V . ?= j’ -47rGp( 7),
(2.414)
which is also known as Gauss’s law for gravitation. Interactions with a vanishing curl are called conservative forces. Frictional forces and in general velocity-dependent forces are nonconservative, since the work done by them depends upon the path that the particles follow. 2.10.5
Gravitational Potential
We consider Equation (2.402) again and cancel m on both sides to write r2
3 . d 7
Q(2) - Q(1) = -
(2.4 15)
C
or (2.416)
If we choose the initial point 1 a t infinity and define the potential there as zero and the final point 2 as the point where we want to find the potential,
POTENTIAL THEORY
119
we obtain the gravitational potential as
-
@(?)
=
-
T
’
d?.
s’, -
(2.41 7)
From Figure 2.37 it is seen that the integral . d? is equal to the work that one has to do to bring a unit test mass infinitesimally slowly from infinity to ? : (2.4 18) (2.419) (2.420)
Note that for the test mass to move infinitesimally slowly, we have to apply a force by the amount (2.421)
so that the test particle does not accelerate towards the source of the gravitational potential. For a point mass M this gives the gravitational potential as
M @(?) = -G-. r
(2.422)
What makes this definition meaningful is that gravity is a conservative field. Hence @ is independent of the path we use (Fig. 2.37). We can now use + g =-?a
(2.423)
to write the gravitational field equation [Eq. (2.414)] as
7.g@= 47iGp,
(2.424)
V2@ = 4-irGp,
(2.425)
or as
which is Poisson’s equation. In a region where there is no mass, the equation t o be solved is
3% = 0,
(2.426)
which is Laplace equation, and the operator ?’ is called the Laplacian. The advantage of working with the gravitational potential is that it is a scalar and hence has only magnitude, which makes it easier t o work with.
120
VECTOR ANALYSIS
Figure 2.37
Gravitational potential.
Since gravity is a linear interaction, we can write the potential of N particles by linear superposition of the potentials of the individual particles that make up the systeni as N
mi
@(7) = -G
(2.427)
i=l
where 7 i is the position of the ith particle and 7is called the field point. In the case of a continuous mass distribution, we write the potential as an integral:
Q(7) = -G
p ( 7’) d37’
(2.428)
where the volume integral is over the source points 7’.After a(?) is found, one can construct the gravitational field easily by taking its gradient, which involves only differentiation. 2.10.6
Gravitational Potential Energy of a System
For a pair of particles, gravitational potential energy is written as [Eqs. (2.401) and (2.407)]
R
=
Mm -G-, T
(2.429)
where T is the separation between the particles. For a system of N discrete particles we can consider the system as made up of pairs and write the grav-
121
POTENTIAL THEORY
it,ational potential energy in the following equivalent ways: mimj 7.. - 7. - ---t
C
R=-G
-,
All pairs, i#j
211-
Ti
(2.430)
'Zj
(2.431)
(2.432) We have written R in three different ways. First of all, we do not include the cases with i = j , which are not even pairs. These terms basically correspond to the self energies of the particles that make up the system. We leave them out since they contribute as a constant that does not change with the changing configuration of the system. The factor of 1/2 is inserted in the last expression to avoid double counting of the pairs. Note that R can also be written as 1 2
+
+ . . . + m,@.,)
(2.433)
R = - (ml@1 m2@2 N
N
1 9. i f i. = - E m + @ + , = -GT
2
(2.434)
2=1
where @i is the gravitational potential at the location of the particle mi due to all other particles. If the particles form a continuum with the density p, we then write
R=il =
f
M
@dm @(?"')p(?"')
(2.435) (2.436)
d37',
where @ is the potential of the part of the system with the mass M acting on dm = p d 3 7 .
-
dm
Example 2.12. Gravitational potential energy of a uniform sphere: For a spherically symmetric mass distribution with density p ( r ) and radius R we can write the gravitational potential energy as
R(R) =
@ dm
(2.437) (2.438)
where m(r) is the mass inside the radius r, and d,m is the mass of the shell with radius r and thickness dr: dm = 47rr2p(r) dr.
(2.439)
122
VECTOR ANALYSIS
For uniform density po we write s1 as (47rp0r3/3) 47rr2po d r
R(R) = - G I
r
,
(2.440)
which gives
R(R) = --.
3GM2 5R
(2.441)
Because of the minus sign, this is the amount of work that one has t o do to disassemble this object by taking its particles t o infinity. 2.10.7
Helmholtz Theorem
We now introduce an important theorem due to Helmholtz, which is an important part of potential theory. Theorem 2.2. A vector field, if it exists, is uniquely determined in a region R surrounded by the closed surface S by giving its divergence and curl in R and its normal component on S. Proof: Assume that there are two fields, dl and 3 2 , that satisfy the required conditions, that is, they have the same divergence, curl, and normal component. We now need to show that if this be the case, then these two fields must be identical. Since the divergence, the curl, and the dot product are all linear operators, we define a new field 7i? as
d
=3 1
-
3 2 ,
(2.442)
which satisfies
?x
Since
d = O in R,
(2.443)
a'.7i? = 0 in R,
(2.444)
2 . 3= 0 on S.
(2.445)
? x 8 = 0, we can introduce a scalar potential @ as 7i? = -TQ.
(2.446)
Using Green's second identity [Eq. (2.326)]: (2.447)
with the substitution u = u
= @,
we write
POTENTIAL THEORY
123
When Equation (2.446) is substituted, this becomes
i d 3 . (@Tit)= h d r [-Tit. Tit - a ? . 31. Since the first integral,
A d z . @Tit =
A
do@( G . Tit) ,
(2.449)
(2.450)
is zero because of Equation (2.445) and the integral (2.451) is zero because of Equation (2.444), Equation (2.449) reduces t o
(2.452) Since (312 is always a positive quantity, the only way t o satisfy this equation for a finite volume is to have
5=0,
(2.453)
that is, (2.454) thereby proving the theorem.
2.10.8 Applications of the Helmholtz Theorem Helmholtz theorem says that a vector field is completely and uniquely specified by giving its divergence, curl, and normal component on the bounding surface. When we are interested in the entire space, the bounding surface is usually taken as a sphere in the limit as its radius goes to infinity. Given a vector field, we write its divergence and curl as (2.455) (2.456) where kl and k2 are constants. The terms on the right-hand side, p(?) and T(?),are known functions of position and in general represent sources and current densities, respectively. There are three cases that we analyze separately:
124
VECTOR ANALYSIS
(I) In cases for which there are no currents, the field satisfies (2.45 7) (2.458) We have already shown that when the curl of a vector field is zero, we can always find a scalar potential, @(?), such that
3 = -9@.
(2.459)
Now the second equation [Eq. (2.458)] is satisfied automatically and the first equation can be written as Poisson's equation
a'%
=
-k1p,
(2.460)
the solution of which can be written as (2.461) where the volume integral is over the source variable 7' and 7is the field point. Notice that the definition of scalar potential [Eq. (2.459)] is arbitrary up to an additive constant, which means we are free to choose the zero level of the potential. (11) In cases where p ( 7 ) = 0, the field equations become
9..=0,
(2.462)
a' x 3 = k 2 7 ( 7 ) .
(2.463)
We now use the fact that the divergence of a curl is zero and introduce a vector potential such that
x(?)
3 = 9 X Z .
(2.464)
We have already proven that the divergence of a curl vanishes identically. We now prove the converse, that is: if the divergence of a vector field 3 vanishes identically, then we can always find a vector potential 2 such that its curl + gives 3. Since we want A to satisfy Equation (2.464), we can write
dA3 8x2
dA2 8x3
= 'u1,
(2.465) (2.466) (2.467)
125
POTENTIAL THEORY
Remembering that the curl of a gradient is zero [Eq. (2.320)], we can always + add or subtract the gradient of a scalar function to the vector potential A ,
x x +T h , --f
(2.468)
without affecting the field 3.This gives us the freedom t o set one of the components of 3 to zero. Hence we set A3 = 0, which simplifies Equations (2.465)-(2.467) to (2.469) (2.470) dA2
ax,
dAl 8x2
= 213.
(2.471)
The first two equations can be integrated immediately to yield
I,, 23
A1 =
v2
(2.472)
dx3,
-lo, + x3
A2
=
211
dx3
f2(21,~2),
(2.473)
where f2(x1,x2) is arbitrary a t this point. Substituting these into the third equation [Eq. (2.471)],we obtain (2.474) Using the fact that the divergence of 3 is zero, that is, avl dv2 -+-+---=0, 8x1 ax2
av3
ax3
(2.475)
we can write Equation (2.474) as (2.476) The integral in Equation (2.476) can be evaluated immediately to give
+
a f 2 ( x 1 1 x 2 ) U3(51,22,23) -vuQ(Xl,x2,~03) = ‘k3(21,22,23),
ax 1
which yields
f2(x1,x2)as
the quadrature
(2.477)
126
VECTOR ANALYSIS
Substituting f2 into Equation (2.473) we obtain the vector potential as
Lo3 1:: z3
A1
=
A2
=
(2.480)
UZ(zl,zZ,z3) d53, V3(zlrz2,z03) dzl
-
A3 = 0.
1::
Ul(zl,Z2,23) dx3,
(2.481) (2.482)
In conclusion, given a vector field 3 satisfying Equations (2.462) and + (2.463), we can always find a vector potential A such that
3=a‘XX, where 2 is arbitrary up to Using a vector potential (2.463) as
(2.483)
tb gradient of a scalar function.
A , [Eq. (2.464)], we can now write Equation
a‘ x 3 = kJ(?;’),
(2.484)
X=kJ(T+),
(2.485)
a‘ x a ‘ x
V ( V .2) 322 = k 2 J ’ ( ? ; ’ ) . -
Using the freedom in the choice of
(2.486)
2 we can set
a‘.2=0,
(2.487)
which is called the Coulomb gauge in electrodynamics. The equation t o be solved for the vector potential is now obtained as 7
2
2
= -k,J’(?.).
(2.488)
Since the Laplace operator is linear, each component of the vector potential satisfies Poisson’s equation,
V2Ai= -k2Ji(?;’),
i = 1,2,3;
(2.489)
hence we can write its solution as (2.490) (111) In the general case, where the field equations are given as
a‘.3 = k1p(?;’), a‘ x 3 = kJ(?;’),
(2.491) (2.492)
POTENTIAL THEORY
we can write the field in terms of the potentials @ and
127
2 as
a' X 2.
37 = -a'@+
(2.493)
Substituting this into the first equation [Eq. (2.491)] and using the fact that the divergence of a curl is zero, we obtain
-a' a'@+ a'.(a'x 2)= kip, '
V2@ = -kip.
(2.494) (2.495)
Similarly, substituting Equation (2.493) into the second equation [Eq. (2.492)], we get
a' x (-a'@+ a' x 2)= k 2 7 ( 7 ) , -V x V@+ a' x a' x 2 = k 2 J ( 7 ) , a' (72 ) v2x = k J ( T + ) , -
'
(2.496) (2.497) (2.498)
where we used the fact that the curl of a gradient is zero. Using the Coulomb gauge (q. 2 = 0) and Equation (2.495), we obtain the two equations t o be solved for the potentials as (2.499) (2.500)
2.10.9
Examples from Physics
Gravitation: We have already discussed this case in detail. The field equations are given as
a'.Tj+= -47rGp(7), a'X?j+=O,
(2.501) (2.502)
where p( ?) is the source of the gravitational field, that is, the mass density. Instead of these two equations, we can solve Poisson's equation,
a"@= 47rGp(?'f),
(2.503)
for the scalar potential @, which then can be used to find the gravitational field by + g
Electrostatics:
=-a'@.
(2.504)
128
VECTOR ANALYSIS
In electrostatics the field equations for the electric field are given as
a'.3 = 47rp(?), a'XZ=O.
(2.505) (2.506)
Now, p(?) stands for the charge density and the plus sign in Equation (2.505) nieans like charges repel and opposite charges attract. Poisson's equation for the electrostatic potential is
V2@= -47rp(?), where
z
=
-T@.
(2.507)
(2.508)
Magnet ostat ics: Now the field equations for the magnetic field are given as
T..=O, a'x
(2.509)
3 = "c J ,
(2.510)
where c is the speed of light and J' is the current density. The fact that the divergence of 3 is zero is a direct consequence of the fact that magnetic monopoles do not exist in+ nature. Introducing a vector potential A and with the Coulomb gauge, 3 . A = 0, we can solve
(2.511) and obtain the magnetic field via
Z=VxX.
(2.512)
Maxwell's equations: The tinie-dependent Maxwell's equations are given as
3.23= 4np,
Tx
1 ax z+-0 c at , =
(2.513) (2.514)
T.Z=O,
(2.515)
1az =-J'. 47r a' x 3 --c at c
(2.516)
These equations are coupled and have to be considered simultaneously. We now introduce the potentials @ and 2 such that
(2.517) (2.518)
POTENTIAL THEORY
129
and use the Lorenz gauge: 1aQi
+
--+?.A c at
=O.
(2.5 19)
Hence Maxwell’s equations reduce t o (2.520) (2.521)
Applications of potential theory to electromagnetic theory can be found in Griffiths and Inan & Inan (a,b). Irrotational flow of incompressible fluids: For flow problems the continuity equation is given as
? . 7 + - =dP 0,
at
(2.522)
7
where is the current density and p is the density of the flowing material. In general, the current density can be written as
J
=p 3 ,
(2.523)
where d is the velocity field of the fluid. Hence the continuity equation becomes dP 7. ( p d ) + - = 0. at
(2.524)
For stationary flows, apldt = 0. If we also assume incompressible fluids, that is, p = constant, the continuity equation reduces to
T..=O.
(2.525)
However, from the Helmholtz theorem we know that this is not sufficient to determine the velocity field 3.If we also assume irrotational flow, which means ? X d = O ,
(2.526)
we can introduce the velocity potential Qi: ;ii’ =
?a.
(2.52 7)
Substituting this into Equation (2.525), we obtain Laplace equation
7%= 0.
(2.528)
130
VECTOR ANALYSIS
PROBLEMS
1. Using coordinate representation, show that
(2x 3). (3x 5)= (2.3)(3. 73)- (2.3)(3.3). 2. Using the permutation s l z b o l , show that the i t h component of the cross product of two vectors, A and 3, can be written as 3
3
j=1 k = l
3. Prove the triangle inequality
4. Prove the following vector identity, which is also known as the Jacobi identity:
2 x (2x 3)+2 x (3 x 2)+3 x (2 x 3) =o. 5 . Showthat
(2x 2)x (3x d)= (2.3 x 3 ) Z - ( 2 . 3x 7?)5. + * 6. Show that for three vectors, A , B and essary and sufficient condition is
3,to be noncoplanar the nec-
2 .(3x 73)# 0. 7. Find a parametric equation for the line passing through the points (a) ( 2 , 2 , - 2 ) and ( - 3 , 1 , 4 ) ,
(b) (-1, 4,3) and (4, -3,l). 8. Find the equation of the line orthogonal to i
(a) A = (1, -11,
(b)
3 = (-5,
21,
2 = ( 2 , -l), 7= (4,2).
9. Show that the lines 221 - 3 2 2 =
and
1
2 and passing through 7:
PROBLEMS
131
are not orthogonal. What is the angle between them?
10. Find the equation of the plane including the point normal 3:
3 and
with the
3 = (2,1, -11, 3 = (1, I, 21, (b) ? = (2,3,5), 3 = (-1,1,2).
(a)
11. Find the equation of the plane passing through the following three points: (a) (2,1,1), (4,1, -1) and ( L 2 , 21, (b) (-5, -1,2),(2,1, -1) and ( 3 , -1,2).
12. (a) Find a vector parallel t o the line of intersection of 4x1 - 2x2
+ 2x3 = 2
and
6x1
+ 2x2 + 2x3 = 4.
(b) Find a parametric equation for the line of intersection of the above planes.
13. Find the angle between the planes
14. Find the distance between the point
3x1
2 = (1,1,2) and the plane
+ 2 2 - 3x3 = 2.
15. Let P and Q be two points in n-space. Find the general expression for the midpoint of the line segment joining the two points. 16. If T ( t )and ?(t) are two differentiable vectors, then show that
(a) d?(t)
d
dz+(t)
x ?(t)] = ?(t) x -+ -x ?(t), d t [T(t) dt dt
d
+
- [ T ( t )x x ( t ) ]= 2 ( t ) x dt
Z(t).
132
VECTOR ANALYSIS
17. Given the parametric equation of a space curve, namely, = cost,
21
22
= sint,
23 =
2sin2t,
(a) sketch the curve,
(b) find the equation of the tangent line at the point P with t = 71.13, (c) find the equation of a plane orthogonal to the curve at P, (d) show that the curve lies in the surface
2: - 2;
+ 2 3 = 1.
18. For the following surfaces find the tangent planes and the normal lines at the points indicated: (a)
2::
(b)
z:
+ zi + zz = 6 at (1,1,2), + 2+ 2x: = 2 at (1, I, I ) , 5122
z22: -
19. Find the directional derivative of F ( 2 1 , 2 2 , 2 3 )=
22,2 +z,2
-
2 23
in the direction of the line from (1,2,3) to (3,5,1) at the point ( 1 , 2 , 3 ) .
20. For a general point, evaluate d F l d n for F = zyz, where n is the outer normal to the surface
x; + 22;
+ 42; = 4.
21. Determine the points and the directions for which the change in
f = 2xq
+ 2; + 5 3
is greatest if the point is restricted to lie on x: 22. Prove the following:
+ x ; = 2.
PROBLEMS
133
23. Prove the following properties of the divergence and the curl operators: (a)
d.(X+3)=V.X+V.Z,
(b)
$ . ( + x )= $ $ . x + $ $ . x ,
(c)
dx(X++VxX+$xZ,
(d)
dx
(42)
=4
7 x X + V +x
2.
24. Show that the following vector fields have zero curl and find a scalar function @ such that 3 = q@: (a)
(b)
+ 2yzz&, + y2zZz, 3 = ( 3 2 ’ ~+ z2y)Ez + (z3+ z2z)Zy + 2zxyZz
d
= y2zZz
25. Using the vector field + v = x 2 yze,- - 2x3y3Zv show that
+ xy2zZz,
9 .9 x 3 = 0.
26. If 7;’ is the position vector, show the following:
=.
7..=3,
VtX=O,
(3.7)3. 27. Using the following scalar functions, show that (a) (b)
CP
T X?@
= 0:
= exy cos z ,
1
= (z2
+ +z y2
y 2 .
28. An important property of the permutation symbol is given as 3
EijkEilm
= SjlSkrn
-
Sjrnbkl.
i=l
A general proof is difficult, but check the identity for the following specific values:
j=k=1, j=l=l,
k=m=2.
134
VECTOR ANALYSIS
29. Prove the following vector identities:
30. Write the gradient and the Laplacian for the following scalar fields:
+ = ln(x2 + y2 + z 2 ) ,
(a) (b)
=
(c)
@=
1
(x2
+ y2 + z2)1/2 ’
J2qT
31. Evaluate the following line integrals, where the paths are straight lines connecting the end points:
(b)
y dx
+ x dy.
32. Evaluate the line integral
I = L y 2 d x + x 2 dy over the semicircle centered a t the origin and with the unit radius in the upper half-plane.
33. Evaluate
I over the parabola y
=
=
x2.
34. Evaluate
over a circle of radius 2 .
i;;;)+ y dx
x2 dy
PROBLEMS
135
35. Evaluate the line integral
over the curve y = ex - ex5
36. Evaluate J J ,
+ 22.
2 .2do, where
and S is the portion of the plane 2x + 2y octant and 2 is the unit normal to S.
+ z = 6 included in the first
37. Evaluate
over y
=
x2 + 2x
-
2.
38. Evaluate
where C is the square with the vertices (1,l),(-1, l),(-1, -l), (1, -1).
39. Evaluate the line integral
I
=
y2dx
+x2dy
over the full circle x2 + y2 = 1.
40. Evaluate over the indicated paths by using Green’s theorem:
41. Evaluate
(a)
I = f c y 2 d z + x y dy, x 2 + y 2
(b)
I = jC(2z3 - y3) dx
(c)
1 = fc f(z) dx
= 1,
+ (x3+ 2y3) d y ,
+ g(y) d y ,
x2
+ y2 = 1,
any closed path.
136
VECTOR ANALYSIS
where 4
v =
( 2+ y2)Zz + 2xyZy
over y = x3 from (O,O) to ( I , 1).
42. Use Green’s theorem to evaluate
I = jhcvnds, where
2 = ( 2+ $)ZZ and C is the circle x2
+ 2zyZy
+ y2 = 2. +
43. Given the vector field 2 = -3yZZ 2zZy line integral by using Stokes’s theorem:
+ Z2,evaluate the following
where C is the circle x2 + y2 = 1, z = 1.
44. Using Stokes’s theorem, evaluate
+
h [ y 2 d z z2dy
+ x’dz],
where C is the triangle with vertices at (O,O, 0), (0, a,0) and (O,O, a) 45. Usc Stokes’s theorem to evaluate
I = {8xy2z dx
+ 8x2yz dy + (4x2y2
around the path x = cost, y = sint, z
= sint,
-
22) d z
where t E [ 0 , 2 ~ ] .
46. Evaluate the integral id*.?? for the surface of a sphere with radius R and centered at the origin in two different ways. Take 7? as (a)
+ v = zZZ +yey + z Z z ,
PROBLEMS
137
47. Given the temperature distribution 2 T(z1,52,53)= z 1
+ 22122 +
2;23,
(a) determine the direction of heat flow at ( 1 , 2 , l),
(b) find the rate of change of temperature at (1,2,2) in the direction of h
e2
+ Z3.
48. Evaluate f(22
-
y
+ 4) dx + (5y + 32
-
6) dy
around a triangle in the zy-plane with the vertices at (O,O), (3,0), ( 3 , 2 ) traversed in the counterclockwise direction. 49. Use Stokes’s theorem to evaluate
over x3 = 9
-
2 21 -
x; 2 0.
50. Obtain Green’s second identity:
51. Evaluate the following integrals, where S is the surface of the sphere z2 y2 z 2 = a2 :
+ +
f S
[z3 cos
oz,n + y3 c o ey,n ~ + 2 3 cos e,,,]
do
and
For the vector field in the second part plot on the zy-plane and interpret your result.
138
VECTOR ANALYSIS
52. Verify the divergence theorem for +
+
A = ( 2 2 ~ z)Ez
+ g2Ev
-
(X
+ 3y)E2
taken over the region bounded by the planes 2 ~ + 2 y + z = 6 , z=O, y=O, z = O . 53. Prove that
is a conservative field and find the work done between (3, -2,2) and -1).
54. Without using the divergence theorem, show that the gravitational force on a test particle inside a spherical shell of radius R is zero. Discuss your answer using the divergence theorem. 55. Without using the divergence theorem, find the gravitational field outside a uniform spherical mass of radius R. Repeat the same calculation with the gravitational potential and verify your answer obtained in the first part. Interpret your results using the divergence theorem. 56. Without using the divergence theorem, find the gravitational field for an internal point of a uniform spherical mass of radius R. Repeat the same calculation for the gravitational potential and verify your answer obtained in the first part. Discuss your results in terms of the divergence theorem.
57. Assume that gravitation is still represented by Gauss’s law in a universe with four spatial dimensions. What would be Newton’s law in this universe? Would circular orbits be stable? Note: You may ignore this problem. It is an advanced but fun problem that does not require a lot of calculation. However, if you want to attempt it, you may want to read Goldstein, Poole, and Safko on central forces first.
Hint: The surface area of a sphere in four dimensions is 2n2R3.In three dimensions it is 4nR2.
CHAPTER 3
GENERALIZED COORDINATES AND TENSORS
Scalar quantities are defined a t a point by just giving a single number. Hence they have only magnitude. Vector quantities are geometrically defined as directed line segments, which have both magnitude and direction. By assigning a vector to each point in space we obtain a vector field. Similarly, a scalar field is defined. Field concept is one of the most fundamental concepts of theoretical physics. In working with scalars or vectors, it is important that we first choose a suitable coordinate system. A proper choice of coordinates, one that reflects the symmetries of the physical system, simplifies the algebra and the interpretation of the solution significantly. In this chapter, we start with Cartesian coordinates and their transformation properties. We then show how a generalized coordinate system can be constructed from the basic principles and discuss general coordinate transformations. The definition of vectors with respect to their transformation properties brings new depths into their discussion and takes us beyond their geometric interpretation as directed line segments. This allows us t o introduce more sophisticated objects called tensors, where vectors and scalars appear only as special cases. We finally conclude with a detailed discussion of cylindrical and spherical coor-
Essentials of Mathematical Methods in Science and Engineering. By Copyright @ 2008 John Wiley & Sons, Inc.
8. Selquk Bayin 139
140
GENERALIZED COORDINATES AND TENSORS
Figure 3.1
Orthogonal transformations.
dinate systems, which are among the most frequently encountered coordinate systems in applications. 3.1
TRANSFORMATIONS B E T W E E N CARTESIAN COORDINATES
Transformations between Cartesian coordinates that exclude scale changes,
x'
= kx, k = constant,
(3.1)
are called orthogonal transformations. They preserve distances and magnitudes of vectors. There are basically three classes of orthogonal transformations. The first class involves translations, the second class is rotations, and the third class consists of reflections (Fig. 3.1). Translations and rotations can be generated continuously from an initial frame; hence they are called proper transformations. Since reflection cannot be accomplished continuously, they are called improper transformations. A general transformation is usually a combination of all the three types. 3.1.1
Basis Vectors and Direction Cosines
We now consider orthogonal transformations with a common origin (Fig. 3.2). To find the transformation equations, we write the position vector in two frames in terms of their respective unit basis vectors as
and
TRANSFORMATIONS BETWEEN CARTESIAN COORDINATES
Figure 3.2
141
Orthogonal transformations with one point fixed.
Note that the point P that the position vector, 7 ,represents exists independent of the definition of our coordinate system. Hence in Equation (3.3) we have written 7instead of 7’. However, when we need to emphasize the coordinate system used explicitly, we also write 7’. In other words, Equations ( 3 . 2 ) and (3.3) are just two different representations of the same vector. Obviously, there are infinitely many choices for the orientation of the Cartesian axes that one can use. To find a mathematical dictionary between them, that is, the transformation equations, we write the components of ?;’ in terms of -i e, as
which, after using Equation ( 3 . 2 ) , gives
These are the transformation equations that allow us to obtain the coordinates in terms of the primed system given the coordinates in the unprimed system. These equations can be conveniently written as
c(q Zy) 3
2::=
.
j=1
zj,
i = 1,2,3.
(3.10)
142
GENERALIZED COORDINATES AND TENSORS
Figure 3.3
Direction cosines for rotations about the zs-axis.
The coefficients (< . Zj) are called the direction cosines and can be written as u 23- -- ( ~ ’ , Z j ) = c o s Q z ji,= l , 2 , 3 ,
(3.11)
where $ i j is the angle between the i t h basis vector of the primed system and the j t h basis vector of the unprimed system. For rotations about the z3-axis (Fig. 3.3), we can write a i j , i = 1,2,3, as the array 5’3 = aij,
=(
i = 1,2,3,
(3.12)
(Z1 . Zl) (Z1 .22)
(3. Z 1 ) 0
0
(& . Z 2 ) 0
(3.13)
0 (3.14)
0 cosQ
sin0
0 (3.15)
3.1.2 Transformation Matrix and the Orthogonality Relation General linear transformations between Cartesian coordinates can be written as (3.16)
TRANSFORMATIONS BETWEEN CARTESIAN COORDINATES
143
where the square array
s = uij, i = 1 , 2 , 3 ,
( it; ;;; ) a12
-
(3.17)
a13
@;
(3.18)
is called the transformation matrix. Let us now write the magnitude of ?;‘ in the primed system as (3.19) i=l
Using the transformation equations, we can write as
17-1
2
in the unprimed system
3 UijtXjl i=l 3
3
3
1
(3.20)
i=l j = 1 j’=l
Rearranging the triple sum, we write (3.22) Since the orthogonal transformations preserve magnitudes of vectors, the transformation matrix has t o satisfy 3
= tijj,, j , j ‘ = 1,2,3,
CUijUij‘ i= 1
(3.23)
which is called the orthogonality condition. Equation (3.22) now gives
Cz’..’. + x? + x’3” 3
7. 7=
3
3
=
(3.24)
j=1
cc 3
=
3
Sjj’XjXj!
= c x j x j = 2 21 j=1
+ x 2 + 2 32 .
(3.25)
(3.26)
144
GENERALIZED COORDINATES AND TENSORS
3.1.3
Inverse Transformation Matrix
For the inverse transformation we need to express xi in terms of x:. This can only be done when the determinant of the transformation matrix does not vanish:
(3.27) Writing the orthogonality relation explicitly as
( :t
a13
zzi z:i ) ( %:f a23
a33
a12
a13
a22
a23
a32
a33
) ( =
1 0 0 0 1 0 0 0 1
)
,
(3.28)
we can evaluate the determinant of S. The determinant of the left-hand side is the multiplication of the determinants of the individual matrices. Using the fact that interchanging rows and columns of a matrix does not change the value of its determinant, we can write (det S)2= I,
(3.29)
= fl.
(3.30)
which yields det S
The negative sign corresponds to improper transformations, hence the determinant of the transformation matrix provides a convenient tool t o test whether a given transformation involves reflections or not. For a formal inversion we multiply the transformation equation, 3
x:=
C u . . x . i = 1,2,3, a3
3,
(3.31)
j=1
with aiJf and sum over i to write
(3.32)
(3.33) Substituting the orthogonality relation for the sum inside the square brackets we get 3
i=l
3 j=1
= xjt, j ' = 1,2,3,
(3.35)
CARTESIAN TENSORS
145
which, when written explicitly, gives 21
= a112; f
a21.k
22
= a122; f
0422;
23
= a135:
+ a232;
+ + +
a315;,
(3.36)
a32xk,
(3.37) (3.38)
a334
We now write the inverse transformation matrix as
[ ::: 2: 2: 1 all
s-1 =
a21
a31
(3.39) '
Comparing with S in Equation (3.18), it is seen that
-
s-l = s,
(3.40)
s
where is called the transpose of S, which is obtained by interchanging the rows and the columns in S. In summary, the inverse transformation matrix for orthogonal transformations is just the transpose of the transformation matrix. For rotations about the q - a x i s [Eq. (3.15)],the inverse transformation matrix is written as cosd
-sin8
0 (3.41)
Note that S ,' corresponds t o a rotation in the opposite direction by the same amount, that is, S,-'(O) = S3(-O).
3.2
(3.42)
CARTESIAN T E N S O R S
So far we have discussed the transformation properties of the position vector + r . We now extend this to an arbitrary vector, 3, as -1
21
ST,
(3.43)
where S = u Z g ,i , j = 1 , 2 , 3 , is the orthogonal transformation matrix [Eq. (3.18)]. In other words, a given triplet of functions,
caririot he used to define a vector;
146
GENERALIZED COORDINATES AND TENSORS
unless they transform as
(3.46) Under the orthogonal transformations a scalar function, @(xi,x2,x3), transforms as
In the new coordinate systerrl, @ will naturally have a different functional dependence. However, the values that Q, assumes at each point of space remain the same. It is for this reason that in Equation (3.48) we have written @ instead of @ I . In order to indicate the coordinate system used, we may also write @ I . Since temperature is a scalar quantity, its value at a given point does not depend on the coordinate system used. A different choice of coordinate system assigns different coordinates (codes) to each point:
however, the numerical values of the temperature at each point remain the same. We now write the scalar product of two vectors, 2 and 3, in the primed coordinates by using the scalar product written in the unprimed coordinates, that is,
(3.50) = ZlYl
+ 52y2 + 23y3.
(3.51)
Using the orthogonal transformations,
(3.52) wc write 2
‘
3 as (3.53)
(3.54)
CARTESIAN TENSORS
Using the orthogonality relation [Eq. (3.23)]: s S
=
147
S s = I , this becomes (3.55)
(3.56) (3.57) (3.58) In other words, the orthogonal transformations do not change the value of a scalar product. Properties of physical systems that preserve their value under coordinate transformations are called invariants. Identification of invariants in the study of nature is very important and plays a central role in both special and general theories of relativity. In the previous chapter we have defined vectors with respect to their geometric and algebraic properties. Definition of vectors with respect to their transformation properties under orthogonal transformations brings new levels into the subject and allows us to free the vector concept from being just a directed line segment drawn in space. Using the transformation properties, we can now define more complex objects called tensors. Tensors of second rank, Tij , are among the most commonly encountered tensors in applications and have two indices. Vectors, vi, have only one index and they are tensors of first rank. Scalars, @, which have no indices, are tensors of zeroth rank. In general, tensors of higher ranks are written with the appropriate number of indices as T=Tijkl...,
i , j , k,... =1,2,3.
(3.59)
Each index of a tensor transforms like a vector:
(3.60) (3.61)
(3.62)
(3.63) etc.
148
GENERALIZED COORDINATESAND TENSORS
Tensors of second rank can be conveniently represented as 3 x 3 square matrices: (3.64) Definition of tensors can be easily extended to n dimensions by taking the range of the indices from 1 to n. As we shall see shortly, tensors can also be defined in general coordinates. For the time being, we confine our discussion to Cartesian tensors, which are defined with respect to their transformation properties under orthogonal transformations. 3.2.1
Algebraic Properties of Tensors
Tensors of equal rank can be added or subtracted term by term and the result does not depend on the order of the tensors: For example, if A and B are two second-rank tensors, then their sum is
A +B = B +A Cij
= Aij
= C,
+ Bij, i , j = 1 , 2 , 3 .
(3.65) (3.66)
Multiplication of a tensor with a scalar, a , is accomplished by multiplying all the component of that tensor with the same scalar. For a third-rank tensor, A, we can write
CYA = aAijk, i , j , k = 1 , 2 , 3 .
(3.67)
From the basic properties of matrices, second-rank tensors do not commute under multiplication. That is,
AB # BA,
(3.68)
A ( B C )= (AB)C,
(3.69)
however, they associate:
where A, B , C are second-rank tensors. Antisymmetric tensors satisfy
Aij = -Aji, i,j = 1 , 2 , 3 ,
(3.70)
or
-
A = -A,
(3.71)
where is called the transpose of A , which is obtained by interchanging the rows and columns. Note that the diagonal terms, All, A22, A33, of an
149
CARTESIAN TENSORS
antisymmetric tensor are necessarily zero. If we set i = j in Equation (3.70) we obtain (3.72) (3.73) (3.74) Symmetry and antisymmetry are invariant properties. If a second-rank tensor, A , is symmetric in one coordinate system,
Aij = Aji, i , j
=
(3.75)
1,2,3,
then A' is also symmetric. We first write 3
3
(3.76) Since the components, a i j , are constants or in general scalar functions, the order in which they are written in equations do not matter. Hence we can write Equation (3.76) as 3
3
A:j =
i , j = 1,2,3.
(3.77)
i'=l j ' = l
Using the transformation property of second-rank tensors [Eq. (3.62)], for a symmetric second-rank tensor, Aij , this implies i,j=1,2,3.
(3.78)
A similar proof can be given for the antisymmetric tensor. Any second-rank tensor can be written as the sum of a symmetric and an antisymmetric tensor:
+ Using the components of two vectors, d and b , we can construct a secondrank tensor A as
A=
(
albl
alb2
alb3
a2b1
ad2
a2b3
a361
a3b2
a3b3
1
,
(3.80)
which is called the outer product or the tensor product of d and and it is shown as A = Z T
3,
(3.81)
150
GENERALIZED COORDINATES AND TENSORS
or as
A = Z t T .
(3.82)
To justify that A is a second-rank tensor, we show that it obeys the correct transformation property; that is, it transforms like a second-rank tensor: A 2.7! . = afb'. z 3
(3.83) (3.84)
(3.85)
i'=l j'=]
One can easily check that the outer product defined as T@Z is the transpose of A. We remind the reader that even though we can construct a secondrank tensor from two vectors, the converse is not true. A second-rank tensor cannot always be written as the outer product of two vectors. Using the outer product, we can construct tensors of higher rank from tensors of lower rank:
(3.87) (3.88) (3.89)
where the indices take the values 1,2,3. For a given vector, there is only one invariant, namely, its magnitude. All the other invariants are functions of the magnitude. For a second-rank tensor there are three invariants, one of which is the spur or the trace, which is defined as the sum of the diagonal elements:
We leave the proof as an exercise but note that when A can be decomposed as the outer product of two vectors, the trace is the inner product of these vectors. We can obtain a lower-rank tensor by summing over pairs of indices. This operation is called contraction. Trace is obtained by contracting the two indices of a second-rank tensor as 3
trA
=
XAii. i=l
(3.91)
151
CARTESIAN TENSORS
Other examples of contraction are 3
(3.92) i= 1
(3.93) etc. We can generalize the idea of inner product by contracting the indices of a tensor with the indices of an other tensor: 3
bi =
C
i
1,2,3,
(3.94)
Tz-j k.Aj.k , i = 1 , 2 , 3 ,
(3.95)
Tijaj,
=
j=1
xx 3
ai =
3
j=1 k = l 2
2
(3.96) 3
a
3
=
(3.97)
~ i j ~ i j ,
2=1 J = l etc. The rank of the resulting tensor is equal to the number of the free indices, that is, the indices that are riot summed over. Free indices take the values 1, 2 , or 3. In this regard, we also write a tensor, say Tz3,i , j = I, 2,3, as simply T L JThe . indices that are summed over are called the dummy indices. Since dummy indices disappear in the final expression, we can always rename them.
3.2.2
Kronecker Delta and the Permutation Symbol
To check the tensor property of the Kronecker delta, we use the transformation equation for the second-rank tensors, 3
3
(3.98) with ZlJ/= 62fjfand use the orthogonality relation [Eq. (3.2311 to write 3
3
3
= saj.
3
(3.100)
152
GENERALIZED COORDINATES AND TENSORS
In ot,her words, the Kronecker delta is a symmetric second-rank tensor that transforms into itself under orthogonal transformations. It is also called the identity tensor, which is shown as I. Kronecker delta is the only tensor with this property. Permutation symbol, also called the Levi-Civita symbol, is defined as
EIJk
=
i
0 1 -1
when any two indices are equal. for even (cyclic) permutations: 123, 231, 312. for odd (anticyclic) permutations: 213, 321, 132.
(3.101)
Using the permutation symbol we can write a determinant as
(3.102)
(3.103)
(3.104) Interchange any two of the indices of the permutation symbol in [Eq. (3.103)], tlic determinant changes sign. This operation is equivalent to interchanging the corresponding rows and columns of a determinant. We now write the determinant of the transformation matrix, a i ~ j /as ,
Reiianiing the dummy indices: i -j,
j
+i,
(3.106) (3.107)
Equation (3.105) becomes det a2/3f= -
a2zaIja3kEtjk.
(3.108)
$3k
From Equation (3.30) we know that the determinant of the orthogonal transformation matrix is det az,jl = ~ 1hence , the component ~ 2 1 3transforms as (F1)&213 =
a2zalja3kEzjk. 2.7
k
(3.109)
CARTESIAN TENSORS
153
Similar arguments for the other components yields the transformation equation of &lmn as
(3.110) The niinus sign is for the improper transformations. In summary, & i j k transforms like a third-rank tensor for proper transformations, and a minus sign has to be inserted for improper transformations. Tensors that transform like this are called tensor densities or pseudotensors. Note that aside from the ~1 factor, E i j k has the same constant components in all Cartesian coordinate systems. Permutation symbol is the only third-rank tensor with this property. An important identity of & i j k is 3
Permutation symbol also satisfies
for the cyclic permutations of the indices. For the anticyclic permutations we write
Example 3.1. Physical tensors: Solid objects deform under stress to a certain extent. In general, forces acting on a solid can be described by a second-rank tensor called the stress tensor:
Components of the stress tensor represent the forces acting on a unit test area when the normal is pointed in various directions. For example, t i j is the ith component of the force when the normal is pointing in the j t h direction. Since the stress tensor is a second-rank tensor, it transforms as 3
3
k = l 1=1
The amount of deformation is also described by a second rank tensor, u i j , called the strain tensor. The stress and the strain tensors are related by the equation 3 tij
3
=
Cijklgkl, k = l 1=1
(3.116)
154
GENERALIZED COORDINATES AND TENSORS
where the fourth-rank tensor C i j k l represents the elastic constants of the solid. This is the most general expression that relates the deformation of a three-dimensional solid to the forces acting on it. For a long and thin solid sample, with cross section AA and with longitudinal loading F , Equation (3.116) reduces to Hook’s law: (3.117)
t
= Ycr,
where t is the force per unit area, Al/l, and Y is Young’s modulus.
(3.118)
is the fractional change in length,
Many of the scalar quantities in physics can be generalized as tensors of higher rank. In Newton’s theory, mass of an object is defined as the proportionality constant, m, between the force acting on the object and the acceleration as
Fi
= mai.
(3.119)
Mass is basically the ability of an object to resist acceleration, that is, its inertia. It is an experimental fact that mass does not depend on the direction in which we want to accelerate an object. Hence it is defined as a scalar quantity. In some effective field theories, it may be advantageous to treat particles with a mass that depends on direction. In such cases we can introduce effective mass as a second-rank tensor, mij, and write Newton’s second law as 3
Fi
=
1
mij aj
,
(3.120)
j=1
When the mass is isotropic,
mij
becomes
ma3. . - m&. a3 i
(3.121)
thus Newton’s second law reduces to its usual form.
3.3 3.3.1
GENERALIZED COORDINATES Coordinate Curves and Surfaces
Before we introduce the generalized coordinates, which are also called the curvilinear coordinates, let us investigate some of the basic properties of the Cartesian coordinate system from a different perspective. In a Cartesian coordinate system at each point there are three planes defined by the equations
x 1 = c1, x 2
= c2,
x3 = c3.
(3.122)
GENERALIZED COORDINATES
Figure 3.4
155
Coordinate surfaces and coordinate curves in Cartesian coordinates.
These planes intersect at the point ( e l ,c2, c 3 ) , which defines the coordinates of that point. In this section we start by writing the coordinates with an upper index as xi. There is no need for alarm: As far as the Cartesian coordinates are concerned there is no difference, that is, zz = xi. However, as we shall see shortly, this added richness in our notation is absolutely essential when we introduce the generalized coordinates. Treating c1, c2, c3 as parameters, the above equations define three mutually orthogonal families of surfaces, each of which is composed of infinitely many nonintersecting parallel planes. These surfaces are called the coordinate surfaces on which the corresponding coordinate has a fixed value (Fig. 3.4). The coordinate surfaces intersect along the coordinate curves. For the Cartesian coordinate system these curves are mutually orthogonal straight lines called the coordinate axes (Fig. 3.4). Cartesian basis vectors, E l , E 2 , E 3 , are defined as the unit vectors along the coordinate axes. A unique property of the Cartesian coordinate system is that the basis vectors point in the same direction at every point in space (Fig. 3.5). We now introduce the generalized coordinates, where the coordinate surfaces are defined in terms of the Cartesian coordinates ( x 1 , x 2 , x 3as ) three single-valued continuous functions with continuous partial derivatives: (3.123) (3.124)
(3.125) Treating ,&, Z3 as continuous variables, these give us three families of surfaces, where each family is composed of infinitely many nonintersecting surfaces (Fig. 3.6). Using the fixed values that these functions, Zi(xl, x2,z3),
156
GENERALIZED COORDINATES AND TENSORS
Figure 3.5 direction.
i
=
Basis vectors in Cartesian coordinates always point in the same
1,2,3, take on these surfaces, we define the generalized coordinates
(z' ,z2,z3)as (3.126) (3.127) (3.128)
Note that these equations are also the transformation equations between the Cartesian coordinates (zl,x2,z3)and the generalized coordinates (Z', Z 2 , T 3 ) . For the new coordinates to be meaningful, the inverse transformations, xz = Xi@):
(3.129) (3.130) (3.131)
should exist. In Chapter 1, we have seen that the necessary and the sufficient condition for the inverse transformation to exist, Jacobian of the transformation has t o be different from zero. In other words, for a one-to-one
GENERALIZEDCOORDINATES
Figure 3.6
157
Coordinate surfaces in generalized coordinates for T1
correspondence between (z', x2,x3) and (Z' ,z2, Z3)we need to have
J=
d ( d ,22,z3)
(3.132)
a(z',' 2 , 2 3 )
(3.133)
or since J K = 1.
(3.134)
For the coordinate surfaces given as Z1 =Zl(z',z2 , 23 )
x3) = c2,
2 2 = :2(z1,22, -3--3
x
-z
1
=c1,
2
3
(z ,z, 5 ) = z 3 ,
(3.135) (3.136) (3.137)
t,he intersection of the first two, Z1(x1,x2,x3) = and Z2(x1,x2,x3) = defines the coordinate curve along which Z3 varies (Fig. 3.7). We refer to this as the Z 3 curve, which can be parameterized in terms of z3as (2'(T3), x2(Z3), z3(Z3)) . Similarly, two other curves exist for the Z1and the x2 coordinates. These curves are now the counterparts of the coordinate axes in Cartesian coordinates. -
c2,
158
GENERALIZED COORDINATES AND TENSORS
Figure 3.7
Generalized coordinates
Wc now define the coordinate basis vectors, TI,?^, 2 3 , in terms of the Cartesian unit basis vectors (?I,&, &.) as the tangent vectors: (3.138)
8x1,
ax2,.
8x3,
z2 + 7ze 2 + -e3, z2 8x3, 8x1, ax2, e 3 = -el + -e2 + -e3. z3 E3 z3
j
e
2 = -el
j
(3.139) (3.140)
Note that TZare in general neither orthogonal nor unit vectors. In fact, their magnitudes,
(3.141)
as well as their directions depend on their position. We define unit basis vectors in the direction of as
(3.142)
3
Coordinate basis vectors, e i , point in the direction of the change in the position vector, when we move an infinitesimal amount along the 52 curve. In other words, it is the tangent vector to the ZZ curve at a given point. We can now interpret the condition, J # 0, for a legitimate definition of generalized
GENERALIZED COORDINATES
Figure 3.8
159
Covariant and contravariant components.
coordinates. We first write the Jacobian, J , as
8x1
ax2
ax3
1
J = det
Remembering that the triple product $1 . ($2 x ? 3 ) is the volume of the parallelepiped with the sides $1,$2, and $ 3 , the condition J # 0 for a legitimate definition of generalized coordinates means that the basis vectors have to be noncoplanar.
3.3.2 Why Upper and Lower Indices Consider a particular generalized coordinate system with oblique axis on the plane (Fig. 3.8). We now face a situation that we did not have with the Cartesian coordinates. We can define coordinates of a vector in two different ways, one of which is by drawing parallels t o the coordinate axes and the other is by dropping perpendiculars to the axes (Fig. 3.8). In general, these two methods give different values for the coordinates. Coordinates found by drawing parallels are called the contravariant components, and we write them with an upper index as ui.Now the vector 3 is expressed as + a = al a2 s2, (3.144)
s1 +
where g1 and 2 2 are the unit basis vectors. Coordinates found by dropping perpendiculars to the coordinate axes are called the covariant components. They are written with a lower index as ail and their values are obtained as Ul
=
i2 .&,
a2
=2
A
.&.
(3.145)
160 3.4
GENERALIZED COORDINATES AND TENSORS
GENERAL TENSORS
Geometric interpretation of the covariant and the contravariant components demonstrates that the difference between the two types of coordinates is, in general, real. As in the case of Cartesian tensors, we can further enrich the concept of scalars and vectors by defining them with respect to their transformation properties under general coordinate transformations. We write the transformation equations between the Cartesian coordinates, xi = (xl, x2,x3), and the generalized coordinates, T i = (T1,T2,T3), as
Similarly, we write the inverse transformations as xi =
xy7J+).
(3.147)
Note that each one of the above equations [Eqs. (3.146) and (3.147)] correspond to three equations for i = 1,2,3. Even though we write our equations in three dimensions, they can be generalized to n dimensions by simply extending the range of the indices to n. Using Equation (3.146), we can write the transformation equation of the coordinate differentials as (3.148) For a scalar function, @(xz), we can write the transformation equation of its gradient as (3.149) We now generalize these to all vectors and define a contravariant vector as a vector that transforms like d z j as (3.150) and define a covariant vector as a vector that transforms like the gradient of a scalar function: (3.151) Analogous to Cartesian tensors, a second-rank covariant tensor, Tij, is defined as (3.152)
GENERAL TENSORS
161
Tensors with contravariant and mixed indices are also defined with respect to their transformation properties as (3.153)
(3.154) Note that the transformation equations between the coordinate differentials [Eq. (3.148)] are linear, that is, El
dZ1 = - dx'
8x1
z2
z1dx2 + El +dx3, 8x2 8x3
(3.155)
E2 2 E2 3 +-dx +-dx, (3.156) 8x2 8x3 E3 E3 E3 dZ3 = - dx' - dx2 + - dx3, (3.157) 8x1 8x2 8x3 hence the elements of the transformation matrix, A , in V = Av [Eq. (3.151)] are given as 1
dZ2=-dx
8x1
+
m
A=A2=-=
(3.158)
8x3
- - -
8x1 8x2 8x3 If we apply this to orthogonal transformations between Cartesian coordinates defined in Equation (3.10), we obtain the components of the transformation matrix as
Ai. 3 = A a3 . . - S.. 22 - c osQ 23.
1
(3.159)
where d i j are the direction cosines and we have used the fact that for Cartesian coordinates covariant and the contravariant components are equal. Using the inverse transformation (3.160) in Equation (3.148), we write
3
(3.161) k=l
162
GENERALIZED COORDINATESAND TENSORS
to obtain the relation
(3.162)
In general, we write the transformation matrix, A, and the inverse transformation matrix, '21, as
(3.163)
respectively, which satisfy the relation
3
(3.164) j=1
One should keep in mind that even though for ease in comparison we have identified the variables xi as the Cartesian coordinates and we will continue to do so, the transformation equations represented by the transformation matrix in Equation (3.158) could represent any transformation from one generalized coordinate system into another. We can also write the last equation [Eq. (3.164)] as
(3.165)
thus showing that '21 is the inverse of A = A;.. If we apply Equation (3.163) to the orthogonal transformations between Cartesian coordinates [Eq. (3.31)] and their inverse [Eq. (3.35)],we see that
-
-
A = A.
(3.166)
GENERAL TENSORS
163
We can now summarize the general transformation equations as 3 j=1 3
(3.168)
51 = - p ( v , ,
T,
-2
3.4.1
=
cc 3
3
A$T$
(3.171)
Einstein Summation Convention
From the above equations, we observe that whenever an index is repeated with one up and the other one down, it is summed over. We still have not shown how to raise or lower indices but from now on whenever there is a summation over two indices, we agree to write it with one up and the other down and omit the summation sign. It does not matter which index is written up or down. This is called the Einstein summation convention. Now the above transformation equations and their inverses can be written as
(3.172)
A general tensor with mixed indices is defined with respect t o the transformation rule (3.173) To prove the tensor property of the Kronecker delta under general coordinate transformations, we use Equation (3.164) to write (3.174) = &A:.‘
(3.175)
= 6,; ..
(3.176)
164
GENERALIZED COORDINATES AND TENSORS
Hence 6; is a second-rank tensor and has the same components in generalized coordinates. It is the only second-rank tensor with this property. Algebraic propcrties described for the Cartesian tensors are also valid for general tensors. 3.4.2
Line Element
We now write the line element in generalized coordinates, which gives the distance between two infinitesimally close points. We start with the line element in Cartesian coordinates, which is nothing but Pythagoras’ theorem, which can be written in the following equivalent forms:
d.5’ = d 7 .d 7 = (dx’)2+ (dx’))”+ (dx3)’
(3.177)
3
=Cdxkdxk
(3.178) (3.179)
Using the inverse transformation (3.180) and the fact that ds is a scalar, we write the line element in generalized coordinates as 3
3
(ts’ =
ds2 = C d x k d z k=
axk C axk dEa--EJ dZJ
(3.181)
k=l
k=l
(3.182)
3.4.3
Metric Tensor
We now introduce a very important tensor, that is, the metric tensor, which is defined as
gij,
3
(3.183) k=l
Note that the sum over k is written with both indices up. Hence, even though we still adhere to the Einstein summation convention, for these indices we keep the sumniation sign. The metric tensor is the singly most important second-rank tensor in tensor calculus and general theory of relativity. Now the line element in generalized coordinates becomes
GENERAL TENSORS
165
Needless to say, components of the metric tensor in Equation (3.184) are all expressed in terms of the barred coordinates. Note that in Cartesian coordinates the metric tensor is the identity tensor, gzj = szj;
(3.185)
thus the line element in Cartesian coordinates becomes ds2 = 6ijdxadxj =
(dx’)’
(3.186)
+ (dx’)’ + ( d x 2 ) ’ .
(3.187)
3.4.4 How to Raise and Lower Indices Given an arbitrary contravariant vector
vj, let
us find how
[gijvj]
(3.188)
transforms. Using Equation (3.172), we first write (3.189) (3.190) and then substitute them into Equation (3.188) to get ., [ g i j d ] = A: A: A: [ijztjtVk] .I-’
= A:’ =
A:’
= A:’
(3.191)
[Aj’;iJ,] [gz,j,5k]
(3.192)
[s:]
(3.193)
[gi,j,~k]
[gzrk~jlc] .
(3.194)
Renaming the dummy variable Ic on the right-hand side as k+.i,
(3.195)
we finally obtain
[gijvj] = A:’ [?ji,jEj] .
(3.196)
Comparing with the corresponding equation in Equation (3.172), it is seen that gLjvJ transforms like a covariant vector. We now define the covariant component of vj as
vi = gajv3.
(3.197)
We can also define the metric tensor with the contravariant components as (3.198)
166
GENERALIZED COORDINATES AND TENSORS
where
(3.199) Note that in the above equations, in addition to the summation signs that come from the definition of the metric tensor. the Einstein summation convention is still in effect. Using the symmetry of the metric tensor, we can also write Slkgkl'
-
g11' = 6, 1' .
(3.200)
We now have a tool that can be used to raise and lower indices at will: T2,
= gz,,Ti1,
(3.201)
A'" 23
= gkk'Az3k',
(3.202)
c,, 3
-
g33 k z l g k k ) C ; : k t ,
(3.203)
etc. Metric tensor in Cartesian coordinates is 6", Using Equations (3.158) and (3.172), we can show that under the general coordinate transformations it transforms into the metric tensor:
(3.204) 3
=
C Ai A j -2
.
,
-2
.
I
(3.205)
(3.206) (3.207)
3.4.5 Metric Tensor and the Basis Vectors If we remember the definition of the basis vectors [Eqs. (3.138)-(3.140)],
GENERAL TENSORS
dXk 2 .- *z'
167
i = 1,2,3,
(3.208)
ax2ax3, + -e2 + rn zz
(3.209)
1 -
8x1,
= -el
which are tangents to the coordinate curves (Fig. 3.7),we can write the metric tensor as the scalar product of the basis vectors:
(3.210) (3.211) Note that the basis vectors 3 i are given in terms of the unit basis vectors of the Cartesian coordinate system Zi.Similarly, using the definition of the metric tensor with the contravariant components,
(3.212)
we can define the new basis vectors
$2
as
(3.2 13) which allows us to write the contravariant metric tensor as the scalar product
The new basis vectors, 22,are called the inverse basis vectors. Note that neither of the basis vectors, 2i or are unit vectors and the indices do not refer to their components. Inverse basis vectors are actually the gradients:
Ti,
Hence they are perpendicular t o the coordinate surfaces, while Ti are tangents to coordinate curves. Usage of the upper or the lower indices for the basis vectors is justified by the fact that these indices can be lowered or raised
168
GENERALIZED COORDINATES AND TENSORS
by the metric tensor as
(3.216) (3.2 17) 3
(3.2 18) k=l
(3.219) (3.220) Similar1y,
(3.221) (3.222)
(3.223) (3.224) (3.225) 3.4.6
Displacement Vector
In generalized coordinates the displacement vector between two infinitesimally close points is written as
(3.226) -
Ti&i
(3.22 7 )
+a
= &lTfl+c L z 2 z ) z
3 2 3
(3.228)
Using the displacement vector [Eq. (3.228)], we can write the line element as
(3.229) (3.230) (3.231)
GENERAL TENSORS
If we move along only on one of the coordinate curves, say covered is
?El,
169
the distance
Similarly, for the displacements along the other axes we obtain
For a general displacement we have to use the line element [Eq. (3.231)]. For orthogonal generalized coordinates, where
(Ti. Tj) = 0, 2 # j ,
(3.235)
the metric tensor has only the diagonal components and the line element reduces to
+ ds$ + ds$ (3.236) = 911 + g22 (a”)’ + 933 ( & 3 ) 2 (3.237) + ( 2 2 . 2 2 ) (&’))’+ (T3.2 3 ) (fi’))”.(3.238) = (21 . 21)
ds2 = ds$
3.4.7
Transformation of Scalar Functions and Line Integrals
As in orthogonal transformations, value of a scalar function is invariant under generalized coordinate transformations, hence we write Q ( x ~ , x ) ’ , x =~ )~ ( E ’ , E ~ , E or~ ) = @(21,2)’,23).
(3.239) (3.240)
+ The scalar product of two vectors, 3 and b , is also a scalar, thus preserving its value. In generalized coordinates we write it as
(3.241) (3.242) Using the transformation equations,
(3.243) (3.244)
170
GENERALIZED COORDINATES AND TENSORS
it is clear that it has the same value that it has in Cartesian coordinates: 3
.-
a . h =?Phi
(3.245) (3.246) (3.247) (3.248) (3.249)
In the light of these, a given line integral in Cartesian coordinates,
can be written in generalized coordinates as
(3.251) (3.252)
We can also write I as
In orthogonal generalized coordinates, only the diagonal components of the metric tensor are nonzero. hence I becomes
I
=
s
gI1v1&1
+ g22v2&2 + g 3 p 3 d z 3 .
7
(3.254)
It is important to keep in mind that a vector exists independent of the coordinate system used to represent it. In other words, whether we write in Cartesian coordinates as
d = v121+ v222 + v323 = v22,
7
(3.255)
or in generalized coordinates as
d
it is the same vector. Hence the bar on is sometimes omitted. We remind the reader that ??i are not unit vectors in general. Covariant components of
GENERAL TENSORS
J
171
are found as
(3.258) (3.259) (3.260) (3.261) J
Similarly, using the inverse basis vectors, e components as
z
, we
can find the contravariant
(3.262) (3.263) (3.264) (3.265) The two types of components are related by
V J= p V i .
(3.266)
We can now write the line integral [Eq. (3.250)] in the following equivalent ways:
I = = =
J' ? . J'
1.
(&'??1+
&'?)z
+ a3T3)
+ ( v . $ ~& 2 )+ (7.23) a 3
a 1
&'+V2
a2+V3
a3
(3.267) (3.268) (3.269) (3.270)
3.4.8 Area Element in Generalized Coordinates Using t h 2 expression for the area of a parallelogram defined by two vectors, * a and b , as area = 1 3x
71,
(3.271)
we write the area element in generalized coordinates defined by the infinitesimal vectors & E l 2 1 and &E2?2 (Fig. 3.9) as fiZlf2 =
x
Tz/&1a2,
(3.272)
172
GENERALIZED COORDINATES AND TENSORS
Figure 3.9
Area element in generalized coordinates.
Similarly, the other areas are defined:
A
In orthogonal generalized coordinates, where the unit basis vectors, i2i = Ti/ lT.;l,i = 1,2,3, satisfy (3.275) (3.276) (3.277) we can write
where the area element is oriented in the & direction. Similarly, we can write the area elements dZZ3?1 = =
and
I&
&fi3
s 2
(3.280)
g2,
(3.281)
173
GENERAL TENSORS
u and v coordinates defined on a surface.
Figure 3.10
3.4.9
Area of a Surface
A surface in three dimensional Cartesian space can be defined either as
x3 = f(X1,XZ) or in terms of two coordinates (parameters), u and v, defined on the surface as (Fig. 3.10)
x 1 = x y u ,v), x2 = x2(u,v), x3 = x3(u,v).
(3.284) (3.285) (3.286)
The u and v coordinates are essentially the contravariant components of the coordinates that a two-dimensional observer living on this surface would use, that is,
x x
-1
= u,
(3.287)
-2
= v.
(3.288)
We can write the infinitesimal Cartesian coordinate differentials, dx', dx2,dx3, corresponding to infinitesimal displacements on the surface, in terms of the surface coordinate differentials, d u and dv, as
dx'
dX = - du
dU
dX2
dX +dv, dV
dX2
dx2 = - du + - dv, dU dV ax3 8x3 dx3 = - du + - dv. dU dV
(3.289) (3.290) (3.291)
174
GENERALIZED COORDINATES AND TENSORS
We now write the distance d s between two infinitesimally close points on the surface entirely in terms of the surface coordinates u and v as
+ (dx2)’ + (dx’)’ 2 + +
d s 2 = (dx’)’ =
[(g)(g)2($3’1
+
(3.292)
du2
I‘):(
[(g)2 + (g)’+
dv2.
(3.293)
Comparing this with the line element for an observer living on the surface:
(3.294)
d s 2 = gij d u d v , i = 1 , 2 , = gZlu d u 2
+ 2g,,
dudv
+ guv d v 2 ,
(3.295)
we obtain the components of the metric tensor as 2
g u u = ( g ) guv =
+(g)2+(g), 2
(3.296)
ax1 ax1 + -ax2 ax2 8x3 8x3 -+ -d u dv
du dv ’
d u dv
(3.297)
2
guu=(g)2+(g)2+(!$)
(3.298)
Since the metric tensor can also be written in terms the surface basis vectors, 4 e z L and Tu, as
d s 2 = (2% . 3% dU2 )
+ 2 ( 2% . 7?u)d u d v + ( Zv. T u d)v 2 ,
(3.299)
we can read T Uand 7?ufrom Equations (3.296)-(3.298) as
-
ax1,
e
= -el
e
= -el
aU
ax1, dv
ax2, ax3+ -e2 + -e3, dU du dx2ax3 + 8v + -Z3. 8U -e2
(3.300)
(3.301)
Note that the surface basis vectors are given in terms of the Cart,esian unit basis vectors ( Z l , Z2,Z3). We can now write the area element of the surface in terms of the surface coordinates as
d 3 u u = T Ud u x
ZVd v ,
(3.302)
GENERAL TENSORS
175
which, after substituting Equations (3.300) and (3.301), leads to
db,,
=
f
[(--du dv
-
du dv
-d u dv
(3.303)
d u dv
which can also be written as
The signs f correspond to proper and improper transformations, respectively. Using Equation (3.303), we can write the magnitude of the area element as
/dZuvl = JEG where
-
F2 dudv,
E=(E)2+(Z)2+(E)
(3.305)
2
, (3.306)
(3.308) Integrating over the surface, we get the surface area (3.309)
(3.310)
which is nothing but the Equation (2.205) we have written for the area of a surface in the previous chapter. If the surface S is defined in Cartesian coordinates as z3- f(x1,x2) = 0, we can project the surface element, d 3 , onto the x1x2-plane as d x 1 d x 2 = ( E . z3)d a = cosyda, where 6 = 5,’1 5 1is the unit normal to the surface and integrate over the region RXlx2,which is the projection of S onto the
176
GENERALIZED COORDINATES AND TENSORS
A
.3
Figure 3.11
Projection of the surface area element
z1z2-plane (Fig. 3.11). Since the normal is given as
3=
8.f
8f
we write the surface area as
S
=//do
= /./nx,z2(l/cos7)dx'dx2
The two areas [Eqs. (3.310) and (3.311)] naturally agree. Example 3.2. Curvilinear coordinates o n the plane: Transformations from the Cartesian to curvilinear coordinates on the plane, say the z1x2plane, is accomplished by the transformation equations z1 = 2 1 ( U , V ) ,
(3.312)
z2= 2 ( U , V ) ,
(3.313)
x
3
= 0.
(3.314)
Metric tensor can easily be constructed by using Equations (3.296)-(3.298). Area element is naturally in the z3direction and is given as
(3.315)
GENERAL TENSORS
177
Taking the plus sign for proper transformations, we write the magnitude of the area element as
(3.316) In other words, under the above transformation [Eqs. (3.312)-(3.314)], the area element transforms as
(3.317) Notice that on the x1x2-plane
(3.318) Applying these to the plane polar coordinates defined by the transformation equations
where u = p and v
=
x1 = pcos4,
(3.319)
x2 = p sin 4,
(3.320)
4, we can write the line element ds2 = dp2
as
+ p2 dq5’.
(3.321)
Since
(3.322) the area element becomes dg 3.4.10
=p
dpdd.
(3.323)
Volume Element in Generalized Coordinates
In Cartesian coordinates the scalar volume element is defined as d r = C1 . (C2 x
Z3)
dzld~~d.~.
(3.324)
Since the Cartesian basis vectors are mutually orthogonal and of unit magnitude, the infinitesimal volume element reduces t o dr
= dz1dz2dz3.
(3.325)
In generalized coordinates we can write the scalar volume element dr’, which is equal to d7, as the volume of the infinitesimal parallelepiped with the sides defined by the vectors 2121, 2 2 2 2 , 2 3 2 3
(3.326)
178
GENERALIZED COORDINATES AND TENSORS
as
dr' =
(&&l).
(Z2&2x ?3&3)
=2 1 .( 2 2x
T3)&1&2&3.
(3.327) (3.328)
Using Equation (3.143), this can also be written as (3.329)
A tensor that transforms as
is called a tensor density or a pseudotensor of weight w. Hence the coorwhich transforms as dinate volume element, (3.331) is a scalar density of weight now transforms as
~
1. Volume integral of a scalar function p(Z1, T2, z3)
(3.332) In orthogonal generalized coordinates the volume element is given as dr'
3.4.11
=131
1 2 2
a21 1 2 3 a3/
=
1pq 1
=
&&& d z 1 d z 2 d z 3 .
~ 1 ~ ~ &l&2&3 1~ 1
(3.333) (3.334) (3.335)
lnvariance and Covariance
We have seen that scalars preserve their value under general coordinate transformations that do not involve scale changes. Magnitude of vectors and the trace of second-rank tensors are also other properties that do not change under such coordinate transformations. Properties which preserve their value under coordinate transformations are called invariants. Identification of invariants in natiirc is very important in understanding and developing new physical theories. An important property of tensors is that tensor equations preserve their form under coordinate transformations. For example, a tensor equation given as
DIFFERENTIAL OPERATORS IN GENERALIZED COORDINATES
179
transforms into
Even though the components of the individual tensors in a tensor equation change, the tensor equation itself preserves its form. This useful property is called covariance. Since the true laws of nature should not depend on the coordinate system we use, it should be possible to express them in coordinate independent formalism. In this regard, tensor calculus plays a very significant role in physics. In particular, it reaches its full potential with Einstein's special theory of relativity and the general theory of relativity. DIFFERENTIAL OPERATORS IN GENERALIZED COORDINATES
3.5 3.5.1
Gradient
We first write the differential of a scalar function @(Zi)as
a@
a@ a@ + - dZ2 + - dZ3. z1 z2 z3
d@ = - dZ1
(3.338)
Using the displacement vector written in terms of the generalized coordinates and the basis vectors 2 i as
+d Z 2 2 2 +dZ323,
d 7 = &'$I
(3.339)
we rewrite dQ, as d@ = T @ . d 7
(3.340)
+ dZ3$3)
(3.341)
to get
+
d@ = T@. (&El21 d Z 2 2 2 =
(?a.
21)
dZ1+ (T@. 2 2
)
dZ2
+
$3)
dZ3.
(3.342)
Comparing with Equation (3.261), this gives the covariant components of the gradient in terms of the generalized coordinates as (3.343) In orthogonal generalized coordinates, where the unit basis vectors are defined as el=,-h
3 e l
lesl
3 -
e l
3
-3
2
&'e2=-
e 2
d=,
2
e3=-
e 3
6'
(3.344)
Equation (3.343) gives the gradient in terms of the generalized coordinates and their unit basis vectors:
180
GENERALIZED COORDINATES AND TENSORS
Figure 3.12
3.5.2
Volume element used in the derivation of the divergence operator.
Divergence
To obtain the divergence operator in generalized coordinates, we use the integral definition [Eq. (2.309)] (3.346) where S is a closed surface enclosing a small volume of AV. We confine ourselves to orthogonal generalized coordinates so that the denominator can be taken as (3.347) For the numerator we consider the flux through the closed surface enclosing the volume element shown in Figure 3.12. We first find the fluxes through the top and the bottom surfaces. We chose the location of the volume element such that the bottom surface is centered at PI = (EA,Ei,O) and the top surface is centered at P2 = (?i$,zi, AT3).We write the flux through the bottom surface as (3.348) (3.349) -
where we used is.
x3for the component of 2 along the unit basis vector -
A3 =
+ -
A
.E3.
g3,
that
(3.350)
DIFFERENTIAL OPERATORS IN GENERALIZED COORDINATES
181
-
The minus sign is due to the fact that 2 3 and the normal - to the surface are in opposite directions. Note that @, &, and 713 are all functions of position. For the flux over the top surface we write
We now have a plus sign, since 2 3 and the normal are in the same direction. Since we use orthogonal generalized coordinates, the other components of + A do not contribute to the flux through these surfaces. Since the righthand side of Equation (3.352) is t o be evaluated at ($j,zg,AT3) , we expand
( 4 5 7 6 2 3 )in Taylor series about
($,,?i$,O)
and keep only the first-order
terms: -
&&A3
--2
,x ,AZ3
=
fi&Z
Substituting this into Equation (3.352), we obtain
Since the location of the volume element is arbitrary, we drop the subscripts and write the net flux through the top and the bottom surfaces as
Similar terms are written for the other two pairs of surfaces, giving
(3.356)
182
GENERALIZED COORDINATES AND TENSORS
4 x3
/==&+;* cll -X1 Figure 3.13 Closed path used in the definition of curl, where AT2 and AT3 represent the change in coordinates between the indicated points.
Substituting this into Equation (3.346) with Equation (3.347), we obtain the divergence in orthogonal generalized coordinates as
L
(3.357)
3.5.3 Curl We now find the curl operator in orthogonal generalized coordinates by using the integral definition [Eq. (2.310)]:
(3.358)
where C is a small closed path bounding the oriented surface AS. The outward normal to d d is found by the right-hand rule. We pick a single component of x A by pointing d d in the desired direction, say gl.In Figure 3.13 we show the outward unit normal 6 found by the right-hand rule, pointing in the direction of Z1, that is, 6 = gl.We now write the complete line integral
(a'
->
DIFFERENTIAL OPERATORS IN GENERALIZED COORDINATES
183
over C as +
J
i x - d f - ; Ca+Cb+Cc+Cd
A .d7
( 2 .&)
&I
= L.+C*+cc+cd
q
+ (2.
&2
+ ( 2 .T3)&3, (3.359)
where we have used Equation (3.268). We first consider the segments C, and C,. Along C, we write
+ where 2 2 = A . & . We now write the Taylor series expansion of about Po = (zi,?E;,Ti) with only the linear terms:
(z3-
zi).
6
3
2
(3.361)
(FA ,Z;,Zg)
Along C, we have T3 = T i and TI
= Ti;hence
Equation (3.360) becomes
(3.362) Next, to evaluate
+
jCC A . d 7 , we write
184
GENERALIZED COORDINATES AND TENSORS
-
We again use the Taylor series expansion [Eq.(3.361)]of 6 x 2 about Po = (zA,Ti,zi) with only the linear terms. Along the path C,, we have T3 = Ti AT; and z1= zA,which gives
+
(3.364)
Using this n Equation (3.363), we obtain
k x+
(3.365)
This allows us to combine the integrals in Equations (3.362) and (3.365) to yield
Since our choice of the point (3$, Tg,T i ) is arbitrary, we write this for a general point as (3.367)
A similar equation will be obtained from the other two segments as (3.368)
DIFFERENTIAL OPERATORS IN GENERALIZED COORDINATES
185
Addition of Equations (3.367) and (3.368) yields
Using this result in Equation (3.358) gives the component of direction of 21 as
3 x 2 in the
A similar procedure yields the other two components as
and
The final expression for the curl of a vector field in orthogonal generalized coordinates can now be given as
(3.373) which can also be expressed conveniently as
. (3.374)
186
GENERALIZED COORDINATES AND TENSORS
3.5.4
Laplacian
Using the results for the gradient and the divergence operators [Eqs. (3.345) and (3.357)], we write the Laplacian for orthogonal generalized coordinates as (3.375)
3.6
ORTHOGONAL GENERALIZED COORDINATES
The general formalism we have developed in the previous sections can be used to define new coordinate systems and t o study their properties. Depending on the symmetries of a given system, certain coordinate systems may prove to be a lot easier to work through the mathematics. In this regard, many different coordinate systems have been designed. To name a few, Cartesian, cylindrical, spherical, paraboloidal, elliptic, toroidal, bipolar, and oblate spherical coordinate systems can be given. Among these Cartesian, cylindrical, and spherical coordinate systems are the most frequently used ones, which we are going to discuss in detail. Historically, the Cartesian coordinate system is the oldest and was introduced by Descartes in 1637. He labeled the coordinate axes as x,y,and z :
x1 = 5 , x2 = y, x3 = z A
A
(3.376) (3.377) (3.378)
A
and used i , j , k for the unit basis vectors: A
A
.
(3.379)
e l = 2,
A
-32
h
(3.380)
=j, A
h
e3
= k.
(3.381)
In Cartesian coordinates motion of a particle is described by the radius or the position vector, 7 ( t ) ,as -+ T ( t )= x(t$+ y(t)T
+ z(t)Z,
(3.382)
ORTHOGONAL GENERALIZED COORDINATES
187
where the parameter t is usually the time. The velocity, T ( t )and , the acceleration, i T ( t ) ,are obtained as
(3.383)
z i+$ h
= ~
h
+z
A
(3.384)
j k, d2T
a ( t ) = - d= -3 dt
(3.385)
dt2
A
h
A
(3.386)
=xi+yj+zlc.
Example 3.3. Circular motion: Motion of a particle executing circular motion can be described by the parametric equations
x ( t ) = a0 coswt;
(3.387)
y ( t ) = a0 sinwt,
(3.388) (3.389)
z ( t ) = zo. Using the radius vector + T ( t )= a0 cos wt i
h
+ a0 sin wt j + zo k , h
A
(3.390)
we can obtain the velocity T ( t )as + 2, ( t ) = -uow sin w t i
h
+ aow cos wt j
A
(3.391)
and the acceleration Z ( t )as + a ( t ) = -aow
A
2
= -w”(t).
3.6.1
A
cos wt i - uow2 sin wt j
(3.392) (3.393)
Cylindrical Coordinates
Cylindrical coordinates are defined by -1
(3.394)
x =P,
-2
x x
-3
=4,
(3.395)
z.
(3.396)
=
They are related to the Cartesian coordinates by the transformation equations (Fig. 3.14)
x
= p cosq5,
y
= p sin
z
=
z,
4,
(3.397) (3.398) (3.399)
188
GENERALIZED COORDINATES AND TENSORS
Figure 3.14
Cylindrical coordinates: Coordinate surfaces for p, 4, z and the
unit basis vectors.
where the ranges are given as p E [ O , o o ] , $ E [0,2n],2 E [ O , o o ] . Inverse transformation equations are written as p=
VGqF,
(3.400) (3.401)
2
(3.402)
= 2.
We find the basis vectors [Eq. (3.208)], -=,
e
i =
axk
-,
(3.403)
zz
as f
e
+ sin 4 j , I X,,l = 1, 4 = - p s i n 4 i + p c o s 4 j , lZ41= p,
Z p= cos 4 i
3
e
h
h
1=
h
2 = 2
f
h
e3=Zz=k,
(3.404)
A
/+ ezI=l,
(3.405)
(3.406)
The unit basis vectors are now written as h
h
h
e l = ep = cos$ i + s i n $ j ,
-
-
A
A
h
e2
h -
= E4 =
-
sin $ i
(3.407)
+ cos $ j , A
(3.408)
h A
e3 =
e, = k .
(3.409)
ORTHOGONAL GENERALIZED COORDINATES
Figure 3.15
189
Infinitesimal displacements in cylindrical coordinates.
It is easy to check that the basis vectors are mutually orthogonal; hence they satisfy the relations (Fig. 3.14)
(3.410)
It is important to note that the basis vectors, ?i, are mutually orthogonal; however, their direction and magnitude depends on position. We now write the position vector, 7, and the infinitesimal displacement vector d 7 [Eq. (228)l as
7= p T p + $ 2 6 d
+z T z , 7 = d p T 0+d$T+ +d z T z .
(3.411) (3.4 12)
From the line element ds2 = d 7 . d 7
(3.413)
+
= dp2 ( T f . Z f ) d$' = dp2
(2+ .?+)
+ p2dq52 + dz2
= Q f f dP2
+ g+dJd42 + g z z
+ dz2 (2,. T z )
(3.414) (3.415)
dZ2,
(3.416)
we obtain the metric tensor: (3.417)
190
GENERALIZED COORDINATES AND TENSORS ..
We construct the contravariant metric tensor, g z J , by using the inverse basis vectors [Eq. (3.213)],
(3.418) (3.4 19) (3.420) which are found by using the inverse transformation equations [Eqs. (3.400)-(3.402)] as
dpi+ -
-3 dp, + -dpk dy dz X Y (x2 y2)1/Zi (x2 y 2ye = --z -3
2 1-Z P =
(3.421)
ax
h
+
P
+
(3.423)
P h
h
-2e
(3.422)
+
+
= C O S ~i + s i n $ j ,
(3.424)
84, dqk + -3 -- 3 4 = -t dx dy
(3.425) (3.426) (3.427) (3.428)
-3
e
- e--fz = k . A
(3.429) . .
We can now write the contravariant metric tensor, 9'3, as ..
gZ3= -ie
=(
. -ej
1
(3.430) 0
0
$-.
0
0
0 0 ) .
(3.431)
1
Note that
(3.432) (3.433) (3.434)
ORTHOGONAL GENERALIZED COORDINATES
191
Line integrals in cylindrical coordinates are written as
(3.435) (3.436) where
(3.437) (3.438) (3.439) Area elements in cylindrical coordinate (Fig. 3.15) are given as
(3.440) (3.441) (3.442) while the volume element is d r = dp(pd4)dz
(3.443) (3.444)
= pdpd4dz.
Applying our general results to cylindrical coordinates, we write the following differential operators: Gradient [Eq. (3.345)]:
(3.445) Divergence [Eq. (3.357)]:
(3.446) where --$
A,=A.Z,,
+
+ -
A,=A.Z$, A z = A . k .
(3.447)
Curl [Eq. (3.373)] :
(3.448)
192
GENERALIZED COORDINATES AND TENSORS
+
where A, = A . C,, A4 = expressed as
+
A .Z4, A,
=
+ A . k . Curl can also be conveniently
(3.449)
Laplacian [Eq. (3.375)] 1d
[
d@
P @ ( p , 4 , z ) = -- ppap iip]
1 d2@ d2@ + -p2 a@ dz2'
(3.450)
+
Example 3.4. Acceleration i n cylindrical coordinates: In cylindrical coordinates the position vector is written as ---f
r
= p cos
4 ;+
p sin 4
3 + zZ.
(3.451)
Using the basis vectors Z,,Z$,z [Eqs. (3.407)-(3.409)], we can also write this as
(7t.K)Z
+ T = (?.EP)E,+(?;).2$)z?4+
+ zk.
(3.452)
A
= pZ,
Since the basis vector particle is written as
(3.453)
Z, changes direction with position,
velocity of a
(3.454) A
Using Equation [3.407], we write the derivative of the basis vector, e,, as A
h
e , = 4(- s i n 4 i =
+ cos4 j ) h
$Z&
(3.455) (3.456)
thus obtaining the velocity vector + v = pZ,
+ p&4 + Zk. h
(3.457)
To write the acceleration, we also have t o consider the change in the direction of Ed:
ORTHOGONAL GENERALIZED COORDINATES
Figure 3.16 basis vectors.
Spherical coordinates: Coordinate planes for
T,
193
8, q5 and the unit
Using Equation (3.456) and h
&- cos 4 i
h
k4 = =
A
-
sin 4 j )
(3.459)
-4zp,
(3.460)
we finally obtain
Zp + (&
3.6.2
+ 2b&)z4+ Zk. h
(3.461)
Spherical Coordinates
Spherical coordinates (r,8,4) are related to the Cartesian coordinates by the transformation equations (Fig. 3.16)
4, y = r sin 0 sin 4,
(3.462)
z
(3.464)
x
= r sin 0 cos
(3.463)
= r cos 0,
whcre the ranges are given as
r E [ 0 , 4 , 0 E [0,7d, 4
E
[0,27d.
(3.465)
194
GENERALIZED COORDINATES AND TENSORS
The inverse transformations are (3.466) (3.467) (3.468) We write the radius vector as + r =zi+yj+zk A
h
-
= r sin B cos
.
(3.469)
4T+ r sine sin 4 3+ r cos 0 X.
(3.470)
Calling -1
x = r,
we write the basis vectors, 3
e
1=
3
$i
z2= 8, z3 = 4, dXj
= -,
as
zz
h
A
A
-f?,=sinBcosq5i+sin0sin$j+cose h
e2 =2 0
(3.471)
(3.472)
k, h
A
=rcosecosdi+rcosOsin4j-rsinB
3
A
k,
(3.473)
A
(3.474)
e3=-f?4=-rsinBsin$i+rsinBcos4j.
Dividing with their respective magnitudes,
\Tr1= 1,
I ~ Q \= r,
(3.475)
1241 = rsin8,
gives us the unit basis vectors:
Z,= sin 0 cos 4 T+ sin 0 sin $ 3+ cos 0 k , h
(3.476)
h A
ee =cosQcos$;+cosBsinq53-sintl A
24 =
-
sin
i
+ cos $ j ,
k,
(3.477)
A
(3.478)
which satisfy the relations A
e,
-
A
A
= ee x E d ,
(3.479) Using the basis vectors, we construct the metric tensor
(3.480) (3.481)
ORTHOGONAL GENERALIZED COORDINATES
Figure 3.17
195
Infinitesimal displacements in spherical coordinates.
which gives the line element as
(3.482)
ds2 = gijdTi&? = dr2
+ r2 de2 + r2sin28 dd2.
(3.483)
The surface area elements (Fig. 3.17) are now given as
dore = r drd8, dgr4 = r sin 8 drdq5,
(3.484) (3.485)
doe4 = r2sin 8 dedd,
(3.486)
d r = r2 sin8 drdedq5.
(3.487)
while the volume element is
Following similar steps to cylindrical coordinates, we write the contravariant components of the metric as
1
0
0
..
(3.488) r2 sin2 0
Using the metric tensor, we can now write the following differential operators for spherical polar coordinates:
196
GENERALIZED COORDINATES AND TENSORS
G r a d i e n t [Eq. (3.345)]:
a@, + --eQ Id@,. 1 d@, +r 80 rsine
?@(r, 0 , 4 )= -e, dr
(3.489)
Divergence [Eq. (3.357)]: +
d ( r 2sin OA,) d ( r sin OAQ) r2 sin 0 ae 1 d(r2AA,) 1 d(sin6'Ao) 1 dA, - -~ fr2 dr rsin6' d0 rsin6' 84 '
?.A=-
(3.490)
+
+--
(3.491)
where A,
--+
---t
=
A GT,AQ= A .EQ, A, =
(3.492)
dr
which can also be conveniently expressed as h
e,
A,
I,
r 20 rsin6' &$,
asd
?xA+ = - d e r2 t [ sin $1 0
(3.493)
t
rAQ rsinBA6
---t + + where A, = A . E,, A0 = A . EQ, A, = A . e+. Laplacian [Eq. (3.375)] :
(3.494)
(3.495) -
1
d2@
(3.496) E x a m p l e 3.5. Motion i n spherical coordinates: the position vector,
In spherical coordinates
ORTHOGONAL GENERALIZED COORDINATES
197
t'
Figure 3.18
Basis vectors along the trajectory of a particle.
is written as + r = rsinecos45+rsinOsin4 ?+rsino
Z,
+ r = re,.
(3.497) (3.498)
For a particle in motion the velocity vector is now written as h
u
--f
= G,
+re,.
(3.499)
Since the unit basis vectors also change direction with position (Fig. 3.18), we write the derivatives e , , e e , and e+ as h
h
6, = (cosocos+b-sinesin4$):+ -
=
sine
(cososin4b+sinecos4Q)T
;4
(3.500)
bz8 + sin e &z@,
(3.501)
A
ee = (-sinecos4 i - c o s e s i n 4 -
A
coso
= -I%,
ex
ed = -cos@
= -sin
(3.503) .,-.
4i - s i n 4 $j $2, - cos e &. . A
4)~
b+cos~cos~
(3.502)
+ cos 0 &4,
h
$)a+ (-sinesin4
(3.504) (3.505)
198
GENERALIZED COORDINATES AND TENSORS
Velocity [3.499] is now written as
which also leads to the acceleration
PROBLEMS
1. Show that the transformation matrices for counterclockwise rotations through an angle of 0 about the x1-,x2-,and x3-axes, respectively, are given as
1
0
0 -sin0 cosd
cos0
2 . ShowtJhat z’@b .
0
cos0 -sin0
sin0
the tensor product defined as
0
;5’ @ 3 is the transpose of
3. Show that the trace of a second-rank tensor,
is invariant under orthogonal transformations.
4. Using the permutation symbol, justify the formula
PROBLEMS
199
5 . Convert these tensor equations into index notation:
6)
(ii)
6. Write the components of the tensor equation u,
= vJvJwLl
i,j
=
1,2,3,
explicitly.
7. What are the ranks of the following tensors: (i) (ii) (iii)
KZJk1DkBrnAZJ, AZBB,WJkuk, A ~ J A ~ ~ B ~ .
8. Write the following tensors explicitly, take i, j = 1 , 2 , 3 :
(i) (ii)
9. Let
A i j , Bij,
AiBiWjkuk, AijAijBk.
and Ci be Cartesian tensors. Show that
is a first-rank Cartesian tensor. 10. Show that the following matrices represent proper orthogonal transformations and interpret them geometrically: (i)
200
GENERALIZED COORDINATES AND TENSORS
(ii)
cos30O -sin30°
-sin3O0 -cos30° 0
0 0 -1
11. Show that
12. Show that in cylindrical coordinates the radius vector is written as + r - p'Zp+zk.
h
13. Parabolic coordinates, (T1,Z2,Z3), usually called (7, [, 4 ) ,are related to the Cartesian coordinates, (2,y, z),by the transformation equations
x1 = x
x
2
= q
= y = rl<sin 4,
1 2
2 2 = 2 = -(<2
- 72)
(i) Show that this is an admissable coordinate system and write the inverse transformations. (ii) Find the basis vectors and construct the metric tensor
gij.
(iii) Write the line element. ..
(iv) Write the inverse basis vectors and construct 9'3. (v) Verify the relation between the basis vectors and the inverse basis vectors [Eq. (3.220) and (3.225)]. (vi) Write the differential operators, gradient, divergence, curl, and Laplacian, in parabolic coordinates. (vii) Write the velocity and acceleration in paraboloidal Coordinates. 14. Elliptic coordinates, ( q , [ ,4) are defined by
x1 = x
CL = -coshqcos<,
2
a . x = y = -sinhqsin<, 2 2 n
2'
= 2 = z.
(i) Show that this is an admissable coordinate system and write the inverse transformations. (ii) Find the basis vectors and construct the metric tensor
gij.
PROBLEMS
201
(iii) Write the line element. (iv) Write the inverse basis vectors and construct
.. 9'3.
(v) Verify the relat,ions between the basis vectors and the inverse basis vectors [Eqs. (3.220) and (3.225)]. (vi) Write the differential operators, gradient, divergence, curl, and Laplacian, in elliptic coordinates. (vii) Write the velocity and acceleration in elliptic coordinates.
15. Given the parametric equation of a surface:
x1 = xl(u,v), 2
2
= 22 ( u , v ) ,
z3 = x 3 ( u , v ) and the surface area element
show that the magnitude of the area element is given as
where 2
E = ( Z )
8x1 8x1 F=--+--+-du dv 2
G=($)
+(g)2+(g), 2
8x2 8x2
du av
8x3 8x3 du dv '
+(g)+(g). 2
2
16. For the area of a surface in terms of the surface coordinates ( u , v ) we wrote
and said that in three dimensions and in Cartesian coordinates S can also be written as
(x1,22,x3),
202
GENERALIZED COORDINATES AND TENSORS
Is S a scalar? If your answer is yes, then scalar with respect t o what? What happened to the third coordinate in the transformation? 17. Use the transformation x+y=u, y = uv to evaluate
18. Evaluate the integral
over the triangular region bounded by the lines x = 0, y = 0 and = 1 by making a suitable coordinate transformation. Is this an orthogonal transformation?
x +y
19. Transform the following integral:
by using the substitution
x
= u,
y=u-v.
Find the new basis vectors
20. Evaluate the surface integral I
=A
( x 2+ y2) d o
over the cone
z between z = 0 and z
=
d
m
= 3.
21. Express the differential operators
a d d ax ’ a y ’ 32
PROBLEMS
203
in spherical coordinates and then show that
d d +isin@-, 84 d0
= icotOcos@-
+ .
where L is the angular momentum operator in quantum mechanics defined as +
L
= -a
(7x 3).
We have set fi = 1.
Hint: Differential operators are meaningful only when they operate on a function. Hence, write
d v x , g, Z) - d v , e,@)dr dx dr dx
-+
d w - ,0 ’ 4 )-80 + do dx
a w , e,@)a4 d@
dx’
etc. and proceed. 22. Quantum mechanical angular momentum is defined as the differential operator +
L
= -2
(7x
3).
Show that
where L, and L y are the Cartesian components of the angular momentum. Also, show that
L2 = L;
+ L; + L: = -21 (L+L- + L-L+) + L;.
23. Show by using two different methods that in spherical coordinates + L =-i(7XV)
=i
(AslrlD
e~---e4-@:
:e)
204
GENERALIZED COORDINATES AND TENSORS
24. In spherical coordinates show that the L2 operator in quantum mechanics, that is,
+ + L;,
L2 = L& L; becomes
Hint: Use the result of Problem 3.21 and construct L2 Verify your result by finding L2 as
+
L~ = L ~ L * L ~ L ~ . 25. Show that the cross product of two vectors,
+
3 x b , is a pseudovector.
26. Show that the triple product of three vectors, doscalar.
3.
27. Prove that
28. Show that the covariant components of velocity are given as
vi = where v 2 = (i') coordinates.
d
6%
(:u2) , i
= 1,2,3,
+ (i2) + (i3) . Justify this result by using spherical
29. Given the following position vectors, find the rectangular components of velocity and acceleration:
30. Write the components of velocity and acceleration in polar coordinates for the two-dimensional position vector defined by (i) (ii)
T T
= a / ( b - sin4), 4 = wt, = a / t , 4 = bt.
PROBLEMS
31. What are the components of velocity and acceleration in spherical ordinates with the position of the particle given as
205 CO-
r = a, 0 = bsinwt, 4 = wt. 32. Find the expressions for the kinetic energy in (i)
cylindrical coordinates,
(ii)
spherical coordinates.
33. Find the expression for the covariant components of velocity and acceleration in (i)
parabolic coordinates (Prob. 3.13),
(ii)
elliptic coordinates (Prob. 3.14).
3.1. Given the expression .2
v2 = Ax2 + Bxx$sin4 + C x 2 4
for the velocity squared in the following generalized coordinates : -
21 = 2 , z2
= $5,
find the covariant components of the velocity and acceleration. 35. Find the unit tangent vector to the intersection of the surfaces Q1(x, y, z ) = x2
+ 3xy - y2 + yz + 2 = 5
and Q2(x,y, z ) = 3x2 - xy
+y
at (1.1,l).
Hint: First find the normals to the surfaces.
2
=3
This Page Intentionally Left Blank
CHAPTER 4
DETERMINANTS AND MATRICES
In many areas of mathematical analysis we encounter systems of ordered sets of elements, which could be sets of numbers, functions, or even equations. Determinants and matrices provide an efficient computational tool for handling such systems. We already used some of the basic properties of matrices and determinants when we discussed coordinate systems and tensors. In this chapter, we give a formal treatment of matrices and determinants and their applications to systems of linear equations.
4.1
BASIC DEFINITIONS
We define a rectangular matrix of dimension m x n as an array
Essentials of Mathematical Methods in Science and Engineering. By Copyright @ 2008 John Wiley & Sons, Inc.
9. Selsuk Bayin 207
208
DETERMINANTS AND MATRICES
where the elements of A could be numbers, functions or even other matrices. An alternate way to write a matrix is
A = a 2.7. . i = l , . . . , m, j = 1 , . . . , n,
(4.2)
where aij is called the i j t h element or the component of A. The first subscript, i , denotes the row number and the second subscript, j , denotes the column number. For the time being, we take aij as real numbers. When the number of rows is equal to the number of columns, m = n, we have a square matrix of order n. We define a row matrix with the dimension 1 x n as
A
=
(
all
'..
a12
aln
)
(4.3)
or simply as
A = ( a1
a2
.
an
(4.4)
).
Similarly, we define m x 1 column matrix as all
A=
a21
or as A
=
am1
4.2
OPERATIONS W I T H MATRICES
The transpose of a matrixis obtained by interchanging its rows and columns and it is denoted by AT or A . The transpose of a matrix of dimension m x n,
A=
is of dimension n x m :
AT
=x=
[
all
a21
...
am 1 'm2
aln
a2n
..'
amn
The transpose of a column matrix is a row matrix,
1
(4.7)
OPERATIONS WITH MATRICES
209
and vice versa:
If the transpose of a square matrix is equal to itself, it is called symmetric. When the transpose of a square matrix is equal to the negative of itself, it is called antisymmetric or skew-symmetric. If only the diagonal elements of a square matrix are nonzero, then it is called diagonal:
(4.10)
The zero or the null matrix, 0, is defined as the square matrix with all of its elements zero:
0 0
..'
0 (4.11)
0 0
...
Identity matrix, I, is defined as the square matrix
(4.12)
= 6.. 2 3 > i = 1, ... ,n, j = 1,. . . ,n.
(4.13)
To indicate the dimension we may also write I,. Addition of matrices is defined only when they have the same dimension. Two matrices, A and B, of the same dimension, m x n, can be added term by term, with their sum being again a matrix of dimension m x n : C=A+B,
+
cij = ~ i j b i j ,
i
=
1,.. . , m, j = 1,. . . ,n.
(4.14) (4.15)
Multiplication of a rectangular matrix with a constant (Y is accomplished by multiplying each element of the matrix with that constant: C = aA, c23. . - a ua3 - ,. i = 1 , . . . ,m, j = 1,. . . ,n.
(4.16) (4.17)
210
DETERMINANTS AND MATRICES
Subtraction of two matrices can be accomplished by multiplying the matrix to be subtracted by -1 and then by adding to the other matrix as A-B
=A
+ (-1)B.
(4.18)
It is easy to verify that for three matrices, A, B , and C, of the same dimension addition satisfies the following properties: A + B =B +A, ( A + B ) + C = A + (B + C ) .
(4.19) (4.20)
Two matrices of the same dimension, A and B, are equal if and only if all their corresponding components are equal, that is, 23 -
b23. . for all i and j .
(4.21)
Multiplication of rectangular matrices with constants satisfy
(4.22) (4.23) (4.24) (4.25) where A and B have the same dimension and a and ,8 are constants. Multiplication of rectangular matrices is defined only when the number of columns of the first matrix matches the number of rows of the second. Two matrices, A of dimension m x n and B of dimension n x p , can be multiplied as
C = AB,
(4.26)
n
a zk . bk3r. i
ca3- .-
=
1, . . . ,m, j
= 1, . . . , p ,
(4.27)
k=l
with the result being a matrix of dimension m x p . In general, matrix multiplication is not commutative,
AB
# BA,
(4.28)
but it is associative:
(AB)C = A(BC).
(4.29)
The distributive property of multiplication with respect t o addition is true, that is,
(A + B)C = AC + BC, A(B + C) = AB + AC.
(4.30) (4.31)
OPERATIONS WITH MATRICES
211
For a given square matrix, A, of order n, we say it is invertible or nonsingular if there exists a matrix B such that
AB
= BA = I.
(4.32)
We call B the inverse of A and write
B = A-l.
(4.33)
If two matrices can be multiplied, their transpose and inverse satisfy the relations
A-i5 BA, =A+B,
(4.34)
=
(A+B)
(4.35)
-
~
aB = aB, N
A-1 =
(4.36)
(A)-',
(4.37)
( A B ) - ~= B - ~ A - ~ ,
(4.38)
+ B)-l = A-' + B-l.
(4.39)
(A
The sum of the main diagonal elements of a square matrix is called the spur or the trace of the matrix: 71
n
(4.40)
+ + . . . + unn. a22
(4.41)
tr(AB) = tr(BA), t r ( A + B) = t r A t rB.
(4.42) (4.43)
= all
Trace satisfies
+
Example 4.1. Operations with matrices: Consider the following 2 x 3 matrix A:
A = ( 21 2
-1
),
(4.44)
which has 2 rows
( 2
1 l ) , ( 1 2
-1)
(4.45)
and 3 columns
(T)- ( k ) ,
('1).
(4.46)
212
DETERMINANTS AND MATRICES
Its transpose is
(; ; )
A -=
(4.47)
1 -1
Given two square matrices
(4.48) we can write the following matrices
A+B=
(
2Ar(
""=(
2+1 -1-1
3+2
2'2 2.(-1)
2.3
3 -2
'-')=(
1 ) 5
')). 6
-2
i).
Now consider the following 3 x 3 matrices:
C=
(t ; 4 2 3
-1
)
'
a n d D = ( 61 ;l2
(4.49)
(4.50)
(4.51)
We can write the products
.fi ; ; )
CD=( 2 3
=(
-1
2-3-0 1-o+o 3-lf0 -1 1 2
p)
;l2
1
(4.52)
4-3-0 2-o+o 6-1+0
2+0-1 1+0+2 3+0+l
1 1 2 3 ) 5 4
and
DC=(:l
('1
fl
(4.53)
(4.54)
i)(.fi 7 ; ) 2
3
-1
(4.55)
4 (4.56)
OPERATIONS WITH MATRICES
Note that DC cations:
(
I:
# CD. We can also write the following matrix multipli-
8 a ) ( I)
=
(
2+0+1
);;;;2;
=
8 !)(!s)=( =(;;).
1+0+1 -1 0 2 1+0+1
+ +
(;l
213
()
,
(4.57)
0+0-1 -0 0 - 2 +0+1-1
+
(4.59)
Note that the dimensions of the multiplied matrices [Eqs. (4.57) and (4.59)] and the product matrices satisfy the following relations, respectively:
(3 x 3)(3 x 1) = (3 x l), (3 x 3)(3 x 2) = (3 x 2).
(4.60) (4.61)
The multiplication
1
0
0
1
(4.62)
is not allowed, since the column number of the first matrix does not match the row number of the second one.
Example 4.2. Multiplication with a diagonal matrix: When a rectangular matrix is multiplied with a diagonal matrix from the right, we obtain
(4.63)
(4.64)
214
DETERMINANTS AND MATRICES
Similarly,
(4.65)
(4.66)
4.3
SUBMATRIX AND PARTITIONED MATRICES
Consider a given (rn x n)-dimensional matrix A. If we delete T rows and s columns, we obtain a [ ( m- r ) x ( n - s)]-dimensional matrix called the submatrix of A. For example, given
all A=
a12
a13 a14
a21 a22 a23
a24
(4.67)
we can write the 3 x 2 submatrix by deleting the 4th row and the 3rd and the 4th columns as (4.68) Even though there is no standard way of writing submatrices, we can write them either by indicating the rows and the columns deleted as
B = A (413,4)
(4.69)
or by indicating the rows and the columns kept as
B = A [1,2,311,2].
(4.70)
For a given m x n matrix, consider the submatrices
All = A [ l , . . , r n l l l , . . . ,1211, A12 = A [ I , .. . , rnlIn1 1 , .. . , n] , A21 = A [rnl 1,. . . ,mil,.. . , nl], A22 = A [ml 1,.. . , 1 , .. . , n],
+ +
+
+
(4.71) (4.72) (4.73) (4.74)
SUBMATRIX AND PARTITIONED MATRICES
215
where ml and nl are integers satisfying 1 < ml < m and 1 < n1 < n. We now define the partitioned matrix in terms of the submatrices Aij as (4.75) Partitioned matrices are very important in applications. If A = Aij is a partitioned matrix, then multiplying A with a constant can be accomplished by multiplying each partition with the same constant. If A and B are two matrices of the same dimension and partitioned the same way, Aij and Bij, a = 1,.. . ,m, j = 1 , . . . , n, they can be added blockwise with the result being another matrix with the same partition, that is,
A + B = A .23. + B i j , i = l , . . . , m, j = 1 , . . . , n.
(4.76)
Two partitioned matrices can be multiplied blockwise, if the multiplied partitions are compatible. For example, we can write
A
(c
B D)(:
:)=(
AE+BG CE+DG
AF+BH CF+DH
)'
(4.77)
if the matrix multiplications AE, BG, AF, . . . exist. Partitioned matrices that can be multiplied are called conformable.
Example 4.3. Partitioned matrices: Given the 4 x 4 matrices 1
0
1
i
i1
A=[! 0 0
1
0
1
Il -1
andB=[
0 l!0
1 0 0
1
1,
(4.78)
the partitions
(4.79)
and
216
DETERMINANTS AND MATRICES
are not conformable. However, the partitioned matrices:
are conformable and can be multiplied blockwise to yield the partitioned matrix
(4.82)
a result that can be verified by direct multiplication of the matrices.
4.4
SYSTEMS OF LINEAR EQUATIONS
In many scientific and engineering problems we encounter systems of linear equations to be solved simultaneously. In general, such systems can be written in terms of n equations and n unknowns, x ~ , x z ., . , x,, as
+ a1222 + . . + Uln2, a2121 + a2222 + . . . + a2,2, a1121
'
= y1, = y2,
(4.83) where
aij
and yi are given constants. Introducing the matrices
GAUSS’S METHOD OF ELIMINATION
217
the above system can be written as
AX = y .
(4.85)
Solution of this system is the 2 1 , 2 2 , . . . ,z, values that satisfies all the n equations simultaneously. To demonstrate the basic method of solution, let us start with a simple system with two equations and two unknowns: a1121 a2121
+ = y1, + a 2 2 2 2 = y2.
(4.86) (4.87)
a1222
Since these are linear equations, using their linear combinations we can write infinitely many equivalent sets that will yield the same solution with the original set. Now, a method of solution appears. We simply try to reduce the above set into an equivalent set with the hope that the new set will yield the solution immediately. We first multiply Equation (4.86) by a21/a1l and then subtract from the second [Eq. (4.87)] to get the equivalent set a1121 a21
(a21 -
-a11)21 all
+
+ a1222 = Ill,
a2 1
(a22
-
(4.88) a2 1
-al2)z2
= y2 - -yl
all
all
’
(4.89)
or a1121
(a22 -
+ a 1 2 2 2 = y1,
a21 -a12152
all
= y2
(4.90) a21
-
-y1. all
(4.91)
Since aij and yi are known numbers, the second equation of the new set [Eq. (4.91)] gives the value of one of the unknowns, x2, directly, while the first equation [Eq. (4.90)] gives the remaining unknown, 21, in terms of 2 2 . Substituting the value of 2 2 obtained from the second equation into the first, we obtain the value of 21, thereby completing the solution.
4.5
GAUSS’S M E T H O D OF ELIMINATION
Consider three equations with three unknowns:
(4.92) (4.93) (4.94) To obtain an equivalent set, we start with the first equation and use it to eliminate 51 from the remaining two equations. To obtain the second equation of the new set, we multiply the first equation by 2 and then subtract from the
218
DETERMINANTSAND MATRICES
second. For the third equation, we multiply the first equation by 3 and then subtract from the third, thus obtaining the following equivalent set:
+ 2x2 +
1, [-2 - 2(1)]23 = 1 2 2 ( l ) , [-3 - 3 ( 1 ) ] ~ = 3 -3 - 3(1),
21
[a
+ +
2(l)] 2 1 [3- 2 ( 2 ) ] 2 2 [3 - 3 ( 1 ) ] ~ l [4 - 3(2)]22 ~
+ +
23 =
(4.95) (4.96) (4.97)
that is, 21
+ 222 +
(4.98) (4.99) (4.100)
1, -x2 - 423 = -1, -222 - 6x3 = -6. 23 =
We now use the second equation of the new set to eliminate 2 2 from the first and the third equations [Eqs. (4.98) and (4.100)]. We first multiply the second equation by 2 and then add to the first equation and then multiply the second equation by 2 and subtract from the third equation to obtain another equivalent set: 21
+ [2
-
2(1)]22
+ [I - 2 ( 4 ) ] ~ 3= 1
-
2(-1)]22
+
2(l),
423 = -1, [-6 - 2 ( - 4 ) ] ~ 3= -6 - 2(-1) -22
[-2
-
-
(4.101) (4.102) (4.103)
or
723 = -1, - 4x3 = -1, 2x3 = -4.
(4.104) (4.105) (4.106)
21 -22
From the last equation the value of 2 3 can be read immediately. For the other two unknowns, 2 1 and 2 2 , the method allows us t o express them in terms of the already determined 2 3 as
(4.107) (4.108) thus yielding the solution as 2 1
= -15,
~2
= 9,
23 =
-2.
(4.109)
It can be checked easily that this solution satisfies all three of the equivalent sets. This method is called the Gauss’s method of elimination, also called the Gauss- Jordan reduction. When the original set of equations are compatible, Gauss’s method of elimination always yields the solution. Furthermore, the algorithm of the Gauss’s method is very convenient to be carried out by computers.
GAUSS’S METHOD OF ELIMINATION
219
Of course, an important issue about a given system of n equations with n unknowns is the existence of solution, that is, the compatibility of the system. Consider the system
+
2x1 3x2 5x1 - 2 2 3x1 2x2
-
6x3 = 1,
+ 2x3 = 2,
+
-
4x3 = 2.
(4.110) (4.111) (4.112)
Proceeding with Gauss’s method of elimination, we use the first equation t o eliminate x1 from the other two t o get the equivalent set
(4.113) (4.114) (4.115) We now use the second equation of the new set to eliminate 2 2 from the other two equations of the new set to write the final reduced set as
14 221 = (4.116) 17’ -17x2 3423 = -1, (4.117) 22 0=-. (4.118) 17 Obviously the last equation is a contradiction, thus indicating that the original set is incompatible, hence does not have a solution. Could we have seen this from the beginning? Before we give the answer, let us go back to the first case where we have two equations and two unknowns [Eqs. (4.86) and (4.87)] and write it as
+
UlX
a22
+ b1y = c1,
+ b2y = c2.
We first solve the first equation for
J:
(4.119) (4.120)
in terms of y as
ci
bi -y,
a1
a1
2 == - -
(4.121)
which, when substituted back into the second equation [Eq. (4.120)] and solved for y gives
(4.122)
220
DETERMINANTS AND MATRICES
Using this in Equation (4.121), the final solution can be written as 2 =
c1bz baa1
-
hc2
-
ash'
c2a1
-
a2c1
(4.123)
(4.124) baa1 - a2b1. In general, the solution exists if the denominator is different from zero, that is, when Y=
baa1 - a 2 h
# 0,
(4.125) (4.126)
Geometrically, this result can be understood by the fact that the two equations, ~ 1 3 : b l y = c1 and a2x b2y = c2, correspond to two straight lines in the xy-plane and the existence of solution implies their intersection at a finite point. When the two ratios are equal,
+
+
(4.127) the two lines have the same slope. Hence they are parallel and they never intersect. We now introduce determinants that play a very important role in the theory of matrices. We first write Equations (4.119) and (4.120) as a matrix equation: (4.128)
AX = y ,
(4.129)
where the matrices A, x, and y are defined as (4.130) We now write the solution [Eqs. (4.123) and (4.124)] in terms of determinants as
where the scalar in the denominator is called the determinant of the coefficients, (4.132) = alba
- azbl,
(4.133)
DETERMINANTS
221
In this regard, solution of the linear system [Eqs. (4.119) and (4.120)] exists if the determinant of the coefficients does not vanish. Before we generalize this result to a system of n equations with n unknowns, we give a formal introduction to determinants. 4.6
DETERMINANTS
Determinants are scalars associated with square matrices. We have already introduced the determinant of a 2 x 2 square matrix (4.134) as
det A
all
=
= a11a22
a12
-
(4.135)
a21a12,
which is also written as D(A). The order of a square matrix is also the order of its determinant. There are several different but equivalent ways to define a determinant. For n = 1, the determinant of a scalar is the scalar itself. For n = 2, we have defined the determinant as in Equation (4.135). In general we define determinants of order n > 1 as n
det A
= ~ ( - l ) l + ” a l det , A(llu),
(4.136)
v=l ,
where detA(1lu) is called the minor of al,, which is the determinant of the submatrix obtained by deleting the 1st row and the uth column of A . When n = 2, Equation (4.136) gives
1 2: 1
= (-1)’+’a11
+ (-1)1+2a12 det A(ll2)
det A(1/1)
a22
= a11a22
-
(4.137) (4.138)
a12a21
and for n = 3, the determinant becomes all
a12
a13
a21
a22
a23
a31
a32
a33
=all
I
+ a13
a22
a23
a32
a33
1
1 1 1’
a21
a22
a31
a33
-
a12
a21
a23
a31
a33
1 (4.139)
In Equation (4.136) we have used the first row to expand the determinant in terms of its minors. However, any row can be used, with the result being
222
DETERMINANTS AND MATRICES
the same for all. In other words, for a square matrix, A, of order n the determinant can be written as n
det A
=
~ ( - l ) z i ” u i , det A(ilv),
(4.140)
v= 1
where i is any one of the numbers i = 1,.. . ,n. From this definition it is seen that the determinant of a square matrix of order n can be expanded in terms of the determinants of its submatrices of order n - 1. This is called the Laplace development. Determinants can also be found by expanding with respect to a column, hence we can also write n
det A
=
(4.141)
x ( - l ) ” + z u , i det A(vli), ,=l
where i is anyone of the integers i = 1,.. . , n. Formal proofs by induction can be found in linear algebra books. The rank of a square matrix is the largest number among the orders of the minors with nonvanishing determinants. Example 4.4. Evaluation of determinants: Given the matrix 0
1
2 (4.142)
let us evaluate the determinant by using the Laplace development with respect to the first row: d e t A = (-l)’+’(O)
1
-1
1
1
1 1
+(-1)1+2(1)
1 1
(4.143) = O(-1)
-
l ( 1 - 1) + 2(l)
(4.144) (4.145)
= 2.
To check we also expand with respect to the third row: detA
=
(-1)3+1(1)
1
1 -1
2
1
+(-1)3+2(0)
1 1 0
2
(4.146) = 1(1+ 2)
=2 and the second column:
+ 1(-1)
(4.147) (4.148)
PROPERTIES OF DETERMINANTS
1 1
d e t A = (-l)’+’(l) 1 1 +(-1)’+’(-1)
223
1 1 0 2
(4.149) = -1(1
-
1) + (-l)(-2)
- 0(-2)
(4.150) (4.151)
= 2.
A convenient way to determine the signs in front of the minors is to use the following rule.
+ - + - + -
+
-
+
-
+
-
+
...
+ ...
... (4.152)
+ ...
Advantage of the Laplace development is that sometimes most of the elements in a row or column may be zero, thus expanding with respect t o that row or column simplifies the calculations significantly. For example, for the matrix
1 2 1 - 1 A = [ ;
;; ;
0 0 0
2
j,
(4.153)
evaluation of the determinant is considerably simplified if we use the third column and then the second column of the 3 x 3 minor as detA=+(l)
1 2 3 1 0 1 0 0 2
(4.154) (4.155)
= -2(2) = -4.
4.7
PROPERTIES
(4.156)
OF D E T E R M I N A N T S
Evaluation of determinants by using the basic definition is practical only for small orders, usually up to 3 or 4. In this regard, the following properties are extremely useful in matrix operations:
224
DETERMINANTS AND MATRICES
Theorem 4.1. The determinant of the transpose of a square matrix is equal to the determinant of the matrix itself. For example, the determinant of the transpose of the matrix A in Equation (4.153) is again -4 :
11
1 1 0 1
1-1
3
1
1 1
detA=detA=
(4.157)
1 2 1
1 1 0 2 0 0 =(+1) 3 1 2
(4.158)
(4.159) =
-4.
(4.160)
Theorem 4.2. If each element of one row or column is multiplied by a constant, then the value of the determinant is also multiplied by the same constant. For example, if 1 0 1
0 1 1 1 =2, 0 2
(4.161)
then =
2 (ClCO)
,
(4.162)
where co and Clare constants. Theorem 4.3. If two rows or columns of a square matrix are proportional, then its determinant is zero. A special case of this theorem says, if two rows or colunins of a square matrix are identical then its determinant is zero. Consider the square matrix
*=\/ 2
4 2
2 1
O1
L
(4.163)
0
where the first two columns are proportional. the determinant is 2
= -2
+ 2 = 0.
0ll
(4.164) (4.165)
PROPERTIES OF DETERMINANTS
225
Theorem 4.4. If two rows or columns of a determinant are interchanged, then the value of the determinant reverses sign. For example, if we interchange the first two rows in the determinant 1 0 1
0 1 1 1 =1, 0 2
(4.166)
we get
0 1 1 0 1 0
1 1 2
=-1.
(4.167)
Theorem 4.5. The value of a determinant is unchanged, if we add to each element of one row or column a constant times the corresponding element of another row or column. For example, consider 1 0 1 A = ( 01 11 01 ) with det A
= 2.
(4.168)
We now add 3 times the first column to the second column: A’=(
1 Of3 1 1 1+3 O ) = ( 0 1+0 1
1 3 1 1 4 0 ) 0 1 1
(4.169)
and add twice the first row of A‘ to its third row to write
3 A”
=
(4.170) 0+2
1+6
1+2
2
7
3
where the determinants of A , A’ and A” are all equal: det A = det A‘= det A”
(4.171)
= 2.
Theorem 4.6. Determinant of the product of two square matrices, A and
B, is equal to the product of their determinants: det(AB) = (det A) (det B) .
(4.172)
Consider two square matrices
1 0 1 1 0 A = ( 10 11 O 1 ) a n d B = ( O 1 -1 1
0
I1 )
(4.173)
226
DETERMINANTS AND MATRICES
detAB
4.8
=
2 -1 1 1 1 0
1 1 2
=
( d e t A ) ( d e t B ) = 4.
(4.174)
CRAMER'S RULE
We now consider the case of three linear equations with three unknowns to be solved simultaneously: (4.175) (4.176) (4.177) Following Gauss's method of elimination, we use the first equation to eliminate 5 1 from the other two equations. We multiply the first equation by a21/a11, a l l # 0, and subtract from the second. Similarly, we multiply the first equation by ~ 3 1 / ~ 1 1all , # 0, and subtract from the third to get the equivalent set
We now use the second equation of the new set to eliminate two equations. We first multiply the second equation with
22
from the other
(4.181)
and subtract from the first, and then we multiply the second equation by
(4.182)
CRAMER’S RULE
227
and subtract from the third to get the final equivalent set:
(4.183)
(a22
-
5 2
a11
+ (a23
-
all
5 3 = (b2
-
Ebi) ,
(4.184)
The last equation [Eq. (4.185)] gives the value of 23 directly, while the first and the second equations [Eqs. (4.183) and (4.184)] give the values of 5 1 and 52 in terms of 53, respectively. Thus completing the solution. We have assumed that the coefficients all and
(
a22
-
1
-a12 a21 all
to be different from zero. In
cases where we encounter zeros in these coefficients, we simply rename the variables and equations so that they are not zeros. We now concentrate on the third equation [Eq. (4.185)], which can be rearranged as 23 =
all(a2263 all(a22a33
-
-
a32b2) - al2(a2lb3
a32a23) - alZ(a21a33
-
+ bi(azia3z a31a22) a31a23) + a13(a21a32 a31a22)
a3lb2)
-
-
-
’
(4.186) Using determinants, this can be written as
x3 =
all
a12
bl
a21
a22
b2
a31
a32
b3
all a21
a12 a22
a13 a23
a31
a32
a33
(4.187)
228
DETERMINANTS AND MATRICES
Values of the remaining two variables, 21 and 2 2 , can be obtained from Equation (4.186) by cyclic permutations of the indices, that is, 1+2+3+1+2-+...
21 =
52
=
1 det A
bi
a12
a13
b2
a22
a23
b3
a32
a33
1 det A
all
b1
a13
a21
b2
a23
a31
b3
a33
-
-
(4.188)
,
(4.191)
,
where det A is the determinant of the coefficients: detA
=
all
a12
a13
a21
a22
a23
a31
a32
a33
(4.192)
Note that for the system to yield a finite solution the determinant of the coefficients, det A , has to be different from zero. Geometrically, the three equations [Eqs. (4.175)-(4.177)] correspond to three planes in the ~ 1 1 ~ 2 space with their normals given as the vectors (4.193) (4.194) (4.195) Thus the condition det A #O is equivalent to requiring that n1, n2,and noncoplanar, that is, n1
. (nz x
n3)
# 0.
n3
be
(4.196)
~ 3 -
CRAMER'S RULE
229
The above procedure can be generalized to n linear equations with n unknowns:
an1x1 + a n 2 2 2
+ ' . + annxn = bn, '
(4.197)
= b,
(4.198)
which can be conveniently written as
Ax where
A=
X = an1
an2
".
,b=
(4.199)
ann
We can also write A in terms of the column matrices
(4.200)
as
A = A(A1, A2,. . . , A n ) .
(4.201)
Cramer's rule says that the solution of the linear system, Ax = b, is unique and is given as
xj =
det A(A1, A 2 , .. . , AjP1,b, A j + l , .. . , A n ) > det A
(4.202)
where
det A =
(4.203)
(4.204)
230
DETERMINANTSAND MATRICES
is the determinant obtained from A by replacing the j t h column with b. The solution exists and is unique when the determinant of the coefficients is different from zero, that is, det A
# 0.
(4.205)
Using determinants the proof is rather straightforward. We substitute Equation Ax = b into Equation (4.202) to write (det A) x j = det A(A1,.. . , Aj-1, (Alzl
+ . . . + Anz,), A j + l , . . . , An). (4.206)
Using Theorem 4.5 we can write this as (det A) z j
, Aj-1, A 1 ~ 1Aj+l , . . . ,A,) + . . . + det A(A1, . . . ,A,-1, Anxn,Aj-I,. . . ,A,),
= det A(A1,.. ,
(4.207)
which also after using Theorem 4.2 becomes (det A) z j
+ .. . + xj det A(A1,. . . , Aj-1, A j , Aj+l, . . . , A,) + . . . (4.208) + 2 , det A(A1,. . . ,Aj-1, A,, A j + l , . . . ,A,).
=5 1
det A(A1,.. . , Aj-1, A l , A j + l , .. . ,A,)
Except the j t h term, all the determinants on the right-hand side have two identical columns, hence by Theorem 4.3 they vanish, leaving only the j t h term giving (det A) x j = x j det A(A1,. . . , Aj-I, Aj, Aj+l,. . . ,A,), (det A) = (det A ) ,
(4.209) (4.210)
thereby proving the theorem. 4.9
INVERSE
OF A M A T R I X
Another approach to solving systems of linear equations, Ax the inverse matrix, A-l, which satisfies
= b, is
by finding
Thc solution can now be found as
A-lAx
= A-lb,
(4.212)
x = A-lb.
(4.213)
We return to Equation (4.186) and rewrite it as
(4.214)
INVERSE OF A MATRIX
231
We immediately identify the terms in the parentheses as determinants of 2 x 2 matrices and write 23
=
1 -
det A [bl
1
a32 a12
a33 a13
1 1 1 1
a23
a21
I 1
a21
a22
a31
a32
-
b2
a12
a13
1 1 1+ 1
a33 a23
a31 a21
1+ 1
a11
a12
a31
a32
+
b3
a22 a32
a23 a33
I] I]
a33
a31 all
I]
a21
a22
Similarly, by cyclic permutations of the indices we write 1 det A
= -[b2
I
and 22
1 det A
[h. 1
=-
Comparing with x
b3
-
-
bl
b1
b2
a13
. (4.215)
(4.216)
. (4.217)
= A-lb,
(4.218) we obtain the components of the inverse matrix as
a;
=
1
a21
a22
a31
a32
det A
1
1
a:;
-
-
-
1
a11
a12
a31
a32
det A
1
,
-1 a33
=
1
all
a12
a21
a22
det A
1
, etc. (4.219)
In short, we can write this result as (4.220) where detA(j1i) is the minor obtained by deleting the j t h row and the i t h column. Notice that the indices in det A(jli) are reversed. Furthermore, this result is also valid for n x n matrices. In general, for a given square matrix A , if det A #0, we say A is nonsingular and a unique inverse exists as (4.221) Usually the signed minors are called cofactors: (cofactorA)ij
=
(-l)z+j det A(i1j).
(4.222)
Hence (4.223)
232
DETERMINANTS AND MATRICES
Another way to write the inverse is
(4.224) where the adjoint matrix, adjA, is defined as the matrix, whose components are the cofactors of the transposed matrix, that is, adjA = cofactorx. Inverse operation satisfies
(A
+ B)-'
+ B-l,
= A-'
(AB)-' = B - ~ A - ~ , 1
(0A-l
= -A-'.
(4.225) (4.226) (4.227)
(Y
Example 4.5. Inverse Matrix: Consider the square matrix 1
A = ( ;
; ;), 0
2
(4.228)
since the determinant is different from zero, det A = - 3, the inverse exists. To find A-' we first write the transpose
1
0
1 (4.229)
2 1 0 and construct the adjoint matrix term by term by finding the cofactors i-2S
-
( I: -1 I!
2
-2
;I)
(4.230)
and write the inverse matrix as
A-l
=
-_
-1
2
-2 (4.231)
HOMOGENEOUS LINEAR EQUATIONS
233
To check we evaluate 2
1
0
2 (4.232)
-1
1
0
0
-3
1
1 1 0 (4.233)
=I =AA-~.
4.10
(4.234)
HOMOGENEOUS LINEAR EQUATIONS
When the right-hand sides of all the equations in a linear system of equations are zero, a1121
+ .. . +
UlnX,
= 0,
(4.235) an121
+ . . + annxn = 0, '
we say the system is homogeneous. When the determinant of the coefficients, det A, is different from zero, there is only the trivial solution:
x1 = x2 = . . . - 2 ,
= 0.
(4.236)
When the determinant of the coefficients vanishes.
(4.237)
I
a,l
an2
. . . ann
I
then there are infinitely many solutions. Example 4.6. Homogeneous equations: Let us consider the homogeneous system
(4.238) (4.239) (4.240)
2 3 5 -1 3 2
-6 2 -4
=o,
(4.241)
234
DETERMINANTS AND MATRICES
We seek a solution using Gauss’s method of elimination. Using the first equation, we eliminate x from the other two equations to obtain the equivalent set
+
3y - 62 = 0, 17 --y 172 = 0, 2 5 --y + 52 = 0. 2
22
(4.242)
+
(4.243) (4.244)
Since the last two equations are identical, this yields the solution x y
= 0,
(4.245) (4.246)
= 22.
For the infinitely many values that z could take this represents an infinite number of solutions to the homogeneous system of linear equations [Eqs. (4.238) - (4.240)]. Whether the equation is homogeneous or not Gauss’s method of elimination can always be used with m equations and n unknowns. In general, the method will yield all the solutions. In cases where there are no solutions, the elimination process will lead to a contradiction. In case we obtain 0 = 0 for an equation, we disregard it. In cases where there are fewer equations than unknowns, n > m, the system cannot have a unique solution. In this case, m of the variables can be solved in terms of the remaining n - m variables. For matrices larger than 4 x 4 the method becomes too cumbersome to follow. However, using the variations of Gauss’s method, there exists package programs written in various computer languages. Also programs like Mathematica, Maple, etc. , include matrix diagonalization and inverse matrix calculation routines. PROBLEMS
1. Given A, B, and C as
A = ( -1 1
21 0 3 ) , B = ( 24
+=(
1 -1
1 2
I0 ) ,
1 -1
write the following matrices: (i) A + B , B
(ii) A,
+ A, A + 2B, B-2A,
-B
-
z,c,A+ B , E ,( A A + B ) .
(iii) AB,BA, AA, AB, CA, AC
C.
PROBLEMS
235
(iv) Write the row and the column matrices for A, B, and C 2. If A and B are two m x n matrices and
-
(A+oB) = A
cy
is a constant. show that
+ aB.
3. For a symmetric matrix show that
A
= A.
Also show that
A+A is symmetric.
4. Using the index notation, prove that
A(BC) = (AB)C. 5. Calculate the product AB for
(9 A = ( - '4
1' ) , B = ( ;
a
i).
(ii)
1 2 1 1 2 1 - 1 1 A = ( I 1 O),B=(2 1 1 1 2 ) 2 0 1 1 0 1 - 1 1 6. Use Gauss's method of elimination t o solve the following linear systems:
(9 3x1 5x1
+ 2x2 = 1, + 6x2 = 2.
(ii)
5x1 - 2x2 21
= 3,
+ 2 2 = 2.
7. For a square matrix, A, prove the following: (i) A2 - I
=
(A
+ I)(A
-
I),
236
DETERMINANTS AND MATRICES
(A - I ) ( A 2 + A +I), (iii) A2 - 4A+3I = (A-31)(A - I). (ii) A3 - I
=
8. Solve the following system of linear equations by using Gauss’s method of elimination:
+
32 + 2 y 42 = 2, 22 - y + 2 = 1, 2 2y 32 = 0.
+ +
Check your answer via the Cramer’s rule. 9. If
2 A=( 4 3 0 -
1 0 2 1 1 2 1 1
1 2 1 2
1 0 - 3 3 0
1
write
10. Using the following partitioned matrices, find AB and A
where
I ? = ( 01 0l ) , A l = 2 1 B l = ( ; B2=( ~ ) , B ~ = 2 , 1 ~ = 1 . 11. Evaluate the determinants (i)
(ii)
1 0 0 1
2 3 0 2
0 4 5 3
0 0 6 ’ 4
i)’
+ B[1,2\1,2]
PROBLEMS
237
(iii)
0 2 0 - 1 2
1 0 1 2 1 0 - 1 2 0 1 0 2 . 1 1 2 1 1 0 1 0
12. Find the ranks of the following matrices:
(9
(ii)
0
1 0 1 2 1 0 - 1 2
y;
;1+
13. Find the values for which the following determinant is singular:
14. Solve
and
+ 2x2 + 253 = 2, 2 1 + 5 2 + 323 = 2, z 1 x2 + Lc1 = 1
221
-
by using Gauss’s method of elimination. solution by finding A-l.
For each case, verify your
15. First check that the inverse exists and then find the inverses of the following matrices. Verify your answers.
238
DETERMINANTS AND MATRICES
(i)
(ii)
A = ( O1 2
01 ) .
1 1 -1 (iii)
61. 0
2
9
2
3 0 4 1 2 - 1 0 2
'
16. Simplify (i) [ ( A B ) p ' A - l ] - l , (ii) ( A B C ) - ~( c - ~ B - I A - I ) - ', (iii) [(AB)TA T I T .
17. If A and B are two nonsingular matrices with the property AB then show that
18. Show that ( ~ ~ 1 =- ~ l - 1 ~ - 1
19. If ABC
= I,
then show that
BCA = CAB 20. Find the inverses of the matrices
= I.
= BA,
PROBLEMS
A=(;
0 2
239
42 ) 2
3 -1 and
Check the relation ( A B ) - l
= B-lA-l
for these matrices.
21. Given the linear system of equations: 2x1
-
+ 2 3 = 2,
2x2
+
51 2x2 - 5 3 = 1, 5x1 - 5x2 423 = 4,
+
(i) Solve by using Gauss’s method of elimination. (ii) Solve by using Cramer’s rule.
(iii) Solve by finding the inverse matrix of the matrix of the coefficients.
22. For the homogeneous system 21 - 2 2
21
+ 2x2
+ + x4 = 0, 23
-
23
-
x4
= 0,
+
3x1 - x2 - x3 2x4 = 0, X I 3x2 x3 - 2x4 = 0,
+
+
show that the determinant of the coefficients is zero and find the solution.
23. Show the determinant
24. Evaluate the determinant - 1 0 0 1
1 3 2 2
2 0 2 0 1 1 0 1
240
DETERMINANTS AND MATRICES
by using Laplace construction with respect to a row and a column of your choice.
25. Solve the following system of linear equations by a method of your choice:
(9 3x1 x1
+ 2 2 2 3 = 1, + 5 2 + x3 = 1, -
22
- 2 3 = 0.
(ii)
4x1 - 2x2 + 2x3 = 1,
+
XI 3x2 - 2x3 = 1, 4x1 - 3x2 +x3 = 1.
26. Write the inverse of a diagonal matrix. 27. Solve the following system of linear equations by using Cramer’s rule and interpret your results geometrically:
(9 3x1 - 2x2
+ 2x3 = 10,
+ 2x2 3x3 = -1, 4x1 + 2 2 + 2x3 = 3.
21
-
(ii)
(iii)
2x1
+ 5x2
- 3x3 = 3, 2x2 + 2 3 = 2, 4x2 - 3x3 = 12.
21 -
7x1
+
3x1 - 2x2 + 2x3 = 0, 21 2x2 - 3x3 = 0, 4x1 5 2 2x3 = 0.
+ + +
CHAPTER 5
LINEAR ALGEBRA
Discussion of vectors usually starts with their geometric definition as directed line segments. Introduction of coordinate systems allows us to extend the concept of vectors to a much wider class of objects called the tensors, which are defined with respect to their transformation properties. Vectors now belong to a special class of tensors called the first-rank tensors. It is well known that in n dimensions a given vector can be written as the linear combination of n linearly independent basis vectors. Linear algebra is basically the branch of mathematics that uses the concept of linear combination to extend the vector concept to a much broader class of objects. 5.1
FIELDS A N D VECTOR SPACES
We start with the basic definitions used throughout this chapter. As usual, a collection of objects is called a set. The set of all real numbers is denoted by R and the set of all complex numbers by @. The set of all n-tuples of real numbers,
x = (z1,22,.. . , zn), Essentials of Mathematical Methods in Science and Engineering. By Copyright @ 2008 John Wiley & Sons, Inc.
(5.1)
5. SelSuk Bayin 241
242
LINEAR ALGEBRA
is shown by Rn.Similarly, the set of n-tuples of complex numbers is shown by C7'. An essential part of linear algebra consists of the definitions of field and vector space, which is also called the linear space. Definition 5.1. A field K is a set of objects that satisfy the following conditions: (I) If a , p are elements of K , then their sum, a+P, and their multiplication, ap, are also elements of K . (11) If a is an element of K , then -a such that a ( - a ) = 0 is also an element of K . Furthermore, if a # 0, then a - l , where a(.-') = 1 is also an element of K . (111) The elements 0 and 1 are also elements of K . The set of all real numbers, R, and the set of all coniplex numbers, @, are fields. Since the condition I1 is not satisfied, the set of all integers is not a field. Notice that a field is essentially a set of objects, elements of which can be added and multiplied according to the ordinary rules of arithmetic and that can be divided by nonzero elements. We use K t o denote any field. Elements of K will be called numbers or scalars. We now introduce the concept of linear space or as usually called the vector space. A vector space is defined in conjunction with a field and its elements are called vectors. Definition 5.2. A vector space, V, over a field, K , is a set of objects that can be added with the result being an element of V and the product of an element of V with an element of K is again an element of V. A vector space also satisfies the following properties: (1) Given any three elements, u , u and w, of V, addition is associative:
+
u
+ (v + w)= (u+ v) + w.
(5.2)
(11) There is a unique element, 0, of V, such that
o+u=u+o=u,
U € V .
(5.3)
(111) Let u be an element of V, then there exists a unique vector, -u,in V such that
u+ (-u)= 0.
(5.4)
(IV) For any two elements, u and v,of V, addition is commutative:
u + v = w +u.
(5.5)
(V) If a is a number belonging to the field K , then a(u+v)=au+av, u,vEV.
(5.6)
(VI) If a,P are two numbers in K , then we have
( a + P). = av
+ pv, 21 E v.
(5.7)
FIELDS AND VECTOR SPACES
(VII) For any two numbers
Q
243
and p in K , we have
(Qp)v = a(Dv),v E
v.
(5.8)
(VIII) For all elements, u,of V , we have
1.u = u,
(5.9)
where 1 is the number one. As we shall demonstrate in the following examples, use of the word vector for the elements of a vector space is largely a matter of convenience. These are essentially linear spaces, where their elements can be many things like ordinary vectors , matrices, tensors, functions, etc.
Example 5.1. The n.-tuple space X n : For a given field K , Let X" be the set of all n-tuples 17: = (x1,22,.
. . ,Z n ) ,
(5.10)
where xi are numbers in K . If
Y = ( Y l , y2,. . . , Y") is another element of X " with the sum
x + Y = (21 + Y l r Z 2
II:
(5.11)
+y :
+ Y 2 , . . . ,xn + Yn)
(5.12)
and the product ax is defined as
. ,
Q X = ( Q Z ~ , C Y I C .~ , QII:"), . Q E
K,
(5.13)
then it can easily be checked that X" is a vector space.
Example 5.2. The space of m x n matrices: The sum of two m x n matrices, A and B, is defined as A + B = a i j + b i j , i = l , . . . , m, j = 1 , . . . , n, while their multiplication with a scalar
Q
(5.14)
is defined as
a A = a a i j , i = l , . . . , m , j = l , . . . , n.
(5.15)
It is again obvious that the eight conditions in the definition of a vector field are satisfied. In this sense the set of m x n matrices defined over some field K is a vector space and its elements are vectors.
Example 5.3. Functions as vectors: Consider the set V of all continuous functions of R into R. It is obvious that V is a vector space. A subset of V is the set V' of all differentiable functions of R into R.If f and g are two differentiable functions, then f g is also differentiable. If Q is a scalar in K , then ~f is also a differentiable function. Since the zero function is differentiable, V' also forms a vector space. We say V' is a subspace of V.Similarly, if a subset K' of K also satisfies the conditions to be a field, it is a called a subfield.
+
244
5.2
LINEAR ALGEBRA
LINEAR COMBINATIONS, GENERATORS, A N D BASES
Let v l , 212,.. . , vTLbe the elements of a vector space V defined over the field K and let 0 1 , a 2 , . . . , a , be numbers. An expression like a1v1
+
a202
+ . . . + a,v,
(5.16)
is called a linear combination of v1,212,. . . , v,. As can be shown easily, the set, V’, of all linear combinations is a subspace of V and the vectors (5.17)
V I ~ V ~ , . 1.%.
are called the generators of V’.If V = V’, we say ~ 1 , 2 1 2 ., . . , w, generate V over K . Consider a vector space, V, defined over the field K . If v 1 , w 2 , . . . , v, are elements of V, then w1,v2,.. . , v, are said t o be linearly dependent over K ; if there exist numbers, a l , 0 2 , . . . , a,, in K , not all of them are zero, such that
a l % + a2212
+ . . . + a,v,
= 0.
(5.18)
If such a set of numbers, a 1 , a 2 , . . . ,a,, cannot be found, then we say the vectors 211, u2,. . . , v, are linearly independent. Example 5.4. Linear independence: Consider the vector space V and the vectors
=
Rn
el = (I,(),. . . , O ) , e2
= (0,1,. . . , O ) ,
(5.19) e, = (1,0,.. . ,I),
Since we cannot have ale1
+ a2e2 + . . . + a,e,
=0
(5.20)
unless all ai are zero, e l , e2, . . . , e, are linearly independent. Example 5.5. Linear independence of functions: Consider the functions cost and sint, where t is real. For these functions t o be linearly independent, it should be impossible to find two real numbers, a and b, both nonzero, such that the equation acost
+ bsint = 0
(5.21)
is satisfied for all t. Differentiating the above equation gives another equation, -asint
+ bcost = 0,
(5.22)
LINEAR COMBINATIONS, GENERATORS,AND BASES
245
which, when combined with the original equation, gives u2 = - b .2
(5.23)
Naturally, this cannot be satisfied in the real domain unless
u=b=O.
(5.24)
Hence, cos t and sin t are linearly independent. In general, let V be the vector space of all functions of the real variable t ; then the linear independence of any given number of functions,
can be checked by showing that the equation
cannot be satisfied unless all cri are zero. Consider an arbitrary vector space, V, defined over the field K . Let w1 ,212, . . . , v, be linearly independent vectors in V . Suppose that we have two linear combinations that are equal: QlUl
+ a2v2 +
'
' . + a,v,
=PlVl
+
p2w2
+ . . + &u,, '
(5.27)
then Qi
=pz,
i = 1, . . . ,n.
(5.28)
The proof is simple: We write Equation (5.27) as (a1 - P l ) V l
+
( 0 2 - P2)w2
+ . + (a, ' '
-
Pn)wn = 0.
(5.29)
Since ~1,212,. . . , w, are linearly independent, the only way to satisfy the above equation is by having
a Z = p Z , i = l , . . . ,n.
(5.30)
We now define basis vectors of V over K as the set of elements { w l , v2,.. . , v,,1 of V, which generate V and that are linearly independent. In this regard, the set of vectors {el, e2,. . . ,e,} defined in Equation (5.19), forms a basis for IWrL over R.In general, a basis for V is a set of linearly independent vectors, ( ~ 1 , 2 1 2 , .. . ,w,} , that spans V. In other words, every element v of V can be written as a linear combination of the basis vectors {q, v2,. . . ,v,} as
v
=~
1
+ ~a22121 + . . . + a,~,,
ayi E K .
(5.31)
A vector space is finite-dimensional if it has finite basis, and the dimension is defined as the number of the elements in its basis {q,v2,.. . ,w,} . In a
246
LINEAR ALGEBRA
vector space V, if one set of basis has n elements and another basis has m elements, then n = m. For a given vector space, V, over the field K , if U and W are subspaces such that
U+W=V
(5.32)
and
U nW
=
{o},
(5.33)
that is, the intersection of U and W is the null set, then V is the direct sum of U with W , which is written as
V=U$W.
(5.34)
Dimension of V is equal to the sum of the dimensions of U and W. Formal proofs of these results can be found in books on linear algebra.
5.3 COMPONENTS One of the advantages of introducing basis vectors, {vl, v2,.. . ,vn}, in ndimensional space V is that we can define coordinates or components analogous to the coordinates of vectors in Cartesian space. Components of a vector, w, in V are the scalars, a1, a2,. . . ,an, which are used to express w as a linear combination of the basis vectors as 'u
=QlU1
+ a2v2 + . . . +
1aiva.
QnUn
(5.35)
n
=
(5.36)
i=l
For a given vector, v, and the basis, B = {v1,v2,... ,urn},the scalars a{, = 1,.. . , n, are unique. A given vector v can be conveniently represented as the column matrix
i
V =
(5.37)
To indicate the matrix representation we use boldface character, that is, essentially w and v represent t,he same element in V . In the matrix representation order of the numbers ai follow the order in which the basis vectors are written. In a given n-dimensional space V, let
COMPONENTS
247
and
B’={?I;,,vi} .;,...
(5.39)
be two sets of bases. Then there exists unique scalars S i j , i = 1 , 2 , . . . , n, j = 1 , 2 , .. . , n, such that
c n
v; =
(5.40)
szjvj.
j=1
Let a:, i
= 1,.. .
, n , be the components in terms of B’ of a given u in V : ‘
I
21 = a1v1 n
=
+ a;.; + . . . + a;.:,
(5.41)
CLy:.;.
(5.42)
i=l
Using Equation (5.40); we can write Equation (5.42) as (5.43) n
n
(5.44)
(5.45) Since in the unprimed basis v is written as n
v =cajuj,
(5.46)
j=1
we obtain the relation between the components found with respect to the primed and the unprimed bases, B‘ and B, as (5.47) i=l
Representing S t j ; i = 1 , 2 , . . . , n, j = 1 , 2 , .. . , n, in Equation (5.40) as an n x 11 matrix,
S=
,
(5.48)
248
LINEAR ALGEBRA
we can write Equation (5.47) as
-
v =Sv‘,
(5.49)
where v and v’ are the column matrices
(5.50)
and S is the transpose of S. We now write Equation (5.47) explicitly as
+ Slza: +
SllQ’l
s l , C u :
s 2 1 4 s22a;
+ . . + Snla:, = + . . . + Sn2Q:, = ‘
Q1,
Q2,
+ s 2 , a ; + . . . + snna:,= a,.
(5.51)
When v = 0, that is,
the above system of linear equations [Eq. (5.51)] is homogeneous, hence the only solution that it has is the trivial solution:
v‘ = 0
(5.53)
or
s
This means that the determinant of is different from zero. Remembering that for a square matrix the determinant of S is equal t o the determinant of 3, we conclude that both S and 3 are invertible, hence we can write
-
(5.55)
v’=S - v.
We remind the reader that v‘ and v are essentially the same vector in V. They are just different representations of the same vector in terms of the primed, B’, and the unprimed, B, bases, respectively [Eqs. (5.42) and (5.46)]. Note that if we prefer to write Equation (5.40) as = Sjivj,Equation (5.49) becomes v = Sv’.
c,”=,
249
LINEAR TRANSFORMATIONS
5.4
LINEAR TRANSFORMATIONS
Linear transformations,which are also called linear operators, help us to relate the elements of two vector spaces defined over the same field. A linear transformation, T, is defined as a function that transforms the elements of one vector space, V, into the elements of another, W , which are both defined over the field K and such that
+ Pv) = aT(u)+ P T ( V )
T(au
for all u , v in V and for all scalars
(5.56)
a , P in K .
Example 5.6. Space of polynomials: Consider the differential operator d T = - acting on the space, V, of polynomials. Given a polynomial
dx
f ( x ) of order n :
f ( x )= a0
+ a15 + a252 + . . . + anxn,
(5.57)
the action of T on f ( x ) is to produce another polynomial of order n - 1 as d -f(x)
dx
= a1
+ 2a2x + . . . + na"xn-1.
(5.58)
It is easy t o check that T is a linear transformation from V into V
Example 5.7. Linear transformations: Consider the matrices all
a12
A=[ am1
am2
...
'.:
'i'
) , x =
' . . amn
with elements in the field K . The function T defined by the equation
T ( z )= AX
(5.60)
is a linear transformation from the (nx 1)-tuple space K" to the ( mx 1)tuple space K".
Example 5.8. Linear Transformations: Let V be the space of continuous functions defined over the field of real numbers R.The transformation defined as rx
(5.61) is a linear transformation from V into V , where f ( x ) is an element of V. Linearity of the transformation follows from the properties of the Riemann integral.
250
LINEAR ALGEBRA
An important property of linear transformations is that they preserve linear combinations, that is, if u1, u2,. . . , u, are vectors in V, then
We now state an important theorem: Theorem 5.1. In a given finite-dimensional vector space, V, defined over the field K , let the basis vectors be {Q, v2,.. . , v,}. In another vector space, W , defined over the same field, K , let { w l ,w 2 , . . . , w,} be any set of vectors. Then, there is precisely one linear transformation, T , from V into W such that T ( v i )= W 2, -
i = 1, . . . , n .
(5.63)
The proof of this theorem can be found in Hoffman and Kunze. Its importance is in formally stating the central role that linear transformations play among many possible transformations from V into W.
5.5 M A TRIX REP RESENT A T I0N 0F TRANS FOR M A TI0NS Consider an n-dimensional vector space, V, over the field K with the basis Bv = ( ~ 1 , 2 1 2 , .. . , v,}. Similarly, let W be an m-dimensional vector space over the same field K with the basis Bw = { W I , w2,. . . , w,}. If T is a given linear transformation from V into W over the field K , then the effect of T on a vector of V will be to convert it into a vector in W. In other words, the transformed vector, T v , can be expressed uniquely as a linear combination of the basis vectors of W. Similarly, each one of the transformed basis vectors, T v i , can be uniquely expressed as the linear combination ...
T v= ~
C
Aijwi
(5.64)
i=l
in terms of the basis vectors { w l ,w2,. . . , w,} , where the scalars Aij correspond to the components of Tvj in the W space in terms of the basis Bw. In other words, the m x n matrix, A i j , i = 1,.. . ,m, j = I , . . . , n, uniquely defines the effect of T on the vectors of V.Hence it is called the transformation matrix of T with respect to the bases Bv and Bw. Consider an arbitrary vector PI in V, which we write in terms of the basis Bv as 'u
= QlVl
c
+
Q2V2
+ . . . + a,v,
(5.65)
n.
=
ajvj.
j=1
(5.66)
MATRIX REPRESENTATION OF TRANSFORMATIONS
251
If we act on v by T , we obtain n
T~ =
T C ~ ~ U ~
(5.67)
j=1
n
=
Caj(Tvj).
(5.68)
j=l
Using Equation (5.64), we write this as n
m
(5.69)
(5.70) In other words, n
pi
=CAijaj
(5.71)
j=l
are the components, pi, i = 1 , 2 , . . . m , of T v in terms of the basis Bw of the space W. Using the matrix representations of v, w, and A:
(5.72)
(5.73)
we can write Equation (5.71) as w = Av.
(5.74)
We now summarize this result formally as a theorem: Theorem 5.2. Let V be an n-dimensional vector space over the field K with the basis vectors Bv = { v l ,v2, . . . , vn} and let W be an m-dimensional vector space over the same field with the basis vectors Bw = { w ~~ ,2 , ... ,w,}. For each linear transformation, T , from V into W, we can write an m x n matrix, A, with the entries in the field K such that
[TvIBw = Av = A [ u ] B ~ , ,
(5.75)
252
LINEAR ALGEBRA
where v is any element in V . Furthermore, the transformation from T + A is a one-to-one correspondence between the set of all linear transformations from V into W and the set of all rn x n matrices over the field K . We call the matrix A the transformation matrix of T with respect t o the bases Bv and Bw . To make this dependence explicit, we write the matrix that represents T as
We have written the subscripts as B w B v , since the row dimension is determined by W and the column dimension is determined by V.
5.6
ALGEBRA OF T R A N S F O R M A T I O N S
Let T and U be two linear transformations from V into W , where V is a vector space of dimension n and W is a vector space of dimension m, both of which are defined over the field K . Let A and B be the transformation matrices of T and U with respect to the bases Bv and B w , respectively. If P is the transformation written as the linear combination
P
=c
+
(5.77)
~ Tc ~ U ,
where c1 and c2 are scalars in field K , the transformation matrix of P with respect to the bases Bv and Bw is the same linear combination of the transformation matrices of T and U with respect to the same bases: [PIBwBv = 1 ' [TIBwBv
+ 2'
['IBwBv
.
(5.78)
For the proof we first write rn
(5.79) i=l
m
(5.80) i=l
where vj belongs to the basis Bv = {w1,v2,. . . , v,} and wj belongs to Bw {wl, w2,. . . , w,}. We then write Pvj = ( C l T
+ ~ 2 U ) v =j cl(Tvj) + ~ z ( U v j )
=
(5.81) (5.82)
m
(5.83)
ALGEBRA OF TRANSFORMATIONS
253
thus obtaining
+
[P]Bv.BL = CIA%?c ~ B , , ,i = I,.. . ,VL,j = 1,.. . ,TL.
(5.84)
Let us now consider the product of transformations, given three finitediniensional vector spaces, V ,W , and 2,defined over the field K. Let T be a linear transformation from V into W and let U be a linear transformation from W into 2.Also let Bv = ( u l , u 2 , . . . , u n } , Bw = (w1, w2,. . . , w n L } ,and BZ = ( ~ 1 ~ ~ . 2. ,, z .P } be the bases for the spaces V,W , and 2,respectively. We can write ( U T ) ( V j )= U ( T ? / j ) =
U
C
(5.85) (5.86)
Akjwk
m
(5.87) k=l m
/ P
k=l
\i=l
(5.88) w
/ m.
/ \
(5.89) where A k 3 , k = 1, . . . , m, j = 1, . . . , n, is the transformation matrix of T with respect to the bases Bv and B w , and B l . k , a = 1 , .. . , p , k = 1 , . . . , m, is the transformation matrix of U with respect to the bases Bw and B z . In other words, the matrix of the product transformation, U T , [ U T I B ~ B= ~ ['IBzBw
[TIBwBv
1
(5.90)
is the product of the transformation matrices of U and T. When T and U are two linear transformations in the same space, V , with respect to the basis Bv,we write
[UTIBv = [UlBv [TIBV '
(5.91)
The inverse transformation is defined as
[T-'TIBv
=
[TT-'IBv = I.
(5.92)
Using equation (5.90) we can conclude that (5.93) (5.94)
254
LINEAR ALGEBRA
That, is, the matrix of the inverse transformation is the inverse matrix of the matrix of the transformation. The one-to-one correspondence that Bv establishes between transformations and matrices guarantees that a linear transformation is invertible, if and only if the transformation matrix is invertible, that is, nonsingular:
5.7
CHANGE OF BASIS
We have seen that the matrix representation of a given transformation depends on thc bases used. Since there are infinitely many possible bases for a given n-dimensional vector space, we would like to find how the matrix elements change under a change of bases. Let T be a given linear transformation or an operator in n-dimensional vector space V and let Bv = {ul,vz,. . . ,vn} and BC = {ui,ui,. . . , u h } be two possible sets of bases for V. We need a relation between the matrices
[TIBVand [TIB;
(5.96)
'
Let S be the unique n x n matrix, Si3, i = 1 , 2 , . . . , n, j = 1 , 2 , . . . , n, relating the coinponents of a vector u in V in terms of the two bases as
bIBv = s 1 4 3 : ,
(5.97)
where Q1
Qn
By definition, for the linear transformation T we can write PIBv =
(5.99)
[TIBV[ 4 B V.
Applying Equation (5.97) to the vector Tv,we obtain [T~lBv = s [7%;
(5.100)
,
which, when substituted in Equation (5.99), gives [TIBv I.[ Bv
=
s [Tvl B; .
(5.101)
We now substitute Equation (5.97) into the left-hand side of the above equation to write [TIB"
s b1B;
=
s [T7JI,;
.
(5.102)
CHANGE OF BASIS
255
Multiplying both sides by the inverse S-l, we obtain
S-l
s [ u ] B ; = S-lS [ T u ] B ; ,
[T]BV
which we write as [TulB(,
'>
('-'
=
[TIB~
['IB;
'
(5.103)
(5.104)
Comparing with the corresponding equation [Eq. (5.99)] written in the BC basis, = fT1B; ['IB;
iTu1B;
,
(5.105)
we obtain the expression for the transformation matrix of T in the BL basis, [TIB;,in terms of [TIBVas
[TIB;= s-l [TIBVs.
(5.106)
Equation (5.97) means that the components of u in the bases Bv and BL are related as n
Qi =
csija;. j=1
In terms of the basis B v , u is written as u = we can write it in the basis BL as
(5.107)
ciaiui. Using Equation (5.107)
In other words, the transpose of the n x n matrix S relates the two sets of basis vectors as
c n
sijua = u;.
(5.109)
i=l
If two n x n matrices, A and B , defined over a field K , can be related by an invertible n x n matrix S over K as
B = S-lAS,
(5.110)
we say that B is similar to A over K . In conjunction with our result in Equation (5.106), when we say [TIB; is similar t o [TIBVmeans that on each n-dimensional vector space V over K , the two matrices, [TIBVand [TIB;, represent the same transformation or operator in terms of two different bases, Bv and BG, defined in V. Note that if B is similar to A, then A is similar to B through
A = SBS1.
(5.111)
256
5.8
LINEAR ALGEBRA
INVARIANTS UNDER SIMILARITY TRANSFORMATIONS
Under similarity transformations, the determinant and the trace of a matrix remains unchanged. If A and B are two similar matrices, A = SBS-l, then their determinants are equal. The proof follows from the properties of determinants: det A = det (SBS-I) = detSdetBdetS-l.
Since det S-l
=
(5.112) (5.113)
1/ det S, we get
det A = det B.
(5.114)
If A and B are two similar matrices, then their traces are equal: n.
trB =
(5.115)
[Ellii i=l n
=
C [S-'AS] i=l n
n
zz ..
(5.116)
n
(5.117)
(5.118) (5.119) j=1 k = l n
n
(5.120) j=1 k = l
n
(5.121) k=l
5.9
EIGENVALUES A N D EIGENVECTORS
We have seen that matrix representations of linear operators depend on the bases used. Since we have also established the fact that two different representations of a given operator are related by a similarity transformation, we are ready to search for a basis that presents the greatest advantage. Since diagonal matrices are the simplest matrices, whose rank and determinant can be read at a glance, our aim is to find a basis in which a given linear operator, T , is represented by a diagonal matrix. The question that needs to be
EIGENVALUES AND EIGENVECTORS
257
answered is, Can we always represent a linear operator by a diagonal matrix? If the answer is yes, then how do we find such a basis? Since in a given basis, B = ( u 1 , v2,. . . , en}, the matrix representation of T is diagonal:
(5.122)
if and only if n
n
j=1
j=1
(5.123) we start by searching vectors u that are sent to multiples of themselves by T . Definition 5.3. Let T be a linear operator on a vector space V defined over the field K . An eigenvalue, also called the characteristic value, is a scalar, A, such that there is a nonzero vector v in V with
T v = Xu,
(5.124)
where v is called the eigenvector of T corresponding t o the eigenvalue A. In an n-dimensional vector space a linear operator is represented by an n x n matrix, A, hence we concentrate on determining the eigenvalues and the eigenvectors of a given square matrix. We can write the eigenvalue equation (5.124) as the matrix equation
(A - AI)v = 0,
(5.125)
where A = A i j , i, j = 1, . . . , n is an n x n matrix. Eigenvector v, corresponding t o the eigenvalue A, is represented by the n x 1 column matrix
V =
(I:),
(5.126)
an where ai are the components. The n x n identity matrix is written as I. When Equation (5.125) is written explicitly, we obtain a linear system of homogeneous equations:
(5.127)
258
LINEAR ALGEBRA
IA - XI1
=
(All - A )
A12
...
A21
(A22 - A)
...
Al, A27l
An1
An2
...
(Ann. - A)
S-lAS = B,
= 0.
(5.128)
(5.130)
we can write d e t ( B - vI) = det(S-lAS
vI)
(5.131)
S-lvIS)
(5.132)
v1)S)
(5.133)
d e t ( A - vI) det S
(5.134)
-
= det(SplAS = det(S-'(A = det S-'
-
= d e t ( A - vI),
(5.135)
thereby proving that A and B have the same characteristic equation, thus the same eigenvalues. We now write the matrix equation [Eq. (5.129)] as (5.136) where a j k is the j t h component of the kth eigenvector. Consider the n x n matrix, s, columns of which are the eigenvectors, v k , k = 1 , 2 , . . . , n, as (5.137)
EIGENVALUES AND EIGENVECTORS
259
where
(5.138)
If the eigenvectors are linearly independent, then det S #O.
(5.139)
Hence the inverse of S exists. We can now write Equation (5.136) as n
(5.140) j=1
(5.141) =cSiiDlk:, i , k = l , ... ,n,
(5.142)
z=1
where we have introduced the diagonal matrix
Dlk
as
(5.143)
We can also write Equation (5.142) as
AS = SD,
(5.144)
which, after multiplying both sides by the inverse S-l, becomes
S-IAS
S-lSD = D.
=
(5.145) (5.146)
In othcr words, the matrix S, columns of which are the eigenvectors of A , diagorializes A by the similarity transformation
S I A S = D.
(5.147)
We now express these results formally in terms of the following theorems: Theorem 5.4. Let V be an n-dimensional vector space defined over the field K and let A be a linear operator or transformation from V into V.
260
LINEAR ALGEBRA
Let 211, u 2 , . . . ,v, be the eigerivectors of A corresponding to the eigenvalues X I , XI,. . . ,A, respectively. If the eigenvalues are distinct,
Xi
# Xj,
when i
#j,
(5.148)
then the corresponding eigenvectors, v1, v2, . . . , v,, are linearly independent and span V. Theorem 5.5. Let V be an n-dimensional vector space over the field K and let A be a linear operator from V into V. Assume that there exists a basis B = {vI,v2,. . . , v,} that spans V consisting of the eigenvectors of A with the eigenvalues A1, XI,. . . , A,, respectively, then the matrix of A with respect to this basis is the diagonal matrix
(5.149)
Example 5.9. Characteristic equation and the eigenvalues: Consider the matrix
;1) ,
A = ( ; 1; 0
(5.150)
l1
(1-A)
det(A-XI)
=
0
0 (1- A ) 0
1 0
(5.151)
(1- A)
Thus the roots of the characteristic equation gives three distinct real roots: A1 = 0,
A2 =
1,
A3
= 2.
(5.156)
Example 5.10. Characteristic equation and the eigenvalues: Consider
A = ( -2
') ' 0
(5.157)
261
EIGENVALUES AND EIGENVECTORS
where the characteristic equation is (5.158)
(1-A)
fi
det(A-XI) =
0
Jz ( 0 - A) 0
0 0 (0-A)
(5.160)
A1 = 0, A1 = 2, A1 = -1.
(5.166)
We now find the eigenvectors one by one, by using the eigenvalue equation
For A1 = 0 this gives
(#
J z o 0
0 ) ( 2 ) = 0 (
2),
(5.168)
which leads to the equations to be solved for the components as (5.169) (5.170) (5.171)
262
LINEAR ALGEBRA
The last equation leaves the third component arbitrary. Hence we take it as
where c1 is any constant. The first two equations determine the remaining components as a11 = a21
thus giving the first eigenvector as
= 0,
(5.173)
8)
v1 = c 1 (
(5.174)
Similarly, the other eigenvectors are found. For
A2
= 2 we write
(5.175) (5.176) (5.177) (5.178)
and obtain the second eigenvector as (5.179) (5.180)
where
c2
is an arbitrary constant. For
A3 =
-1 we write
(5.181) a13
f h a 2 3 = -a13,
ha13
+
0a23 = -a23,
0=
-a33
(5.182) (5.183) (5.184)
and obtain the third eigenvector as
v3 = c'3
():-
1
,
c3
# 0,
(5.185)
263
EIGENVALUES AND EIGENVECTORS
where c3 is an arbitrary constant. For the time being, we leave these constants in the eigenvectors arbitrary. Using these eigenvectors, we construct the transformation matrix S as (5.186)
Since the determinant of S is nonzero: det S = - 3 C l C 2 C g
# 0,
(5.188)
the inverse transformation, S p l , exists and its components can be found by using the formula (5.189) where S ( j l i ) is the minor obtained by deleting the j t h row and the i t h column. Note that the order of the indices in det S ( j 1 i ) are reversed; hence we first write the transpose of S as
0 (5.190) c3
-fie3
0
and then construct the inverse by finding the minors one by one as
1 s-'= det S
0
0
1
-
C1
(5.191)
264
LINEAR ALGEBRA
We can easily check that S-lS = I :
1 c1
0
0
-
0
4c2
c3
(5.192) 0
( ;; ) 1 0 0
=
cl
=s-ls.
(5.193)
We finally construct the transformed matrix
A'= S-lAS
(5.194)
as
0
0
-
1 .
C1
A'
=
0
0
-
1
c1 0 2 2c2 ac2
0
0
0o
a ) = ( 0 02 0
0
0 0
) ,
-1
(5.195) which is in diagonal form with the diagonal elements being equal to the eigenvalues:
(5.196) (5.197) (5.198)
MOMENT OF INERTIA TENSOR
5.10
265
M O M E N T OF INERTIA TENSOR
In rotation problems we can view the moment of inertia tensor, I, as an operator or transformation in the equation +
L = 13,
(5.199)
+
which relates the angular momentum, L , and the angular velocity, Ti?, vectors. Moment of inertia tensor is represented by the n x n matrix (5.200) where p ( r ) is the mass density and ri, i = 1 , 2 , 3 , stand for the Cartesian + components of the position vector r . The angular momentum, L , and the angular velocity, 3, vectors are represented by the column matrices
.=( Ei) 5). ancia=(
(5.201)
We can write the transformation equation [Eq. (5.199)] as
c 3
Lz =
Iij wj,
(5.202)
j=1
which, when written explicitly, becomes
+Ixywy +Ixzwz, L y = Iyzwx + I y y w y + I y z w z , L z = Izzwx + I z y w y + J z z w z , Lx
= Ixxwx
(5.203) (5.204) (5.205)
It is desirable to orient the Cartesian axes so that in terms of the new coordinates the moment of inertia tensor, 1’, is represented by the diagonal matrix
I =
(5.206)
0
0
I3
where 11,I,, and 1 3 are called the principal moments of inertia. Directions of the new axes denoted by the subscripts 1 , 2 , and 3 are called the principal directions of the object and the corresponding Cartesian coordinate system is called the principal coordinates. In the principal coordinates, Equations (5.203)-(5.205) simplify to (5.207) (5.208) (5.209)
266
LINEAR ALGEBRA
Figure 5.1
Moment of inertia tensor of a flat uniform triangular mass distribution.
whcre L1, Lz, L3 and wl,w2, w3 are the components of the angular momentum and the angular velocity along the principal axes, respectively. Finding the principal directions, which always exist, and the corresponding transformation matrix requires the solution of an eigenvalue problem for the moment of inertia tensor. This is demonstrated in the following example:
Exercise 5.12. Moment of inertia tensor: Let us now consider the moment of inertia tensor of a uniform flat rigid body with the density B and in the shape of a 45" right triangle as shown in Figure 5.1. Components of the moment of inertia tensor [Eq. (5.200)] are evaluated as follows: Since r2 = x 2 y2, we first find I,, as
+
1"1 lala-,
(5.211)
x ) 3 dx
(5.212)
a-x
I,, =
u ( r 2- x2)dydx
=0
=
I"(.
-
- 3a2x
= =
y2 dydx
u -(a4 3
-
+ 3ax2 - x3) dx
a2 a3 3a - + 3a2 3
-
a4 -1 4
a4 12
= u-.
(5.210)
(5.213) (5.214) ( 5 . 215)
Since the mass, M , of the object is M = cra2/2, we write I,, = M a 2 / 6 . Similarly, we obtain the other diagonal terms as
Ma2 Ma2 I,, = 6 I, zz = 3 .
(5.216)
MOMENT OF INERTIA TENSOR
267
For the off-diagonal terms, we find
Jo” 1 -gla la-x a-x
I,,
uxy dydx
= I,, = -
xy dydx
a2
dx
-
(5.2 17) (5.2 18) (5.2 19) (5.220)
-
Ma2 12 ’ I,, = I,, = 0, I,, = I,, = 0, - --
(5.221) (5.222)
thus obtaining the complete moment of inertia tensor as
Ma2 -
Ma2 12
--
6
Ma2 -
Ma2 12
I=
--
\
(5.223)
6
0
0
Ma2 3
The principal moments of inertia are found by solving the characteristic equation:
(5.224)
(5.225)
L
(5.226)
268
LINEAR ALGEBRA
which yields the principal moments of inertia as Ma2 Ma2 Ma2 , I3=(5.227) = -, I 2 = 4 12 . Orientation of the principal axes, which are along the eigenvectors, are found as follows: For the principle value 11 = we write the eigenvalue equation as 11
F,
1/2 3
-1/4
-1/4 0 1/2 0
0 1
)( )
=
MU2 3
( ::: )
,
(5.228)
a3 1
which gives
Ma2 all MU2 all 12
--
Ma2
Ma2 3 Ma2
-a l l ,
(5.229)
-a21 =
-a21,
(5.230)
Mu2
Ma2
-
12 a21 = -
+
Ma2
6
3 a 3 1
= -a 3 1 .
(5.231)
Thc first two equations reduce to a21 =
-2a11,
(5.232)
=
--all,
1 2
(5.233)
= a21 = 0.
(5.234)
a21
which cannot be satisfied unless a11
The third equation [Eq. (5.231)] gives the only nonzero component of the first eigenvector, a31 = c1, thus yielding v1=.1(;),
(5.235)
where c1 is any constant different from zero. Similarly, the other eigenvectors are found as
Again the constants c2 and c3 are arbitrary and different from zero. We now construct the transformation matrix S as (5.237)
(5.238)
MOMENT OF INERTIA TENSOR
269
Since det S = 2 c l c z c ~# 0, the inverse exists and is found by using the formula
(5.239)
where S ( j l i ) is the minor obtained by deleting the j t h row and the i t h column. This yields the inverse as
f o
0
-
1
c1
(5.240)
The inverse can be checked easily as
0
0
-
1
C1
1
-
2c2
l 2c2
o
1 -
1 -
2c3
2c3
0
--
( ; ; ;) 1 0 0
=
=ss-l.
(5.241)
270
LINEAR ALGEBRA
:I
In terms of the new basis vectors, ( v I , v ~ , v ~ we) ,can now write the moment of inertia tensor as
0
1
-
0
1 Ma2 S-lIS
3 0
=
\
5.11
0
0 Ma2 4 0
0 I2 0
:).
4
(5.244)
INNER P R O D U C T SPACES
So far our discussion of vector spaces was rather abstract with limited potential for applications. We now introduce the missing element, that is, the multiplication of vectors with vectors, which is called the inner product. This added richness allows us to define magnitude of vectors, distances, and angles and also determine the matrix representations of linear transformations. We will also be able to evaluate the proportionality constants, which were left undetermined in eigenvector calculations [Eqs. (5.174), (5.180), and (5.185) and Eqs. (5.235) and (5.236)] by normalizing their magnitudes to unity.
THE INNER PRODUCT
5.12
271
T H E INNER PRODUCT
For ordinary vectors in three-dimensional real space, the scalar product is defined as
(5.245) where d and
are two vectors given in terms of their Cartesian components:
The magnitude, a , of a vector d is found as
and the angle between two vectors, d and
7, is defined as (5.248)
We have seen that in terms of matrices, vectors can be written as column matrices, which we denote by boldface characters:
(5.249) Using the transpose, 6, we can write the scalar product of a with itself as
3
=
C aiai.
(5.251)
i=l
Similarly, the scalar product of two vectors,
3 and -b+, .is defined as (5.252)
3
=
C aibi. i=l
(5.253)
272
LINEAR ALGEBRA
Note that the scalar product is symmetric, that is,
(5.254)
(5.2 55) Generalization to n dimensions is simply accomplished by letting the sums run from 0 to 71. For a given abstract n-dimensional vector space, V , defined over the field K. we have already represented vectors, v, as column matrices:
(5.256)
where a; stands for the coefficients in the linear combination = Q12’1
+ a2u2 + . . . + cr,vn,
(5.257)
in terms of the basis
B = { v 1 , v 2 , . . . ,v,}.
(5.258)
We now introduce the inner product for abstract vector spaces as n
i=1
whcre
2’
and
UI
belong to V with the components
(5.260)
Wc can also write the inner product [Eq. (5.259)] in the following equivalent ways:
( v , w ) = vw = wv.
(5.261) (5.262)
The mgle between u and w is now defined as
(5.263)
THE INNER PRODUCT
273
where (v,u) and (w, w) stand for the magnitude squares, luI2 and lwI2 , respect ively. This definition of the inner product works fine for vector fields defined over the real field R.For vector fields defined over the complex field, @, it presents problems. For example, consider the one-dimensional vector v = za, its magnitude is
Iu1 = (ia, ia)l/2
(5.264)
= (-a2)1'2,
which is imaginary for real a. Since the inner product represents lengths or distances, it has to be real, hence this is not acceptable. However, there is a simple cure. We simply modify the definition of the inner product defined over the complex field @ as n
(5.265) i=l
where the asterisk indicates that the complex conjugate has to be taken. With this definition, the magnitude, Iv(,of a vector defined over the complex field becomes '*I
1/2
Ivl = ( v , v ) 1 / 2 =
&[+z]
i=l
=
[&$]
1/2
(5.266)
i=l
Since lail 2 0, the magnitude is always real. It is important t o keep in mind that for vector fields defined over the complex field the inner product is not symmetric: 2
# (w,u).
(5.267)
( v , w ) = (w,u)*
(5.268)
(u,w) However, the following is true:
Definition 5.4. For a given a vector field, V, defined over the real field,
R,or the complex field, @, an inner product is a rule that associates a
scalar-valued function t o any ordered pairs of vectors, v and w, in V such that (1)
(5.269)
(5.270) where u , u , and w are vectors in V
274
LINEAR ALGEBRA
(111) If a is a scalar in the underlying field K , then
(aw, w)= a*(v, w),
(5.271)
(v,QW)
(5.272)
= a ( v ,w),
ti and w are vectors in V. (IV) For any u in V,we have (v,u ) 2 0 and (v,u ) = 0 if and only if v = 0. The scalar (v(= ( v , v ) ' / ~is called the norm or the magnitude of v.
where
A vector space with an inner product definition is called an inner product space. In the above definition, if the underlying field is real, the complex conjugation becomes superfluous. A Euclidean space is a real vector space with an inner product, which is also called the dot or the scalar product. An inner product space defined over the complex field C is called a unitary space. Example 5.13. Definition of inner product: One can easily show that the set of all continuous functions defined over the complex field C and in the closed interval [0,1] forms a vector space V. In this space we can define an inner product as
(f(z), d z ) )= where
Jo
1
f * ( x ) d x )dx1
(5.273)
f ( ~ and ) g(z) are complex-valued functions of the real argument
3..
5.13
ORTHOGONALITY A N D COMPLETENESS
After we introduced the concepts like distance, magnitudelnorm, and angle, applications to physics becomes easier. Among the remaining central concepts that are needed for applications are the orthogonality and the completeness of sets of vectors that form a vector space. We say that two vectors, v and ui, are orthogonal, if and only if their inner product vanishes:
(v,w)
= 0.
(5.274)
Note that the condition of orthogonality is symmetric, that is, if (v,w) = 0, then ( w , v ) = 0. For ordinary vectors, orthogonality implies the two vectors being perpendicular to each other. Equation (5.274) extends the concept of orthogonality to abstract vector spaces. whether they are finite- or infinitedimensional. A set of vectors {vl,u2,.. . , vTL} is said t o be orthonormal if for all i and j , (vz,213)
= &,
(5.275)
holds. In a finite-dimensional vector space an orthonormal set is complete, if every vector v in V can be expressed as a linear combination of the vectors in
ORTHOGONALITY AND COMPLETENESS
the set. A set of vectors if the equation
(v1, v2,
el211
275
. . . ,v,} is said to be linearly independent
+ c2v2 + . . . + c,v,
(5.276)
= 0,
where c1, c2,. . . , c, are scalars, cannot be satisfied unless all the coefficients are zero: c1 = c2 = . . . = c, = 0. To obtain a formal expression for the criteria of linear independence, we form the inner products of Equation (5.276) by v l , v 2 , . . . , v, and use the linearity of the inner product to write
=o,
~ 1 ( ~ 1 , ~ 1 ) + ~ 2 ( ~ 1 , ~ 2 ) + ' ~ ~ + ~ , ( ~ 1 , ~ , )
+...+c,(m,v,)
c1(w,v1) +C2('U2,Q)
= 0,
This gives a set of n linear equations to be solved for the coefficients, c1, c2, . . . , c,, simultaneously. Unless the determinant of the coefficients vanishes, these equations do not have a solution besides the trivial solution, that is, c1 = c2 = . . . = c, = 0. Hence, we can write the condition of linear independence f o r t h e s e t (v1,v2, . . . ,v,} as
The determinant G is called the Gramian. For an orthonormal set in n dimensions the Gramian reduces to 1 0 ... 0 1 '..
G=
.. .
0 0
...
..
. ..
0 0
."
1
,
= 1.
(5.279)
Hence an orthonormal set is linearly independent. For a given orthonormal set, ( q ,7 1 2 , . . . , v,}, in an n-dimensional vector space, the following statements are equivalent: 1. The set (v1, 212,. . . , v,} is complete. 2. If (wi,v) = 0 for all i, then v = 0. 3 . The set (v1, v 2 , . . . , v,} spans V. 4. If v belongs to V, then n
v
=
ccivi,
(5.280)
i=l
where ci = ( u i , v ) are called the components of v with respect to the basis B = ( ~ 1 , 0 2 , .. . ,u,}.
276
LINEAR ALGEBRA
5.14 G R A M -S CHMIDT 0R T HOGO NA LIZ A T I0N It is often advantageous to work with an orthonormal set of n linearly independent vectors. Given a set of linearly independent vectors, { 211, 212, . . . ,v,}, we can always construct an orthonormal set. We start with any one of the vectors in the set, say 211, call it w1 = 211, and normalize it as
(5.281) where l(wl) = (w1, w1)1/2 is the norm of w1. Next we choose another element from the original set, say 212, and subtract a constant, c, times Z?l from it to write
We now determine c such that
h
(5.282)
eel.
w2
= 212
w2
is orthogonal to
-
(21,(212 - cZ?~)) = (21, 212)
A
-
Z?1 : h
c(e1, el) = 0.
(5.283)
Since (21, 21) = 1, this gives c as
(5.284)
c = (Z?1,vz). Hence
w2
becomes w2 = 212
We now normalize
w2
-
(&, v2)el. h
(5.285)
to obtain the second member of the orthonormal set as
(5.286) where
(5.287) We continue the process with a third vector from the original set, say write A
w3 = 213 - clel - c2e2.
213,
and
(5.288)
Requiring w3 to be orthogonal to both 21and Z?2 gives us two equations to be solved simultaneously for c1 and c2, which yields the coefficients as c1 = (21,213) and c2 = (22,213). Again, the third orthonormal vector is given as
(5.289)
EIGENVALUE PROBLEM FOR REAL SYMMETRIC MATRICES
277
Continuing this process, we finally obtain the last where I(w3) = (w3, member of the orthonormal set, {Zl, &, . . . ,gn}, as
(5.290) where n- 1
w, = un
-
- - y ( E i , un)Zi
(5.29 1)
i=l
and
l ( w n )= (wn,wn)1/2.
(5.292)
This method is called the Gram-Schmidt orthogonalization procedure. 5.15
EIGENVALUE PROBLEM FOR REAL S Y M M E T R I C MATRICES
In many physically interesting cases linear operators or transformations are represented by real symmetric matrices. Consider the following eigenvalue problem
A v= ~ AVX,
(5.293)
where A is a symmetric n x n matrix with real components and vx is the n x 1 column matrix representing the eigenvector corresponding to the eigenvalue A. Eigenvalues are the roots of the characteristic equation (all
IA-AII =
-A)
a21
...
a12
(a22
-A)
...
(5.294)
which gives an nth-order polynomial in A. Even though the matrix A is real, roots of the characteristic equation could be complex, and in turn the corresponding eigenvectors could be complex. Consider two eigenvalues, X i and A j , and write the corresponding eigenvalue equations as Avi = X i v i ,
Avj
(5.295) (5.296)
= Ajvj .
We multiply the first equation from the left by
V3 and write (5.297)
278
LINEAR ALGEBRA
We now consider the second equation [Eq. (5.296)) and take its transpose, and then we take its complex conjugate to write
-
v!A* = A*?* 3 3 3'
(5.298)
Since A is real and symmetric, A*= A, Equation (5.298) is also equal to
?*A = A*v* 3 3 3'
(5.299)
Multiplying Equation (5.299) with vi from the right, we obtain another equatioii:
v,*Avi= X?Z;*vi. 3 3
(5.300)
Subtracting Equation (5.297) from Equation (5.300), we obtain
0 = (A*3 - xz)v;Vz,
(5.30 1)
which leads us to the following conclusions: (I) When j = i, the expression Vfvi = ( u i , u i ) = IviI2 is the square of the norm of the i t h eigenvector, which is always positive and different from zero, hence we obtain
xg = xi.
(5.302)
That is, the eigenvalues are real. In fact, this important property of real and symmetric matrices was openly displayed in Examples 5.9-5.12. (11) When j # i and when the eigenvalues are distinct, X j # Xi, Equation (5.301) implies 3;;y =
(7JjpJZ)
= 0.
(5.303)
In other words, the eigenvectors corresponding t o the distinct eigenvalues are ort hog orial. (111) When i # j but X i = X j , that is, when the characteristic equation has multiple roots, for the root with the multiplicity s, s < n, there always exist s linmrly independent eigenvectors (Hildebrandt). We should make a note that t,his statement about multiple roots does not in general hold for nonsymmetric matrices. Eigenvalues corresponding to multiple roots are called degenerate.
5.16
PRESENCE OF DEGENERATE EIGENVALUES
To demonstrate how one handles cases with degenerate eigenvalues, we use an example. Consider an operator represented by the following real and symmetric matrix in a 3-dimensional real inner product space:
1 1 1
A = (
i).
(5.304)
PRESENCE OF DEGENERATE EIGENVALUES
279
We write the characteristic equation as (1-A)
JA-A11 =
1 1
1 (1 - A ) 1
1 1 (1 - A )
(5.305) (5.306)
which has the roots A1 = A2
= 0 and
A3 =
3.
We first find the eigenvector corresponding to the multiple root, by writing the corresponding eigenvalue equation as 1 1 1
( 11 1 1 ) ( 2 ; ) = 0 (
;;;),
(5.307) A1
= A 2 = 0,
(5.308)
which gives a single equation:
Hence we can solve only for one of the components, say a l l , in terms of the remaining two, a21 and a31, as = -a21
- U31.
(5.310)
Since a21 and a31 are not fixed, we are free to choose them a t will. For one of the eigenvectors we choose
which gives a l l = -c1, thus obtaining the first eigenvector as
v1=
( jl)
=c1(
jl).
(5.312)
(5.313)
For the second eigenvector corresponding to the degenerate eigenvalue, Xl,a 0. we choose
=
280
LINEAR ALGEBRA
which gives a l l = -cz, thus yielding the second and linearly independent eigerivector as
(5.315)
(5.316) At this point, aside from the fact that the eigenvectors look relatively simple, there is no reason for making these choices. Any other choice would be equally good as long as the two eigenvectors are not constant multiples of each other. Finally, for the third eigenvalue, A 3 = 3, we write
(5.317) (5.318) (5.319) (5.320) which implies a13 = a23 = a33 = c3, c3
This yields
v3
# 0.
(5.321)
up to an arbitrary constant, c g , as v3=c3(
1).
(5.322)
Linear independence of the eigenvectors, (v1,v 2 , v3) , can be checked by showing that the Gramian is different from zero, that is,
G = clczc3
1
-1
-1 1 0
1 1 1
1
=
-3clc~cg # 0.
(5.323)
We now construct the transformation matrix S as
(5.324)
(5.325)
PRESENCE OF DEGENERATE EIGENVALUES
281
Since the determinant of S, det S = -3clc2cg # 0, is different from zero, the inverse transformation matrix exists and can be found by using the formula
(5.326) where det S ( j l i ) is the minor obtained by deleting the j t h row and the i t h column. Notice that the indices in det S ( j l i ) are reversed. We find S-' as
s-1 =
(
2/3Ci
-1/3Ci
-1/3Cl
-1/3C2
-1/3C2
2/3C2
1/3c3
1/3~3
1/3~3
It can easily be checked that
1
.
ss-1 = s-1s = 1
(5.327)
(5.328)
and
S-lAS
=
(
0
0
) ( =
A2
A3
0 0 0
0 0 0 ) . 0 0 3
(5.329)
We now analyze the eigenvectors for this case more carefully. Using the definition of the inner product [Eq. (5.259)] it is seen that the two eigenvectors corresponding to the degenerate eigenvalues are not orthogonal, that is,
( w , m ) # 0,
(5.330)
However, the third eigenvector is orthogonal to both of them:
Since we picked two of the components of the eigenvectors corresponding t o the degenerate eigenvalue randomly, were we just extremely lucky to have them orthogonal to u3? If we look at the eigenvalue equation for the degenerate eigenvalues [Eq. (5.309)], X1,2 = 0, we see that we have only one equation for the three components, hence we can write the corresponding eigenvectors as
vx1,2
=
(
-a21
- a31
)
(5.332)
For reasons to be clear shortly, we introduce the constants el, c 2 , b, and c as
(5.333)
282
LINEAR ALGEBRA
and write
vx1.2
=
-c1(l+ b) - c2(l c2 clb c1 c2c
+ +
-(1
+ c) (5.334)
+ b)
-(I
+ c) (5.335)
In other words, the eigenvector, v ~ , ,for ~ the , doubly degenerate eigenvalue, X l , 2 = 0, can be written as the linear combination of two vectors vxl,s = C l W l
+ c2w2,
(5.336)
where
It can easily be checked that w1 and w2 satisfy the eigenvalue equations for the matrix A with the eigenvalue X = 0 [Eq. (5.309)],that is,
(5.338) (5.339) In general, any linear combination of eigenvectors belonging to the same eigenvalue is also an eigenvector with the same eigenvalue. The proof is simple. Let w1 and w2 be the eigenvectors of B with the eigenvalue A:
(5.340) (5.341) Then
B(cowi
+~
1
~ =2 B(cowi) )
+ B(ciw2)
= coBwl+ Q B W ~ = COXWl
+ ClXW2
= X(cow1
+ ClW2).
(5.342) (5.343) (5.344) (5.345)
The converse of this result is also true. If we can write an eigenvector, w, corresponding to the eigenvalue A,
BW= XW,
(5.346)
as the linear combination of two linearly independent vectors, w1 and w2, as
w = cow1
+
ClW2,
(5.347)
PRESENCE OF DEGENERATE EIGENVALUES
283
where both co and c1 are different from zero, then both w1 and w 2 are eigenvectors of B corresponding to the eigenvalue A. The proof is as follows:
+ +
+
B(cow1 C l W 2 ) = A ( C o W 1 C l W Z ) , c ~ B w c~~ B w = ~ coAwl+ c ~ A w ~ , c~(Bw Awl) ~ + c l ( B w 2 - A w ~ ) = 0.
(5.348) (5.349) (5.350)
Since in general co and c1 are different from zero, the only way to satisfy this equation for all co and c1 is to have
Bw~ = Awl, Bw= ~ Aw~,
(5.351) (5.352)
which completes the proof. As we stated earlier, for symmetric matrices of order n and for multiple roots of order s (s < n ) , there always exists s linearly independent eigenvectors. For the matrix under consideration [Eq. (5.304)],n = 3 and s = 2 for the degenerate eigenvalues A 1 , 2 = 0. Hence, we can take the two linearly independent eigenvectors as [Eq. (5.335)]: v1 = c,
b 1
,
v2 = c 2
(5.353)
where the scalars b and c are still arbitrary. In other words, there are infinitely many possibilities for the eigenvectors of the degenerate eigenvalue A 1 , 2 = 0. However, notice that all these vectors satisfy (5.354) (5.355) That is, they are all perpendicular to the remaining eigenvector, us,corresponding to A3 = 3. Using the freedom in the choice of the constants, b and c, we can also choose u1 and 212 as perpendicular: (Vl,V2)
= 0,
(5.356)
which gives a relation between b and c as (1
+ b )(1 + + b + c = 0, C)
+
1 2c b=-2+c
(5.357) (5.358)
Choosing c as 1, Equation (5.358) gives b = -1, thus obtaining the orthogonal set of eigenvectors of A as
284
LINEAR ALGEBRA
Figure 5.2
Eigenvectors corresponding to the degenerate eigenvalues.
In all the eigenvalue problems the eigenvectors are determined up to a multiplicative constant. This follows from the fact that any constant multiple of an eigerivector is also an eigenvector; that is, if
AV = XV, then
cyv, where cy
(5.360)
is a scalar, is also an eigenvector:
A(av) = X(cyv).
(5.361)
Having defined the inner product of two vectors, we can now fix the constants left arbitrary in the definition of the eigenvectors [Eq. (5.359)] by normalizing their norms to unity. Thus obtaining an a orthonormal set of eigenvectors as
Geometrically, the degeneracy can be understood from Figure 5.2, where all the vectors lying on the plane perpendicular t o the third eigenvector v3 are possible eigenvectors to XI,^ = 0. Now the transformation matrix S can be written as
(5.363) we can easily check that the inverse is given as
(5.364)
QUADRATIC FORMS
285
Note that the inverse transformation matrix is the transpose of S. In other words, S represents an orthogonal transformation.
5.17
QUADRATIC FORMS
Let A be an operator defined in an n-dimensional inner product space V over the field of real numbers R.Also let A be represented by a symmetric n x n matrix,
A = Aij, i , j = 1 , . . . , n ,
(5.365)
in terms of the basis vectors B = {q,v 2 , . . . , v,}. construct scalar quantities like
In this space we can
Q = GAv,
(5.366)
where v is a vector in V represented by the column matrix
V =
[
(5.367) ffn
If we write Q explicitly, we obtain a quadratic expression like
Such expressions are called quadratic forms, which are frequently encountered in applications. For example, the quadratic form constructed from the moment of inertia tensor [Eq. (5.200)] as
I
= GIG,
(5.370)
where G is the unit vector in the direction of the angular velocity, 8 = w f i , is called the moment of inertia (scalar). In terms of the moment of inertia, I, the kinetic energy:
T
=
1 -Iw’, 2
(5.371)
is written as the quadratic form
T = Izzw:
+ I y y w i + I,,w; + 2IzYw,wy + 2 I z Z w , ~ , + 21yzwyw,,
(5.372)
where w,, wy, w, are the components of the angular velocity in Cartesian coordinates. It is naturally desirable to orient the Cartesian axes so that the
286
LINEAR ALGEBRA
moment of inertia tensor is represented by a diagonal matrix, where the kinetic energy simplifies t o 1 1 1 T = -Ilw; - I Z W-I~w$. ~ (5.373) 2 2 2 In this equation 11,I,, 13 are the principal moments of inertia and w1, w2, w3 are the components of the angular momentum along the principal axes. This is naturally an eigenvalue problem, where we look for a new set of basis, B’ = {v;,v:, . . . , v;}, where A [Eq. (5.365)] is represented by a diagonal matrix. In Equation (5.97) we have written the transformation equation between two vectors, v and v’,as
+
v
+
= SV‘.
(5.374)
Since the inverse transformation exists, we can also write this as V’
=
s-lv.
(5.375)
For the new basis vectors we first solve the eigenvalue problem
Aw
= Xw
(5.376)
and find the orthogonal set of eigenvectors, w1, w2, . . . ,w,. Then by using these eigenvectors, we construct the new orthonormal basis, which also spans V as h
B’
= {Zl,Z2, . . .
,ZTL},
(5.377)
Aw,
i = 1 , 2 , . . . , n.
(5.378)
where ( Z t , Z J )= S,, and
-e, = 20,
= X,w,,
IWZI’
We have demonstrated for real and symmetric matrices that the eigenvectors corresponding to distinct eigenvalues are always orthogonal and for the eigenvectors corresponding to degenezte eigenvalues they can always be arranged as orthogonal. Hence, the set B’ can always be constructed. We can now write the n x n transformation matrix, S, as
s = ( ( isl where
( ) isi
)
(is2
)-( isn )).
(5.379)
is the n x 1 column matrix representation of the eigenvector
2i. Using its transpose,
(5.380)
QUADRATIC FORMS
287
we construct the product (21,Zl)
(21,22)
(Z2,21)
(22,221
( G , ~ I (zn,G) )
... ...
(5.381)
... h
Using the orthonormality relation of the new set B’, A
h
( e i ,e j ) = 6.. 3
(5.382)
ss = I.
(5.383)
Equation (5.381) becomes
In other words, the inverse transformation is the transpose of the transformation matrix:
-
s-’ = s.
(5.384)
Matrices satisfying this property are called orthogonal matrices. Transformations represented by orthogonal matrices preserve norms of vectors. This 2 can be easily seen by using v = Sv’ to write IvI in terms of the new basis, 3, as
-
lVl2
= vv = (SV’)SV’
(5.385) (5.386) (5.387) (5.388)
The quadratic form,
Q = GAv,
(5.389)
can now be written in terms of the new bases. Using the transformation equation,
v = SV’, we can write
-
Q = (Sv’)ASv’ = G‘SASV‘ = Z;’
(S-’ AS) v’,
(5.390)
(5.391) (5.392) (5.393)
288
LINEAR ALGEBRA
where S-IAS is the matrix representation of the operator A in terms of the new bases, that is, A'. It is important to note that orthogonal transformations preserve the values of quadratic forms, in other words, Q = vAv = ~ ' A ' v '= Q'.
(5.394)
Writing the transformation matrix [Eq. (5.379)], S =Z$,i , j = 1,.. . ,n,explicitly as
where Zijis the i t h component of the j t h normalized eigenvector, we form the product
(5.396)
In the above equation we have used the eigenvalue equation [Eq. (5.378)]: n.
n
j=1
1=1
Equation (5.396) can also be written as
(5.398)
which leads to
that is, in the new bases A is represented by a diagonal matrix with the diagonal elements being the eigenvalues.
HERMITIAN MATRICES
5.18
289
H E R M I T I A N MATRICES
We now consider matrices in the complex field @. The adjoint of a matrix, At, is defined as A*, where the transpose of A along with the complex conjugate of each element is taken. If the adjoint of a matrix is equal to itself, At = A, it is called self-adjoint. In real inner product spaces self-adjoint matrices are simply symmetric matrices. In complex inner product spaces selfadjoint matrices are called Hermitian. Adjoint operation has the following properties. (5.400) (5.401) (5.402) (5.403) Hermitian matrices have very useful properties. Consider the eigenvalue problem for an n x n Hermitian matrix H : H u = ~XU~,
(5.404)
where ux is the n x 1 column matrix representing the eigenvector corresponding to the eigenvalue A. For two eigenvalues, A, and A j , we write the corresponding eigenvalue equations, respectively, as Hu~ = X~U,
(5.405)
Huj
(5.406)
and = Ajuj.
We now multiply Equation (5.405) with 65 from the left and write U~HU = XiU,*ui. ~
(5.407)
Next we take the adjoint of Equation (5.406):
(5.408) and multiply by
ui
from the right:
U,*Htui= A;U;ui. Using the fact that for Hermitian matrices Ht
(5.409) = H, Equation
63Hui = A;U,*ui.
(5.409) becomes
( 5.4 10)
290
LINEAR ALGEBRA
We now subtract Equation (5.410) from (5.407) to write
0 = ( X i - x;,u;uz.
(5.411)
As in the case of real symmetric matrices, there are basically three cases: (I) When i = j , Equation (5.411) becomes (5.412) (5.413) Since luiI2is always positive, this implies that the eigenvalues of a Hermitian matrix are always real, that is, X i = A;.
(5.414)
In quantum mechanics eigenvalues correspond to directly measurable quantities in laboratory, hence observables are represented by Hermitian matrices. (11) When i # j and the eigenvalues are distinct, X i # X j , the corresponding eigenvectors are orthogonal in the Hermitian sense, that is, (Uj,Ui)
= u;uz = 0.
(5.415)
(111) As in the case of real and symmetric matrices, for repeated roots of order s there exists a set of s linearly independent eigenvectors. Hence for a Hermitian n x n matrix H, we can construct a set of linearly independent orthonormal basis vectors, {GI,G2,. . . , which spans the n-dimensional inner product space V defined over the complex field C.It then follows that any vector v in V can be written as the linear combination
a,},
n
u
=
X"iGi,
(5.416)
i=l
where the components ai are numbers in the complex field C.Using the definition of the inner product and the orthogonality of the normalized basis vectors, we can evaluate C Y ~as n
(2j,U)=
.y(Gj,"iGZ)
(5.417)
i= 1 n
(5.418) i=l n.
(5.419) = "j.
(5.420)
HERMITIAN MATRICES
291
In this complex vector space, Hermitian operators, H , transform vectors in V into other vectors in V. Again, it is desirable t o find a new set of basis vectors, where H is represented by a diagonal Hermitian matrix, H. Steps t o follow are similar to the procedure described for the real and symmetric matrices. We define the transformation matrix U as (5.421)
where Eii, i matrices
1 , 2 , . . . , n are the unit eigenvectors represented by the column
=
Gi=
( q,
(5.422)
U n1
where G j i corresponds to the j t h component of the i t h eigenvector, fying the eigenvalue equation
&, satis-
HGi = X,Gi.
(5.423) -*
Due to the orthonormality of the eigenvectors, ( G j , G i ) = GjGi write
= Sij,
we can
u*u
=z
(5.424)
hence (5.425) (5.426)
A matrix whose inverse is equal to its adjoint is called a unitary matrix. Similarly, a transformation represented by a unitary matrix is called unitary transformation. Unitary transformations are the counterpart of orthogonal transformations in complex inner product spaces, and they play a very important role in quantum mechanics. A unitary transformation, UtU = I, preserves the norms of vectors. This can be proven by using v = uv’
(5.427)
292
LINEAR ALGEBRA
to write
-* v*v = (UV’) uv’
(5.428)
-*-
= v’ u * u v ‘
-*
= v‘
(5.429)
u+uv’
= z;‘*v‘,
(5.430) (5.431)
/vI2 = lV’l2.
(5.432)
which is the desired result:
Consider a Hermitian matrix, H, representing a Hermitian operator, H , which transforms a vector v in V into another vector w in V defined over the complex field C as w = Hv.
(5.433)
Vectors, v and w, transform under unitary transformations as w = uw’,
v
(5.434) (5.435)
= uv’.
Using these in Equation (5.433) we obtain
UW’= HUv’,
(5.436)
U-lUw’= (U-’HU)v’,
(5.437)
w’= (U?HU)v’.
(5.438)
In conclusion, in terms of the new bases defined by the unitary transformation U, H is expressed as
H‘ = U-lHU = UtHU.
(5.439)
A unitary transformation constructed by using the eigenvectors of H, a s described in the argument leading to Equation (5.399), diagonalizes H as 0 H ’’== ( i.
...
’.:: ...
r)
An
(5.440)
MATRIX REPRESENTATION OF LINEAR TRANSFORMATIONS
5.19
293
M A T R I X REPRESENTATION OF LINEAR TRANSFORMATIONS
Having defined the inner product spaces, we can now show how the matrix representation of a given transformation or operator can be found. Consider an ndimensional vector space, V ,spun by the orthonormal set B = { E l , $ 2 , . . . , e n } and defined over the field K . Let T be a linear transformation from V into V, that is. h
w =Tv,
(5.441)
where v and w are elements in V. Using the orthonormal basis B , we can write the vectors v and w as
c n
u=
a&,
(5.442) (5.443)
where the components ai and
&
are evaluated by using the inner products
ai= (Zi, u)and
pj
= ( Z j , w).
(5.444)
We now write Equation (5.441) as n
n.
j=1
i=I n
= CaiTEi.
(5.446)
i= 1
If we take the inner product of both sides with condition, ( Z k , E j ) = S k j , we obtain n
n
j=1
i=l
Ek
and use the orthonormality
(5.447) n.
n
j=1
i=l
(5.448) n
(5.449)
c,"=,
i=l
Comparing with ,& = Aijaj [Eq. (5.71)], we see that the elements of the transformation matrix are obtained as
294
LINEAR ALGEBRA
For any linear operator T acting on V,we can define another linear operator Tt called the adjoint of T, which for any two vectors v and w in V has the property
(Tv, W ) = ( v ,Ti,). If we write v and w in terms of the basis B
=
(5.451)
{Z1,22, . . . ,Zn}, we obtain (5.452) (5.453)
In other words, the matrix [Tt],j = Aij, representing the adjoint operator T t , is obtained from the matrix [T]ij= Aij, which represents T by complex conjugation and transposition. A linear operator satisfying
Tt = T
(5.454)
is called a Hermitian operator or a self-adjoint operator. Hermitian operators are represented by Hermitian matrices.
5.20
FUNCTIONS OF MATRICES
We are now ready to state an important result from Gantmacher: Theorem 5.6. If a scalar function f ( x ) can be expanded in power series:
where r is the radius of convergence, then this expansion remains valid when x is replaced by a matrix A whose eigenvalues are within the radius of convergence. Using this theorem we can write the expansions:
(5.456) (5.457)
(5.458) An important consequence of this theorem is the Baker-Hausdorf formula: ;LAH~-ZA
=H
+ i [A,HI
-
1 2
- [A, [A,HI]
+ . .. ,
(5.459)
295
FUNCTIONS OF MATRICES
where A and H are n x n matrices and [ A , H ]= A H - H A
(5.460)
is called the commutator of A with H. For the proof we first expand ezA and e P L Ain power series and then substitute the results into e Z A H e c z A and collect similar terms. Another very useful result is the trace formula: det eA = etTA,
(5.461)
where A is a Hermitian matrix. Since unitary transformations, U t U preserve values of determinants (Section 5.8),we can write det eA = det(UteAU) = det eutAu.
=
I,
(5.462) (5.463)
Using a unitary h-ansformation that diagonalizes A as
UtAU = D,
(5.464)
(5.465)
where X i are the eigenvalues of A, we can write det eA = det eD
(5.466) (5.467) (5.468)
Since the determinant of a diagonal matrix is equal to its trace and unitary transformations preserve trace (Section 5.8), we finally obtain the trace formula as 3o
deteA=x--n=O
(trD)n n!
(5.469) (5.470) (5.471)
296
LINEAR ALGEBRA
5.21 FUNCTION SPACE AND HILBERT SPACE We now define a new vector space, L2, whose elements are complex valued square integrable functions of the real variable x,defined in the closed interval [a,01. A function is square integrable if the integral (5.472) exists and is finite. With the inner product of two square integrable functions, f l and f 2 , defined as (5.473) the resulting infinite-dimensional inner product space is called the Hilbert space. Concepts of orthogonality and normalization in Hilbert space are defined as before. In a finite-dimensional subspace, V,of the Hilbert space, a set of square integrable functions, (91, g2, . . . , g n } , is called an orthonormal set if its elements satisfy
J1"
g:gjdx
= Si3,
i , j = 1,.. . , n.
(5.474)
Furthermore, we say that the set {gl,g2,. . . , g n } is complete if it spans V; that is, any square integrable function, g(z), in V can be written as n
(5.475) i=O
Using the orthonormality relation, we can evaluate the expansion coefficients, c i , as (5.476) (5.477) Using a linear operator, A , acting in the Hilbert space we can define an eigenvalue problem as
A f i ( x )= A i f i ( z ) , i
=
1 , 2 , .. .
,
(5.478)
where f L ( x )is the eigenfunction corresponding to the eigenvalue A,. We have seen that in finite-dimensional vector spaces, V, Hermitian operators are represented by Hermitian matrices, which have real eigenvalues and with their eigcnvectors form a complete orthonormal set that spans V . For the infinitedimensional Hilbert space the proof of completeness is beyond the scope of
DIRAC'S BRA AND KET VECTORS
297
this book, a discussion of this point can be found in Byron and Fuller. The state of a system in quantum mechanics is described by a square integrable function in Hilbert space, which is called the state function or the wave function. Observables in quantum mechanics are Hermitian operators with real eigenvalues acting on square integrable functions in Hilbert space. 5.22
DIRAC'S BRA A N D K E T VECTORS
A different notation introduced by Dirac has advantages when we consider eigenvalue problems and Hermitian and unitary operators in quantum mechanics. For two vectors in Hilbert space the inner product is not symmetric: (5.479) (5.480) However, from the relations ( Q l , Qz) = (Qz, Q l ) * ,
+ Q 2 , Q 3 ) = (Ql,Q 3 ) + (Qz, Q 3 ) , ( Q l , Q2 + 9 3 ) = (Ql, Q 2 ) + (Ql, Q3),
(Ql
(Ql, a Q 2 ) = a(Q1,Qz),
( Q Q l , Q2) = a*(Q1,Qz),
(5.481) (5.482) (5.483) (5.484) (5.485)
where a is a number in the complex field @, we see that the inner product is nonlinear with respect to the prefactor. This apparent asymmetry can be eliminated if we think of both vectors as belonging to different spaces-- that is, the space of prefactor vectors and the space of postfactor vectors, where each space is linear within itself but related to each other in a nonlinear manner through the definition of the inner product. Hence, they are called dual spaces. Dirac called the prefactor vectors bra and showed them as (QI , and he called the postfactor vectors ket and showed them as IQ) . For each bra there exists a ket in its dual space, that is,
(5.486) (5.487) (5.488) Each space on its own is a vector space. The connection between them is established through the definition of the inner product as (Q11 92)= /Q;Q2
dx.
(5.489)
298
LINEAR ALGEBRA
Obviously, (5.490) Note that generally we write (Q1I Q 2 ) , rather than (Q1l / Q 2 ) . A linear operator, A, associates a ket with another ket:
A IQi
A IQ) = I@) > + Q 2 ) = A IQi)
+A
(5.491) (5.492) (5.493)
/Q2),
A ( a 19))= a ( A IQ)). By writing
(Qil
A
1Q2)
as (Qll
we may define a bra, or the bra as
(Qll
[AIQ2)1 =
(5.494)
[(Qll A1 1Q2)
A, that allows us to use A to act on either the ket
In other words, A is a linear operator in both the bra and the ket space. In terms of the bra-ket notation the definition of Hermitian operators become (Qll At
1Q2) = ( Q 2 l A
I%)*.
(5.497)
In general, we can establish the correspondence
A 1")
=
I@) * (@I
=
(Ql
At.
(5.498)
PROBLEMS 1. Is the set of integers,
. . . , - 1 , O , 1 , .. .
a subfield of
2. Is the set of rational numbers a subfield of
C?
C? Explain.
3. Write three vectors that are linearly dependent in R3 but such that any two of them are linearly independent. 4. Let V be the vector space of all 2 x 2 matrices over the field K. Show that V has the dimension 4 by writing a basis for V which has 4 elements. 5. Let V be the vector space of all polynomials from R into R of degree 2 or less. In other words, the space of all functions of the form
PROBLEMS
299
Show that B = ( 9 1 , ~2~ g 3 } , where
+ 1, 93(5) = ( 5 + 212, forms a basis for V. If f(x) = a0 + a l x + a21c2, find the components with g1(5)
= 1, 9 2 ( 5 ) = 5
respect to B .
6. Show that the vectors 1,0,0)1
7J1 =
(11
7J2 =
( L O , 0, a),
7J3 =
(O1O, 1,1),
7J4
= (0,010,1)
form a basis for R4.
7. Which of the following transformations, T ( z 1 , 5 2 ) ,from R2 into EX2 are linear transformations? T(51,52) = ( 2 1 , 1
(i) (ii)
+521,
T(51,52)= ( 5 2 , 5 1 ) ,
(4
T ( Z l , 5 2 )= ( 2 1 , 4 ,
(iv)
T ( 5 1 , ~ =)( 2 1 5 2 , 0 ) .
8. If T and U are linear operators on EX2 defined as T ( 5 1 , 5 2 )= ( 5 2 , 5 1 1 ,
U ( z 1 ,5 2 )
=
( a 01, ,
give a geometric interpretation of T and U . Also write the following transformations explicitly:
( U + T ) , UT, TU, T 2 ,U2. 9. Let V be the vector space of all n x n matrices over the field K . Show that T ( A )= A B
-
BA,
where A belongs to V and B is any fixed n x n matrix, is a linear transformation. 10. Let V be the space of polynomials of degree three or less:
+ a15 + a252 + a353. The differential operator D = 2 maps V into V, since its effect on f ( 5 ) f(5)= a0
is to lower its degree by one.
300
LINEAR ALGEBRA
(i) Let
be the basis for
V.Find the matrix representation of D , that is, [D]B.
(ii) Show that the set B' = (gl,g2,g3,94} ,where 91 = fl, Q2 = fl g3 = f l
Q4 = f i
also forms a basis for
+ f2,
+ 2 f 2 + f3, + 3f2 4- 3f3 + f4,
V.
(iii) Find the matrix representation of D in terms of the basis B'
11. For a distribution of m point masses, the moment of inertia tensor is written as m
where k stands for the kth particle and i and j refer to the Cartesian coordinates of the kth particle. Consider 11 equal masses located at the points:
(i) find the principal moments of inertia, (ii) find the principal axes and plot them,
(iii) write the transformation matrix an orthogonal transformation, (iv) show explicitly that
S and show that it corresponds to
S diagonalizes the moment of inertia tensor,
(v) write the quadratic form corresponding to the moment of inertia, I , in both coordinates. 12. Consider a rigid body with uniform density of mass 2M in the shape of a 45" right triangle lying on the xy-plane and with a point mass M on the z-axis as shown in Figure 5.3. Find the principal moments of inertia and the eigenvectors. 13.
Find the eigenvalues and the eigenvectors of the following matrices:
PROBLEMS
Figure 5.3
301
Mass distribution in Problem 5.12.
(ii)
; t).
A = ( 2 0 0
14. Write the quadratic form
in matrix form Q = ,Ax and then (i) find the eigenvalues and the eigenvectors of A (Hint: one of the eigenvalues is 6), (ii) construct the transformation matrix that diagonalizes the above quadratic form and show that this transformation is orthogonal and diagonalizes Q.
15. Find the transformation that removes the xy term in 2’
+ z y + y2 = 16
and interpret your answer geometrically.
16. Given the quadratic form
Q
=2 4
+ 52; + 2 ~ +: 4 2 1 2 3 ,
302
LINEAR ALGEBRA
(i) express Q in matrix form as Q
= %AX,
(ii) find the eigenvalues and the eigenvectors of A, (iii) find the transformation matrix that diagonalizes the above quadratic form and show that this transformation is orthogonal,
(iv) write Q in diagonal form. 17. Schwarz inequality: Since the cosine of any angle lies between -1 and +1, it is clear that geometric vectors satisfy the Schwarz inequality:
1x.q5 1x11x1. Show the analog of this inequality for the general inner product spaces: I(u,v)I
2
I (u,u)(v,v).
18. Triangle inequality: For the inner product spaces prove the triangle inequality Iu
+
'UI
5
IUI
+ Ivl.
19. Show that the space of square integrable functions forms a vector space. 20. Prove the Baker-Hausdorf formula:
, i a ~ ~ - iA
-H
+ i[A,HI - -21[A,[A,HI] + . . . ,
where A and H are n x n matrices and [A,H]= AH
-
21. In bra-ket notation Hermitian operators are defined as
(qll At
1Q2)
Establish the correspondence
A19) = I@)
=
-
( % A I%)*.
(@I
=
("/At.
HA.
CHAPTER 6
SEQUENCES A N D SERIES
Sequences and series have found a wide range of applications in both pure and applied mathematics. A sequence is a succession of numbers or functions that may or may not converge to a limit value. A natural way to generate sequences is to use partial sums of series. In this regard, the convergence of a series is synonymous with the convergence of the corresponding sequence of partial sums. In this chapter, we introduce the basic concepts of sequences and series and discuss their most commonly used properties. We can name the evaluation of definite integrals, calculation of limits, and series approximation of functions to any desired level of accuracy as being among the most frequently used techniques with series. Series solutions of differential and integral equations and perturbative techniques are other important applications of series.
Essentials of Mathematical Methods in Science and Engineering. By Copyright @ 2008 John Wiley & Sons, Inc.
3. S e l p k Bayin 303
304
SEQUENCES AND SERIES
6.1 SEQUENCES An infinite sequence is defined by assigning a number, S,, t o each positive integer, n, and then by writing them in a definite order as
{ S n > n,
= 1 , 2, . . .
.
(6.2)
A finite sequence has a finite number of elements:
{SI1 SZ . . . Sn).
(6.3)
In general a sequence is defined by a rule, that is, by its n t h element, which allows one to generate the sequence. For example, the following sequences:
{-1,1, -1,. . . } ,
(6.6)
where the n t h terms are given, respectively, as
can also be written as
A sequence {S,} is said to converge t o the number S, that is, lim S,
n+m
if for every positive number inequality
E
+ S,
we can find an N such that for all n
ISn - S I < E, n > N , is satisfied. The limit, when it exists, is unique.
(6.10)
> N the (6.11)
SEQUENCES
A
I
I
Figure 6.1
A 1
I l l
I
Convergent sequence.
I
I
I
I
I
I
I
I
'2
B
I
4'
3'
,
1
'5
1
S
B
1
I
PS
'6
Figure 6.2
Convergent monotonic increasing sequence.
Figure 6.3
Convergent monotonic decreasing sequence.
I I
I
1'
s2
Figure 6.4
A I
I
s3
I
3'
1
I
1
I
,
I
4'
I I
+s
7'
' 5 '6
Divergent monotonic increasing sequence.
I l l
1 1 l 1 1
BI
, , I
I , , , ,
I
s5
Figure 6.5
Figure 6.6
52'
'6
Divergent bounded sequence.
Divergent unbounded sequence.
PS
305
306
SEQUENCES AND SERIES
In Figures 6.1-6.6 we show various possibilities for sequences. Convergence of a sequence can also be decided without the knowledge of its limit by using the Cauchy criteria: Theorem 6.1. Cauchy criteria: For a given infinite sequence {S,} the limit lim
n-30
S, = S
(6.12)
exists, if and only if the following condition is satisfied: For every exists an integer N , such that for all n and m greater than N
IS,
-
SmI < E , n
E
> 0 there
# m,
(6.13)
is true. A sequence is called divergent if it is not convergent. Sequences in Equations (6.4) and (6.5) converge since they have the limits 1 lim - + 0, n-30 2,
(6.14) (6.15)
while the sequences in Equations (6.6) and (6.7) diverge. A monotonic increasing sequence satisfies (Fig. 6.2)
s1 5 s, 5 s3 5 . ”
5
s, 5 . . ’ .
(6.16)
Similarly, a monotonic decreasing sequence is defined as (Fig. 6.3) s 1
2 s, 2 s3 2 . . . 2 s, 2 ’ . . .
(6.17)
A sequence is bounded if there are two numbers, A and B , such that A 5 S, 5 B for all R. Sequences in Figure 6.4 and Figure 6.6 are unbounded. It can be proven that every bounded monotonic decreasing sequence is convergent and every unbounded sequence is divergent (Kaplan). Sequences that are bounded but not monotonic can diverge or converge. For example, the sequence {-1,1, -1,1,. . . , ( - l ) n , . . . }
(6.18)
diverges by oscillating between -1 and 1. Another sequence {cos?},
n = 1 , 2, . . . ,
(6.19)
oscillates between the values 0 , l and -1 :
(0,- l , O , 1,0, -1,. . . }.
(6.20)
SEQUENCES
307
In other words, a bounded series may diverge not because it does not have a limit value but because it has too many. For bounded sequences we define an upper limit as
GTL-ms, +U
(6.21)
> 0 there exists a number N such that (6.22) IS, - UI < & is true for infinitely many n > N and if no number larger than U has this
if for every
E
property. Similarly, we define the lower limit as
bEn+&I if for every
E
+
L,
(6.23)
> 0 there exists a number M such that
(6.24) IS, - LI < & true for infinitely many n > M and if no number less than L has this
is property. A bounded sequence has an upper and a lower bound such that U > L. For unbounded sequences we can take +cc and -cc as possible limit “values.” For a sequence of real numbers, {S,},we can say the following: (i) -
limn+mSn
> lim, ,=S,.
(6.25)
(ii) A sequence converges if and only if both limits are finite and equal:
L,-m~, = lim, ,,s,
= S.
(6.26)
G,+mS, = lim, ,,Sn = +cc.
(6.27)
(iii) A sequence diverges to +oo if and only if
(iv) A sequence diverges to -cc if and only if
E,+m~, = lim, , o o ~ n= -m.
(6.28)
(v) A sequence where we have
i&-mSn
# limn-,mSn
(6.29)
is said to oscillate. By simple graphing one can verify the following limits:
S,
= ( - l ) , ( ~-
S,
=1
i); h,+wS,
+ (-1),/3,;
s, = ( - 1 ) V ;
-
= -1,
limn-wS,
=
+I,
b,+wS,
= 1,
lim,+wS,
=
1,
h,-wS,
= -00,
-
lim,+wSn = +00,
S, = nsin2(inrr);
bn++-Sn = 0,
lim,-wSn
S, = sin(+n.rr);
h,-mSn
lim,-wSn
= -1,
= +m, = +l.
(6.30)
308
SEQUENCES AND SERIES
6.2
INFINITE SERIES
An infinite series of real numbers is defined as the infinite sum
(6.31) n=l
When there is no room for confusion, we also write an infinite series as an or as C,,a,. With each infinite sum we can associate a sequence of partial sums,
{ 4 , S 2 , S3, . . . , Sn, . . . } ,
(6.32)
c.2.
(6.33)
where
n
sn=
i=l
The series CEl ai is said to converge if the sequence of partial sums, { S n } , converges and the series diverges if the sequence of partial sums diverges. When the sequence of partial sums converges to S , we say the series converges and call S the sum of the series and write 00
Y ai = S.
(6.34)
u
i=l
In other words, n
lim
n-00
00
C ui C =
ai
= S.
(6.35)
i= 1
i=l
When the limit exists and if limn+00 Sn = fm,we say the series is (properly) divergent. Let 00
03
n=l
n=l
be two convergent series and let a and
P be two constants, then we can write
00
C [ a a n+ ~ b n=] n=l
=
Q:
C a n + P cbn, 00
00
n=l
n= 1
as, + p s b .
(6.36) (6.37)
ABSOLUTE AND CONDITIONAL CONVERGENCE
6.3
309
ABSOLUTE AND CONDITIONAL CONVERGENCE
A series, X u T Lis, called absolutely convergent if the series constructed by taking the absolute value of each term, lanl , converges. A series that does not converge absolutely but converges otherwise is called conditionally convergent. For a convergent series the nth term, a,, necessarily goes t o zero as n goes to infinity. This is obvious from the difference
c
s,
-
(6.38)
s , 1 = a,,
which by the Cauchy criteria must approach to zero as n goes to infinity. However, the nth term test, lim a,
(6.39)
+ 0,
7%-cc
is a necessary but not a sufficient condition for the convergence of a series. In what follows we present some of the most commonly used tests, which are also sufficient for absolutely convergent series or series with positive terms. For series with positive terms the absolute value signs are redundant.
6.3.1
Comparison Test
Given two infinite series, then the convergence of
6.3.2
C a,
and C b,, with b, > 0 and lanl 5 b, for all n, b, implies the absolute convergence of a,.
c
Limit Comparison Test
Assume that b,
> 0 for n = 1 , 2 , . . . and suppose that (6.40)
then the series C a, converges absolutely, if and only if C b, converges. When the limit limn+m la,/b,l + 0 is true, we can only conclude that the convergence of C b, implies the convergence of C lanl .
6.3.3
Integral Test
Let f(x) be a positive decreasing function in the interval [l,m] satisfying the following conditions: (i) f(x) is continuous in [I,m], (ii) f(x) is monotonic decreasing and limn-m f(x) + 0, (iii) f ( n ) = a,. Then the series C a, converges if the integral f(x)dx converges and diverges if the integral diverges.
Jy
310
SEQUENCES AND SERIES
6.3.4
Ratio Test
Given an infinite series, xu,, if (6.41) then for L<1 L >1 L =1
6.3.5
C a, C a,
is absolutely convergent, is divergent,
(6.42)
the test is inconclusive.
Root Test
For a given series,
a,, let (6.43)
then for
R<1 R>1 R =1
C a, C a,
is absolutely convergent, is divergent, the test is inconclusive.
(6.44)
The strategy in establishing the convergence of an unknown series is t o start with the simplest test, that is, the comparison test. In order to use the comparison test effectively, we need to have a t our disposal some series of known behavior. For this purpose we often use the harmonic series or the geometric series: Theorem 6.2. The harmonic series of order p :
. y $ = l + - +1 - + 1. . . 2p 3p rz= 1
,
(6.45)
converges for p > 1 and diverges for 0 < p 5 1. We can establish this result most easily by using the integral test. For p > 0 we write the integral
When p > 1 the above limit exists and takes the value l / ( p - 1), hence the series converges. For 0 <.p < 1 the integral diverges, hence the series also diverges. For p = 1 we have
dx = lim (lnb) = 00 b-ca
(6.47)
311
ABSOLUTE AND CONDITIONAL CONVERGENCE
aiid tlie harrnonic series diverges again. Finally for p < 0, t.hc n,th term rcadily establishcs the divergence. thus completing the proof. Theorem 6.3. The geometric series,
c 31.
z?
= 1
+ .I: f 2 2 +
'
. , '
(6.48)
11=0
converges for -1 < 1' < 1 as 7c
CJ7L
1 = -, 11.1
1t=O
1-x
< 1.
(6.49)
The proof can be rstablishcd by the ratio test. From the limit
(6.50) i i c ~ d1.r < 1 for convergence. The series obviously divcrgcs for the nth tcrrn test.
\vv
T =
1 by
Example 6.1. Convergence tests: Consider tht: scrim 3c:
n+2 4n2 n
C
+ + 1.
n=l
(6.51)
Since the nth term converges to zero. it is of no help. For large n the ttth term behaves as 1/4n. which suggcsts comparison with 1/4n. Sirice the inequality
+2 1 + n + 1 > -4 71
ri
4n2
(6.52)
is satisfied for all n 2 1, by comparison with the harmonic scries. C,,+. we conclude that the above srrics [Eq. (6.51)]also diverges. Note that for this case the ratio tmt fails:
Example 6.2. Convergence tests: The series (6.54) divcrges by the integral test:
(6.55)
312
SEQUENCES AND SERIES
Note that comparison with the harmonic series is of no help since
(6.56) Example 6.3. Convergence tests: For the series
xF 00
(6.57)
n=l
we can use the comparison test with the harmonic series: Inn 1 >-, n n
n = 3 , 4,...,
(6.58)
to conclude that the series is divergent.
Example 6.4. Convergence tests: Given the series 03
(6.59) n=l
where c is a positive constant, we can use the ratio test,
(6.60) to conclude that the series converges. Similarly, for the series
c 00
(6.61)
$1
n=l
we apply the ratio test,
(6.62) to conclude that the series diverges. In fact, in this case we can decide quicker via the n t h term test, nn lim n!
n-03
---f
en lim -
n-m&
+
0,
where we have used the Stirling's approximation n! 2~ nneCn& large n.
(6.63) for
Example 6.5. Convergence tests: We can write the series 00
(6.64) n=l
ABSOLUTE AND CONDITIONAL CONVERGENCE
313
as 00
(6.65) n=l
where the first series converges by the ratio test, 1/3"+l 1 lim -- - < 1 , n+cc 1/3" 3
(6.66)
while the second series converges by the integral test,
1"$=1.
(6.67)
Hence the original series [Eq. (6.64)] converges. We should make a note that the sum of two convergent series is convergent and the sum of a divergent series with a convergent series is divergent. However, the sum of two divergent series may be convergent.
Example 6.6. Convergence tests: Given the series
2 (&y,
(6.68)
n=2
the ratio test fails: n+1
(6.69) However, the root test, lim
n-cc
n & +n-cc lim n2 +1
+
0,
(6.70)
yields that the series is convergent. In general the root test is more powerful than the ratio test. When the ratio test is inconclusive, usually a result can be obtained via the root test. The above tests work for the absolutely convergent series or series with positive terms. For conditionally convergent series we can use the following theorem: Theorem 6.4. An alternating series, (6.71) n=O
converges when the following two conditions are met:
314
SEQUENCES AND SERIES
(i) a,, are monotonic decreasing, that is,
an+l 5 a,, n = 0 , 1 , 2 , . . . .
(6.72)
(ii)
lim an
n-zc
-7’
(6.73)
0.
Example 6.7. Alternating series: The alternating series
(6.74) In n converges since - is monotonic decreasing for n = 2 , 3 , . . . and the ri limit In n lim - + 0
n-cx
(6.75)
n
is true.
6.4
OPERATIONS W I T H SERIES
Wc have already pointed out that convergent series can be added, subtracted, and multiplied by a constant: M
-&4+ C(Pbn) =a n=l
?a=l
c +P c 00
00
a,
n= 1
bn,
(6.76)
n=l
where C and C b,, are two convergent series and CY and p are constants. In addition to these there are three other operations, grouping, rearrangement and multiplication, that can be performed on series. For absolutely convergent series or series with positive terms, grouping- that is, inserting parentheses- yields a new convergent series having the same sum as the original series. For the sum
x u n
= a1
n=l
+ a2 + a3 + + . . . , a4
(6.77)
iriscrting parentheses, namely (a1
+ a2 + a3)+ (a4 + a5 + ag) + (a7 + U S + u g ) + . . . ,
(6.78)
while preserving the order of terms, will only cause one t o skip some of the terms in the sequence of partial sums of the original series; that is,
OPERATIONS WITH SERIES
315
will be replaced by
If the first sequence [Eq. (6.79)] converges to S, then the second sequence [Eq. (6.80)] obtained by skipping some of the terms will also converge to the same value. If the original series is properly divergent, then insertion of parentheses yields again a properly divergent series. Since a series with positive terms is either convergent or properly divergent, we can insert parentheses freely without affecting the sum. Divergent series with variable signs can occasionally produce convergent series. For example, the divergent series 03
C(-l)'" = $1
-
1
+1
-
1
+1
(6.81)
-
n=O can be written as
where all the pairs in parentheses give zeros, thus yielding 1 as the sum. Another operation with the series is rearrangement of its terms. For absolutely convergent series converging to S, every rearrangement of its terms will also converge absolutely and will yield the same sum S. For conditionally convergent series, no such guarantees can be given. In fact, by a suitable arrangement of its terms a conditionally convergent series can be made t o converge to any value or even t o diverge. To this effect we present the following theorem without proof (Apostol): Theorem 6.5. Let C ai be a conditionally convergent series and also let n,b, a < b, be any two numbers in the closed interval [-m,+co]; then there exists a rearrangement C bi of C ai such that lim, ,~
-
b, = a and limn+co
b, = b.
(6.82)
To demonstrate Theorem 6.5 consider the alternating series
(6.83) which converges to ln2. We rearrange its terms as 03
C
1 3
-I+-+-+ -
(-Y+l
k=l
1 5
-I+-+ 1 - +1. . . - 3 5 -
1 2 2
1 1 ---... 4 6 [1+;+;+-..].
(6.84) (6.85)
316
SEQUENCES AND SERIES
We first add and then subtract obtain
4 [l+ + + . . . ] to the above series to
00
k=l
]
(6.86) (6.87)
= 0.
(6.88)
Note that when we rearrange the terms of a series, there is a one-to-one correspondence between the terms of the rearranged series and the original series. So far we have emphasized the central role that absolute convergence plays in operations with series. In fact, multiplication is another operation defined only for the absolutely convergent series. If C;=, a , and Cz=,b, are two absolutely convergent series, then their product, (Ca,) (Cb,) = C en, is also absolutely convergent. Furthermore, if C a, converges to A and C b, converges to B , then their product converges to AB. Since the product series, Cc,,, is absolutely convergent, a particular rearrangement of its terms is known as the Cauchy product:
(6.89) = aobo
+ (aob1 + U l b O ) + (aoba + U l b l
+
+ . ..
,
(6.90)
where in general we can write en as n.
c,
6.5
=xakbn-k, k=O
n = 0,1,2,.. .
(6.91)
SEQUENCES AND SERIES OF FUNCTIONS
So far wc have confined our discussion to sequences and series of numbers. One can also define sequences of functions as { f n ( ~ ) )n, =
1 , 2 , .. . ,
(6.92)
where f,,(s)are functions defined over the same interval, which can be infinite along the x-axis. Similarly, we can define series of functions as w
317
SEQUENCES AND SERIES OF FUNCTIONS
where the n t h partial sum is defined as n
Sn(x)= C
Ui(4.
(6.94)
i=l
At each point of their interval of definition, sequences or series of functions reduce to sequences and series of numbers, hence their convergence or divergence is defined the same way. However, there is one subtle question that needs to be answered, that is, a given series or sequence may converge a t each point of its interval, but does it converge at the same rate? For this we introduce the concept of uniform convergence: Definition 6.1. A series, u,(x),is said to converge uniformly to S ( x ) in the interval [LI, L2] if, for a given E > 0, an integer N can be found such that
c,"==,
ISn(x) - S(z)l < E
(6.95)
for all n 2 N and for all x in [Ll, Lz]. This definition of uniform convergence works equally well for sequences, that is, a sequence, { f n ( x ) } ,is uniformly convergent to f ( z ) in the interval [LI,Lz] if, for a given E > 0, an integer N can be found such that
(6.96)
Ifn(z) - f(x)l < E
for all n 2 N. In other words, the uniform convergence of a series is equivalent to the uniform convergence of the sequence of its partial sums. Note that in this definition, E basically stands for the error that one makes by approximating a uniformly convergent series with its n t h partial sum. Uniform convergence assures that the error will remain in the predetermined margin,
f(.)
-E
< f n ( x ) < f(.)
+E,
(6.97)
for all z in [ L I ,LZ].
Example.6.8. The geometric series: Consider the geometric series
n=O
where the nth partial sum is given as
(6.99) and the sum is 1 S ( x ) = -. l-x
(6.100)
318
SEQUENCES AND SERIES
Absolute value of the error, E,, committed by approximating the geometric series with its n t h partial sum is (6.101) Consider the interval [-$, $1. Since the largest error always occurs a t the end points, for a n error tolerance of E, = lop3, we need t o sum at least 7 terms: 1/3n 10-3 = 1 - 1/3' 3 3 , = -lo3, 2
(6.102) (6.103) (6.104)
L
n = 7.
(6.105)
As we approach the end points of the interval (-1, l), the number of terms to be added increases dramatically. For example, for the same error margin, E, = l o A 3 , but this time in the interval (-0.99,0.99), the number of terms to be added is 1146. It is seen from Equation (6.101) that as n goes to infinity, the error E,, which is also equal t o the remainder of the series, goes to zero: lim 7L-w
-11F I - 2 1
--f
0 for 1x1 < 1.
(6.106)
Adding 1146 terms assures us that the fractional error, E,/S, committed in the interval [-0.99,0.99] is always less than (6.107) We write the geometric series approximated by its first 1146 terms as
S(z)e s 1 1 4 6 ( 2 )
+ 0(10-5),
[-0.99,0.99].
(6.108)
In this notation, O(10V5) means that the partial sum s 1 1 4 6 ( X ) approximates the exact sum S(z) accurate up t o the fifth digit. 6.6
M-TEST FOR UNIFORM CONVERGENCE
A commonly used test for uniform convergence is the Weierstrass M-test or in short, the M-test:
PROPERTIES OF UNIFORMLY CONVERGENT SERIES
c,"==,
319
Theorem 6.6. Let u,(z) be a series of functions defined in the interval [LI,L2].If we can find a convergent series of positive constants, M,, such that the inequality
c,"==,
Iun(z)I 5
Mn
(6.109)
holds for all z in the interval [ L l ,L2],then the series uniformly and absolutely in the interval [ L l ,Lz].
c,"==, u,(x) converges Xn
Example 6.9. Weierstruss M-test: Consider the series C,"=,- which np ' reduces to the geometric series for p = 0. To find the values of p for which this series converges, we first apply the ratio test: (6.110) (6.111) =
1x1 3
(6.112)
which says that independent of the value of p the series converges absolutely for 1x1 < 1 . At one of the end points, x = 1, the series converges for p > 1 and diverges for 0 < p 5 1 [Eq. (6.45)]. At the other end point, x = -1, for p > 1 the series becomes alternating series, which converges by Theorem 6.4. To check for uniform convergence, we use the M-test with the series " 1
(6.113)
n=l
which converges for p > 1 Comparing with
c,"=,we write Xn
np
(6.114) which holds for 1x1 5 1. Hence we conclude that the series
C,"==, np
converges uniformly and absolutely in the interval 1x1 5 1 for p > 1. Keep in mind that uniform convergence and absolute convergence are two independent concepts, neither of them implies the other. Weierstrass M-test checks for both uniform and absolute convergence.
6.7
PROPERTIES OF UNIFORMLY CONVERGENT SERIES
Uniform convergence is very important in dealing with series of functions. Three of the most important and frequently used properties of uniformly convergent series are given below in terms of three theorems:
320
SEQUENCES AND SERIES
Theorem 6.7. The sum of a uniformly convergent series of continuous functions is continuous. In other words, if un(z)are continuous functions in the interval [ L l ,L2],then their sum, f ( x ) = u n ( x ) ,is also continuous providcd that the series C;=, u,(x) is uniformly Convergent in the interval [Ll,L21. From this theorem we see that any series of functions which has discontiniiities in the interval [ L l ,Lz]cannot be uniformly convergent. Theorem 6.8. A uniformly convergent series of continuous functions can be integrated term by term in the interval of uniform convergence. In other words, in the interval of uniform convergence, [ L l ,L z ] ,we can interchange the integral and the summation signs:
xr=l
(6.115) (6.116) dun Theorem 6.9. If uiz(x)= - are continuous for [ L l , L z ]and the se-
dx
x,"==,
CC ries CTLE1 u,,(x) converges to f ( x ) for [ L l , L 2 ] ,and the series uL(x) coilverges uniformly for [ L I , L z ] ,then we can interchange the order of the differentiation and the summation signs:
(6.117) cc
=
Cu:,(x).
(6.118)
n=l
Other operations like addition, and multiplication with a continuous function, h ( r ) , of uniformly convergent series, f ( x ) = z,"==,un(x) and g ( x ) = 30 C,I=l I J , ~ ( Scan ) , be performed as follows:
(6.120) n=l
where the results are again uniformly convergent in [ L I L2]. , Example 6.10. Uniformly convergent series: Differentiability and integrability of uniformly convergent series gives us a powerful tool in obtaining new series sums from the existing ones. For example, we use the
POWER SERIES
321
geometric series 1 1-2
-=
00
Exn 1+ z + 2 =
+ . . . , lZ/
+23
< 1;
(6.121)
n=O
differentiating once gives us the series
d "
"
n=O
(1 - x)2
-
cn2n-1
(6.122)
n=O
00
--
d
- 1 -
+ 22 + 32' + . . . ,
1x1 < 1.
(6.123)
n= 1
Differentiating once more, we obtain 1
-
d "C
~ l d - = l
n=l
$ (nzn-l) ,
00
1x1 < 1, (6.124)
n=l
Similarly, by integration we obtain the series
Jc"dz[$---]
=l;'.[Fxn] n=O
00
=Eld s z n , "
(6.126)
n=O
22 23 -= II: + ++ . . . , 1x1 < 1. (6.127)
2
n=O
6.8
2
3
P O W E R SERIES
An important and frequently encountered class of uniformly convergent series is the power series of the form
c 00
c,,(5 - ICo)n = co
+
Cl(Z
- 20)
+
c2(2 - 20)'
+ ... ,
(6.128)
n=O
where C O , c1, c2, . . . are constants and ICO is called the point of expansion. Every power series has a radius of convergence defined about the point of expansion. To use the ratio test, we first obtain the limit
(6.130)
322
SEQUENCES AND SERIES
Hence the power series converges absolutely for (6.131) or for Ix - 201
< R,
(6.132)
where R is called the radius of convergence, which is defined as the limit (6.133)
The radius of convergence can be anything including zero and infinity. When R = 0, the series converges only at the point 2 0 . When R = 00, the series converges along the entire x-axis. If two power series, C,"==, c,,(z - xo), and CT=ob,L(x- ZO),, converge to the same function, f ( z ) , then the two series are identical, that is, c, = b, for all n. In other words, the power series representation of a function is unique. The uniform convergence of power series for the interior of any r satisfying 0 < r < R, where R is the radius of convergence, follows from the Ill-test by comparing C,"o=o c,(x - xo), with Cr=oM,,, Adn = Ic,I rn, where /c,(x - Z O ) ~ Ic,I rn for 0 < r < R. Example 6.11. Radius of convergence: Consider the following power series generated from the geometric series in Example 6.10:
We find their radius of convergences by using the ratio test. For the first series we write the limit (6.135) hence the series converges for 1x1 < 1 and R the ratio test gives
=
1. For the second series
(6.136) hence the radius of convergence is 1 and the series converges for 1x1 < 1. For the last series, we write the limit (6.137)
POWER SERIES
323
where the radius of convergence is again obtained as 1 and the series converges for 1x1 < 1. In other words, the series generated from the geometric series by successive differentiation and integration have the same radius of convergence. Actually, as the following theorem states, this is in general true for power series:
Theorem 6.10. Within the radius of converge, a power series can be differentiatedand integrated as often as one desires. The differentiated or the integrated series also converges uniformly with the same radius of convergence as the original series. Example 6.12. Binomial formula: Using the geometric series 00
1
(6.138)
l-x
n=O
after k-fold differentiation and using the formula
d kxn - n!xn-k dxk
(n- k)!'
(6.139)
we obtain
(6.140) which is the well-known binomial formula for (1 - x ) - ~ In . general the binomial formula is given as
(6.141)
where
(3
are called the binomial coefficients defined as
m!
(6.142)
If m is negative or noninteger, the upper limit of the series [Eq. (6.141)] is infinity. Two special cases,
(6.143) and
(6.144) are frequently used in obtaining approximate expressions.
324
6.9
SEQUENCES AND SERIES
TAYLOR SERIES A N D MACLAURIN SERIES
Consider a uniformly convergent power series, 03
f ( ~ =)
C
C,(Z
- 2 0 )n
, zo - R < z < zo
+ R,
(6.145)
n=O
with the radius of convergence R. Performing successive differentiations, we write
+ C1(Z f’(z)= c 1 + 2c2(z f(.)
= CO
-
+
f”(z)= 2 ~ 2
Icg)
+ + + 3c3(5 - + . . . C a ( Z - ZO)2
C3(Z
2 0 )2
-ZO)
+ ‘.
6 ~ 3 -( 20) ~
2 0 )3
+ ...
1
3
,
(6.146)
+
Based on Theorem 6.10, these series converge for zo - R < J: < 20 R Evaluating these derivatives at J: = ZO, we obtain the coefficients, en, as
.
(6.147)
c,
= f(n)(J:O)/n!,
thus obtaining the Taylor series representation of f(x) as
(6.148) When we set zo= 0, Taylor series reduces t o Maclaurin series: f(Z)=
6.10
c
031 -pqO)Z‘“. n. n=O
(6.149)
I N D E T E R M I N A T E FORMS A N D SERIES
It is well known that L’H6pital’s rule can be used to find the limits of indeterminate expressions like or However, this method frequently requires multiple differentiations, which makes it rather cumbersome to implement. In such situations, series expansions not only can help us t o find the limits of the
g.
325
INDETERMINATE FORMS AND SERIES
indeterminate forms but also can allow us t o write approximate expressions t o any desired level of accuracy. Using the series expansions of elementary functions, we can usually obtain the series expansion of a given expression, which can then be written t o any desired level of accuracy. Example 6.13. Indeterminate forms: Consider the limit
ex sin x
(6.150)
g.
Using the Maclaurin series of the elemenwhich is indeterminate as tary functions e x , s i n x , and cosx, we first write the numerator and the denominator in power series as
+ + + '.'] [x $ + $ + . " 1
ex sin x - [l + x $ $ cosx - ex 11 - ..Z "+ . . . ] 2! + . 4! +2-
+x2
3
-x - x 2
-
22 6
-
-
-
[I + x +
2-. .. 30
25 - . . . '
+ $ + .. .1 (6.151)
120
After a formal division of the numerator with the denominator, we obt ain the series ex sin x - -1 - -x 1 2 + -23 1 + ... , (6.152) cosx - ex 6 6 which yields the limit lim X+O
ex sin x cosx - ex
-+ -1.
(6.153)
This result can also be obtained by the L'H6pital's rule. However, the series method accomplishes a lot more than this. It not only gives the limit but also allows us to approximate the function in the neighborhood of x = 0 to any desired level of accuracy. For example, for small x we ex sin x can approximate as cosx - ex
ex sin x cos x - ex
=
1 -1 - -x2 6
+0(~3).
(6.154)
Example 6.14. Indeterminate forms: Let us now consider the function x2
+ (cos2 x
2 2 [COSZ x
which is as
-
-
1)
11 '
(6.155)
in the limit as x goes to 0. We first write the above expression 1 [cos2x - 11
+-1
22'
(6.156)
326
SEQUENCES AND SERIES
The first term, which is divergent as x 1 cos2z-1
0, can be written as
---f
1
-
...I
pie+f:4+ 2!
-
-z2
4!
2
-1
1 + -.4 - 226 + . . .’ 3
(6.157) (6.158)
45
which after a formal division gives the series expansion
1 -1 - -z2 1 1 - _[cos2z - 11 z2 3 15
+ ... .
(6.159)
Substituting Equation (6.159) into Equation (6.156), the divergent piece, -l/z2, is canceled by 1/z2to yield the finite result in the neighborhood of :1: = 0 as
2 + (cos2z - 1) 2 2 [cos2z -
11
-
1 1 - -z2 3 15
-_
+ 0(~4).
PROBLEMS
1. Find the limits of the following sequences:
(i) (ii)
{
(3n
-
I
q4+ J S T S ,
2+n3+7n4
{-},n=1,2
,....
2. Show the divergence by the n t h term test (i)
CT=lcos -.n237r
3. Show the divergence by the comparison test
n = 1 , 2 ,... .
(6.160)
PROBLEMS
327
4. Check the convergence of the following alternating series:
5 . Determine the convergence or the divergence of the following series:
(iii)
n2 C;==,n! + 3 '
6. Check the convergence of the following series and verify your answers by an other method:
328
SEQUENCES AND SERIES
7. Find the range of x for which the following series converge. Check the end points also.
(ii)
C:='=, n!zn.
8. The nth partial sum of a certain series is given as
s,(x)
= n2x/(1
+ n3x2).
For which one of the intervals, [-1,171 and [0.5,1],does this series converges uniformly. Explain.
9. Investigate the uniform convergence of the series with the partial sums
S,
= n2xePnx.
10. Check the uniform convergence of
11. Verify the formula
kx = 1 + - + k(k + 1lx2 + .. . (1 - X)k 1 1.2 k ( k 1). . ( k 72 - 1)%, . > 1x1 < 1. 1 . 2 . . .72 1
+ +
'
+
+
,
,
12. Using the binomial expansion, show the expansions
and
13. Find the Maclaurin expansions of sin2 x, cos2 x, and sinhx. Find their radius of convergence and show that they converge uniformly within this radius.
PROBLEMS
329
14. Find the Maclaurin expansion of 1/ cos x and find its radius of convergence.
15. Find the limit lim
Z+O
xe" sin 22 cos x - 2ex '
Using the series expansions of elementary functions about x = 0, find an approximate expression good to the fourth order in the neighborhood of x = 0.
16. Find the interval of convergence of the following series:
17. Evaluate the following definite integral to three decimal places:
18. Expand t,he following functions:
6)
1
(ii)
f(x) = G>
in Taylor series about x
=
f(x) =
x+2 (x 3)(x + 4) '
+
1 and find their radius of convergence.
19. Expand the following function in Maclaurin series:
20. Obtain the Maclaurin series
Show that the series converges for x = -1 and hence verify
c 00
log2
=
(- 1)"+' n n=l
330
SEQUENCES AND SERIES
21. Expand 1/x2 in Taylor series about x = 1. 22. Find the first three terms of the Maclaurin series of the following functions: (i)
f ( x ) = cos[ln(x
(ii)
sin x f ( x ) = -.
+ I)].
X
(iii)
1
f(x) =
JiT7G.
23. Using the binomial formula, write the first two nonzero terms of the series representations of the following expressions about x = 0:
6)
f(x) =
+d r n.
(4x - 1)* 1+ x 3
+7x4
24. Use the L’HBpital’s rule to find the limit lim
2-0
d2T-G 4x3 - 3x2
and then verify your result by finding an appropriate series expansion.
25. Find the limit lim . z+o 5x3
+ 2x2
by using the L’H6pital’s rule and then verify your result by finding an appropriate series expansion.
26. Evaluate the following limits and check your answers by using Maclaurin series: (i)
limx,o
1 - ex -
(ii)
limx-o
:[
X
-
1-
ex
1
-
1
.
CHAPTER 7
COMPLEX NUMBERS AND FUNCTIONS
As Gamow mentioned in his book, One Two Three ... Infinity: Facts and Speculations of Science, the 16th-century Italian mathematician Cardan is the first brave scientist t o use the mysterious number called the imaginary i with the property i2 = -1 in writing. Cardan introduced this number t o express the roots of cubic and quartic polynomials, albeit with the reservation that it is probably meaningless or fictitious. All imaginary numbers can be written as proportional to the imaginary unit i . It is also possible to define hybrid numbers, a ib, which are known as complex numbers. Complex analysis is the branch of mathematics that deals with the functions of complex numbers. A lot of the theorems in the real domain can be proven considerably easily with complex analysis. Many branches of science and engineering, like control theory and signal analysis, make widespread use of the techniques of complex analysis. As a mathematical tool, complex analysis offers tremendous help in the evaluation of series and improper integrals encountered in physical theories. With the discovery of quantum mechanics, it also became clear that complex numbers are not just convenient computational tools but also have a fundamental bearing on the inner workings of the
+
Essentials of Mathematical Methods in Science and Engineering. By Copyright @ 2008 John Wiley & Sons, Inc.
3. SelGuk Bayin 331
332
COMPLEX NUMBERS AND FUNCTIONS
universe. In this chapter, we introduce the basic elements of complex analysis, that is, complcx numbers and their functions.
7.1 T H E ALGEBRA OF C O M P L E X N U M B E R S A wcll-known result from mathematical analysis states that a given quadratic equation,
ax2 always has two roots,
x1
+ bx + c = 0, a , b, c E R,
and
52,
(7.1)
and can be factored as
(x - q ) ( x - x2) = 0.
(7.2)
A general cxpression for the roots of a quadratic equation exists, and it is given by the well-known formula
When the coefficients satisfy the inequality b2 - 4ac 2 0, both roots are real. However, when b2 - 4ac < 0, no roots can be found within the set of real numbers. Hence, the number system has to be extended to include a new kind of number, the imaginary i with the property
Now the roots can be expressed in terms of complex numbers as x1,2 =
-b & i d2a
, 4ac - b2 > 0.
(7.5)
In general a complex number, z , is written as 2 =
x +iy,
where .c and y are two real numbers. The real and the imaginary parts of z arc written, respectively, as R e z = x and I m z = y.
(7.7)
Complcx numbers are also written as ordered pairs of real numbers:
z = (x,y).
(7.8)
When y = 0, that is, I m z = 0, we have a real number, z = x,and when x = 0, that is, R e z = 0, we have a pure imaginary number, z = i y . Two complex nurnbers:
THE ALGEBRA OF COMPLEX NUMBERS
333
and
(7.10)
2 2 = (X2,Y2),
are equal if and only if their real and imaginary parts are equal:
(7.11) (7.12)
51 = x 2 ,
y1
= y2.
Zero of the complex number system, = 0, means x = 0 and y = 0. Two complex numbers, zland 2 2 , can be added or subtracted by adding or subtracting their real and imaginary parts separately as 21
+ iy1) f ( 2 2 + i y 2 ) = (51 * 2 2 + i ( Y 1 f Y2)).
(7.13) (7.14)
f 2 2 = (51
Two complex numbers, zland 2122
can be multiplied by first writing
22,
=
(21
+
iYl)(X2
+
(7.15)
iy2)
and then by expanding the right-hand side formally as 2122 = 2 1 x 2
+
i51y2
+
iy122
+
i2YlY2.
(7.16)
Using the property i2 = -1, we finally obtain the product of two complex numbers as 2122 = ( 5 1 5 2 - YlY2)
+
i(x1y2
+
y122).
(7.17)
The division of two complex numbers,
(7.18) can be performed by multiplying and dividing the right-hand side by 21 - 2 1 22
22
+ iy1 +
-iy2
(7.19)
iy2 ' 5 2 - iy2
+ y1y2 + i(YlX2 21y2) 4 + Y22 2 1 x 2 + YlY2 Y1X2 x1y2
-
21x2
-
(
-
22
(x2-iy2):
-
-
4+y;
x;+y;
(7.20)
)
(7.21)
Division by zero is not defined. The following properties of algebraic operations on complex numbers can be shown to follow from the above properties: 21
+
22 = z 2
21,552 21
+
Zl,
= 2221,
+ ( 2 2 + 23) = (21 + 2 2 ) + 23, 21 ( 2 2 2 3 ) = ( 2 1 Z 2 ) z3i 21(Z2
+
23) = 2 1 z 2
+
Z123.
(7.22) (7.23) (7.24) (7.25) (7.26)
334
COMPLEX NUMBERS AND FUNCTIONS
The complex conjugate, z * , or simply the conjugate of a complex number, z , is defined as
z* = x
-
iy,
(7.27)
In general the complex conjugate of a complex quantity is obtained by reversing the sign of the imaginary part or by replacing i with -2. Conjugation of complex numbers has the following properties:
(z1
+ z2)* = z; + z;,
(z1z2)* = z r z ; ,
(7.28) (7.29) (7.30)
z + z* = 2 R e z = 22, z - z* = 2 i I m z = 2iy.
(7.31) (7.32)
The absolute value, ( z (, also called the modulus, is the positive real number
(7.33) (7.34) Modulus has the following properties:
121
= ->
(7.36)
IzI = Iz*I 1
(7.37)
2
(z(
= zz*.
(7.38)
Triangle inequalities, 121
+ z21 I bll + 1221
(7.39)
and Iz1 - z21
2 I l Z l l - Iz211,
(7.40)
derive their name from the geometric properties of triangles and they are very useful in applications. The set of all complex numbers with the above algebraic properties forms a field and is shown as @. Naturally, the set of real numbers, R,is a subfield of @. A geometric representation of complex numbers is possible by introducing the complex z-plane, where the two orthogonal axes, x- and y-axes, represent the real and the imaginary parts of a complex number, respectively (Fig. 7.1).
THE ALGEBRA OF COMPLEX NUMBERS
335
Yf X
Figure 7.1
Complex z-plane.
From the z-plane it is seen that the modulus of a complex number, IzI = T , is equal to the length of the line connecting the point z to the origin 0. Using the length of this line, T , and the angle that it makes with the positive x-axis, 8,which is called the argument of z , usually written as argz, we introduce the polar representation of complex numbers as
z
= r(cos8+
The two representations, z(x, y) and equations
Z(T,
isin8).
(7.41)
O ) , are related by the transformation
x = T cos 0,
(7.42)
y = rsine
and with the inverse transformations r=
Jm',
e = tan-'
(z)
.
(7.43)
Using the polar representation, we can write the product of two complex numbers, z1 = T I (cos 01
+ i sin 81)
(7.44)
and z2 =
r2(cos02+ i s i n Q 2 ) ,
(7.45)
as
ziza = T ~ T Z [ ( C O CS ~O ~S ~ Z- sin81 sin&) = rlrZ[cos(81
+ 8 2 ) + isin(81 + &)I.
+ i(sin81 cos02 + cosel sinez)] (7.46) (7.47)
336
COMPLEX NUMBERS AND FUNCTIONS
In other words, the modulus of the product of two complex numbers is equal to the product of the moduli of the multiplied numbers, lz1z2l
(7.48)
= lz1lIz21 = 7-17-2,
and the argument of the product is equal to the sum of the arguments: argzlz, = argzl
+ argz2 = 81 + 82.
(7.49)
In particular, when a complex number is multiplied with i , its effect on z is to rotate it by 7r/2 : (7.50) (7.51) Using Equation (7.47), we can write
. -t &)I. (7.52) Consequently, if z1 = z2
= ...=
z,
= r(cos8
+ i s i n Q ) ,we obtain
zn = rn [cosn8 + i sin 1281. When
7- =
(7.53)
1, this becomes the famous DeMoivre’s formula:
[cos6
+ i sin 81, = cos 71.8+ i sin no.
(7.54)
The ratio of two complex numbers can be written in polar form as z1 7-1 = -[cos(81 22
7-2
- 6,)
+ i sin(O1 - Q2)],
7-2
# 0.
(7.55)
As a special case of this, we can write z-l
= r-l [cos8 - i sin 81, 7-
# 0,
(7.56)
which leads to z - n = r P T[cos L n8 - i
sin nQ],r
# 0,n > 0;
thus DeMoivre’s formula is also valid for negative powers.
7.2
ROOTS OF A COMPLEX NUMBER
Consider the polynomial
(7.57)
ROOTS OF A COMPLEX NUMBER
zn which has n roots, z sentation of z ,
~
zo = 0,
= z : ' ~ , in
z
n = positive integer,
337
(7.58)
the complex z-plane. Using the polar repre-
= r(cosQ+isinQ),
(7.59)
zo = rO(cos&+isinQO),
(7.60)
we can write Equation (7.58) as
+
rn (cos nQ+ i sin no)= T O(cos 80 i sin 0,) ,
(7.61)
which offers the solutions 1/ n r=rO , nQ+27rk=Qo, k = 0 , 1 , 2,... .
(7.62)
The first equation gives the all equal moduli of the n roots, while the second equation gives their arguments. When k is an integer multiple of n,no new roots emerge. Hence we obtain the arguments of the n roots as (7.63) These roots correspond to the n vertices, (7.64) of an n-sided polygon inscribed in a circle of radius r;ln. Arguments of thesc roots are given as
("",((""."'>.(""+-) n
n
n
2T 2
n
,...,
n
("n
27r. ( n - 1)
n
which arc separated by
ae,
27r
= -.
n
(7.66)
In Figure 7.2 we show the 5 roots of the equation z5
-
1 = 0,
(7.67)
338
COMPLEX NUMBERS AND FUNCTIONS
Figure 7.2
where n
=5
Roots of '2
-
1 = 0.
and 1 = cos 0
+ i sin 0.
(7.68) (7.69)
60 = 0.
(7.70)
20 =
Hence TO
=
1 and
Using Equation (7.66), this gives the moduli of all the roots as 1 and their arguments: arg zi = arg zi-l i = 1,. . . , 5 , as
+ F,
argzl
= 0,
271 + -, 5 271 271. 471 argz3 = - + - = 5 5 5' 4~ 27l 67l argZ4 = - + - = 5 5 5 ' 67l 27l 8.ir argz5 = - + - = -. 5 5 5 argz2
If rn,and
12
=O
(7.71)
are positive integers with no common factors, then we can write
where k = 0 , 1 , 2 , . . . , n - 1.
INFINITY AND THE EXTENDED COMPLEX PLANE
339
7.3 INFINITY AND THE EXTENDED COMPLEX PLANE In many applications we need to define a number,
z
+
00
00,with
the properties
+ z = 00, for all finite z ,
= 00
(7.74)
and
z
‘00= 00
The number
03,
.z
z # 0 but including z = 00.
= 00, for all
(7.75)
which represents infinity, allows us to write
5=0O, z f 0 , 0
(7.76)
and
z
00
=o,
z#O0.
(7.77)
In the complex z-plane, @, there is no point with these properties, thus we introduce the extended complex plane, which includes this new point, 03, called the infinity:
c,
@. = c +{m}.
(7.78)
A geometric model for the members of the extended complex plane is possible. Consider the three-dimensional unit sphere S :
+ x; + xi = 1.
x:
(7.79)
For every point on S, except the north pole N at (O,O,l), we associate a complex number X I +ix2
z=
1 - x3 This is a one-to-one correspondence with the modulus squared,
(7.80)
(7.81) which, after using Equation (7.79), becomes
IzI 2 = -.1+x3
1 - x3
(7.82)
Solving this equation for x3 and using Equations (7.79) and (7.80) t o write and 5 2 , we obtain
XI
z 1=
+ z* 1 + jzI2 ’ z
~
z - z* x2
=i
23 =
~
(1 + lz12)
1zI2 - 1 1zI2 1’
+
(7.83) (7.84)
(7.85)
340
COMPLEX NUMBERS AND FUNCTIONS
T'
1N
Figure 7.3
Riemann sphere and stereorgraphic projections.
This is a one-to-one correspondence with every point of the z-plane with every point, except (0,0, l),on the surface of the unit sphere. The correspondence with the extended z-plane can be completed by identifying the point ( O , O , 1) with m. Note that from Equation (7.85) the lower hemisphere, 2 3 < 0, corresponds to the disc IzI < 1, while the upper hemisphere, 5 3 > 0, corresponds to its outside > 1. We identify the z-plane with the zlsz-plane, that is, the equatorial plane, and use 2 1 - and the 22-axes as the real and the imaginary axes of the z-plane, respectively. In function theory the unit sphere is called the Riemann sphere. If we write z = 2 iy and use Equations (7.83)-(7.85), we can establish the ratios
(zI
+
(7.86) which with a little help from Figure 7 . 3 shows that the points z , 2,and N lie on a straight line. In Figure 7 . 3 and Equation (7.86) the point N is the north pole, (O,O,l), of the Riemann sphere, the point 2 = ( Z ~ , Q , I C ~is) the point at which the straight line originating from N pierces the sphere and finally, z is the point where the straight line meets the equatorial plane, which defines the z-plane. This is called the stereographic projection. Geometrically a stereographic projection maps a straight line in the z-plane into a circle on S , which passes through the pole and vice versa. In general, any circle on the sphere corresponds to a circle or a straight line in the z-plane. Since a circle on the sphere can be defined by the intersection of a plane,
+ bxz +
U Z ~
C Z ~=
d, 0 5 d
< 1,
(7.87)
INFINITY AND THE EXTENDED COMPLEX PLANE
341
with the sphere
x:
+ + 2 52
2 23 =
(7.88)
1,
using Equations (7.83)-(7.85), we can write Equation (7.87) as U(Z
+ z*)
-
bi(z - z * )
+
~ ( 1 21 ~1) =
d(lzI2
+ 1)
(7.89)
or as
+
(d - c ) ( x 2 y2) - 2ax
-
2by
+ d + c = 0.
(7.90)
For d # c this is the equation of a circle, and it becomes a straight line for d = c. Since the transformation is one-to-one, conversely, all circles and straight lines on the z-plane correspond to stereographic projections of circles on the Riemann sphere. In stereographic projections there is significant difference between the distances on the Riemann sphere and their projections on the z-plane. Let ( x 1 , 2 2 ,x3) and (x:,xi,z j ) be two points on the sphere, that is,
x: xi2
+ x2 + 2
2 23 =
+ xi2 + x:
1,
(7.91)
= 1.
(7.92)
We write the distance, d ( z , z’), between these points as [ d ( z , z’)I2 = (XI =2 -2 ( x 4
+(
~ 2 +(23 + x2h. + 2 3 2 ; ) . -
-
(7.93) (7.94)
Using the transformation equations [Eqs. (7.83)-(7.85)] we can write the corresponding distance in the z-plane as (7.95)
If we take one of the points on the sphere as the north pole, N , that is, z’ Equation (7.95) gives
= 03,
(7.96)
+
*
Note that the point z = x iy, where x and/or y are infinity, belongs to the z-plane. Hence it is not the same point as the 00 introduced above.
342
COMPLEX NUMBERSAND FUNCTIONS
Figure 7.4
Graph of f(z)
7.4 COMPLEX FUNCTIONS We can define a real function, f , as a mapping that returns a value, f ( x ) , for each point, x , in its domain of definition:
f :x
---f
f(x).
(7.97)
Graphically, this can be conveniently represented by introducing the rectangular coordinates with two perpendicular axes called the x- and the y-axes. By plotting the value, y = f ( x ) , that the function returns along the y-axis directly above the location of x along the x-axis, we obtain a curve as shown in Figure 7.4 called the graph of f(x). Complex-valued functions are defined similarly as relations that return a complex value for each z in the domain of definition:
f :z
+ f(z).
(7.98)
Analogoiis to real functions, we introduce a dependent variable w and write a complex function as w =f(z).
(7.99)
Since both dependent and independent variables have real and imaginary parts, z=z+iy, w =u+iv,
(7.100) (7.101)
it is generally simpler to draw w and z on separate planes. Now the function w = f ( ~ )which , gives the correspondence of the points in the z-plane to the points in the w-plane, is called mapping or transformation. This allows us to view complex functions as operations that map curves and regions in their
343
COMPLEX FUNCTIONS
Figure 7.5
The w-plane.
domain of definition to other curves and regions in the w-plane. For example, the function
w=d m + i y
(7.102)
+
maps all points of a circle in the z-plane, x2 y2 = c2, c 2 0, to u = c and v = y in the w-plane. Since the range of y is -c 5 y 5 c, the interior of the circle is mapped into the region between the lines -u 5 T: 5 u and u = c in the w-plane (Fig. 7.5). The domain of definition, D , of f means the set of values that z is allowed to take, while the set of values, w = f ( z ) ,that the function returns is called the range of w. A function is called single-valued in a domain D if it returns a single value, w, for each z in D. From now on, we use the term function only for the single-valued functions. Multiple-valued functions like z1I2 or logz can be treated as single-valued functions by restricting them to one of their allowed values in a specified domain of the z-plane. Domain of definition of all polynomials,
f ( z ) = a,zn
+ an-lzn--l +
' ' '
+ ao,
(7.103)
is the entire z-plane, while the function
1 f(z) =
is undefined at the points z = 35,. Each function has a specific real, u(x,y), and an imaginary,
w =f = u(2,y)
+ i U ( Z , y).
(7.104)
~ ( 2 y ),,
part:
(7.105) (7.106)
344
COMPLEX NUMBERS AND FUNCTIONS
Consider f ( z ) = z 3 . We can write
(7.107)
f ( z ) = z3
= z 2z = ((7: = =
(7.108)
+iy)2(z + i y )
[(x2- y2)
(7.109)
+ i(2zy)](z+ iy)
(7.110)
[(2- y2)z - 2xy2]+ i[y(xc”- y2) + 2z2y],
(7.111)
u ( z ,y) = ( x 2- y2)z - 2xy2
(7.112)
+ 2Z2Y.
(7.113)
thus obtaining
and u ( 5 ,y) = y(z2 - v 2 )
For w = sinz, the u((7:,y) and the v(x,y) functions are simply obtained from the expression w = sin(x + iy) as w = sin x cosh y i cos x sinh y.
+
7.5
LIMITS AND CONTINUITY
Since a complex function can be written as
w
=
4 2 , Y)
+
iV(Z,
v),
(7.114)
its limit can be found in terms of the limits of the two real functions u(x, y) and u(z,y). Thus the properties of the limits of complex functions can deduced from the properties of the limits of real functions. Basic results can be summarized in terms of the following theorems: Theorem 7.1. Let f ( z ) = u ( z ,y )
The limit of f ( z ) at
+ iu(lc,y), z = + i y and zo = zo + iyo,
20
(7:
(7.115)
exists, that is, lim f ( z ) = uo Z-ZO
+ iwo,
(7.116)
if and only if
lirn
u ( x , y )= uo,
(7.117)
(s>Y)-(.o,Yo)
(7.118) Theorem 7.2. If fl(z)and exist at 20:
f2(z)
are two complex functions whose limits
(7.119) (7.120)
DIFFERENTIATION IN THE COMPLEX PLANE
345
then the following limits are true: = w l + w2,
(7.121)
= w1w2,
(7.122) (7.123)
The continuity of complex functions can be understood in terms of the continuity of the real functions u and u. Theorem 7.3. A given function f (2) is continuous at zo if and only if all the following three conditions are satisfied:
(i) (ii) (iii)
f(z0)
lim,,,, lim,,,,
exists, f ( z ) exists, f ( z ) = f(zo).
(7.124)
This theorem implies that f ( ~is)continuous if and only if u(z, y) and u(x,y) are continuous.
7.6
DIFFERENTIATION I N T H E COMPLEX PLANE
As in real analysis, the derivative of a complex function at a point, z , in its domain of definition is defined as (7.125) Nevertheless, there is a fundamental difference between the differentiation of complex and real functions. In the complex z-plane a given point z can be approached from infinitely many different directions (Fig. 7.6). Hence a meaningful definition of derivative should be independent of the direction of approach. If we approach the point z parallel to the real axis, AZ = A x , we obtain the derivative
(7.126)
du --+i--. ax -
dv dx
(7.128)
346
COMPLEX NUMBERS AND FUNCTIONS
Z
Az iAy
w
0
Figure 7.6
X
Differentiation in the complex plane.
On the other hand, if z is approached parallel t o the imaginary axis, iAy, the derivative becomes
=
-2-
.du+ dv dY dY
Az =
(7.131)
or
df
-
.du
dv
- - -- 2dz dy dy
(7.132)
For a meaningful definition of derivative, these two expressions should agree. Hence giving us the conditions for the existence of derivative at z as
--ax d y ’
du
dv
(7.133)
dv dX
-%-.
(7.134)
--
.du dY
These are called the Cauchy-Riemann conditions. Note that choosing the direction of approach first along the x- and then along the y-axes is a matter of calculational convenience. A general treatment will also lead t o the same conclusion. Cauchy-Riemann conditions shows that the real and the imaginary parts of a differentiable function are related. In summary, the Cauchy-Riemann conditions have t o be satisfied for the derivative t o exist at a given point. However, as we shall see, in general they are not the sufficient conditions.
DIFFERENTIATION IN THE COMPLEX PLANE
347
Example 7.1. Cauchy -Riemann conditions: Consider the following simple function: f(z)=z
2
,
(7.135)
We can find its derivative as the limit (7.136) =
lim
6-0
{ f (2z + 6))
(7.137) (7.138)
= 22.
If we write the function, f ( z ) = z 2 , as
+ i229,
f ( z ) = ( 2- y2)
(7.139)
we can easily check that the Cauchy-Riemann conditions are satisfied everywhere in the z-plane: dU
dV
dX
dYdU
dX We now consider the function
dY
- = 22 = -,
(7.140)
dV - 2y = --
f(.)
’
2
(7.141)
= IZI
and write the limit (7.142)
+ S)(z* + S*)
-
zz*]
(7.143) (7.144)
6-0
At the origin, z = 0, regardless of the direction of approach, the above limit exists and its value is equal to 0; thus we can write the derivative (7.145) For the other points, if 6 approaches zero along the real axis, S = t, we obtain
dz
(7.146) E+O
=z*+z
(7.147)
348
COMPLEX NUMBERS AND FUNCTIONS
and if 6 approaches zero along the imaginary axis, 6 = i e , we find dz
(7.148) iE-O
= z* - z .
(7.149) 2
Hence the derivative of f ( z ) = IzI does not exist except at z = 0. In fact, the Cauchy-Riemann conditions for f ( z ) = 1zI2 are not satisfied,
dv
dU
-=2x#-=O,
dY dv - = 0 # - - =dU 2 dX dY
(7.150)
dX
unless z
(7.151)
Y>
= 0.
Example 7 . 2 . Cauchy- Riemann conditions: Consider the function IZI
z
# 0,
(7.152)
= 0.
At z = 0 we can easily check that the Cauchy-Riemann conditions are satisfied: (7.153) (7.154) However, if we calculate the derivative using the limits in Equations (7.127) and (7.130), we find
dfo = dz
lim
u ( A x 0, ) - u ( O , O )
Az-0
+i
AX, 0) - v(0,O) AX
]
(7.155)
1
+ i-=l+i
(7.156) (7.157)
and df (0) = lim dz
iAy-0
~ ( 0iAy) , - u(0,O)
I -
= ~A lim Y-o = -1
+i.
(
+i
~ ( 0i A, y ) - v(0,O)
ZAY
1
( i ~ l y ) 1~ ( ~ A Y 1) ~ 2-i ~ i A~y ) ( ~~ A Yi A) y~
+
]
(7.158) (7.159) (7.160)
ANALYTIC FUNCTIONS
349
In other words, even though the Cauchy-Riemann conditions are satisfied at z = 0, the derivative, f ’ ( O ) , does not exist. That is, the Caiichy-Riemann conditions are necessary but not sufficient for the existence of derivative. The following theorem (for a formal proof see Brown and Churchill) gives the sufficient condition for the existence of f ’ ( z ) : Theorem 7.4. If u ( z ,y) and ~ ( zy), are real- and single-valued functions with continuous first-order partial derivatives at ( 2 0 ,yo), then the CauchyRiernann conditions at ( 2 0 ,yo) imply the existence of f ’ ( z 0 ) . What happened in Example 7.2 is that in order to satisfy the CauchyRieniann conditions at ( O , O ) , all we needed was the existence of the firstorder partial dcrivatives of u ( z ,y) and u(z,y ) at (0,O). However, Theorem 7.4 not only demands the existence of the first partial derivatives of u and ‘u at a given point but also needs their continuity at that point. This means that thc first-order partial derivatives should also exist in the neighborhood of a given point for the function to be differentiable. 7.7
ANALYTIC FUNCTIONS
A function is said to be analytic at zo if its derivative, f ’ ( z ) , exists not only at zo but also at every other point in some neighborhood of 2 0 . Similarly, if a function is analytic at every point of some domain D , then it is called analytic in D . All polynomials,
+ a12 + ’ . . + anzn,
f ( z ) = a0
(7.161)
are analytic everywhere in the z-plane. Functions analytic everywhere in the z-plane are called entire functions. Since the derivative of
f
=
1H2
(7.162)
does not exist anywhere except a t the origin, it is not analytic anywhere in the z-plane. If a function is analytic at every point in some neighborhood of a point zo, except the point itself, then the point zo is called a singular point. For example, the function
(7.163) has a singular point at z = 2 . If two functions are analytic, then thcir sum and product are also analytic. Their quotient is analytic except at the zeros of the denominator. If we let f l ( z ) be analytic in domain D1 and let f 2 ( z ) be analytic in domain D2, then the composite function (7.164)
350
COMPLEX NUMBERS AND FUNCTIONS
is also analytic in the domain D1. For example, since the functions f l ( z ) = z2
+ 2 and f i ( z ) = exp(z) + 1
(7.165)
are entire functions, the composite functions
and
are also entire functions.
7.8
HARMONIC FUNCTIONS
+
Given an analytic function, f ( z ) = u iv,defined in some domain, D , of the z-plane, the Cauchy-Riemann conditions,
dv ax dy’ dv du - -ax dy’ du
--_
(7.168) (7.169)
are satisfied at every point of D. Differentiating the first condition with respect to x and the second condition with respect t o y, we get (7.170) For an analytic function the first-order partial derivatives of u and v are continuous, hence the mixed derivatives, d2v/dxdy and d2v/aydx, are equal, and thus we obtain
d2U 8% -+-=o. 8x2 dy2
(7.171)
That is, the real part of an analytic function, u(x, y), satisfies the two-dimensional Laplace equation in the domain of definition D. Similarly, differentiating Equation (7.168) with respect to y and Equation (7.169) with respect to x and then by adding the results, we obtain
d2v d2v -+ - = o . 8x2 dy2
(7.172)
In other words, the real and the imaginary parts of an analytic function satisfy the two-dimensional Laplace equation. Functions that satisfy the Laplace equation in two dimensions are called harmonic functions. They could be
HARMONIC FUNCTIONS
351
used either as the real or the imaginary part of an analytic function. Pairs of harmonic functions, (u, v), connected by the Cauchy-Riemann conditions are called the conjugate harmonic functions.
Example 7.3. Conjugate harmonic functions:
f(x)
=
x3
-
Given the real function
3y2x,
(7.173)
it can be checked easily that it satisfies the Laplace equation
(7.174) Hence it is harmonic and can be used to construct a n analytic function. Using it as the real part, u = x3 - 3y2x, we can find its conjugate pair
du dv as follows: Using the first Cauchy-Riemann condition, - = ax dg' we write
dv
- = 3x2 - 3y2,
dY
(7.175)
which can be integrated immediately t o get
v(x,y) = 3 2 y - y3
+ @(.),
(7.176)
where @(x) is arbitrary at this point. We now use the second Cauchy-
dv
du
to obtain an ordinary differential equaRiemann condition, - = --, dx dy tion for @(x):
+ @'(x) = 6yx,
~ X Y
@'(z)= 0 , solution of which gives @(z) = (7.176) yields v(z, y ) as
v(x, y)
CO.
(7.177) (7.178)
Substituting this into Equation
= 3x2y - y3
+ co.
(7.179)
It can easily be checked that v is also harmonic.
Example 7.4. C - R conditions in polar coordinates: In polar representation a function can be written as
Using the transformation equations
x = r c o s e and y
= rsin0,
(7.181)
352
COMPLEX NUMBERS AND FUNCTIONS
we can write the Cauchy-Riemann conditions as
d u - _1dv _ -
(7.182)
dr r 80' 1 d u dv - _-- rd0 dr'
(7.183)
Example 7.5. Derivative in polar representation: Let us write the derivative of an analytic function, f ( z ) = u(r,0) +iv(r,O ) , in polar coordinates as
df - d u d r - - -dr d z
dz
d u d 0 +z--. d v d r +i-- d u d 0 + -80 d z drdz dOdz'
(7.184)
Substituting the Cauchy-Riemann conditions [Eqs. (7.182) and (7.183)] in Equation (7.184) we write
df dudr d u d 0 .dv dr dud0 - -- T-+ z-+ ir-dz
dr d z
drdz
= -d u [dr -+irg]
dr d z
Since z
= reie, we
drdz
dr d z
+ i K dv [,+ir$]. dr
(7.185) (7.186)
can write (7.187)
Hence the expression inside the square brackets in Equation (7.186) is (7.188) which, when substituted into Equation (7.186), gives (7.189) Following similar steps in rectangular coordinates, we obtain
df - d u .dv _ - - +z-.
dz
7.9
dx
dx
(7.190)
BASIC DIFFERENTIATION FORMULAS
If the derivatives w', wi,and w; exist, then the basic differentiation formulas can be given as
(1) dc dz
- = 0, c E
dz
C,and - = 1 dz
(7.191)
ELEMENTARY FUNCTIONS
dw dz
d(cz) dz
-=c--.
(7.192)
d dwl d ( w 1 + w2) = -+ -. dz
dz
d(WlW2)
dz
d
= w1-
~
dz
353
~
2
dz
+2 dwl dz -202.
(7.193)
(7.194)
(7.195)
(7.196)
d
-zn dz and z
= nzn-l, n
> 0,
(7.197)
# 0 when n < 0 integer.
7.10
7.10.1
ELEMENTARY FUNCTIONS Polynomials
The simplest analytic function different from a constant is z . Since the product and the sum of analytic functions are also analytic, we conclude that every polynomial of order n,
P,(z) = a0
+ a1z + . . . + anzn, a , # 0,
(7.198)
is also an analytic function. All polynomials are also entire functions. The fundamental theorem of algebra states that when n is positive, P,(z) has at least one root. This simple-sounding theorem, which was the doctoral dissertation of Gauss in 1799, has far-reaching consequences. Assuming that z1 is a root of P,, we can reduce its order as
Pn(.) = (2 - Z l ) P n - l ( Z ) .
(7.199)
354
COMPLEX NUMBERS AND FUNCTIONS
Similarly, if to writ,e
z2
is a root of Pn-l(z), we can reduce the order one more time
pn(z) = ( z - z~)(z- .2)Pn-z(z).
(7.200)
Cascading like this we eventually reach the bottom of the ladder as
PTL(Z) = (2 - z1)(z
- 22)
' . . ( z - zn).
(7.201)
In other words, a polynomial of order n has n, not necessarily all distinct, roots in the complex plane. Significance of this result becomes clear if we remember how the complex algebra was introduced in the first place. When equations like z2+1=0
(7.202)
are studied, it is seen that no roots can be found among the set of real numbers. Hence the number system has to be extended to include the complex numbers. We now see that in general the set of polynomials with complex coefficients do not have any other roots that are not included in the complex plane, @, hence no further extension of the number system is necessary. 7.10.2
Exponential Function
Let us consider the series expansion of the exponential function with a pure imaginary argument as (7.203) We write the even and the odd powers separately: (7.204)
Recognizing the first and the second series as cosy and sin y> respectively, we obtain eZy= cos y
+ i sin y,
(7.206)
which is also known as Euler's formula. Multiplying this with the real number e.', we obtain the exponential function
ez
= e"(cosy
+isiny).
(7.207)
355
ELEMENTARY FUNCTIONS
Since the functions u = e" cosy and v = ex sin y have continuous first partial derivatives everywhere and satisfy the Cauchy-Riemann conditions, using Theorem 7.4, we conclude that the exponential function is a n entire function. Using Equation (7.190), namely
du dv df - - +i-
dx
dz
(7.208)
dx'
we obtain the derivative of the exponential function as the usual expression de" dz
-- ez.
(7.209)
Using the polar representation in the w-plane, u write
w = ez
= p
cos 4 , v
= p(cosq5+isin4).
= p sin
4.we
(7.210)
Comparing this with
e z = e"(cosy
+ isiny),
(7.211)
4 = y,
(7.212)
we obtain p = ex and
that is,
lez( = e" and arge" = y.
( 7.2 13)
Using the polar representation for two points in the w-plane, ez'
-
p1 (cos 41
- p2 (cos 4 2 -
+ i sin h ) , + i sin h),
(7.214) (7.215)
we can easily establish the following relations: ez1e"2
-
ezl+"z
,
(7.216)
( 7.2 17) (ez)n = e T L Z .
(7.218)
In terms of the exponential function [Eq. (7.206)]; the polar representation of 2,
z=r(cosO+isinO),
(7.219)
z = r eiQ ,
(7.220)
can be written as
356
COMPLEX NUMBERS AND FUNCTIONS
which is quite useful in applications. Another useful property of ez is that for an integer n we obtain 2x2 n
-
-(e
-
1-12
(7.221)
z 2n7ri
(7.222) (7.223)
hence we can write ez+2nai
-e
e = ez.
In other words, ez is a periodic function with the period 27r. Series expansion of ez is given as
ez
=
z
z'
1+ - + - + . .. l! 2!
(7.224) (7.225)
n=O
7.10.3
Trigonometric Functions
Trigonometric functions are defined as ,it
cosz
=
sinz
=
+ e-iz
2 ,iz
(7.226)
'
- e-iz
(7.227)
22
Using the series expansion of ez [Eq. (7.225)], we can justify these definitions as the usual series expansions: cosz
=
z2
1- 2!
z4 ++." 4!
,
(7.228) (7.229)
Since eiz and e P i z are entire functions, cos z and sin z are also entire functions. Using these series expansions, we obtain the derivatives:
d
- sinz = cosz,
dz d cosz = -sinz. dz
(7.230) (7.231)
The other trigonometric functions are defined as sin z cos z t a n z = -, cot z = cos z sin z ' 1 1 sec z = -, cscz = -. cos 2 sin z
(7.232) (7.233)
357
ELEMENTARY FUNCTIONS
The usual trigonometric identities are also valid in the complex domain: sin 2 z +cos 2 z = 1, sin(z1 f 2 2 ) = sin z1 cos z2 fcos z1 sin z2, cos(z1 f 2 2 ) = cos z1 cos 22 T sin z1 sin 2 2 ,
(7.234) (7.235) (7.236)
sin(-z) = - sin z , cos(-2) = cosz,
(7.237) (7.238)
z)
= cosz,
(7.239)
sin 22 = 2 sin z cos z ,
(7.240)
sin
(4
-
cos2z
7.10.4
= cos2
z
-
sin2 z .
(7.241)
Hyperbolic Functions
Hyperbolic cosine and sine functions are defined as (7.242) sinhz
(y - e-z
(7.243) 2 ‘ Since ez and e-’ are entire functions, coshz and sinhz are also entire functions. The derivatives d (7.244) - sinh z = cosh z , dz d - coshz = sinhz (7.245) =
dz
and some commonly used identities are given as cosh 2 z -sinh 2 z = 1, sinh(z1 f z 2 ) = sinh z1 cosh z2 f cosh z1 sinh z 2 , cosh(z1 2 2 ) = cosh z1 cosh 2 2 f sinh z1 sinh 2 2 , sinh(-z) = - sinh z , cash( -2) = cash Z ,
(7.246) (7.247) (7.248)
sinh 22 = 2 sinh z cosh z .
(7.251)
*
(7.249) (7.250)
Hyperbolic and trigonometric functions can be related through the formulas 1 (7.252) cos z = cos(x iy) = -(ezz-Y ePiz+Y) 2 1 1 (7.253) = -e Y ( c o s x + i s i n x ) + - e Y ( c o s z - i s i n x ) 2 2
+
=
(
eY
= cos x
+ e-Y
+
eY
)cosx-i(
cosh y
-
i sin x sinh y.
-
e-Y
)sin,
(7.254)
(7.255)
358
COMPLEX NUMBERS AND FUNCTIONS
arid similarly, sin z
= sin x cosh y
+ i cos zsinh y.
(7.256)
Froin these formulas we can deduce the relations sin(iy) = i sinh y; cos(iy) = coshy. 7.10.5
(7.257) (7.258)
Logarithmic Function
Using the polar representation, z
= reie, we
w
can define a logarithmic function,
= logz,
(7.259)
as
logz
= Inr
+ iQ,
r > 0.
(7.260)
Since is real and positive, an appropriate base for the l n r can be chosen. Since the points with the same T but with the arguments Q3=2n7r,n = 0 , 1 , . . . , correspond to the same point in the z-plane, log z is a multivalued function, that is, for a given point in the z-plane, there are infinitely many logarithms, which differ from each other by integral multiples of 27ri : w,, = log z = In jzI
+ i arg z
= l n r + i ( B f 2 n n ) , n=0,1, ... , 0 5 0 < 2 i 7 .
(7.261) (7.262)
The value, ‘ ~ ~ 1 corresponding 0, to n = 0 is called the principal value or the principal branch of logz. For n # 0, w, gives to the n t h branch value of log z . For example, for z = 5, z = -1, and 2 = 1 + i we obtain the following logarithnis:
w, = log5 = In5 + i a r g 5 = In5 + i ( O f 2nn), w,,= log(-1) = In 1 + z(i7 f 2n7r) = i(7r f 2n7r), w,,= l o g ( l + i) = In ~ ‘ 3 +i
(7.263) (7.264) (7.265) (7.266) (7.267)
For a given value of n,the single-valued function UJ, =
log z = In IzI
= Inr
+ i arg z
+ i (0 i2n7r), 0 5 0 < 27r,
(7.268) (7.269)
359
ELEMENTARY FUNCTIONS
with the
11
and the v functions given as
u = lnr, v = 0 f 2n7r,
(7.270) (7.271)
has continuous first-order partial derivatives, (7.272) which satisfy the Cauchy-Riemann conditions [Eqs. (7.182) and (7.183)]; hence Equation (7.269) defines an analytic function in its domain of definition. Using Equation (7.189), we can write the derivative of logz as the usual expression d
(7.273) (7.274) (7.275)
Using the definition in Equation (7.269), one can easily show the familiar properties of the log z function as log z1 z2
+ log
= log z1
21
log-
22,
(7.276)
= logal - logz2.
(7.277)
22
Regardless of which branch is used, we can write the inverse of w = logz as ew
(7.278)
= ,lnz -
e(ln~+iO)
-
,lnr
(7.279)
iB
e
(7.280) (7.281) (7.282)
= re20 = z.
Hence elogz
(7.283)
= 2;
that is, the exp and the log functions are inverses of each other. 7.10.6
Let
7n
Powers of Complex Numbers
be a fixed positive integer. Using Equation (7.269), we can write mlog z = m l n r
+ im(8 f 2n7r),
R
= 0,1,...
.
(7.284)
360
COMPLEX NUMBERS AND FUNCTIONS
Using the periodicity of ez [Eq. (7.223)] and Equation (7.262), we can also write log Z m = log[&(o*2"") ] , n = 0 , 1 , . . . , = In rm im(8 f 2n7r).
(7.285) (7.286)
+
Comparing Equations (7.284) and (7.286), we obtain rnlogz
= logzm.
(7.287)
Similarly, for a positive integer p we write (7.288) = Inrl/p
i + -(Of a h ) , k = 0,1,... ,( p
P
-
1).
(7.289)
We can also write log Z'/P = log T'/Pe('/P)('*2nT)
[
= in+
1,
i + -(e f2 k 4
P
n = 0,1,.. . ,
k = o , i , . . . , ( p - 1).
(7.290) (7.291)
Note that due to the periodicity of the exponential function e(i/P)(o*2nx),no new root emerges when n is an integer multiple of p . Hence in Equations (7.289) and (7.291), we have defined a new integer k = 0 , 1 , . . . , ( p - 1). Comparing Equations (7.289) and (7.291) we obtain the familiar expression (7.292) In general we can write (7.293)
or p/P
= ,(m/p) 1%
2,
(7.294)
In other words, the p distinct values of logzm/p give the number zrn/P. For example, for the principal value of z ~ /that ~ , is, for k = 0, we obtain *5/3
= J5/3)
1% z
(7.295)
= ,(5/3)(lnr+iO)
(7.296)
- r5/3ei(5/3)o -
(7.297)
361
ELEMENTARY FUNCTIONS
All three of the branches are given as
z5/3 - T5/3ei(5/3)(Q*2k.rr),
= 0,1,2.
(7.298)
We now extend our discussion of powers t o cases where the power is complex: w = zc or w = z-",
(7.299)
where c is any complex number. For example, for i-2 we write i-2 = exp(-i log i) = exp = exp
{ -i
(7.300)
[ln 1
(5
* 2nn)]}
(7.301)
, n = 0,1,.. . .
(7.302)
+ i (;
5 2nn)
Replacing m / p in Equation (7.294) with c, we write *c
= ,clog=
(7.303)
Using the principal value of log z , we can write the derivative
(7.304) (7.305) -
ce(c- 1)log =
(7.306)
The right-hand side is nothing but czC-l, hence we obtain the formula
(7.307) which also allows us to write zc
= c, log z > z f 0 .
(7.308)
Example 7.6. C o m p l e x exponents: Let us find ii for the principal branch: zi = ,i log i
l+i.rr/2]
-
,i[ln
-
,-.rrP.
As another example we find the principal branch of (1+ i)Z : (1 + i)i = ,ilog(l+i) - e i [ ~ 4+i.rr/4] n
(7.309) (7.310) (7.311)
(7.312) (7.313)
-
,i In d e - . r r / 4
-
2i/2,-7r/4
(7.315)
-
e(i/2)In 2e -.rr/4 .
(7.316)
(7.314)
362
COMPLEX NUMBERS AND FUNCTIONS
7.10.7
Inverse Trigonometric Functions
Using the definition eiw - e-iw
z
= sinw =
(7.317)
2i
along with
we solve for ezzOto obtain ezw = i z
+ (1
-
zy2,
(7.319)
which allows us to write w = -ilog[iz
+ (1
-
z 2 ) 1121.
(7.320)
Thus the inverse sine function is defined as sin-lz
=
+ (1
-ilog[iz
-
z 2 ) 1/21,
(7.321)
which is a multiple-valued function with infinitely many branches. Similarly, one can write the inverses cos-1 z
=
+ (2
-ilog[z
-
1)’/2],
(7.322)
i i+z tan-’ z = - log -. 2 i-z
(7.323)
PROBLEMS
1. Evaluate the following complex numbers:
(A+i ) + i(1 + id),(iv)
(i) (ii)
4 (1 i ) ( l + i)(2 - 2 ) ’ 2 3i (3 - 2 i ) ( l i ) ’ ~
(iii)
2.
(2,1)(1, -21,
(v)
(1 - i I 4 ,
(vi)
(2, -1)(1,3)(2,2)’
+
+ Evaluate the numbers z1 + 2 2 , z1 -
(1,1) 22,
and
z1z2
and show them graphi-
cally when (i) (ii)
ZI = 21 =
(1, I ) , 2 2 = (3, -I), (iii) z1 = (1,3), z2 = (4, -I), (xi, y i ) , zz = (21, -m), (iv) z1 = (1 - i12, z2 = 1 + 2i.
3. Prove the commutative law of multiplication:
zlzz
= 2221.
PROBLEMS
4. Prove the following associative laws:
5. Prove the distributive law
+
zl(22
23)
+ zlz3.
= zlz2
6. Find
(z* + 2i)*,
(i)
(ii)
(2iz)*,
(iii)
2 (1- i ) ( l +i)*’
(iv)
[(I - i ) ‘ ] * .
7. Use the polar form to write
+ 24,
(i)
(z*
(ii)
(1 - i)(l i)*
(iii)
(iz+ I)*,
(iv)
(1 - i ) * ( 2 i).
5
+
+
8. Prove
and (24)*
= (2*)4
9. Prove the following: 121221 =
lz1l 1x21 ,
’
363
364
COMPLEX NUMBERS AND FUNCTIONS
10. Prove and interpret the triangle inequalities:
11. Describe the region of the z-plane defined by (i) (ii) (iii)
1< Imz
< 2,
Iz - I1 2 2 Iz / z - 41 > 3.
+ 11,
12. Show that the equation
describes a circle. 13. Express l+i
[-]
in terms rectangular and polar coordinates. 14. Firid the roots of z4
+ i = 0.
15. If z 2 = i , find z .
16. Show that
17. Show that tanh( 1
+
TZ)
e2 - 1 e2 + 1’
=-
+ 2i) with respect
18. Fiiid the complex number that is symmetrical to (1 t,o the line a r g z = a0.
19. Find all the values of (i)
(ii) (iii) (iv) (v) (vi)
z
=
(3~)l/~,
z = (1 + i3)3/2, z = (-1) 1/3 , z = (1- z). 1/3 , z = (-8)1/3, z = (1p4.
PROBLEMS
365
and show them graphically.
20. Derive Equations (7.83)-(7.85)’ which are used in stereographic projections:
21. Show the following ratios [Eq. (7.86)] used in stereographic projections: y ---z 1
1
.
1-53
22
Verify that the points z,2,and N lie on a straight line. 22. Derive Equation (7.95):
used in stereographic projections to express the distance between two points on the Riemann sphere in terms of the coordinates on the z-plane.
23. Establish the relations
(e’)”
= en’.
24. Establish the sum
and then show
n8 sin [ ( n+ 1)8/2] + cos8 + cos 28 + . . . + cosn8 = cos (5) sin(Ql2) ’
(i)
1
(ii)
sin 8
+ sin 28 + . . . + sin n8 =
sin
(+)
+
sin [(n 1)8/2] sin(8/2) ’
366
COMPLEX NUMBERS AND FUNCTIONS
where 0
< 0 < 27r
25. Show that the following functions are entire: (i) (ii)
f(z) = 22
-
z),
f(z) = -sinycoshz+icosysinhz,
(iii) f ( z ) (iv)
+ y + i(2y
+ isinrc),
= epY(cosI(:
f ( z ) = ezz2.
26. Find the singular points of
(ii)
3.2 z (z 2
+1 + 2) ’
and explain why these function are analytic everywhere except at these points. What are the limits of these functions a t the singular points?
27. Show that the functions
f ( z ) = 22y
+ iy
and
f ( z ) = e2Y(cos17:
+ i sin 2y)
are analytic nowhere.
28. Show that for an analytic function, f ( z ) harmonic, that is,
=u
+ iv,the imaginary part is
29. Show that f ( 2 , 1J)
= y2 - x2
+ 22
and
f(z, y)
= cosh II: cos y
are harmonic functions and find their conjugate harmonic functions.
PROBLEMS
367
30. In rectangular coordinates show that the derivative of an analytic function can be written as
.dv
df - d u ---22-
ax ax
dz
or as
31. Show that eli3.rri
-
e0
=
-e, 1.
32. Find all the values such that ez
=
ez
=1
e(2z+l) =
-2,
+ ifi,
1.
33. Explain why the function
is entire. 34. Justify the definitions cosz sinz
,iZ
+
eiz
-
=
e-iz
2
=
’ e-iz
2i
and find the inverse functions c0s-l z and sin-’ z .
35. Prove the identities sin(z1 + 2 2 ) = sin z1 cos z2 + cos z1 sin z2, cos(z1 + z2) = cos z1 cos z2 - sin z 1 sin z2.
36. Find all the roots of (i) (ii)
cosz = 2 , sinz = cosh2.
37. Find the zeros of sinhz and coshz.
368
COMPLEX NUMBERS AND FUNCTIONS
38. Evaluate (i) (ii) (iii)
(1 i i ) i , (-2)'IT, (1+ i&i)'+i.
39. What are the principal values of (1- i ) " , i2',( - i ) 2 f i ? 40. In polar coordinates, show that the derivative of an analytic function can be written as
CHAPTER 8
COMPLEX ANALYSIS
Line integrals, power series, and residues constitute a n important part of complex analysis. Theorems of complex integration are usually concise but powerful. Many of the properties of analytic functions are quite difficult to prove without the use of these theorems. Complex contour integration also allows us to evaluate various difficult proper or improper integrals encountered in physical theories. Just as in real analysis, in complex integration we distinguish between definite and indefinite integrals. Since differentiation and integration are inverse operations of each other, indefinite integrals can be found by inverting the known differentiation formulas of analytic functions. Definite integrals evaluated over continuous, or at least piecewise continuous, paths are not just restricted to analytic functions and thus can be defined exactly by the same limiting procedure used t o define real integrals. Most complex definite integrals can be written in terms of two real integrals. Hence, in their discussion we heavily rely on the background established in Chapters 1 and 2 on real integrals. One of the most important places, where the theorems of complex integration is put t o use is in power series representation of analytic functions. In this regard, Laurent series play an important part in applications, which also allows us t o classify singular points. Essentials of Mathematical Methods in Science and Engineering. By Copyright @ 2008 John Wiley & Sons, Inc.
S. Selsuk
Bayin
369
370
8.1
COMPLEX ANALYSIS
CONTOUR INTEGRALS
Each point in the complex plane is represented by two parameters, hence in contrast to their real counterparts, ~ ~ f(x) 1 * dx,complex definite integrals are defined with respect to a path or contour, C , connecting the upper and the lower bounds of the integral as
+
If we write a coniplex function as f ( z ) = ~ ( zy), i u ( z , y ) , the above integral can be expressed as the sum of two real integrals:
Furthermore, if the path C is parameterized in terms of a real parameter t :
where the end points; tl and
t2,
are found from
t,he complex integral in Equation (8.2) can also be written as
In the above equations we have written
and dz =
[ ~ ' (+t )iy'(t)] d t .
371
CONTOUR INTEGRALS
Integrals on the right-hand sides of Equations (8.3) and (8.7) are real; hence from the properties of real integrals, we can deduce the following: (8.10)
The two inequalities
(8.13)
and (8.14) where I f ( z ) l 5 M on C and L is the arclength, are very useful in calculations. When z is a point on C, we can write an infinitesimal arclength as
( d z (= (z’(t)+ iy’(t)l d t =
(8.15)
4-.
(8.16)
Length of the contour C is now given as
L
ldzl
(8.17)
= L.
If we parameterize a point on the contour C as z
=
z ( t ) , we can write
(8.18) In another parametric representation of C , where the new parameter r is related to t by t = t ( 7 ) ,we can write the integral [Eq. (8.18)] as (8.19)
372
COMPLEX ANALYSIS
which is nothing but
(8.20) Hence an important property of the contour integrals is that their value is independent of the parametric representation used.
8.2
TYPES OF CONTOURS
We now introduce the types of contours or paths that are most frequently encountered in the study of complex integrals. A continuous path is defined as the curve
where z ( t ) and y(t) are continuous functions of the real parameter t. If the curve does not intersect itself, that is, when no two distinct values of t in [tl,t2]correspond to the same (z,y), we call it a Jordan arc. If
but no other two distinct values of t correspond t o the same point (x,y), we have a simple closed curve, which is also called a Jordan curve. A piecewise continuous curve like y = t 2 ,2 y = t3,2
= t, =t,
t E [1,2], t E (2,3],
(8.21)
is a Jordan arc. A circle with the unit radius
x2 + y2 = 1,
(8.22)
which can be expressed in parametric form as
x
t E [0,27r],
= cost, y = sint,
(8.23)
is a simple closed curve. If the derivatives d ( t ) and y ' ( t ) are continuous and do not vanish simultaneously for any value of t , we have a smooth curve. For a smooth curve the length exists and is given as
L
=
l:'
, / ~ / ( t+) ~ ' ( td t). ~
(8.24)
In general a contour C is a continuous chain of finite number of smooth curves, C1,C2,.. . , Cn. Hence,
C = C1+ C,
+ ' . + Cn. '
373
TYPES OF CONTOURS
Figure 8.1
Contours for Example 8.1.
A contour integral over C can now be written as the sum of its parts as
c
c 2
Contour integrals over closed paths are also written as jCf ( z ) dz,where by definition the counterclockwise direction is taken as the positive direction.
Example 8.1. Contour integrals: Using the contours, C1, C2, and C3, shown in Figure 8.1, let us evaluate the following integrals:
ICl
s
=
c 1[y=s21
We first write I
I =
J c
1
z 2 dz, Ic2 = =
z 2 dz, Ic3 =
c 2 [Y=Ol
J
z 2 dz. (8.26)
c 3 [x= 11
sc z2 dz as the sum of two real integrals [Eq. (8.3)]:
[(x2- y2) dx - 2x7~dy]+ i
J
c
[2xydx + ( x 2 - y2) dy]. (8.27)
For the path C1 we have y = x2 and dy = 22 dx; hence the above integral is evaluated as I,,
=
s
+
[(x2- x4) dx - 2x32x dx] i
P l
=I0
J
[2x3dx + (x2- x4)2x dx]
C 1
C1
(8.28)
(x2- 5x4) dx + i
Pl
(4x3 - 2x5)dx
(8.29)
I0
2
= --
3
+ i-.2
3
(8.30)
374
COMPLEX ANALYSIS
Figure 8.2
For the path Cz we set y obtain
=0
Semicircular path.
and dy
Ic2