ConceptComplete

Argument Principle and Rouche's Theorem

The argument principle relates the number of zeros and poles of a meromorphic function inside a contour to a contour integral. Rouche's theorem, a consequence, is a powerful tool for locating zeros of holomorphic functions.


The Argument Principle

Theorem6.4Argument principle

Let ff be meromorphic inside and on a simple closed contour γ\gamma (positively oriented), with zeros z1,,zpz_1, \ldots, z_p of orders m1,,mpm_1, \ldots, m_p and poles w1,,wqw_1, \ldots, w_q of orders n1,,nqn_1, \ldots, n_q (none on γ\gamma). Then

12πiγf(z)f(z)dz=j=1pmjk=1qnk=NP\frac{1}{2\pi i}\oint_\gamma \frac{f'(z)}{f(z)}\,dz = \sum_{j=1}^p m_j - \sum_{k=1}^q n_k = N - P

where NN is the number of zeros and PP the number of poles, counted with multiplicity.

RemarkGeometric interpretation

The integral 12πiγffdz\frac{1}{2\pi i}\oint_\gamma \frac{f'}{f}\,dz equals the winding number of the image curve fγf \circ \gamma around the origin. As zz traverses γ\gamma, the argument of f(z)f(z) changes by 2π(NP)2\pi(N - P). This is why the result is called the "argument principle."

ExampleCounting zeros

How many zeros does f(z)=z5+3z+1f(z) = z^5 + 3z + 1 have inside z=1|z| = 1?

On z=1|z| = 1: 3z=3>z5+12|3z| = 3 > |z^5 + 1| \leq 2. By Rouche's theorem (below), ff and 3z3z have the same number of zeros inside z=1|z| = 1, which is 11.

Alternatively, compute 12πiz=15z4+3z5+3z+1dz\frac{1}{2\pi i}\oint_{|z|=1}\frac{5z^4+3}{z^5+3z+1}\,dz numerically.


Rouche's Theorem

Theorem6.5Rouche's theorem

Let ff and gg be holomorphic inside and on a simple closed contour γ\gamma. If f(z)g(z)<f(z)|f(z) - g(z)| < |f(z)| for all zγz \in \gamma, then ff and gg have the same number of zeros (counted with multiplicity) inside γ\gamma.

Proof

The condition ensures g/f=1+(gf)/fg/f = 1 + (g-f)/f has image inside the disk w1<1|w - 1| < 1 on γ\gamma. Therefore g/fg/f has winding number 00 around the origin on γ\gamma, so

12πiγ(g/f)g/fdz=0.\frac{1}{2\pi i}\oint_\gamma \frac{(g/f)'}{g/f}\,dz = 0.

This equals (zeros of gg minus poles of g/fg/f) = (zeros of gg) - (zeros of ff) inside γ\gamma. \blacksquare


Applications of Rouche's Theorem

ExampleProof of the Fundamental Theorem of Algebra via Rouche

Let p(z)=zn+an1zn1++a0p(z) = z^n + a_{n-1}z^{n-1} + \cdots + a_0. On z=R|z| = R with RR large enough:

p(z)zn=an1zn1++a0(an1Rn1++a0)<Rn=zn|p(z) - z^n| = |a_{n-1}z^{n-1} + \cdots + a_0| \leq (|a_{n-1}|R^{n-1} + \cdots + |a_0|) < R^n = |z^n|

for sufficiently large RR. By Rouche's theorem, pp and znz^n have the same number of zeros inside z=R|z| = R, namely nn.

ExampleStability of zeros under perturbation

The polynomial p(z)=z4+6z+3p(z) = z^4 + 6z + 3 has exactly one zero in z<1|z| < 1. On z=1|z| = 1, compare with g(z)=6zg(z) = 6z:

p(z)6z=z4+3z4+3=4<6=6z.|p(z) - 6z| = |z^4 + 3| \leq |z^4| + 3 = 4 < 6 = |6z|.

So pp has the same number of zeros as 6z6z in z<1|z| < 1, which is exactly one.

On z=2|z| = 2, compare with h(z)=z4h(z) = z^4: p(z)z4=6z+315<16=z4|p(z) - z^4| = |6z + 3| \leq 15 < 16 = |z^4|. So pp has 44 zeros in z<2|z| < 2. Therefore pp has 33 zeros in the annulus 1z<21 \leq |z| < 2.


Counting Formula

Definition6.4Counting zeros and poles

For a meromorphic function ff and any function gg holomorphic near the zeros and poles of ff inside γ\gamma:

12πiγg(z)f(z)f(z)dz=j=1pmjg(zj)k=1qnkg(wk)\frac{1}{2\pi i}\oint_\gamma g(z)\frac{f'(z)}{f(z)}\,dz = \sum_{j=1}^p m_j g(z_j) - \sum_{k=1}^q n_k g(w_k)

where zjz_j are zeros and wkw_k are poles. Taking g(z)=zg(z) = z gives the sum of the zeros minus the sum of the poles (with multiplicity).

RemarkApplications to locating zeros

The counting formula with g(z)=zg(z) = z computes the center of mass of zeros. Combined with Rouche's theorem, this can precisely locate zeros of polynomials and entire functions, making it essential in numerical analysis and control theory.