The Argument Principle: Counting Zeros of a Polynomial
Let . Use the argument principle (or Rouché's theorem) to determine exactly how many zeros has inside the unit disk .
Hint: Compare to a simpler function on .
Answer: Rouché's Theorem: Zeros of z⁵+3z+1
Key Idea / Intuition
The trick is to split into a "dominant" piece and a "small" perturbation on the boundary circle . On the unit circle, the term has modulus , while has modulus at most . Since the dominant part wins on the boundary, Rouché's theorem tells us has the same number of zeros inside as the dominant part — which has exactly one zero (at the origin).
Formal Proof / Solution
Rouché's Theorem (statement): If and are holomorphic inside and on a simple closed contour , and for all , then and have the same number of zeros (counted with multiplicity) inside .
Setup. Write
We apply Rouché's theorem with , comparing the "big" piece against the "small" piece .
Checking the Rouché condition on :
- ,
- .
Since for all on , the condition holds everywhere on the contour.
Applying Rouché's Theorem:
The function has exactly one zero inside (namely , with multiplicity 1).
By Rouché's theorem, also has exactly one zero inside .
Conclusion.
The remaining four zeros (by the fundamental theorem of algebra) all lie outside the unit disk .
Why this is beautiful: Rouché's theorem lets you "transfer" zero-counting from a complicated function to a trivially simple one, purely by a modulus estimate on the boundary. No explicit root-finding required.
Source: Complex Analysis (Stein & Shakarchi), Chapter 3; standard folklore example