Hadamard factorization theorem

In mathematics, and particularly in the field of complex analysis, the Hadamard factorization theorem asserts that every entire function with finite order can be represented as a product involving its zeroes and an exponential of a polynomial. It is named for Jacques Hadamard.

The theorem may be viewed as an extension of the fundamental theorem of algebra, which asserts that every polynomial may be factored into linear factors, one for each root. It is closely related to Weierstrass factorization theorem, which does not restrict to entire functions with finite orders.

Formal statement

Define the Hadamard canonical factors $E_n(z) := (1-z) \prod_{k=1}^n e^{z^k/k}$ Entire functions of finite order $\rho$ have Hadamard's canonical representation:{{citation |last=Conway |first=J. B. |title=Functions of One Complex Variable I, 2nd ed. |year=1995 |location=springer.com |publisher=Springer |isbn=0-387-90328-3}} $f(z)=z^me^{Q(z)}\prod_{n=1}^\infty E_p(z/a_n)$ where $a_k$ are those roots of $f$ that are not zero ( $a_k \neq 0$ ), $m$ is the order of the zero of $f$ at $z = 0$ (the case $m = 0$ being taken to mean $f(0) \neq 0$ ), $Q$ a polynomial (whose degree we shall call $q$ ), and $p$ is the smallest non-negative integer such that the series $\sum_{n=1}^\infty\frac{1}{|a_n|^{p+1}}$ converges. The non-negative integer $g=\max\{p,q\}$ is called the genus of the entire function $f$ . In this notation, $g \leq \rho \leq g + 1$ In other words: If the order $\rho$ is not an integer, then $g = [ \rho ]$ is the integer part of $\rho$ . If the order is a positive integer, then there are two possibilities: $g = \rho-1$ or $g = \rho$ .

Furthermore, Jensen's inequality implies that its roots are distributed sparsely, with critical exponent $\alpha \leq \rho \leq g+1$ .

For example, $\sin$ , $\cos$ and $\exp$ are entire functions of genus $g = \rho = 1$ .

Critical exponent

Define the critical exponent of the roots of $f$ as the following: $\alpha := \limsup \limits_r \log_r N(f, r)$ where $N(f, r)$ is the number of roots with modulus $< r$ . In other words, we have an asymptotic bound on the growth behavior of the number of roots of the function: $\forall \epsilon > 0\quad N(f, r) \ll r^{\alpha + \epsilon}, \text{ and exists a sequence }r_k\text{ such that } N(f, r_k) > k r_k^{\alpha - \epsilon}$ It's clear that $\alpha\geq 0$ .

Theorem:{{Cite web |last=Dupuy |first=Taylor |title=Hadamard's Theorem and Entire Functions of Finite Order — For Math 331 |url=https://tdupu.github.io/complexspring2017/hadamard.pdf}} If $f$ is an entire function with infinitely many roots, then $\alpha = \inf\left\{\beta : \sum_k |a_k|^{-\beta} < \infty\right\} = \frac{1}{\liminf \limits_k \log_k |a_k|}$ Note: These two equalities are purely about the limit behaviors of a real number sequence $|a_1| \leq |a_2| \leq \cdots$ that diverges to infinity. It does not involve complex analysis.

Proposition: $\alpha(f) \leq \rho$ ,{{Cite web |last=Kupers |first=Alexander |date=April 30, 2020 |title=Lectures on complex analysis |url=https://www.utsc.utoronto.ca/people/kupers/wp-content/uploads/sites/50/2020/12/complex-analysis-2019.pdf |website=Lecture notes for Math 113.}}, Theorem 12.3.4.ii. by Jensen's formula.

Proof

Since $f(z) / z^m$ is also an entire function with the same order $\rho$ and genus, we can wlog assume $m = 1$ .

If $f$ has only finitely many roots, then $f(z) = e^{Q(z)}\prod_{k=1}^n E_0(z/a_k)$ with the function $e^{Q(z)}$ of order $\rho$ . Thus by an application of the Borel–Carathéodory theorem, $Q$ is a polynomial of degree $deg(Q) \leq \text{floor}(\rho)$ , and so we have $\rho = deg(Q) = g$ .

Otherwise, $f$ has infinitely many roots. This is the tricky part and requires splitting into two cases. First show that $g \leq \text{floor}(\rho)$ , then show that $\rho \leq g+1$ .

Define the function $g(z) := \prod_{k=1}^\infty E_p(z/a_k)$ where $p = \text{floor}(\alpha)$ . We will study the behavior of $f(z)/g(z)$ .

= Bounds on the behaviour of {{math| {{abs |''E''<sub>''p''</sub>}}}} =

In the proof, we need four bounds on $|E_p|$ :

For any $r\in (0, 1)$ , $|1- E_p(z)| \leq O( |z|^{p+1})$ when $|z| \leq r$ .
For any $r\in (0, 1)$ , there exists $B>0$ such that $\ln |E_p(z)| \geq -B |z|^{p+1}$ when $|z| \leq r$ .
For any $r\in (0, 1)$ , there exists $B>0$ such that $|E_p(z)| \geq |1-z| e^{-B |z|^{p}}$ when $|z| \geq r$ .
$\ln |E_p(z)| \leq O(|z|^{p+1})$ for all $z$ , and $\ln |E_p(z)| \leq O(|z|^{p})$ as $|z| \to \infty$ .

These are essentially proved in the similar way. As an example, we prove the fourth one. $\ln |E_n(z)| = Re\left(-z^{n+1}\sum_{k=0}^\infty \frac{z^k}{k+n+1}\right) \leq |z|^{n+1} |g(z)|$ where $g(z):= \sum_{k=0}^\infty \frac{z^k}{k+n+1}$ is an entire function. Since it is entire, for any $R> 0$ , it is bounded in $B(0, R)$ . So $\ln |E_n(z)| = O(|z|^{n+1})$ inside $B(0, R)$ .

Outside $B(0, R)$ , we have $\ln |E_n(z)| = \ln |1-z| + Re(Q(z)) = o(|z|) + O(|z|^n) < O(|z|^{n+1})$

= {{math| ''g''}} is well-defined =

Source:

For any $R >0$ , we show that the sum $\sum_{k=1}^\infty \ln |E_p(z/a_k)|$ converges uniformly over $B(0, R)$ .

Since only finitely many $|a_k| < KR$ , we can split the sum to a finite bulk and an infinite tail: $\sum_{k=1}^\infty \ln |E_p(z/a_k)| = \sum_{|a_k| < KR}\ln |E_p(z/a_k)| + \sum_{|a_k| \geq KR}\ln |E_p(z/a_k)|$ The bulk term is a finite sum, so it converges uniformly. It remains to bound the tail term.

By bound (1) on $|E_p|$ , $|1- E_p(z/a_k)| \leq B|z/a_k|^{p+1} \leq B/K^{p+1}$ . So if $K$ is large enough, for some $B' > 0$ ,{{r|g=nb|name=|r=so that $B/K^{p+1} < 1/2$ , then we can use the bound $\ln |1-w| \leq B' |w| \forall |w| < 1/2$ to get}} $\sum_{|a_k| \geq KR} \ln |1 - (1-E_p(z/a_k))| \leq \sum_{|a_k| \geq KR} B'B |z/a_k|^{p+1} < |z|^{p+1} B'B\sum_k \frac{1}{|a_k|^{p+1}}$ Since $p + 1 = \text{floor}(\alpha) + 1 > \alpha$ , the last sum is finite.

= {{math| ''g'' ≤ floor(''ρ'')}}=

As usual in analysis, we fix some small $\epsilon > 0$ .

Then the goal is to show that $f(z)/g(z)$ is of order $\leq \rho+\epsilon$ . This does not exactly work, however, due to bad behavior of $f(z)/g(z)$ near $a_k$ . Consequently, we need to pepper the complex plane with "forbidden disks", one around each $a_k$ , each with radius $\frac{1}{|a_k|^{\rho + \epsilon}}$ . Then since $\sum_k \frac{1}{|a_k|^{\rho + \epsilon}} < \infty$ by the previous result on $\alpha$ , we can pick an increasing sequence of radii $R_1 < R_2 < \cdots$ that diverge to infinity, such that each circle $\partial B(0, R_n)$ avoids all these forbidden disks.

Thus, if we can prove a bound of form $\ln \left| \frac{f(z)}{g(z)}\right| = O(|z|^{\rho + \epsilon}) = o(|z|^{\rho + 2\epsilon})$ for all large $z$ {{r|g=nb|name=|r=That is, we fix some yet-to-be-determined constant $R$ , and use " $z$ is large" to mean $|z| > R$ .}} that avoids these forbidden disks, then by the same application of Borel–Carathéodory theorem, $deg(Q) \leq \text{floor}(\rho + 2\epsilon)$ for any $\epsilon > 0$ , and so as we take $\epsilon \to 0$ , we obtain $g \leq \text{floor}(\rho)$ .

Since $\ln \left| f(z)\right| = o(|z|^{\rho + \epsilon})$ by the definition of $\rho$ , it remains to show that $-\ln \left| g(z)\right| = O(|z|^{\rho + \epsilon})$ , that is, there exists some constant $B > 0$ such that $\sum_{k=1}^\infty \ln |E_p(z/a_k)| \geq -B |z|^{\rho + \epsilon}$ for all large $z$ that avoids these forbidden disks.

As usual in analysis, this infinite sum can be split into two parts: a finite bulk and an infinite tail term, each of which is to be separately handled. There are finitely many $a_k$ with modulus $< |z_k|/2$ and infinitely many $a_k$ with modulus $\geq |z_k|/2$ . So we have to bound: $\sum_{|a_k| < |z_k|/2} \ln |E_p(z/a_k)| + \sum_{|a_k| \geq |z_k|/2} \ln |E_p(z/a_k)|$ The upper-bounding can be accomplished by the bounds (2), (3) on $|E_p|$ , and the assumption that $z$ is outside every forbidden disk. Details are found in.

= {{math| ''ρ'' ≤ ''g'' + 1}}=

This is a corollary of the following:

If $f(z) = e^{Q(z)}z^m\prod_k E_p(z/a_k)$ has genus $g$ , then $\ln |f(z)| = O(|z|^{g+1})$ .

Split the sum to three parts: $\ln |f(z)| = Re(Q(z))+ m\, Re (\ln z) +
\sum_{k} \ln |E_p(z/a_k)|.$ The first two terms are $O(|z|^p) = o(|z|^{g+1})$ . The third term is bounded by bound (4) of $|E_p|$ : $\sum_{k} \ln |E_p(z/a_k)| \leq B|z|^{q+1} \sum_k \frac{1}{|a_k|^{q+1}}.$ By assumption, $p = \text{floor}(\alpha)$ , so $\sum_k \frac{1}{|a_k|^{q+1}} < \infty$ . Hence the above sum is $O(|z|^{q+1}) = O(|z|^{g+1}).$

Applications

With Hadamard factorization we can prove some special cases of Picard's little theorem.

Theorem:{{Cite book |last=Conway |first=John B. |url=http://link.springer.com/10.1007/978-1-4612-6313-5 |title=Functions of One Complex Variable I |date=1978 |publisher=Springer New York |isbn=978-0-387-94234-6 |series=Graduate Texts in Mathematics |volume=11 |location=New York, NY |doi=10.1007/978-1-4612-6313-5}} Chapter 11, Theorems 3.6, 3.7. If $f$ is entire, nonconstant, and has finite order, then it assumes either the whole complex plane or the plane minus a single point.

Proof: If $f$ does not assume value $z_0$ , then by Hadamard factorization, $f(z) - z_0 = e^{Q(z)}$ for a nonconstant polynomial $Q$ . By the fundamental theorem of algebra, $Q$ assumes all values, so $f(z) - z_0$ assumes all nonzero values.

Theorem: If $f$ is entire, nonconstant, and has finite, non-integer order $\rho$ , then it assumes the whole complex plane infinitely many times.

Proof: For any $w\in \mathbb C$ , it suffices to prove $f(z) - w$ has infinitely many roots. Expand $f(z) - w$ to its Hadamard representation $f(z) - w = e^{Q(z)} z^m \prod_k E_p(z/a_k)$ . If the product is finite, then $\rho = g$ is an integer.

References

Notes

Category:Theorems in complex analysis