Hadamard factorization theorem

Last updated

In mathematics, and particularly in the field of complex analysis, the Hadamard factorization theorem asserts that every entire function with finite order can be represented as a product involving its zeroes and an exponential of a polynomial. It is named for Jacques Hadamard.

Contents

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. It is closely related to Weierstrass factorization theorem, which does not restrict to entire functions with finite orders.

Formal statement

Define the Hadamard canonical factorsEntire functions of finite order have Hadamard's canonical representation: [1] 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. The non-negative integer is called the genus of the entire function . In this notation,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 .

Furthermore, Jensen's inequality implies that its roots are distributed sparsely, with critical exponent .

For example, , and are entire functions of genus .

Critical exponent

Define the critical exponent of the roots of as the following:where is the number of roots with modulus . In other words, we have an asymptotic bound on the growth behavior of the number of roots of the function:It's clear that .

Theorem: [2] If is an entire function with infinitely many roots, thenNote: These two equalities are purely about the limit behaviors of a real number sequence that diverges to infinity. It does not involve complex analysis.

Proposition:, [3] by Jensen's formula.

Proof

Since is also an entire function with the same order and genus, we can wlog assume .

If has only finitely many roots, then with the function of order . Thus by an application of the Borel–Carathéodory theorem, is a polynomial of degree , and so we have .

Otherwise, has infinitely many roots. This is the tricky part and requires splitting into two cases. First show that , then show that .

Define the function where . We will study the behavior of .

Bounds on the behaviour of |Ep|

In the proof, we need four bounds on :

  1. For any , when .
  2. For any , there exists such that when .
  3. For any , there exists such that when .
  4. for all , and as .

These are essentially proved in the similar way. As an example, we prove the fourth one.where is an entire function. Since it is entire, for any , it is bounded in . So inside .

Outside , we have

g is well-defined

Source: [2]

For any , we show that the sum converges uniformly over .

Since only finitely many , we can split the sum to a finite bulk and an infinite tail:The bulk term is a finite sum, so it converges uniformly. It remains to bound the tail term.

By bound (1) on , . So if is large enough, for some , [nb 1] Since , the last sum is finite.

g floor(ρ)

As usual in analysis, we fix some small.

Then the goal is to show that is of order . This does not exactly work, however, due to bad behavior of near . Consequently, we need to pepper the complex plane with "forbidden disks", one around each , each with radius . Then since by the previous result on , we can pick an increasing sequence of radii that diverge to infinity, such that each circle avoids all these forbidden disks.

Thus, if we can prove a bound of form for all large [nb 2] that avoids these forbidden disks, then by the same application of Borel–Carathéodory theorem, for any , and so as we take , we obtain .

Since by the definition of , it remains to show that , that is, there exists some constant such that for all large that avoids these forbidden disks.

As usual in analysis, this infinite sum can be split into two parts: a finite bulk and an infinite tail term, each of which is to be separately handled. There are finitely many with modulus and infinitely many with modulus . So we have to bound:The upper-bounding can be accomplished by the bounds (2), (3) on , and the assumption that is outside every forbidden disk. Details are found in. [2]

ρg + 1

This is a corollary of the following:

If has genus , then .

Split the sum to three parts: The first two terms are . The third term is bounded by bound (4) of : By assumption, , so . Hence the above sum is

Applications

With Hadamard factorization we can prove some special cases of Picard's little theorem.

Theorem: [4] If is entire, nonconstant, and has finite order, then it assumes either the whole complex plane or the plane minus a single point.

Proof: If does not assume value , then by Hadamard factorization, for a nonconstant polynomial . By the fundamental theorem of algebra, assumes all values, so assumes all nonzero values.

Theorem: [4] If is entire, nonconstant, and has finite, non-integer order , then it assumes the whole complex plane infinitely many times.

Proof: For any , it suffices to prove has infinitely many roots. Expand to its Hadamard representation . If the product is finite, then is an integer.

Related Research Articles

In complex analysis, an entire function, also called an integral function, is a complex-valued function that is holomorphic on the whole complex plane. Typical examples of entire functions are polynomials and the exponential function, and any finite sums, products and compositions of these, such as the trigonometric functions sine and cosine and their hyperbolic counterparts sinh and cosh, as well as derivatives and integrals of entire functions such as the error function. If an entire function has a root at , then , taking the limit value at , is an entire function. On the other hand, the natural logarithm, the reciprocal function, and the square root are all not entire functions, nor can they be continued analytically to an entire function.

In mathematics, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by precisely quantifying the rate at which this occurs. The theorem was proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896 using ideas introduced by Bernhard Riemann.

<span class="mw-page-title-main">Van der Waals equation</span> Gas equation of state which accounts for non-ideal gas behavior

The van der Waals equation is a mathematical formula that describes the behavior of real gases. It is named after Dutch physicist Johannes Diderik van der Waals. It is an equation of state that relates the pressure, temperature, and molar volume in a fluid. However, it can be written in terms of other, equivalent, properties in place of the molar volume, for example specific volume, or number density. The equation modifies the ideal gas law in two ways. First its particles have a finite diameter, whereas the ideal gas consists of point particles with no extension. Second, its particles interact with one other, whereas the particles of an ideal gas move as though they were alone in the volume.

<span class="mw-page-title-main">Analytic number theory</span> Exploring properties of the integers with complex analysis

In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dirichlet L-functions to give the first proof of Dirichlet's theorem on arithmetic progressions. It is well known for its results on prime numbers and additive number theory.

In mathematics, the ratio test is a test for the convergence of a series

In mathematics, subadditivity is a property of a function that states, roughly, that evaluating the function for the sum of two elements of the domain always returns something less than or equal to the sum of the function's values at each element. There are numerous examples of subadditive functions in various areas of mathematics, particularly norms and square roots. Additive maps are special cases of subadditive functions.

In the theory of stochastic processes, the Karhunen–Loève theorem, also known as the Kosambi–Karhunen–Loève theorem states that a stochastic process can be represented as an infinite linear combination of orthogonal functions, analogous to a Fourier series representation of a function on a bounded interval. The transformation is also known as Hotelling transform and eigenvector transform, and is closely related to principal component analysis (PCA) technique widely used in image processing and in data analysis in many fields.

In mathematics, the root test is a criterion for the convergence of an infinite series. It depends on the quantity

In mathematics, and particularly in the field of complex analysis, the Weierstrass factorization theorem asserts that every entire function can be represented as a 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.

In mathematics, the Borel–Carathéodory theorem in complex analysis shows that an analytic function may be bounded by its real part. It is an application of the maximum modulus principle. It is named for Émile Borel and Constantin Carathéodory.

In information theory, information dimension is an information measure for random vectors in Euclidean space, based on the normalized entropy of finely quantized versions of the random vectors. This concept was first introduced by Alfréd Rényi in 1959.

Cylindrical multipole moments are the coefficients in a series expansion of a potential that varies logarithmically with the distance to a source, i.e., as . Such potentials arise in the electric potential of long line charges, and the analogous sources for the magnetic potential and gravitational potential.

In quantum information theory, quantum relative entropy is a measure of distinguishability between two quantum states. It is the quantum mechanical analog of relative entropy.

In mathematics, the Cauchy–Hadamard theorem is a result in complex analysis named after the French mathematicians Augustin Louis Cauchy and Jacques Hadamard, describing the radius of convergence of a power series. It was published in 1821 by Cauchy, but remained relatively unknown until Hadamard rediscovered it. Hadamard's first publication of this result was in 1888; he also included it as part of his 1892 Ph.D. thesis.

In mathematics, the spectral theory of ordinary differential equations is the part of spectral theory concerned with the determination of the spectrum and eigenfunction expansion associated with a linear ordinary differential equation. In his dissertation, Hermann Weyl generalized the classical Sturm–Liouville theory on a finite closed interval to second order differential operators with singularities at the endpoints of the interval, possibly semi-infinite or infinite. Unlike the classical case, the spectrum may no longer consist of just a countable set of eigenvalues, but may also contain a continuous part. In this case the eigenfunction expansion involves an integral over the continuous part with respect to a spectral measure, given by the Titchmarsh–Kodaira formula. The theory was put in its final simplified form for singular differential equations of even degree by Kodaira and others, using von Neumann's spectral theorem. It has had important applications in quantum mechanics, operator theory and harmonic analysis on semisimple Lie groups.

In mathematical analysis, the final value theorem (FVT) is one of several similar theorems used to relate frequency domain expressions to the time domain behavior as time approaches infinity. Mathematically, if in continuous time has (unilateral) Laplace transform , then a final value theorem establishes conditions under which Likewise, if in discrete time has (unilateral) Z-transform , then a final value theorem establishes conditions under which

<span class="mw-page-title-main">Anatoly Karatsuba</span> Russian mathematician (1937–2008)

Anatoly Alexeyevich Karatsuba was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.

The distributional learning theory or learning of probability distribution is a framework in computational learning theory. It has been proposed from Michael Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert Schapire and Linda Sellie in 1994 and it was inspired from the PAC-framework introduced by Leslie Valiant.

In condensed matter physics and physical chemistry, the Lifshitz theory of van der Waals forces, sometimes called the macroscopic theory of van der Waals forces, is a method proposed by Evgeny Mikhailovich Lifshitz in 1954 for treating van der Waals forces between bodies which does not assume pairwise additivity of the individual intermolecular forces; that is to say, the theory takes into account the influence of neighboring molecules on the interaction between every pair of molecules located in the two bodies, rather than treating each pair independently.

In mathematics and theoretical computer science, analysis of Boolean functions is the study of real-valued functions on or from a spectral perspective. The functions studied are often, but not always, Boolean-valued, making them Boolean functions. The area has found many applications in combinatorics, social choice theory, random graphs, and theoretical computer science, especially in hardness of approximation, property testing, and PAC learning.

References

  1. Conway, J. B. (1995), Functions of One Complex Variable I, 2nd ed., springer.com: Springer, ISBN   0-387-90328-3
  2. 1 2 3 Dupuy, Taylor. "Hadamard's Theorem and Entire Functions of Finite Order — For Math 331" (PDF).
  3. Kupers, Alexander (April 30, 2020). "Lectures on complex analysis" (PDF). Lecture notes for Math 113., Theorem 12.3.4.ii.
  4. 1 2 Conway, John B. (1978). Functions of One Complex Variable I. Graduate Texts in Mathematics. Vol. 11. New York, NY: Springer New York. doi:10.1007/978-1-4612-6313-5. ISBN   978-0-387-94234-6. Chapter 11, Theorems 3.6, 3.7.

Notes

  1. so that , then we can use the bound to get
  2. That is, we fix some yet-to-be-determined constant , and use " is large" to mean .