Argument principle Created 2026-09-24 Updated 2026-10-14
The argument principle turns a boundary journey into an interior count: follow the values of a meromorphic function around a contour, and count their net turns around zero. Every enclosed zero of a function contributes its multiplicity of a zero; every enclosed pole subtracts its order. There is no need to find each zero of a function separately.
Let be a piecewise smooth simple closed curve with positive orientation of a contour. Suppose is a meromorphic function on an open neighborhood of the curve and its interior, with no zeros of a function or poles on . ThenHere is the sum of the zero multiplicities inside , and is the sum of the orders of its enclosed poles. The image contour may cross itself or revisit a point. Its signed winding number, rather than the number of visually bounded regions, is the quantity that counts.[ref]
For the polynomial and the unit circle , , the image is . It goes around zero three times although its drawn outline is just one circle. The interior contains one distinct zero of a function, at zero, with multiplicity of a zero three: the count is three. Reversing the orientation of a contour reverses the winding number and the sign of the contour integral.
An argument must be followed continuously along the journey. Subtracting the principal arguments at the endpoints loses whole turns: a closed image contour has the same endpoint value even when its winding number is nonzero. Nor does winding number zero prove that there are no zeros of a function: one enclosed simple zero of a function and one enclosed simple pole cancel in . Known poles must be added back to recover .
The mechanism is short. Near a zero of a function of order , factor with a nonvanishing holomorphic function. Its logarithmic derivative is , so its residue is . A pole of order gives residue . The residue theorem adds those contributions. Changing variables to identifies the resulting contour integral with the winding number. This is a local algebraic count joined to a global geometric count.[ref]
The usefulness goes beyond explicit polynomials. Rouché's theorem keeps a count unchanged when a boundary perturbation cannot push the image contour through zero. The Nyquist stability criterion applies the same counting idea to poles governing a system under feedback control.[ref]
Winding number Created 2026-09-24 Updated 2026-10-14
The winding number records how many net turns a closed piecewise smooth curve makes around a chosen point . Counterclockwise turns contribute positively, clockwise turns negatively. It measures a traversal, including repeated visits; a drawing of the curve's outline alone can lose that information. For a closed curve avoiding ,Equivalently, continuously follow an argument of along one journey and divide its total change by . The start and endpoint agree as complex numbers, so the change is an integer number of full turns. The principal argument at the endpoints cannot retain those turns; a continuous choice along the parametrized path can.[ref]
For , , the winding number about zero is one. Traversing the same unit circle twice makes it two; reversing its orientation of a contour makes it negative. The winding number about is zero: the same journey now stays to one side of the point being measured. Joining one counterclockwise loop and one clockwise loop around zero gives net winding number zero even though both loops encircle zero.
The winding number does not change during a homotopy of closed curves avoiding . This is why it is useful: complicated curves can often be deformed to simple ones whose count is obvious. The argument principle transfers that robust geometric integer to a count of zeros of a function and poles. The example in boundary sampling can miss winding shows why finite samples of a curve need control between samples before they can certify the same winding number.