Weierstrass factorization theorem explained

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 $p(z)\; =\; \backslash 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) in the complex plane has a factorization $p(z)\; =\; a\backslash prod\_n(z-c\_n),$ where is a non-zero constant and \{c _{n\}} is the set of zeroes of 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 $\backslash prod\_n\; (z-c\_n)$ 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 inf ty . 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 $\backslash exp\backslash left(-\backslash tfrac\backslash right)$ for

n \in N . 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,( 1- z) = \exp( ln ( 1- z)) = \exp \left( - \tfrac{z ^{1}{1}} - \tfrac{z ^{2}{2}} - \tfrac{z ^{3}{3}} + … \right).

The elementary factors, also referred to as primary factors,^[2] are functions that combine the properties of zero slope and zero value (see graphic):

E _{n(z)} = \begin{cases} ( 1- z) & if n =0 , \ ( 1- z)\exp \left( (z ^{1})/(+ 1) (z ^{2})/(+ … + 2) (z ^{n})/(n) \right) & otherwise . \end{cases}

For and

n> 0 , one may express it as $E\_n(z)=\backslash exp\backslash left(-\backslash tfrac\backslash sum\_^\backslash infty\backslash tfrac\backslash right)$ 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,

n \in N \vert 1 - E _{n(z)} \vert \leq \vert z \vert ^{n+1} .

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 |a _{n|\toinfty} .If \{p _{n\}} is any sequence of nonnegative integers such that for all r> 0 ,\sum ^{inf ty} _{n =1} \left( r/|a ^{1+ p _{n}} _{n|\right)} < inf ty, then the functionf(z) = \prod ^{inf ty} _{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 times, then function has a zero at z = z _{0} of multiplicity .

• 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, 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

\{a _{n\}} is finite then we can take p _{n} = 0 and obtain: f(z) = c{\displaystyle\prod} _{n} (z - a _{n)} .

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 of order .Then there exists an entire function and a sequence of integers \{p _{n\}} such thatf(z) = z ^{m} e ^{g(z)} \prod ^{inf ty} _{n =1} E _{p _{n}} \left( (z)/(a _{n}) \right).

Examples of factorization

\Gamma has factorization $$\backslash frac=e^z\backslash prod\_^\backslash left\; (1+\backslash frac\; \backslash right)e^,$$where \gamma is the Euler–Mascheroni constant. The cosine identity can be seen as special case of$$\backslash frac\; =\; \backslash frac\backslash prod\_^\backslash infty\; \backslash left(1\; -\; \backslash left(\backslash frac\; \backslash right)^2\; \backslash right)$$for s = \tfrac{ 1 }{ 2 } .

Hadamard factorization theorem

See main article: page and 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 $$f(z)=z^me^\backslash prod\_^\backslash infty\; E\_p(z/a\_k)$$where a _{k} are those roots of f that are not zero (a _{k} ≠ 0 ), m is the order of the zero of f at z = 0 (the case m = 0 being taken to mean f( 0 ) ≠ 0 ), P a polynomial (whose degree we shall call q ), and p is the smallest non-negative integer such that the series$$\backslash sum\_^\backslash infty\backslash frac$$

^

converges. This is called Hadamard's canonical representation. The non-negative integer g =max \{p,q\} is called the genus of the entire function f . The order \rho of f satisfies $$g\; \backslash leq\; \backslash rho\; \backslash leq\; g\; +\; 1$$In other words: If the order \rho is not an integer, then g = [ \rho ] 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 g = \rho = 1 .

See also

• Mittag-Leffler's theorem
• Wallis product, which can be derived from this theorem applied to the sine function
• Blaschke product

Notes and References

1. .
2. , chapter 2.