Argument Principle & Rouche's Theorem Practice Questions, Quiz, and Step-by-Step Lesson - improve your math skills with focused questions and clear explanations.
Argument Principle & Rouche's Theorem Practice Quiz with a Step-by-Step Interactive Lesson
Use the quiz at the top of the page to practice argument principle and Rouche theorem problems: counting zeros minus poles with \(\frac1{2\pi i}\oint f^\prime/f\), reading multiplicities, interpreting winding number, checking that no zero or pole lies on the contour, comparing \(|g|\) and \(|f|\) on a boundary, and choosing a dominant term on circles. If you need a refresher, open the lesson for mentally followable examples and quick checks.
How this argument principle and Rouche theorem practice works
1. Take the quiz: answer questions about zeros, poles, contour counts, and boundary comparisons.
2. Open the lesson: review the argument principle, winding number, Rouche comparisons, and common zero-counting estimates.
3. Retry: return to the quiz and first check the contour hypotheses before counting.
What you will learn in the argument principle & Rouche theorem lesson
Argument-principle counts
Use \(\frac1{2\pi i}\oint_\Gamma \frac{f^\prime(z)}{f(z)}\,dz=N-P\), with multiplicity.
Recognize residues of \(f^\prime/f\): zeros contribute positively and poles negatively.
Connect the integral to the winding number of \(f(\Gamma)\) around \(0\).
Rouche comparisons
Check the strict boundary inequality \(|g|<|f|\) on the contour.
Conclude that \(f\) and \(f+g\) have the same number of zeros inside; equivalently, \(|f-g|<|f|\) gives \(f\) and \(g\) the same zero count.
Choose the dominant term using circle estimates and the triangle inequality.
Polynomial zero counts
Count roots in disks such as \(z^3+\frac12\), \(z^3+z+1\), and \(z^2+3\).
Use different radii when the dominant term changes.
See why a large circle lets the leading term prove the total degree count.
Boundary and hypothesis traps
Zeros or poles on the contour block the basic argument principle.
Rouche needs strict inequality on the whole contour, not just at one point.
Negative orientation changes the sign of the integral count.
Ready to count again?
Return to the quiz and decide whether to count zeros minus poles directly or compare a function with a dominant part.
Loading...
Complex zero counting
Argument Principle & Rouche's Theorem Lesson
1 / 8
Count zeros without solving for them
Purpose: Build a reliable toolkit for counting zeros and poles inside contours. The argument principle turns \(\oint f^\prime/f\) into zeros minus poles, while Rouche's theorem lets you replace a difficult holomorphic function by a dominant simpler one on the boundary.
Success criteria
State the argument principle and identify \(N-P\).
Explain why a zero of order \(m\) contributes \(+m\) and a pole of order \(m\) contributes \(-m\).
Check that the contour avoids zeros and poles before applying \(\oint f^\prime/f\).
Interpret the count as the winding number of \(f(\Gamma)\) around \(0\).
Apply Rouche's theorem from a strict boundary inequality \(|g|<|f|\).
Choose dominant terms on \(|z|=r\) using simple estimates.
Use different radii to locate how many zeros lie in a disk or annulus.
Spot traps involving boundary roots, non-strict inequalities, and orientation.
Multiplicity/order: zeros add their order; poles subtract their order.
Winding number: how many times \(f(\Gamma)\) winds around \(0\).
Rouche theorem: if \(|g|<|f|\) on \(\Gamma\), then \(f\) and \(f+g\) have the same number of zeros inside.
Dominant term: the part whose modulus is strictly larger than the remainder on the contour.
Quick pre-check
Pre-check: What does the argument principle count inside a positively oriented contour?
Hint: The logarithmic derivative has residues at zeros and poles, with opposite signs.
Zeros and poles become residues of \(f^\prime/f\)
Learning goal: Convert local zero and pole data into the integral of the logarithmic derivative.
Key idea
Near \(a\), write \(f(z)=(z-a)^m h(z)\) with \(h(a)\) nonzero for a zero of order \(m\). Then \(\frac{f^\prime}{f}=\frac{m}{z-a}+\frac{h^\prime}{h}\), so the residue is \(m\). For a pole of order \(m\), the sign is \(-m\).
Local dictionary
Zero of order \(m\): contribution \(+m\).
Pole of order \(m\): contribution \(-m\).
Holomorphic and nonzero point: contribution \(0\).
Integral count: sum of these contributions inside the contour.
Multiplicity bookkeeping
Always count with multiplicity. A triple zero at \(0\) counts as three zeros, not one location.
Worked example
Example: For \(f(z)=\dfrac{z^3}{z-1}\), what is \(\frac1{2\pi i}\oint_{|z|=2}\frac{f^\prime(z)}{f(z)}\,dz\)?
Inside \(|z|<2\), the zero at \(0\) has order \(3\), and the pole at \(1\) has order \(1\). Therefore \(N-P=3-1=2\).
Try it
Try it: For \(f(z)=\dfrac{z^3}{z-1}\), inside \(|z|<2\), what is zeros minus poles?
Hint: The triple zero at \(0\) contributes \(3\), and the simple pole at \(1\) contributes \(-1\).
The count is also how \(f(\Gamma)\) winds around zero
Learning goal: Connect the integral formula to geometry, and know when boundary points make the theorem unavailable.
Key idea
If \(f\) has no zeros or poles on \(\Gamma\), then \(f(\Gamma)\) never passes through \(0\). The integral \(\frac1{2\pi i}\oint_\Gamma f^\prime/f\) equals the winding number of that image curve around \(0\), hence equals \(N-P\).
Hypotheses to check
\(\Gamma\) is a closed contour, usually positively oriented.
\(f\) is meromorphic inside and on \(\Gamma\).
No zero or pole of \(f\) lies on \(\Gamma\).
Zeros and poles inside are counted with order.
Orientation and winding
Positive orientation gives \(N-P\). Reversing the orientation reverses the sign of the integral.
Worked example
Example: For \(f(z)=z^2-\frac14\), on \(|z|=1\), what is the argument-principle count?
The zeros are \(\frac12\) and \(-\frac12\), both inside \(|z|<1\), and \(f\) has no poles. Thus the count is \(2\).
Try it
Try it: If a zero of \(f\) lies exactly on \(\Gamma\), what should you say about the basic argument principle?
Hint: The image curve \(f(\Gamma)\) would pass through \(0\), so winding around \(0\) is not defined in the usual way.
A strict boundary comparison preserves the zero count
Learning goal: Use Rouche's theorem to replace a hard zero count by an easy one.
Key idea
If \(f\) and \(g\) are holomorphic inside and on \(\Gamma\), and \(|g(z)|<|f(z)|\) for every \(z\in\Gamma\), then \(f\) and \(f+g\) have the same number of zeros inside \(\Gamma\), counted with multiplicity. Equivalently, if \(|f-g|<|f|\) on \(\Gamma\), then \(f\) and \(g\) have the same zero count because \(g=f+(g-f)\).
Recognition checklist
Split the target as dominant part plus smaller remainder.
Check the strict inequality on the whole boundary.
Use the common form \(|f-g|<|f|\) by viewing \(g\) as \(f+(g-f)\).
Count zeros of the dominant part inside the contour.
Transfer that count to the full function.
Worked example
Example: How many zeros does \(z^3+\frac12\) have in \(|z|<1\)?
On \(|z|=1\), \(|z^3|=1\) and \(\left|\frac12\right|=\frac12\). Since \(\frac12<1\), \(z^3\) dominates. Therefore \(z^3+\frac12\) has the same number of zeros as \(z^3\): three.
Try it
Try it: On \(|z|=1\), how many zeros does \(z^3+\frac12\) have inside?
Hint: Compare the constant term with \(|z^3|=1\) on the boundary.
Circle estimates decide which term wins
Learning goal: Build fast estimates such as \(|z+1|\le |z|+1\) and compare them with powers of \(|z|\).
Key idea
On \(|z|=r\), powers become numbers: \(|z^n|=r^n\). The remainder is often bounded by the triangle inequality. A strict numerical gap proves the Rouche comparison.
Useful boundary estimates
On \(|z|=2\), \(|z^3|=8\).
On \(|z|=2\), \(|z+1|\le |z|+1=3\).
On \(|z|=2\), \(|3z|=6\) and \(|z^4|=16\).
On \(|z|=1\), \(|z^2|=1\) dominates \(|z/4|=\frac14\), so \(z^2+z/4\) has two zeros in the unit disk.
For large \(|z|\), the leading term of a polynomial eventually dominates all lower-degree terms.
Large-circle idea
This large-circle version is a standard proof that a degree \(n\) polynomial has \(n\) complex zeros counted with multiplicity: the leading term dominates on a sufficiently large circle.
Worked example
Example: How many zeros does \(z^3+z+1\) have in \(|z|<2\)?
On \(|z|=2\), \(|z^3|=8\), while \(|z+1|\le3\). Thus \(z^3\) dominates \(z+1\), and \(z^3+z+1\) has the same three zeros as \(z^3\) inside the disk.
Try it
Try it: By Rouche on \(|z|=2\), how many zeros does \(z^3+z+1\) have in \(|z|<2\)?
Hint: Compare \(8\) with the upper bound \(3\) for the smaller part.
The same polynomial can look different on different circles
Learning goal: Use different boundary circles to count how many zeros lie inside each disk.
Key idea
Rouche comparisons are made on one chosen contour. Changing the radius can change which term dominates, revealing where roots are located.
Radius strategy
Small circle: a nonzero constant may dominate, giving no zeros inside.
Larger circle: a power of \(z\) may dominate, giving its degree as the count.
The difference between two disk counts gives an annulus count.
Never use a radius where a zero lies on the boundary without separate care.
Worked example
Example: Count zeros of \(z^2+3\) inside \(|z|<1\) and \(|z|<2\).
On \(|z|=1\), the constant \(3\) dominates \(z^2\), so there are \(0\) zeros inside. On \(|z|=2\), \(|z^2|=4>3\), so \(z^2\) dominates and there are \(2\) zeros inside. Thus both roots have modulus between \(1\) and \(2\).
Try it
Try it: How many zeros does \(z^2+3\) have inside \(|z|<2\)?
Hint: On \(|z|=2\), \(|z^2|=4\) and the constant term has modulus \(3\).
Use \(N-P\) like a balance equation
Learning goal: Turn an argument-principle integral into information about zeros when poles are known.
Key idea
The argument principle gives \(N-P\), not just \(N\), for meromorphic functions. If the integral count is known and the poles are known, then \(N=(N-P)+P\). For polynomials, \(P=0\) in the finite plane.
Counting moves
List zeros and poles inside the contour only.
Use orders, not just locations.
If the integral count is \(k\) and total pole order is \(P\), then total zero order is \(k+P\).
If a zero or pole lies outside, it does not contribute.
Worked example
Example: If \(\frac1{2\pi i}\oint f^\prime/f=4\) and \(f\) has one simple pole inside the contour, how many zeros are inside?
The count is \(N-P=4\). Since \(P=1\), we get \(N=4+1=5\) zeros counted with multiplicity.
Try it
Try it: If the argument-principle count is \(4\) and there is one pole inside, how many zeros are inside?
Hint: Add the pole order back to \(N-P\).
Most mistakes come from the boundary or from a weak inequality
Learning goal: Finish by checking the assumptions before applying a powerful theorem.
Common traps
Boundary zeros: the argument principle needs no zero of \(f\) on \(\Gamma\).
Boundary poles: poles on \(\Gamma\) also block the basic theorem.
Strict Rouche inequality: \(|g|<|f|\), not merely \(\le\), is the standard safe condition.
Whole contour: checking the inequality at one point is not enough.
Multiplicity: a zero of order \(m\) counts \(m\).
Poles subtract: a pole of order \(m\) contributes \(-m\).
Orientation: reversing the contour changes the sign of \(\oint f^\prime/f\).
Holomorphic requirement for Rouche: the compared functions must be holomorphic inside and on the contour.
Worked example
Example: Can \(z^2\) dominate \(2\) on \(|z|=1\) for a Rouche proof about \(z^2+2\)?
No. On \(|z|=1\), \(|z^2|=1\), which is not greater than \(2\). The attempted comparison fails. In fact the roots of \(z^2+2\) have modulus \(\sqrt2\), so there are no roots inside the unit disk.
Try it
Try it: On \(|z|=1\), can \(z^2\) dominate \(2\) in Rouche's theorem?
Hint: Compare \(|z^2|=1\) with \(|2|=2\).
Final recap
\(\frac1{2\pi i}\oint_\Gamma f^\prime/f=N-P\).
Zeros contribute positive order; poles contribute negative order.
No zero or pole may lie on the contour for the basic argument principle.
The integral is the winding number of \(f(\Gamma)\) around \(0\).
Rouche theorem: \(|g|<|f|\) on \(\Gamma\) implies \(f\) and \(f+g\) have the same number of zeros inside.
Equivalent Rouche form: \(|f-g|<|f|\) implies \(f\) and \(g\) have the same zero count.
On \(|z|=r\), compare powers by \(r^n\) and bound remainders with the triangle inequality.
Changing the radius can separate roots by annuli.
A polynomial has no finite poles, so its argument-principle count is its zero count.
Strict inequalities and boundary checks are not optional.
Orientation controls the sign of the integral.
Next step: Close this lesson and try the quiz again. Start every problem by listing the contour, checking the boundary, and deciding whether you are using \(N-P\) directly or a Rouche comparison.
Streak 5+
Streak 10+
Streak 15+
Streak 20+
Streak 25+