Carlson's theorem

Carlson's theorem
Name	Carlson's theorem
Field	Complex analysis, Mathematical analysis
Introduced	1914
Founder	Fritz Carlson
Notable for	Uniqueness theorem for entire functions of exponential type

Carlson's theorem is a uniqueness result in Complex analysis that gives conditions under which an entire function of controlled growth vanishing on the nonnegative integers must be identically zero. The theorem sits at the intersection of Entire function theory, Fourier transform methods, and classical results of Karl Weierstrass, G. H. Hardy, Rolf Nevanlinna, and John Edensor Littlewood. It is a tool frequently invoked alongside the Phragmén–Lindelöf principle, the Paley–Wiener theorem, and the Hadamard factorization theorem in problems about analytic continuation and uniqueness.

Statement

Carlson's theorem asserts: if f is an entire function of exponential type at most τ and satisfies growth bounds along the imaginary axis together with f(n)=0 for every nonnegative integer n, then f is identically zero provided the growth parameter meets a specific threshold. Typical hypotheses invoke bounds such as |f(iy)| = O(e^{c|y|}) for c<π and exponential type ≤π, with zeros at 0,1,2,3,...; under these hypotheses the conclusion f≡0 follows. Variants replace the arithmetic sequence {0,1,2,...} by other discrete sets tied to Dirichlet series or sampling lattices; alternative formulations relate to boundedness on Hamburger moment problem contours or to interpolation theorems of Leonard Euler-type sequences.

Historical background

The theorem was proved by Fritz Carlson in the context of early 20th-century research on entire functions and moment problems, contemporaneous with work by G. H. Hardy, S. N. Bernstein, and Rolf Nevanlinna. Carlson's result addressed uniqueness questions raised in studies of power series, Dirichlet series, and the inversion of the Laplace transform. Subsequent developments linked the theorem with classical contributions by Edmund Landau, Jacques Hadamard, and Einar Hille, while later expositions by E. C. Titchmarsh and B. Ya. Levin placed Carlson's theorem within a systematic treatment of functions of exponential type. The theorem has been cited in investigations originating from problems posed in Royal Society-era mathematical physics and number theory, including analyses tied to Bernhard Riemann and to uniqueness conditions in analytic continuation encountered by Godfrey Harold Hardy and John Edensor Littlewood.

Proofs and methods

Proofs of Carlson's theorem typically blend contour integration, growth estimates, and factorization techniques. Standard approaches employ the Phragmén–Lindelöf principle to control function growth in sectors, use canonical products from the Weierstrass factorization theorem to encode zero sets, and apply the Paley–Wiener theorem to relate exponential type to support properties of Fourier transforms. Alternative proofs harness the theory of Hardy spaces, the Poisson summation formula, or transform the problem to one about boundedness of associated Dirichlet series on vertical lines, invoking methods developed by Harald Bohr and Landau for analytic continuation. Modern expositions sometimes reduce the theorem to interpolation results in Bernstein spaces or use de Branges space techniques inspired by Louis de Branges.

Applications

Carlson's theorem finds applications in diverse areas of analysis and applied mathematics. It is used to establish uniqueness in interpolation problems tied to the Paley–Wiener theorem and in proofs of exponential-type sampling theorems relevant to Norbert Wiener-style signal processing. In analytic number theory, the theorem underpins uniqueness assertions for certain Dirichlet series arising in Bernhard Riemann-type investigations and furnishes tools for controlling entire functions appearing in the study of -style problems. In spectral theory, Carlson-type uniqueness aids in inverse spectral problems connected to Sturm–Liouville theory and to reconstruction of potentials from discrete spectral data, linking to work by Mark Krein and Israel Gohberg. Applied contexts include control of growth for solutions in mathematical physics settings examined by Einar Hille and Marshall Stone.

Generalizations and related results

Several generalizations relax the discrete zero set, alter growth bounds, or replace exponential type constraints with membership in function spaces. The Pólya theorem and the Phragmén–Lindelöf principle give complementary uniqueness statements; the Mittag-Leffler theorem and the Hadamard factorization theorem describe canonical products connected to Carlson-type hypotheses. Extensions by M. Riesz and B. Ya. Levin allow noninteger node sets or address functions with prescribed indicator diagrams; de Branges space generalizations by Louis de Branges recast uniqueness within Hilbert space frameworks. Results by Torsten Carleman and Nikolai M. Korobov provide alternate conditions for determination of entire functions from discrete data, while work by J. D. Buckholtz and Akhiezer explores relations to moment problems and orthogonal functions.

Examples and counterexamples

Concrete examples illustrate the sharpness and limits of Carlson's theorem. The sine function scaled to have zeros at the integers shows the role of exponential type π: sin(πz) vanishes on Z yet has type π, demonstrating that relaxing type bounds can fail uniqueness. Functions constructed via canonical products with prescribed growth provide counterexamples when the growth constant meets or exceeds critical thresholds. In contrast, entire functions of smaller exponential type that vanish on the nonnegative integers can be shown to be zero by direct application of Carlson's hypotheses. Explicit constructions by Fritz Carlson and later analysts yield families that delineate the boundary between uniqueness and nonuniqueness, informing both theoretical exploration and practical uses in interpolation and reconstruction.

Category:Complex analysis