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.

Motivation

It is clear that any finite set {c_n} of points in the complex plane has an associated polynomial 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) in the complex plane has a factorization where a is a non-zero constant and {c_n} is the set of zeroes of p(z). 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 where 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\to\infty. 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.

The elementary factors

Consider the functions of the form for. At z=0, they evaluate to 1 and have a flat slope at order up to n. Right after z=1, they sharply fall to some small positive value. In contrast, consider the function 1-z which has no flat slope but, at z=1, evaluates to exactly zero. Also note that for , The elementary factors, also referred to as primary factors, are functions that combine the properties of zero slope and zero value (see graphic): For and n>0, one may express it as and one can read off how those properties are enforced. The utility of the elementary factors E_n(z) lies in the following lemma: Lemma (15.8, Rudin) for ,

The two forms of the theorem

Existence of entire function with specified zeroes

Let {a_n} be a sequence of non-zero complex numbers such that. If {p_n} is any sequence of nonnegative integers such that for all r>0, then the function 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 . p′n ≥ pn , will not break the convergence.

The Weierstrass factorization 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 . Then there exists an entire function g and a sequence of integers {p_n} such that

Examples of factorization

The trigonometric functions sine and cosine have the factorizations while the gamma function \Gamma has factorization where \gamma is the Euler–Mascheroni constant. The cosine identity can be seen as special case of for.

Hadamard factorization theorem

A special case of the Weierstraß factorization theorem occurs for entire functions of finite order. In this case the p_n can be taken independent of n and the function g(z) is a polynomial. Thus where a_k are those roots of f that are not zero (a_k \neq 0), m is the order of the zero of f at z = 0 (the case m = 0 being taken to mean f(0) \neq 0), P a polynomial (whose degree we shall call q), and p is the smallest non-negative integer such that the seriesconverges. This is called Hadamard's canonical representation. The non-negative integer is called the genus of the entire function f. The order \rho of f satisfies In other words: If the order \rho is not an integer, then is the integer part of \rho. If the order is a positive integer, then there are two possibilities: g = \rho-1 or g = \rho. For example, \sin, \cos and \exp are entire functions of genus.