Jensen's Inequality (Complex Analysis)

This proof is about Jensen's Inequality in the context of Complex Analysis. For other uses, see Jensen's Inequality.

This article needs to be linked to other articles. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{MissingLinks}} from the code.

Theorem

Let $D \subset \C$ be an open set with $0 \in D$.

Let $R > 0$ be such that $\map B {0, R} \subset D$.

Let $f: D \to \C$ be analytic with $\map f 0 \ne 0$.

Let $\cmod {\map f z} \le M$ for $\cmod z \le R$.

Let $0 < r <R$.

Then the number of zeroes of $f$, counted with multiplicity, for $\cmod z \le r$, is at most:

$\dfrac {\map \log {M / \cmod {\map f 0} } } {\map \log {R / r} }$

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Source of Name

This entry was named for Johan Jensen.

Sources

• 2006: Hugh L. Montgomery and Robert C. Vaughan: Multiplicative Number Theory: I. Classical Theory ... (next) $6$: The Prime Number Theorem: $\S 6.1$: A zero-free region: Lemma $6.1$