It is clear that any finite set { c n } {\displaystyle \{c_{n}\}} of points in the complex plane has an associated polynomial p ( z ) = ∏ n ( z − c n ) {\textstyle p(z)=\prod _{n}(z-c_{n})} whose zeroes are precisely at the points of that set. The converse is a consequence of the fundamental theorem of algebra: any polynomial function p ( z ) {\displaystyle p(z)} in the complex plane has a factorization p ( z ) = a ∏ n ( z − c n ) , {\textstyle p(z)=a\prod _{n}(z-c_{n}),} where a is a non-zero constant and { c n } {\displaystyle \{c_{n}\}} is the set of zeroes of p ( z ) {\displaystyle p(z)} .1
The two forms of the Weierstrass factorization theorem can be thought of as extensions of the above to entire functions. The necessity of additional terms in the product is demonstrated when one considers ∏ n ( z − c n ) {\textstyle \prod _{n}(z-c_{n})} where the sequence { c n } {\displaystyle \{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. Instead, the theorem replaces these with other factors.
A necessary condition for convergence of the infinite product in question is that for each z {\displaystyle z} , the factors replacing ( z − c n ) {\displaystyle (z-c_{n})} must approach 1 as n → ∞ {\displaystyle n\to \infty } . So it stands to reason that one should seek factor functions 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 ) {\displaystyle (z-c_{n})} above.
Consider the functions of the form exp ( − z n + 1 n + 1 ) {\textstyle \exp \left(-{\tfrac {z^{n+1}}{n+1}}\right)} for n ∈ N {\displaystyle n\in \mathbb {N} } . At z = 0 {\displaystyle z=0} , they evaluate to 1 {\displaystyle 1} and have a flat slope at order up to n {\displaystyle n} . Right after z = 1 {\displaystyle z=1} , they sharply fall to some small positive value. In contrast, consider the function 1 − z {\displaystyle 1-z} which has no flat slope but, at z = 1 {\displaystyle z=1} , evaluates to exactly zero. Also note that for |z| < 1,
The elementary factors,2 also referred to as primary factors,3 are functions that combine the properties of zero slope and zero value (see graphic):
For |z| < 1 and n > 0 {\displaystyle n>0} , one may express it as E n ( z ) = exp ( − z n + 1 n + 1 ∑ k = 0 ∞ z k 1 + k / ( n + 1 ) ) {\textstyle E_{n}(z)=\exp \left(-{\tfrac {z^{n+1}}{n+1}}\sum _{k=0}^{\infty }{\tfrac {z^{k}}{1+k/(n+1)}}\right)} and one can read off how those properties are enforced.
The utility of the elementary factors E n ( z ) {\textstyle E_{n}(z)} lies in the following lemma:4
Lemma (15.8, Rudin) for |z| ≤ 1, n ∈ N {\displaystyle n\in \mathbb {N} }
Let { a n } {\displaystyle \{a_{n}\}} be a sequence of non-zero complex numbers such that | a n | → ∞ {\displaystyle |a_{n}|\to \infty } . If { p n } {\displaystyle \{p_{n}\}} is any sequence of nonnegative integers such that for all r > 0 {\displaystyle r>0} ,
then the function
is entire with zeros only at points a n {\displaystyle a_{n}} .5 If a number z 0 {\displaystyle z_{0}} occurs in the sequence { a n } {\displaystyle \{a_{n}\}} exactly m times, then the function E has a zero at z = z 0 {\displaystyle z=z_{0}} of multiplicity m.
Let ƒ be an entire function, and let { a n } {\displaystyle \{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.7 Then there exists an entire function g and a sequence of integers { p n } {\displaystyle \{p_{n}\}} such that
The case given by the fundamental theorem of algebra is incorporated here. If the sequence { a n } {\displaystyle \{a_{n}\}} is finite then we can take p n = 0 {\displaystyle p_{n}=0} , m = 0 {\displaystyle m=0} and e g ( z ) = c {\displaystyle e^{g(z)}=c} to obtain f ( z ) = c ∏ n ( z − a n ) {\displaystyle \,f(z)=c\,{\displaystyle \prod }_{n}(z-a_{n})} .
The trigonometric functions sine and cosine have the factorizations sin π z = π z ∏ n ≠ 0 ( 1 − z n ) e z / n = π z ∏ n = 1 ∞ ( 1 − ( z n ) 2 ) {\displaystyle \sin \pi z=\pi z\prod _{n\neq 0}\left(1-{\frac {z}{n}}\right)e^{z/n}=\pi z\prod _{n=1}^{\infty }\left(1-\left({\frac {z}{n}}\right)^{2}\right)} cos π z = ∏ q ∈ Z , q odd ( 1 − 2 z q ) e 2 z / q = ∏ n = 0 ∞ ( 1 − ( z n + 1 2 ) 2 ) {\displaystyle \cos \pi z=\prod _{q\in \mathbb {Z} ,\,q\;{\text{odd}}}\left(1-{\frac {2z}{q}}\right)e^{2z/q}=\prod _{n=0}^{\infty }\left(1-\left({\frac {z}{n+{\tfrac {1}{2}}}}\right)^{2}\right)} while the gamma function Γ {\displaystyle \Gamma } has factorization 1 Γ ( z ) = e γ z z ∏ n = 1 ∞ ( 1 + z n ) e − z / n , {\displaystyle {\frac {1}{\Gamma (z)}}=e^{\gamma z}z\prod _{n=1}^{\infty }\left(1+{\frac {z}{n}}\right)e^{-z/n},} where γ {\displaystyle \gamma } is the Euler–Mascheroni constant. The cosine identity can be seen as special case of 1 Γ ( s − z ) Γ ( s + z ) = 1 Γ ( s ) 2 ∏ n = 0 ∞ ( 1 − ( z n + s ) 2 ) {\displaystyle {\frac {1}{\Gamma (s-z)\Gamma (s+z)}}={\frac {1}{\Gamma (s)^{2}}}\prod _{n=0}^{\infty }\left(1-\left({\frac {z}{n+s}}\right)^{2}\right)} for s = 1 2 {\displaystyle s={\tfrac {1}{2}}} .
Main article: Hadamard factorization theorem
A special case of the Weierstraß factorization theorem occurs for entire functions of finite order. In this case the p n {\displaystyle p_{n}} can be taken independent of n {\displaystyle n} and the function g ( z ) {\displaystyle g(z)} is a polynomial. Thus f ( z ) = z m e P ( z ) ∏ k = 1 ∞ E p ( z / a k ) {\displaystyle f(z)=z^{m}e^{P(z)}\prod _{k=1}^{\infty }E_{p}(z/a_{k})} where a k {\displaystyle a_{k}} are those roots of f {\displaystyle f} that are not zero ( a k ≠ 0 {\displaystyle a_{k}\neq 0} ), m {\displaystyle m} is the order of the zero of f {\displaystyle f} at z = 0 {\displaystyle z=0} (the case m = 0 {\displaystyle m=0} being taken to mean f ( 0 ) ≠ 0 {\displaystyle f(0)\neq 0} ), P {\displaystyle P} a polynomial (whose degree we shall call q {\displaystyle q} ), and p {\displaystyle p} is the smallest non-negative integer such that the series ∑ n = 1 ∞ 1 | a n | p + 1 {\displaystyle \sum _{n=1}^{\infty }{\frac {1}{|a_{n}|^{p+1}}}} converges. This is called Hadamard's canonical representation.9 The non-negative integer g = max { p , q } {\displaystyle g=\max\{p,q\}} is called the genus of the entire function f {\displaystyle f} . The order ρ {\displaystyle \rho } of f {\displaystyle f} satisfies g ≤ ρ ≤ g + 1 {\displaystyle g\leq \rho \leq g+1} In other words: If the order ρ {\displaystyle \rho } is not an integer, then g = [ ρ ] {\displaystyle g=[\rho ]} is the integer part of ρ {\displaystyle \rho } . If the order is a positive integer, then there are two possibilities: g = ρ − 1 {\displaystyle g=\rho -1} or g = ρ {\displaystyle g=\rho } .
For example, sin {\displaystyle \sin } , cos {\displaystyle \cos } and exp {\displaystyle \exp } are entire functions of genus g = ρ = 1 {\displaystyle g=\rho =1} .
Knopp, K. (1996), "Weierstrass's Factor-Theorem", Theory of Functions, Part II, New York: Dover, pp. 1–7. ↩
Rudin, W. (1987), Real and Complex Analysis (PDF) (3rd ed.), Boston: McGraw Hill, pp. 299–304, ISBN 0-07-054234-1, OCLC 13093736 0-07-054234-1 ↩
Boas, R. P. (1954), Entire Functions, New York: Academic Press Inc., ISBN 0-8218-4505-5, OCLC 6487790 {{citation}}: ISBN / Date incompatibility (help), chapter 2. 0-8218-4505-5 ↩
A zero of order m = 0 at z = 0 is taken to mean ƒ(0) ≠ 0 — that is, f {\displaystyle f} does not have a zero at 0 {\displaystyle 0} . ↩
Conway, J. B. (1995), Functions of One Complex Variable I, 2nd ed., springer.com: Springer, ISBN 0-387-90328-3 0-387-90328-3 ↩