Hubbry Logo
Weierstrass factorization theoremWeierstrass factorization theoremMain
Open search
Weierstrass factorization theorem
Community hub
Weierstrass factorization theorem
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Weierstrass factorization theorem
Weierstrass factorization theorem
from Wikipedia

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.[citation needed]

Motivation

[edit]

It is clear that any finite set 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 in the complex plane has a factorization where a is a non-zero constant and is the set of zeroes of .[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 where 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. Instead, the theorem replaces these with other factors.

A necessary condition for convergence of the infinite product in question is that for each , the factors replacing must approach 1 as . 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 above.

Elementary factors

[edit]

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,

First 5 Weierstrass factors on the unit interval.
Plot of En(x) for n = 0, ..., 4 and x in the interval [−1, 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 , one may express it as and one can read off how those properties are enforced.

The utility of the elementary factors lies in the following lemma:[2]

Lemma (15.8, Rudin) for |z| ≤ 1,

Existence of entire function with specified zeroes

[edit]

Let be a sequence of non-zero complex numbers such that . If is any sequence of nonnegative integers such that for all ,

then the function

is entire with zeros only at points .[2] If a number occurs in the sequence exactly m times, then the function E 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 pnpn, 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.[2]

Weierstrass factorization theorem

[edit]

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] Then there exists an entire function g and a sequence of integers such that

[4]

The case given by the fundamental theorem of algebra is incorporated here. If the sequence is finite then we can take , and to obtain .

Examples of factorization

[edit]

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

Hadamard factorization theorem

[edit]

A special case of the Weierstraß factorization theorem occurs for entire functions of finite order. In this case the can be taken independent of and the function is a polynomial. Thus where are those roots of that are not zero (), is the order of the zero of at (the case being taken to mean ), a polynomial (whose degree we shall call ), and is the smallest non-negative integer such that the seriesconverges. This is called Hadamard's canonical representation.[4] The non-negative integer is called the genus of the entire function . The order of satisfies In other words: If the order is not an integer, then is the integer part of . If the order is a positive integer, then there are two possibilities: or .

For example, , and are entire functions of genus .

See also

[edit]

Notes

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
The Weierstrass factorization theorem is a fundamental result in . It states that every f(z)f(z) can be represented as f(z)=zmeg(z)P(z)f(z) = z^m e^{g(z)} P(z), where mm is a non-negative , g(z)g(z) is an , and P(z)P(z) is a canonical product formed from the zeros of ff using Weierstrass elementary factors EpE_p. Named after the German mathematician (1815–1897), who first published the theorem in 1876, it provides a way to factor transcendental entire functions analogous to the , ensuring convergence of the over the zeros (assuming no finite accumulation points). The theorem enables the construction of entire functions with prescribed zeros and has implications for the growth of entire functions, leading to refinements like the Hadamard factorization theorem and applications in the theory of .

Introduction and Historical Context

Overview of the Theorem

The Weierstrass factorization theorem states that every f(z)f(z), which is holomorphic everywhere in the , can be expressed in the form f(z)=zmeg(z)n=1Epn(zan)f(z) = z^m e^{g(z)} \prod_{n=1}^\infty E_{p_n}\left(\frac{z}{a_n}\right), where m0m \geq 0 is the order of the zero at z=0z = 0 (with m=0m = 0 if f(0)0f(0) \neq 0), g(z)g(z) is another , the ana_n are the non-zero zeros of f(z)f(z) repeated according to their multiplicity, and the EpnE_{p_n} are elementary Weierstrass factors with non-negative integers pnp_n chosen to ensure convergence of the . An is analytic on the whole C\mathbb{C}, and zeros with multiplicity account for the order of each root, meaning a zero of order kk at a point aa is listed kk times in the sequence {an}\{a_n\}. This theorem generalizes the , which factors polynomials as finite products over their roots, by extending the representation to s through infinite products that converge appropriately. It reveals the deep structure of s by tying their global behavior directly to the locations and multiplicities of their zeros. The is unique in the sense that the zeros and their multiplicities are uniquely determined by f(z)f(z), though the g(z)g(z) and the exponents pnp_n (which control convergence) allow for some flexibility in the representation.

Historical Development

The Weierstrass factorization theorem emerged in the mid-19th century as a rigorous advancement in complex analysis, building on foundational contributions from earlier mathematicians. Augustin-Louis Cauchy's development of the residue theorem in the 1820s and 1830s provided essential tools for understanding singularities and integrals of analytic functions, laying groundwork for later infinite product representations. Similarly, Bernhard Riemann's 1851 habilitation thesis and his 1859 paper on the distribution of prime numbers introduced concepts of analytic continuation and infinite products over zeros, such as for the Riemann zeta function, though without full rigor on convergence. These works influenced Karl Weierstrass, who sought to establish uniform convergence as a cornerstone for function theory during his studies of elliptic functions starting in the 1830s. Weierstrass formulated the theorem in the 1870s, integrating it into his broader research on elliptic functions and the need for precise control over infinite products to ensure analyticity. His approach addressed whether an could be constructed from a prescribed sequence of zeros, extending the finite case of the to infinite settings while emphasizing to avoid pathologies. This formulation was presented in his lectures at the University of , where he held a professorship from 1864 onward, and became a key element of his teaching on analytic functions in the 1880s. The received formal in Weierstrass's 1876 paper, "Zur Theorie der eindeutigen analytischen Funktionen," in the Abhandlungen der Mathematischen Classe der Königlich Preussischen Akademie der Wissenschaften zu , which detailed the convergence criteria for infinite products of entire functions. Much of his work, including elaborations on the , circulated through student notes from lectures and was posthumously compiled and edited in the 1890s by former students like Lazarus Fuchs and Otto Biermann. Recognized as a foundational result, the solidified the of entire functions and enabled advancements like Hadamard's 1893 application to the of the , marking its enduring impact on modern .

Prerequisites in Complex Analysis

Entire Functions and Their Zeroes

An entire function is a complex-valued function that is holomorphic everywhere in the complex plane C\mathbb{C}. This means it is complex differentiable at every point in C\mathbb{C}, with no singularities in the finite plane. Examples include all polynomials, such as z2+1z^2 + 1, which are holomorphic by virtue of being sums of powers of zz, as well as transcendental functions like the exponential function exp(z)\exp(z) and the sine function sin(z)\sin(z), both of which admit power series expansions convergent everywhere in C\mathbb{C}. A fundamental property of non-constant entire functions is given by Picard's little theorem, which states that such a function omits at most one value in the ; that is, its range covers all of C\mathbb{C} except possibly one point. For instance, exp(z)\exp(z) never attains the value 0, illustrating the exceptional case, while sin(z)\sin(z) takes every infinitely often. This theorem underscores the richness of the range of entire functions, contrasting with the more restricted behavior of functions holomorphic only on bounded domains. The zeros of a non-constant are isolated points in C\mathbb{C} and each has finite multiplicity. Specifically, if ff is entire and f(a)=0f(a) = 0 for some aCa \in \mathbb{C}, then there exists a disk around aa containing no other zeros, and the multiplicity mm at aa is the smallest positive integer such that f(m)(a)0f^{(m)}(a) \neq 0, or equivalently, f(z)=(za)mg(z)f(z) = (z - a)^m g(z) where gg is holomorphic at aa and g(a)0g(a) \neq 0. For the zero at z=0z = 0, the multiplicity mm satisfies f(0)=f(0)==f(m1)(0)=0f(0) = f'(0) = \cdots = f^{(m-1)}(0) = 0 but f(m)(0)0f^{(m)}(0) \neq 0. Since the complex plane is unbounded, zeros may accumulate only at infinity, meaning any sequence of distinct zeros must tend to the point at infinity. Weierstrass observed that the zeros of an , including their multiplicities and locations, uniquely determine the function up to multiplication by another that has no zeros. This insight forms the basis for representing through their zero sets, allowing the isolation of the "zero structure" from the "exponential" or growth-determining part.

Infinite Products and Convergence

In , an infinite product of the form n=1(1+un(z))\prod_{n=1}^\infty (1 + u_n(z)), where each un(z)u_n(z) is a , is defined through its partial products PN(z)=n=1N(1+un(z))P_N(z) = \prod_{n=1}^N (1 + u_n(z)). The infinite product converges at a point z0z_0 if the limit limNPN(z0)\lim_{N \to \infty} P_N(z_0) exists and is nonzero, provided no partial product vanishes; otherwise, it diverges to zero or is undefined if any factor is identically zero. In the complex domain, convergence is typically considered on open sets, with the product defining a where the partial products converge uniformly on compact subsets. A key condition for convergence is absolute convergence, which occurs when n=1un(z)\sum_{n=1}^\infty |u_n(z)| converges for each zz in the domain. This implies the convergence of the original product, as the partial products of 1+un(z)1 + |u_n(z)| bound the magnitude and ensure the limit is finite and nonzero. is particularly useful in the because it guarantees holomorphy in regions where the series converges uniformly. For products constructed over the zeros {an}\{a_n\} of an , Weierstrass introduced a specific convergence criterion tied to the exponent of convergence ρ=inf{λ>0:n=11/anλ<}\rho = \inf \{ \lambda > 0 : \sum_{n=1}^\infty 1/|a_n|^\lambda < \infty \}, which measures the density of the zeros. The simple infinite product n=1(1z/an)\prod_{n=1}^\infty (1 - z/a_n) converges uniformly on compact subsets of C\mathbb{C} if n=11/an<\sum_{n=1}^\infty 1/|a_n| < \infty, which holds when the exponent of convergence ρ<1\rho < 1. If ρ1\rho \geq 1, then exponential adjustments via Weierstrass elementary factors of positive genus are necessary to ensure convergence. To ensure convergence when the basic product fails, exponential factors are incorporated, such as exp(k=1pzk/k)\exp\left( \sum_{k=1}^p z^k / k \right) in the primary factors, which counteract the divergence of the logarithmic terms and allow the product to define an entire function for appropriate pρp \geq \lfloor \rho \rfloor. These exponentials adjust the growth to match the zero distribution without introducing extraneous zeros. The resulting infinite products for entire functions converge uniformly on every compact subset of the complex plane, enabling the application of Weierstrass's theorem to represent functions with prescribed zeros as holomorphic limits of the partial products. This uniform convergence preserves analyticity and allows the product to be entire.

Building Blocks of the Factorization

Elementary Weierstrass Factors

The elementary Weierstrass factors form the foundational components for constructing factorizations of entire functions with prescribed zeros. These factors are entire functions designed to introduce a single simple zero at a specified point while maintaining controlled growth elsewhere, particularly near the origin. They were introduced by to ensure the convergence of infinite products in the factorization theorem. The simplest elementary factor is defined as E0(z)=1zE_0(z) = 1 - z. This is an entire function with a simple zero at z=1z = 1 and no other zeros in the complex plane. For n1n \geq 1, the general elementary factor is given by En(z)=(1z)exp(k=1nzkk).E_n(z) = (1 - z) \exp\left( \sum_{k=1}^n \frac{z^k}{k} \right). This function is also entire and possesses a simple zero precisely at z=1z = 1, with no additional zeros. To incorporate a zero at an arbitrary point a0a \neq 0, one considers En(z/a)E_n(z/a), which shifts the zero to z=az = a while remaining entire and free of other zeros. A key property ensuring the utility of these factors in infinite products is their controlled behavior for small zz. Specifically, for z1|z| \leq 1 and n0n \geq 0, En(z)1zn+1.|E_n(z) - 1| \leq |z|^{n+1}. This growth lemma demonstrates that En(z)E_n(z) approximates 1 closely when z|z| is small, with the approximation improving as nn increases, thus preventing the introduction of extraneous singularities or rapid growth in products. The bound holds because the exponential term compensates for the logarithmic singularity in the naive factor 1z1 - z, keeping the deviation from 1 bounded by a higher-order term in zz. The choice of nn for each factor En(z/ak)E_n(z/a_k) in a product is determined by the convergence exponent of the zero sequence {ak}\{a_k\}, defined as the infimum of ρ0\rho \geq 0 such that 1/akρ+ϵ<\sum 1/|a_k|^{\rho + \epsilon} < \infty for all ϵ>0\epsilon > 0. Typically, nn is selected as the smallest greater than or equal to this exponent (often rounded up to the of the sequence), which minimizes the overall growth of the resulting product while ensuring on compact sets. This selection balances the need for rapid decay near each zero with the requirement that the factors do not grow too quickly at .

Canonical Products

The product, also known as the Weierstrass canonical product, is an constructed from elementary Weierstrass factors to encode a prescribed of zeros {an}n=1\{a_n\}_{n=1}^\infty in the , where the ana_n have no finite . It is defined as P(z)=n=1Epn(zan),P(z) = \prod_{n=1}^\infty E_{p_n}\left(\frac{z}{a_n}\right), where Ep(u)=(1u)exp(k=1pukk)E_p(u) = (1 - u) \exp\left( \sum_{k=1}^p \frac{u^k}{k} \right) for p1p \geq 1 (and E0(u)=1uE_0(u) = 1 - u) denotes the elementary Weierstrass factor of order pp, and the integers pn0p_n \geq 0 are chosen to ensure convergence. The genus pp of the zero sequence {an}\{a_n\} is the smallest non-negative such that n=11anp+1<\sum_{n=1}^\infty \frac{1}{|a_n|^{p+1}} < \infty. This pp is closely related to the exponent of convergence ρ\rho of the sequence, defined as the infimum of all λ>0\lambda > 0 for which n=11anλ<\sum_{n=1}^\infty \frac{1}{|a_n|^\lambda} < \infty, with p the smallest non-negative such that p ≤ ρ < p + 1. The sequence {pn}\{p_n\} is selected based on the genus pp or the exponent ρ\rho to guarantee absolute and uniform convergence of the product on compact subsets of C\mathbb{C}; a common choice is pnmax(p,n)p_n \leq \max(p, n) for all nn, ensuring n=11anpn+1<\sum_{n=1}^\infty \frac{1}{|a_n|^{p_n + 1}} < \infty while minimizing the growth of the factors. This selection balances convergence with efficiency, as higher pnp_n improve convergence but increase the order of the resulting product. The canonical product P(z)P(z) is an entire function of order at most p+1p + 1, with simple zeros precisely at the points ana_n (assuming distinct ana_n) and no other zeros. If the sequence includes a zero of multiplicity mm at the origin, it is incorporated as a factor zmz^m. Canonical products for a given zero sequence are unique up to the choice of genus pp and the specific sequence {pn}\{p_n\}, as different selections yield products differing by an entire function without zeros. The minimal genus choice provides the "standard" canonical product of that genus.

Statement and Proof of the Theorem

Formal Statement

The Weierstrass factorization theorem states that if ff is a non-constant entire function on the complex plane, with a zero of order m0m \geq 0 at z=0z = 0 (where m=0m = 0 if f(0)0f(0) \neq 0) and simple zeros at the points ana_n (n=1,2,n = 1, 2, \dots) with an|a_n| \to \infty as nn \to \infty (no finite accumulation point), then there exist an entire function g(z)g(z) and non-negative integers pnp_n (chosen sufficiently large to ensure convergence) such that f(z)=zmeg(z)n=1Epn(zan),f(z) = z^m e^{g(z)} \prod_{n=1}^\infty E_{p_n}\left( \frac{z}{a_n} \right), where the elementary Weierstrass factors are defined by E0(u)=1uE_0(u) = 1 - u and, for p1p \geq 1, Ep(u)=(1u)exp(u+u22++upp).E_p(u) = (1 - u) \exp\left( u + \frac{u^2}{2} + \cdots + \frac{u^p}{p} \right). The sequence {an}\{a_n\} accounts for multiplicities, and the product converges uniformly on compact subsets of C\mathbb{C} provided the pnp_n are selected based on the growth of the zeros, such as pnlognp_n \geq \lfloor \log n \rfloor or determined by the genus of the canonical product. If f(0)0f(0) \neq 0, then m=0m = 0, and the factorization simplifies to f(z)=eg(z)n=1Epn(z/an)f(z) = e^{g(z)} \prod_{n=1}^\infty E_{p_n}(z/a_n). More generally, the theorem extends to allow a non-zero constant multiple, so f(z)=czmeg(z)n=1Epn(z/an)f(z) = c z^m e^{g(z)} \prod_{n=1}^\infty E_{p_n}(z/a_n) for some cC{0}c \in \mathbb{C} \setminus \{0\}. The factorization is unique up to the choice of the sequence {pn}\{p_n\} and the entire function g(z)g(z); if a canonical product of minimal genus is fixed, then g(z)g(z) is unique modulo addition of a constant (which corresponds to multiplying by a constant factor via the exponential).

Construction and Proof Outline

The proof of the Weierstrass factorization theorem begins by addressing any zero of the entire function f(z)f(z) at the origin. Suppose f(z)f(z) has a zero of order m0m \geq 0 at z=0z = 0; then, f(z)f(z) can be expressed as f(z)=zmh(z)f(z) = z^m h(z), where h(z)h(z) is another entire function with h(0)0h(0) \neq 0. This step isolates the origin's contribution, allowing the remaining analysis to focus on zeros away from the origin. Next, the zeros of h(z)h(z), denoted ana_n (counted with multiplicity and excluding the origin, with an|a_n| \to \infty as nn \to \infty), are used to construct a canonical product Π(z)\Pi(z) that incorporates these zeros exactly. The canonical product is formed as Π(z)=n=1Epn(z/an)\Pi(z) = \prod_{n=1}^\infty E_{p_n}(z/a_n), where Epn(ζ)=(1ζ)exp(j=1pnζjj)E_{p_n}(\zeta) = (1 - \zeta) \exp\left( \sum_{j=1}^{p_n} \frac{\zeta^j}{j} \right) are the elementary Weierstrass factors, and the integers pn0p_n \geq 0 are chosen sufficiently large (e.g., pn=n1p_n = n-1) to ensure convergence of the infinite product to an entire function with simple zeros at each ana_n. This construction relies on the convergence of the product on compact subsets of C\mathbb{C}, guaranteed by the condition n=1an(pn+1)<\sum_{n=1}^\infty |a_n|^{-(p_n+1)} < \infty. With Π(z)\Pi(z) defined, consider the quotient ϕ(z)=h(z)/Π(z)\phi(z) = h(z) / \Pi(z). At each zero aka_k of h(z)h(z), Π(z)\Pi(z) has a corresponding zero of the same order, so ϕ(z)\phi(z) has a removable singularity there. By the Riemann removable singularity theorem, ϕ(z)\phi(z) extends to an entire function. Moreover, ϕ(z)\phi(z) has no zeros, as the construction of Π(z)\Pi(z) precisely cancels all zeros of h(z)h(z). Since ϕ(z)\phi(z) is entire and zero-free, it admits a holomorphic logarithm: logϕ(z)=g(z)\log \phi(z) = g(z) for some entire function g(z)g(z), implying ϕ(z)=eg(z)\phi(z) = e^{g(z)}. Thus, h(z)=Π(z)eg(z)h(z) = \Pi(z) e^{g(z)}, and substituting back yields the factorization f(z)=zmΠ(z)eg(z)f(z) = z^m \Pi(z) e^{g(z)}. The choice of pnp_n in the Weierstrass factors controls growth to handle convergence, often via auxiliary exponential terms or adjusted exponents rather than , which apply in bounded domains.

Variants and Generalizations

Hadamard Factorization Theorem

The order ρ\rho of an entire function ff is defined as ρ=lim suprloglogM(r)logr\rho = \limsup_{r \to \infty} \frac{\log \log M(r)}{\log r}, where M(r)=maxz=rf(z)M(r) = \max_{|z|=r} |f(z)|. This quantity measures the growth rate of ff, with ρ<\rho < \infty indicating finite order. For instance, polynomials have order 0, as their growth is bounded by a constant times rdr^d for some degree dd, leading to loglogM(r)\log \log M(r) growing slower than any positive multiple of logr\log r. The exponential function eze^z has order 1, since M(r)erM(r) \approx e^r on the positive real axis, yielding loglogM(r)logr\log \log M(r) \sim \log r. The genus gg of an entire function with zeros {an}\{a_n\} (counting multiplicities, excluding zero) is the smallest nonnegative integer such that n=11ang+1<\sum_{n=1}^\infty \frac{1}{|a_n|^{g+1}} < \infty. For functions of finite order ρ\rho, the genus satisfies gρg+1g \leq \rho \leq g+1. This condition ensures the convergence of the associated infinite product in the factorization. The Hadamard factorization theorem refines the Weierstrass theorem for entire functions of finite order ρ\rho. It states that if ff is an entire function of finite order ρ\rho with a zero of multiplicity mm at the origin and other zeros {an}\{a_n\}, then f(z)=zmeP(z)n=1Ep(zan)f(z) = z^m e^{P(z)} \prod_{n=1}^\infty E_p\left(\frac{z}{a_n}\right), where P(z)P(z) is a polynomial of degree at most ρ\rho, pp is the genus (with p=ρp = \lfloor \rho \rfloor or p=ρ+1p = \lfloor \rho \rfloor + 1 as needed), and Ep(u)=(1u)exp(u+u22++upp)E_p(u) = (1 - u) \exp\left( u + \frac{u^2}{2} + \cdots + \frac{u^p}{p} \right) is the Weierstrass elementary factor of genus pp. Unlike the general Weierstrass factorization, where the exponential factor eg(z)e^{g(z)} allows g(z)g(z) to be any entire function, the Hadamard version restricts g(z)g(z) to a polynomial, reflecting the controlled growth imposed by finite order. This makes the theorem particularly applicable to functions like eze^z (where the product is absent and P(z)=zP(z) = z) and sinz\sin z (order 1, with zeros at integer multiples of π\pi and genus 1).

Factorization for Meromorphic Functions

The Weierstrass factorization theorem extends naturally to meromorphic functions on the complex plane by incorporating poles through ratios of infinite products. Specifically, any meromorphic function f(z)f(z) with zeros at points {an}\{a_n\} (counted with multiplicity) and poles at points {bm}\{b_m\} (also with multiplicity) can be expressed as f(z)=eg(z)zkn=1Epn(zan)m=1Eqm(zbm),f(z) = e^{g(z)} \frac{z^k \prod_{n=1}^\infty E_{p_n}\left(\frac{z}{a_n}\right)}{\prod_{m=1}^\infty E_{q_m}\left(\frac{z}{b_m}\right)}, where g(z)g(z) is an entire function, kZk \in \mathbb{Z} accounts for the order at the origin, and the EpE_p are Weierstrass elementary factors chosen to ensure convergence. This representation arises because meromorphic functions are quotients of entire functions, each of which admits a Weierstrass factorization for its zeros. The Mittag-Leffler theorem serves as the dual to the Weierstrass theorem in this context, providing a partial fraction decomposition for meromorphic functions with prescribed poles and principal parts. It asserts that for a sequence of distinct poles {ak}\{a_k\} with no limit point in the domain and specified Laurent principal parts Sk(z)S_k(z) at each aka_k, there exists a meromorphic function f(z)f(z) such that near each aka_k, f(z)Sk(z)f(z) - S_k(z) is holomorphic. This theorem complements the product-based Weierstrass approach by focusing on additive constructions via series of rational functions, enabling the explicit handling of pole behaviors in meromorphic factorizations. Convergence adjustments for the pole sequences {bm}\{b_m\} mirror those for zeros, requiring that the products Eqm(z/bm)\prod E_{q_m}(z/b_m) converge uniformly on compact sets. This is achieved by selecting integers qmq_m such that m(r/bm)qm+1<\sum_m (r / |b_m|)^{q_m + 1} < \infty for every r>0r > 0, analogous to the zero case, ensuring the overall ratio defines a . For rational functions, which are meromorphic on the , the factorization is finite, highlighting how zeros and poles determine the global structure. This connects to uniformization theory, where such factorizations underpin representations of Riemann surfaces via quotients of universal covers. Modern extensions of the Weierstrass theorem to several complex variables face challenges due to non-isolated zeros, requiring more general ideals or sheaves rather than simple products; similarly, classical treatments are incomplete for quasianalytic classes beyond the analytic category, where preparation theorems fail.

Examples and Applications

Classical Factorizations

The Weierstrass factorization theorem finds one of its most celebrated applications in the explicit representation of the sine function as an over its zeros. The function sin(πz)\sin(\pi z) is an of order 1, with simple zeros precisely at the integers z=nz = n for nZn \in \mathbb{Z}. Its takes the form sin(πz)=πzn=1(1z2n2),\sin(\pi z) = \pi z \prod_{n=1}^\infty \left(1 - \frac{z^2}{n^2}\right), where the product is a canonical product of genus 0 constructed using the elementary Weierstrass factors E0(u)=1uE_0(u) = 1 - u. This matches the general form of the theorem, as the exponential factor is absent (i.e., eg(z)e^{g(z)} with g(z)=0g(z) = 0), and convergence of the product follows from the exponent sum 1/n2<\sum 1/n^2 < \infty, confirming the genus 0 structure for this order-1 . A closely related example is the cosine function, which shares the same order 1 but can be derived directly from the sine factorization by the identity cos(πz)=sin(π(z+1/2))/sin(πz/2)\cos(\pi z) = \sin(\pi (z + 1/2))/\sin(\pi z/2) or through its own zero set at half-odd integers. The explicit product is cos(πz)=n=0(14z2(2n+1)2),\cos(\pi z) = \prod_{n=0}^\infty \left(1 - \frac{4z^2}{(2n+1)^2}\right), again utilizing genus-0 factors E0E_0 over the zeros z=(2n+1)/2z = (2n+1)/2, with no or exponential prefactor needed beyond normalization. The paired terms ensure convergence via 1/(2n+1)2<\sum 1/(2n+1)^2 < \infty, aligning with the theorem's construction for entire functions of finite order without essential singularities at infinity. The reciprocal Gamma function 1/Γ(z)1/\Gamma(z) provides another classical illustration, as it is entire of order 1 with simple zeros at the non-positive integers z=nz = -n for n=0,1,2,n = 0, 1, 2, \dots. Its Weierstrass factorization incorporates an exponential adjustment for convergence and is given by 1Γ(z)=zeγzn=1(1+zn)ez/n,\frac{1}{\Gamma(z)} = z e^{\gamma z} \prod_{n=1}^\infty \left(1 + \frac{z}{n}\right) e^{-z/n}, where γ\gamma is the Euler-Mascheroni constant. Here, the canonical product uses genus-1 factors E1(u)=(1u)euE_1(u) = (1 - u) e^u, necessary because the exponent sum for genus 0 diverges (1/n=\sum 1/n = \infty), but converges for genus 1 (1/n2<\sum 1/n^2 < \infty); the linear exponential eγze^{\gamma z} serves as the required polynomial factor of degree at most the genus. This form exemplifies the theorem's flexibility in handling divergent zero sequences through higher-genus elementary factors.

Applications in Mathematical Analysis

The Weierstrass factorization theorem plays a crucial role in the of functions with natural boundaries or branch points by enabling the representation of related entire functions through their zeros, facilitating the extension of domains. For instance, in the study of the , the completed function ξ(s), which is entire of order 1, admits a Hadamard product expansion over its non-trivial zeros, allowing for the analytic continuation of ζ(s) beyond its initial domain of convergence and aiding in the investigation of zero distributions. This product form underscores the theorem's utility in bridging local zero behavior to global analytic properties, though ζ(s) itself is meromorphic rather than entire. In , the theorem extends to the factorization of completed L-functions associated with Dirichlet characters or modular forms, which are entire functions of finite order, providing insights into their zero structures and arithmetic properties. For primitive Dirichlet L-functions, the Weierstrass-Hadamard factorization yields a product over zeros that reflects the function's order and genus, supporting analytic proofs of prime number theorems in arithmetic progressions. Similarly, L-functions attached to cusp forms, such as those arising from elliptic modular forms, benefit from this representation to analyze growth rates and functional equations, linking to . Applications in physics leverage the theorem for factorizing scattering matrices in , where entire functions model transmission amplitudes. In on two-dimensional spaces, factorizing S-matrices with prescribed poles and zeros via Weierstrass products constructs exact solutions for integrable models, such as those with deformed symmetries. For resonant nanostructures, the theorem expresses the scattering matrix in terms of spectral singularities, optimizing resonant effects by controlling zero placements without altering the overall analytic structure. These uses highlight the theorem's role in ensuring unitarity and through precise zero-pole configurations. Computational aspects of the theorem involve numerical evaluation of infinite products to verify convergence and approximate entire functions, particularly in high-precision contexts where direct is inefficient. Algorithms for truncating Weierstrass products, guided by growth estimates of the exponentiating factor, enable computations for functions like the gamma function's reciprocal, with bounds derived from the theorem's factors. Such methods are essential for verifying theoretical predictions in , though challenges arise from slow convergence near accumulation points of zeros. The theorem influences by providing growth estimates from factorizations that contradict assumptions of algebraicity for certain values. In proofs of transcendence for elliptic function values, the Weierstrass sigma function's product form yields precise order bounds, enabling comparisons with algebraic growth to establish or transcendence via Lindemann-type arguments extended to quasi-periodic settings. This approach, refined in works on values of the sigma function at algebraic points, uses the theorem's exponential factor to derive lower bounds on linear forms in transcendents. Modern extensions adapt the theorem to several complex variables through local preparation results, though global factorization is obstructed by non-isolated zeros; Oka's coherence theorems complement this by ensuring sheaf-theoretic extensions of local Weierstrass divisions. In p-adic analysis, an analogue preparation theorem factorizes power series over p-adic integers into Weierstrass polynomials times units, preserving convergence in rigid analytic spaces and applying to resultants in non-Archimedean number theory. These generalizations maintain the theorem's core insight into zero structures while accommodating non-standard topologies.

References

Add your contribution
Related Hubs
User Avatar
No comments yet.