 Weighted argument principle

The boundary can recover more than a count. Under the hypotheses of the argument principle, let $h$ be a holomorphic function on a neighborhood of the contour and its interior. If the enclosed zeros of a function are $a_j$ with zero multiplicities $m_j$ and the enclosed poles are $b_k$ of orders $n_k$, thenMultiplying the local logarithmic derivative by $h$ changes its residue from $m_j$ to $m_{j}h(a_j)$, or from $-n_k$ to $-n_{k}h(b_k)$. The residue theorem then gives the identity. Choosing $h=1$ recovers the argument principle; choosing $h(z)=z$ gives the sum of the enclosed zero locations minus the sum of the enclosed pole locations, both counted with zero multiplicities or pole orders.^[ref]

For the rational function in argument principle for a rational function, the $h(z)=z$ integral is $2(1/4)-(-1/2)=1$. Adding the known pole location $-1/2$ back gives a zero-location sum of $1/2$. Dividing by the zero count two gives the arithmetic mean of the enclosed zeros, with multiplicity, as $1/4$. Choosing $h(z)=z^k$ similarly gives the difference between the power-sum symmetric polynomials evaluated on the enclosed zero and pole locations, repeating each location according to its multiplicity or order. These identities let boundary information constrain both the number and aggregate locations of enclosed zeros of a function.