Notes on Complex Analysis
Export PDFGitHub

§14.2.2 The Factorization of Transcendental Meromorphic Functions

14.2.2 The Factorization of Transcendental Meromorphic Functions

We now give a meromorphic analog of the Hadamard Factorization Theorem:

Theorem 14.2.2.1.

Let 𝑓:ℂ→ℂ̂ be non-constant and meromorphic of finite order 𝜌 such that 𝑓(0)≠0,∞. If {𝑎𝑛}𝑛=1∞ and {𝑏𝑛}𝑛=1∞ are its zeros and poles in ℂ∗ listed in order of non-decreasing moduli, counting multiplicities and zeros, then the products

𝑃1(𝑧)=∏𝑛=1∞𝐸𝑝(𝑧𝑎𝑛),𝑃2(𝑧)=∏𝑛=1∞𝐸𝑞(𝑧𝑏𝑛)
locally uniformly converge in ℂ for some 𝑝,𝑞≤⌊𝜌⌋. Then 𝑓(𝑧)=e𝜑(𝑧)𝑃1(𝑧)/𝑃2(𝑧), where 𝜑 is a polynomial of degree ≤𝜌.
Proof.

By Theorem 14.2.1.5Theorem 14.2.1.5Theorem 14.2.1.5, letting 𝑞=⌊𝜌⌋ gives that the two given products converge locally uniformly and the corresponding summation of exponent 𝑞+1 converge. Define 𝑔 to be the analytic continuation across all removable singularities of 𝑓⋅𝑃2 such that 𝑔 is entire and vanishes at each {𝑎𝑛}. Observe that

𝑇(𝑟,𝑔)≤𝑇(𝑟,𝑓)+𝑇(𝑟,𝑃2),𝑇(𝑟,𝑓)=𝒪︀(𝑟𝜌+𝜀)

by Proposition 14.2.5Proposition 14.2.5Proposition 14.2.5 and Proposition 14.2.1.4Proposition 14.2.1.4Proposition 14.2.1.4. For sufficiently large 𝑟,

𝑇(𝑟,𝑃2)=𝑚(𝑟,𝑃2)≤log𝑀(𝑟,𝑃2).

Define

𝑃2(𝑧)=∏|𝑏𝑛|≤2|𝑧|𝐸𝑞(𝑧𝑏𝑛)⋅∏|𝑏𝑛|>2|𝑧|𝐸𝑞(𝑧𝑏𝑛)=𝑃2≤(𝑧)⋅𝑃2>(𝑧).

Since |𝑧/𝑏𝑛|<1/2 for 𝑃2>,

|Log𝐸𝑞(𝑧𝑏𝑛)|≤∑𝑘>𝑞∞1𝑘|𝑧𝑏𝑛|𝑞+1≤|𝑧𝑏𝑛|𝑞+1∑𝑘>𝑞∞1𝑘|12|𝑘−𝑞−1≤𝑐𝑟𝑞+1|𝑏𝑛|−𝑞−1,

where 𝑐 is a constant dependent only on 𝑞 and 𝑟=|𝑧| (see (4.4.3.4)(4.4.3.4)(4.4.3.4)). Since for sufficiently small 𝜀>0, 𝑞+1>𝜌+𝜀,

log|𝑃2>(𝑧)|≤|Log𝑃2>(𝑧)|≤∑|𝑏𝑛|>2𝑟|Log𝐸𝑞(𝑧𝑏𝑛)|≤𝑐𝑟𝑞+1∑|𝑏𝑛|>2𝑟1|𝑏𝑛|𝑞+1≤𝑐𝑟𝜌+𝜀∑|𝑏𝑛|>2𝑟𝑟𝑞+1−(𝜌+𝜀)|𝑏𝑛|𝜌+𝜀|𝑏𝑛|𝑞+1−(𝜌+𝜀)≤2𝜌+𝜀−𝑞−1𝑐𝑟𝜌+𝜀∑|𝑏𝑛|>2𝑟|𝑏𝑛|−𝜌−𝜀=𝒪︀(𝑟𝜌+𝜀)

(the summation of converges by Theorem 14.2.1.5Theorem 14.2.1.5Theorem 14.2.1.5). Assume now that |𝑏𝑛|≤2𝑟, or 2|𝑧/𝑏𝑛|≥1. Then,

log|𝐸𝑞(𝑧𝑏𝑛)|=log|1−𝑧𝑏𝑛|+ℜ𝔢(∑𝑘=1𝑞1𝑘𝑧𝑘𝑏𝑛𝑘)≤log(1+|𝑧𝑏𝑛|)+𝑐|𝑧𝑏𝑛|𝑞

for some 𝑐 such that ℜ𝔢(∑𝑘=1𝑞1𝑘𝑤𝑘)≤𝑐|𝑤|𝑞 for all |𝑤|≥1/2, which depends only on 𝑞. First assume that 𝑞≥1, and it then follows that

log|𝑃2≤(𝑧)|≤∑|𝑏𝑛|≤2𝑟[𝑐|𝑟𝑏𝑛|𝑞+log(1+|𝑟𝑏𝑛|)]≤∑|𝑏𝑛|≤2𝑟[𝑐|𝑟𝑏𝑛|𝑞+|𝑟𝑏𝑛|]≤∑|𝑏𝑛|≤2𝑟(𝑐+2𝑞−1)|𝑧𝑏𝑛|𝑞=∑|𝑏𝑛|≤2𝑟𝑐′𝑟𝜌+𝜀|𝑏𝑛|𝜌+𝜀(|𝑏𝑛|𝑟)𝜌+𝜀−𝑞≤∑|𝑏𝑛|≤2𝑟2𝜌+𝜀−𝑞𝑐′𝑟𝜌+𝜀|𝑏𝑛|𝜌+𝜀=𝒪︀(𝑟𝜌+𝜀).

It follows that

𝑇(𝑟,𝑔)≤log|𝑃2(𝑧)|=𝒪︀(𝑟𝜌+𝜀),

and thus 𝑔 is of order 𝜌′≤𝜌. For any 𝜀, there is some 𝑐 such that log(1+|𝑤|)≤𝑐|𝑤|𝜀; thus for 𝑞=0, the assertion is direct from Proposition 14.2.1.4Proposition 14.2.1.4Proposition 14.2.1.4:

log|𝐸𝑞(𝑧𝑏𝑛)|≤log(1+|𝑧𝑏𝑛|)≤𝑐𝑟𝜀|𝑏𝑛|𝜀≤𝑐𝑟𝜀|𝑏1|𝜀log|𝑃2≤|≤𝑛(2𝑟,0,𝑓)𝑟𝜀|𝑏1|𝜀=𝒪︀(𝑟𝜌+2𝜀).
Similar logic then derives that 𝑔 is of order ≤𝜌. There then exists an integer 𝑝≤𝜌′ such that 𝑃1 converges and 𝑔(𝑧)=e𝜑(𝑧)𝑃1(𝑧) has the property that 𝜑 is a polynomial of degree 𝑔≤𝜌′ by the Hadamard Factorization Theorem (Theorem 4.4.5.3Theorem 4.4.5.3Theorem 4.4.5.3) for entire functions. Writing 𝑓=𝑔/𝑃2 then yields the desired representation. ⁠□