Carlson's Theorem
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, in the area of
complex analysis Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates Function (mathematics), functions of complex numbers. It is helpful in many branches of mathemati ...
, Carlson's theorem is a
uniqueness theorem In mathematics, a uniqueness theorem, also called a unicity theorem, is a theorem asserting the uniqueness of an object satisfying certain conditions, or the equivalence of all objects satisfying the said conditions. Examples of uniqueness theorems ...
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 In mathematics, the maximum modulus principle in complex analysis states that if ''f'' is a holomorphic function, then the modulus , ''f'' , cannot exhibit a strict local maximum that is properly within the domain of ''f''. In other words ...
. Carlson's theorem is typically invoked to defend the uniqueness of a
Newton series A finite difference is a mathematical expression of the form . If a finite difference is divided by , one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the ...
expansion. Carlson's theorem has generalized analogues for other expansions.


Statement

Assume that satisfies the following three conditions: the first two conditions bound the growth of at infinity, whereas the third one states that vanishes on the non-negative integers. * is an
entire function 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 fin ...
of
exponential type In complex analysis, a branch of mathematics, a holomorphic function is said to be of exponential type C if its growth is bounded by the exponential function ''e'C'', ''z'', for some real-valued constant ''C'' as , ''z'',  → ∞ ...
, meaning that , f(z), \leq C e^, \quad z \in \mathbb for some real values , . * There exists such that , f(iy), \leq C e^, \quad y \in \mathbb * for any non-negative integer . Then is identically zero.


Sharpness


First condition

The first condition may be relaxed: it is enough to assume that is analytic in , continuous in , and satisfies , f(z), \leq C e^, \quad \operatorname z > 0 for some real values , .


Second condition

To see that the second condition is sharp, consider the function . It vanishes on the integers; however, it grows exponentially on the imaginary axis with a growth rate of , and indeed it is not identically zero.


Third condition

A result, due to , relaxes the condition that vanish on the integers. Namely, Rubel showed that the conclusion of the theorem remains valid if vanishes on a subset of
upper density In number theory, natural density (also referred to as asymptotic density or arithmetic density) is one method to measure how "large" a subset of the set of natural numbers is. It relies chiefly on the probability of encountering members of the de ...
1, meaning that \limsup_ \frac = 1. This condition is sharp, meaning that the theorem fails for sets of upper density smaller than 1.


Applications

Suppose is a function that possesses all finite
forward difference A finite difference is a mathematical expression of the form . If a finite difference is divided by , one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the ...
s \Delta^n f(0). Consider then the
Newton series A finite difference is a mathematical expression of the form . If a finite difference is divided by , one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the ...
g(z) = \sum_^\infty \Delta^n f(0) with is the
binomial coefficient In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom. It is the coefficient of the t ...
and \Delta^n f(0) is the -th
forward difference A finite difference is a mathematical expression of the form . If a finite difference is divided by , one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the ...
. By construction, one then has that for all non-negative integers , so that the difference . This is one of the conditions of Carlson's theorem; if obeys the others, then is identically zero, and the finite differences for uniquely determine its Newton series. That is, if a Newton series for exists, and the difference satisfies the Carlson conditions, then is unique.


See also

*
Newton series A finite difference is a mathematical expression of the form . If a finite difference is divided by , one gets a difference quotient. The approximation of derivatives by finite differences plays a central role in finite difference methods for the ...
*
Mahler's theorem In mathematics, Mahler's theorem, introduced by , expresses continuous ''p''-adic functions in terms of polynomials. Over any field of characteristic 0, one has the following result: Let (\Delta f)(x)=f(x+1)-f(x) be the forward difference operat ...
*
Table of Newtonian series In mathematics, a Newtonian series, named after Isaac Newton, is a sum over a sequence a_n written in the form :f(s) = \sum_^\infty (-1)^n a_n = \sum_^\infty \frac a_n where : is the binomial coefficient and (s)_n is the falling factorial. N ...


References

* F. Carlson, ''Sur une classe de séries de Taylor'', (1914) Dissertation, Uppsala, Sweden, 1914. * , cor 21(1921) p. 6. * * 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. * * * {{citation, mr=0081944, last=Rubel, first=L. A., title=Necessary and sufficient conditions for Carlson's theorem on entire functions , journal=Trans. Amer. Math. Soc., volume=83, issue=2, year=1956, pages=417–429, jstor=1992882 , doi=10.1090/s0002-9947-1956-0081944-8, pmc=528143, pmid=16578453 Factorial and binomial topics Finite differences Theorems in complex analysis