In mathematics, in the area of complex analysis, Carlson's theorem is a uniqueness theorem which was discovered by Fritz David Carlson. Informally, it states that two different analytic functions which do not grow very fast at infinity can not coincide at the integers. The theorem may be obtained from the Phragmén–Lindelöf theorem, which is itself an extension of the maximum-modulus theorem.
Carlson's theorem is typically invoked to defend the uniqueness of a Newton series expansion. Carlson's theorem has generalized analogues for other expansions.
Statement
Assume that f satisfies the following three conditions: the first two conditions bound the growth of f at infinity, whereas the third one states that f vanishes on the non-negative integers.
f(z) is an entire function of exponential type, meaning that
\( |f(z)|\leq Ce^{{\tau |z|}},\quad z\in {\mathbb {C}} \)
for some real values C, τ.
There exists c < π such that
\( |f(iy)|\leq Ce^{{c|y|}},\quad y\in {\mathbb {R}} \)
f(n) = 0 for any non-negative integer n.
Then f is identically zero.
Sharpness
First condition
The first condition may be relaxed: it is enough to assume that f is analytic in Re z > 0, continuous in Re z ≥ 0, and satisfies
\( {\displaystyle |f(z)|\leq Ce^{\tau |z|},\quad \operatorname {Re} z>0} \)
for some real values C, τ.
Second condition
To see that the second condition is sharp, consider the function f(z) = sin(πz). It vanishes on the integers; however, it grows exponentially on the imaginary axis with a growth rate of c = π, and indeed it is not identically zero.
Third condition
A result, due to Rubel (1956), relaxes the condition that f vanish on the integers. Namely, Rubel showed that the conclusion of the theorem remains valid if f vanishes on a subset A ⊂ {0, 1, 2, …} of upper density 1, meaning that
\( {\displaystyle \limsup _{n\to \infty }{\frac {\left|A\cap \{0,1,\cdots ,n-1\}\right|}{n}}=1.} \)
This condition is sharp, meaning that the theorem fails for sets A of upper density smaller than 1.
Applications
Suppose f(z) is a function that possess all finite forward differences Δ n f ( 0 ) {\displaystyle \Delta ^{n}f(0)} \Delta ^{n}f(0). Consider then the Newton series
\( g(z)=\sum _{{n=0}}^{\infty }{z \choose n}\Delta ^{n}f(0) \)
with \( {z \choose n} \) is the binomial coefficient and \( \Delta ^{n}f(0) \) is the n-th forward difference. By construction, one then has that f(k) = g(k) for all non-negative integers k, so that the difference h(k) = f(k) − g(k) = 0. This is one of the conditions of Carlson's theorem; if h obeys the others, then h is identically zero, and the finite differences for f uniquely determine its Newton series. That is, if a Newton series for f exists, and the difference satisfies the Carlson conditions, then f is unique.
See also
Newton series
Mahler's theorem
Table of Newtonian series
References
F. Carlson, Sur une classe de séries de Taylor, (1914) Dissertation, Uppsala, Sweden, 1914.
Riesz, M. (1920). "Sur le principe de Phragmén–Lindelöf". Proceedings of the Cambridge Philosophical Society. 20: 205–107., cor 21(1921) p. 6.
Hardy, G.H. (1920). "On two theorems of F. Carlson and S. Wigert" (PDF). Acta Mathematica. 42: 327–339. doi:10.1007/bf02404414.
E.C. Titchmarsh, The Theory of Functions (2nd Ed) (1939) Oxford University Press (See section 5.81)
R. P. Boas, Jr., Entire functions, (1954) Academic Press, New York.
DeMar, R. (1962). "Existence of interpolating functions of exponential type". Trans. Amer. Math. Soc. 105 (3): 359–371. doi:10.1090/s0002-9947-1962-0141920-6.
DeMar, R. (1963). "Vanishing Central Differences". Proc. Amer. Math. Soc. 14: 64–67. doi:10.1090/s0002-9939-1963-0143907-2.
Rubel, L. A. (1956), "Necessary and sufficient conditions for Carlson's theorem on entire functions", Trans. Amer. Math. Soc., 83 (2): 417–429, doi:10.1090/s0002-9947-1956-0081944-8, JSTOR 1992882, MR 0081944, PMC 528143, PMID 16578453
Undergraduate Texts in Mathematics
Graduate Studies in Mathematics
Hellenica World - Scientific Library
Retrieved from "http://en.wikipedia.org/"
All text is available under the terms of the GNU Free Documentation License
