Lecture 23: the argument principle
Let be an analytic function, and suppose we want to study the zeros of . One method would be to study integrals of along some closed contour; then the residue theorem in a sense “counts” the poles of inside this contour, and so “counts” the zeros of . However, this counting is really adding up the residues, which is pretty different: for example, it’s easy for the residues at different poles to cancel out.
A different way to turn zeros into poles is to take the logarithm. However, the logarithm of even a simple zero is actually an essential singularity, so this isn’t ideal; and of course the logarithm needs a branch cut to be analytic. We could solve both of these problems by differentiating: while e.g. is not as well-behaved as we would like, is as well-behaved as we could ask, for a pole. Does this avoid the residue issue above?
More generally, if is analytic on and has a zero at , the analogue of the above is . Since and are analytic, we can try to evaluate the residue of at . For example, if has a simple zero at , then has residue ! So the logarithmic derivative turns simple zeros into simple poles of residue , so the sum of the residues at these poles really does give a count of the zeros.
What about higher order zeros? If has a zero of order at , i.e. for some analytic function with , then
Since , the first term is analytic at , and so the residue of at is equal to the residue of , i.e. . Therefore summing up the residues of is equivalent to counting the zeros of , with multiplicity.
We could also allow to be meromorphic, rather than holomorphic, on , i.e. have poles as well as zeros. Viewing a pole of order as a zero of order , the same argument above implies that if has a pole of order at , then has a simple pole at with residue . Therefore for a meromorphic function we can think of summing up the residues of as the number of zeros of , with multiplicity, minus the number of poles, with multiplicity. In other words, via the residue theorem, we have proven the following theorem:
Theorem (Argument principle).
Let be a bounded domain with piecewise smooth boundary and a meromorphic function on which extends to an analytic function on , with for . Let be the number of zeros of in , counted with multiplicity, and the number of poles, also counted with multiplicity. Then
Indeed, by the residue theorem the left-hand side is the sum of the residues of , which gives the right-hand side by the discussion above.
More generally, for a closed path in along which is analytic and nonzero, we call
the logarithmic integral of along . Since the integrand is the logarithmic derivative, we could rewrite it as
Note however that need not be analytic on , hence we cannot simply evaluate this by the fundamental theorem of calculus (or else it would be zero for closed); is a closed differential, but is not exact in general.
To justify the terminology, recall that , so . Therefore we can rewrite the above as
The first differential , despite the non-analyticity of , is exact, and so the integral does not depend on the path, only on the endpoints of : if , then this is , so in particular for a closed path this is . So we are left with the argument integral
which is not exact: is multivalued, and it may well happen that as we go around , the ending value of is different from the starting value, even though these are at the same point. Consider for example and the unit circle.
However, if we fix a continuous single-valued branch of , then this integral is simply given by . Since two different choices of differ by a constant, this is well-defined; up to the factor of , it is called the increase in argument of along . (So for and the unit circle as above, this would be , hence the integral would be , compatibly with the argument principle.) By splitting the curve into pieces and adding up the increases in argument of along each, we can often evaluate this integral, and hence apply the argument principle, without too much direct calculation.
To illustrate the theorem, consider the polynomial . How many zeros does have (counting multiplicity) in the first quadrant ?
Note first that has no zeros on the positive real line, since for we have . On the positive imaginary line, if for we have , so with real part and imaginary part . The imaginary part vanishes at or , and one can check that at both of these points the real part is nonzero, so for all as well.
Let be the region , ; so we want to count the limit of the number of zeros of contained in as . We know that has no zeros along either of the straight edges contained in ; the remaining part of the boundary is the arc from to of angle and radius , and since has finitely many zeros there are no zeros on this arc once we choose large enough. Therefore we can apply the argument principle: since is holomorphic on ,
is the number of zeros of in .
For positive real, is positive real, so and there is no increase in the argument as moves from to along the real axis. Along the quarter-circle of radius , for large enough , so , so the increase in argument is approximately . (This approximation is good enough because after dividing by , the integral should give an integer, so we can just take the nearest integer multiple of at the end.) Finally, along the imaginary axis as goes from to , we saw above that for has imaginary part zero only at ; for it is negative, and for it is positive. At , , with argument approximately , and the above shows that as goes from to , remains in the lower half-plane, and with argument , so the increase in argument along this line segment is . Finally, as goes from to , at both endpoints is positive real, and in between it remains in the upper half-plane, so the increase in argument is .
Therefore we have found that the total increase in argument is (in the limit as ) , and so the number of zeros in the first quadrant is . With the help of a computer, one could compute that these are at approximately and .
A more conceptual application is Rouché’s theorem.
Theorem.
Let be a bounded domain with piecewise smooth boundary, and let be analytic functions on such that for . Then and have the same number of zeros in (counted with multiplicity).
In other words, we can perturb by a function which is “small” relative to in a certain sense without changing the number of zeros.
Proof.
Note that the assumptions imply for . We have , and since the second factor is in a disk of radius centered at , and so in particular is in the right half-plane. Therefore , and the increase in argument of the second term as moves along is . Therefore the total increase in argument of is the same as that of , so the claim follows from the argument principle. ∎
A fun consequence is the following slick proof of the fundamental theorem of algebra. Let . On the boundary of a disk of sufficiently large radius centered at the origin, we have , so has the same number of zeros within this disk as , which of course has zeros with multiplicity, namely a single zero of order at .
A more concrete application is the following. Consider the equation . What are the solutions with ?
One solution is given by . Are there any others?
Rewriting this as , we want to write the left-hand side as for some and satisfying the hypotheses of Rouché’s theorem: that is, on the unit circle, . Choosing and works: for , we have and . So has the same number of zeros in the unit disk as , which has only a single zero at , so we can answer the question above in the negative: is the only solution of in the unit disk. (It is not however the only solution in , e.g. also works; in fact there are infinitely many solutions.)