In mathematics, and particularly in the field of complex analysis, the Weierstrass factorization theorem asserts that entire functions can be represented by a product involving their zeroes. In addition, every sequence tending to infinity has an associated entire function with zeroes at precisely the points of that sequence. The theorem is named after Karl Weierstrass.
A second form of the theorem extends to meromorphic functions and allows one to consider a given meromorphic function as a product of three factors: terms depending on the function's poles and zeroes, and an associated non-zero holomorphic function.
The consequences of the fundamental theorem of algebra are twofold. Firstly, any finite sequence { c n } in the complex plane has an associated polynomial p ( z ) that has zeroes precisely at the points of that sequence, p ( z ) = ∏ n ( z − c n ) .
Secondly, any polynomial function p ( z ) in the complex plane has a factorization p ( z ) = a ∏ n ( z − c n ) , where a is a non-zero constant and cn are the zeroes of p.
The two forms of the Weierstrass factorization theorem can be thought of as extensions of the above to entire functions. The necessity of extra machinery is demonstrated when one considers the product ∏ n ( z − c n ) if the sequence { c n } is not finite. It can never define an entire function, because the infinite product does not converge. Thus one cannot, in general, define an entire function from a sequence of prescribed zeroes or represent an entire function by its zeroes using the expressions yielded by the fundamental theorem of algebra.
A necessary condition for convergence of the infinite product in question is that for each z, the factors ( z − c n ) must approach 1 as n → ∞ . So it stands to reason that one should seek a function that could be 0 at a prescribed point, yet remain near 1 when not at that point and furthermore introduce no more zeroes than those prescribed. Weierstrass' elementary factors have these properties and serve the same purpose as the factors ( z − c n ) above.
These are also referred to as primary factors.
For n ∈ N , define the elementary factors:
E n ( z ) = { ( 1 − z ) if n = 0 , ( 1 − z ) exp ( z 1 1 + z 2 2 + ⋯ + z n n ) otherwise . In comparison, note that for | z | < 1, it is true that
( 1 − z ) = exp ( ln ( 1 − z ) ) = exp ( − z 1 1 − z 2 2 − z 3 3 − ⋯ ) .
The utility of the elementary factors En(z) lies in the following lemma:
Lemma (15.8, Rudin) for | z | ≤ 1, n ∈ N
| 1 − E n ( z ) | ≤ | z | n + 1 . Sometimes called the Weierstrass theorem.
Let { a n } be a sequence of non-zero complex numbers such that | a n | → ∞ . If { p n } is any sequence of integers such that for all r > 0 ,
∑ n = 1 ∞ ( r / | a n | ) 1 + p n < ∞ , then the function
f ( z ) = ∏ n = 1 ∞ E p n ( z / a n ) is entire with zeros only at points a n . If a number z 0 occurs in the sequence { a n } exactly m times, then function f has a zero at z = z 0 of multiplicity m.
Note that the sequence { p n } in the statement of the theorem always exists. For example we could always take p n = n and have the convergence. Such a sequence is not unique: changing it at finite number of positions, or taking another sequence p′n ≥ pn, will not break the convergence.The theorem generalizes to the following: sequences in open subsets (and hence regions) of the Riemann sphere have associated functions that are holomorphic in those subsets and have zeroes at the points of the sequence.Note also that the case given by the fundamental theorem of algebra is incorporated here. If the sequence { a n } is finite then we can take p n = 0 and obtain: f ( z ) = c ∏ n ( z − a n ) .Sometimes called the Weierstrass product/factor theorem.
Let ƒ be an entire function, and let { a n } be the non-zero zeros of ƒ repeated according to multiplicity; suppose also that ƒ has a zero at z = 0 of order m ≥ 0 (a zero of order m = 0 at z = 0 means ƒ(0) ≠ 0). Then there exists an entire function g and a sequence of integers { p n } such that
f ( z ) = z m e g ( z ) ∏ n = 1 ∞ E p n ( z a n ) . sin π z = π z ∏ n ≠ 0 ( 1 − z n ) e z / n = π z ∏ n = 1 ∞ ( 1 − z 2 n 2 ) cos π z = ∏ q ∈ Z , q odd ( 1 − 2 z q ) e 2 z / q = ∏ n = 0 ∞ ( 1 − 4 z 2 ( 2 n + 1 ) 2 ) If ƒ is an entire function of finite order ρ then it admits a factorization
f ( z ) = z m e g ( z ) ∏ n = 1 ∞ E p ( z a n ) where g(z) is a polynomial of degree q, q ≤ ρ and p = [ρ] .
