The Argument Principle

Core Idea

If f is meromorphic on a simply connected domain and γ is a closed contour, then (1/2πi) ∮_γ f'(z)/f(z) dz = Z - P, where Z is the number of zeros and P is the number of poles of f inside γ (counting multiplicity). This counts zeros minus poles as a winding number and is the foundation for many theorems about the distribution of zeros.

Explainer

The argument principle connects two things that initially seem unrelated: the topology of how a curve winds around the origin in the image of f, and the arithmetic of how many zeros and poles f has inside the contour. Understanding why this connection exists requires going back to what f'/f actually is.

If f has a zero of order n at z₀, then near z₀ we can write f(z) = (z − z₀)ⁿ g(z) where g(z₀) ≠ 0. Differentiating: f'(z) = n(z − z₀)^(n−1)g(z) + (z − z₀)ⁿg'(z). Dividing by f(z): f'(z)/f(z) = n/(z − z₀) + g'(z)/g(z). The second term is analytic near z₀ (since g(z₀) ≠ 0), so f'/f has a simple pole at z₀ with residue n — the order of the zero. Similarly, if f has a pole of order m at z₀, the same calculation shows f'/f has a simple pole there with residue −m. The logarithmic derivative f'/f encodes zeros as positive residues and poles as negative residues, all simple.

Now apply the residue theorem from your prerequisites: (1/2πi) ∮_γ f'/f dz equals the sum of all residues of f'/f inside γ, which is Σnⱼ − Σmₖ = Z − P. But there is a second way to compute the same integral: since f'/f = d/dz log f(z), the integral ∮_γ f'/f dz measures the total change in log f(z) around the contour. Since log f = log|f| + i·arg(f), and the contour is closed so log|f| returns to its starting value, the integral equals i times the total change in arg(f) — i times 2π times the winding number of the image curve f(γ) around the origin. So Z − P = winding number of f(γ) around 0.

This geometric interpretation is powerful. You can count zeros *visually* by watching how many times the image of the contour wraps around the origin. The Rouché theorem — a corollary — uses this: if |f − g| < |f| on γ, then f and g have the same number of zeros inside γ, because their image curves are close enough that the winding numbers must match. Rouché provides a remarkably elegant way to locate zeros of complex polynomials without solving them, and the whole edifice rests on the argument principle's identification of analytic counting with topological winding.