— 1. Jensen’s formula —

Suppose {f} is a non-zero rational function {f =P/Q}, then by the fundamental theorem of algebra one can write

\displaystyle  f(z) = c \frac{\prod_\rho (z-\rho)}{\prod_\zeta (z-\zeta)}

for some non-zero constant {c}, where {\rho} ranges over the zeroes of {P} (counting multiplicity) and {\zeta} ranges over the zeroes of {Q} (counting multiplicity), and assuming {z} avoids the zeroes of {Q}. Taking absolute values and then logarithms, we arrive at the formula

\displaystyle  \log |f(z)| = \log |c| + \sum_\rho \log|z-\rho| - \sum_\zeta \log |z-\zeta|, \ \ \ \ \ (1)

as long as {z} avoids the zeroes of both {P} and {Q}. (In this set of notes we use {\log} for the natural logarithm when applied to a positive real number, and {\mathrm{Log}} for the standard branch of the complex logarithm (which extends {\log}); the multi-valued complex logarithm {\log} will only be used in passing.) Alternatively, taking logarithmic derivatives, we arrive at the closely related formula

\displaystyle  \frac{f'(z)}{f(z)} = \sum_\rho \frac{1}{z-\rho} - \sum_\zeta \frac{1}{z-\zeta}, \ \ \ \ \ (2)

again for {z} avoiding the zeroes of both {P} and {Q}. Thus we see that the zeroes and poles of a rational function {f} describe the behaviour of that rational function, as well as close relatives of that function such as the log-magnitude {\log|f|} and log-derivative {\frac{f'}{f}}. We have already seen these sorts of formulae arise in our treatment of the argument principle in 246A Notes 4.

Exercise 1 Let {P(z)} be a complex polynomial of degree {n \geq 1}.
  • (i) (Gauss-Lucas theorem) Show that the complex roots of {P'(z)} are contained in the closed convex hull of the complex roots of {P(z)}.
  • (ii) (Laguerre separation theorem) If all the complex roots of {P(z)} are contained in a disk {D(z_0,r)}, and {\zeta \not \in D(z_0,r)}, then all the complex roots of {nP(z) + (\zeta - z) P'(z)} are also contained in {D(z_0,r)}. (Hint: apply a suitable Möbius transformation to move {\zeta} to infinity, and then apply part (i) to a polynomial that emerges after applying this transformation.)

There are a number of useful ways to extend these formulae to more general meromorphic functions than rational functions. Firstly there is a very handy “local” variant of (1) known as Jensen’s formula:

Theorem 2 (Jensen’s formula) Let {f} be a meromorphic function on an open neighbourhood of a disk {\overline{D(z,r)} = \{ z: |z-z_0| \leq r \}}, with all removable singularities removed. Then, if {z_0} is neither a zero nor a pole of {f}, we have

\displaystyle  \log |f(z_0)| = \int_0^1 \log |f(z_0+re^{2\pi i t})|\ dt + \sum_{\rho: |\rho-z_0| \leq r} \log \frac{|\rho-z_0|}{r} \ \ \ \ \ (3)

\displaystyle  - \sum_{\zeta: |\zeta-z_0| \leq r} \log \frac{|\zeta-z_0|}{r}

where {\rho} and {\zeta} range over the zeroes and poles of {f} respectively (counting multiplicity) in the disk {\overline{D(z,r)}}.

One can view (3) as a truncated (or localised) variant of (1). Note also that the summands {\log \frac{|\rho-z_0|}{r}, \log \frac{|\zeta-z_0|}{r}} are always non-positive.

Proof: By perturbing {r} slightly if necessary, we may assume that none of the zeroes or poles of {f} (which form a discrete set) lie on the boundary circle {\{ z: |z-z_0| = r \}}. By translating and rescaling, we may then normalise {z_0=0} and {r=1}, thus our task is now to show that

\displaystyle  \log |f(0)| = \int_0^1 \log |f(e^{2\pi i t})|\ dt + \sum_{\rho: |\rho| < 1} \log |\rho| - \sum_{\zeta: |\zeta| < 1} \log |\zeta|. \ \ \ \ \ (4)

We may remove the poles and zeroes inside the disk {D(0,1)} by the useful device of Blaschke products. Suppose for instance that {f} has a zero {\rho} inside the disk {D(0,1)}. Observe that the function

\displaystyle  B_\rho(z) := \frac{\rho - z}{1 - \overline{\rho} z} \ \ \ \ \ (5)

has magnitude {1} on the unit circle {\{ z: |z| = 1\}}, equals {\rho} at the origin, has a simple zero at {\rho}, but has no other zeroes or poles inside the disk. Thus Jensen’s formula (4) already holds if {f} is replaced by {B_\rho}. To prove (4) for {f}, it thus suffices to prove it for {f/B_\rho}, which effectively deletes a zero {\rho} inside the disk {D(0,1)} from {f} (and replaces it instead with its inversion {1/\overline{\rho}}). Similarly we may remove all the poles inside the disk. As a meromorphic function only has finitely many poles and zeroes inside a compact set, we may thus reduce to the case when {f} has no poles or zeroes on or inside the disk {D(0,1)}, at which point our goal is simply to show that

\displaystyle  \log |f(0)| = \int_0^1 \log |f(e^{2\pi i t})|\ dt.

Since {f} has no zeroes or poles inside the disk, it has a holomorphic logarithm {F} (Exercise 46 of 246A Notes 4). In particular, {\log |f|} is the real part of {F}. The claim now follows by applying the mean value property (Exercise 17 of 246A Notes 3) to {\log f}. \Box

An important special case of Jensen’s formula arises when {f} is holomorphic in a neighborhood of {\overline{D(z_0,r)}}, in which case there are no contributions from poles and one simply has

\displaystyle  \int_0^1 \log |f(z_0+re^{2\pi i t})|\ dt = \log |f(z_0)| + \sum_{\rho: |\rho-z_0| \leq r} \log \frac{r}{|\rho-z_0|}. \ \ \ \ \ (6)

This is quite a useful formula, mainly because the summands {\log \frac{|\rho-z_0|}{r}} are non-negative. Here are some quick applications of this formula:

Exercise 3 Use (6) to give another proof of Liouville’s theorem: a bounded holomorphic function {f} on the entire complex plane is necessarily constant.

Exercise 4 Use Jensen’s formula to prove the fundamental theorem of algebra: a complex polynomial {P(z)} of degree {n} has exactly {n} complex zeroes (counting multiplicity), and can thus be factored as {P(z) = c (z-z_1) \dots (z-z_n)} for some complex numbers {c,z_1,\dots,z_n} with {c \neq 0}. (Note that the fundamental theorem was invoked previously in this section, but only for motivational purposes, so the proof here is non-circular.)

Exercise 5 (Shifted Jensen’s formula) Let {f} be a meromorphic function on an open neighbourhood of a disk {\{ z: |z-z_0| \leq r \}}, with all removable singularities removed. Show that

\displaystyle  \log |f(z)| = \int_0^1 \log |f(z_0+re^{2\pi i t})| \mathrm{Re} \frac{r e^{2\pi i t} + (z-z_0)}{r e^{2\pi i t} - (z-z_0)}\ dt \ \ \ \ \ (7)

\displaystyle  + \sum_{\rho: |\rho-z_0| \leq r} \log \frac{|\rho-z|}{|r - \rho^* (z-z_0)|}

\displaystyle - \sum_{\zeta: |\zeta-z_0| \leq r} \log \frac{|\zeta-z|}{|r - \zeta^* (z-z_0)|}

for all {z} in the open disk {\{ z: |z-z_0| < r\}} that are not zeroes or poles of {f}, where {\rho^* = \frac{\overline{\rho-z_0}}{r}} and {\zeta^* = \frac{\overline{\zeta-z_0}}{r}}. (The function {\Re \frac{r e^{2\pi i t} + (z-z_0)}{r e^{2\pi i t} - (z-z_0)}} appearing in the integrand is sometimes known as the Poisson kernel, particularly if one normalises so that {z_0=0} and {r=1}.)

Exercise 6 (Bounded type)
  • (i) If {f} is a bounded holomorphic function on {D(0,1)} that is not identically zero, show that {\liminf_{r \rightarrow 1^-} \int_0^{2\pi} \log |f(re^{i\theta})\ d\theta > -\infty}.
  • (ii) If {f} is a meromorphic function on {D(0,1)} that is the ratio of two bounded holomorphic functions that are not identically zero, show that {\int_0^{2\pi} |\log |f(re^{i\theta})||\ d\theta < \infty}. (Functions {f} of this form are said to be of bounded type and lie in the Nevanlinna class for the unit disk {D(0,1)}.)

Exercise 7 (Smoothed out Jensen formula) Let {f} be a meromorphic function on an open set {U}, and let {\phi: U \rightarrow {\bf C}} be a smooth compactly supported function. Show that

\displaystyle \sum_\rho \phi(\rho) - \sum_\zeta \phi(\zeta) = \frac{-1}{2\pi} \int\int_U ((\frac{\partial}{\partial x} + i \frac{\partial}{\partial y}) \phi(x+iy)) \frac{f'}{f}(x+iy)\ dx dy

\displaystyle  \frac{1}{2\pi} \int\int_U ((\frac{\partial^2}{\partial x^2} + \frac{\partial^2}{\partial y}^2) \phi(x+iy)) \log |f(x+iy)|\ dx dy

where {\rho, \zeta} range over the zeroes and poles of {f} (respectively) in the support of {\phi}. Informally argue why this identity is consistent with Jensen’s formula.

When applied to entire functions {f}, Jensen’s formula relates the order of growth of {f} near infinity with the density of zeroes of {f}. Here is a typical result:

Proposition 8 Let {f: {\bf C} \rightarrow {\bf C}} be an entire function, not identically zero, that obeys a growth bound {f(z) \leq C \exp( |z|^\rho)} for some {C, \rho > 0} and all {z}. Then there exists a constant {C'>0} such that {D(0,R)} has at most {C' R^\rho} zeroes (counting multiplicity) for any {R \geq 1}.

Entire functions that obey a growth bound of the form {f(z) \leq C_\varepsilon \exp( |z|^{\rho+\varepsilon})} for every {\varepsilon>0} and {z} (where {C_\varepsilon} depends on {\varepsilon}) are said to be of order at most {\rho}. The above theorem shows that for such functions that are not identically zero, the number of zeroes in a disk of radius {R} does not grow much faster than {R^\rho}. This is often a useful preliminary upper bound on the zeroes of entire functions, as the order of an entire function tends to be relatively easy to compute in practice.

Proof: First suppose that {f(0)} is non-zero. From (6) applied with {r=2R} and {z_0=0} one has

\displaystyle  \int_0^1 \log(C \exp( (2R)^\rho ) )\ dt \geq \log |f(0)| + \sum_{\rho: |\rho| \leq 2R} \log \frac{2R}{|\rho|}.

Every zero in {D(0,R)} contribute at least {\log 2} to a summand on the right-hand side, while all other zeroes contribute a non-negative quantity, thus

\displaystyle  C (2R)^\rho \geq \log |f(0)| + N_R \log 2

where {N_R} denotes the number of zeroes in {D(0,R)}. This gives the claim for {f(0) \neq 0}. When {f(0)=0}, one can shift {f} by a small amount to make {f} non-zero at the origin (using the fact that zeroes of holomorphic functions not identically zero are isolated), modifying {C} in the process, and then repeating the previous arguments. \Box

Just as (3) and (7) give truncated variants of (1), we can create truncated versions of (2). The following crude truncation is adequate for many applications:

Theorem 9 (Truncated formula for log-derivative) Let {f} be a holomorphic function on an open neighbourhood of a disk {\{ z: |z-z_0| \leq r \}} that is not identically zero on this disk. Suppose that one has a bound of the form {|f(z)| \leq M^{O_{c_1,c_2}(1)} |f(z_0)|} for some {M \geq 1} and all {z} on the circle {\{ z: |z-z_0| = r\}}. Let {0 < c_2 < c_1 < 1} be constants. Then one has the approximate formula

\displaystyle  \frac{f'(z)}{f(z)} = \sum_{\rho: |\rho - z_0| \leq c_1 r} \frac{1}{z-\rho} + O_{c_1,c_2}( \frac{\log M}{r} )

for all {z} in the disk {\{ z: |z-z_0| < c_2 r \}} other than zeroes of {f}. Furthermore, the number of zeroes {\rho} in the above sum is {O_{c_1,c_2}(\log M)}.

Proof: To abbreviate notation, we allow all implied constants in this proof to depend on {c_1,c_2}.

We mimic the proof of Jensen’s formula. Firstly, we may translate and rescale so that {z_0=0} and {r=1}, so we have {|f(z)| \leq M^{O(1)} |f(0)|} when {|z|=1}, and our main task is to show that

\displaystyle  \frac{f'(z)}{f(z)} - \sum_{\rho: |\rho| \leq c_1} \frac{1}{z-\rho} = O( \log M ) \ \ \ \ \ (8)

for {|z| \leq c_2}. Note that if {f(0)=0} then {f} vanishes on the unit circle and hence (by the maximum principle) vanishes identically on the disk, a contradiction, so we may assume {f(0) \neq 0}. From hypothesis we then have

\displaystyle  \log |f(z)| \leq \log |f(0)| + O(\log M)

on the unit circle, and so from Jensen’s formula (3) we see that

\displaystyle  \sum_{\rho: |\rho| \leq 1} \log \frac{1}{|\rho|} = O(\log M). \ \ \ \ \ (9)

In particular we see that the number of zeroes with {|\rho| \leq c_1} is {O(\log M)}, as claimed.

Suppose {f} has a zero {\rho} with {c_1 < |\rho| \leq 1}. If we factor {f = B_\rho g}, where {B_\rho} is the Blaschke product (5), then

\displaystyle  \frac{f'}{f} = \frac{B'_\rho}{B_\rho} + \frac{g'}{g}

\displaystyle  = \frac{g'}{g} + \frac{1}{z-\rho} - \frac{1}{z-1/\overline{\rho}}.

Observe from Taylor expansion that the distance between {\rho} and {1/\overline{\rho}} is {O( \log \frac{1}{|\rho|} )}, and hence {\frac{1}{z-\rho} - \frac{1}{z-1/\overline{\rho}} = O( \log \frac{1}{|\rho|} )} for {|z| \leq c_2}. Thus we see from (9) that we may use Blaschke products to remove all the zeroes in the annulus {c_1 < |\rho| \leq 1} while only affecting the left-hand side of (8) by {O( \log M)}; also, removing the Blaschke products does not affect {|f(z)|} on the unit circle, and only affects {\log |f(0)|} by {O(\log M)} thanks to (9). Thus we may assume without loss of generality that there are no zeroes in this annulus.

Similarly, given a zero {\rho} with {|\rho| \leq c_1}, we have {\frac{1}{z-1/\overline{\rho}} = O(1)}, so using Blaschke products to remove all of these zeroes also only affects the left-hand side of (8) by {O(\log M)} (since the number of zeroes here is {O(\log M)}), with {\log |f(0)|} also modified by at most {O(\log M)}. Thus we may assume in fact that {f} has no zeroes whatsoever within the unit disk. We may then also normalise {f(0) = 1}, then {\log |f(e^{2\pi i t})| \leq O(\log M)} for all {t \in [0,1]}. By Jensen’s formula again, we have

\displaystyle  \int_0^1 \log |f(e^{2\pi i t})|\ dt = 0

and thus (by using the identity {|x| = 2 \max(x,0) - x} for any real {x})

\displaystyle  \int_0^1 |\log |f(e^{2\pi i t})|\ dt \ll \log M. \ \ \ \ \ (10)

On the other hand, from (7) we have

\displaystyle  \log |f(z)| = \int_0^1 \log |f(e^{2\pi i t})| \Re \frac{e^{2\pi i t} + z}{e^{2\pi i t} - z}\ dt

which implies from (10) that {\log |f(z)|} and its first derivatives are {O( \log M )} on the disk {\{ z: |z| \leq c_2 \}}. But recall from the proof of Jensen’s formula that {\frac{f'}{f}} is the derivative of a logarithm {\log f} of {f}, whose real part is {\log |f|}. By the Cauchy-Riemann equations for {\log f}, we conclude that {\frac{f'}{f} = O(\log M)} on the disk {\{ z: |z| \leq c_2 \}}, as required. \Box

Exercise 10
  • (i) (Borel-Carathéodory theorem) If {f: U \rightarrow {\bf C}} is analytic on an open neighborhood of a disk {\overline{D(z_0,R)}}, show that

    \displaystyle  \sup_{z \in D(z_0,r)} |f(z)| \leq \frac{2r}{R-r} \sup_{z \in \overline{D(z_0,R)}} \mathrm{Re} f(z) + \frac{R+r}{R-r} |f(z_0)|.

    (Hint: one can normalise {z_0=0}, {R=1}, {f(0)=0}, and {\sup_{|z-z_0| \leq R} \mathrm{Re} f(z)=1}. Now {f} maps the unit disk to the half-plane {\{ \mathrm{Re} z \geq 1 \}}. Use a Möbius transformation to map the half-plane to the unit disk and then use the Schwarz lemma.)
  • (ii) Use (i) to give an alternate way to conclude the proof of Theorem 9.

A variant of the above argument allows one to make precise the heuristic that holomorphic functions locally look like polynomials:

Exercise 11 (Local Weierstrass factorisation) Let the notation and hypotheses be as in Theorem 9. Then show that

\displaystyle  f(z) = P(z) \exp( g(z) )

for all {z} in the disk {\{ z: |z-z_0| < c_2 r \}}, where {P} is a polynomial whose zeroes are precisely the zeroes of {f} in {\{ z: |z-z_0| \leq c_1r \}} (counting multiplicity) and {g} is a holomorphic function on {\{ z: |z-z_0| < c_2 r \}} of magnitude {O_{c_1,c_2}( \log M )} and first derivative {O_{c_1,c_2}( \log M / r )} on this disk. Furthermore, show that the degree of {P} is {O_{c_1,c_2}(\log M)}.

Exercise 12 (Preliminary Beurling factorisation) Let {H^\infty(D(0,1))} denote the space of bounded analytic functions {f: D(0,1) \rightarrow {\bf C}} on the unit disk; this is a normed vector space with norm

\displaystyle  \|f\|_{H^\infty(D(0,1))} := \sup_{z \in D(0,1)} |f(z)|.

  • (i) If {f \in H^\infty(D(0,1))} is not identically zero, and {z_n} denote the zeroes of {f} in {D(0,1)} counting multiplicity, show that

    \displaystyle  \sum_n (1-|z_n|) < \infty


    \displaystyle  \sup_{0 < r < 1} \int_0^{2\pi} | \log |f(re^{i\theta})| |\ d\theta < \infty.

  • (ii) Let the notation be as in (i). If we define the Blaschke product

    \displaystyle  B(z) := z^m \prod_{|z_n| \neq 0} \frac{|z_n|}{z_n} \frac{z_n-z}{1-\overline{z_n} z}

    where {m} is the order of vanishing of {f} at zero, show that this product converges absolutely to a meromorphic function on {{\bf C}} outside of the {1/\overline{z_n}}, and that {|f(z)| \leq \|f\|_{H^\infty(D(0,1)} |B(z)|} for all {z \in D(0,1)}. (It may be easier to work with finite Blaschke products first to obtain this bound.)
  • (iii) Continuing the notation from (i), establish a factorisation {f(z) = B(z) \exp(g(z))} for some holomorphic function {g: D(0,1) \rightarrow {\bf C}} with {\mathrm{Re}(z) \leq \log \|f\|_{H^\infty(D(0,1)}} for all {z\in D(0,1)}.
  • (iv) (Theorem of F. and M. Riesz, special case) If {f \in H^\infty(D(0,1))} extends continuously to the boundary {\{e^{i\theta}: 0 \leq \theta < 2\pi\}}, show that the set {\{ 0 \leq \theta < 2\pi: f(e^{i\theta})=0 \}} has zero measure.

Remark 13 The factorisation (iii) can be refined further, with {g} being the Poisson integral of some finite measure on the unit circle. Using the Lebesgue decomposition of this finite measure into absolutely continuous parts one ends up factorising {H^\infty(D(0,1))} functions into “outer functions” and “inner functions”, giving the Beurling factorisation of {H^\infty}. There are also extensions to larger spaces {H^p(D(0,1))} than {H^\infty(D(0,1))} (which are to {H^\infty} as {L^p} is to {L^\infty}), known as Hardy spaces. We will not discuss this topic further here, but see for instance this text of Garnett for a treatment.

Exercise 14 (Littlewood’s lemma) Let {f} be holomorphic on an open neighbourhood of a rectangle {R = \{ \sigma+it: \sigma_0 \leq \sigma \leq \sigma_1; 0 \leq t \leq T \}} for some {\sigma_0 < \sigma_1} and {T>0}, with {f} non-vanishing on the boundary of the rectangle. Show that

\displaystyle  2\pi \sum_\rho (\mathrm{Re}(\rho)-\sigma_0) = \int_0^T \log |f(\sigma_0+it)|\ dt - \int_0^T \log |f(\sigma_1+it)|\ dt

\displaystyle  + \int_{\sigma_0}^{\sigma_1} \mathrm{arg} f(\sigma+iT)\ d\sigma - \int_{\sigma_0}^{\sigma_1} \mathrm{arg} f(\sigma)\ d\sigma

where {\rho} ranges over the zeroes of {f} inside {R} (counting multiplicity) and one uses a branch of {\mathrm{arg} f} which is continuous on the upper, lower, and right edges of {C}. (This lemma is a popular tool to explore the zeroes of Dirichlet series such as the Riemann zeta function.)

— 2. The Weierstrass factorisation theorem —

The fundamental theorem of algebra shows that every polynomial {P(z)} of degree {n} comes with {n} complex zeroes {z_1,\dots,z_n} (counting multiplicity). In the converse direction, given any {n} complex numbers {z_1,\dots,z_n} (again allowing multiplicity), one can form a degree {n} polynomial {P(z)} with precisely these zeroes by the formula

\displaystyle  P(z) := c (z-z_1) \dots (z-z_n) \ \ \ \ \ (11)

where {c} is an arbitrary non-zero constant, and by the factor theorem this is the complete set of polynomials with this set of zeroes (counting multiplicity). Thus, except for the freedom to multiply polynomials by non-zero constants, one has a one-to-one correspondence between polynomials (excluding the zero polynomial as a degenerate case) and finite (multi-)sets of complex numbers.

As discussed earlier in this set of notes, one can think of a entire function as a sort of infinite degree analogue of a polynomial. One can then ask what the analogue of the above correspondence is for entire functions are – can one identify entire functions (not identically zero, and up to constants) by their sets of zeroes?

There are two obstructions to this. Firstly there are a number of non-trivial entire functions with no zeroes whatsoever. Most prominently, we have the exponential function {\exp(z)} which has no zeroes despite being non-constant. More generally, if {g(z)} is an entire function, then clearly {\exp(g(z))} is an entire function with no zeroes. In particular one can multiply (or divide) any other entire function {f(z)} by {\exp(g(z))} without affecting the location and order of the zeroes.

Secondly, we know (see Corollary 24 of 246A Notes 3) that the set of zeroes of an entire function (that is not identically zero) must be isolated; in particular, in any compact set there can only be finitely many zeroes. Thus, by covering the complex plane by an increasing sequence of compact sets (e.g., the disks {\overline{D(0,n)}}), one can index the zeroes (counting multiplicity) by a sequence {z_1,z_2,\dots} of complex numbers (possibly with repetition) that is either finite, or goes to infinity.

Now we turn to the Weierstrass factorisation theorem, which asserts that once one accounts for these two obstructions, we recover a correspondence between entire functions and sequences of zeroes.

Theorem 15 (Weierstrass factorization theorem) Let {z_1,z_2,\dots} be a sequence of complex numbers that is either finite or going to infinity. Then there exists an entire function {f} that has zeroes precisely at {z_1,z_2,\dots}, with the order of zero of {f} at each {z_j} equal to the number of times {z_j} appears in the sequence. Furthermore, this entire function is unique up to multiplication by exponentials of entire functions; that is to say, if {f, \tilde f} are entire functions that are both of the above form, then {\tilde f(z) = f(z) \exp(g(z))} for some entire function {g}.

We now establish this theorem. We begin with the easier uniqueness part of the theorem. If {\tilde f, f} are entire functions with the same locations and orders of zeroes, then the ratio {\tilde f/f} is a meromorphic function on {{\bf C}} which only has removable singularities, and becomes an entire function with no zeroes once the singularities are removed. Since the domain {{\bf C}} of an entire function is simply connected, we can then take a branch of the complex logarithm {\tilde f/f} (see Exercise 46 of 246A Notes 4) to write {\tilde f/f = \exp(g)} for an entire function {g} (after removing singularities), giving the uniqueness claim.

Now we turn to existence. If the sequence {z_1,z_2,\dots} is finite, we can simply use the formula (11) to produce the required entire function {f} (setting {c} to equal {1}, say). So now suppose that the sequence is infinite. Naively, one might try to replicate the formula (11) and set

\displaystyle  f(z) := \prod_{n=1}^\infty (z-z_n).

Here we encounter a serious problem: the infinite product {\prod_{n=1}^\infty (z-z_n)} is likely to be divergent (that is to say, the partial products {\prod_{n=1}^N (z-z_n)}) fail to converge, given that the factors {z-z_n} go off to infinity. On the other hand, we do have this freedom to multiply {f} by a constant (or more generally, the exponential of an entire function). One can try to use this freedom to “renormalise” the factors {z-z_n} to make them more likely to converge. Much as an infinite series {\sum_{n=1}^\infty a_n} is more likely to converge when its summands {a_n} converge rapidly to zero, an infinite series {\prod_{n=1}^\infty a_n} is more likely to converge when its factors {a_n} converge rapidly to {1}. Here is one formalisation of this principle:

Lemma 16 (Absolutely convergent products) Let {a_n} be a sequence of complex numbers such that {\sum_{n=1}^\infty |a_n-1| < \infty}. Then the product {\prod_{n=1}^\infty a_n} converges. Furthermore, this product vanishes if and only if one of the factors {a_n} vanishes.

Products covered by this lemma are known as absolutely convergent products. It is possible for products to converge without being absolutely convergent, but such “conditionally convergent products” are infrequently used in mathematics.

Proof: By the zero test, {|a_n-1| \rightarrow 0}, thus {a_n} converges to {1}. In particular, all but finitely many of the {a_n} lie in the disk {D(1,1/2)}. We can then factor {\prod_{n=1}^\infty a_n = \prod_{n=1}^N a_n \times \prod_{n=N+1}^\infty a_n}, where {N} is such that {a_n \in D(1,1/2)} for {n > N}, and we see that it will suffice to show that the infinite product {\prod_{n=N+1}^\infty a_n} converges to a non-zero number. But on using the standard branch {\mathrm{Log}} of the complex logarithm on {D(1,1/2)} we can write {a_n = \exp( \mathrm{Log} a_n )}. By Taylor expansion we have {\mathrm{Log} a_n = O( |a_n-1| )}, hence the series {\sum_{n=N+1}^\infty \mathrm{Log} a_n} is absolutely convergent. From the properties of the complex exponential we then see that the product {\prod_{n=N+1}^\infty a_n} converges to {\exp(\sum_{n=N+1}^\infty \mathrm{Log} a_n)}, giving the claim. \Box

It is well known that absolutely convergent series are preserved by rearrangement, and the same is true for absolutely convergent products:

Exercise 17 If {\prod_{n=1}^\infty a_n} is an absolutely convergent product of complex numbers {a_n}, show that any permutation of the {a_n} leads to the same absolutely convergent product, thus {\prod_{n=1}^\infty a_n = \prod_{m=1}^\infty a_{\phi(m)}} for any permutation {\phi} of the positive integers {\{1,2,3,\dots\}}.

  • (i) Let {a_n} be a sequence of real numbers with {a_n \geq 1} for all {n}. Show that {\prod_{n=1}^\infty a_n} converges if and only if {\sum_{n=1}^\infty (a_n-1)} converges.
  • (ii) Let {z_n} be a sequence of complex numbers. Show that {\prod_{n=1}^\infty (1+z_n)} is absolutely convergent if and only if {\prod_{n=1}^\infty (1+|z_n|)} is convergent.

To try to use Lemma 16, we can divide each factor {z-z_n} by the constant {-z_n} to make it closer to {1} in the limit {n \rightarrow \infty}. Since

\displaystyle  \frac{z-z_n}{-z_n} = 1 - \frac{z}{z_n}

we can thus attempt to construct the desired entire function {f} using the formula

\displaystyle  f(z) = \prod_{n=1}^\infty (1 - \frac{z}{z_n}). \ \ \ \ \ (12)

Immediately there is the objection that this product is undefined if one or more of the putative zeroes {z_n} is located at the origin, this objection is easily dealt with since the origin can only occur finitely many (say {m}) times, so if we remove the {m} copies of the origin from the sequence of zeroes {z_n}, apply the Weierstrass factorisation theorem to the remaining zeroes, and then multiply the resulting entire function by {z^m}, we can reduce to the case where the origin is not one of the zeroes.

In order to apply Lemma 16 to make this product converge, we would need {\sum_{n=1}^\infty \frac{|z|}{|z_n|}} to converge for every {z}, or equivalently that

\displaystyle  \prod_{n=1}^\infty \frac{1}{|z_n|} < \infty. \ \ \ \ \ (13)

This is basically a requirement that the {z_n} converge to infinity sufficiently quickly. Not all sequences {z_n} covered by Theorem 15 obey this condition, but let us begin with this case for sake of argument. Lemma 16 now tells us that {f(z)} is well-defined for every {z}, and vanishes if and only if {z} is equal to one of the {z_n}. However, we need to establish holomorphicity. This can be accomplished by the following product form of the Weierstrass {M}-test.

Exercise 18 (Product Weierstrass {M}-test) Let {X} be a set, and for any natural number {n}, let {f_n: X \rightarrow {\bf C}} be a bounded function. If the sum {\sum_{n=1}^\infty \sup_{x \in X} |f_n(x)-1| \leq M} for some finite {M}, show that the products {\prod_{n=1}^N f_n} converge uniformly to {\prod_{n=1}^\infty f_n} on {X}. (In particular, if {X} is a topological space and all the {f_n} are continuous, then {\prod_{n=1}^\infty f_n} is continuous also.)

Using this exercise, we see that (under the assumption (13)) that the partial products {\prod_{n=1}^N (1 - \frac{z}{z_n})} converge locally uniformly to the infinite product in (12). Since each of the partial products are entire, and the (locally) uniform limit of holomorphic functions is holomorphic (Theorem 34 of 246A Notes 3), we conclude that the function (12) is entire. Finally, if a certain zero {z_j} appears {m} times in the sequence, then after factoring out {m} copies of {(1-\frac{z}{z_j})} we see that {f(z)} is the product of {(1-\frac{z}{z_j})^m} with an entire function that is non-vanishing at {z_j}, and thus {f} has a zero of order exactly {m} at {z_j}. This establishes the Weierstrass approximation theorem under the additional hypothesis that (13) holds.

What if (13) does not hold? The problem now is that our renormalized factors {1 - \frac{z}{z_n}} do not converge fast enough for Lemma 16 or Exercise 18 to apply. So we need to renormalize further, taking advantage of our ability to not just multiply by constants, but also by exponentials of entire functions. Observe that if {z} is fixed and {n} is large enough, then {1 - \frac{z}{z_n}} lies in {D(1,1/2)} and we can write

\displaystyle  1 - \frac{z}{z_n} = \exp( \mathrm{Log}( 1 - \frac{z}{z_n} ) ).

The function {\mathrm{Log}( 1 - \frac{z}{z_n} )} is not entire, but its Taylor approximation {-\frac{z}{z_n}} is. So it is natural to split

\displaystyle  1 - \frac{z}{z_n} = \exp(-\frac{z}{z_n}) \exp( \mathrm{Log}( 1 - \frac{z}{z_n} ) + \frac{z}{z_n} ) = \exp(-\frac{z}{z_n}) e^{\frac{z}{z_n}} (1-\frac{z}{z_n}).

We now discard the {\exp(-\frac{z}{z_n})} factors (which do not affect the zeroes) and now propose the new candidate entire function

\displaystyle  f(z) = \prod_{n=1}^\infty e^{\frac{z}{z_n}} (1-\frac{z}{z_n}).

The point here is that for {n} large enough, Taylor expansion gives

\displaystyle  \mathrm{Log}( 1 - \frac{z}{z_n} ) + \frac{z}{z_n} = O( \frac{|z|^2}{|z_n|^2})

and thus on exponentiating

\displaystyle  e^{\frac{z}{z_n}} (1-\frac{z}{z_n}) = 1 + O( \frac{|z|^2}{|z_n|^2}).

Repeating the previous arguments, we can then verify that {f} is an entire function with the required properties as long as we have the hypothesis

\displaystyle  \prod_{n=1}^\infty \frac{1}{|z_n|^2} < \infty \ \ \ \ \ (14)

which is weaker than (13) (for instance it is obeyed when {z_n=n}, whereas (13) fails in this case).

This suggests the way forward to the general case of the Weierstrass factorisation theorem, by using increasingly accurate Taylor expansions of

\displaystyle  \mathrm{Log}( 1 - \frac{z}{z_n} ) = \frac{z}{z_n} + \frac{1}{2} \frac{z^2}{z_n^2} + \frac{1}{3} \frac{z^3}{z_n^3} + \dots

when {|z|/|z_n| \leq 1/2}. To formalise this strategy, it is convenient to introduce the canonical factors

\displaystyle  E_k(z) := (1-z) \exp( \sum_{j=1}^k \frac{z^j}{j} ) \ \ \ \ \ (15)

for any complex number {z} and natural number {k}, thus

\displaystyle  E_0(z) = 1-z; \quad E_1(z) = e^z (1-z); \quad E_2(z) = e^{z+z^2/2} (1-z).

For any fixed {k}, these functions are entire and have precisely one zero, at {z=1}. In the disk {D(0,1/2)}, the Taylor expansion

\displaystyle  \mathrm{Log}(1-z) = - z - \frac{z^2}{2} - \frac{z^3}{3} - \dots

indicates that the {E_k(z)} converge uniformly to {1} as {k \rightarrow \infty}. Indeed, for {z \in D(0,1/2)} we have

\displaystyle  E_k(z) = \exp( - \sum_{j=k+1}^\infty \frac{z^j}{j} )

\displaystyle  = \exp( \sum_{j=k+1}^\infty O( 2^{-j}/k ) )

\displaystyle  = \exp( O( 2^{-k} ) )

\displaystyle  = 1 + O(2^{-k}) \ \ \ \ \ (16)

For our choice of entire function {f} we can now try

\displaystyle  f(z) := \prod_{n=1}^\infty E_{k_n}(z/z_n)

where {k_1,k_2,\dots} are natural numbers we are at liberty to please. To get as good a convergence for the product we can make the {k_n} go to infinity as fast as we please; but it turns out that the (somewhat arbitrary) choice of {k_n := n} will suffice for proving Weierstrass’s theorem, that is to say the product

\displaystyle  f(z) := \prod_{n=1}^\infty E_n(z/z_n)

is absolutely convergent (so that Lemma 16 and Exercise 18 applies, producing an entire function with the required zeroes). Indeed, for {z} in any disk {D(0,R)}, there is some {n_0} such that {|z_n| \geq 2R} for {n \geq n_0}, and for such {n} we have {E_n(z/z_n)-1 = O( 2^{-n})} by (16), giving the desired uniform absolute convergence on any disk {D(0,R)}, establishing the Weierstrass theorem.

Exercise 19 Let {U} be a connected non-empty open subset of {{\bf C}}.
  • (i) Show that if {z_1,z_2,\dots} is any sequence of points in {U}, that has no accumulation point inside {U}, then there exists a holomorphic function {f: U \rightarrow {\bf C}} that has zeroes precisely at the {z_j}, with the order of each zero {z_j} being the number of times {z_j} occurs in the sequence.
  • (ii) Show that any meromorphic function on {U} can be expressed as the ratio of two holomorphic functions on {U} (with the denominator being non-zero). Conclude that the field of meromorphic functions on {U} is the fraction field of the ring of holomorphic functions on {U}.

Exercise 20 (Mittag-Leffler theorem, special case) Let {z_n} be a sequence of distinct complex numbers going to infinity, and for each {n}, let {P_n} be a polynomial. Show that there exists a meromorphic function {f: {\bf C} \backslash \{z_1,z_2,\dots\} \rightarrow {\bf C}} whose singularity at each each {z_n} is given by {P_n(\frac{1}{z-z_n})}, in the sense that {f(z) - P_n(\frac{1}{z-z_n})} has a removable singularity at {z_n}. (Hint: consider a sum of the form {\sum_n P_n(\frac{1}{z-z_n}) - Q_n(z)}, where {Q_n(z)} is a partial Taylor expansion of {P_n(\frac{1}{z-z_n})} in the disk {D(0,|z_n|/2)}, chosen so that the sum becomes locally uniformly absolutely convergent.) This is a special case of the Mittag-Leffler theorem, which is the same statement but in which the domain {{\bf C}} is replaced by an arbitrary open set {U}; however, the proof of this generalisation is more difficult, requiring tools such as Runge’s approximation theorem which are not covered here.

— 3. The Hadamard factorisation theorem —

The Weierstrass factorisation theorem (and its proof) shows that any entire function {f} that is not identically zero can be factorised as

\displaystyle  f(z) = e^{g(z)} z^m \prod_{n=1}^\infty E_n(z/z_n)

where {m} is the order of vanishing of {f} at the origin, {z_n} are the zeroes of {f} away from the origin (counting multiplicity), and {g} is an additional entire function. However, this factorisation is not always convenient to work with in practice, in large part because the index {n} of the canonical factors {E_n} involved are unbounded, and also because not much information is provided about the entire function {g}. It turns out the situation becomes better if the entire function {f} is also known to be of order at most {\rho} for some {\rho \geq 0}, by which we mean that

\displaystyle |f(z)| \leq C_\varepsilon \exp( |z|^{\rho+\varepsilon})

for every {\varepsilon>0} and {z}, or in asymptotic notation

\displaystyle  f(z) = O_\varepsilon(\exp( |z|^{\rho+\varepsilon} )). \ \ \ \ \ (17)

In this case we expect to obtain a more precise factorisation for the following reason. Let us suppose we are in the simplest case where {f} has no zeroes whatsoever. Then we have {f = \exp(g)} for an entire function {g}. From (17) we then have

\displaystyle  \mathrm{Re} g(z) \leq O_\varepsilon(( 1 + |z|)^{\rho+\varepsilon}) \ \ \ \ \ (18)

for all {z}. This only controls the real part of {g}, but by applying the Borel-Carathéodory theorem (Exercise 10) to the disks {\overline{D(0,2|z|)}} we obtain a bound of the form

\displaystyle  g(z) = O_{\rho,\varepsilon,g(0)}( (1 + |z|)^{\rho+\varepsilon} )

for all {\varepsilon>0} and all {z}. That is to say, {g} is of polynomial growth of order at most {\rho}. Applying Exercise 29 of 246A Notes 3, we conclude that {g} must be a polynomial, and given its growth rate, it must have degree at most {d}, where {d := \lfloor \rho \rfloor} is the integer part of {\rho}. This hints that the entire function {g} that appears in the Weierstrass factorisation theorem could be taken to be a polynomial, if the theorem is formulated correctly. This is indeed the case, and is the content of the Hadamard factorisation theorem:

Theorem 21 (Hadamard factorisation theorem) Let {\rho \geq 0}, let {d := \lfloor \rho \rfloor}, and let {f} be an entire function of order at most {\rho}, with a zero of order {m \geq 0} at the origin and the remaining zeroes indexed (with multiplicity) as a finite or infinite sequence {z_1, z_2, \dots}. Then

\displaystyle  f(z) = e^{g(z)} z^m \prod_n E_d(z/z_n) \ \ \ \ \ (19)

for some polynomial {g} of degree at most {d}. The convergence in the infinite product is locally uniform.

We now prove this theorem. By dividing out by {z^m} (which does not affect the order of {f}) and removing the singularity at the origin, we may assume that {m=0}. If there are no other zeroes {z_n} then we are already done by the previous discussion; similarly if there are only finitely many zeroes {z_n} we can divide out by the finite number of elementary factors and remove singularities and again reduce to a case we have already established. Hence we may suppose that the sequence of zeroes {z_n} is infinite. As the zeroes of {f} are isolated, this forces {z_n} to go to infinity as {n \rightarrow \infty}.

Let us first check that the product {\prod_{n=1}^\infty E_d(z/z_n)} is absolutely convergent and locally uniform. A modification of the bound (16) shows that

\displaystyle  E_d(z/z_n) = 1 + O_d( |z|^{d+1}/|z_n|^{d+1})

if {|z|/|z_n| \leq 1/2}, which is the case for all but finitely many {n} if {z} is confined to a fixed compact set. Thus we will get absolute convergence from Lemma 16 (and also holomorphicity of the product from Exercise 18) once we establish the convergence

\displaystyle  \sum_{n=1}^\infty \frac{1}{|z_n|^{d+1}} < \infty \ \ \ \ \ (20)

(compare with (13), (14), which are basically the {d=0,1} cases of this analysis).

To achieve this convergence we will use the technique of dyadic decomposition (a generalisation of the Cauchy condensation test). Only a finite number of zeroes {z_n} lie in the disk {D(0,1)}, and we have already removed all zeroes at the origin, so by removing those finite zeroes we may assume that {|z_n| \geq 1} for all {n}. In particular, each remaining zero {z_n} lies in an annulus {\{ z: 2^k \leq |z| < 2^{k+1}\}} for some natural number {k}. On each such annulus, the expression {\frac{1}{|z_n|^{d+1}}} is at most {2^{-k(d+1)}} (and is in fact comparable to this quantity up to a constant depending on {d}, which is why we expect the dyadic decomposition method to be fairly efficient). Grouping the terms in (20) according to the annulus they lie in, it thus suffices to show that

\displaystyle  \sum_{k=0}^\infty \frac{N_k}{2^{k(d+1)}} < \infty

where {N_k} is the number of zeroes of {f} (counting multiplicity) in the annulus {\{ z: 2^k \leq |z| < 2^{k+1}\}}. But by Proposition 8, one has {N_k = O_{\rho,\varepsilon,f}( 2^{k(\rho+\varepsilon)})} for any {\varepsilon>0}. Since {d} is the integer part of {\rho}, one can choose {\varepsilon} small enough that {\rho+\varepsilon < d+1}, and so the series is dominated by a convergent geometric series and is thus itself convergent. This establishes the convergence of the product {\prod_n E_d(z/z_n)}. This function has zeroes in the same locations as {f} with the same orders, so by the same arguments as before we have

\displaystyle  f(z) = e^{g(z)} \prod_{n=1}^\infty E_d(z/z_n)

for some entire function {g}. It remains to show that {g} is a polynomial of degree at most {d}. If we could show the bound (18) for all {z} and any {\varepsilon>0}, we would be done. Taking absolute values and logarithms, we have

\displaystyle  \mathrm{Re} g(z) = \log |f(z)| - \sum_{n=1}^\infty \log |E_d(z/z_n)|

for {z \neq z_1,z_2,\dots} and hence as {f} is of order {\rho}, we have

\displaystyle  \mathrm{Re} g(z) \leq O_{f,\rho,\varepsilon}( (1+|z|)^{\rho+\varepsilon} ) - \sum_{n=1}^\infty \log |E_d(z/z_n)|

for {z \neq z_1,z_2,\dots}. So if, for a given choice of {\varepsilon>0}, we could show the lower bound

\displaystyle  \sum_{n=1}^\infty \log |E_d(z/z_n)| \geq - O_{f,\rho,\varepsilon}( (1+|z|)^{\rho+\varepsilon} ) \ \ \ \ \ (21)

for all {z \neq z_1,z_2,\dots}, we would be done (since {g} is continuous at each {z_n}, so the restriction {z \neq z_1,z_2,\dots} can be removed as far as upper bounding {g} is concerned). Unfortunately this can’t quite work as stated, because the factors {E_d(z/z_n)} go to zero as {z} approaches {z_n}, so {\log |E_d(z/z_n)|} approaches {-\infty}. So the desired bound (21) can’t work when {z} gets too close to one of the zeroes {z_n}. On the other hand, this logarithmic divergence is rather mild, so one can hope to somehow evade it. Indeed, suppose we are still able to obtain (21) for a sufficiently “dense” set of {z}, and more precisely for all {z} on a sequence {\{ |z| = R_k \}} of circles of radii {2^k \leq R_k <2^{k+1}} for {k=1,2,\dots}. Then the above argument lets us establish the upper bound

\displaystyle  \mathrm{Re} g(z) \leq O_{f,\rho,\varepsilon}( (1+|z|)^{\rho+\varepsilon} )

when {|z|=R_k}. But by the maximum principle (applied to the harmonic function {\mathrm{Re} g}) this then gives

\displaystyle  \mathrm{Re} g(z) \leq O_{f,\rho,\varepsilon}( (1+|z|)^{\rho+\varepsilon} )

for all {z} (because we have an upper bound of {O_{f,\rho,\varepsilon}( (1+R_k)^{\rho+\varepsilon} )} on each disk {D(0,R_k)}, and each {z} lies in one of the disks {D(0,R_k)} with {1+|z| \sim 1+R_k}).

So it remains to establish (21) for {z} in a sufficiently dense set of circles {\{ |z| = R_k\}}. We need lower bounds on {\log |E_d(z/z_n)|}. In the regime where the zeroes are distant in the sense that {|z|/|z_n| \leq 1/2}, Taylor expansion gives

\displaystyle  E_d(z/z_n) = \exp( O_d( |z|^{d+1}/|z_n|^{d+1} ) )

and hence

\displaystyle  \sum_{n: |z|/|z_n| \leq 1/2} \log |E_d(z/z_n)| \geq - O_d( \sum_{n: |z|/|z_n| \leq 1/2} |z|^{d+1}/|z_n|^{d+1} ).

We can adapt the proof of (20) to control this portion adequately:

Exercise 22 Establish the upper bounds

\displaystyle \sum_{n: |z|/|z_n| \leq 1/2} |z|^{d+1}/|z_n|^{d+1} \leq O_{f,\rho,\varepsilon}( (1+|z|)^{\rho+\varepsilon} )


\displaystyle \sum_{n: |z|/|z_n| > 1/2} |z|^{d}/|z_n|^{d} \leq O_{f,\rho,\varepsilon}( (1+|z|)^{\rho+\varepsilon} )

(the latter bound will be useful momentarily).

It thus remains to control the nearby zeroes, in the sense of showing that

\displaystyle  \sum_{n: |z|/|z_n| > 1/2} \log |E_d(z/z_n)| \geq -O_{f,\rho,\varepsilon}( (1+|z|)^{\rho+\varepsilon} )

for all {z} in a set of concentric circles {\{ |z| = R_k\}} with {2^k \leq R_k < 2^{k+1}}. Thus we need to lower bound {\log |E_d(w)|} for {|w| > 1/2}. Here we no longer attempt to take advantage of Taylor expansion as the convergence is too poor in this regime, so we fall back on the triangle inequality. Indeed from (15) and that inequality we have

\displaystyle  \log |E_d(w)| \geq - \log \frac{1}{|1-w|} - \sum_{j=1}^k \frac{|w|^j}{j} \geq \log \frac{1}{|1-w|} - O_d(|w|^d)


\displaystyle  \sum_{n: |z|/|z_n| > 1/2} \log |E_d(z/z_n)| \geq -\sum_{n: |z|/|z_n| > 1/2} \log \frac{1}{|1-z/z_n|}

\displaystyle - O_d(\sum_{n: |z|/|z_n| > 1/2} \frac{|z|^d}{|z_n|^d} ).

From the second part of Exercise 22, the contribution of the latter term is acceptable, so it remains to establish the upper bound

\displaystyle  \sum_{n: |z|/|z_n| > 1/2} \log \frac{1}{|1-z/z_n|} \leq O_{f,\rho,\varepsilon}( (1+|z|)^{\rho+\varepsilon} )

for {z} in a set of concentric circles {\{ |z| = R_k\}} with {2^k \leq R_k < 2^{k+1}}.

Given the set of {z} we are working with, it is natural to introduce the radial variable {r := |z|}. From the triangle inequality one has {|1-z/z_n| \geq |1-r/|z_n||}, so it will suffice to show that

\displaystyle  \sum_{n: r/|z_n| > 1/2} \log \frac{1}{|1-r/|z_n||} \leq O_{f,\rho,\varepsilon}( 2^{(\rho+\varepsilon)k} )

for at least one radius {r \in [2^k, 2^{k+1})} for each natural number {k}. Note that we cannot just pick any radius {r} here, because if {r} happens to be too close to one of the {|z_n|} then the term {\log \frac{1}{|1-r/|z_n||}} will become unbounded. But we can avoid this by the strategy of the probabilistic method: we just choose {r} randomly in the interval {[2^k, 2^{k+1})}. As long we can establish the average bound

\displaystyle  \frac{1}{2^k} \int_{2^k}^{2^{k+1}} \sum_{n: r/|z_n| > 1/2} \log \frac{1}{|1-r/|z_n||}\ dr \leq O_{f,\rho,\varepsilon}( 2^{(\rho+\varepsilon)k} )

we can use the pigeonhole principle to find one good radius {r} in the desired range, which is all we need.

The point is that this averaging can take advantage of the mild nature of the logarithmic singularity. Indeed a routine computation shows that

\displaystyle  \frac{1}{2^k} \int_{2^k}^{2^{k+1}} 1_{r/R > 1/2} \log \frac{1}{|1-r/R|}\ dr

vanishes unless {R \leq 2^{k+2}} and is bounded by {O(1)} otherwise, so by Fubini’s theorem the left-hand side is bounded by

\displaystyle  O( \sum_{n: |z_n| \leq 2^{k+2}} 1 )

and the claim now follows from Proposition 8. This concludes the proof of the Hadamard factorisation theorem.

Exercise 23 (Converse to Hadamard factorisation) Let {\rho \geq 0}, let {m} be a natural number, and let {z_1,z_2,\dots} be a finite or infinite sequence of non-zero complex numbers such that {\sum_{n=1}^\infty \frac{1}{|z_n|^{\rho+\varepsilon}} < \infty} for every {\varepsilon>0}. Let {d := \lfloor \rho\rfloor}. Show that for every polynomial {g} of degree at most {d}, the function {f} defined by (19) is an entire function of order at most {\rho}, with a zero of order {m} at the origin, zeroes at each {z_j} of order equal to the number of times {z_j} occurs in the sequence, and no other zeroes. Thus we see that we have a one-to-one correspondence between non-trivial entire functions of order at most {\rho} ( up to multiplication by {e^{g(z)}} factors for {g} a polynomial of degree at most {d}) and zeroes {z_n} obeying a certain growth condition.

As an illustration of the Hadamard factorisation theorem, we apply it to the entire function {\sin(z)}. Since

\displaystyle  \sin(z) = O( |e^z| + |e^{-z}| ) = O( \exp( |z| ) )

we see that {\sin} is of order at most {1} (indeed it is not difficult to show that its order is exactly {1}). Also, its zeroes are the integer multiples {\pi n} of {\pi}, with {n \in {\bf Z}}. The Hadamard factorisation theorem then tells us that we have the product expansion

\displaystyle  \sin(z) = e^{g(z)} z \prod_{n \in {\bf Z} \backslash \{0\}} E_1(\frac{z}{\pi n})

for some polynomial {g} of degree at most {1}. Writing {E_1(\frac{z}{\pi n}) = e^{z/\pi n} (1 - \frac{z}{\pi n})} we can group together the {n} and {-n} terms in the absolutely convergent product to get

\displaystyle  E_1(\frac{z}{\pi n}) E_1(\frac{z}{\pi (-n)}) = (1 - \frac{z^2}{\pi^2 n^2})

so the Hadamard factorisation can also be written in the form

\displaystyle  \sin(z) = e^{g(z)} z \prod_{n=1}^\infty (1 - \frac{z^2}{\pi^2 n^2}).

But what is {g(z)}? Dividing by {z} and taking a suitable branch {\tilde \log} of the logarithm of {\frac{\sin z}{z}} we see that

\displaystyle  \tilde \log \frac{\sin z}{z} = g(z) + \sum_{n=1}^\infty \mathrm{Log} (1 - \frac{z^2}{\pi^2 n^2}) \ \ \ \ \ (22)

for {z} sufficiently close to zero (removing the singularity of {\frac{\sin z}{z}} at the origin). By Taylor expansion we have

\displaystyle  \frac{\sin z}{z} = 1 - \frac{z^2}{3!} + \dots


\displaystyle  \mathrm{Log} (1 - \frac{z^2}{\pi^2 n^2}) = - \frac{z^2}{\pi^2 n^2} + \dots

for {z} close to {1}, thus

\displaystyle  \tilde \log \frac{\sin z}{z} = 2k \pi i - \frac{z^2}{3!} + \dots

for some integer {k}. Since {g} is linear, we conclude on comparing coefficients that {g} must in fact just be a constant {2k \pi i}, and we can in fact normalise {k=0} since shifting {g} by an integer multiple of {2\pi i} does not affect {e^{g(z)}}. We conclude the Euler sine product formula

\displaystyle  \sin(z) = z \prod_{n=1}^\infty (1 - \frac{z^2}{\pi^2 n^2}) \ \ \ \ \ (23)

(first conjectued by Euler in 1734). Inspecting the {z^2} coefficients of (22), we also see that

\displaystyle  -\frac{1}{3!} = \sum_{n=1}^\infty -\frac{1}{\pi^2 n^2}

which rearranges to yield Euler’s famous formula

\displaystyle  \sum_{n=1}^\infty \frac{1}{n^2} = \frac{\pi^2}{6} \ \ \ \ \ (24)

that solves the Basel problem. Observe that by inspecting higher coefficients {z^{2k}} of the Taylor series one more generally obtains identities of the form

\displaystyle  \sum_{n=1}^\infty \frac{1}{n^{2k}} = b_{2k} \pi^{2k}

for all positive integers {k} and some rational numbers {b_{2k}} (which are essentially Bernoulli numbers). Applying (23) to {z=\pi/2} and rearranging one also gets the famous Wallis product

\displaystyle  \frac{\pi}{2} = \prod_{n=1}^\infty (1 - \frac{1}{4n^2})^{-1}.

Hadamard’s theorem also tells us that any other entire function of order at most {1} that has simple zeroes at the integer multiples of {\pi}, and no other zeroes, must take the form {e^{az+b} \sin(z)} for some complex numbers {a,b}. Thus the sine function is almost completely determined by its set of zeroes, together with the fact that it is an entire function of order {1}.

Exercise 24 Show that

\displaystyle  \sum_{n \in {\bf Z}} \frac{1}{z^2 - n^2} = \frac{\pi \cot(\pi z)}{z}

for any complex number {z} that is not an integer. Use this to give an alternate proof of (24).

— 4. The Gamma function —

As we saw in the previous section (and after applying a simple change of variables), the only entire functions of order {1} that have simple zeroes at the integers (and nowhere else) are of the form {e^{az+b} \sin(\pi z)}. It is natural to ask what happens if one replaces the integers by the natural numbers {\{0, 1, 2, \dots\}}; one could think of such functions as being in some sense “half” of the function {\sin(\pi z)}. Actually, it is traditional to normalise the problem a different way, and ask what entire functions of order {1} have zeroes at the non-positive integers {0, -1, -2, -3, \dots}; it is also traditional to refer to the complex variable in this problem by {s} instead of {z}. By the Hadamard factorisation theorem, such functions must take the form

\displaystyle  f(s) = s e^{as+b} \prod_{n=1}^\infty E_1(-s/n)

\displaystyle  =s e^{as+b} \prod_{n=1}^\infty e^{-s/n} (1+\frac{s}{n})

for some complex numbers {a,b}; conversely, Exercise 23 tells us that every function of this form is entire of order at most {1}, with simple zeroes at {0,-1,-2,\dots}. We are free to select the constants {a,b} as we please to produce a function {f} of this class. It is traditional to normalise {b=0}; for the most natural normalisation of {a}, see below.

What properties would such functions have? The zero set {0,-1,-2,\dots} are nearly invariant with respect to the shift {s \mapsto s+1}, so one expects {f(s)} and {f(s+1)} to be related. Indeed we have

\displaystyle  f(s+1) = (s+1) e^{as+a} \prod_{n=1}^\infty e^{-(s+1)/n} (1+\frac{s+1}{n})

\displaystyle  = (s+1) e^{as+a} \prod_{n=2}^\infty e^{-(s+1)/(n-1)} (1+\frac{s+1}{n-1})

\displaystyle  = (s+1) e^{as+a} \prod_{n=2}^\infty e^{-s/(n-1)} (1+\frac{s}{n}) (1+\frac{1}{n-1}) e^{-1/(n-1)}


\displaystyle  f(s) = s e^{as} e^{-s} (1+s) \prod_{n=2}^\infty e^{-s/n} (1+\frac{s}{n})

so we have (using the telescoping series {\sum_{n=2}^\infty \frac{1}{n-1}-\frac{1}{n} = 1})

\displaystyle  s f(s+1) = f(s) e^a \prod_{n=2}^\infty (1+\frac{1}{n-1}) e^{-1/(n-1)}

\displaystyle  f(s) e^a \prod_{n=1}^\infty (1+\frac{1}{n}) e^{-1/n}.

It is then natural to normalise {a} to be the real number {\gamma} for which

\displaystyle  e^\gamma \prod_{n=1}^\infty (1+\frac{1}{n}) e^{-1/n} = 1.

This number is known as the Euler-Mascheroni constant and is approximately equal to {0.577\dots}. Taking logarithms, we can write it in a more familiar form as

\displaystyle  \gamma = -\lim_{N \rightarrow \infty} \sum_{N=1}^\infty \log (1+\frac{1}{n}) e^{-1/n}

\displaystyle  = \lim_{N \rightarrow \infty} 1 + \frac{1}{2} + \dots + \frac{1}{N} - \log N.

With this choice for {a}, {f(s)} is then an entire function of order one that obeys the functional equation {s f(s+1) = f(s)} for all {s} and has simple zeroes at the non-positive integers and nowhere else; this uniquely specifies {f} up to constants. The reciprocal

\displaystyle  \Gamma(s) := e^{-\gamma s} s^{-1} \prod_{n=1}^\infty e^{s/n} (1+\frac{s}{n})^{-1}, \ \ \ \ \ (25)

known as the (Weierstrass definition of the) Gamma function, is then a meromorphic function with simple poles at the non-positive integers and nowhere else that obeys the functional equation

\displaystyle  \Gamma(s+1) = s \Gamma(s) \ \ \ \ \ (26)

(for {z} away from the poles {0,-1,-2,\dots}) and is the reciprocal of an entire function of order {1} (in particular, it has no zeroes). This uniquely defines {\Gamma} up to constants.

Note that as {s \rightarrow 0}, the function {e^{-\gamma s} \prod_{n=1}^\infty e^{s/n} (1+\frac{s}{n})^{-1}} converges to zero, hence {\Gamma} has a residue of {1} at the origin {s=0}; equivalently, by (26) we have

\displaystyle  \Gamma(1)=1. \ \ \ \ \ (27)

Thus {\Gamma} is the unique reciprocal of an entire function of order {1} with simple poles at the non-positive integers and nowhere else that obeys (26), (27).

From (27), (26) and induction we see that

\displaystyle  \Gamma(n+1) = n!

for all natural numbers {n=0,1,2,\dots}. Thus the Gamma function can be viewed as a complex extension of the factorial function (shifted by a unit). From the definition we also see that

\displaystyle  \Gamma(\overline{s}) = \overline{\Gamma(s)} \ \ \ \ \ (28)

for all {s} outside of the poles of {\Gamma}.

One can readily establish several more identities and asymptotics for {\Gamma}:

Exercise 25 (Euler reflection formula) Show that

\displaystyle  \Gamma(s) \Gamma(1-s) = \frac{\pi}{\sin(\pi s)}

whenever {s} is not an integer. (Hint: use the Hadamard factorisation theorem.) Conclude in particular that {\Gamma(1/2) = \sqrt{\pi}}.

Exercise 26 (Digamma function) Define the digamma function to be the logarithmic derivative {\frac{\Gamma'}{\Gamma}} of the Gamma function. Show that the digamma function is a meromorphic function, with simple poles of residue {-1} at the non-positive integers {0, -1, -2, \dots} and no other poles, and that

\displaystyle  \frac{\Gamma'}{\Gamma}(s) = \lim_{N \rightarrow \infty} \log N - \sum_{n=0}^N \frac{1}{s+n}

\displaystyle  = -\gamma + \sum_{\rho = 0, -1, -2, \dots} (\frac{1}{1-\rho} - \frac{1}{s-\rho})

for {s} outside of the poles of {\frac{\Gamma'}{\Gamma}}, with the sum being absolutely convergent. Establish the reflection formula

\displaystyle  \frac{\Gamma'}{\Gamma}(1-s) - \frac{\Gamma'}{\Gamma}(s) = \pi \cot(\pi s) \ \ \ \ \ (29)

or equivalently

\displaystyle  \pi \cot(\pi s) = \sum_{\rho \in {\bf Z}} (\frac{1}{s-\rho} - \frac{1}{\rho})

for non-integer {s}.

Exercise 27 (Euler product formula) Show that for any {s \neq 0,-1,-2,\dots}, one has

\displaystyle  \Gamma(s) = \lim_{n \rightarrow \infty} \frac{n! n^s}{s(s+1) \dots (s+n)} = \frac{1}{s} \prod_n \frac{(1+1/n)^s}{1+s/n}.

Exercise 28 Let {s} be a complex number with {\mathrm{Re}(s) > 0}.
  • (i) For any positive integer {n}, show that

    \displaystyle \frac{n! n^s}{s(s+1) \dots (s+n)} = \int_0^n t^s (1-\frac{t}{n})^n\ \frac{dt}{t}.

  • (ii) (Bernoulli definition of Gamma function) Show that

    \displaystyle  \Gamma(s) = \int_0^\infty t^s e^{-t}\ \frac{dt}{t}.

    What happens if the hypothesis {\mathrm{Re} s > 0} is dropped?
  • (iii) (Beta function identity) Show that

    \displaystyle  \int_0^1 t^{s_1-1} (1-t)^{s_2-1}\ dt = \frac{\Gamma(s_1+1) \Gamma(s_2+1)}{\Gamma(s_1+s_2+1)}

    whenever {s_1,s_2} are complex numbers with {\mathrm{Re}(s_1), \mathrm{Re}(s_2) > 0}. (Hint: evaluate {\int_0^\infty \int_0^\infty t_1^{s_1-1} t_2^{s_2-1} e^{-t_1-t_2}\ dt_1 dt_2} in two different ways.)

We remark that the Bernoulli definition of the {\Gamma} function is often the first definition of the Gamma function introduced in texts (see for instance this previous blog post for an arrangement of the material here based on this definition). It is because of the identities (ii), (iii) that the Gamma function often frequently arises when evaluating many other integrals involving polynomials or exponentials, and in particular is a frequent presence in identities involving standard integral transforms, such as the Fourier transform, Laplace transform, or Mellin transform.

Exercise 29
  • (i) (Quantitative form of integral test) Show that

    \displaystyle  \sum_{y \leq n \leq x} f(n) = \int_y^x f(t)\ dt + O( \int_x^y |f'(t)|\ dt + |f(y)| )

    for any real {y \leq x} and any continuously differentiable functions {f: [y,x] \rightarrow {\bf C}}.
  • (ii) Using (i) and Exercise 26, obtain the asymptotic real axis), where {\hbox{Arg}} and {\hbox{Log}} are the standard branches of the argument and logarithm respectively (with branch cut on the negative real axis). From Exercise 26, we obtain the asymptotic

    \displaystyle  \frac{\Gamma'}{\Gamma}(s) = \hbox{Log}(s) + O_\varepsilon( \frac{1}{|s|} )

    whenever {\varepsilon>0} and {s} is in the sector {\hbox{Arg}(z) < \pi - \varepsilon} (that is, {s} makes at least a fixed angle with the negative real axis), where {\hbox{Arg}} and {\hbox{Log}} are the standard branches of the argument and logarithm respectively (with branch cut on the negative real axis).
  • (iii) (Trapezoid rule) Let {y < x} be distinct integers, and let {f: [y,x] \rightarrow {\bf C}} be a continuously twice differentiable function. Show that

    \displaystyle  \sum_{y \leq n \leq x} f(n) = \int_y^x f(t)\ dt + \frac{1}{2} f(x) + \frac{1}{2} f(y) + O( \int_x^y |f''(t)|\ dt ).

    (Hint: first establish the case when {x=y+1}.)
  • (iv) Refine the asymptotics in (ii) to

    \displaystyle  \frac{\Gamma'}{\Gamma}(s) = \hbox{Log}(s) - \frac{1}{2s} + O_\varepsilon( \frac{1}{|s|^2} ).

  • (v) (Stirling approximation) In the sector used in (ii), (iv), establish the Stirling approximation

    \displaystyle  \Gamma(s) = \exp( (s -\frac{1}{2}) \hbox{Log}(s) - s + \frac{1}{2} \log 2\pi + O_\varepsilon( \frac{1}{|s|} ) ).

  • (vi) Establish the size bound

    \displaystyle  |\Gamma(\sigma+it)| \asymp e^{-\pi|t|/2} |t|^{\sigma-\frac{1}{2}} \ \ \ \ \ (30)

    whenever {\sigma,t} are real numbers with {\sigma = O(1)} and {|t| \gtrsim 1}.

Exercise 30
  • (i) (Legendre duplication formula) Show that

    \displaystyle  \Gamma(\frac{s}{2}) \Gamma(\frac{s+1}{2}) = \sqrt{\pi} 2^{1-s} \Gamma(s)

    whenever {s} is not a pole of {\Gamma}.
  • (ii) (Gauss multiplication theorem) For any natural number {k}, establish the multiplication theorem

    \displaystyle  \Gamma(\frac{s}{k}) \Gamma(\frac{s+1}{k}) \dots \Gamma(\frac{s+k-1}{k}) = (2\pi)^{(k-1)/2} k^{1/2 - s} \Gamma(s)

    whenever {s} is not a pole of {\Gamma}.

Exercise 31 Show that {\Gamma'(1) = -\gamma}.

Exercise 32 (Bohr-Mollerup theorem) Establish the Bohr-Mollerup theorem: the function {\Gamma: (0,+\infty) \rightarrow (0,+\infty)}, which is the Gamma function restricted to the positive reals, is the unique log-convex function {f :(0,+\infty) \rightarrow (0,+\infty)} on the positive reals with {f(1)=1} and {sf(s) = f(s+1)} for all {s>0}.