Argument principle

Short description: Theorem in complex analysis

The simple contour C (black), the zeros of f (blue) and the poles of f (red). Here we have [math]\displaystyle{ \frac{1}{2\pi i}\oint_{C} {f'(z) \over f(z)}\, dz=4-5.\, }[/math]

In complex analysis, the argument principle (or Cauchy's argument principle) is a theorem relating the difference between the number of zeros and poles of a meromorphic function to a contour integral of the function's logarithmic derivative.

Formulation

If f(z) is a meromorphic function inside and on some closed contour C, and f has no zeros or poles on C, then

[math]\displaystyle{ \frac{1}{2\pi i}\oint_{C} {f'(z) \over f(z)}\, dz=Z-P }[/math]

where Z and P denote respectively the number of zeros and poles of f(z) inside the contour C, with each zero and pole counted as many times as its multiplicity and order, respectively, indicate. This statement of the theorem assumes that the contour C is simple, that is, without self-intersections, and that it is oriented counter-clockwise.

More generally, suppose that f(z) is a meromorphic function on an open set Ω in the complex plane and that C is a closed curve in Ω which avoids all zeros and poles of f and is contractible to a point inside Ω. For each point z ∈ Ω, let n(C,z) be the winding number of C around z. Then

[math]\displaystyle{ \frac{1}{2\pi i}\oint_{C} \frac{f'(z)}{f(z)}\, dz = \sum_a n(C,a) - \sum_b n(C,b)\, }[/math]

where the first summation is over all zeros a of f counted with their multiplicities, and the second summation is over the poles b of f counted with their orders.

Interpretation of the contour integral

The contour integral [math]\displaystyle{ \oint_{C} \frac{f'(z)}{f(z)}\, dz }[/math] can be interpreted as 2πi times the winding number of the path f(C) around the origin, using the substitution w = f(z):

[math]\displaystyle{ \oint_{C} \frac{f'(z)}{f(z)}\, dz = \oint_{f(C)} \frac{1}{w}\, dw }[/math]

That is, it is i times the total change in the argument of f(z) as z travels around C, explaining the name of the theorem; this follows from

[math]\displaystyle{ \frac{d}{dz}\log(f(z))=\frac{f'(z)}{f(z)} }[/math]

and the relation between arguments and logarithms.

Proof of the argument principle

Let z_Z be a zero of f. We can write f(z) = (z − z_Z)^kg(z) where k is the multiplicity of the zero, and thus g(z_Z) ≠ 0. We get

[math]\displaystyle{ f'(z)=k(z-z_Z)^{k-1}g(z)+(z-z_Z)^kg'(z)\,\! }[/math]

and

[math]\displaystyle{ {f'(z)\over f(z)}={k \over z-z_Z}+{g'(z)\over g(z)}. }[/math]

Since g(z_Z) ≠ 0, it follows that g' (z)/g(z) has no singularities at z_Z, and thus is analytic at z_Z, which implies that the residue of f′(z)/f(z) at z_Z is k.

Let z_P be a pole of f. We can write f(z) = (z − z_P)^−mh(z) where m is the order of the pole, and h(z_P) ≠ 0. Then,

[math]\displaystyle{ f'(z)=-m(z-z_P)^{-m-1}h(z)+(z-z_P)^{-m}h'(z)\,\!. }[/math]

and

[math]\displaystyle{ {f'(z)\over f(z)}={-m \over z-z_P}+{h'(z)\over h(z)} }[/math]

similarly as above. It follows that h′(z)/h(z) has no singularities at z_P since h(z_P) ≠ 0 and thus it is analytic at z_P. We find that the residue of f′(z)/f(z) at z_P is −m.

Putting these together, each zero z_Z of multiplicity k of f creates a simple pole for f′(z)/f(z) with the residue being k, and each pole z_P of order m of f creates a simple pole for f′(z)/f(z) with the residue being −m. (Here, by a simple pole we mean a pole of order one.) In addition, it can be shown that f′(z)/f(z) has no other poles, and so no other residues.

By the residue theorem we have that the integral about C is the product of 2πi and the sum of the residues. Together, the sum of the k's for each zero z_Z is the number of zeros counting multiplicities of the zeros, and likewise for the poles, and so we have our result.

Applications and consequences

The argument principle can be used to efficiently locate zeros or poles of meromorphic functions on a computer. Even with rounding errors, the expression [math]\displaystyle{ {1\over 2\pi i}\oint_{C} {f'(z) \over f(z)}\, dz }[/math] will yield results close to an integer; by determining these integers for different contours C one can obtain information about the location of the zeros and poles. Numerical tests of the Riemann hypothesis use this technique to get an upper bound for the number of zeros of Riemann's [math]\displaystyle{ \xi(s) }[/math] function inside a rectangle intersecting the critical line. The argument principle can also be used to prove Rouché's theorem, which can be used to bound the roots of polynomial roots.

A consequence of the more general formulation of the argument principle is that, under the same hypothesis, if g is an analytic function in Ω, then

[math]\displaystyle{ \frac{1}{2\pi i} \oint_C g(z)\frac{f'(z)}{f(z)}\, dz = \sum_a n(C,a)g(a) - \sum_b n(C,b)g(b). }[/math]

For example, if f is a polynomial having zeros z₁, ..., z_p inside a simple contour C, and g(z) = z^k, then

[math]\displaystyle{ \frac{1}{2\pi i} \oint_C z^k\frac{f'(z)}{f(z)}\, dz = z_1^k+z_2^k+\cdots+z_p^k, }[/math]

is power sum symmetric polynomial of the roots of f.

Another consequence is if we compute the complex integral:

[math]\displaystyle{ \oint_C f(z){g'(z) \over g(z)}\, dz }[/math]

for an appropriate choice of g and f we have the Abel–Plana formula:

[math]\displaystyle{ \sum_{n=0}^{\infty}f(n)-\int_{0}^{\infty}f(x)\,dx= f(0)/2+i\int_{0}^{\infty}\frac{f(it)-f(-it)}{e^{2\pi t}-1}\, dt\, }[/math]

which expresses the relationship between a discrete sum and its integral.

The argument principle is also applied in control theory. In modern books on feedback control theory, it is commonly used as the theoretical foundation for the Nyquist stability criterion. Moreover, a more generalized form of the argument principle can be employed to derive Bode's sensitivity integral and other related integral relationships.

Generalized argument principle

There is an immediate generalization of the argument principle. Suppose that g is analytic in the region [math]\displaystyle{ \Omega }[/math]. Then

[math]\displaystyle{ \frac{1}{2\pi i}\oint_{C} {f'(z) \over f(z)} g(z) \, dz = \sum_a g(a) n(C,a) - \sum_b g(b) n(C,b)\, }[/math]

where the first summation is again over all zeros a of f counted with their multiplicities, and the second summation is again over the poles b of f counted with their orders.

History

According to the book by Frank Smithies (Cauchy and the Creation of Complex Function Theory, Cambridge University Press, 1997, p. 177), Augustin-Louis Cauchy presented a theorem similar to the above on 27 November 1831, during his self-imposed exile in Turin (then capital of the Kingdom of Piedmont-Sardinia) away from France. However, according to this book, only zeroes were mentioned, not poles. This theorem by Cauchy was only published many years later in 1874 in a hand-written form and so is quite difficult to read. Cauchy published a paper with a discussion on both zeroes and poles in 1855, two years before his death.

See also

• Logarithmic derivative
• Nyquist stability criterion

References

• Rudin, Walter (1986). Real and Complex Analysis (International Series in Pure and Applied Mathematics). McGraw-Hill. ISBN 978-0-07-054234-1. 
• Ahlfors, Lars (1979). Complex analysis: an introduction to the theory of analytic functions of one complex variable. McGraw-Hill. ISBN 978-0-07-000657-7. 
• Churchill, Ruel Vance; Brown, James Ward (1989). Complex Variables and Applications. McGraw-Hill. ISBN 978-0-07-010905-6. 
• Backlund, R.-J. (1914) Sur les zéros de la fonction zeta(s) de Riemann, C. R. Acad. Sci. Paris 158, 1979–1982.

External links

• Hazewinkel, Michiel, ed. (2001), "Argument, principle of the", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=p/a013250