nLab Weierstrass factorization theorem

Context

Analysis

Algebra

Contents

Idea

The analogue of polynomial factorization of polynomial functions over the complex numbers, but for entire complex analytic functions, which come with a countable set of roots instead of a finite set of roots for polynomials.

Definition

The Weierstrass primary factors are a sequence of functions on the complex functions inductively defined as

E 0(z)=(1−z)E_0(z) = (1 - z)
E n+1(z)=E n(z)e z n+1n+1E_{n + 1}(z) = E_{n}(z) e^{\frac{z^{n + 1}}{n + 1}}

Given a complex analytic function ff which is entire in the sense that the Taylor series expansion of ff converges on all of the complex numbers, and which has a zero of multiplicity nn at z=0z = 0, the Weierstrass factorization theorem states that there exists a countable set of roots z iz_i with index set II such that

f(z)=z ne g(z)∏ i∈IE p i(zz i). f(z) = z^n e^{g(z)} \prod_{i \in I} E_{p_i}\left(\frac{z}{z_i}\right) \mathrlap{\,.}

where nn is a natural number, g(z)g(z) is an entire function and E p iE_{p_i} are Weierstrass primary factors and p ip_i are natural numbers chosen to ensure the infinite product converges.

Examples

Polynomial functions

For a polynomial function ff of degree nn with m≤nm \leq n zeros at z=0z = 0, which is always an entire function, the countable set II for roots z iz_i is a finite set of cardinality n−mn - m, the entire function g(z)g(z) is equal to a constant cc, and the Weierstrass primary functions used in the product is E 0(z)E_{0}(z). Thus, Weierstrass factorization can be expressed as

f(z)=z me c∏ i=1 n−mE 0(zz i)=c ′z m∏ i=1 n−m(z−z i)wherec ′=e c∏ i=1 n−m(−1) iz i. f(z) = z^m e^c \prod_{i = 1}^{n - m} E_{0}\left(\frac{z}{z_i}\right) = c^\prime z^m \prod_{i = 1}^{n - m} (z - z_i) \quad \mathrm{where} \quad c^\prime = e^c \prod_{i = 1}^{n - m} \frac{(-1)^{i}}{z_i} \mathrlap{\,.}

which is precisely the fundamental theorem of algebra for complex polynomial functions.

In constructive mathematics

In constructive mathematics, the usual Weierstrass factorization theorem fails for the same reason that the fundamental theorem of algebra fails: the complex numbers are not a discrete field. As a result, there are a few alternatives for the Weierstrass factorization theorem a constructive mathematics.

Approximate Weierstrass factorization theorem

The approximate version of the Weierstrass factorization theorem states that given an entire complex analytic function ff with a zero of multiplicity nn at z=0z = 0, for all positive rational numbers ϵ\epsilon one can construct a countable set II of complex numbers z iz_i such that

|f(z)−z ne g(z)∏ i∈IE p i(zz i)|<ϵ. \vert f(z) - z^n e^{g(z)} \prod_{i \in I} E_{p_i}\left(\frac{z}{z_i}\right) \vert \lt \epsilon \mathrlap{\,.}

where nn is a natural number, g(z)g(z) is an entire function and E p iE_{p_i} are Weierstrass primary factors and p ip_i are natural numbers chosen to ensure the infinite product converges.

Using multisets of roots

Similarly to complex polynomials, instead of considering individual complex roots, one can instead consider multisets of complex roots for entire functions.

References

See also:

Last revised on October 4, 2026 at 15:40:10. See the history of this page for a list of all contributions to it.