The Argument Principle and Rouche's Theorem
Count zeros and poles inside a contour by watching how the argument turns, and transfer a count to a nearby function.
What a learner can do afterwards
- State the argument principle and apply it to count zeros in a region
- Use Rouche's theorem to locate the roots of a polynomial inside a disc
- Deduce the open mapping theorem or the maximum modulus principle from the same idea
1 · Read
Counting zeros beats finding them. The argument principle reads the headcount off a loop integral of f prime over f: each zero adds its multiplicity times its winding number, each pole subtracts the same way. Picture a tripwire: as z laps the boundary, the phase of f winds once per enclosed zero. The total winding is the count.
Rouche turns hard polynomials into easy ones on a chosen circle. If one term beats the sum of the rest in size, the whole polynomial holds exactly as many zeros inside as that dominant term. For z squared plus 3z plus 1 on the unit circle, 3z has size 3 against at most 2, so it wins and lends its single inside zero. Pick the circle to make a convenient term win.
The same winding idea forces geometric rigidity. A nonconstant analytic map sends open sets to open sets, so images cannot collapse or crease. The maximum modulus rule follows: modulus cannot peak inside, since a peak would fence the image at its edge. Zeros inherit isolation from this: piled up zeros would flatten the map nearby.
Count with multiplicity or miscount. A double zero winds twice and pays two. Before Rouche, verify strict dominance on the circle itself, never inside. No tie, no transfer.
Watch the argument wind, hand counts to nearby maps, and feel the rigidity.
2 · Watch
Take it off screen
Where it sits
8 questions wait behind this lesson, each with its answer explained. Every answer feeds the sky: stars light as they are learned, and dim when it is time to come back.