In plain words
Walk round a loop and count how often the image circles the origin. That counts the zeros inside minus the poles, and Rouché turns the count into a comparison with something simpler.
Argument principle
For f meromorphic inside and on a simple closed , with no zeros or poles on :
dz = N − P = (number of zeros) − (number of poles), counted with multiplicity.
Equivalently, N − P is the winding number of the image curve about the origin.
Watch the integrand. For (zf)′/(zf) the function zf has one extra zero at the origin, so the integral is (N + 1) − P.
Rouché's theorem
If |f(z)| > |g(z)| on then f and f + g have the same number of zeros inside.
Recipe. Given a polynomial, choose the term that dominates on the given circle:
| Polynomial, circle | Dominant term | Zeros inside |
|---|---|---|
| , |z| = 1 | 30 | |
| , |z| = 1 | 12 (12 > 6) | 0 |
| , |z| = 2 | 7 | |
| eᶻ − 4z − 1, |z| = 1 | −4z (4 > e + 1) | 1 |
Always check the inequality is strict on the whole circle.
Open mapping and inverse function
- Non-constant holomorphic maps are open.
- f injective holomorphic ⇒ f′ ≠ 0 and f⁻ is holomorphic.
- Conversely gives local injectivity — but not global: eᶻ has non-vanishing derivative and is not injective.
Hurwitz
Locally uniform limits: if each is zero-free (or injective) and ≢ constant, then f is zero-free (or injective).
Key takeaways
- Argument principle counts N − P; check what the integrand's numerator really is.
- Rouché: dominate on the circle, count the dominant term's zeros.
- f′ ≠ 0 gives local, never global, injectivity.