# Argument principle

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

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

$\oint _{C}{f'(z) \over f(z)}\,dz=2\pi i(N-P)$ where N 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

$\oint _{C}{\frac {f'(z)}{f(z)}}\,dz=2\pi i\left(\sum _{a}n(C,a)-\sum _{b}n(C,b)\right)$ 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 $\oint _{C}{\frac {f'(z)}{f(z)}}\,dz$ can be interpreted in two ways:

• as the total change in the argument of f(z) as z travels around C, explaining the name of the theorem; this follows from
${\frac {d}{dz}}\log(f(z))={\frac {f'(z)}{f(z)}}$ and the relation between arguments and logarithms.

• as 2πi times the winding number of the path f(C) around the origin, using the substitution w = f(z):
$\oint _{C}{\frac {f'(z)}{f(z)}}\,dz=\oint _{f(C)}{\frac {1}{w}}\,dw$ ## Proof of the argument principle

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

$f'(z)=k(z-z_{N})^{k-1}g(z)+(z-z_{N})^{k}g'(z)\,\!$ and

${f'(z) \over f(z)}={k \over z-z_{N}}+{g'(z) \over g(z)}.$ Since g(zN) ≠ 0, it follows that g' (z)/g(z) has no singularities at zN, and thus is analytic at zN, which implies that the residue of f′(z)/f(z) at zN is k.

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

$f'(z)=-m(z-z_{P})^{-m-1}h(z)+(z-z_{P})^{-m}h'(z)\,\!.$ and

${f'(z) \over f(z)}={-m \over z-z_{P}}+{h'(z) \over h(z)}$ similarly as above. It follows that h′(z)/h(z) has no singularities at zP since h(zP) ≠ 0 and thus it is analytic at zP. We find that the residue of f′(z)/f(z) at zP is −m.

Putting these together, each zero zN of multiplicity k of f creates a simple pole for f′(z)/f(z) with the residue being k, and each pole zP 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 zN 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 ${1 \over 2\pi i}\oint _{C}{f'(z) \over f(z)}\,dz$ 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 $\xi (s)$ function inside a rectangle intersecting the critical line.

The proof of Rouché's theorem uses the argument principle.

Modern books on feedback control theory quite frequently use the argument principle to serve as the theoretical basis of the Nyquist stability criterion.

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

${\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).$ For example, if f is a polynomial having zeros z1, ..., zp inside a simple contour C, and g(z) = zk, then

${\frac {1}{2\pi i}}\oint _{C}z^{k}{\frac {f'(z)}{f(z)}}\,dz=z_{1}^{k}+z_{2}^{k}+\dots +z_{p}^{k},$ is power sum symmetric polynomial of the roots of f.

Another consequence is if we compute the complex integral:

$\oint _{C}f(z){g'(z) \over g(z)}\,dz$ for an appropriate choice of g and f we have the Abel–Plana formula:

$\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$ which expresses the relationship between a discrete sum and its integral.

## Generalized argument principle

There is an immediate generalization of the argument principle. Suppose that g is analytic in the region $\Omega$ . Then

$\oint _{C}{f'(z) \over f(z)}g(z)\,dz=2\pi i\left(\sum _{a}g(a)n(C,a)-\sum _{b}g(b)n(C,b)\right)$ 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 1974 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.