Weierstrass factorization theorem
This article's tone or style may not reflect the encyclopedic tone used on Wikipedia. (June 2014) (Learn how and when to remove this template message)
In mathematics, and particularly in the field of complex analysis, the Weierstrass factorization theorem asserts that every entire function can be represented as a (possibly infinite) product involving its zeroes. 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.
The theorem, which is named for Karl Weierstrass, is closely related to a second result that every sequence tending to infinity has an associated entire function with zeroes at precisely the points of that sequence.
A generalization of the theorem extends it to meromorphic functions and allows one to consider a given meromorphic function as a product of three factors: terms depending on the function's zeros and poles, and an associated non-zero holomorphic function.
The consequences of the fundamental theorem of algebra are twofold. Firstly, any finite sequence in the complex plane has an associated polynomial that has zeroes precisely at the points of that sequence,
Secondly, any polynomial function in the complex plane has a factorization 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 if the sequence 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 must approach 1 as . 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 above.
The elementary factors
Consider the functions of the form for . At , they evaluate to and have a flat slope at order up to . Right after , they sharply fall to some small positive value. In contrast, consider the function which has no flat slope but, at , evaluates to exactly zero. Also note that for |z| < 1,
For |z| < 1 and , one may express it as and one can read off how those properties are enforced.
The utility of the elementary factors En(z) lies in the following lemma:
Lemma (15.8, Rudin) for |z| ≤ 1,
The two forms of the theorem
Existence of entire function with specified zeroes
Let be a sequence of non-zero complex numbers such that . If is any sequence of integers such that for all ,
then the function
is entire with zeros only at points . If a number occurs in the sequence exactly m times, then function f has a zero at of multiplicity m.
- The sequence in the statement of the theorem always exists. For example, we could always take 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.
- Also the case given by the fundamental theorem of algebra is incorporated here. If the sequence is finite then we can take and obtain: .
The Weierstrass factorization theorem
Let ƒ be an entire function, and let 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 such that
Examples of factorization
Hadamard factorization theorem
If ƒ is an entire function of finite order ρ then it admits a factorization
where g(z) is a polynomial of degree q, q ≤ ρ and p = [ρ] .
- 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 (3rd ed.), Boston: McGraw Hill, pp. 301–304, ISBN 0-07-054234-1, OCLC 13093736
- Boas, R. P. (1954), Entire Functions, New York: Academic Press Inc., ISBN 0-8218-4505-5, OCLC 6487790, chapter 2.
- Conway, J. B. (1995), Functions of One Complex Variable I, 2nd ed., springer.com: Springer, ISBN 0-387-90328-3