This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
(x) is only continuous from the right; both functions are non -decreasing and satisfy the relations
(+ oo) = a1 � 1, 1p(+ oo ) = b � 1. It is therefore possible to define two distribution functions by normalizing . Similarly we see that is an entire function of order p = oc/(oc - 1 ) and type (oc - 1 )oc-a/(rx- 1>. The determinations of the order and type of the entire functions and were carried out for the functions associated with the densities Prxy ( x), that is for the case A == 1 . Similar results can also be obtained if A # 1 . Expansions analogous to (5 . 8. 8a) and (5. 8.8b) can be derived easily ; let a�> (A) and b�> (A) be the coefficients in these series. It follows from (5 .8.2b) that a�> (;t) = a�> Ak, while b�> (;t) = b�> A- k/rx. We conclude from (5 .8. 1 2a) and (5 .8. 1 2b) that the order of the entire functions associated with oc, y, A) is given by p = ( 1 - oc) -1 if 0 < oc < 1 but by p == oc(oc - 1 ) - 1 if 1 < oc � 2. The type 1: = AP (1 - oc)rx/ ( 1 -cx> for 0 < oc < 1 , but 1: = A -p/ct (oc - 1 )oc -rx/(ct-1> in the case where 1 < oc � 2. It follows easily that the function is also an entire function of order p = rx(oc - 1 ) - 1 and type 7: = A - p/rx (oc - 1 )oc-ct/(ct- n . We still have to consider the case ex = 1 . Since the representation (5 .7.2 1 ) is not valid for oc = 1 we must use the canonical form (5 .7. 1 9) as our starting-point. If fJ = 0 we have f = exp I I) ; this is the characteristic function of the Cauchy distribution, and the corresponding frequency function<*> is
a
1
1
-
b
1,heorem 1.1.2. Every distributionfunction F(x) can be decomposed according to F(x) a 1Fd(x) bFc(x) . Flere Fd(x) and F0(x) are both distribution functions. F0(x) is continuous for wh£le Fa( ) is a step function. The coefficients a1 and b satisfy the relations a � 1, 0 � b � 1, a 1 b 1. =
all .x
() �
L
x
+
+
=
l!"t�(x) is called the discontinuous (discrete) part, and Fc(x) is called the c·ontinuous part of F(x). We note an hnmediate consequence of theorem 1.1.1
:
d F (x) J])
There exists an enumerable set D such that T
a
=
1. Here
4
CHARACTERISTIC FUNCTIONS
and in the following the integral is a Lebesgue-Stieltjes integral. The function F0(x) is continuous but has not necessarily a derivative at all points; however, every distribution function has a derivative almost every where (in the sense of Lebesgue measure). A further decomposition can be obtained by means of more powerful tools of analysis. Applying Lebesgue's decomposition theorem [see Loeve (1963)] one can show that it is possible to determine two distribution functions Fac(x) and F8(x) such that (1.1.7)
where
b1
� 0,
b2
=
J�
F�c(Y) d . Moreover
� 0,
b1 +b2
=
1.
The function Fac(x) can be represented as the integral of its derivative,
Fac(x)
-oo
y
J
N
dFac(x)
=
0 if N is a set of Lebesgue
measure zero. Such a distribution function is said to be absolutely con tinuous. The distribution function F8(x) is a continuous function whose derivative is almost everywhere equal to zero; moreover there exists a set N of Lebesgue measure zero such that
J
N
dF8(x)
=
1. A distribution
function with this property is called a singular distribution. Combining (1.1.7) and ( 1 . 1 . 6) we obtain the following
Theorem 1.1.3. Every distribution function F(x) can be decomposed uniquely according to (1.1.8)
Here Fd(x), Fac(x), Fs(x) are three distribution functions. The functions Fac(x) and Fs(x) are both continuous; however Fac(x) is absolutely continuous while F s(x) is singular and Fd(x) is a step function. The coefficients a1, a2, a3 satisfy the relations a1 0, a2 0, a3 0, a1 +a2+a3 �
�
�
=
1.
The distribution functions Fa(x), Fac(x), F8(x) are called the discrete, the absolutely continuous, and the singular parts, respectively, of F(x). A distribution function is said to be pure if one of the coefficients in the representation (1.1.8) equals 1. For pure distributions we will use the = 1, absolutely continuous distri expressions discrete distribution if = 1, and singular distribution if bution if = 1. In applications one almost inevitably encounters either discrete or absolutely continuous distributions. Singular distributions are interesting from a theoretical viewpoint but hardly ever occur in practical work. This is the reason why statistical texts frequently refer to absolutely continuous distributions as continuous distributions and seemingly ignore the existence of singular distributions.
a2
a1
a3
INTRODU CTION
Let F( x) be an absolutely continuous distribution function. Then (1 . 1 .9)
F(x)
=
5
J�oo F'(y)dy
where the integral is supposed to be a Lebesgue integral. The derivative p ( x) = F'(x) is called the frequency function<*> of the distribution F(x). From the definition of a distribution function it follows that every function p(x) which satisfies the conditions for all x, p(x) � 0 (1 . 1 . 10) p(x) x = 1
Joo oo d
is the frequency function of an absolutely continuous distribution function which is given by ( 1 . 1 .9) . 1.2
Examples of distribution functions
In this section we list a number of important distributions which occur frequently in practical work. For the sake of brevity we refrain from describing mathematical models which lead to these distributions.
Discrete distributions.
(I) The simplest discrete distribution function is a function which has a single saltus of magnitude 1 at the origin. We denote this function by for x < 0 e( x) = (1 .2. 1 ) for x � 0 . Let � be an arbitrary fixed real number; the function e( x - �) is then a distribution function. It has a single discontinuity point at x = � and the magnitude of the saltus at this point is 1 . The distributions e ( x - �) are called "degenerate' ' (or "improper") distributions. The most general purely discrete distribution function is determined by the location of its discontinuity points and by the magnitude of the corres ponding jumps. Let {�1} be a sequence which contains all discontinuity points of F(x) and let Pi be the saltus at the point �1• The corresponding distribution function is then given by (1.2.2) F(x) = � pis(x-�3)·
{�
j
llere the �3 are real numbers and the p3 satisfy the relations (1.2.3) Pi�o, �P1 = 1 . j
In �rable 1 we present some discrete distribution functions. The Pascal
distribution as well as the geometric distribution are particular cases of the (•) The
l�xprcssion "probability density function" or "density
for "frequency function".
funct ion''
is often used
6
CHARACTERI STIC FUNCTIONS
r
negative binomial distribution. The Pascal distribution is obtained if is a positive integer, the geometric distribution if r = 1 . In the examples given in Table 1 the discontinuity points are consecutive non-negative integers. Table 1
Discrete distributions --- �
i
Name
gj
Binomial
j
gj
Hypergeometric
j
gj
Geometric
j
gj
Pascal
j
gj
Negative binomial
Poisson
j
l·gj
j
Saltus at gi
Discontinuity point g; = =
= =
=
=
=
=
=
=
=
=
0, 1, 2,
. .,n .
(�(��7) (� p qi
j 0, 1' 2, . . . ' min (M, n)
j
0, 1' 2, . .. ' ad.
inf.
j
0, 1' 2, ... ' ad.
inf.
j
0, 1' 2, . . . ' ad.
j
inf.
0, 1' 2, ...
ad.
inf.
Conditions on parameters -�---
(;)pi qn-J
j
0
p
<
1,
q
=
1-p
N>M N>m -
0
r
pr
( /)< -q)J
r
J.
<
N, M, n positive integers
( /)< -q)i
'A.i
,
n positive integer
pr
e-A. -'
�---
0
0
<
p
<
1,
q q
=
1-p
positive integer <
p
<
1,
q
real, r> 0 <
p
<
1,
=
1 -p
=
1-p
A> 0
.
A discrete distribution is called a "lattice distribution" if its discon tinuity points form a (proper or improper) subset of a sequence of equi distant points. We sometimes refer to the discontinuity points of such a distribution as lattice points. They have the form a+ (a, constant, > 0; .i integer) . The constant is called a "span" of the lattice distri bution. The distributions of Table 1 are all lattice distributions which have the origin as a lattice point.
d
d
Absolutely continuous distributions.
jd d
(II) These distributions are deter mined by their frequency function p(x). 'fhe distribution function can be obtained by integration :
(1.2.4)
F(x)
=
r<J)p(y)dy.
7
INTRODUCTION
p(y)
satisfies the relations ( 1 . 1 .10) which correspond to The function (1 .2.3) . In Table 2 we list a few frequency functions. The normal distribution is often called the Gaussian distribution. In the French literature it is referred to as the "law of Gauss-Laplace" or "the law of de Moivre-Laplace" or the "second law of Laplace" . This last terminology is used to distinguish it from the "first law of Laplace" which is called the "Laplace distribution" in Table 2. Table 2 Frequency functions
Name of Distribution
Conditions on parameters
Frequency function p(x)
1/2r 0
Rectangular distribution (Uniform distribution)
a, r real r>0
lx-aj
if if
( r- l x-aj)jr 2
a, r real lx-al
Triangular distribution (Simpson's distribution)
if if
-
[-
J
- - --------·
Cauchy distribution
l
--
--- ------
1
------ ----
1j[TT(1+x2) ] or more generally
-
-
1
-------
...
8, p. real 8>0
-oo<x
------- ·------
(hunma distribution
llctu distribution
]
[
8
-
J
;.
l
------- ---
8A. A.-1 e-Oro -x 8, A real for x > 0 r(A ) for x< 0 8 > 0, A > 0 0 - - -- -- - -- ---- -- - --- -- ------- ---------- -
-
r(p + q)
r(p) r(q)
0
-
-
-
xP-1(1-x)q-l
for 0 <x < 1 otherwise
p,
q
real
p > 0, q > 0
8
CHARACTERISTIC FUNCTIONS
Two particular cases of the gamma distribution are of interest: for A = 1 one obtains the exponential distribution, while the choice (} = �' it = n/2 (n integer) yields the chi-square distribution with n degrees of freedom which is of great importance in mathematical statistics. We note also that the Cauchy distribution is a particular case (n = 1 ) of Student' s distribution. The Beta distribution with parameters = q = ! is called the Arc sine distribution.
p
(III) Singular distributions. We give only one example of a singular distribution; this example is closely related to Cantor ' s ternary set defined over the closed unit interval V = [0, 1 ] . The Cantor set Tis constructed by means of a step-by-step procedure. In the first step we remove from V the open interval (l, �). In the second step two open intervals (�, �) and (�, �) are removed from V. From each of the remaining 4 closed intervals the middle (open) interval of length (�)3 is deleted in the third step and this process is continued indefinitely. Let each of the (k - 1 ) numbers c1, c2, , ck-I assume either the value 0 or the value 1 ; we denote by A2C:t.2c2, 2ck-l the open interval with initial point •
•
•
• • • •
•
k-1
2
1
2
2
- c,+ k -�3: :J 3
3=1
and terminal point
k-1
j}:,.l 3;
C; + k' 3
Our procedure consists then in removing in the kth step the 2k-I open intervals A2c1,2c2, 2ck-l of length (�)k. The Cantor set T is obtained from the closed interval V by removing a denumerable number of open intervals. It is easily seen t�at the points of T can be characterized in the following manner. Write each number x, 0 x � 1 , in the triadic system • . • •
X =
�
a1/3 +a2/3 2 + .. . +an/3n +...;
the set T consists of all numbers x which can be written in at least one way in the form of a triadic fraction whose digits are only zeros or twos. The points of therefore have triadic expansions
T
2 2c1/3 +2c2/3 + ... +2cn/3n + ...
. wh ere c1, c2, , en, . . . 1s a sequence o f "0" an d " 1" We introduce the function •
•
•
•
9
INTRODUCTION
Finally we define the function
0 g(x)
(1.2.5)
F(x)
=
£..J �
if X if x
<
E
0
V-
c1 l. f X =� � j
i z;
T
2c, ; E 3
T
if X � 1. It is easily seen that F(x) is a continuous distribution function ; moreover its derivative is zero at all points of while it is not differentiable in the points of The points of are the only points of increase of F(x) and form a set of measure zero. Thus F(x) is a singular distribution function. The singular distribution which we have just discussed has the property that it is constant in the open intervals A201t· 2ck_1• This is, however, by no means typical for singular distribution functions. R . Salem (1943) gave . example of a singular distribution function which is strictly .a simple 1ncreas1ng. 1
T.
T
V- T
• • •
1.3
The method of integral transforms
In this section we introduce a procedure which is very useful in the study of distribution functions. It is frequently advisable to consider, instead of a distribution function F(x), expressions which are derived from this function. These expressions are usually defined as integral transforms using a suitable kernel K(t, x) which is a function of the variable x and contains also a parameter t. The parameter t can be either discrete-for instance integer-valued-or can have a continuous domain of variation. The integral transform is defined by
J'""" K(t, x)dF(x),
( 1 .3. 1 )
provided that the integral (1.3.1) exists as a Lebesgue-Stieltjes integral. 'I he conditions for the existence of this integral are of course always of great interest. We now list a few possibilities for the choice of K(t, x) which are useful in the study of distribution functions. ,
(A) K(t, x) = xt K(t, x) (C) K(t, x)
(B)
=
lxlt x
x(x-1) ... (x- t+ 1) \v ith x<0> = 1. In the preceding three examples the parameter t is restricted to non
negative integers.
(D) K(t, x)
=
= etoo
=
10
(E)
CHARACTERISTI C FUNCTIONS
tx
K(t, x) = (F) K(t, x) = eitx where i = v- 1 . In cases (D), (F) the parameter is a real-valued and continuous variable. To emphasize the discrete character of the parameter in cases (A), (B) and (C) we write k(k = 0, 1 , 2, ...) instead of t. The transforms (A), (B) and (C) then transform the distribution function F(x) into sequences (provided that the integrals exist). We call
(E ) ,
J oo x" dF(x) the algebraic moment of order k of F(x), or more briefly the kth moment of F(x). Similarly oo (1 .3 .3) fJ�o J oo lxl" dF(x) (1.3 . 2)
00
a." =
=
is called the kth absolute moment of F(x). We do not intend to use the kernel (C); it leads to the factorial moments
(E )
f oo
00
x
The kernels (D), and (F) transform the distribution function F(x) into functions of the real variable t. The function (1 .3 .4)
M(t)
=
J:oo tFdF(x)
is obtained by means of the kernel (D) and is called the moment generating function of F(x). The kernel is used only when F(x) is a purely dis continuous distribution which has all its jumps at non-negative integer values of the variable x. In this case we get the probability generating function
(E )
(1 .3 .5) where
Pi
� 0,
00
� p3 j =O
=
1.
Here P; is the saltus of F(x) at the point x = j (j non-negative integer). Probability generating functions were introduced by Laplace; we will use these functions only rarely (in Section 6.3) and mention them here mainly because they were the first integral transforms systematically used in probability theory. Finally we substitute the kernel (F) into ( 1.3 . 1 ); this yields
(1.3.6)
f(i)
=
Joo
-ri)
e""'dF(x).
11
INTRODUCTION
This transform is called the characteristic function<*> of the distribution function and its study is the object of this monograph. It is known [ Cramer (1 946) p. 70] that every bounded and measurable function is integrable with respect to any distribution function over - oo, + oo ). This assures the existence of the characteristic function for every distribution function. We introduced the probability generating function only for a special class of lattice distributions. For this class P( exists, provided 1 . The existence of the moment generating function is not :assured for all distributions. We say that the moment generating function of a distribution exists if the integral 1 .3 . 4 is convergent for all values of belonging to an interval (finite or infinite) which contains the origin. The existence of must be established before it is used. Suppose for the moment that we consider a distribution function for which exists. We will see later [Section 7.1 ] that it is then connected to the characteristic function by the relation
F(x),
((1.3. ) 6
t)
M(t)
ItI � t
M(t) ( 1 . 3 .7) M(it) f(t).
( )
l\1(t)
=
We conclude this introductory chapter by discussing in somewhat greater detail some properties of algebraic and absolute moments which will be needed later. 1.4
Moments
We first note that moments are defined as Lebesgue-Stieltjes integrals. It is known that for these integrals the concepts of integrability and absolute integrability ar e equivalent [see Loeve (1 963) pp . 1 1 9 ff.] . We apply this general property of the Lebesgue-Stieltjes integral to the ex pressions defining the moments and formulate it as
Theorem 1 .4. 1 . The algebraic moment of order k of a distribution function F(x) exists if, and only if, its absolute moment of order k exists. From the properties of the integral and from (1.3. 2) and (1 . 3 .3) we see immediately that for any positive integer k ( 1. 4. 1 ) cx.27c f3 2lc CX.2k-l � lcx.27c-ll fJ21c-1 =
�
while cx.0
=
{30 = 1 .
1,heorem 1.4.2. Let F(x) be a distribution function and suppose that its 1noment cx.1c of order exists. Then the moments cx.8 and f3 exist for all orders
s
�
!?-.
!?-
Formuln (1.3.6) indicates that chnractc;;•ristic fu n ction s c.liatribut.ion functionR.
(*)
s
are
the Fourier transforms of
12
CHARACTERI STIC FUNCTIONS
J:oo lxlkdF(x) exists. Clearly J lxl>l lxlkdF(x) � J lxl>l Jxj8 dF(x) if k. {Jk lxl8 dF(x) is always finite, it follows that {J8 and Since the integral J lxl
According to Theorem 1 .4. 1 , {Jk = �
s
�
exist for all s � k. The moments of a distribution function do not always exist; we give now an example for a distribution which has moments only up to 'a certain order. The function for x < 1 F(x) = 1 - x-m for x > 1
oc,
0{
0
is for m > an absolutely continuous distribution function. An elementary computation shows that rxk = {Jk = mj(m-k) if k < m, while the moments of order equal or greater than m do not exist. As another example we mention Student' s distribution. This distribution has moments up to order (n - 1). For n = 1 this shows that the Cauchy distribution does not possess any moments. It is of interest to know whether a given sequence of real numbers can be the sequence of the moments of a distribution. The discussion of this difficult problem is beyond the scope of this monograph, and we refer the reader to the book of J. A. Shohat-J. D . Tamarkin (1943) . However, we remark that a moment sequence does not necessarily determine a distri bution function uniquely. It may happen that two different distributions have the same set of moments. As an illustration we give the following example. The function exp [-x�-' cos mn] if x > ( ) 1• .Z) Pl X = if X < where ft( cos ft:!t)lfp = c r(l/,u) and 0 < !J < ! is a frequency function. The moments of the corresponding distribution are
{C 0
(4
0 0
(n =
(1.4.3) Let
(1 .4. 4 )
Pax ( ) �
{(._, (1-1()
sin
(x14 sin ,un)] exp [
=-
0, 1, 2, ...).
x14
cos �tn]
if
if
x >
X <
0
0.
13
INTRODUCTION
(1925), vol. 1, pp. 114 and 286] that for O <�t
=
=
1Xn =
.
=
The existence of the moments of a distribution function depends on the behaviour of this function at infinity. We give here, without proof, a sufficient condition for the existence of moments.
Theorem 1.4.3. Let F(x) be a distribution and assume that for some integer k 1 - F(x) + F(-x) O(x-k) as x Then the moments of any order s k exist. For the meaning of the symbol 0 we refer the reader to Appendix A. A proof of theorem 1. 4 . 3 may be found in Cramer (1946). =
�
<
oo .
Table 3 Moments
Formula for moments rx.1c and f31c
Name of distribution Rectangular distribution with a= 0
rx.2k- 1
Laplace distribution
fXk
Exponential distribution Gamma distribution -
-------
1
=
rx�c =
=
/3k
{31c
0, rx.2lc =
=
(2k) !, /3k
=
=
k!
8-k
k!
0-1c
.\(.\+1) ... (A+k-1)
-------
Normal distribution with p. = 0, a = 1 ""··---------
----- ---
Student's distribution (n degrees of freedom)
1
---- ------
rx.2v-l f32v-l
= =
O, rx.2v
(2v
=
1·3· ... (2v-1)n" (n-2) (n-4) ... (n-2v)
n) 2"n"-1'2 (v-1)! r[(n+l)/2] (n-l)(n-3) ... (n-2v +1) r(t) r(n/2) (2v-1 < n) <
, ,•
.,
c
•
-
•
r
�� �---�----- - -----
14
CHARACTERISTIC FUNCTIONS
We give several inequalities for absolute moments which supplement the relations (1 .4.1 ). Suppose that the /�th moment of a distribution exists, then (1 .4.6) fJ�-1 � fJ1c-2 fJk• This inequality follows almost immediately from Schwarz' s inequality [see Appendix B or Cramer (1 946)] . By elementary operations we obtain finally from (1 .4.6) the inequalities {11/(k (1 .4.7) k k-1 1) � {11/k or ( 1 .4.8) For a rather wide class of discrete distributions one can obtain recurrence relations for the moments. This class was discussed by Noack (1 950) and contains many important distribution functions such as the binomial, Poisson and negative binomial distributions. Recurrence formulae for the moments of singular distributions (especially for the distribution function described in Section 1 .2) were given by G. C. Evans (195 7) . On the pre ceding page we list in Table formulae for the moments of a few common absolutely continuous distributions. '-':
3
2 P RE L IM I N A RY S T U DY O F C HA RAC T E R I S T I C F UN C T I ON S 2.1
Elementary properties of characteristic functions
In the preceding chapter we denoted distribution functions by capital letters, as and the characteristic function of by the corresponding small letter, asf(t). We adhere to this notation throughout this monograph ; if subscripts are used on the symbol for a distribution function then the same subscript is attached to its characteristic function. We defined the characteristic function of a distribution function by
F(x),
F(x)
f(t)
F(x) (1.3.6) f(t) J'" ro eiw dF(x). The properties of characteristic functions, stated in theorem 2.1.1, follow =
immediately from this formula.
Theorem 2.1.1. Let F(x) be a distribution function with characteristic function f(t). Then (i) f(O ) 1 (ii) l f(t) l � 1 (iii) f(-t) J(i). We use here the horizontal bar atop off(t) to denote the complex conjugate of j(t). Theorem 2.1.2. Every characteristic function is uniformly continuous on the whole real line . It follows from (1 .3 .6) that lf(t + h) -f(t)i � fro ro l ei<M - 1 1 dF(x) 2 fro 00 I sin ( xh/2)1 dF(x) =
=
=
so
�
that
l f(t-A+ h) -f(t)l h r 2 - sin � dF(x) + 2 rn
Wc
oo xh xh r+ sin 2 dF(x ) + 2 sin 2 dF(x). J J -A J oo note that the right-hand side of this inequality is independent of t; it is
poHsible to
Htuall
B
the first and the third integral on the right arbitrarily by choosing A 0, B 0 sufficiently large. Moreover , the second n1ake
>
>
16
CHARACTERISTIC FUNCTIONS
h 0
integral on the right can be made arbitrarily small by selecting > sufficiently small, so that the statement is proved. be a distribution function and let a and bbe two real numbers Let and suppose that a > Then b G ( x) = (2. 1 .1)
F(x)
0. F(x : )
is also a distribution function. We say that two distribution functions and G belong to the same type if they are connected by relation (2.1 . 1 ) (with a > More generally, we consider a distribution function and two real numbers and band suppose only that a =1= We define
a
G
(2.1 . 1 a)
x)
F
0).
0.
F(x : b) (x) 1 -F(x : b -0)
if a>
=
if a
<
F(x)
0 0.
Then G( is also a distribution function. A simple change of the variable under the integral defining shows that (2.1 .2) = eit b For a = - 1 and b= we see that g( = is a characteristic function whenever is a characteristic function. , be real numbers such that Let a1 ,
g( t) f(at). 0 f(t) an n
•
•
g( t)
t) f( - t)
a3 �
and let
n
•
0,
� j=l
a3
=
1
F1(x) , . . . , Fn(x) be n distribution functions. Then (x) � a3F3(x) '
G
=
n
j =l
is also a distribution function ; the corresponding characteristic function is n
g(t) � a3 f1( t). Theorem 2.1 .3 . Suppose that the real numbers a1 , , an satisfy the conditions 1 a3 � 0, � a3 and that f1(t), . . . , fn(t) are characteristic functions. Then g(t) � ai .fJ( t) £s also a characteristic function. =
j= l
•
n
j=l
=
=
n
j ""'A 1
As a particular case we obtain the following corollary.
•
•
17
PRELIMINARY STUDY
Corollary to theorem 2.1.3. Let f(t) be a characteristic function; then f(t) as well as Re f(t) are characteristic functions. Here oo R e f(t) Hf(t) + ]{t)] f cos txdF(x) is the real part off(t). =
=
00
We showed in the preceding chapter that any purely discrete distribution can be written in the form ( 1 2 2)
..
j
where the �3 are real while the p3 satisfy the relations 1 Pi � ( 1 .2 3 ) �Pi = .
.
0,
j
The Lebesgue-Stieltjes integral with respect to the distribution function of F(x) ( 1 .2.2) reduces to a sum, so that the characteristic function becomes (2. 1 . 3 )
f(t)
= '}: j
f(t)
P1 e'�1
•
.. If, in particular, F(x) is a lattice distribution then we can write (2. 1 4) �1 = where and are real numbers. The characteristic function of a lattice distribution therefore has the form '}:Pi eitid = (2 . 1 . 5 ) ,
.
a +jd
d f(t) eim where the p3 satisfy (1 .2.3 ) . It is immediately seen that a
j
1(Z::)
=
lefi(2na/d)ll
=
1.
Every lattice distribution F(x) therefore has the following property: there exists a real number t0 =1= such that the modulus of its characteristic assumes the value 1 for = t0• We show next that this function property characterizes lattice distributions. Suppose that the characteristic fu nctio n ( ) of a distribution function F(x) has this property. We assume therefore that there exists a t0 =I= such that lf(t0) l = 1. This means that f(t0) = eitoe for some real � or
0
f(t) ft
t
0
J oo eitomdF(x) e•t.;. 00
=
T t is then easily seen that F(x) satisfies the relation
(2.1 .6)
J:
[ 1 - cos t0(x - �)] dF(x) 00
=
0.
-
Since the function 1- cos t0(x- �) is continuous and non-negative, (2. 1 .6)
18
CHARACTERISTIC FUNCTIONS
F(x)
can hold only if is a purely discontinuous distribution whose dis continuity points are contained in the set of zeros of the function 1 -cos ( - . The discontinuity points of have then necessarily the form integer) so that is a lattice distribution. We therefore + have the following result.
F(x) t0� x �) (2:n/t0)s (s F(x) Theorem 2.1.4. A characteristic function f(t) is the characteristic function of lattice distribution if, and only if, there e xists real t0 0 such that l f(t o) l = 1. a
a
=!=
Table 4 (*)
Characteristic functions
--------�--
-- ·------ --------- -
------· ------
J 00
Characteristic function
Name of distribution function F(x)
f(t) =
00
eit� dF(x)
Degenerate distribution £(x- g) Binomial distribution
---- -------- -----------{p[1
-
Negative binomial distribution
_
q
eit] -1 }r
Poisson distribution
exp {A(eit -1)}
Rectangular distribution
eita sin tr tr
Laplace distribution
------- 1 ------- -------Normal distribution
e-ltl
or more generally exp [i�-tt- 01 t IJ.
Cauchy distribution ------ ----· ·
-
t
-------
Gamma distribution
---------------- --- --- -----tFt(P, p+ q, it) = Beta distribution(t) rJ 1!_± 9) � - -- ---·�(!!_ +i) (it)1 r(p)
.1= 0
r(p+q+j)r (j + 1)
conditions on tlu� parnnH�h�rs Ht'l' Htah.·d in 1,nhle 2 for d iHcn�h� diRt rihut ionB und in 'l'nbh� 3 fnl' nbhohth·ly COli( inuoUH <. liHt:rihutionH. Wl� dl�IIO(t• IH'I'l' , ,, hy (\Xp rAJ. (l) 1}?1 (a� b, .0') in tlu� conHut
(*') 'l'hl·
19
PRELIMINARY STUDY
l f(t) l
Theorem 2.1 .4 implies that < 1 almost everywhere, provided that is the characteristic function of a non-degenerate distribution. Suppose that < 0, then [f(t)] a cannot be a characteristic function. This remark leads to the following corollary. 1 2. 1.4.
f(t)
a Corollary to theorem The only characteristic functions whose reciprocals are also characteristic functions belong to degenerate distributions. We obtain easily from theorem 2. 1.4 the following corollary : Corollary 2 to th�orem 2. 1.4. If a characteristic function f(t) has the property that for two incommensurable real values t1 and t2 the relations 1 /(tl) l l f(t2) 1 1 hold, then l f(t) l 1. ==
==
=
On the preceding page we listed in tabular form the characteristic functions of some of the distributions given in Tables 1 and In Section 1.2 we constructed [see (II I)] a singular distribution function. It can be shown that the characteristic function of this distribution is given by .. (2. 1.7) = lim cos !... . 33 For details and further examples of characteristic functions of singular distributions we refer the reader to papers by B. }essen-A. Wintner Wintner (1936), R. Kershner (193 6), and the thesis of M. Girault (1954).
2.
f(t) ei t1 2 i=ITl n-+ oo
(1935),
A.
2.2
Lebesgue decomposition of characteristic functions
The decomposition theorem 1. 1.3 induces immediately a decomposition of the characteristic function. Every characteristic function can be written in the form = (2. 2 . 1) = 1. Here fd(t), f c (t) and fs(t) with � 0 and � 0, � 0, a respectively are characteristic functions of (purely) discrete, absolutely continuous and singular distributions. For a pure distribution one of the coefficients is equal to 1 while the other two are zero. We add a few remarks concerning characteristic functions of a pure type. (A) If = 1 then ( ) is the characteristic function of a (purely) discrete distribution. It follows from (2. 1.3) that /( is almost periodic<*> so that lim sup = 1.
f(t)
f(t) al fd(t) + a2 fac(t) + aa fs(t) a 1 + a 2 + a3 a1 a 2 a 3 a1 , a 2 , a 3 a1 ft t) l f(t) l (B) If a 2 1 then f( t ) belongs to an ab�olutely continuous distribution. It follows from the Riemann- Lebesgue lemma [see Titchmarsh (1939) p. 403] that lim f(t) 0. =
! tl �oo
=
( "" ) Sec I-1. Bohr ( 1 932), (1 947).
l tl-+oo
20
CHARACTERISTIC FUNCTIONS
a3
(C) If = 1 thenf(t) is the characteristic function of a singular distribu tion. In this casef(t) does not necessarily go to zero as I t I tends to oo. Thus = lim sup lf(t) l
L
ltl-+ oo
1. (1954
may be any number between zero and In fact, examples are known where assumes the value zero [Girault )] . An example<*> of a characteristic function of a singular distribution for which = 1 was communicated to the author by A. Wintner. Another example is due to C. G. Esseen Singular distributions for which equals 1 or 0, or a number between 0 and were given by L. Schwartz ( 1 . The behaviour of the characteristic function at infinity permits therefore some inference concerning its type. For instance, if lim sup 1/( l = 0,
L
L
(1944).
L951)
1,
t)
ltl-+ 00
t
th en f( ) belongs to a continuous distribution.
2.3 Characteristic functions and moments There is a close connection between characteristic functions and moments. In order to discuss this relation we introduce the following notation. Let be an arbitrary function ; we define its first (central) difference with respect to an increment by
h(y)
t
h(y) = Llt h(y) = h(y + t)-h(y- t) and the higher differences by L\�+1 h(y) = L\t L\� h(y), for k = 2, . . . . It can be shown by induction that (2.3 . 1 ) �! h( y) = .,i:"o ( - 1)k (�) h [y+ (n - 2k)t]. In particular, for the function h(y) = e � we have (2.3 .2) Ll� e xv = eixv(em - ) = e�'�� [2i sin xt]». Theorem 2.3.1. Let f(t) be the characteristic function of a distribution function F(x) , and let Ll�
1,
i
e- ixt n
i
(•) Let f(t)
=
00
II cos n ::=: l
(t/n I) ;
[theorem 1 1] that f(t) belongs k it ia easily aecn that t lin1 a up I CI---. «J
I f (t) I
•
1 . (Fo1· the
u
it follows from a result of B. }essen-A. Wintner (1 935) to a purely singular distribution . Moreover, for integer
-/(27Tk l)
•
0(
� k l 1/n l 1) n-k+ l tnt'onin K of the aymbola 0 and co
= o(l ) o sec
as
k -+
Appendix
oo ,
A.)
so
that
21
PRELIMINARY STUDY
be the (2k)th (central) difference quotient off( t) at the origin. Assume that (O) � f k 4 f . M lim in (2t) 2k Then the (2k)th moment (X2k of F(x) exists, as do all the moments1 (X8 of order s < 2k. Moreover the derivatives J<8>( t) exist for all t and for s , 2, . . . , 2k and (s 1 , 2, . . . , Zk) so that (Xs i- s J(s)(O) . =
<
�0
oo
=
=
=
From the assumptions of the theorem it is seen that there exists a finite constant M such that
(2.3 .3 )
lim inf �d(O)
t�
(2t) 2k
=
M.
It follows from (2.3 .2) that
11J.f(y) J'"' e (2i sin xt) 2k dF(x). The difference quotient at the origin is then oo f (sin xt) 2k dF(x). ��k f(O) t (2t)2k We see therefore from (2.3 .3) that ( sm xt) 2k f M lim inf t dF(x) and hence that ( sin xt) 2"' b x 2"' dF(x) b J J M � lim inf dF(x) t t� for any finite a and b. It follows then that the (2k)th moment J x2"' dF(x) exists and that M � Let s be a positive integer such that s < 2k ; then it follows from theorem 1 .4.2 that the moments fls and exist for s 2, . ' 2k. 1 , 2, . . . , 2k) we see immeFrom the existence of the moments ( s diately that J : oo x' eit.: dF( x) exists and converges absolutely and uniformly =
00
1�
=
- 00
=
•
oo
H-0
- oo
=
-a
-a
. .
oc 2 k .
ot 2"'
=
oo
00
oc8
oc8
= 1,
=
for all real t and s :( 2k. It follows from a well-known theorem [see for instance Cramer ( 1 946), pp . 67-68] th at all derivatives up to order 2k exist
22
CHARACTERISTIC FUNCTIONS
and are obtained by differentiating under the integral sign. This proves theorem 2.3 . 1 . If a characteristic function has a derivative of even order, then the con ditions of theorem .3 . 1 are satisfied and we obtain
2 Corollary 1 to theorem 2 .3 . 1 . If the characteristic function of a distribution F(x) has a derivative of order k at t 0, then all the moments of F(x) up to order k exist if k is even, or up to order k 1 if k is odd. =
-
The following example, due to A. Zygmund (1 947), shows that the result cannot be improved.
C 3 �= 2 j 2 log1 j . Then F(x) Let
=
00
1
C- 1 �
3=2
. [e(x-j)+e(x+j)]
• 2j 2 log J is a distribution function whose characteristic function is c-1 � .cos .. 2 J log J exists and is continuous for all values of It can be shown that particular for 0 . However, the first moment of is infinite. =
f(t) 3 = 2 jt f '(t) t, in t F(x) Corollary 2 to theorem 2.3.1. If the moment of order s of a distribution function F(x) exists then the characteristic function f(t) of F(x) can be differ entiated s times and f">(t) i• f ' oo x" eita: dF(x). Corollary 2 follows immediately from the argument used in the last part of =
=
rx8
=
the proof of theorem 2.3 .1 . Theorem 2.3 .1 also yields another result :
..
Theorem 2.3 .2. Let f(t) be the characteristic function of a distribution F(x) and assume that for an infinite sequence of even integers {2nk } O) f( nk � � lim inf Mk (2t)2n�c is finite (but not necessarily bounded) for k 1, 2, . . . Then all moments of the distribution function F(x) exist and f(t) can be differentiated for real t any number of times, with f'"' (t) i • J : x" eioot dF(x). 2.3 .2 . I.�e t f(t) be he cha racteristic function of F(x); if off(t) at origin then all of F(x) exist. =
H-0
rxs
=
Corollary to theorertz t�ll the cierivatit)es
00
=
exist
the
t
the 1noments
23
PRELlMINARY STUDY
It is worthwhile to note that a characteristic function may be nowhere differentiable. As an example we mention the Weierstrass function
1 f(t) = � 2k + 1 eit5k. 00
k=O
This is the characteristic function of the purely discrete distribution
F(x)
=
00
1 s(x - 5 k) . +1
� k k=O 2
n
F(x)
Let us assume that the first moments of a distribution function exist and denote by its characteristic function. Then has the Maclaurin expansion j <J> (O ) == � . j=O }! where <*>
f(t) 1 n J(t)
f(t)
tj + Rn(t)
n f ( Rn(t) n>(! O) tn + o( l ) as t -+ 0. It follows from theorem 2.3.1 that f(t) j=O� }�• (it)i+ o(tn) as t 0. =
=
n r:J.. ·
-+
This connection is precisely described in the following manner :
Theorem 2.3.3. Let F(x) be a distribution function and assume that the nth moment of F(x) exists. Then the characteristicfunctionf(t) of F(x) admits the expansion (2. 3 . 4) f(t) 1 +j=�lci (it)i + o(tn) as t 0. Conversely, suppose that the characteristic function f(t) of a distribution F(x) has an expansion (2.3.4). Then the distribution function F(x) has moments up to the order n if n is even, but only up to the order (n - 1 ) if1,n is odd. Moreover rx;/j ! for j 1, . . . , n if n is even but only for j 2, . . . , (n- 1) if n odd. We have already established the first part of the theorem. To prove its second part we compute �! f(O ) according to formula (2. 3 .1) using the assu mption (2. 3 . 4). This yields an expansion in powers of t ; it is easily seen =
c1 ==
n
-+
==
=
is
that the constant term of this expansion vanishes and one obtains
(*") 'l'hc remainder term used here is a modification of Lagrange's form for the re
nul i n dcr. 1-,h is foll o\\rs from
151,
"
p.
290] .
a
s e l dorn
used fonn of the remainder term [see 1-lardy (1 963 )
24
CHARACTERI STIC FUNCTIONS
n
(2.3 . 5) �� J(O) = i=l'}: ii C;A i ti + o(tn) as t -+ 0 0 if j + n is odd where A; = }:, ( - 1 )k (�) (n - 2k)i if j n is even. ko We can prove by induction that if 1 � s < n (2.3. 6) f:,0(- l )k (�) k• = {�- 1)n n f if s = n. From (2.3 .5) and (2.3 .6) one sees easily that ��f( O ) in Cn tn 2n n ! + o(tn ) so that j (O ) = cn n l + o(tn) � � as t -+ 0. (2.3 .7) (2t)n +
==
If n is even we can conclude therefore from theorem 2.3 . 1 that the moment of order n of F(x) exists. If n is odd we see that the validity of (2.3 .4) implies the possibility of an expansion n- 1
f(t) = 1 + '}:c1(it)i + o(tn - 1 ) j =l
as
t -+ 0.
(
The argument just used proves therefore that the moment of order n - 1 ) of F(x) exists. The last part of the theorem follows immediately from 2 .3 . 7). An expression for the remainder term in formula (2.3 .5 ) was given by E. J. G. Pitman ( 1 961 . To illustrate the situation described by theorem 2.3 .3 we give an example, due to A. Wintner 1947 . It is easily seen that the function
(
)
(2.3 .8 )
p(x)
=
( ) 0
if l x l < 2
C
if l x l > 2 2 x log I x I is a frequency function, provided that C is determined so as to make
foo
00
p(x) dx = 1 . From
f A �ogx 2
X
X
= lo g lo g A - log log 2
( )
it follows that the distribution determined by 2.3 . 8 does not have any moments. The characteristic function of p(x) is given by the integral
f(t)
fco 2C _
=
2
f(t)
cos tx
x 2 log �
Z;-
x �-
dx .
25
PRELIMINARY STUDY
1 -f(t) J oo 1 - cos tx dx l/t 1 - cos tx dx + oo 1 - cos tx dx 2C x 2 log x J x 2 log x J 1/t x 2 log x so that 1 -f(t) is a real, non-negative and even function of t. For any real � one has 0 � 1 - cos z � Min (2, z 2 ) so that [ 1 -f(t)] has as a majorant constant multiple of l/t 2t J dx + 2 J t/ro t x 2 dx1og x 0( - tjlog t) o(t) as t -+ 0 . Thus f( t) 1 + o( t) admits an expansion of the form (2.3 .4) with n c1 0, even though the first moment does not exist. If the moments ocn of F(x) exist for all orders n and if lim sup (I CXn 1 /n ! ) lin L is finite, then the characteristic functionf(t) of F(x) is regular at the origin and has the power series expansion f(t) j=O� }�:· (it)i Then
_
=
2
2
a
2
=
1og .x
=
=
"
= 1,
=
=
=
and p = l jL is the radius of convergence of this series. It is possible to define symmetric moments (2. 3 .9)
A (scx)k A�limoo J -A xk dF(x). =
Symmetric moments may exist for distributions which do not possess moments ; the connection between the existence of symmetric moments and symmetric kth derivatives
�� f(O ) t� (2t)k
1.
of the characteristic function was investigated by A. Zygmund (1947). We mention here only the simplest case :
'theorem 2.3 .4. Suppose that the characteristic function f(t) of a distribution _function F(x) satisfies the "smoothness condition"� �f(O) o(t) as t 0, then necessary and sufficient condition for the existence off' (0) is the existence of symmetric moment of order 1, and (scx) 1 A-+limoo JA x dF(x) - if' (0). =
tl
-+
the
=
- .A.
=
Zygmund's "smoothness condition" is expressed in terms of the characteristic functions. E. J. G. Pitman (1956) replaced it by a condition
on
the distribution function .
26
CHARACTERISTIC FUNCTIONS
R. P . Boas ( 1 967) studied the related problem of the behaviour of a distribution function whose characteristic function satisfies a Lipschitz condition of order rt (0 < (X � 1 ) . It is also possible to express the absolute moments of a distribution function F(x) in terms of its characteristic function f(t). To do this we use the well-known fact that + 1 if u > 0 A 1 sin ux (2.3 .10) if u = 0 dx = sgn u = 0 - lim X -A TC A� oo - 1 if U < 0
J
Since absolute moments of even order are identical with the algebraic moments of the same order, we have only to consider absolute moments of odd order. Let r be an odd integ _r, then {3,
= = = =
=
so that
J: I J
oo oo
I u l r dF (1A )
=
J
00
ur (sin u) dF(u )
[ J sin ux dx] dF(u) sin ux 1 - lim J J ur dx dF(u) 1 ) dF(U) J dx -1 1m J 1 [ r( U . 2z J dx r r _!__. J [i- r f( l (x) - ( i) - { ( x)] 2nz
TC
- oo
ur lim oo
A-? oo A
1.
n A---+- oo
A
-A
-A
-
X
co
- co
00
X
X
-A
- oo
Tl A� oo
A
00
- oo
e"lux - e - tux •
•
-
(r)
-
X
(2.3 . 1 1 ) 2.4
The second characteristic
We have shown that every characteristic function f(t) is continuous and that j(O) = 1 . Therefore there exists a neighbourhood of the origin in which /( t) is different from zero ; let I t I < � be this neighbourhood. The function cp(t) = logf(t) can be defined uniquely for I t I < �' provided we understand by logf(t) the principal branch of the logarithm of the charac teristic function, i.e. that determination of logf(t) which is continuous and vanishes at t = 0. The function cp(t) is called the second characteristic of the distribution function F(x) . We will consistently denote the second characteristic by the Greek letter corresponding to the small letter used for the characteristic function. 1-Jet us again assume that the first n moments of F(x) exist. We obtain then fro1n the Maclaurin series for log (1 + z) and from (2.3 .4) the development
27
PRELIMINARY STUDY
(2.4. 1 )
as t
-+
0.
The coefficients K; of this expansion are called the cumulants (or semi invariants) of F(x) . Clearly (2.4.2) K; = i -1 cp(j) (0). On account of the relation (2.4. 1 ) one sometimes calls the function cp(t) the cumulant generating function of F( x) . This terminology is however somewhat awkward since cp(t) exists (in I t I < �) even if cumulants and moments do not exist. For this reason we prefer the name "second characteristic' ' used in the French literature. The relations between cumulants and moments can be found easily by means of Faa di Bruno's formula [see Jordan ( 1 950), pp. 33-34] . This formula gives an explicit expression for the pth derivative of a function of a function. Suppose that the moment rxn of F(x) of order n exists ; then we get . . (k - 1 ) ! p ! 1 k l ""' ( (2.4.3 ) 1) - z· rx"' • rx Kp - kJ · 1 z 1 (k ')is k1 • • k. 1 l)i (k 1• 1• • • • s• s• and ta
(2.4.4) for p = 1 , 2, . . . , n . The summation is extended over all partitions of p which satisfy i1 + i2 + . . . + is = k i1 k 1 + i2 k 2 + . . . + is ks = p .
3.
F U N D A M E N T A L P R O P E RT I E S O F C HARACTE R I S T I C F U N C T I O N S
In Sections 3 . 1-3 .6 we discuss the most significant theorems which des cribe the connection between characteristic functions and distribution functions. These properties account for the importance of characteristic functions in the theory of probability. 3. 1
The uniqueness theorem
a e
Theorem 3 . 1 . 1 . Two distribution functions F1 (x) and F2 (x) r identical if, and only if, their characteristic functions f1 ( t) and f2 ( t) are identical.
We see immediately from (1 .3 .6) that the identity of the distribution functions F1 (x) and F2 (x) implies the identity of their characteristic functions ; therefore we must only prove the converse proposition. Suppose therefore that the characteristic functions of the distributions F1 (x) and F2 (x) satisfy the relation (3 . 1 . 1 ) = We denote F1 (x) - F2 (x) by {J(x) and write (3 . 1 . 1 ) in the form
fl (t) f2 (t). f ' oo eit� df3(x)
(3 . 1 .2)
=
0.
The function {J(x) is the difference of two monotone increasing functions and is therefore a function of bounded variation. Moreover we see from (3 . 1 .2) that {J(x) satisfies the relation
oof }(x) df3(x)
(3 .1 .3)
=
0
h(x) eitx
for all functions = where t is an arbitrary real constant. Therefore (3 .1 .3) also holds for any trigonometric polynomial h(x)
(3 . 1 .4)
A
=
n
�
v= - n
ixlv av e ,
where is an arbitrary real constant. The relation (3 . 1 .3) is therefore also valid for any function which is the uniform limit of trigonometric poly nomials (3 . 1 .4). We conclude then from Weierstrass' approximation theorem [see Ap pen d ix C] that (3 .1 .3) holds if h(x) is a continuous periodic function. IJetg(x) be a continuous fu n ction which vanishes outside a fixed bounded interval J and choose ttl > 0 so large that the half o p en i nterval ( m, -
m]
29
FUNDAMENTAL PROPERTIES
contains ]. We then define hm (x) as a continuous periodic function of period 2m such that hm (x) = g(x) for - m < x � m. Then (3 . 1 .3) holds for the function hm (x). Since (J(x) is a function of bounded variation it is possible to choose m so large that the variation of {J(x) for I x I � m be00 comes arbitrarily small ; the integral x) d[J(x) therefore approaches 00 g(x) d[J(x) as m tends to infinity. Hence 00
f oo
f hm(
J :oo g(x) d[J(x) L g(x) d[J(x) =
=
0
for every continuous function which vanishes outside a fixed interval J. It follows easily from the uniform boundedness of g(x) that
J: g(x) d[J(x)
=
0,
provided that a and b are continuity points of (J(x) and that g(x) is contin uous for a � x � b. But then (J(x) must be constant on the set of its con tinuity points so that F1 (x) and F2 (x) must agree in all continuity points and are therefore identical. We would emphasize here that two characteristic functions /1 (t) and /2 (t) must agree for of t in order to assure that the corresponding distribution functions F1 (x) and F2 (x) should be identical. This require ment can only be weakened in a trivial way : one could suppose that the functions /1 (t) and /2 (t) agree for t-values"which form a set which is dense on the positive real axis. It follows then from theorem 2. 1 . 1 (condition iii) that they must agree for a set dense on the whole real axis, and one can conclude from theorem 2. 1 .2 that f1 (t) = f2 (t) . Agreement over a finite interval is, in general, not sufficient for the identity of the correspond ing distribution functions. In fact, it is not difficult to construct a pair of characteristic functions which belong to different distributions and which agree over a finite interval. It is also possible to show that a pair of different characteristic functions can agree everywhere with the exception of two syrnmetrically located intervals. We will give these examples in Section 4.3 . I.�et F(x) be an arbitrary distribution function. It, is then easily seen that the function 1 - F( - x - 0) is also a distribution function. This function is called the conjugate distribution of F(x) and is denoted by P (x) = 1 - F( - x - 0) . (3 . 1 .5 ) I Jet f(t) be the characteristic function of the distribution F(x) ; an elemen t a ry cotnputation shows that the characteristic function of the conjugate d i Htri bution P(x) is
all values
(3 . 1 . 6 )
J oo"" ei� dF(x)
=
j( - t)
==
j{t).
3
0
CHARACTERISTIC FUNCTIONS
A distribution function is said to be symmetric if it is equal to its conjugate. The following characterization of symmetric distributions is easily established.
Theorem 3 . 1 .2. A distribution function is symmetric if, and only if, its characteristic function is real and even. The necessity of the condition follows from (3 . 1 .6) while the sufficiency is a consequence of the uniqueness theorem. Moreover, we see from (3 . 1 .6) that
f(t) f' oo cos tx dF(x).
(3 . 1 .7)
=
This formula can be used to establish the following property of sym metric distributions.
Theorem 3 . 1 .3 . Let F(x) be a sy1nmetric distribution with characteristic function f(t) and suppose that the moments (j 1 , 2, . . . , 2k) of F(x) exist. Then f'2i- 1> (t) ( - 1 )i Joo x2i- l sin tx dF(x) (j 1 , . . . , k) fC23> (t) ( - 1 )i Joo x 2i cos tx dF(x) (j 1 , . . . , k) . r�vJ
=
=
=
00
=
=
00
The theorem is a consequence of formula (3 . 1 .7) and the corollary to theorem 2 . 3 . 1 .
Corollary to theorenz 3 . 1 .3 . Let F(x) be a symmetric distribution with char acteristic function f( t) and suppose that the moments (j 1 , . . . , 2k) of F(x) exist. Then (i) rlv2j l 0 (j 1 , 2, . . . ' k) -f(2j- 1 ) ( t) (ii) lim t ( - 1 )i (j 1 , 2, . . . , k) 2 t ' 1 il C 2 J sin 2 (�/2) (t) (0) 1 oo 2 f i dF(x) (iii) lim im x 2( 1 ) t t J ( - 1 )i+ l rlv2j+ 2 (J. 1 , 2, . . . ' k - 1 ). 2 r�v3
==
=
=
r�v 2 3
=
t�o
=
t�o
=
==
-
H
1
t�o
oo
==
The corollary follows immediately from theorem 3 . 1 .3 . 3.2
Inversion formulae
tfhcorcm 3 . 1 . 1 of the preceding section establishes a one-to-one cor respondence between characteristic functions and distribution functions. liowcvcr, thcorcn1 3 . 1 . l docs not give a method for th e dctern1ination of
31
FUNDAMENTAL PROPERTIES
the distribution function belonging to a given characteristic function. The theorems discussed in the present section deal with this problem.
Theorem 3 .2.1 (the inversion theorem). Letf(t) be the characteristic function of the distribution function F(x). Then 1 T 1 - e - i th a t lim - J (3 .2. 1 ) e i F(a + h) - F(a) T-')-oo f(t) dt, . 2n - T zt provided that a and a + h (with h > 0) are continuity points of F(x). =
For the proof of the inversion theorem we need the following well known lemma.
Lemma 3 .2. 1 . The int"egral J (siny)/y dy is bounded for x > 0 and approaches n/2 as x tends to infinity. ,. :t
0
The first part of the lemma is easily proved by dividing the range of integration into segments of length n ; the second statement is obtained by contour integration. <*> Let T sin � h T sin I .
A(h, T)
=
n
I
hy dy
y
o
n
=
I x o
x dx
From this definition and from lemma 3 .2. 1 it is seen that bounded for all and all and that
h
while (3 .2.2)
T A( - h, T) -A(h, T) � if h > 0 O if h O lim A(h, T) - � if h < 0 .
A(h, T) is
=
=
T-'; oo
=
We now introduce the integral
1T
==
1 T e - ita - :- it (a +h )f( t) 2n - T zt
We substitute here for f( t )
I
=
I : oo eit"' dF(x) and not� that the absolute
value of the integrand does not exceed n1 ay be reversed and one obtains
1T (*) S<�l�
==
1 2n
'"f i tchtnnrsh
dt.
T e - it (a[ I - oo I - T 00
(1 937), s(�Ction 3 . 1 22.
h. Hence the order of integration
X) -
e -it ro+lt- :t)
. zt
dtJ dF(x).
32
CHARACTERISTIC FUNCTIONS
We replace the exponentials in the inner integral by trigonometric func tions and obtain 00 T sin h) sin (3 .2_3) ! = 1T 0
[
t(x-a) - t(x-a - dt] dF(x). J J t We write g(x, T) A(x - a, T) -A(x - a -h, T) and conclude from the boundedness of A(x, T) and from (3 .2.2) that g(x, T) is also bounded for all x and all T and that O if x < � if x lim g(x, T) (3 .2.4) 1 if a < x < � if x 0 if x > :n
- 00
=
a
=
a
a+h
=
T_:;.. oo
a+h
=
a +h.
Moreover, (3 .2.3) can be written as
(3 .2.5)
1T
=
J"" g(x, T) dF(x). 00
a
Let e > 0 be an arbitrary positive number. We assumed that and a + h are continuity points of and we have shown that is bounded. Therefore it is possible to select a o > 0 which is so small that the three inequalities
F(x)
a+<5 g(x, T)dF(x) � J aa-+�h+<5 � J aa++hh--/<5 (x, T)dF(x) a+h dF dF(x) (x)J J a+<5 a
g(x, T)
13
13
� e
hold simultaneously. Moreover, we conclude from (3 .2.4) that the relations
T can be chosen so large that +h a h � d + a (14) J a+� g(x, T ) dF(x) - J a+� dF(x) � and a d 1 ( I s) J g(x, T ) dF(x) J a+ h+<5g(x, T )dF(x) are both satisfied. We decompose the range of integration of the integral ( 3 .2.5 ) into the five intervals ( a - o), (a- o, o) o, o), and ) and obtain, using (11 ) , (1 2) and (I s), (I,) 1T - J:::-d g( x, T)dF(x) 13
+
- oo
(a -t- h - o , a+h + o )
�
""
- oo ,
(a + h + � ,
oo
a+
� 3e.
13
(a +
a +h -
33
FUNDAMENTAL PROPERTIES
We see then from (16), (14) and (13) that
r a+h ]T - a
dF(x) � J if T is sufficiently large. This is equivalent to (3 .2. 1 ) , so that the proof of Ss
the inversion theorem is completed. An inversion formula expressing [instead of its increment in terms of an integral involving the characteristic function of was given by J. Gil-Pelaez (195 1 ). We remark that the uniqueness theorem could easily have been obtained from the inversion theorem. Such an approach would have shortened the presentation ; however, it is of some methodological interest to distinguish between these two theorems. The inversion formula can be written in a more symmetrical form by putting � and 2�. In this way we obtain r T sin lim ! -T t T-:; oo TC provided that are continuity points of The last and formula can also be written as T �) sin lim _!_ r � J -T � T-:; oo oo) , Let us now assume that is absolutely integrable over ( - oo , the integrand is then dominated by the absolutely integrable function f(t) as � tends to zero. Hence one may go to the limit and converges to under the integral sign ; one sees that and one exists for all obtains the following result.
F(x)
F(x + h)-F(x)] F(x)
a x- h (3.2 .6) F(x +�) -F (x -Cl) x -� x +� F(x + F(x -Cl) 2 f(t) e -itx f(t) =
=
tCJ e-it� f(t)dt F(x). tCJ e-itm f(t) dt. t
J
=
2n
=
+
x F'(x) Theorem 3 .2.2. If a characteristic function f(t) is absolutely integrable over (continuous - oo , oo ) then the corresponding distribution function F (x) is absolutely and the formula p(x) F '(x) 2_!_n Jf -ro e- itm f( t) dt fxpresses its density function p(x) in terms of the characteristic function. The density function p(x) is continuous. We have already proved the absolute continuity of the distribution corresponding to f(t) and must still show that p(x) is continuous. We see that I p (x + h) - p(x) I � � JA I sin (th /2) I I f(t) I dt 1 f n J 1 sin (th/2) I I J(t) 1 dt. +
=
oo
=
easil y
A
+
l t l >A ..
34
CHARACTERISTI C FUNCTI ONS
We choose A so large that the second integral becomes arbitrarily small and can then make the first integral as small as we wish by selecting h sufficiently small. This completes the proof of the theorem. We note that this inversion formula is here not derived for all absolutely continuous distributions but only for absolutely continuous distribution functions which have absolutely integrable characteristic functions. We will give later [p . 85] examples of characteristic functions which belong to absolutely continuous distributions but which are not absolutely integrable. However, we will see that under certain conditions the inversion formula is still valid. It is also possible to derive an inversion formula which is valid for arbitrary absolutely continuous distributions, even if they are not absolutely integrable. As the proof of this formula requires results of the next section, we give it in Section (see corollary to theorem Let again f(t) be the characteristic function of an arbitrary distribution We consider the integral
3.3
F(x). (3.2.7)
3
3.3.2).
_!_2T Jr T e -itlll f(t) dt. We write in (3. 2 . 7 ) / (t) j'" oo eilz dF(z) and see easily that the order of the two integrations may be exchanged, so that ooJ sin T (z x) dF(z) IT
=
- T
=
]p
=
J
- oo
l vl < h
T
-
( -x) sin Ty d11F(y+x)+ J T z
Y
sin
lvl > h
T
Ty d11F(y+x).
Y
Here h is a positive number to be chosen later. Let s > be an arbitrary positive number and denote the saltus of that is at the point by It is then possible to choose a value h0 > which is so small that the inequality
0
(3.2 . 8 )
x Px , F(x)-F(x-0). P x 0 f P dyF(y+x) � e x J =
F(x)
lvl < ho
holds. The integral
Ty dyF( y+ x) J Ty converges to zero as T tends to infinity, since the integrand is dominated by + 1 and converges to zero as T We can therefore choose T so large that (3 .2.9)
f
sin
lv l > ho
-+ oo .
35
FUNDAMENTAL PROPERTIES
h1 be a number such that (3.2 .10) h0 > h1 > 0. It follows from (3 .2.8) that d11F( y+ x) � f Px - 8 f Let now
�
so that
f
(3 .2 .11)
l vl <.h1
J yJ < hl
d11F( y+x)- Px
lvl < ho
d11F(y+x) � Px + s
�e
while
0�f
d11F(y+x) � 2s. We are still free to choose h1, subject only to the restriction (3. 2 .10). We select h1 so small that sin Ty 1 - 8 � Ty for I y I < h1• According to the law of the mean there exists a real 0( I I < 1) such that sin Ty sin T6h1 f d ) F(x d11F(x +y +y) y f Ty TOh1 (1 - 01s) f d11F(x+y) where 0 � 01 � 1 . From this we see immediately that sin Ty f Ty dy F(x+y)- Px f d11F(x+y)-Px - 02 s with 0 � 0 2 � 1. Hence we conclude from (3.2.11) that (3.2.12) f sinTTy d11F(x+y) - Px � 2s. sin Ty Since � 1, we see from the second formula (3.2.11) that Ty sin Ty d11F( d11F(y x) y+x) � f � 2s. + T f We combine the last inequality with (3. 2 . 9 ) and (3. 2 .12) and obtain (3.2 .13) I IT -Px I � Ss T is sufficiently large. Thus we have proved the following statement : Theorem 3.2.3 . Let f(t) be an arbitrary characteristic function. For every real the limit lim _!_ r T e-u., j (t) dt 2T J h1 < lvl < ho
--
()
=
lvl < h 1
l u l < h1
=
lvl < h1
=
lvl < h1
Y
l vl < h1
h1 < lvl < ho
l v l < h1
Y
h1 < lvl < ho
if
x
p.,
=
7'- � oo
T
..!
36
CHARACTERI STI C FUNCTI ONS
and is equal to the saltus of the distribution function of f(t) at the point x. Corollary 1 to theorem 3.2.3 . The characteristic function of a continuous (singular or absolutely continuous) distribution cannot be an almost periodic function. Let f(t) be the characteristic function of a continuous distribution. We see immediately from theorem 3. 2 .3 that (3.2.14) lim ZT1 f e- itx f(t) dt 0 for all real x. We give an indirect proof for the corollary and suppose that f(t) is almost periodic. Formula (3.2 .14) means then that all Fourier coefficients of f(t) vanish ; we conclude from the uniqueness theorem for almost periodic functions [H. Bohr (1932), ( 1947), English edition, 60 ] that f(t) 0, which contradicts the assumption that f(t) is a characteristic function. Corollary 2 to theorem 3 .2.3. A distribution function is purely discrete if, and only if, its characteristic function is almost periodic. The necessity of the condition follows from our remarks in Section 2. 2 . To prove the sufficiency we note that an almost periodic characteristic function f ( t) necessarily satisfies the relation 1; lim sup I f(t) I in view of corollary to theorem 3. 2 .3 f(t) must then belong to a purely exists
T
T-+o oo
p.
-
=
T
=
=
l t l�oo
1
discrete distribution.
3.3
The convolution theorem
F1(x)
F2(x)
We consider next two distribution functions and and their characteristic functions f1(t) and respectively. We form the function
f2(t) (3.3 .1) F(z) f F1 (z-x)dF2 (x). The function F1 (z- x) is bounded so that the integral (3.3.1) exists. More over it is easily seen that F (z) is a distribution function ; this follows from ""
=
oo
the fact that the necessary passages to the limit can be carried out under the integral sign. We wish to determine the characteristic function f(t) of Clearly,
f(t) f ei•! dF (z). egral J : e'" dF(z) (where =
We consider first the int
F(z).
""
""
a
and
b
arc
finite) anJ
37
FUNDAMENTAL PROPERTIES
write it as a limit of generalized Darboux sums. <*> We use a sequence of of decreasing modulus subdivisions {
z'j> }
zin> < z'�> < . . . < z':> < z�� 1 = b of the closed interval [a, b]. �n this manner we get :J exp (izt)dF(z) �� fo1exp (itz'n>) [F(z;�i)- F(z' j> )]. In view of ( 3 . 3 .1) this can be written as J : exp (izt)dF(z) = �� f oo i•1 exp [it(z j -x)] [F1 (z �>1 -x)- F1 (z
=
..
' >
00
3
From this it follows that
f >izt dF(z) = f oo u:=: eit?ldF1 (y) ] ei� dF2 (x). We take the limit as a -+ - oo and b -+ oo and obtain oo
(3.3.2) Suppose conversely that a characteristic function f(t) is the product (3.3.2) of two characteristic functions. According to the uniqueness theorem relation (3.3.1) holds between the corresponding distribution functions. Formula (3.3.1) defines an operation between distribution functions ; it indicates how a new distribution F can be obtained from two given distri butions F1 and F2. This operation is called convolution (sometimes com position or Faltung) and F is called the convolution of F1 and F2 and is written as a symbolic product F F1*F2 It is seen from (3.3. 2 ) that the convolution is a commutative and associative =
•
operation. vVe summarize our results as
Theorenz 3.3.1 Convolution theorem). A distribution function F is the con ( volution of two distributions F1 and F2 , that is F(z) Joo Fl (z-x)dF2 (x) Joo F2 (z - x)dF1(x) = F1*F2 oo functions satisfy the relation 1j, and only if, the corresponding characteristic f(t) fl (t) f2 (t) . =
=
oo
=
l-Ienee the genuine multiplication of the characteristic functions and the
(*')
See C r-an1cr (1 946 ) ,
pp.
62, 72.
38
CHARACTERISTIC F UNCTIONS
symbolic multiplication of the distribution functions correspond to each other uniquely. The following corollaries follow almost immediately from the convolu tion theorem.
Corollary 1 to theorem 3.3 .1. The product of two characteristic functions is a characteristic function. Corollary 2 to theorem 3.3 .1. Iff (t) is a characteristic function, I f (t) 1 2 is also a characteristic function. This follows from theorem 2.1 . 1 and formula (3.1.6). We mention some properties of the convolution operation which follow easily from its definition.
Theorem 3.3.2. Let F F1*F2 be the convolution of two distributions F1 and F2 • If one of the components of F is a continuous distribution, then the symbolic product is also a continuous distribution. If one of the components of F is absolutely continuous then F is also absolutely continuous. Remark 1. Let F F1*F2 be the convolution of two distributions F1 and F2 and suppose that F is a discrete distribution. Then both components F1 and F2 are also discrete distributions. Remark 2. It is, however, not possible to conclude from the assump tions ( i ) F F1 *F2 , ( ii ) F is absolutely continuous, that at least one of the distribution functions F1 and F2 is absolutely continuous. This will be seen from a representation of the rectangular distribution as the convolu tion of two singular distributions. This example will be given on page 189. Corollary 1 to theorem 3.3. 2. If f(t) is the characteristic function 2 of a continuous (respectively absolutely continuous) distribution then I f(t) 1 also belongs to a continuous (respectively absolutely continuous) distribution. Corollary 2 to theorem 3.3. 2 . Let F1 (x) and F2 (x) be two absolutely con tinuous distribution functions and denote by p1 (x) and p2 (x) their frequency functions. Let F F1*F2 and p(x) F'(x) be the density of F(x); then p(z) rn P1(z-x) p2 (x)dx. =
=
=
==
=
=
oo
We are now in a position to derive an inversion formula which is valid for arbitrary frequency functions. Let be an arbitrary, absolutely continuous distribution function and denote its frequency function by We note that the charac = teristic function of is not necessarily absolutely integrable. Let G(..x) be an ahsolut<.�ly conti nuous d istribution fu nction and write .t:(t) for
F (x)
f(t) F(x)
p(x) F'(x).
39
FUNDAMENTAL PROPERTIES
q(x)
(x) G(x) (i) g( t) is absolutely integrable over (- oo, oo ) , (ii) q(x) O(x- 2) as I x I It follows from theorem 3 .2.2 that 1 foo . q(x) 2n e- t �g(t) dt. For any T > 0 the function gp (t) g(tjT) is an absolutely integrable characteristic function ; the corresponding frequency function is p(x) Tq(Tx). We consider the function (3.3. 3 ) p (t) f(t)gp(t) f(t)g (�) . We see from corollary 1 to theorem 3.3 .1 that hT ( t) is a characteristic function which is absolutely integrable over (- oo, oo ). It belongs there fore to an absolutely continuous distribution function HT (x), and the its characteristic function and G' for its frequency function. Suppose that satisfies the following conditions : =
-+ oo .
=
=
-
- oo =
q
h
=
=
=
density of this distribution can be determined from theorem 3 .2.2 and is given by
(3.3.4)
2 to theorem 3 .3 .2 that H;(x) J :�,P (x- �) q(y) dy.
On the other hand we see from corollary =
Therefore we see that
IJet
a
I H� (x)-p(x) l r0 00 [P (x - �) -p(x)J q( y )dy , . be a positive number to be chosen later, and write 11 f p (x- YT) - p(x) q(y) dy 12 f p(x-YT) q( y) dy /3 p(x) J q(y) dy , =
=
lvl
=
then
lvl >a
=
l vl > a
( 3 . 3 .5)
write w(�� , h) (3 .3.6)
We
=
sup J .P(x+v)-p(x) l
! 1'!
<.It
40
CHARACTERISTIC FUNCTIONS
and (3 .3 .7a)
11 � (x, �) . w
q(y) that for2 y sufficiently large, q(y) � Ay - . Therefore we have for sufficiently large values of a oo T A A p I2 � -2 J (3 .3 .7b ) ( T) d a 2 a and 2A I3 � -p(x). (3 .3 .7c) It follows from property (ii) of
y
X--
- oo
We put
y=
-
a
a T2/3 and conclude from (3 .3 .7a), (3 .3 .7b), (3 .3 .7c) and (3 .3 .5) that )T- 213. I H� (x)-p(x) I � w(x, r- l/3) + A T-l/S + 2Ap(x (3 . 3 . 8) Let x be a continuity point of p(x), then lim w(x, T - 113 ) 0 and we see T-:; oo from (3 .3 .8) that lim H�(x) p(x). T-+ oo It follows therefore from (3 . 3 .4) that 1 00 p( ) T---+limoo 2n Jr - oo e - itreg ( Tt) !< t) dt. We have therefore obtained the following result. Corollary 3 to theorem 3 . 3 .2. Let g(t) be a characteristic function which is absolutely integrable over ( - oo, ) and suppose that the2 corresponding fre quency function q(x) satisfies the condition q(x) O(x - ) as I x I Let of an arbitrary absolutely continuous distri ( t) befunction the characteristic function fbution F(x); the frequency functionoo p(x) of F(x) is then given by 1 p(x) F'(x) T-+limoo 2n J[ - oo e-itreg( Tt) f(t) dt, provided x is a continuity point of p(x). Remark. This result could also be formulated by stating that the inver =
=
=
X
=
oo
=
-+ oo .
=
=
sion formula of theorem 3 .2.2 remains valid for characteristic functions which are not absolutely integrable if the integration in the inversion for mula is considered in the sense of a summability method with sum mability factor If we use = for = � and for we obtain �
I t I 1,
g(t/T). p(x)
=
g(t) 1 - 1 t I I t I 1 7��� J� 7, e- itre (1 - i;!) J (t)dt,
g(t) 0
41
FUNDAMENTAL PROPERTIES
( C, 1
that is, the integral is taken in the sense of ) -summability. For the integration is in the sense of Abel summability. = We consider next the convolutions of two purely discrete distributions.
g(t) e- ltl ,
and F2 (x) be two purely discrete distributions Theorem 3.3.3. Let F1(x) with discontinuity points {�11 } and {n.u } respectively . Then F F1*F2 is also purely discrete and the discontinuity points ofF are the points of the sequence {�v + ?J,u }. Moreover, let a11 be the saltus of F1 at �11 and b.u be the saltus of F2 at and suppo�e that � is a discontinuity point of F. The saltus ofF at � then ==
1]p
is
f1 (t) and f2 (t) of F1 (x) and F2 (x) respec f1 (t) �p ap exp (it�11) f2 (t) ,u b.u exp (itn.u) · The characteristic function f(t) of F(x) is, according to the convolution theorem, (3.3.9) Theorem 3.3.3 follows immediately from this formula. Suppose that F1 (x) and F2 (x) are two purely discrete distribution functions and that at least one of these has infinitely many discontinuity points. It follows then from (3.3.9) that F(x) F1(x) *F2 (x) also has infinitely many discontinuity points. Assume next that each of the purely discrete distributions F1 (x) and F2 (x) has only finitely many discontinuity points, then (3.3.9) becomes n (3.3.10) f(t) f1 (t)f2 (t) P=�1 ,U=�1 a11 b,u exp [it(�v + ?J,u)] where n and m are the numbers of discontinuity points of F1 (x) and F2 (x) respectively. The last formula indicates that F F1 * F2 also has a of discontinuity points. Let us consider the set finite number, say {�11 + 17,u } ( 1, . . . , n; 1, ) Then it is no restriction to assume that the � 1, � 2, , �n and 171, 172, , 17m are arranged in increasing order. 'fhe set of discontinuity points of F (x) contains at most nm elements, while it is seen immediately that the n + m- 1 numbers �1 + 171, � 2 + , �n + 1]1, �n + 1] 2, , �n + 17m are distinct. We formulate this result in the following manner. (�orollary to theorenz 3.3.3. Let F F1 * F2 he the convolution of two purely discrete distributions F1 and F2• The distribution function F(x) has The characteristic functions tively are
=
=
2:
=
=
=
v
=
N,
=
•
•
m
p,
•
=
. . . , m . •
•
•
171,
.
•
•
•
•
•
=
'
42
CHARACTERISTIC FUNCTIONS
a finite number of discontinuity points if, and only if, each of the functions F1 and F2 has finitely many discontinuity points. Denote by n and m the number of discontinuity points of F(x), F1 (x) and F2 (x); then n m - 1 � � nm. Next let F (x) be an arbitrary distribution function. If F (x) has a dis continuity at the point x �; with saltus then the conjugate distribution function P (x) of F (x) has a discontinuity at x �i with the same saltus According to theorem 3.3.3 the convolution F * P has the saltus � P 2 at the point x 0. On the other hand one can determine the saltus j of F * P at x 0 from theorem 3. 2 .3 and we obtain the following result. 3 .3 .4. Let F (x) be a distribution function and f (t) its characteristic Theorem function. Then T 1 2 2 lim dt p f (t) l \ J T� oo Z T - T where the are the saltus of F(x) and where the summation on the right is to be taken over all discontinuity points of F(x). N,
N
+
Pi
=
Pi·
i
=
=
=
=
Pi
'}2 i
We conclude this section by stating the connection between the existence of the moments of a convolution and the moments of its components.
Theorem 3.3.5. Let F1 and F2 be two distributions and suppose that the k or F1 as well as for F2 • The same is then true for moments of order exist f F F1 * F • 2 This follows easily from the elementary inequality � =
\ x +y \ k 2k - l ( l x \ k + \y l k ).
3.4
Limits of distribution functions
In this section we study sequences of distribution functions and their limits and we introduce a specific definition for the convergence of such sequences. In order to motivate this definition we consider first two examples. Let if <
Example 1.
0 x -n n + x if - n � x n Frn (x) 2n 1 if x � n (n 1, 2, ) be a sequence of rectangular distribution functions. This sequence converges for all x and lim F (x) �<
=
=
. . .
r,.....,. C(}
,
,.
=
43
FUNDAMENTAL PROPERTIES
We note that the limiting function of this sequence of distribution func·· tions is not a distribution function. Example
2.
Let
x f n F.. (x) exp (- n 2 y 2j2)dy (n 1, 2, . . .) y'Zn be a sequence of normal distributions. It is easily seen that if 0 0 . 1 fnx 2 1 lim F (X) lim yz e •' � if dz 0 n 1 if 0. =
n� oo
n
=
- ro
=
-
n� oo
X <
=
00
x = X >
If we look at the graphs of the functions Fn (x) we might expect in tuitively that the sequence Fn (x) should converge to the degenerate distribution s(x). This agrees also with the fact that lim Fn (x ) = if x < and lim Fn (x) = if x > n� oo
0
0
However, we have lim Fn n� oo
(0)
=
1
§ while s(O)
=
0.
1.
We observe therefore that it seems to be too restrictive to require that a sequence of distribution functions should converge at all points to a limiting distribution function. Example suggests that exceptions should be permitted for the discontinuity points of the limiting distribution. Moreover, we see from Example that a sequence of distribution functions may converge at all points but that the limiting function is not necessarily a distribution function. In view of the situation revealed by these two examples the following definitions seem to be appropriate. A sequence of functions {h (x) } is said to converge weakly to a limiting function h(x) if lim hn (x) = h(x)
1
2
n
n� oo
for all continuity points x of h(x). We write then Lim hn (x) = h(x), n� oo
that is, we use the symbol "Lim" for weak convergence to distinguish it from "lim" used for ordinary convergence. Using this terminology we introduce the following definition. A sequence {Fn (x) } of distribution functions is called a convergent sequence if there exists a non-decreasing function F (x) such that Lim Fn (x)
1)
n-� oo
=
F (x).
We note (see Example that the weak limit of a sequence of distri bution functions is not necessarily a distribution function. I-Iowever, the
44
CI-IARACTERISTIC FUNCTIONS
(weak) limit is always a bounded and non-decreasing function. We are primarily interested in obtaining a necessary and sufficient condition for the weak convergence of a sequence of distribution functions to a limiting distribution. In order to obtain this condition we need some results which are also of independent interest. These will be given in the next section. 3.5 The tlteorems of Helly We first prove the following lemma :
Lemma 3.5.1. Let {Fn (x) } be a sequence of non-decreasing functions of the real variable x and let D be a set which is dense on the real line. Suppose that the sequence {Fn (x) } converges to some function F(x) in all points of the set D ; then F(x). Lim Fn (x) n�oo Let x be an arbitrary continuity point of F(x) and choose two points x' sD, x" sD so that x' � x � x" . Then F'n (x' ) � Fn (x) � Fn ( x ) ; hence lim Fn (x' ) � lim inf Fn (x) � lim sup Fn (x) � lim Fn (x" ) . n� oo n� oo n--? oo =
"
From the assumption of the lemma we conclude that x' lim inf n x � lim sup F x � n� oo n� oo Since D is dense on the real line we have lim inf � lim sup n� oo From this relation one immediately obtains the lemma.
F( ) �
F()
F(x-0) �
Fn (x)
n ( ) F(x"). Fn (x) � F(x +O ).
Theorem 3.5 . 1 (Helly' s First Theorem) . Every sequence {Fn (x)} of uniformly bounded non-decreasing functions contains a subsequence {F (x) } which con verges weakly to some non-decreasing bounded function F (x) . nk
The theorem is proved by the standard diagonal method and uses the fact that the set of rational numbers is enumerable and can be arranged in a sequence { i }. We form first the sequence }. This is a bounded sequence of real numbers and has therefore at least one accumulation point. Thus it is possible to select a convergent subsequence {F1 ,n r 1 }. Let lim 1 ,n 1 1 . n->- oo In the second step we consider the sequence of functions {F1,n (x) }. We select again from the bounded sequence of real numbers { 1.n a con vergent subsequence { F 2, n 2 )} and write 1 i tn ]?2,1� ( �) <J)( r 2) .
r
{Fn (r1)
F (r )
(r
1·1"�;. oo
==
(r )
()
F (r2)}
r
=
45
FUNDAMENTAL PROPERTIES
The sequence of functions {F2,n (x) } is a subsequence of the original sequence {Fn (x) } which converges for x = 1 and x = r 2 We continue this procedure and obtain a sequence of subsequences of {Fn (x) } F1 • 1 (x) , F1 , 2 ( ) F1 ,3 (x) , . . . , F1 ,n (x) , . . . F2, 1 (x) , F2 ,2 (x) , F2, 3 (x) , . . . , F2,n (x) , . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
r
•
x,
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . These sequences are selected in such a manner that each sequence is a subsequence of the preceding sequence ; moreover the mth sequence Fm, l (x) , Fm ,2 (x) , Fm ,s (x) , . . . , Fm ,n (x) , . . . converges at the first rational points h 2, , and we denote lim Fm.n (rk) =
m
rr r r�c k 1, 2, . . . , m. •
•
•
m
We form the diagonal sequence {Fn,n (x) } and conclude that lim Fn n =
(r�c)
r
Tk >
ro
The function F (x) is defined for all real x and agrees with
(3.5.1)
3.5.1
(3.5 .1 Theorem 3.5.2 (Belly's Second Theorem). Let f(x) be a continuous function and assurne that {Fk (x) } is a sequence of uniformly bounded, non-decreasing functions which converge weakly to sonze function F (x) at all points of a continuity interval [a, b] ofF (x) then !�� J : f(x) dFk (x) J: f(x) dF (x) . ,
=
46
CHARACTERISTIC FUNCTIONS
is continuous it is possible to construct a subdivision f(x) b of [a, b] which is so fine that x 0 x1 (3.5 .2) I f(x)-f(x3) I � for x3 � x � x3+1• Here is an arbitrary positive constant. Moreover, the subdivision points can be selected so that they are all continuity points of F (x) . Hence I Fk (x3) - F (x3) I can be made arbitrarily small if k is sufficiently large. Let M max f(x) and choose I<.. so large that (3 .5 . 3 ) We define a step function fe (x) in the interval [a, b] by (3.5.4) fe (x) f(x3) for x3 � x x3+1 and see from (3.5. 2 ) that I f(x)-fe (x) I � e. Clearly we have (3.5.5) J: f (x) dF(x)- J:f(x) dFk (x) � [f(x)d F (x)� (f.(x)dF(x) + J: J.(x) dF(x)- f: J.(x) dFk(x) + J:f.(x)dFk(x)- J:f(x) dFk(x) . Since
a =
<
<
. . . < XN
=
8
8
==
a < x
<
=
We rewrite the first term on the right of
( 3.5.5) and see that
I J : [J(x)-f. (x)] dF (x) � e J : dF (x) C1e. =
In the same manner we get an estimate for the last term in
(3.5.5)
(f.(x)dFk(x)- J: f(x) dFk (x) � C1e ; the existence of the constant C1 is assured by the assumption of uniform boundedness of the F1c (x) . Finally it follows from (3. 5 .3) and ( 3 .5 .4) that J: f. (x) dF (x)- J: f. (x) dFk(x) N- 1 N � f(x j ) [F(x3 + 1 ) - F(xi)] - 2: f(x3) [Fk (x3 + 1 )-FTc( x3 )] -
j =O
�
N [M�N + :�J
=
2e .
j=O
1
(3.5.5) yield the estimate J: f (x) dF (x) - J: f(x) dFk (x) � 2(1 + C1 )e
The last three inequalities and (3 . 5 .6 )
=
Ce
if
k � K.
47
FUNDAMENTAL PROPERTIES
But this means that
b b dF1c(x) f(x) f(x) dF(x), J J k�oo a a lim
=
which is the statement of the theorem.
Corollary to theorem 3.5.2 (extension of Belly's Second Theorem). Let f(x) be continuous and bounded in the infinite interval - x and let {F1c (x)} be sequence of non-decreasing, uniformly bounded functions which converges weakly to, some function F (x). Suppose that lim Fk ( - ) ) and limoo Fk ( + ) F( + ) F(k k �oo � then !�� r ' ,/(x) dF, (:�) r ' oo f(x) dF (x). To prove the corollary we consider the three expressions J�oo f(x)dFk (x) - J � 00 j(x)dF(x) 11 J:oo!(x)dFTc (x) - J : f(x)dF(x) 12 L f(x)dFTc (x)- J oo f(x)dF(x) 1a where a 0 b. b Clearly J oo oo j(x)dF1c(x) - r ' oo f(x)dF(x) � 11 +12 +1a· Since f(x) is bounded there exists a constant M > 0 such that l f(x) l � M. Let s > 0; as a consequence of the uniform boundedness of the sequence {F1c (x)} it is possible to determine I a I and I b I so large that ]1 � s and ]3 � s. Fro1n theorem 3. 4 . 2 we see that there exists a K so large that ]2 � Cs for k � K. Therefore oo oo J oo f(x)dFTc (x)- J oo f(x)dF(x) � (C + 2)c: for k � K oo <
a
oo
=
oo
oo
=
<
oo
oo ,
=
=
=
=
<
<
so that the corollary is proved. A statement, analogous to the corollary, holds if the range of the integra tion is a semi-infinite interval. 3.6
The continuity theorem In this section we derive necessary and sufficient conditions for the weak convergence of a sequence of distribution functions to a limiting distribu tion . rrhe theorems of the preceding section will serve as tools ; we need,
48
CHARACTERISTIC FUNCTIONS
however, one more lemma which we deduce next from the inversion formula and the convolution theorem.
Lemma 3.6 .1. Let F(x) be a distributionfunction with characteristicfunction f(t), then h F(y) dy- o F(y) dy ! oo c�s ht f(t) dt Jo J -h n J oo t for any real positive h. We denote by R(x) the uniform distribution over the interval ( - a, + a); the characteristic function ( see Table 4) of R(x) is then r(t) sintata Let F(x) be an arbitrary distribution function and consider the distribution H(x) F(x)* R(x); clearly :t + a 1 1 a (3.6.1) H (x) 2-a J F(x-y)dy 2-a J :t- a F(u)du while h(t) f(t) sintata. We apply (3 . 2 . 6) and obtain T sin 2 at . . 1 H(x+a)-H(x-a) hm n- J T at e-ttx f(t)dt. Using (3.6.1) we see that 2a [F(x + v) - F(x-v)]dv hm -1 T 1 cos 2at e- t. :t f(t)dt. J0 t2 T--+- n J T The function ( 1 - cos 2at) I t 2 is absolutely integrable over ( - oo, + oo) so that the integral on the right converges absolutely. We write h 2a and go to the limit so that 1 1 cos2 ht e- 't.tm f(t)dt. F(x v) F(xv) dv [ + ] Jo n J - oo t We finally put x 0 and transform the integral on the left and obtain the =
-
1-
.
=
=
=
==
-a
=
=
T-+- oo
•
=
2
-
-
oo
-
=
h
=
-
00
-
=
formula of the lemma. We now proceed to the main theorem of this section.
Theorem 3.6 .1 (Continuity theorem). Let {Fn(x)} be a sequence of distribu tion functions and denote by {fn (t)} the sequencee of the corresponding charac teristic functions. sequence {Fe (x)} econv rges weakly to a distribution function F (x) if, tznd only if, the s quenc {fn ( t ) } converges for every to 1,he
n
t
a
49
FUNDAMENTAL PROPERTIES
function f(t) which is continuous at t = 0. The limiting function is then the characteristic function of F(x).
This theorem indicates that the one-to-one correspondence between distribution functions and characteristic functions is continuous. The necessity of the condition follows immediately from the extension of Helly's second theorem (corollary to theorem To prove the sufficiency we assume that the sequence converges for all to a func tion which is continuous at = Let be the sequence of distribution functions corresponding to the sequence of charac teristic functions. According to Helly's first theorem we can select a subsequence such that Lim =
3.5.2). fn (t) t t 0. {Fn (x)} {fn ( t)}
f(t)
{Fnk (x)}
k�oo
F(x)
Fnk (x) F(x)
where is a non-decreasing and bounded function which is continuous to the right. Since the are distribution functions we conclude that the In order to limiting function satisfies the inequality � � show that is a distribution function we must only show that = We apply lemma to the functions and find that 0 h cos = n - oo -h It is easily seen that the passage to the limit, -+ oo , can be carried out under the integral signs so that - cos y = n -h The expression on the left of this equation tends to as � Since we assumed that f(t) is continuous at = we see that == lim = == lim
Fnk (x) F(x) 0 F(x) 1. F(x) F( oo)-F( - oo) 1. 3.6.1 Fnk(x) h 1 1 t F Fnk(y)dy J t 2 fnk (t)dt. J o nk (y)dy- J k 1-- h F(y)dy- 1 o F(y)dy 1 J 00 1 2 f(y/h)dy. oo y h Jo hJ F ( oo) -F ( - oo) h oo . t 0 f(tjh) f(O) n�oo fn(O) 1 . -
00
-
h� oo
Moreover, it is again permissible to carry out the passage to the limit under the integral sign so that c s =
F ( oo) - F ( - oo) n! J -oo oo 1 -y � y dy. It is well known<*> that n cos y 1 J 0 y 2 dy = 2 = 00 - � 00
<•> We integrate by parts and see that
For the lust in tcgrul
see
J
00
0
1
c s y dy
y
J
sin y dy .
0
y
T'itchmarsh (1 937), Section 3 . 1 22.
50
CI-IARACTERISTIC FUNCTIONS
F F( Fnk (x)
1.
F (x)
so that ( oo ) oo ) The limiting function of the subse quence is therefore a distribution function. The argument just used applies to every convergent subsequence of It follows then from the uniqueness theorem that every convergent subsequence of converges weakly to the same limiting distribution This means however that =
{Fn(x)}.
F(x).
{Fn (x)}
Fn(x) F(x). Corollary 1 to theorem 3 .6 .1. If a sequence {fn (t)} of characteristic functions converges to a characteristic function f( t) then the convergence is unifornz in every finite t-interval [- T, T] . Denote by Fn(x) and F(x) the distribution function of fn (t) and f(t) respectively. Then (3 .6 .2) lfn(t)-f(t) l � [ ei1"' dFn (x)- f: e•txdF(x) + [1 - Fn (b) + Fn (a)] + [1 - F (b) + F (a)] . Let be an arbitrary positive number and select for a and b two continuity points of F(x), taking I I and b so large that 1 - F(b) + F(a) Since Lim Fn(x) F(x) we have, for sufficiently large values of n, 1 - Fn (b) + Fn (a) � l -F(b) + F(a) +s < 2s. The inequality (3.6. 2) can then be written as (3.6.3) I fn (t) - f(t) I � I [ eitx dF.. (x) - J : eitx dF (x) + 3 e . We wish to estimate the difference of the two integrals on the right of (3 .6.3 ) for values of t from the interval [- T, T] . To do this we subdivide the interval [a, b] by means of the subdivision points b. x0 x1 < . . . It is here no restriction to assume that all subdivision points are continuity points of F(x) and that Lim
=
fl,--?- 00
c
a
< s.
=
n--?- oo
a
111
<
=
= I
< XN
max ( x1,: - X�c - t ) ....:. k <. N
<
=
e; T.
51
FUNDAMENTAL PROPERTIES
We note that
J: ei�££ dF.,(x) - J: e•�dF(x) � k� [ J :_ ei�££k dF.. (x) - J ::_�·�<£· dF (x)J , + kfJ J::_ , (eiw. _ eitx) dFn(x) - I:: _ , (ei�•- eit"') dF(x)} . It is easily seen th�t for I t I � T J::_, (ei�££• - e't"') dF.. (x) � mT J::_, dF.. (x) < e f:_, dF,. (x);
Fn (x) is replaced by F(x). It follows then L eit"' dF,. (x)- J >ilx dF(x) � k£1 J : _, dF.. (x)- f :: , dF(x) + 2e . _ The sum on the right-hand side of this inequality will not exceed 3s if n is sufficiently large, hence (3 .6.3) becomes I fn (t)-f(t) I � 6s for all t [ - T, T], provided that n is chosen sufficiently large. This is the statement of the corollary. Corollary 2 to theorem 3 .6. 1 . Let {fn (t)} be a sequence of characteristic functions and suppose that this sequence converges for all values of t to limit functionf(t). Assume that f(t) is continuous at t 0; then f(t) is also a char acteristic function. We remark that the limit of a sequence of characteristic functions is necessarily continuous for all t if it is continuous for the particular value t 0 . The continuity at t 0 is, however, an essential requirement of this inequality remains valid if from the preceding relation that
E
a
=
=
=
theorem 3 .6. 1 and cannot be relaxed. As an illustration we consider once more the sequence of rectangular distributions, discussed in Example 1 of Section We saw there that the distribution functions converge for all values of however, == � lim
3.4.
x;
n� oo
Fn(x)
Fn (x)
so that the limiting function is not a distribution. The characteristic function fn of is sin +
(t) F11 (x)
tn t ( ) J n - tn {1 for t 0 ( t ) n J �� 0 for t 0 n _
therefore so
1.
+
=
'
=
=I=
that the litniting function is not continuous for
t 0. ==
52
CHARACTERISTIC FUNCTIONS
The following corollary is a generalization of the continuity theorem. It applies to bounded non-decreasing functions and will be used in Chapter 5 .
Corollary 3 to theorem 3.6.1. Let- {Fn(x)} be a sequence of bounded non decreasing functions such that F ( oo) 0 and denote by fn (t) J'"., eitx dF., (x) their Fourier-Stieltjes transforms. The sequence {Fn(x)} converges weakly to a bounded, non-decreasing function F(x) and F(oo) - F( - oo) lim {Fn ( oo ) - Fn ( - oo )} if, and o ly if, the sequence {fn ( t)} converges to a function f( t) which is continuous at t 0. We prove first the sufficiency of the condition and write Vn fn ( O ) J"'., dF.,( y) for the total variation of F.,(x). Then lim Vn f( O ). Consider first the case f( O ) 0 . Then the sequence of distribution func tions Fn (x)!Vn converges weakly (according to theorem 3.6.1) to a distri bution H(x) and Lim Fn (x) H(x)f(O). If f(O ) 0, then Lim Fn(x) 0 so that the corollary holds in this case also. The necessity of the condition is an immediate consequence of theorem 3.6.1. Corollary 4 to theorem 3 .6 .1. Let {fn ( t)} be a sequence of characteristic functions and suppose that it converges uniformly to a limiting function f(t) in every finite t-interval [ - T, T]. Then the function f(t) is continuous at the point t 0 . To prove the corollary, we note that (3 .6.4) lf(t)-f(O) I � l f(t) -/n (t) J + l /n(t)-fn(O) I + l fn (O) - f(O) J. Let s be an arbitrary positive number ; we first choose n so large that I f(t)-fn (t) I � 3 and for I t I 1 =
n
=
n� oo
n
=
=
=
=
#
=
n� oo
=
=
=
s
-
�
=
53
FUNDAMENTAL PROPERTIES
t
Then we choose so small that
l fn(t) -fn(O) I � -3 , e
so that
l f(t) - f(O) I �
s.
The last inequality proves the statement of the corollary. We are now in. a position to modify somewhat the statement of the continuity theorem .
Theorem 3 .6.2 (second version of the continuity theorem). )} Let {Fn(x)} be sequence of distribution functions and denote by {fn ( t the sequence of the corresponding characteristic functions . The sequence {Fn (x)} converges weakly to distribution function F(x) if, and only if, the sequence {fn(t) } converges uniformly to a limiting function f(t) in every finite t-interval T, + T ]. The limiting function f(t) is then the characteristic function of [F(x). The statement of theorem 3 .6.2 follows immediately from the continuity theorem and from the corollaries 1 and 4. a
a
We conclude this section with two remarks concerning the weak con vergence of a sequence of distribution functions to a limiting distribution function.
Fn (x)}
It is possible that a sequence { of distribution func tions converges weakly to a limit but that the moments of the do not converge to the moments of be given Let, for instance,
Remark 1 .
F(x) F(x).
Fn(x)
F'YI (x)
F,.(x) = ! R,. (x) + ( 1 - !) e(x) , where R,. (x) is the uniform distribution over the interval [0, n] . Since the characteristic function of Fn (x) is " it e f., (t) = n! nzt-. 1 + ( 1 - n!) we see that Lim Fn (x) = s(x). Moreover, it is easily seen that the moment n�oo kn xk dFn (x) a (%) = J k+ 1 ,hcrefore lim a '�> = while the moments of the limiting distribution n� oo l{x') are all zero. Remark 2. ,_fhe weak convergence of a sequence {Fn (x) } of absolutely distribution functions to an absolutely continuous distribution by
oo
'1
continuous
oo ,
- 00
=
1
.
54
CHARACTERISTIC FUNCTIONS
F(x) does not imply the convergence of the density functions F� (x) F' (x). Define, for example, F"" (x) by 0 if 0 Fn(x) x ( 1 _ sin2nnx2nnx) if O � x 1 1. 1 if Then Fn(x) converges weakly to the uniform distribution over [0, 1] but (x) 1 - cos 2nnx does not converge to the rectangular density. Pn The continuity theorem suggests the expectation that two distribution function to
X <
=
X
�
<
=
functions whose characteristic functions do not differ much are close to each other in some sense. This idea was stated in a precise way by C. G. Esseen (1944) [see also B. V. Gnedenko-A. N. Kolmogorov (1954), pp. 196 ff.] . Esseen obtained the following results :
Theorem 3 .6.3 . Let A, T and be arbitrary positive constants, F(x) a non decreasing function and G(x) a real function of bounded variation. Let f(t) and g(t) be the Fourier-Stieltjes transforms of F (x) and G(x) respectively . Suppose that (i) F( - oo ) G( - oo) , F( + oo) G( + oo) (ii) f " I F(x) - G(x)ldx < oo "" (iii) G' (x) exists for all x and \ G' (x) I � A T f(t) - g(t) ( iv) r J - T t dt Then to every k > 1 there corresponds a finite, positive c(k) depending only on k, such that A j F(x) - G(x) I � k + c(k) . Zn T Theorem 3.6.4. Let A, T and be arbitrary positive constants, F(x) a non decreasing purely discrete function, and G(x) a real function of bounded variation. Let f(t) and g(t) be the Fourier-Stieltjes transforms of F(x) and G(x) respectively. Suppose that (i) F(- oo ) G( - oo) ; F( + oo) G( + oo) (ii) j """" I F(x)-G(x) ! dx < oo (iii) r 7• t
=
=
=
e.
s
s
=
'P
t
=
= B
55
FUNDAMENTAL PROPERTIES
the functions F (x) and G(x) have discontinuities only at the points xv (v 0, + 1 , + 2, . . . ; xv+ l > xv) and there exists a constant L > 0 such that lnf (xv+ l - xv) � L (v) I G ' (x) I � A for all x xv ( v 0, + 1 , +2, . . . ) . Then to every nuntber k > 1 there correspond two finite positive numbers c1 (k) and c2 (h), depending only on k, such that jF(x) - G(x) l � k2n + c1 (k)AT, provided that TL � (k). (iv)
=
#
==
s
c2
The limit theorems of probability theory give approximations for the distributions of normalized sums of random variables. Esseen' s theorems provide an important tool for the study of the error terms of these approxi mations.
3.7
Infinite convolutions<*> In this section we define and study convergent infinite convolutions and their characteristic functions. It is not our intention to present here an exhaustive discussion. We wish to give only a few results which will permit the construction of certain interesting examples. In Section we defined the convolution of two distributions and regarded it as a symbolic multiplication of distribution functions. It is clearly possible to extend this operation to more than two factors, and it is easily seen that the convolution of a finite number of distribution functions is a commutative and associative operation. Therefore the convolution of a finite number of distribution functions determines uniquely a distribution which is independent of the order in which the factors are taken. llefore defining convergent infinite convolutions we introduce a suitable notation and define certain sets which are useful in studying convolutions. 'l'he concepts and notations introduced are also convenient in connection with finite convolutions. I�ct , Fn be distribution functions. We write
3.3
Fb F2 , n (3 .7. 1 ) TI * F�c (x) II* FTc F1 * F2 * . . . * Fn n
•
k=l
•
•
=
n
k=l
=
for their convolution and use the symbol II* to denote convolution pro ducts. ,-f he convolution of a finite number of distribution functions is again ( Ill! )
-- - -- ----
'fhis section deals with a special topic ; familiarity with this subject is not required fo r nn understan ding of the rest of the book. We deal in Section 3.7 with certain sets of real numbers and use the customary set t l lt'orc t ic notations. Wc designate sets by Latin italic capitals and their elements by lower ense l _Jntin i tal i c l etters . Thus x E A means that the number x belongs to A ; A c B (or n ;::J A) n1 ean s that A is contai ned in B (or B contains A) ; A is the closure ; Ac is the com pletnml t of A. 'fhc ctnp ty set is denoted by 0.
56
CHARACTERISTIC FUNCTIONS
( .1) is, according n to the convolution theorem, given by the product IT fk ( t) of the corres a distribution function ; the characteristic function of 3 .7 k= l
ponding characteristic functions. In this section we shall need several lemmas which state simple properties of characteristic functions and of sequences of characteristic functions.
Lemma 3 . 7. 1 . F(x) be a distribution function andf(t) its characteristic function. Then Re [1 -f(t)] l Re [1 -f(Zt)]. Since Re [1 -f(t) ] J"" "" (1 - cos tx) dF (x) we obtain the statement of Let
�
=
the lemma from the elementary relation,
t � ; � sin 2 tx l( l - cos 2tx). 1 - cos tx 2 sin2 � Lemma 3 .7.2. Let {Fn(x)} be a sequence of distribution functions and {fn (t)} the corresponding sequence of characteristic functions. Suppose that limfn(t) 1 for I t I < t0, then Lim Fn(x) s(x). It follows from lemma 3 .7. 1 that the relation limfn(t) 1 is also valid in the interval I t I < 2t 0 and therefore-by iteration-for all real t, so that we can conclude that Lim Fn(x) ( ) Lemma 3 .7.3 . Let {Fn(x)} and {Gn (x)} be two sequences of distribution functions and suppose that there exists distribution F(x) such that Lim Fn (x) F(x) and Lim (Fn * Gn) then Lim Gn(x) s(x). F ; n n� oo ;;::: 2 sin 2
=
cos 2
=
n� oo
=
=
=
n� oo
=
= c; x .
n� oo
a
� oo
=
=
=
It follows from the assumptions of the lemma and from the con tinuity theorem that (3 .7.2a) lim n =
f (t) f (t)
and (3 .7.2b)
f(t)
n-+ oo
limfn (t)gn (t) f(t).
n� oo
=
1,
Since is a characteristic function we know that f(O) = and we con clude from (3 .7.2a) that there necessarily exists a neighbourhood sufficiently large and of the origin such that � � for = for Using (3 .7.2a) and (3 .7.2b , it is then seen easily that lim
< t0 I t I n I t I < t 0• I fn) (t) I gn (t) 1 t0 • The statement follows immediately from lemma 3 .7.2. ItI l,�ct F (.x) be a di stribution function ; the spectrtun S1'' of (x) is the <
fl,-)oo OO
J?
57
FUNDAMENTAL PROPERTIES
set of all points of increase of F
(x). It is easily seen that SF is closed, not
J dF(x) 1 . We give a second, similar definition. The point spectrum DF of a distri bution function F (x) is the set of all its discontinuity points. Clearly, DF is an at most denumerable (proper or improper) subset of SF. DF need not be closed, and can be empty ; in fact DF if, and only if, F is a continuous distribution. Let A and B be two, not necessarily disjoint, sets on the real line. We define the vectorial sum A ( + ) B of the sets A and B as the set of all real numbers x which can be written in at least one way in the form x a + b, where a E A and b E B. We agree to say that A ( + ) B if either A or B is empty. If both A and B are one-point sets, A {a} and B {b }, then the vectorial addition is equivalent to ordinary addition. If the set B contains� only the single point b, B {b }, then A ( + ) B A ( + ) {b} is obtained from the set A by the translation b. The vectorial addition of sets empty, and that
SF
=
=
0
=
=
=
0
=
=
=
is commutative and associative. The vectorial sum of two closed sets is not necessarily closed ; however, if A and B are closed and bounded sets then A B is also closed.
( +) Renzark.
The vectorial sum of two sets must not be confused with their set-theoretic union. We shall need in Chapter 9 a notation for the vectorial sum of identical summands A , and write ( l )A for and 3, . . . .
n (n)A (n - l )A (+ ) A A n 2, l�ernnza 3 .7.4. Let F1 (x) and F2 (x) be two distribution functions and let F1 * F2 be their convolution. Then SF SF ]( + ) SF2 while DFl ( + ) DF2 · DF f.�ct y and z S 2 and put w y+z. We select an arbitrary positive number � and conclude from the assumptions of the lemma that ft, (w +�)- F(w - Cl) f '"" [F1 (w + Cl - u) - F1(w-�-u)] dF2 (u) z+6 � [F1 (w-z +2� ) -F1 (w-z-2Cl)] J dF2 (u) [F1 (y+2�) - F1 (y- 2�)] [F2(z +�) - F2 (z -�)] > 0 . ' I � hcrcfo rc y + z S so that SF1 ( + ) SF2 SF. Since SF is a closed have also ( + ) SF2 SF. We still have to prove the relation SF1 ( + ) SF2 SF. We give an in that exists a point w which belongs to SF but =
=
/(,
=
==
=
E
SF1
E
F
=
=
=
z-IJ
Hct,
we
w
=
=
d i rect proo f and
SF1
E
assu m e
F
c
c
there
::>
58
CHARACTERI STIC FUNCTIONS
( + ) Sp2 • Since w E SF we have for any � > 0 F(w+�)-F(w- 15) f " oo [F1 (w + b - u) - F1 (w -�- u)] dF2 (u) > 0. But this is only possible if there exists a point u0 E SF2 such that [F1 (w +�- u0)-F1 (w -�-u0)] > 0. Put v 0 w - u0 ; then v 0 E Sp1 and w E SF1 ( + ) SF2 which is a contra not to SF1
=
==
diction, so that the first statement of the lemma is proved. In a similar way one can also prove the statement concerning the point spectrum. We also need another lemma which is of some independent interest :
Lemma 3 .7.5 . Let F(x) be a distribution function with characteristic function f(t). Then t2 J � / 2 dF(x) :::; 3 1 1 -f(t) I for I t I :::; : where r is arbitrary positive number. Since Re [ 1 -f (t)] j oo ( 1 - cos tx)dF (x) � 1 1 -f(t) I we see 1. m-
an
=
mediately that
00
J � ( 1 - cos tx)dF(x) � 1 1 -f(t) !. .
The statement of the lemma then follows easily from the fact that x2 � 3(1 - cos x) for � 1. . . . , be an infinite sequence of distribution functions. == Let In a purely formal manner we can introduce the infinite convolution ( t)
lxl
{Fk }, k 1, 2, 11*Fk - F1 *F * *Fk * 00
k=l
2
•
•
•
•
•
•
of the distributions of the sequence. In order to give this infinite con volution a definite meaning, we form for each positive integer the finite convolution
n
Pn (x) 11*Fk (x). The infinite convolution 11* F is said to be convergent if there exists a distribution function F(x) such that Lim Pn(x) F(x). We write then Pn(x)). (3 .7.3) F(x) 11* Fk (x) ( Lim n�oo The characteristic function of Pn(x) is the finite product pn (t) l1f1c (t), ==
00
k=l
==
(*f")
00
k=l
k
n
k=l
=
==
=
n
k=l
I n deal ing with convolutions i t i s often convenient to omit the variabl e and to write }f' i n s t·end o f l�' (x) .
59
FUNDAMENTAL PROPERTIES
and we conclude from theorem 3 .6.2 that the necessary and sufficient con dition for the convergence of the infinite convolution (3 .7.3) is that the sequence Pn ( t) should converge uniformly in every finite t-interval to a limitf(t). This limit is then the characteristic function of F (x) and is given by the infinite product f(t)
=
00
00
IT fk (t).
k=l
Let IT fk (t) be the characteristic function of a convergent convolution .
k= l
00
We next show that IT fk ( t) is uniformly convergent in the sense of the
k= l
theory of infinite products. ( t) Since lim Pn ( t)
=
f ( t) is a characteristic
function (namely of the convergent infinite convolution), there exists an interval I t I < t0 such that f( t), and therefore also the factors f�c (t), do not vanish for I t I < t0• The infinite product is then uniformly convergent (in the sense of the theory of infinite products) in this interval. It follows that lim fk (t) = 1 uniformly in I tl < t0, and we see from lemma 3 .7.2 that
k�oo lim f'l} ( t) n--?- oo
=
1 uniformly in every fixed bounded t-interval. There exists
N
therefore, for every bounded interval, an such that fn ( t) does not vanish on the interval if n > N ; this means that the infinite product which represents f ( t) is uniformly convergent. We now derive criteria for the convergence of infinite convolutions.
Theorem 3 . 7 . 1 . The infinite convolution F (x) IT* F�c is convergent if, +p n IT* Fk and only if, nLim s(x). n -+oo k= +ln+ v n Pn+p • ff* F1c so that Pn * G . IT* F1c and Pn We write Gn.p prove the necessity of the condition, we assume that the infinite convolution is convergent and note that Lim P + v Lim Pn F. We conclude from lemma 3 .7.3 that Lim Gn.v (x) c:(x). Conversely, if + n v s(x) then gn.v (t) (x) IT fk (t) converges uniformly to 1 in k=n+ l finite t-interval, so that f ( t) IT fk ( t) also converges uniformly in k= l ·fi nite interval. ==
00
k =-= l
==
=
' ro
k = n+ l
==
nP
k=l
n
==
==
I J i tn Gn . 1,
II
==
=
;.. I l l
l'Vcry
=
00
every ("j')
H r� c E . C . 'fi tch n1nrt-�h
( 1 939),
A . I . Ma rlntshcvich , vo1 . I
(1 965).
=
=
60
CHARACTERISTIC FUNCTIONS
Theorem 3 .7.2. Let F kII=l* Fk be a convergent infinite convolution. Then the infinite convolution R11 k=IIn+l* Fk is also convergent and Lim Rn (x) s(x). The convergence of Rn(x) follows immediately from theorem 3 .7. 1 ; n moreover, F Pn * Rn (where again Pn F(x), II* F7c) and Lim Pn ( x) k=l so that necessarily Lim Rn (x) ( ) =
00
=
00
=
=
=
= s x .
n� oo
=
n-+ oo
We next derive a sufficient condition for the convergence of an infinite convolution.
Theorem 3 .7.3 . Let {Fk} be a sequence of distribution functions and assume that the second moment oc2.k of Fk exists and that the first moment ocl.k of Fk is zero. Suppose that the sum k=l2: oc2,k converges ; the infinite convolution II * Fk is then convergent. k=l It follows from the assumptions and from Taylor ' s theorem that the characteristic function fk ( t) of Fk (x) can be written in the form ( 3 .7.4) A (t) 1 + �2 f�(fh t) ( l -&k I � 1 ). Let F (x) be a distribution function with finite moments of second order ; then its characteristic function satisfies the inequality I f" (t) I � J: x 2 dF (x). 00
00
=
00
We see therefore from ( 3 .7.4) that
fk (t) I � � t 2 cx2,k and conclude that the infinite product II fk ( t) is uniformly convergent in k =l 11
-
00
every finite t-interval, so that the statement is proved.
Corollary to theorem 3.7.3 . Let {Fk } be a sequence of distribution functions and assume that the integral M� J I x l � dFk (x) exists for some such that 0 < 1 . Suppose further that � M� < oo then the infinite con'lJOltt tion II'"' Fk is o v rg t . (J
oo
=
oo
d �
00
k >=; l
00
c
n e
en
lc = l
;
61
FUNDAMENTAL PROPERTIES
We note that for
holds for real
0 < � � 1 the inequality I sin z l�1 l z l� �
z. Therefore e1 itrc _ t l 2 sin tx2 =
so that I
� 2� - � 1
tx 1� < 2 1 tx I�
fn(t) - 1 1 f "" (eitre_ l) dFk (x) I < 2 1 t I � MZ. =
We conclude in the same way, as in the proof of theorem 3.7.3, that the 00
convergence of the series 2: M� implies the convergence of the infinite 00
k =l
convolution. We next give a necessary and sufficient condition for the convergence of an infinite convolution.
Theorem 3 .7.4. Let {Fk } be a sequence of distribution functions and assume that the first mornent a.1.k of Fk is zero. Suppose further that the spectra SFk are uniformly bounded. The infinite convolution kII=l* Fk is convergent if, and only if, the series k�=l a.2.k is convergent. ( t) The sufficiency of the condition follows from theorem 3 .7.3, so that we 00
00
need prove only that it is necessary.
F IIk=l* Fk be a convergent convolution of distributions which satisfy the conditions of the theorem ; write Pk for the distribution function conjugate to Fk , and put Gk F�c * Pk. Let a.� .k and a.tk be the first and �ccond moment respectively· of G7c. Then a.tk 0 Let
=
00
=
=
while
(3 .7. 5 )
II F k that II* Pk and therefore * k= l k= l IHo IIII(c Gk are convergent. Let fk ( t) and gk ( t) be the characteristic funcof Fk (x) and Gk (x) respectively. The convergence of the infinite
We conclude from the convergence of a
00
00
00
"' ,. ,� 1
tions
('!' ) 'I'hc
t notncnts.
unifo rm houn dedn css of the spectra ensures the existence of the second
62
CHARACTERISTIC FUNCTIONS
convolution
Gk II* k= l 00
implies the convergence of the infinite product
g�c(t). Since g�c (t) I (t) j2 is real and positive, we see that the product f II k k= l is absolutely convergent. Therefore the series (t) I < oo . Tig (t) 1 -g 1 k k k= l k� l 00
=
L: 00
00
It then follows from lemma 3.7.5 that
l\ J�.x2dGk (x) < oo for any real r. Since the spectra SFk are, by assumption, uniformly bounded, this is also true for the spectra SFk of the conjugate distributions, and we conclude from lemma 3.7.4 that the spectra SGk are also uniformly bounded. Therefore there exists a value r such that Gk (x) is constant for I x I > r and all k. It follows from (3 .7.6) that 2: cxtk < oo . k=l (3 .7.6 )
00
In view of (3 .7.5 ) we have then
< oo, k cx 2 k=l 00
2:
'
so that the condition of the theorem is necessary. We also need some properties of the spectra of convergent infinite con volutions. For this purpose it is convenient to introduce the following terminology. The closed limit inferior (t) of a sequence {An } of sets is the set of all points which have the property that every neighbourhood of contains at least one point of almost all sets An (i.e. all sets An with sufficiently large). We write Li An for the closed limit inferior of the sequence {An } · The statement E Li An means therefore that there exists a sequence of points {xn } such that Xn E An and lim Xn = We note that
x
n
x
x
x.
n� oo
is a closed set.
Theorem 3.7.5. Let F k=l II* Fk be convergent infinite convolution; then Li SPn • Li [SF1 { + ) • • { + ) SFn] SF =
=
•
a
00
=
For the proof of this theorem we need the following le1nma :
("t)
p p . 1 46 , 1 47 , uses the term "untere abges chl osscne
S<.� c also C . l(u ratowski ( 1 9 5 2) , p . sequence as defined by P. l laln1os (19.50). F. 1-I ausdorff ( 1 927),
limes " . 241 . 1..,his i s the cl osu re o f the i n feri or l itnit of the
63 Lemma 3.7.6. Let Gn (x) (n 1 , 2, . . .) and G(x) be distribution functions and suppose that Lim Gn (x) G(x). Then SG IJi San · Let x Sa and select h so that x + h and x - h are continuity points of G(x). Then G(x + h) -G(x-h) lim [Gn (x + h)-G"' (x - h)] > 0 so that G,., (x + h)-Gn (x - h) > 0 for sufficiently large n, say n > N, that is x E San and the�efore x E Li S0n, so that the lemma00is proved. We proceed to prove theorem 3 .7.5 . Let F IT* Fk be a convergent infinite convolution. vVe write again Pn IT* Fk and Rn TI * Fk so that F Pn Rn and Lim Pn F, while-according to theorem 3 .7.2Lim Rn s(x). It follows from lemma 3.7.6 that SF Li SPn so that we have only to show that SF Li SPn· Let x0 E Li SP n and let 'Y) be an arbitrary positive number. The open interval (x0 - rJ, x0 + rJ) then contains points of all the sets Spn, provided n is sufficiently large, say n N1• This means that FUNDAMENTAL PROPERTIES
=
n-+ oo
E
=
c
=
n� oo
=
=
n-+ oo
n� oo
lf(c
=
=
n
k=l
=
k=l
=
oo
k = n+ l
c
�
>
(3 .7.7a) Since Lim
Rn (x) s(x), there exists an integer N2 such that (3 .7.7b) We select > N0 max (Nh N2) and note that F Pn * Rn , so that J?(x0 + 2n) -F(x0 - 2'Y)) f"' 00 [P., (x0 + 2'Y) - y)- Pn (x0-2n - y)] dRn (y) [Pn (x0 + 3n) -Pn (X 0- 3 1J)] f� '1 dR., (y) � [P { X o + 'Y) ) - P { X o -'Y) )] [Rn { + 'Y) ) - Rn { - 'Y)) ] > 0 ; this follows immediately from (3 .7.7a) and (3 .7.7b). Therefore x 0 E Li Spn i rnplies that x0 E SF, so that the theorem is proved. =
n
=
=
=
�
n
n
We mention without proof two interesting results concerning infinite convolutions.
00 'fheorem 3.7.6. Let F kIT= l* F�c be a convergent infinite convolution and dt}note by p1c the maximum jump (saltus) of the distribution function 00 Fk (x). The point spectrum DF if, and only if, the infinite product ITPk diverges result (1 93 1 ) . =
=
' rhis
0
is due to P . IJcvy
k= l
to
64 00 Theorem 3 .7. 7. Let F k=IT*l Fk be a convergent infinite convoZ.ution of purely discrete distribution functions Fk. Then F is pure, that is, F is either purely discrete or purely singular or purely absolutely continuous. For the proof we refer the reader to B. Jessen-A. Wintner (1935) [theorem 35 ] or Wintner (1947) [No. 148] . We next discuss a particular case, i.e. the purely discrete distribution function B(x) which has two discontinuity points at x 1 and x 1 + and a saltus of � at each of these points, B(x) �[s(x + 1) + s(x- 1 )] . The corresponding characteristic function is b(t) cos t. Let {rk } be a sequence of positive numbers. In the following we shall use the sequence of distribution functions ( (3.7.8) Fk (x) B ;J . CHARACTERI STIC FUNCTIONS
=
= -
=
=
=
=
( ft* B :J
The infinite convolution
symmetric Bernoulli convolution. (x). F k (X2.k r�, k 00 (3 .7.9) � r� k =l
(X1.k, �2.k . l k � fk ( t) rk t. rk r�c.
be the first- and is called a Let = 0 second-order moments, respectively, of It is easily seen that and = = cos while the characteristic function The spectrum SFk = DF consists of the two points and Suppose now that <
oo .
) ( X F(x) [.J;_* Fk (x) [.J;_* B rk
Then the conditions of theorem 3 .7.3 are satisfied and (3 .7. 10)
=
oo
=
oo
9)
is a convergent infinite convolution. Condition (3 . 7. is therefore sufficient to assure the convergence of a symmetric Bernoulli convolution. Conversely, if we suppose that a symmetric Bernoulli convolution is convergent, then we can conclude from theorem 3 .7. 1 that Lim = hence lim
Fk (x) s(x);
f (t) k k--->;00
r 0. The spectra SFk are therefore uniso that lim rk t 1, k 00 00 formly bounded, and we see from theorem 3 .7.4 that condition (3 .7.9 ) is also necessary for the convergence of the symmetric Bernoulli convolution (3 .7. 10). We next study its spectrum Sp. point x i in the spectrum SF if, y =
lim cos
k-+
=
=
� 00
]c-';
A
and only if, it is possible to choose for ever
n
s
the sign of rn in such
a
way
65
FUNDAMENTAL PROPERTIES
n· In the r n=l case where 2: Yn < oo, say A [-A, A] � rn , this means that SF n n= l =l and that -A and + A are, respectively, the smallest and greatest values contained in Sp. If � Tn is divergent, then it is possible to represent any n= l real number x as the sum of a conditionally convergent series of the form x n=2:l r.,u so that SF is the whole real line. We next show that the point spectrum of F is empty, i.e. (3.7.11) n Let again P., IT* Fk and write Gn Pn _1* ( IT* Fk) , so that k =l k=n+ l F G * Fn or F(x) f " oo G.,(x -y)dFn(y). It then follows from (3.7.8) that (3.7.12) F(x) � [Gn (X - rn)+ Gn(x + rn)]. Let s(y) and sn( Y) be the saltus of F(x) and of Gn(x), respectively, at the point x y. It follows from (3.7.12) that s(y) � [sn(y- rn) + sn (y + rn)] and it is easily seen that (3.7.13) We give an indirect proof for (3. 7.11) and assume therefore that there exists a point x0 Dp. Then s(x0) > 0, and it is possible to choose a positive integer p such that s(x0) > p-.1 We next determine p positive integers such that rn1 > . . . > rnp· This is always possible since the rn tend to zero. 2p numbers x0 r (j 1, 2, . . . , p) are then distinct and we see from (3.7.13) that s(x0 + 2rn1) + s(x0-2rnJ s(x0) (j 1 , 2, . . . , p). l ienee � [s(x0 + 2rr.1 ) + s(x0 - 2rn1 )] ps(x0) > 1.
that
x
becomes the sum of a convergent series of the form � 00
00
=
00
c
00
=
00
+
- '
=
=
oo
=
n
=
=
=
=
E
n 1 , n 2 , . . . , nP
r"'• >
'rhc
+
n1
=
�
=
p
j = I,
B ut this i s imposRiblc ; hence /)p,
�· ..
+
0.
�
66
CHARACTERISTIC FUNCTIONS
3.7.6,
This result is also a consequence of theorem but we preferred to give here a direct proof. We also note that we can conclude from theorem that a convergent symmetric Bernoulli convolution is either purely singular or ( purely) absolutely continuous. We summarize these results in the following statement :
3.7.7
Theorem 3.7.8. The necessary and sufficient condition for the convergence of the symmetric Bernoulli convolution F (x) = IT* B(rx,c) is the convergence of the sum � r�. The characteristic function ofF (x) is then given by the infinite product f(t) = IT cos rk t. The spectrum SF is a bounded set if the series � rk converges, but is the whole real line zf � rk diverges. The point spectrum of an infinite symmetric Bernoulli convolution is always empty, and F(x) is either purely singular or absolutely continuous. We next consider briefly the case where the rk form a geometric series, rk = ak. Corollary to theorem 3.7.8. The function f(t) = IT cos ak t is the charac teristic function of a convergent symmetric Bernoulli convolution F(x) == IT* B(xa -k) if, and only if, 0 < a < 1. k=l
00
k= l
00
k=l
00
k=l
00
k=l
00
k=l
00
k=l
We finally mention, without proof, another interesting result concerning symmetric Bernoulli convolutions with bounded spectrum. We consider a convolution
(3.7.14) where the series � 00
k=l
rk converges, and write = rk (n == 0 , 1, 2, . . .) Pn
for the remainder of this series.
L CX)
k =n+l
Theorem 3.7 .9 . Suppose that rn > (or equivalently Pn n. Then Pn
n-+ oo
>
2p n +1)
for all
/{ere is the spectrurn of the convolution (3.7.14), while l.�( ..�F) is the l,�ebesgue 1neasure l�f S /)p
]1, ·
67
FUNDAMENTAL PROPERTIES
3.7 .9
For the proof of theorem we refer the reader to R. Kershner A. Wintner or to A. Wintner Theorem permits us to decide whether a convolution of the form is singular. We consider a particular case.
(1935)
(1947). 3.7.9 (3.7.9) Corollary to theorem 3.7.9 . Let 0 < a < � ' then the symmetric Bernoulli convolution F(x) k11= l* B(xa-k) is purely singular. ==
00
We conclude this section by giving a few examples.
(I) Let
r �!; then f(t) !1 cos (:, ) is the characteristic function ..
=
=
mentioned in the footnote to page 20.
r k-n (k 3 , 4, . . . ) ; then f(t) 11n=l cos (k -n t) belongs to a singular distribution with a bounded spectrum, and it can be shown that lim sup I f(t) I > 0. l t l-?-oo (Ill) If a is a rational number, 0 < a < l, but not the reciprocal of an integer, then R. Kershner (1936) has shown that the singular characteristic function f (t) cos (ak t) satisfies a relation I f(t) I O[(log I t 1 ) -Y] 11 k=l o(1) as I t I -+ oo (y > 0 ) ; therefore we have in this case limtl sup f(t) I 0. l oo (IV) If r 3 -n we obtain, except for a factor eit/2, the characteristic function ( 2. 1 . 7 ) . cos · We can then show by an elementary (V) If r,. z -n then f(t) A zn sin t computation (given in section 6. 3 ) that f(t) r(t). This is the t characteristic function of the rectangular distribution and is therefore absolutely continuous and has the interval [ - 1 , 1 ] as its spectrum. (VI ) For r 4 -n we obtain the singular characteristic function J(t) k=lIT cos (!_4k)
( II) Let
n
=
==
==
00
==
00
=
=
l �
=
=
n
=
=
t
00
=
=
+
n
==
wh i ch we shall need later.
=
1935 ,
Additional examples can be found in B. J essen-A. Wintner ( ) ){. l{ershner ( ) A. Wintner and A. Wintner ( ) The first of these references also contains examples which show that the spectrum of a singular as well as of an absolutely continuous symmetric Bernoulli convolution can be bounded o r the full real line.
1936 ,
(1947)
1938 .
C R I T E R I A F O R CHA RA C T E R I S T I C F U N C T I O N S
4
It is frequently of interest to decide whether a given complex-valued function of a real variable is, or is not, the characteristic function of some probability distribution. The inversion formulae provide a method to answer this question. While this approach is theoretically always possible it is often not practicable. We therefore develop in Sections 4.1-4.4 criteria which can be used to decide whether a given function is a charac teristic function . Section 4.5 deals with an essential property of charac teristic functions ; knowledge of this property helps us to realize that the characteristic functions are practically a unique tool for simplifying the analytical treatment of certain probability problems. 4. 1 Necessary conditions Theorems 2. 1 . 1 and 2. 1 .2 assert that every characteristic function satisfies the relations 1 and / ( and is uni formly continuous. Thus, these theorems already provide useful necessary conditions which a function must satisfy in order to be a characteristic function. However, these conditions are not sufficient. To show this we first prove the following theorem and use it to construct an example.
1/(t) I < /(0)
f(t)
t) f(t),
=
=
Theorem 4.1.1.2 The only characteristic function which has the form f(t) 1 + o(t ) as t -+ 0 is the function f(t) 1 . Let f(t) be a characteristic function and assume that f(t) 1 + o(t 2 ) as t -+ 0. It follows then from theorem 2.3 . 3 that 0. Since oo IX2 j oo x 2 dF(x) [where F(x) is the distribution function corresponding to f(t)] it is seen that F(x) must be constant over every interval which does not contain the point x 0; that is F(x) e(x) and f(t) 1. The function f(t) e- t4 satisfies the conditions of the theorems 2. 1 . 1 1 + o(t 2 ). Therefore we see from theorem 4.1 . 1 that and 2. 1 .2, but e - t4 e- t4 is not a characteristic function. This example shows that the neces =
=
oc 1
=
oc2
=
=
=
=
=
=
=
==
sary conditions stated in theorems 2.1 . 1 and 2. 1 .2 are not sufficient.
Corollary to theorem 4.1.1. Let w(t) o(t) as t -+ 0 and suppose that w ( t) w(t).2 Then the only characteristic function of the form f(t) 1 + w(t) + o(t ), t -+ 0, is the function f(t) 1 . a charac We know [corollary 2 to theorem 3 .3 . 1 ] that .f(t)f( - t) function . t assumptions the corollary f(t)f(-t) -
=
teristic
=
-
=
as
Under
=
he
of
is
69
CRITERIA
w(t) + o(t 2)2][ 1 - w(t) + o(t 2)] = 1 + o(t 2), hence according to theo [1 +4.1.1 e f(t) 1 2 =2 f(t)f( - t) 1 or f(t) = eiat (a real). Therefor l f(t) = 1 + iat - � a t +o(t2) and this has the form 1 + w(t) + o(t 2) (with w(t) = o(t)) only if a = 0 so that f(t) 1. = rem
=
=
We next discuss an inequality which every characteristic function must satisfy and whicl1 can therefore also be regarded as a necessary condition for characteristic functions. This inequality is also of some independent interest. its characteristic function. Let be a . distribution function and Then the inequality
f(t) (4.1.1) Jf lxl
�
�
>
By induction we obtain easily the following condition :
Theorem 4.1.2 . Let n be a non-negative integer; then the inequality 1n Re [ 1 - f(2nt)] Re [ 1 - f(t)] 4 satisfied for every characteristic function. We now consider a characteristic function which has the property that (4.1.3) l f(t) I < A < 1 if I t I > B. l1' rom theorem 4.1. 2 , applied to the function I f(t) 1 2, we see that 1 2 1 - l f(t) l 4;; [ 1 - l f(2n t) l 2] . ,ct t be a fixed value such that I t I < B, and choose n so that Bn < I t I < 2n-B l· 2 t rhcn-according to (4.1. 3 )2 1 t while -n > ---.2 4 4B >
is
1
>
70
CHARACTERISTI C FUNCTI ONS
4.1. 2 the inequality l - l f(t) l 2 > 4� 2 ( l - A 2).
Hence we obtain from theorem
A slight modification yields the following corollary :
Corollary to theorem 4.1. 2 . Let f(t) be a characteristic function which satisfies (4 .1.3); then 2 2 ( t l f(t) l < 1 - ��� ) for all t such that 0 < I t I < B. We next discuss another important property of characteristic functions. Theorem 4.1. 3 . Letf(t) be a characteristic function and let N be an arbitrary positive integer. Denote by �j= 1 k�= 1 f(t; - t�c) �j lk where t1 , t2, , iN are arbitrary real and �1 , �2, . . . , �N are arbitrary complex , t2, , iN, numbers. Then S is real and non-negative for any choice of N, t 1 �1 , �2 ., �N· Let F(x) be the distribution function which corresponds to f(t). Then S 3"2:.1 "'[-/; lk J oo exp [i (t; - tk)x] dF(x) oo oo "' u1 e � ; J oo c�1 ) (£/k e-itldJ;) dF(x) 2 oo J oo j=�1 �i eitix dF (x). The last expression is real and non-negative. s
•
•
N
=
N
•
•
'
•
•
•
•
=
N
N
_
=
N
4.2
Necessary and sufficient conditions The property of characteristic functions which is described by the last theorem suggests the introduction of a concept which is useful in formu lating necessary and sufficient conditions for characteristic functions. of the real variable is said to be A complex-valued function for oo < < -t- oo if the following two conditions are satisfied : ( i) is continuous ; ( ii) for any positive integer and any real and any complex the sum
f(t)
negative definite - t f(t) �1, . . . , �N s
=
t
non
N t1 , , iN � � f(t; -tk)�; �lc •
N
i=l
•
•
N
7c = l
is real and non-negative. W c establish next a few properties of non-negative definite functions.
71
CRITERIA
Theorem 4.2. 1 . Let f(t) be non-negative definite. Then (a) f( O ) is rea� df( O ) 0 (b) f( - t) = f(t) (c) I f(t) I � f( O). Proof of (a). Put N = 1, t1 = 0, �1 = 1 ; then (ii) implies (a). Proof of (b). Put N 2= 2, t1 2= 0, t2 = t�and choose arbitrary �1 and �2• Then S = f( O )[ I � 1 1 + I � 2 1 ] + f( - t)�1� 2 + f( t)� 2 � 1 . It follows therefore from (a) and ( ii} hat f( -t)�1 � 2 + f(t)� 2 � 1 is real for any � 1 and ;2 • W e write f( - t) = a1 + i{J1 ,/ (t) = a 2 + i{J2 , � 1 � 2 = y+ i�. Then (C(1 + i{J1)(y + i�) + (C(2 + i{J2)(y - i�) is real, so that ({J1 + {J2 )y + ( a1 -a2 )� = 0 for any y and � - This is only possible if {J1 + {1 2 = 0 and a 1 -a 2 = 0, so that (b) is satisfied. The property (b) is sometimes expressed by stating that the function f(t) is "Hermitian". of (c). We again put N = 2, t1 = 0, t2 = t but choose �1 = f(t), Proof �2 = - I f(t) I · Using (ii) and (b) we see that 3 0. S = 2f( O ) I f(t) l2 - 2 l f(t) l In the case where I f ( t) I > 0 this inequality immediately yields (c). Since [by (a)] f( O ) 0, relation (c) holds in a trivial way if I f(t) I = 0. We can now formulate a criterion for characteristic functions. Theorem 4. 2 . 2 (Bochner's theorem). A complex-valued function of a real variable t is a characteristic function if, and only if, (i) f(t) is non-negative definite (ii) f( O ) = 1 . �
�
-
t
�
�
'"fhe necessity of the conditions is established by theorems 2. 1 . 1 and 4. 1 .3 so that we need prove only their sufficiency. We therefore assume t h at is a non-negative definite function and choose positive integers a nd N and a real number and put = = It follows then from the definition of non-negative definiteness that
f(t)
n
t3 jjn, �i e- ijx. ) 1 f( sp� (x) = N n exp [-i(j- k)x] 0 all The difference j - k = r occurs in N - 1 r I terms of this sum ; is a n integer between - N + 1 and N- 1 . We collect these terms write ) i!J ( 4·.2. 1 ) $� (x) = f (1 - N f(r jn) e- irx 0. x
N- 1 N - l
fo r here and
r
x.
' I �hl�rcfore
i"Eo k"':,o
r= -N
"- k 1
�
�
72 or
CHARACTERISTIC FUNCTI ONS
( 4 .2.
s ) = __!_ r " eiB"' <,p� (x) dx. ! 2) ( 1 - �) ( n 2n J N
We now introduce the function
-n
0
� J � sp; (y) dy
(4.2.3) F<;) (x) =
2 1
4 )
..
then ( .2.2 can be written as
for x < - n for - n
�x
< n
for x � n
(4.2.4) (t - 1�1 ) !(:) r , ei"'" dF<:) (x). We see from (4. 2 .1) and (4. 2 .3) that F�(x) is a non-decreasing, right continuous function and conclude from (4. 2 . 4) and assumption (ii) that co J co dF<:) (x) f(O) 1 so that F<:) (x) is a distribution function. We =
=
=
{F<_N)
consider next, for a fixed n, the sequence (x)} of distribution functions. According to Helly's first theorem there exists a subsequence (with lim Nk = oo )
{F�>(x)} k
k�oo
F(n)
which converges weakly to a non-decreasing, bounded function ( x) . This limiting function is a distribution function since for any N and any c; > 0 we have (n + c;) = 1 . We see from ( - n - c;) == 0 while ( that
4.2. 4)
F(;)
f(s;n) =
lim
�oo
F�
( 1 - �)j(s; n) == Nk
lim
lc-'>-oo
Applying Helly's second theorem we obtain
J"
-n
ei•"' dF};1 (x). k
(4. 2 .5) f(sjn) = r " eis"' ap
I.Jet sequ en ce
�::;
t,
such th at
is
detcrtninc
a
73
CRITERIA
(4.2. 7)
� t-(kin) < (1 jn). We write () t - (k;n); then 0 () < (1 /n) and I fn (t) - f., (kjn) I , J'"',. ei
�
=
=
1
..
We apply Schwarz's inequality (see Appendix B) to the last integral and obtain
l fn (t) - J.. (k;n) L � [2 f"',. (1 - cos Ox)dF.. (x)r1 2 2 ' 11 l < p n a cos nO ) (z) (1 [2 r " J Since nO < 1 we have 1 - cos nOz � 1 - cos z for I I � n ; hence I fn ( t) -/.. (k /n) I � [2 r" (1 - cos ) dF
z
=
z
z
=
=
=
=
Since we
=
n-+ oo
==
n� oo
(t) f = lim {[fn (t)-fn (k/n)] + fn(kjn)} � oo n�oo n see fro1n (4. 2 . 8 ) and (4.2. 9 ) that for all t lim fn (t) f(t). continuous function f ( t) is therefore the limit of the sequence {fn ( t)} characteristic functions and is therefore (corollary 2 to theorem 3. 6.1) lim
n
=
n-+ oo
' I 'he
()r also a characteristic function. This completes the proof of Bochner�s t
hcorem. We derive next another criterion which is due to H. Cramer.
'fhforem 4. 2 . 3 (Cramer's criterion). A bounded and continuous function J'(t) a characteristic function if, and only if, 1 (i) .f (O ) ( i i) VJ( x, A) J : J : f(t - u) exp [ix(t -u)] dtdu non-1u)gative for all real and for all A 0. £s
=
is rtal and
=
x
>
74
CHARACTERISTIC FUNCTI ONS
00
We first prove the necessity of the condition by substituting
f(t -u) = f 00 exp [i�t - u) y] dF ( y)
into (ii). Since the inversion of the order of integration is permissible we obtain easily oo [1 - cos A(x + y)] dF ( y) . 'lfJ (x, A) = 2 (x + y) 2 - oo This shows that 1p(x, A) is always real and non-negative. To prove tl1e sufficiency of the condition we assume (i) and (ii), so that 1 1 � 0. (4.2. 10) p(x, A) = VJ(x, A) = A A In the last integral we introduce new variables t = u-v z = This change of variables transforms the original region of integration into a parallelogram. One diagonal of this parallelogram is located on the z-axis and decomposes it into two triangles. The function p(x, A) is then computed by adding the two integrals taken over these triangular regions. Thus
f
f A0 f A0 f(u-v)e�(. u- v>x dudv
v.
p(x, A)
=
A f x t f f:-taz i f:J � /z ei dt+ � dt. f(t)e (t) [ ] [ ] � �A
We introduce the function
( 1 - � ) f(t) if I t I < A 1 1
(4.2. 1 1 )
0 and can write (4.2. 10) in the form
f oo ei� fA (t) dt 0. . 1 B IX' ) 1t f ( ] (u , A) = Zn - 1 - B p(x, A) e ux dx, B B + �) < f t i > :c A d . ( t 1 dt f e x ( ( u , A) = _!_ u ) f [ ] n oo B 2 p(x, A) =
Let
otherwise
oo
;;,:
B
then
]B
00
-B
The order of the integrations may be inverted ; moreover a simple computation shows that n Lx l dx = 2 � -= �o � J(�-��._t )B]_
f ei(t +u>oo (1 �
n
-
B
)
B(u
-1-
t )2
•
75
CRITERIA
Therefore
J oo
(u, A) == n!
1 - cos [(u + t)B] fA ) B( jB Here we introduce a new variable by and obtain - cos ]n (u, A) = /A
1B
u+t 2 (t)dt. v t (v )- u 1 J 1 2 v ( v - u) dv. (4.2. 1 2) n v B From the well-known relation<*> 1 - cos2 v dv n J v 2 and ( 4. 2 . 1 2) it follows that lim ]n (u, A) = /A (-u). - oo
=
00
- oo
�
'!
00
=
o
B� oo
The function which is defined as
�2 ( 1 - 1 ; 1 ) p(x, A ) for l x l � B and 0 outside the interval ( - B, B) is non-negative and bounded. If it is multiplied by a suitable normalizing constant C it becomes a frequency function. Therefore Cn J ( u, A) is a characteristic function for any B and A. We then conclude from corollary 2 to the continuity theorem that CfA ( - u) lim Cn]n (u, A) , we see that C 1 and that is a characteristic function. Since /A (0) 1 /A (u) is a characteristic function for any A. We apply once more the continuity theorem and see finally that f(t) lim /A (t) B
B
==
B� oo
=
==
=
A-+ oo
is a characteristic function. Thus the sufficiency of the condition is
established. rrheorem is a particular case of more general results derived by In this paper he also gave conditions for the possibility C�ramer of representing more general classes of functions by Fourier integrals . We derive next a condition for absolutely continuous distributions which will later be extended and will yield a general criterion.
4. 2 . 3 ( 1 939) .
'flteorem 4.2.4. The complex-valuedfunction f(t) of the real variable t is the characteristic function of an absolutely continuous distribution if, and only d ts the representation (i) f ( t) s:'"' g(t O)i{O) d() it
a
rn
if.
i
=
���
. .. _ . ---- - �
<• > Sec footnote on
page 49 .
+
76
CliARACTERI STIC FUNCTIONS
where g(O) is a complex-valued function of the real (variable () such that (ii) is satisfied.
J :, lg(O) l 2 d0
=
1
Before proving this theorem we summarize some known results con cerning quadratically integrable functions. For the definitions used in this summary as well as for the statements of the theorems quoted. we refer the reader to R. E. A. C. Paley-N. Wiener ( 1 934). Let be a function which is quadratically integrable over - oo, + oo) ; according to Plancherel's theorem has a Fourier transform which is also quadratically integrable over - oo, + oo ) and which can be written as
cp(x)
(4.2. 1 3)
cp(x)
(u)
Here the symbol
=
1 A�oo y2n
l.i.m.
(
(
J A eiuoo �(x) -A
dx .
l.i.m. A�oo
denotes the limit in the mean as A tends to infinity. It is known that
A �(x) l.i.m. y'Zn J A e- iuoo (u) du A 1 �(x) l.i.m. y'Zn J - A ei""' ( - v) dv. =
or
=
cfo(x)
A-+ oo
1
-
A�oo
h(v)
v).
Hence is the Fourier transform of = ( It is easily seen also is the Fourier transform of cp( _:_yf According to from ( 4 . 2 . 1 3 that Plancherel's theorem we have the equation
)
(4.2. 14)
From Parseval' s theorem we get the following relations
f '"' [�(u)p e- i""' du J : h(y)h(x -y)dy J oo oo <J>( -y) ( - X + y) dy oo J "'
=
(4.2. 15)
=
=
00
To prove the necessity of the conditions of theorcn1 4 . 2 4 w e consider an arbitrary fr e q uen cy function 'fhen (/)(.x) = vj)(x) is q�tad ratically
p(x).
.
77
CRITERIA
integrable over ( - oo , oo ) and we write g(u ) for its Fourier transform. From the first of the equations ( we obtain Letting
x
4.2.15) oo -i f � e ""'p(u) du f =
oo
=
- t we get
oo
x d
g( - y) g( - + y) y .
4.2.16) f eih
oo
oo
=
oo
oo
=
=
To prove their sufficiency we suppose that the function f(t) admits the representation (i) by means of a function g(O) which satisfies (ii). Then g(()) is quadratically integrable over ( - oo, + oo) and has a Fourier trans We see from (ii) and ) that form which we denote by
G(u). oo
f I G(u) 1 2 du oo
I G(x)
=
1
(4.2 . 14
so that 1 2 is the frequency function of some absolutely continuous distribution. It follows then from the second equation that
(4.2. 1 5) f I G(u) l 2 ei""' du f g(y) g(x + y) dy hence the integral on the right is the characteristic function of an absolutely continuous distribution. Applying theorem 2.1.3 we see that its complex conjugate f(t) f 00 00g(x + y)g( y) dy oo
=
oo
oo
oo
,
=
is also a characteristic function. This completes the proof of the theorem. We next derive a condition which is not restricted to absolutely con tinuous distributions.
'theorem 4.2.5 (Khinchine's criterion). The complex-valued function f(t) of real variable t is a characteristic function if, and only if, there() exists a sequence {gn (fJ)} of complex-valued functions of the real variable satisfying (i) f 00 I g ( e ) 1 2 dO 1 00 that the relation (t + O)g;:(O) dO (ii) J (t) !�� f unifortnly £n every finite t-interval. I he
sutlt
holds
=
n
=
oo
""g
..
78
CI-IARACTERISTIC FUNCTI ONS
To prove the necessity of these conditions we must only note that every distribution function is the limit of a sequence of absolutely continuous distributions. We apply the preceding theorem to the characteristic functions of these approximating distributions and see that our conditions are satisfied. T o prove the sufficiency of the conditions we assume that the sequence (0) } is given and that these functions satisfy (i). According to theorem the functions
{gn 4.2.4
/..
(t) f" g.. (t + 0) g (0) d() =
..
00
are characteristic functions and condition (ii) states that = lim
j(t)
n-+
oo
fn(t)
is the uniform limit of a sequence of characteristic functions in every finite t-interval. The sufficiency of the condition follows immediately from the second version of the continuity theorem. We conclude this section by giving a necessary and sufficient condition which an even function must satisfy in order to be a characteristic function. This condition involves the Hermite polynomials which are defined by the relation dn - x2 2 2 2 x / (4.2 .1 7) e dx e / . It is easy to see that Hn(x) is a polynomial of degree n in x. We first derive an estimate for the polynomials Hn (x). Lemm a 4. 2 .1. Let Hn (x) be the Hermite polynomial of degree then n 1 ). ; ( 2 l 2zn 2 ! ' 1 1 "' r :; :: ( e n I H.. x) l Hn (x)
=
n
n,
We differentiate the relation
oo �v2n J
- 00
exp { - y 2 /2 + iyx } dy
=
e - x2/2
n times and obtain) in view of (4.2. 1 7), ro 2 / (4.2 .18) H ( ) rf"' ,)2n f (iy)n exp [ - y 2/2 + iyx] dy. .. x
--r hcrefore
, 1-1 '
r•
( )I " """
=
-
� {;;,W"/ 2
�
•
oo
,, 1 I y In v2'n -
__
- �··
_
-�
J
oo
00
2 oo / f " ero 2 2 e-11"/ dy -vz;.; tn e- t'/2 dt =
�
-
0
CR ITERIA
zn! 2 ex'/2 r oo (n- 1) 2 V d V / e- V Vn so that the lemma is proved.
Jo
=
=
e"''/2 zn/2 (n) - lf2 r
(n +2 1 )
79
Theorem 4.2.6 (theorem of M. Math-ias). Let f(t) be a real, even, cont-inuous funct-ion wh-ich 'is absolutely 'integrable over ( - oo, + oo). Wr-ite for p > 0 and n 0 , 1 , 2, . . . 00 n C271 (p) ( - 1 ) J f(px) e - x'/2 H2n (x) dx. 00 The funct-ion f(t) 'is a character-ist-ic funct-ion if, and only if, (i) f( O) (ii) C2n (P) � 0 for all n 0, 1 , 2, . . . , and for all p > 0. We prove first that the condition of theorem 4. 2 . 6 is necessary and assume that f(t) is non-negative definite. It follows from the definition of c2n (P) and from formula (4.2. 18) that oo oo r r c?:n (p) )2n J - oo f(px) [J - oo y 211 exp (ixy-y 2/2)dy] dx. Since f(px) is absolutely integrable, the order of integration may be reversed and we see that oo oo r r i<mldx } dy. f(px)e y 2n e- u'/2 { C 2n (P) J V2n J - oo Since f(x) is non-negative definite, the integral in the braces is non negative and therefore c2n ( P) � 0. For the proof of the sufficiency of the condition we need two lemmas. !�emma 4.2.2. The funct-ion ( - 1 )n e- x2/2 H2n (x) 'is non-negat-ive defin-ite. It follows from (4.2. 18) that oo r n 2 x ' / (4.2.19) ( - t ) e- H2., (x) �2n J y2n exp [ -y 2/2 + £yx] dy. right-hand side of (4.2. 19) is the Fourier transform of the bounded, non negative function (2n) - 2 y 2n e - 1i112 ; this is integrable over ( oo, + oo ). follows from Bochner ' s theorem that its Fourier transform is non =
=
=
1
=
=
,
1
=
- oo
=
' I ' he
- oo
11
'It
-
negative definite.
/Jr1nma 4.2 .3. Suppose that cp(x) 'is a real-valued, cont-inuous and bounded ./itnrtion which 'is absolutely integrable over ( oo, + oo) and put ). J � cfo(x) e- x'/2 H.,. (x) dx (n 0, -
a11
=
"'
=
1 , 2, . . .
80
CHARACTERI STIC FUNCTIONS
r number 0
Le t r be a eal
Then
r < 1 , and write
<
- � an rn Hn ( Y) G( r, y ) - .£.J n=o n ! V2n
oo G(r, y) = f V2n( 1 - r 2) 1
and
]
[
(x - ry) 2 cf>(x) exp dx - 2( 1 - r 2) oo
cp(y) = lim G(r, y) = lim �1
•
r�l
oo� an yn H (y)
n=O
� .
n ! V2n
To prove the lemma we use first (4.2. 1 8) and rewrite an as 1
f -00 oo [ f ""- oo
oo f oo n.
]
ooJ
oo
For the sake of brevity, we write (4.2.22) cfo(x) oo (itr)n Hn ( y) exp [itx - t2 /2] dt, / (x, y , r) = f (x) = 2n yth en 1 fn (x) dx . (4.2.23) G(r, y) = v'2n n = O ..
..
n!
f - oo
�oo f -oo oo
We use lemma 4. 2 . 1 to estimate the integral on the right-hand side of (4 . 2.22) :
f �ro n! 2J't
- oo
yn �
(itr)n H.. (y) exp [itx - t 2j2] dt yn e11'/ 2 zn [r( n ; 1 )r e11'/2 zn!2 r (n ; 1 ) 00 I t I n e- / 2 dt = f n ! v'2n v'n - oo n r( n + 1 ) t2
We apply Stirling ' s formula and get
� fro n l 2n
- oo
(itr)n H.-. ( y) exp [itx - t 2j 2] dt = o(rn e11 •;2) as n
->- oo.
81
CRITER IA
(4.2. 22), and noting that cp(x) is bounded, we see that (4.2.24) I fn (x) I = I cp(x) I o(rn eY212) = o(rn) as n Clearly, {fn (x)} is a sequence of absolutely integrable, continuous functions, and it follows from ( 4. 2 . 24) that is absolutely and unifn(x) o n= formly convergent and that the summation and integration can be interchanged in (4. 2 . 2 3 ) , so that . G(r, y) = vk J oo [� f,. (x)J dx oo o or, in view of (4 .2. 22) , G(r, y) oo oo = ) J rp(x) { ) � � J (itr)"H,. (y) exp (itx - t 2/2)dt dx . } 2n - 00 2n n=O n . We write (4.2.25) gn (t) = n ! v 2n (itr)n Hn (y) exp (itx - t 2/2) Combining this with
-+ oo .
L: 00
- 00
1
�
rr;-
so that
(4.2.26) We see from (4.2.25) and from lemma 4.2. 1 that
2n [ r ( n ; 1 ) r J oo g,. (t) dt � J _ oo ! g.. (t) I dt � eY'/2 r" n -1 r(n + 1) = o(rn e11112) 00
00
_
as n -+
oo .
oo g (t) dt = J [ n(t) dt, : oo n�/ J � J 00 ,. that 00 (y) (itr) n " [ :{ 2 ft 4 ) ,. e g (t dt � 27 xp (itx t /2) .2 dt. = J � ) ( . J J 0 v' n n (4.2. 1 8 ) to compute the sum on the right of (4.2.27) and obtain (itr)n H (y) = 1 oo (itr)n eY'/2 J oo (iv)n exp [- v2j2 +ivy] dv. .�o n ! v'2n."'f-o n ! - oo I t then follows easily that n
so
00
We
00
use ro
00
n
I t can he shown that the summation and integration can be interchanged, und we obtain by an elementary computation
82
CHARACTERISTIC FUNCTIONS
oo n (itr) 1 H (y) �n=O n . = V2n J - oo exp [ - (v 2 -y2)/2 + ivy - trv] dv = exp [t2 r 2 /2-iy tr]. (4.2.28) oo
1"
oo oo ..�J oo g., (t)dt = � J oo exp [itx-t 2/2 + t 2 r 2/2 - iytr] dt. We then see easily that oo 1 2 (x-ry) t . (4. 2 . 29 ) .. exp [ g J (t)d = I; 2 V1 - r n=o - oo 2 (1 - r2)J We conclude from (4.2.26) and (4.2.29 ) that oo 1 (x-ry)2 ] [ dx. cp(x) exp J G r y) (4.2. 30) ( ' = V2n(1 - r2) 2( 1 - r2) We combine (4.2.27) and (4.2.28) and get
oo
This is the first part of the statement ; the relation = lim
cp(y)
r�1
G(r, y)
follows immediately from (4.2.30 ) and the extension of Helly ' s second theorem, so that lemma 4.2.3 is proved. To prove that the condition of theorem 4.2.6 is sufficient, we assume that � 0 for every > 0 and apply lemma 4.2.3 to the function = Since is, by assumption, a real and even function, we have
c211(p)
p cp(x) f(px). f(x) a2n +l = J 00 00 f(px) e-x•;z H2n +l (x) dx (n = 0, 1 , 2, . . . ) while a2n = ( - 1 )n c2n ( P), and we conclude from lemma 4.2.3 that ;, (- 1)n c 2n ( P)r 2n H2n ( Y) j( . lm ) py (2n)! V2n Therefore n r2 c (p) n 2 lim ((4. 2 .3 1) l )n e - Y2/2 H2n ( ) = f(py)e- 'll'/ 2 • (2n)! V2n Since the function ( - 1 ) n e - v21 2 H2n ( y) is, according to lemma 4.2.2, non negative definite, we conclude from (4.2.3 1 ) that f(py)e - Y2 1 2 is also non negative definite. But then the same is true for f(y) exp ( - y 2 2p 2) 1
.
£..,J
_
r--+1 n = O oo
I:
r--+1 n=O
-
Y
/
;
moreover, we see from assumption (ii) of the theorem that this is a charac teristic function . W<.� let p >- oo and concl ude from the c o ntinu i ty theorern
83
CRITERIA
f(y)
that is a characteristic function. The following corollary is an im mediate consequence of the preceding reasoning.
Corollary to theorem 4.2.6. If condition (ii) of the theorem is not satisfied all p > 0 but iffor some2P o > 0 we have c2n ( P o) 0 for n 0, 1 , 2, . . . for ad inf., thenf(y) exp ( -y /2p0) is a characteristic function. �
4.3
=
Sufficient conditions
The necessary · a nd sufficient conditions discussed in the preceding section are often not readily applicable. In the present section we will give a very convenient and useful sufficient condition.
Theorem 4. 3 . 1 (P6lya's condition). Let f(t) be a real-valued and continuous function which is defined for all real t and which satisfies the following con ditions: (i) f(O ) 1 (ii) f( - t) f(t) (iii) f(t) con'l'ex<* > for t > 0 (iv) lim f(t) 0. Then f(t) is the characteristic function of an absolutely continuous distribution F(x). Since f(t) is a convex function it has everywhere a right-hand derivative which we denote by f'( t). The function .f' (t) is non-decreasing for t > 0. It follows from (iv) t at f' (t) � 0 for t 0 and that =
=
=
t---? oo
h
lim f'( t)
t-+ oo
It is easily seen that the integral We write
(4.3 . 1 )
p(x)
=
>
=
0.
t:c
f : e i f( t) dt exists for all x -
oo
=ft 0 .
-it e re f(t) dt. f 2n _!_
oo
- ro
We see from ( ii ) and (4.3 . 1 ) that 1 cos = n o
(4. 3 .2) p(x)
-
f f(t) txdt. 00
t > 0 if J ( t.) f( t.)
(*') A function f (t) is s ai d to be convex for
fot· nll l't-udcr
1 1 > 0, t1 > 0. For a
to
G . 1�1.
llurdy-J.
�e·; t·)
<
;
survey of the properties of convex functions
E. Littl cwood-G. P6lya ( 1 934), 70-72, 9 1 -96.
we
refer the
84
CHARACTERI STIC FUNCTIONS
The conditions of Fourier' s inversion theorem( * ) are satisfied and we obtain f (t) It follows from (i) that
J
oo
=
oo
J'"' oo eilxp(x) dx.
p(x)
dx
=
p
1 and the proof of theorem 4.3 .1
is completed as soon as we show that (x) is non-negative. Integrating by parts and writing g(t) = -f' (t) we get (4.3 .3) where
p(x)
=
1
g (t) sin xt dt J nx oo
-
o
g(t) is a non-increasing, non-negative function for t lim g(t)
t-?OO
Then
p(x)
=
Let x > 0 ; the series
=
0.
>
0 while
1 n/x ( - l )ig t + L j=O x nx o -
J [ � ( "n)J sin tx dt. l-o ( - 1 )1g(t �) 00
+
is an alternating series whose terms are non-increasing in absolute value ; since the first term of the series is non-negative one sees that the integrand is non-negative. Thus p(x) � 0 for x > 0. Formula ( 4.3 .2) indicates that is a (x) is an even function of x so that (x) � 0 if x # 0 . Therefore frequency function and is the characteristic function of the absolutely
p
p f(t) continuous distribution F (x) J� p( y) dy.
p(x)
=
oo
We will occasionally call functions which satisfy the conditions of theorem 4.3 . 1 P6lya-type characteristic functions. From the preceding proof it is clear that the frequency function (x) of a P6lya-type characteristic function (t) can always be obtained by means of the Fourier inversion formula (4.3 . 1 ), e"tren if the condition of theorem 3 .2.2 that should be absolutely integrable is not satisfied.
p
f
f(t)
<*> We use here the following theorem due to Pringsheim [Titchmarsh, (1937), p . 1 6] : If the function f (t) is non-increasing over (0, oo) and if it is integrable over every finite interval (0 , a) (where a > 0 ) and if lim f(t) = 0 then the inversion formula t-+ oo
Uf (t + O) + f (t - 0)]
=
(2 /'rr)
J�
cos tu
[ J�
}
f ( y ) cos yu dy
holds for any posi tive t . A short proof of Pringsheim' s theorem A . E. Livingstone (1955).
can
u
be found in M. Riesz
85
CRITERIA
We list next a few Polya-type characteristic functions. (4. 3 .4a)
f(t)
(4.3 .4b)
f( t)
=
=
(4.3 .4c)
f(t)
(4.3 .4d)
f(t) =
=
e- l tl
1 1+ItI t 1 for o � 1 t I 1 for I t I � � 41tI
1-1
{01 - 1 t I
�
�
for I t I � 1 for I t I � 1 .
Using the inversion formula (4. 3 . 1 ) we see easily that (4.3 .4a) is the characteristic function of the Cauchy distribution. The characteristic functions ( 4.3 .4a) and ( 4.3 .4d) are absolutely integrable ; however (4.3 .4b) and (4.3 .4c) are examples of characteristic functions of absolutely con tinuous distributions which are not absolutely integrable (see page 3 4) . ,_f he corresponding frequency functions can nevertheless be computed by means of formula (4. 3 . 1 ) but lead to higher transcendental functions. The frequency function of the characteristic function (4.3 .4d) is the function
__!__
[sin (x/2)] 2•
2n xj2
a
Polya's condition permits us to construct examples which help us to get better insight into the assumptions of the uniqueness theorem. < * >
Jtxample 1 .
Let f(t) be any Polya-type characteristic function whose right-hand derivative f ' (t) is strictly increasing for t > 0. Replace an arbitrarily small arc of the right-hand side of f(t) by a chord and change t h e left-hand side symmetrically. In this manner one obtains a new func t ion /1 ( t) which also satisfies the conditions of theorem 4.3 Thus /1 ( t) is a Polya-type characteristic function which agrees with f(t) everywhere, except on two symmetrically located arbitrarily small intervals. As a con Hcquence of the uniqueness theorem (1 (t) and f(t) belong to two different d istributions.
.1 .
l�,xample 2.
Let /1 (t) be the characteristic function (4.3 .4c) while /2 (t) iH the function (4.3 .4d). These are examples of two characteristic functions which agree over a finite interval but belong to different distributions . ])
86
CHARACTERISTIC FUNCTI ONS
Theorent 4.3 .2. Let f(t) be a real-valued function which satisfies the follow ing conditions<*): (i) f(O ) 1 (ii) f(-t) f(t) (iii) f(t) is convex and continuous in the interval (0 , r) (iv) f(t) is periodic with period 2r (v) f(r) = 0 , f( t) � 0 in [0 , r] . Then f( t) is the characteristic function of a lattice distribution. We consider the function f1 ( t) defined by f ItI f(t) � { (4.3 .5) fl(t) o 1f 1 t 1 > rr. Clearly, f1 (t) satisfies the conditions of Polya's theorem and is therefore a characteristic function. Hence it follows from (4.3 . 1 ) that oo J oo e-ita: fd t) dt 0 for all x. Combining this with (4.3 .5) we obtain (4.3 .6) J �/(t) cos txdt 0 =
=
:;:;
=
?:
?:
while condition (ii) implies that (4.3 .7)
J �/(t) sin txdt
=
0.
x nnjr (n integer) in (4 . 3 . 6) and (4.3 .7) and see that -tdt An = -1r fr J(t) nn � 0 r ) (4.3 . 8 nn 1 fr Bn r f(t) sin r tdt 0 . The quantities An and Bn are the Fourier coefficients of the function f(t) . It follows from Dirichlet's conditions [Titchmarsh (1939) ] that f(t) is equal( t) to its Fourier series in the interval ( r, + r). On account of the periodicity of �f ( t) one has then n A0 n + f(t) z 111:,1A cos y t (4.3 .9)
We substitute
=
COS
-r
=
-
-
-r
=
-
=
00
..
Levy ( 1 96 1 ) showed that condition (iii) can be replaced by (iii ') : the functiong (t), which equals f(t) in some interval ( 0, r) and is zero for t > r, is a characteristic function. ("!") D. Dugue (1955), (19 5 7b ) investigated the Fourier series of a characteristic func�on and showed that a characteristic function is, in a certain interval, equal to the sum of its Fouri er series . 1.�. Schmcttcrcr ( 1 965) supplemented these results and showed that a similur stnten1cnt is true if the trigon ometric systctn is replaced by certain orthogonal <* > P.
sys tctns .
87
CRITERIA
f(t)
for any real value of t. Formula (4.3 .9) indicates that is the charac teristic function of a lattice distribution whose lattice points are the points = 0, + 1 , + 2, . . . . The functions discussed in this proof are also examples of and characteristic functions which agree over a finite interval. The first ex ample of this kind is due to Khinchine. Extensions of Polya ' s condition can be found in Girault (1 954) and in Dugue ( 1 7b . These authors also obtained some interesting results concerning P6lya-t¥pe characteristic functions [D. Dugue-M. Girault (1955)] . We discuss here only one of their theorems.
(nnjr) (n
) f( t) f1 (t)
95 )
Theorem 4.3 . 3 . A characteristic function is a Polya-type characteristic function if, and only if, it can be represented in the form (4.3 . 10) f(t) J� k(:) dF(x) for t > 0 andf(t) f(-t)for t 0. Here 1 - I t 1 if 1 t 1 � 1 (4.3 . 1 1 ) k(t) {o if 1 t 1 1 while F(x) is a distribution function such that F(O) 0. We note that k(t) is the characteristic function (4.3 .4d) so that k (:) is also a Polya-type characteristic function, and we see easily that f(t), as =
<
=
�
=
=
given by (4.3 . 10) , satisfies the conditions of theorem 4.3 . 1 and is therefore a Polya-type characteristic function. We prove next that every Polya-type characteristic function admits a representation (4.3 . 10). Let be a ]J()lya-type characteristic function ; we mentioned above that has everywhere a right-hand derivativef ' (t) which is non-decreasing for t > 0. Wc note that is the ordinate at the origin of the tangent o f the curve taken to the right of the point Therefore tends to zero as -+ oo . We use integration by parts to show that
.l (.x) - xf '(x)
f(t) f(t)
f(x) - xf '(x) y .f(t)
t x.
x oo d[ -f(x) xf (x) - t J ! ) dx. �! [ �J t ( t - :) l + ' ] symbol .!_ stands here for the right-hand derivative. It follows dx nuncdiately that oo (4.3 . 1 2 ) L ( t - :) d [ l -f(x) + xf '(x)] f(t). F(x) 1 - .f(x) + xf'(x) =
=
==
The i
=
We see that 11
=
88
CHARACTERISTIC FUNCTIONS
is a distribution function and introduce F (x) and the function
(4.3 .12)
k(:) into
formula and obtain the desired result. The decision whether a given function is a characteristic function can sometimes be made by means of the results derived in earlier chapters . The continuity theorem is frequently useful in this connection ; we con sider next a simple example. Let
f(t)
1 f(t) = cosh t 1
t
e t + e- t
·
The function cosh is an entire function which has zeros at the points Applying Weierstrass' theorem on the factorization of entire (integral) functions we get
in(Zj- 1)/2.
[ 2 4t cosh t = II 1 + ---
(2j- 1) 2 n 2J
00
j=l
so that
[ 2 4t 1 = g3 (t) + (ZJ. - 1) 2 n2J
f(t) = II gJ (t) where . Let l(t) = 1/(1 + t2) be the characteristic function of the Laplace distribu tion, then g; (t) = z ( (2j � l)n t) is also a characteristic function. Then [corollary 1 to theorem 3 .3 .1] n hn (t) = Ilg; (t) 00
j=l
-1
j=l
is also a characteristic function. Finally we conclude from the continuity theorem that = lim hn
f(t) n� oo (t) is also a characteristic function. In a similar way one can show that the reciprocal of an entire function of order 1 which has only purely imaginary zeros and which equals 1 at the origin is always a characteristic function. 4.4
Supplementary remarks concerning non-negative definite functions I n the preceding section we saw (Example on page 85) that two differ ent characteristic functions can agree over a finite interval. This observa tion motivates the introduction of a new concept, namely of functions which arc non-negative definite on a finite interval.
2
89
CRITERIA
f(t) t ( - A, A) f(t) ( - A, A) ; t3 I A (j I �1, �2, �N 2: � f(tj -tk) �i lk
A complex-valued function of a real variable is said to be non negative definite over the interval if (i) is continuous in (ii) for any positive integer N and any real numbers , tN such that < 1 , 2, . . . , N ) and any complex num bers the sum , =
•
•
N
•
t1 , t2 ,
•
•
•
N
j=l k=l
is real and non-negative. We denote the set of functions which are non-negative definite over by f!JJA and write f!JJ for the set of functions which are non negative definite over ( oo, oo ). Bochner's theorem and the example mentioned above suggest several problerp.s. The first of these is a characterization of the class f?lJA, the second deals with the possibility of extrapolating a function non-negative definite on to the whole real line. Finally, one is interested in conditions for the uniqueness of this extension. A number of authors, M. Krein (1 940), (1943), D. A. Raikov ( 1940), E. J. Akutowicz (1 959), (1 960), and P. Levy (1961), have investigated these problems and obtained interesting solutions. The tools used in these investigations exceed the scope of the methods employed in this monograph. Therefore we only list here some of the results, without proofs. Omission of these proofs will not cause any difficulty in reading the book since the present section is only loosely connected with the rest of the monograph.
( - A, A)
-
oo
(-A, A)
1,heorem 4.4. 1 (Krein's theorem). A function f(t), defined on a finite or infinite interval ( - A , A), belongs to if, and only if, it admits the repre .\·entation [!JlA
(4.4. 1 )
y,vhere F (x) is a non-decreasing function of bounded variation.
' l'heorem 4.4. 1 is due to M. Krein ( 1940) ; an elementary proof was gi ven by D. A. Raikov ( 1 940). In the case where A is infinite, Krein's t heorcm reduces to Bochner's "theorem. The integral representation (4.4. 1 ) is u nique if oo ; however, for a finite interval F (x) is in general not u n i q u ely determined by This means that a function which is I H Hl-ncgative definite over a finite interval may admit several different non t a·gati v c definite extensions to the full real line. Conditions for the unique n cHs o f the extension can also be found in Krein's paper. To formulate these we introduce the following terminology. I"'ct .f(t) E f!IJA and denote the set of non-decreasing functions of bounded
A
=
f(t) .
f(t)
90
CHARACTERISTI C FUNCTI ONS
t
variation which admit the representation (4.4. 1 ) for f( ) by V1• We norm the functions of V1 so that ( - oo ) = while
F
0 F (x) = [F(x -O ) + F(x + 0)]/2.
We say that the extension (extrapolation) off E f!JJA is unique if V1 contains only one element ; otherwise we say that the extension off is indeterminate. Let �A be the set of all entire functions of the complex variable z = such that
g(z)
t + iy
g(t) I (ii) lim sup r - 1 log M (r) � A , where M(r) = max I g(z) I · This means that g(z) is an entire function of
sup
- oo < t < oo
I
<
oo
'1'--7 00
lzl
E
g;A
It can be shown that <1>1 depends only on f and g but is independent of F. We are now in a position to formulate Krein' s result.
Theorem 4.4.2. The extension of the function f E A is unique if there exists a non-negative junction g E mA, g 0 such that
=t:-
Krein also gave a necessary and sufficient condition for the indetermin ateness of the extension of a function "\vhich is non-negative definite in a finite interval.
Theorem 4.4.3 . The extension of the function f E is indeterrninate if, and only if, the following two conditions are satisfied: (i) For every function ( ) of bounded 'Variation for which -r(x) = � [-r(x +O) + r(x - 0)] "* const (0 � x � A) the inequality J: J: f(x - ) d-r(x) d ( ) > 0 holds. (ii) The series t cp,. : eix J (x)dx A ..�1 ,. for all 1"cal ( - t co). r?JJA
-r x
y
t
oo <
<
r
y
2
<
oo
91 Here {
We conclude this section with a remark concerning a generalization of Bochner ' s theorem. A non-negative definite function is by definition con tinuous. F. Riesz (1933) replaced the assumption of continuity by measur ability and showed that the representation of such a function by the Fourier-Stieltjes integral of a bounded non-decreasing function is valid almost everywhere. M. Crum ( 1 956) carried out a detailed investigation and obtained the following result.
Theorem 4.4.4. Let f(t) be a complex-valued function of the real variable t (- t ) which satisfies the following conditions: (i) f(t) is measurable; (ii ) for any positive integer N and any real tb t 2 , , tN and any complex �b � , �N the relation � k=l� f(t; -tk) �; llc 0 holds. Then f(t) admits the decomposition f(t) cp(t) + 1p(t) , where rp( t) J'" eitx dF (x) , oo vvhile 1p(t) 0 almost everywhere and satisfies condition (ii). Here F(x) is a bounded and non-decreasing function. oo <
<
oo
•
2,
•
•
•
•
•
N
j=l
�
N
=
=
=
Conditions generalizing Cramer ' s criterion in a similar way were given by G. Letta ( 1 963). 4 .5
Unimodal distributions
F(x)
distribution function is said to be unimodal if there exists at least one value x such that is convex for < and concave for .\' > '1-,he point is called a vertex of A s examples of unimodal distributions we mention the normal distribu t i on and the Cauchy distribution. I n this section we study properties of unimodal distributions and derive cr i teria which assure that a characteristic function belongs to a unimodal d iHtri bution . For the sake of simplicity we shall often assume that the v e r tex i s the point = 0. !\
a.
a
x a
==
a
==
F(x)
F (x).
x a
92
CHARACTERISTIC FUNCTION S
Theorem 4.5 . 1 . A distribution function F(x) is unimodal with vertex at function f(t) can be represented as x = 0 if, and only if, its characteristic ' r f(t) !t J 0g(u)du ( - t < oo) , where g(u) is a characteristic function. Theorem 4. 5 .1 is due to A. Ya. Khinchine ; for its proof we need two lemmas : Lemma 4. 5 .1. The relations oo dG(y) 0 , '" dG( y) = 0 r + ( i) lim X X r ,._;moo J - oo Y m---++ oo J '" Y '" dG( y) = 0 , lim x f + oo dG( y) (ii) lim x f =0 J 0 y x hold for an arbitrary distribution function G (x). For x > 0 we have the inequalities dG(y) � r + oo dG( y). 0 � X r +oo Jx y J The last integral tends to zero as x tends to infinity, and we obtain the first equation in (i) ; the second equation in (i) is derived in the same way. Let x -+ + 0 and note that oo oo dG(y) dG(y) dG(y) f v; + + J =X J 0 � X +x y y x x v;; vy � J ; dG(y) + v'x J + � dG( y) x Yx G(v'x) - G(x) + v'x(1 - G(v'x)). The expression on the right-hand side tends to zero as x + 0, so that 00 <
=
=
ro�- o
- oo
Y
r
x�+
-'
ro
==
--*
the second equation in (ii) follows. The first equation in (ii) is proved in the same way.
Lemma 4.5 .2 . If a distribution function F(x) is convex in (- oo, 0) then there exists a function p(u) which is non-decreasing and integrable on ( - oo, 0) such that F(x) = J � oo p(u)du. Similarly, if a distribution function F(x) is concave in (0 , + oo) then it adnzits a representation F(x) = 1 - J� q(u)du where q(u) is non-increasing and integrable on (0 , + oo) . ' The first statement of the lemma follows from a well-known proper ty of convex functions [see A. Zygmund ( 1 952), 4.141] ; the second state1nent is an imn1ediatc consequence of the first part of the lemma.
93
CRITERIA
We now proceed to the proof of theorem 4.5 . 1 and show first that the condition is sufficient. Suppose therefore that a characteristic function f(t) can be represented in the form
(4.5 . 1 )
1
J
t g(u) du
t 0 where g( is the characteristic function of some distribution introduce the function f(t)
u)
=
-
G (x)
.
We
d (u) � ] dy for X < 0 [ J oo �oo f� (4.5 . 2) F (x) dG (u) J : o [ J � u J dy + G( + 0) for x > 0. We rewrite (4.5 .2), using integration by parts and lemma 4.5 . 1 , and obtain ) dG(y G ( ) x r- oo Y for X < 0 ) (4.5 . 3) F (x) oo d ( G G(x)+x J Y y for > 0. It follows immediately from (4.5 .2) that F (x) is non-decreasing for x 0 and also for x > 0. We also conclude from (4.5 .3) and lemma 4.5 . 1 that F( + ) 1 while) F(- ) 0; moreover we see in the same way that F ( +0) G( + 0 and F(-0) G(- 0). The function F(x) is therefore a distribution function. Since F(x ) is the integral of a non-decreasing 0) and is the integral of a non-increasing function in function in ((0, ) it is easily seen that F (x) is unimodal with vertex at x 0. -
i!
=
x
-
=
x
m
<
oo
oo
=
=
=
=
oo,
oo
=
I n order to complete the proof of the sufficiency of the condition of theorem 4.5 .1 we must show that f(t) , as given by (4.5 . 1 ) , is the charac teristic function of the distribution function x . According to (4.5 .2) we have
F( ) dG (u) e e t t x F ( ) d i J "" i a: J =: a: [ J � oo u J dx + F ( + 0) - F(-0) + J :o eUre [J : d�(u)J dx . note that F( + 0)- F (-0) G ( + 0) -G ( - 0) and using integration parts and lemma 4.5 . 1 , we see after some elementary computations that eitx 1 oo x ei (·1 .5 .4) J -oo t dF (x) J z.tx dG (x). 00
=
\tV c hy
W t� note that
=
=
oo
-
oo
e·ltx _ 1
itx
=
1 t
-
t e x du '
Jo
i
u
·
94
CHARACTERISTIC FUNCTION S
we substitute this into (4.5 .4) and obtain 1 f (t) , - 00 t 0 so that the condition of the theorem is sufficient. We still have to show that (4.5 . 1 ) is necessary and assume therefore that is a unimodal distribu tion. We see then from lemma 4.5 .2 that there exists a non-decreasing function defined for < 0 , and a non-increasing function defined for > 0 , such that
J eitx dF(x) = I t g(u)du = co
F(x)
p(u), u
J � "" p(u)du
for x
J � q(u)du
1-
Let
- J� oo udp(u)
for
<
0
x > 0.
x<0 G(x) = 1 + J � udq(u) for x > 0 .
(4.5 .6)
q(u) ,
u
F(x) =
(4.5 . 5 )
-
for
p(x) is non-negative and non-decreasing in ( - 0) we see that J�p(u) du � xp(x) � 0 for x 0 , so that lim xp(x) = 0 . (4.5 .7) ---+- 0 x Moreover it follows from (4.5 .6) that G(x) = -xp(x) + F(x) for x 0 ; we conclude from ( 4.5 .7) that (4.5 . 8a) G ( - 0) = F(- 0). Similarly we show that (4.5 . 8b) G ( + 0) = F( + 0) so that G ( + 0) G ( - 0) . We see from (4.5 .6) that G(x) is non-decreasing in ( - 0) and ( + 0, + ) so that G (x) is a distribution function. <*> Let oo g(t) = J eike dG (x) be the characteristic function of G ( x); then oo i t x 1 e 1 J J dG (x) . -t g(u)du = . ztx Since
oo ,
<
<
oo ,
�
oo ,
oo
t
<•>
It might be continuous.
o
_
- co
necessary to modify G (x) at its discontinuity points to make
it r i ght
95
CRITERIA
G(x)
We substitute for the expression from (4.5 .6) and integrate by parts and obtain, using (4.5 .8a) and (4.5 .8b), 1
0 t -t J g(u)du J eitrop(x)dx +F( + 0)-F(-0)- J oo ei1� q(x)dx, or, in view of ( 4.5 .5) ! J t g(u) du J oo ei'"" dF (x) f(t), - oo t 0 so that the theorem is proved. =
o
+o
- co
=
=
It is worthwhile to remark that P. Medgyessy (1963) has shown that it is possible to derive theorem 4.5 . 1 from theorem 4.3 . 3 and also theorem 4.3 .3 from theorem 4.5 . 1 , so that these two theorems are equivalent. Paul I..�evy ( 1 962) gave some interesting extensions of theorems 4.3 .3 and 4.5 . 1 . The next theorem gives a sufficient condition which assures that a characteristic function belongs to a unimodal distribution.
Theorem 4.5 .2. Let f(t) be a continuous, real-valued and even function of the real variable t such that f(O) 1 and let A(z) be a function of the com plex variable z (z t + iy r ei0 ; t, y, and () real) which satisfies the follow ing conditions: (i) A(z) is regular in the region ® {z: r > 0, - e < () < ; + e2} where and s2 can be arbitrarily small; ( ii) I A( z) I 0( 1 ) as I z I 0 ; (� > 1 ) ; (iii) I A(z) I 0( 1 l - c5) as I z I (iv) Im A(iy) � 0 for y > 0 ; (v) f(t) A(t) for t > 0. Then f(t) is the characteristic .function of a symmetrical unimodal and absolutely continuous distribution function. It follows from our assumptions that f(t) is absolutely integrable over + ). Therefore ( p(x) -1 2Joo- oo e-�.tx f(t)dt n1 J oo cos txf(t)dt continuous, real-valued and even function of x. It follows from the preceding equation that (4 .5 .9) p(x) -1 Re J oo eit� f(t) dt -1 Re J oo eit� A(t) dt. order to co1npute the last integral in (4.5 .9) we consider the function ''l '(z) A(.o') ( com.plcx, x 0) along the contour which consists of =
=
=
1
=
s1
-+
=
z
=
-+ oo
=
- oo ,
is
oo
=
a
=
ln
�
eizco
.�
n
=
n
=
o
�
n
-
o
o
r
96
CHARACTERISTIC FUNCTIONS
[r, R] of the positive real axis, the circular arc C {z: z e#, 0 cfo �}. the segment [iR, ir] of the positive imaginary axis, and the circular arc r ei
the segment
R=
=
z
=
r
@,
::;;;;
::;;;;
;::;.
;::;.
R
=
=
=
or (4.5 . 10)
J B eitm A(t)dt + J 1p(z)dz + i J ' e- 11"' A(iy)dy+ J 1p(z)dz 08
r
It is easily seen that
lim r--?-0
OR
R
J 1p(z) dz ar
=
lim
R--?- 00
J 1p(z) dz aR
( 51 ) J � eita; A(t) dt i J : e- 11"' A(iy) dy.
so that one obtains from 4. . 0
=
=
0.
0,
=
oo e- ux Im A(iy)] dy.
We conclude from the last equation and (4.5 .9) that
1 n
(x) J [ It follows from condition (iv) and the assumption that f(t) is an even function, that p(x) 0 for all real x. Since f( O ) 1 we conclude that p (x) is a frequency function whose characteristic function is f(t). To com plete the proof we must show that the corresponding distribution is uni modal. Let x 1 > x 2 > 0 ; it follows immediately from (4.5 . 1 1 ) that p (x ) p(x 2) p(O ) , so that p (x) is a decreasing function for x � 0. Since p(x) is symmetric we see that it has a unique maximum at x 0 . (4.5 . 1 1 )
p
=
-
-
o
�
=
l
<
<
=
We give next an application of theorems 4.5 . 1 and 4.5 .2 and show that certain functions are characteristic functions of unimodal distributions. This result will be used in the next chapter.
Theorem 4.5 .3 . function f(t)
=
bution.
1
Let be a real number such that 0 � 2 ; then the +ll t I " is the characteristic function of a unimodal distrirx
< rx
'
97
CRITERIA
In proving the theorem we must distinguish three cases.
(a)
0
<
a
� 1. In this case we introduce the function (1 - ex) lex =
1 t + I (4.5.12) g(t) (1 + I t 1 "') 2 . It is easily seen that for t > 0 cx cxt g"(t) = ( 1 -tCX2)4 [(1 -cx 2) + 2(1 + 2cx2)tcx + (1 - cx2)t2cx] > 0. The function g( t) therefore satisfies Polya ' s condition (theorem 4.3.1) and is thus a characteristic function. It follows also from ( 4.5 . 12) that g(t) = f(t) + tf '(t) for t > 0 ; therefore f(t) = !t J '0g(u) du and we conelude from theorem 4.5 . 1 that f(t) is the characteristic function of a unimodal distribution. In this case we introduce the function A(z) = (b) 1 1 : z"' of the complex variable z and see that A(z) satisfies the conditions of theorem 4.5. 2 , and we conclude from theorem 4.5 .2 that f(t) is the characteristic function of a unimodal distribution. ( ) == In this case the frequency function of f(t) is p(x) = ! e- la:l which has a unique maximum at x = 0. The fact that f(t) = is a characteristic function was established 1 +� t I "' by Yu. V. Linnik (1953), and the unimodality of the corresponding dis tribution was shown by Laha. Theorem 4.5 .4. Let {Fn (x)} be a sequence of unimodal distribution functions and suppose that the distributions F (x) converge weakly to a distribution function F(x); then F(x) is also unimodal. Let an be a vertex of Fn ( ) and a = lim an . We consider first the case and select a subsequence nk such that lim an k = a. Let where I a I h x 2 and (x1 +x 2 )/2 be continuity points of F(x) such that x1 < a and < a. For k sufficiently large one has x1 < ank' x2 ank· Since Fnk(x) assumed to be unimodal we see that x x1 F F... (xl) + F.,. (x2) 2 ... ( ; 2) . go with k to the limit and obtain (4. 5 . 1 3a) F(x1) + F(x2) 2F (x1 ; xa). -1-
< IX <
c
a
2.
2.
R. G.
n
x
<
n-+cv
oo
x
k-+ oo
.x 2
.
<
is
We
�
�
98
CHARACTERISTIC FUNCTIONS
F
We assumed that x1 and x 2 are continuity points of (x) ; however, in equality ( 4.5 . 1 3a) is also true for arbitrary points. This follows from the right-continuity of F (x) and the fact that an arbitrary point can be approxi mated by a sequence of continuity points. In a similar way we obtain for points x3 and x4 , such that x3 > x4 > the inequality X3 + X 4 (4.5 . 1 3b) F (x 3) + F (x4) � 2F 2 .
a,
a,
(
)
It follows from equations (4.5 . 1 3 a) and (4.5 . 1 3b) that F (x) is unimodal. Finally we note that I I is necessarily finite, otherwise F (x) would be either convex or concave for all x. This is not possible, since a distribution function is monotone and bounded.
a
Theorem 4.5 . 5 . The convolution of two sy1nmetric and unimodal distribu tions is symmetric and unimodal. For the proof of the theorem we need the following lemma.
Lemma 4. 5 . 3 . Let F (x) be a unimodal distribution function. Then there exists a sequence {Fn (x) } of absolutely continuous unimodal distribution. functions such that Lim Fn (x) F (x) and Fn (x) is absolutely continuous =
F (x) and Lim Fm , n (x) Fn (x) , n� oo m� ro there exists a sequence such that Lim Fm , (x) F (x) . It is therefore
We first note that if Lim Fn (x)
=
k->- 00
kk n
=
=
sufficient to consider distribution functions F (x) whose derivative is a step function. In this case there exist absolutely continuous functions Pn (x) which do not decrease on ( - oo , 0) and do not increase on (0, oo ) , such that
!�n:!, J � ,,,Pk ( y)dy
We write
Fn (x)
and see that Lim Fn (x)
= =
J�
1
oo
=
J � F '(y)dy. oo
x
nP (y)dy J _., Pn (y)dy
F (x), so that the lemma is proved.
We proceed to prove the theorem. Let F1 (x) and F2 (x) be two symmetric unimodal distributions and denote their convolution by F (x), F (x) = F1 (x)* F2 (x). Clearly F (x) is also symmetric, so that we have only to show that it is unimodal. It is no restriction to assume that [?1 (x) and F2 (x) are twice differentiable ; this follows from theorem 4.5 . 4 and the fact that-according to lemma 4.5 .3-we can approximate F1 (x) and F2 (x) by two sequences F1 (x) } and (x) } respectively of twice differentiable, symmetric, and unimodal distribution functions. n-+ oo
{
,n
{F2 ,n
99
CR ITERIA
If F1 (x) and F2 (x) are twice differentiable, we see that
f oo F�' (x - t) F� (t) dt f :oo F� (x - t) F�' (t) dt oo F "(x) f: [F� (x - t) - F� (x + t)] F�' (t) dt.
F "(x)
or (4.5 .14)
=
=
=
(t) and F2 (t) are both unimodal we conclude that F� ' (t) � 0 for t > 0. F�-( x - t) - F� (x + t) � 0 for x 0 { (4.5 . 1 6)
Since F1 (4.5 . 1 5 )
<
F� (x - t) - F� (x + t) � 0 if x > 0. It follows from (4.5 . 1 4), (4.5 . 1 5) and (4.5 . 1 6) that F "(x) � 0 if x but F " (x) � 0 if x > 0. This completes the proof of the theorem.
<
0
Remark.
The assumption of theorem 4.5 .5 that F1 (x) and F2 (x) are symmetric is essential. The convolution of two unimodal distribution functions is in general not unimodal. K. L. Chung (1953) gave an example of an absolutely continuous distribution function F (x) which has its vertex at x = 0 and which has the property that the density function of F * F has two maxima so that F * F is not unimodal. I. A. Ibragimov ( 1956a) calls a distribution function strongly unimodal if its convolution with any unimodal distribution is unimodal. He obtained the following result :
Theorern 4.5 .6. A (non-degenerate) unimodal distribution function F (x) is strongly unimodal if, and only if, F (x) is continuous and if log F '(x) is con cave on the set of points at which neither the right-hand nor the left-hand derivative of F (x) vanishes. 4.6
An essential property of characteristic functions We have already mentioned that every distribution function has a characteristic function and have discussed in Chapter 3 some other very important theorems concerning characteristic functions, such as the uniqueness theorem, the convolution theorem, and the continuity theorem. 'l'he great usefulness and importance of characteristic functions in prob ability theory is largely explained by the fact that these properties make them a very convenient tool for the solution of many problems. The p resent section deals with the question whether there are any other integral transforms of distribution functions which have these properties. 1 Jet (x) be a distribution function and consider its integral transform by tncans of the kernel x), that is
G
(·HI. ! )
o(s)
K(s,
�=
J: ,/ {(s, x)dG(x).
100 In the following we denote by G 1 (x), G 2 (x) distribution functions and by g 1 (s), g 2 (s) their respective transforms (4.6.1 ). CHARACTERISTIC FUNCTIONS
In this section we show that the uniqueness and convolution properties essentially determine the kernel. The following theorem gives a precise formulation of this statement.
Theorem 4.6.1. Suppose that kernel K (s, x) satisfies the following con ditions: (I) K(s, x) is complex-valued function defined for all values of the real variables s and x and is bounded and measurable in x. ) (I I) (Uniqueness property): g 1 (s) g2 (s) if, and only if, G1 (x G2 (x). (Ill) (Convolution property): If G(x) = G1 * G2 = f oo G1 (x-t)dG2 (t) then g(s) = g 1 (s) g 2 (s). co Then K(s, x) has the form K (s, x) = ei�A(s) where A(s) is a real-valued function of s such that the values assumed by I A(s) I form a se t which is dense on (0, + oo). The converse statement is also true. We see from assumption (I ) that every distribution function G (x) has a transform given by (4.6.1). We write assumption ( III) in terms of the kernel and obtain f co K ( X) dre f co co G1 (X - ) dG ( ) = f co K (s, t) dG1 (t) f co co (s, u) dG2 (u) oo oo = f co f co K(s, t)K(s, u)dG1 (t)dG2 (u). oo On the other hand f co co K (s, X) d., f co G1 (X - u) dG ( ) = J oo J co K(s, t + u)dG1 (t)dG2 (u) a
a
=
=
00
U
S,
2
K
2
00
so that
U
00
u
00
(4.6.2) J co J co co K(s, t + u) dG1 (t)dG2 (u) co = J :oo f oo co K(s, t)K(s, u) dG1 (t)dG1(u)
1
CRITERIA
holds for every pair of distributions arbitrary real numbers and put
{ ) G (x) s(xn 1 (4.6.3) G2 (x) �[s(x) + s(x -�)] .
G1 (x) and G2 ( )
x .
Let
� and
'YJ
01
be
=
=
(4.6.3) into (4.6.2) we get (4.6 .4) K(s, n) + K(s, 1} +�) K(s, n) [K(s, O)+K(s, �)] for any real � and 1J · We obtain in particular for � 0 2K (s, n) 2K (s, 0) K (s, 1J). Therefore (4.6.4) reduces to (4.6.5) K (s, n +�) K (s, n) I((s, �). It is known [see for instance Hahn-Rosenthal (1948), pages 116-118] that every measurable solution of the functional equation "P(1} + �) VJ(1}) ?fJ( �) has the form VJ( �) e0� where C is a constant. Since K(s, x) is by assump tion (I) measurable in x, every solution of (4.6.5) is of the form (4.6.6) K(s, x) exp(s> . Let p(s) iA(s) ; then I K(s, x) l exB(s) . Since K(s, x) is bounded B(s) + we have B(s) 0. The kernel therefore has the form (4.6.7) K(s, x) eixA (s> . The transform ( 4. 6 .1) of a distribution G (x) is therefore (4.6.8) g(s) f"' eixA <s> dG (x) while the characteristic function g(t) of G (x) is oo (4.6.9) g(t) J oo ei1"' dG (x). It follows from (4.6.8) and (4.6.9) that (4.6.10) g[A(s)] 9(s). We show next by an indirect proof that I A(s) I must assume all values a set dense in (0, + oo). Suppose tentatively that I A(s) I omits an arbit rary interval I == (a, a + h) on (0, + oo) and denote by I ' = (-a, - a -h ) the interval which is symmetric to I with respect to the origin. It is possible to construct two P6lya-type characteristic functions g 1 (t) ( t) which agree everywhere except on I and The two correspond transforms (4.6.1) are 9 j (s) gj[A(s)] (j 1 , 2). Since I A(s) l does assume values of we see that 9 1 (s) and 9 2 (s) agree for all values s but Substituting
=
=
=
=
=
=
=
=
=
=
=
=
00
=
=
of
then and g 2 I '. i ng uot I belong to different distribution functions in contradiction to the unique =
ness
assumption (II).
=
102
CHARACTERISTIC FUNCTIONS
We still have to prove the converse statement. Suppose that the kernel then it is immediately seen that (I) holds. The proof of is given by (I I) can be carried out in the customary manner with the aid of Weierstrass' approximation theorem. Finally it is easy to show that (I II) is also satisfied. We see therefore that an integral transform which is defined for every distribution function and for which the uniqueness and the con volution theorems hold, is obtained from the characteristic function by a simple change of the variable. We note that we have arrived at this con clusion without using the continuity theorem. to obtain a more general This fact can be used [see E. Lukacs characterization of the transform which also uses the continuity theorem but considers a linear mapping of the space of distribution functions onto a set of bounded continuous functions instead of the in tegral transform ( .
(4.6.7),
(4.6.1)
(1964)] (4.6.8)
4.6.1 )
5
F A C T O R I ZAT I O N P R O B L E M S-I N F I N I T E LY D I VI S I B LE CHARACTE R I STI C F U N CT I O N S
Preliminary remarks on factorizations We showed in :chapter 3 that the product of two characteristic functions is always a characteristic function. It is therefore obvious that some characteristic functions can be written as products of two or more charac teristic functions. Every characteristic function can be written as the product of the two characteristic functions real) and We say that the representation of a characteristic function as the product of two characteristic functions is trivial if one of the factors has the form In order to avoid trivial product representations, we introduce the following definition. A characteristic function is said to be decomposable if it can be written in the form 5.1
f(t) mt f1 (t) ei (m =
eimt.
(5.1.1)
f2 (t) f(t) e - imt. =
f(t)
f1 ( t)
f2 (t)
where and are both characteristic functions of non-degenerate distributions. We then say that and ( are factors of A characteristic function which admits only trivial product representa tions is called indecomposable. We show next that there exist indecomposable characteristic functions.
f1 (t) f2 t)
f(t).
Theorem 5 .1.1. Let F ( ) be a purely discrete distribution function which has only two discontinuity points. Then its characteristicfunction is indecomposable. x
We see from the corollary to theorem 3 .3 .3 that the components of F (x) are necessarily purely discrete distributions with a finite number of dis continuity points. The inequality, given in this corollary, indicates that at least one of the components must be a degenerate distribution. This proves our assertion. rfhe factorization of a characteristic function into indecomposable factors is somewhat similar to the factorization of integers into prime factors. This is the reason why the theory of the decomposition of charac teristic functions is often called the arithmetic of distribution functions. I Iowever, this analogy does not go very far ; as an illustration we give an cxarnple which shows that the factorization of a characteristic function i nto indecotnposable facto r s is not always unique.
1 04 Example. Let f(t) = A � eitJ and write f1 (t) = � (1 + e2it + e4it) , !2 (t) = �(1 + eit), g1 (t) = !(1 + eit + e2it) , g2( t) = � (1 + esit) . It follows from theorem 2. 1 .3 that the functions /1 (t), f2 (t), g1 (t), g2 (t) and f(t) are characteristic functions. Moreover it is easily seen that f(t) = /1 (t) /2 (t) = g1 (t) g2 (t). We conclude from theorem 5 . 1 . 1 that j2(t) and g2 (t) are indecomposable. It follows from theorem 3 .3 .3 that a fac torization of g 1 (t) must necessarily have the form (5.1.2) g1 (t) = [peit;t+ (1 - p)eu;2] [qeitrJ1 + (1 - q)eitrJs] where 1. (5 . 1 .3 ) 0 p 1, 0 As a consequence of (5 . 1 .2) p and q must satisfy the relations pq = (1 -p)(1 -q) = p(1 -q) +· q(1 - p) = l which are incompatible with ( 5 . 1 .3 ) . Thus] g1 (t) is indecomposable, and since /1 (t) = g1 ( 2 t) we see that /1 (t) is also indecomposable. CHARACTERISTIC FUNCTIONS
5
j=O
<
<
<
q
<
We give a second example which emphasizes another difference between the arithmetic of distribution functions and the factorization of integers. This example is due to B. V. Gnedenko. Let be a real-valued periodic function with period 2 which is defined by I in the interval I � According to theorem = 4.3 .2 the function is the characteristic function of a lattice distribu tion. Let further
/1 (t)/ (t) 1 t I t 1. 1 / (t)- l 1 for l t l � 1 f2 (t) = {01 - l t l for I t I > 1. Clearly /2 (t) is the Polya-type characteristic function k(t) defined by (4. 3 . 11 ) , and /2 (t) agrees with /1 (t) in the interval I t I � 1. According toto a remark of A. a. l{hinchine, this example shows that it is possible find two different characteristic functions /1 ( t) and /2 ( t): (5.1.4) f(t) = /1 (t) !2 (t) = !2 (t) !2 (t). Y
This fact-sometimes called the Khinchine phenomenon-shows that the cancellation law is not valid in the arithmetic of distribution functions. It is known that the quotient of two characteristic functions is in general not a characteristic function (an example is given on p. 194). We see from ( . .4 that the quotient of two characteristic functions [in need not be uniquely defined even in cases when our example : it is a characteristic function. Formula (5 . 1 .4) indicates that there might be a connection between the possibility of a factorization of type . 1 .4 and the fact that one of the factors vanishes outside an interval. The possibility of constructing characteristic functions which admit factorizations of the form (5 . 1 .4) was investigated by T. Kawata 940 and we now give some of his results.
51 ) f(t)/f2 (t)]
(5 ) '•
(1 ),
105
INFINITELY DIVI SIBLE CHARACTERI STIC FUNCTIONS
Polya ' s theorem shows that it is possible to construct characteristic functions vanishing outside a finite interval. In the following we present a different method for the construction of such functions.
Theorem 5.1.2. Let fJ(u) be a positive, non-decreasing function defined on (0, oo ) such that O(u) f (5 . 1 .5) u 2 du oo and let b be an arbitrary (but fixed) positive number. Then there exists a dis tribution function F(x) which satisfies for every a the relation (5 . 1 .6) F( -x+ a)-F(-x-a) O {exp [-fJ(x)]} (as x -+ oo) and whose characteristic function f(t) vanishes for I t I > b. oo
1
<
=
For the proof of this theorem we need the following lemma which is due to A. Ingham (193 6) and N. Levinson (193 6), (193 8), and which we state here without proof.
5 . 1 . 1 . Let fJ( ) be a positive, non-decreasing function which satisfies Lemma (5 .1 .5) and let b be an arbitrary, fixed positive number. Then there exists a non-null function G (x) such that (5 . 1 .7) G (x) O {exp [- fJ( I x I )]} (as I x I -+ ) which has the property that its Fourier transform 1 J G(x)e - �ux dx g(u) y2n vanishes for I u I > b. To prove theorem 5 . 1 .2 we consider fJ(2u) instead of O(u). The function fJ(2u) has the same properties as fJ(u), so that we can apply lemma 5 . 1 . 1 , replacing b by b /2. We put 1 f(t) A J _ 00 g(x)g(x + t)dx, where A J'""' l g(x) l 2 dx. 1\ccording to theorem 4.2.4 f(t) is a characteristic function, and it follows lemma 5 . 1 . 1 that f(t) 0 for I t I > b. Using the inversion formula, u
oo
=
oo
=
=
.
- oo
oo
=
from
=
l )arseval's theorem, and relation (5 . 1 .7), one sees by means of a simple cotnputation that (5 . 1 .6) is satisfied.
�heorem 5 . 1 . 3 . Let 8(u) be a positive non-decreasing function which satisfies (5 . 1. .5). Then there exists a distrib�ttion function F(x) whose characteristic 'I
106 function f(t) admits a factorization of the form (5.1.4). Moreover F(x) satisfies the condition (5.1.6) for a > 0 . We consider again 0(2u) instead of O(u) and put b ; in theorem 5.1.2. ':f hen there exists a distribution function F1 (x) whose characteristic func tion /1 (t) vanishes for I t I > n . The function /1 (t) is constructed using the function g(x) of lemma 5.1.1 and is given by (5.1. 8) /1 (t) � r, , J(x)g(x + t) dx (A J ) g(x) 1 2 dx). We see also that (5.1.9) g(x) 0 for I x I > n2 and that F1 (- x + a) - F1 (-x-a) O {exp [- fJ( I 2x l )] } as l x l It follows from (5.1.8) and (5.1. 9 ) that /2 n 1 (5. 1 .10) /1 (t) A J - n/2 g(x)g(x + t) dx. We see from (5.1. 9 ) and (5.1.10) that (5 .1.11) /1 (n) /1 ( -n) 0. We define a function /2 ( t) by requiring that /2 ( t) is periodic with period 2 n and coincides with /1 (t) for I t I � n . It follows from (5.1.11) that /2 (t) is a continuous function of t. Let {en } be the sequence of Fourier coefficients of f2 (t); then n 12 g(x)g(x + t) dx] dt c __!_2n J "' /2 (t) e- int dt __!_2n J -n e-int [_!_A J "'-n/2 1 J n/2 g(x) [ J "+ "' g( y) e-inv dyl dx. 2nA -n/2 -n+ x .... It follows from (5.1.9) that 2 2 1 / c 2nA J -n/2g(x) dx J "/-n/2g{.Y) e - i dy so that n/2 2 1 n Cn 2nA J -n 2 g(x) ei x dx . / Therefore (5.1.12) and t /2 (t) Crt ein .
CHARACTERISTIC FUNCTION S
=
=
=
""
=
� oo .
=
=
=
=
..
=
-n
=
ei ""'
=
..
=
einx
"
n!l
=
,
=
00
� ..
tl -.r;
00
107
INFINI TELY DIVISIBLE CHARACTERISTI C FUNCTIONS
f1 (0) f2 (0)
cn 1, we see that f2 (t) is the characteristic function of a lattice distribution whose discontinuity points are contained in a set of integers. The saltus of F2 ( ) at the point n equals cn (n 0, ± 1, ±2, . . . ) . Clearly f2 ( t) is not identical with f1 (t), and f(t) [/1 (t)] 2 f1 (t) f2 (t), so that the first part of the statement is proved. Let F (x) be the distribu tion function corresponding to f(t) ; the statement that F (x) satisfies con dition (5 . 1 . 6) is obtained by a somewhat lengthy but straightforward Since
=
=
L: 00
n = - oo
=
x
=
x
=
=
=
computation. T. Kawata also obtained a condition which assures that a factorization of the form is not possible.
(5 .1. 4) Thcorent 5.1. 4 . Let F (x) be a distribution function and let O(u) .be a p ositive, , non-decreasing function defined in (0, ) such that O(u) I u 2 du oo. Suppose that for some 0 the relation (5.1.6) holds and that the charac teristic function f(t) of F (x) ad1nits the factorization f(t) f1 (t) f2 (t). Then f2 (t) is uniquely determined by f(t) and f1 (t). For the proof we refer to Kawata (1 9 40) . oo
eo
a >
<
=
1
=
Definition of infinitely divisible characteristic functions In this section we define infinitely divisible characteristic functions and distribution functions and also give some simple examples. The concept of infinite divisibility is very important in probability theory, particularly i n the study of limit theorems. Since the discussion of limit theorems is beyond the scope of this monograph, we will not be able to reveal here the full significance of infinitely divisible characteristic functions. I-Iowever, the analytic properties of this class of characteristic functions are of independent interest and will be studied in this chapter. A characteristic function is said to be infinitely divisible, if for every positive integer n, it is the nth power of some characteristic function. t l 'his means that there exists for every positive integer n a characteristic function such that
5.2
f(t)
fn (t), (5 .2. 1 ) f(t) [Jn(t)]n. [f(t)] 11n, 'fhe function fn(t) is uniquely determined by f(t), fn (t) ==
=
provided that one selects for the nth root the principal branch.(*) The (ttl!)
Fut· this determination fn (t) is continuous and fn ( 0) 1 . It is defined in a neigh IH�urhood o f tlu� origin in which f (t) does n ot vanish. We shall see that f( t) ;:f=. 0 for all t. =
108
CHARACTERI STIC FUNCTIONS
distribution functions which correspond to infinitely divisible charac teristic functions are called infinitely divisible distributions. Alternatively one could start by defining infinitely divisible distribu tions as distributions which can be written-for every positive integer n as the n-fold convolution of some distribution function. It is obvious that this approach is equivalent to the one we used ; we mention it here because it is sometimes convenient to express infinite divisibility in terms of distribution functions. We give next a few examples of infinitely divisible distributions. In all these examples has the same functional form as but contains different parameters. In these cases we see immediately that is in finitely divisible.
fn (t)
f(t)
Examples of infinitely divisible characteristic functions (a) The Degenerate distribution f(t) ei�t, fn(t) eit. (b) The Poisson distribution f(t) exp {l(eit _ t ) }, (c) The Negative Binomial distribution f( t) {p[l - eit] }r, fn (t) {p[l - e"1 - l }rln. (d ) The Normal distribution 2 2 2 { t a a t f(t) exp {i t - � }, fn ( t) exp i -n t - 2n } (e) The Cauchy distribution f(t) exp {ipt - O i t l}, (f) The Gamma distribution fn (t) [1 - (it/0)] - A/n. f(t) [ 1 - (it/0)] - A, ==
f(t)
==
=
=
=
q
-1
==
.u
==
q
p
·
=
=
=
Elementary properties of infinitely divisible characteristic functions We establish first a simple but rather important property of infinitely divisible characteristic functions.
5.3
Theorem 5 .3 . 1 . An infinitely divisible characteristic function has no real zeros. Let f ( t) be an infinitely divisible characteristic function ; then I fn ( t) 1 2 f( t) j 21n is a characteristic function for any positive integer n. I consider g(t) lim I fn(t) 1 2 lim I f(t) 1 21".
W;e
=
=
=
n-+- oo
109 1 The function g( t) can assume only the two values 0 or 1 since g( t) whenever f(t) 0, while g(t) 0 for all t for which f(t) 0. The func 1 , therefore f (t) 0 in a certain tion f( t) is continuous and f( O ) neighbourhood of the origin. In the same neighbourhood g(t) 1, thus g(t) is continuous at t 0 and is, as a limit of characteristic functions, also a characteristic function. But then it must be continuous everywhere and we see that g( t) 1. This means that f(t) 0 for all real t. The characteristic function of a purely discrete distribution with two discontinuity poi�ts ( theorem 5.1.1) is indecomposable and therefore a fortiori notit infinitely divisible. But such a function, for instance f(t) §(2 + e ), need not have real zeros. This example indicates that the converse of theorem 5.3 .1 is not true ; a characteristic function which has INF INITELY DIVI SIBLE CHARACTERISTIC FUNCTIONS
#
=
#
=
=
=
=
=
#
=
=
no real zeros is not necessarily infinitely divisible. Theorem 5.3 . 1 can be used to show that a given distribution is not in finitely divisible. Consider for example the rectangular distribution ; its characteristic function is
f(t) ew. sintr tr. =
f(t)
Since has real zeros it cannot be infinitely divisible. We next discuss two theorems which permit us to assert that a given characteristic function is infinitely divisible.
Theorem 5.3.2 . <*> The product of a finite number of infinitely divisible characteristic functions is infinitely divisible. It is sufficient to prove the theorem for the case of two factors. Suppose therefore that f ( t) and g( t) are infinitely divisible characteristic functions. ,.fhen there exist for any positive integer n two characteristic functions n and g(t) [g ( t)] . Then .fn ( t) and gn ( t) such that f ( t) f ( t)] [ n h(t) g(t) f(t) [gn (t) fn (t)] n so that h(t) is also infinitely divisible. As an example we consider the Laplace distribution which has the characteristic function f(t) 1/(1 + t2). We can write 1 f(t) 1 +it 1 -1 it the product of characteristic functions of two Gamma distributions with parameters - 1, A 1 and + 1, A 1 respectively. We =
=
=
=
n
n
=
=
as
()
=
=
()
=
==
know already that the Gamma distribution is infinitely divisible and con cl ude therefore that the Laplace distribution is also infinitely divisible.
J�ivc later [formula (5 . 5 . 1 2)] an example which shows that the converse statement
i H n o t tru e .
( lfli ) We
1 10
CHARACTERISTIC FUNCTIONS
Corollary to theorem 5 .3 .2. Let f(t) be an infinitely divisible characteristic function, then I f(t) I is also an infinitely divisible characteristic function. It is immediately seen that f( - t) is an infinitely divisible characteristic function whenever f(t) is infinitely divisible. It follows then from theorem 5 .3 .2 that I f ( t) 1 2 is also infinitely divisible. T·his means that ( I f(t ) j 2) 1 1 2n = 1 f(t) 1 11n
is a characteristic function for any positive integer n. But this implies the statement of the corollary. We note that the result of this corollary cannot be improved since it is is a characteristic function whenever not possible to assert that is a characteristic function. Let for example = �(1 + 7 i ) ; then We show by means of an indirect proof that 1 2 = l4(50 + 7e- it + is not a characteristic function. According to the corollary to I theorem 3 .3 .3 it must have the form I = i� + (1 - ) it11 Therefore should satisfy the relations (1 = 674, 2 (1 - = ��- Since cannot be a these relations are inconsistent we conclude that characteristic function.
f(t) I I t f(t) f(t) e 7eit) . I ff(t)( t) I • f(t) ae a e l a a 2 a) 2 a a) I f(t) I Theorem 5 .3 .3 . A characteristic function which is the limit of a sequence of infinitely divisible characteristic functions is infinitely divisible. Let f
=
=
k� oo
=
=
=
It follows from (5 .3 . 1), (5 .3 .2a) and (5 .3 .2b) that l im j�k) = (5 .3 . 3 )
(t) f (t) n >00 k where f,, (t) is continuous at t
=
0.
111
INF INI TELY DIVI SIBLE CHARACTERISTIC FUNCTIONS
f
The characteristic functions are by assumption infinitely divisible, so that the (k) are also characteristic functions. We conclude from (5 .3 .3) and the continuity theorem that is also a characteristic func tion. Equation 5 .3 .2a) then indicates that is infinitely divisible.
fn (t) fn (t) ( f (t) Corollary to theoremcx 5 .3 .3 . Let f(t) be an infinitely divisible characteristic function; then [f(t)] is also a characteristic function for any real, positive The converse is also true. If f(t) is infinitely divisible then the statement follows from the defining a.
property for rational a and is obtained from the continuity theorem for arbitrary positive a . The converse is trivial.
Remark.
A similar argument can be used to show that infinitely divisible characteristic functions could have been defined in a slightly different manner. A characteristic function is infinitely divisible if, and only if, there exists a sequence of positive integers which tends to in is the (n7c)th power of some finity and is such that for any the function characteristic function Theorems 5 .3 .2 and 5 .3 .3 are closure theorems since they indicate that the family of infinitely divisible characteristic functions is closed under certain operations.
fk (t).
5.4
k
f(t)
nk
Construction of infinitely divisible characteristic functions
In this section we discuss two methods for the construction of infinitely divisible characteristic functions. These methods give some interesting in formation concerning the structure of infinitely divisible distributions. We first prove a lemma which is of some independent interest.
Letnnza 5. 4 .1. Let g(t) be11 an arbitrary characteristic function and suppose that p is a positive real nu zher. Then f(t) exp {p[g(t) - 1]} is an infinitely divisible characteristic function. Let n be a positive integer such that n > p. Then g( 1 p[ ] t y � n } ) fn (t) { [1 - (p;n)] + (p/n g( t) {1 + =
i s also
that
a
=
�
characteristic function. We see then from the continuity theorem
{p [g(t) - 1]} also a characteristic function. The function [/( t)] cx ( 0 ) satisfies the of the lemma and is also a characteristic function. We conclude fron1 the corollary to theorexn 5.3.3 that f(t) is infinitely divisible. is cond itions
f(t)
=
lim
fn (t)
=
exp
rx >
112
CHARACTERISTI C FUNCTIONS
We use this lemma to prove the following theorem :
Theorem 5. 4.1 (De Finetti's theorem). A characteristic function is infinitely divisible if, and only if, it has the form j(t) lim exp {pm[gm (t)- 1] } where the Pm are positive real numbers while the gm (t) are characteristic functions. The sufficiency of the condition of the theorem follows immediately show next that from lemma 5. 4 .1 and from the continuity theorem. the condition is necessary and assume that f(t) is infinitely divisible. follows from the corollary to theorem 5.3.3 and from lemma 5.4.1 that frx (t) exp {� [{ f (tW - 1] } is, for any real positive a characteristic function. Since f(t) lim fa. (t) we see that f( t) can be represented in the above form with Pm m and gm (t) [ f(t)] 11m. heorem 5.4.2. The limit of sequence of finite products of Poisson-type Tcharacteristic functions is infinitely divisible. The converse is also true.of Every infinitely divisible characteristic function can be written as the limit sequence offinite products of Poisson-type characteristic functions. The first part of the theorem is a consequence of the closure theorems. To prove the second part we assume that f(t) is infinitely divisible ; according to De Finetti's theorem it can be represented as (5.4.1) f(t) lim exp {Pn [gn (t) - 1 ]} where the gn (t) are the characteristic functions of some distributions Gn ( ) so that g (t) J'"'"' eu.. dG., ( ) =
We
It
oc,
=
=
=
=
a
a
::__
x ,
=
..
x .
Then we see that
(5.4.2) Pn [g ( t) - 1 ] = lim Pn J A- (eilz - 1)dGn(x). n
A� oo
A
We wish to approximate the integral by Darboux sums and therefore intro duce the subdivision -A
= a0
<
a1 < . . . <
aN - t
<
aN =
+A
INFINITELY D IVISIBLE CHARACTERISTIC FUNCTIONS
113
so that
[Pn f A- (e� - 1)dGn (x)J = lim frk=l exp [ck (ew.• - 1)]. A The function (5. 4 . 3 ) is the limit of a finite product of Poisson-type characteristic fun�tions and we see from (5. 4 .1) and (5. 4 . 2 ) that f( t) also has this property. (5. 4.3)
exp
N� oo
The theorem can be used to show that a given characteristic fun ction is infinitely divisible. As an example we consider the characteristic function
p - 1 (p > 1). f(t) = p-e' •t
It is easily seen that
f(t) = k=O2: [ 1 - (1jp)](1/p)k eitk, and we note that this is the characteristic function of the geometric distribution listed in Table 1. We expand log f(t ) = log ( 1 - �) - log ( 1 - �') 00
into a series and see that
1 f(t) = ITk= l exp {k (eitk _ 1)} . We can apply theorem 5. 4 . 2 and see that f(t) is infinitely divisible. 'P
k
5.5 Canonical representations The results of the preceding section can be used to deduce explicit formulae for infinitely divisible characteristic functions. For their derivation we need several auxiliary theorems.
Lemma 5.5.1. Let a be real constant and let O(x) be a real-valued, bounded and non-decreasing function of the real variable x such that 0( - oo) = 0 . Suppose that a function f(t) of the real variable t admits the representation 2 itx 1 + x . (5 . 5 .1) logf(t) = ita + f (ettx _1 - 1 +x ) x 2 dO(x). 1,he2 integrand is defined for x = 0 by continuity, and is therefore equal to - t /2 1;( x 0. Then f(t) is an infinitely divisible characteristic function. Moreover, the constant a and thefunction O(x) are uniquely determined by f(t) . a
oo
- oo
=
2
114
CHARACTERISTI C FUNCTIONS
t
Let belong to an arbitrary fixed interval ; then it is seen that the inte grand of (5 .5 . 1 ) is bounded and continuous in x, so that the integral exists for all values of We first prove by repeated applications of the con tinuity theorem and of the closure theorems that is an infinitely divisible characteristic function. Let < e < and define x2 . O(x) (5 .5 .2) d e x2 X2 e< !xi < U/e)
t.
f(t)
0 1 1 itx + ( it ) e x -1- 1+ I (t) f The function Ie (t) is continuous at t 0 ; we can write it as a limit of Darboux sums Sm (t) where Sm ( t) k=l� [Ak (eitx•- 1)- ipkt] with Ak 1 +x:2k [O(xk) - O(xk_1)] , 1 [O(xk) - O(xk- 1) ] . /lk xk Sm (t) is the second characteristic of a product of Poisson type character istic functions. Ie (t) is the limit of these functions and therefore the logarithm of an infinitely divisible characteristic function. Let now (5 .5 .3) I0 (t) �lim0 Ie (t) 1 itx x2 + ( i ) e x t 1 - - 1 + x 2 x 2 dO(x) . f Clearly I0 (t) is continuous at t 0 ; we conclude again from the continuity theorem that exp [I0(t)] is a characteristic function and then from theorem 5. 3 .3 that it is infinitely divisible. Finally it follows from (5 .5 .1) that t2 log f(t ) I0(t)+ita - [0( +0)-0(-0)]. 2 The last equation shows that f(t) is the product of the infinitely divisible characteristic function exp [I0 ( t)] and the characteristic function of a normal distribution, so that f(t) is also infinitely divisible. We show next that the constant and the function O(x) are uniquely determined by (5 .5 . 1 ) . We write cp(t ) log f(t ) for the second character istic and see easily that (5 .5 .4) cp(t) - � [cp(t + h) + cp( t - h)] a)f eitx (1 - cos xh) 1 +x 2 dO(x). x2 =
=
=
=
==
-
==
==
lxl > o
=
==
a
==
=
- OC)
We now introduce the function
115 Since the integrand in (5.5. 4) is bounded, we can integrate with respect to h under the integral sign and obtain 2 sin 1 + x ) ( A(t) = Joo oo eitx 1 - X X 2 d()( ). INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
x
x
-
We next introduce the function
x sin � ) 1 + y 2 (t - y y 2 d()(y) . A(x) = J 2 x s n y) 1 y (1 dA(y) O(x) = J -
Then
- 00
while
00
•
t
1 +y 2
A(t) = f '
oo
eit"'
y
-
dA(x).
It is easily seen that there exist two positive constants
c1 � ( 1
) 1 +y 2 c
c1 and c2 such that
sin y 0 < ::::; 2 • 2 y y The function A(x) is therefore non-decreasing and bounded ; moreover A( - oo ) = 0. We conclude then that A(x)/A( oo ) agrees with a distribution function at all continuity points of A(x). Hence A(x) is uniquely deter mined by its Fourier transform is defined in terms of Since The fact that the constant we see that A(x) is uniquely determined by is also determined by is a consequence of -
A(t).
A(t) f(t).
f(t),
f(t) (5.5 .1). a Lemma 5.5.2 . Let {c/>n (t)} be a sequence of functions and suppose that fn (t) = exp [c/>n(t)] is determined by some constant an and some function On(x) according to (5. 5 .1) Assume that the sequence cfon (t) converges to some function cp( t) which is continuous at t == 0 . Then there exists a constant a and a bounded and non-decreasing function O(x) such that ( i ) lim an = a (ii ) Lim On (x) == O(x) (iii) �� J d()., (x) = J: d()(x). The function O(x), together with a, determines f(t) == exp [c/>(t)] according to (5.5 .1). 'fhe functions fn ( t) are characteristic functions. Therefore f ( t) = ecb < characteristic function ( by the continuity theorem) and cf> ( t) .
n-+ oo
n-+ oo
..
is also
a
oo
00
everywhere contim1ous.
00
t)
is
116
CHARACTERISTIC FUNCTIONS
We use the same notation as before and write
h ) (t+ t-h) ( n o/n o/ ; A., (t) = J: [o/n(t)J dh x s ny l + f � (x) = ( 1 - y ) yr ao.. (y) -
s o that
i
00
(t) = f: oo eitoo d� (x). From the continuity of cp(t) we conclude that the sequence An (t) converges to a continuous function. We apply corollary 3 to the continuity theorem ( see page 52) to show that the sequence A n(x) converges weakly to a bounded non-decreasing function A(x) and that oo d n (x) = f"' dA(x). f n� We have 2 x s y y O (x) = f ( 1 - Y ) - l +y 2 di\.. (y) and conclude from Helly' s second theorem that x ( sin y - y 2 Lim On (x) = f 1 - y ) 1 +y 2 dA(y) = O(x) (say) . We write oo 2 ( 1 itx + x In (t) = f e�.tx - 1 - 1 +x 2) x 2 d()n (x) and once more use Helly's second theorem to show that lim In (t) = I(t) where 2 ( 1 itx + x oo eitx _ 1 - 1 +x 2) x 2 dO(x) . I(t) = f -oo From the convergence of the cfo n (t) and the In (t) it follows that the sequence {an} must also converge and that cp(t) is determined by a = lim a"' and O (x) according to formula ( 5 . 5 . 1) . Lemma 5 .5 .3 . Let f(t) be an infinitely divisible characteristic function.1 ) Then there exists a sequence of functions cfon (t) which have the form (5 .5. such that lim cfon (t) = cp(t) = lo f(t) . A..
00
- oo
n
n� oo
- oo
A
00
•
1
m
1
- oo
R-+- 00
g
INFINI TELY D IVISI BLE CHARACTERISTIC FUNCTIONS
1 17
n n{e
=
==
=
oo
-
If we write
oo
00
- oo
oo
an = n J
oo
X 2 dFn(x)
+x 2 x y f On(x) (5.5. 7 ) dF n( ) Y 2 1 +y • ) 1 + x2 ( ztx . · c/>n ( t) an zt + J e�tx - 1 - +x 2 x 2 dOn (x) then we see from (5. 5 . 5 ) and (5.5.6) that cf>n (t) has the form (5.5.1) and that lim c/>n (t) cp(t). n�oo n
=
=
- oo
- oo
1
l
00
- oo
=
The three lemmas permit the derivation of the desired canonical repre sentations for infinitely divisible characteristic functions. Let now be an infinitely divisible characteristic function. Since log cannot vanish, the function is defined for all values of t. According to lemma there exists a sequence of functions which has the following property : each has the form ( ) and the sequence as tends to infinity. It follows from converges to If we combine this with the lemma that also has the form we obtain the following theorem. result of lemma
f( t)
f(t) 5. 5 .3 cf>n (t) cf>n (t) 5. 5 .1 cp( t) n cf>n ( t) (5.5 .1). 5. 5 . 2 cf>(t) 5.5.1 Theorem 5. 5 .1 (the Levy-Khinchine canonical representation). The function f(t) is an infinitely divisible characteristic function if, and only if, it can be written in the canonical form ( 2 i ) 1 + x x t t log f(t) ( 5.5.1) ita + J ei x - 1 - 1 +x 2 x 2 d()(x) ttvhere a is real and where O(x) is a non-decreasing and bounded function such hat - oo) 0 . 1.,he integrand is defined for x 0 by continuity to be equal ( t 2/2) . 1rte representation (5 . 5 . 1 ) is unique. f(t)
cp(t)
==
0(
I
to
�
==
=
oo
- oo
==
118 Remark 1.
CHARACTERISTIC FUNCTIONS
f(t)
It can happen that a characteristic function admits a representation of the form with a function which is not a bounded non-decreasing function, but a function of bounded variation. cannot be infinitely divisible. Such a characteristic function
(5.5.1) f( t)
O(x)
A proof of the Levy-Khinchine representation by means Remark 2.'s theorem was given by S. Johansen (1966). The satne paper
of Choquet contains also a characterization of the logarithm of an infinitely divisible characteristic function which is similar to Bochner ' s theorem.
The canonical representation given by the last theorem can be somewhat by modified. We define two functions, (u) and and a constant writing
M N (u) a2 M (u) Jf "- oo 1 +x 2x 2 d()(x) for u 0 2 dO(x) for u 0 (5. 5 .8) N (u) - Jf co 1 +x x2 a 2 0( +0)-fJ(-0). The functions M (u) and N (u) are non-decreasing in the intervals ( 0) and (0, + oo) respectively and M ( - oo ) N ( + oo ) 0. For every finite 0 , the integrals J �. u2dM (u) and J : u2dN ( ) are finite. Conversely, any two functions M (u) and N (u) and any constant a 2 satisfying these con ditions determine, by (5.5 .8) and (5 .5 .1 ) , an infinitely divisible character istic function. We have therefore obtained a second canonical form. Theorem 5.5.2 (the Levy canonical representation). The function f(t) is an infinitely divisible characteristicfunction if, and only if, it can be written in the form 2 2 s= : ( eitu _ 1 - u � 1� u2) dM (u) (5. 5 . 9 ) log f( t) == ita t + oo eitu _ l itu f - 1 + u2)dN (u) +J ( where M(u), N(u) and a 2 satisfy the following conditions: (i) M(u) and N(u) are non-decreasing in the intervals ( - oo, 0 ) and (0 , + oo) respectively . N ( + oo) 0. (ii) M(- oo ) (iii) The integrals J �.u 2dM (u) and J : u 2 dN(u) are finite for ev ery 0. (iv) The constant a 2 is real tlnd non-negative. =
<
=
>
u
=
==
=
u
e >
+o
=
e >
=
oo ,
119
INFINITELY D IVISIBLE CHARACTERISTIC FUNCTI ONS
The representation (5.5 .9) is unique. The canonical representations (5.5.1) and (5. 5 . 9 ) are generalizations of representation, due to Kolmogorov, which is valid only for the character
a istic functions of infinitely divisible distributions with finite variance.
Theorem 5 .5. 3 (the Kolmogorov canonical representation). The function f( t) is the characteristic function of an infinitely divisible distribution with finite second moment if, and only if, it can be written in the form (5.5.10) log f(t) ict + f -ro oo (eiro: _ 1 -itx) dK(x) x2 where c is a real constant while K (u) is a non-decreasing and boundedfunction is unique. such that K(- oo) = 0. The representation The integrand (eit� - 1 -itx)jx 2 is defined. for = 0 to be equal to - (t 2 /2). Let f(t) be an infinitely divisible characteristic function and suppose that =
x
the second moment of its distribution function exists and is finite. Then , can be differentiated twice. We form and therefore also = log the second central difference quotient
and conclude that
(5.5.11)
f(t) L\�(2h)cfo(O2 )
cp(t)
f(t),
ll· m t"nf h--+0
L\�(2h)cp(O2 )
<
oo .
f(t) admits oo a representation (5.5.1) and use (5.5.11) to show that the integral J oo ( 1 + x 2 ) dO(x) is :finite. Then J : oo x dO(x) is also finite. We write K(x) = J� oo (1 +y 2 )dO (y) and c = a + J : ydO (y ) and ob oo tain ( 5 . 5 .1 0). Conversely, suppose that the function cfo ( t) = log f(t) admits a repre sentation (5.5.10). Then x dK(y) f O(x} = - oo 1 +y 2 satisfies the conditions of theorem 5.5.1, so that f(t) is an infinitely divisible characteristic function. Moreover, it is easily seen that (5. 5 .10) may be di:ffcrcntiated twice under the integral sign, so that the second moment of d istribution function corresponding to f(t) exists. The uniqueness of representation is an immediate consequence of the uniqueness of the representation ( 5.5 .1 ).
We note that
the the
1 20
CHARACTERISTIC FUNCTIONS
As an illustration we determine the canonical representation for a given infinitely divisible characteristic function. The procedure repeats the steps and We consider as an example the of the proofs of lemmas Gamma distribution
5.5.3 5.5.2. ()1. r x y" - 1 e-o�� dy F(x) = r(A.) J o
x > 0, for x 0.
for
0 < The corresponding characteristic function is t 1() where () and are two positive parameters. It follows from the form of that it is an infinitely divisible characteristic function, so that is also a characteristic function. We denote the corresponding distribution function by clearly Fn is also a Gamma distribution and
( " t ) ..1. f(t) =
A
f(t)
[f(t)]11n
Fn (x); (x) ()<1./n) f x y<J..fn> - t e-011 dy for x 0 Fn (x) = r(A/n) for x 0. 0 Substituting this into ( 5.5. 7) we get n(}J./n f x y yJ.jn e-()y dy for x > 0 On (x) = r(A/n) 1 +y 2 0 0 for and n 1 J.jn e-011 J. / (} n an - r (A.jn) J 1 +y 2 y dy . We note that A - 1m A = A tm tm n� oo r (Ajn) n� co (Ajn) r(A/n) n� oo r [(A/n) + 1 ] and obtain from lemma 5.5. 2 [ "' y e - 811 dy for x 0 A. ()(x) Lim On (x) 0 1 +y 2 J oo n� for 0 0 while r 6 00 11 e 2 A. d = y. a = nlim l 0 +y oo J � It is then easy to compute the other canonical representations. Table 5 lists the canonical representations of some of the more com111on >
o
<
o
x
<
oo
_
o
1
.
n
=
==
1
.
1"
>
==
x
a.,.
infinitely divisible characteristic functions.
<
Table 5
Canonical representations of infinitely divisible characteristic functions
�arne of distribution
:Kormal _____
Gamma
I
I ,
Characteristic function
exp [it,.. - ia 2 t2] IL real, a• > 0
I (1 - it/B) -1. 8
Cauchy
>
0, A > 0
1 e- Oi t I
I
1 ,..
I
: J 00 ' 0 A
I I
i
Degenerate I eit; e real I exp [A(eit - 1 )]
A > O
I --------�- 1
Negative Binomial
I (1 -Pqeit)
a
;
B(x)
+y
J 0 for x
d 2 y
IA
[
"
P > O q = 1 -p > 0 r > O
I
i
0
g
---
<
0
x >
q r 1 +k2 � k =l
_ __
1
�
J0
-By
dy 1 +y 2
--
0 for x
00
<
0
k =O
for x
>
0
-A
I
:1
I,
J
I
[ 'A/2 I I r qk 1. � 1 + k2 00
Tc = l
I
i I ()
00 e -ex
u
- dx X
1 �1
1
,
1
__
- ()
0
0
0
0
I0
0
0
1 I
'1TU
I
A
II
'I- I
1TU
I A €(u - 1 ) co
. r � [_ €(u - k)
I
I
k=l
0
xJ y e -Ov dy <
0
for x > 0
No representation possible
I
I
_ _ _ _ __
I1 0 for x
i A/ 8
-- �- -
--
0
!
I
k I 2 qk e( x - k) I 2; L 1+
I
0
0
'
I
l
I
:
Ig
---- -
I
' '
I
i 0
r
00 e
I I0
I1 (8/TT) arc tan x + B/2 _
) I : j
I I
0
I k
!
e -()y
, (A/2) €(x - 1 )
A/2
IA II
0
xJ � +y-2 dy
1 for
_I
00
j_
,
e - 811
1
r- ,..
)
Levy representation Kolmogor?v representation M(u) N(u) a 1 u < 0 u > O c K(x) ------• a 0 0 a €( X)
a
I
�- a • E(x)
-------
8 > 0
Poisson
Levy-Khinchine representation
k
k + r log p
1,·-g--1 1 : I i
I
A
0
-
i A €(x - 1 )
r; I
0 for x
r
<
0
2; kqk e(x - k) 00
k =O
for x > 0
122
CHARA CTERISTIC FUNCTIONS
We conclude this section with a few remarks concerning the factori zation of infinitely divisible characteristic functions.
Theorem 5.5.4. Let f(t) be an infinitely divisible characteristic function and suppose that it can be decomposed into two infinitely divisible factors, f(t) = /1 (t)/2 (t). Then f(t) and /1 (t) determine f2 (t) uniquely. The theorem follows immediately from the uniqueness of the canonical representation ; it shows that the cancellation law holds if we restrict the decompositions to infinitely divisible factors. However, these are not the only possible decompositions ; infinitely divisible characteristic functions can have factors which are not themselves infinitely divisible. We give the following example. It can be Let and be two positive real numbers and write shown that the function
a b v = a + ib. v)][ 1 + (itjv)] 5< · 5 · 12) f(t) [1 - (it[1;+a)(it][ lj-(itj v)][1 -(it; v)] is a characteristic function <*> if (5.5.13) b 2a v2. Then f (- t) is also a characteristic function, as is g(t) = f(t)f(-t) l f(t) J 2 1 + (t12ja 2) " We will show later (theorem 8. 4 .1) that f(t) and therefore also f( - t) are not infinitely divisible. The product ( t) f ( t) f ( - t) is the characteristic function of the Laplace distribution which is known to be infinitely divi sible (see page 109). The functionf(t), determined by (5. 5 .12) and (5. 5 .13), has the following interesting property : f(t) is a characteristic function but is not infinitely divisible, however I f(t) l 2 and therefore also I f(t) I are infinitely divisible characteristic functions. Thus, the infinitely divisible characteristic function I f(t) 1 2 admits two decompositions, I f(t) 1 2 = I f(t) I . I f(t) I = f(t) f(-t). =
�
=
=
g
==
The first decomposition has two infinitely divisible factors while the factors of the second decomposition are not infinitely divisible. This example shows that two different characteristic functions, namely and can have the same absolute value. The next example (t) presents an even more surprising phenomenon by
f(t)
I f( t) I ,
(•) To show this , one expands f(t) into partial fractions and computes 1
27T
-
ooJ
00
e- it x
f(t) dt
by integrating the expansion term by term. It is not difficult to show that the resulting -
expre ssion is non-negative if (5 . 5 . 1 3) is satisfied. ("I"} l)uc to W. Fcllct\
1 23
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
showing that two different real characteristic functions may have the same square. Let f(t) be a real periodic function with period 2 which is defined by puttingf(t) t I for I t I � The functionf(t) satisfies the conditions of theorem .2 and is therefore a characteristic function. We consider also the Polya-type characteristic function that is,
4. 3 =
1-1
1.
k(t) It follows from
(5.5.14) where
f(t) A.,
=
so that
=
(4.3.9) that
(4. 3 .11), {01 - 1 t I forfor II tt II �� 1.1
j+ n"f:.1 A., cos nnt rJ +/1 {t } cos nnt dt 2 Jr 0l (1 - t) cos nnt dt � 0 _ _ =
A
oo
=
A0
'
=
1
while
00
2: A n
n=l
=
�.
F
Clearly f (t) is the characteristic function of a lattice distribution (x) which has a jump of magnitude � at x and jumps An/2 at the points + + 2, . . . ). We introduce now a second lattice distri n kn (k and saltus An at the points bution H (x) which has saltus at x n kn (k + 1 , + 2, . . . ). The corresponding characteristic function is =
=
=
=
1,
=
0
h(t)
2 L: An cos nnt. 00
n =l
=
It is easily seen that h(t) so that
=
0 0
==
2 [f(t) - �]
(5.5 .15) i s also a characteristic function. It follows from (5 .5 . 1 5) that g(t) is periodic
4
1-1
with period and that g(t) t l for I t I � 2. It is easily seen [for instance by considering the graphs of f(t) and g(t)] that I f(t) I l g (t) ! . Since f(t) and g(t) are both real-valued functions this means that [f(t)] [g(t)] 2 . Wc next give another example which shows that an infinitely divisible characteristic function may have an indecomposable factor. I �ct and q be two positive real numbers such that
2
=
=
=
p
' l'hc fu nction
p
>
q
>
0
and
p + 1. q
=
124
CHARACTERISTIC FUNCTIONS
is then-according to theorem 5 . 1 . 1 -an indecomposable characteristic function. We write eit] log p + log [1 + log
Y 1 ( t)
g1 ( t)
=
= =
It is then easily seen that
l og p +
I; (
j=l
(q/p)
- l_}i-1 (qp)1 eiit. J
( - Jl.)i-1 (9:); eiti ) . yt (t) ( p Let 1 ( q) cp(t) n=1� 2n - 1 p [eitc2n- 1) - 1 ] 1 ( q ) 2n e2nit _ 1 ] , Y 2 (t) n=l� -2n p- [ then Y1 (t) cp(t)-s t Y2 ( t). ecb and g2 ( t) eY ( > are infinitely divisible character The functionsf(t) istic functions ; moreover, f(t) gl (t)g2 (t). The infinitely divisible characteristic function f (t ) therefore has an in decomposable factor g1 (t). We conclude this section by mentioning certain investigations con =
=
-1
I;
j=l
2n- l
oo
=
oo
=
=
=
=
cerning the "Lebesgue properties" (absolute continuity, singularity, dis creteness) of infinitely divisible distributions. P. Hartman and A. Wintner (1942) proved that an infinitely divisible characteristic function belongs to a pure distribution if the function in its Levy-Khinchine canonical representation is discrete. These authors also gave examples of the three possible pure types of infinitely divisible characteristic functions. The existence of infinitely divisible distribution functions of all these types of the suggests the problem of finding conditions on the function N Levy-Khinchine canonical representation [respectively on of the Levy canonical representation] which assure that the corresponding distribution function belongs to a specified type. J. R. Blum and M. Rosenblatt 1 9 9 obtained the following result in this direction.
O(x)
O(x) a 2 , M (u), (u)
( 5) Theorem 5. 5 . 5. Let F(x) be an infinitely divisible distribution with character istic function f(t) and let O(x) be the function in its Levy-Khinchine canonical representation. Then (i) F (x) is discrete if, and only if, ooJ ] dO(x) and tf O(x) is purely discrete. x2 __
- IX,)
<
oo
125
INFINITELY DIVISIBLE CHARACTERISTIC FUN CTIONS
F (x) is a mixture if, and only if, f � dfJ(x) oo while O(x) is not purely discrete. X J (iii) F(x) is continuous(* > if, and only if, J - oo X dO(x) oo . Theorem 5. 5 . 5 � ,gives a satisfactory criterion for the discreteness of an (ii)
<
""
- oo
oo
1
2
=
infinitely divisible distribution but does not permit us to distinguish be tween purely singular and purely absolutely continuous distributions. H. G . Tucker supplemented this result by giving a sufficient condition which assures that an infinitely divisible distribution is ab solutely continuous.
(1962)
Theorem 5. 5 . 6 . Let F(x) be an infinitely divisible distribution -with char acteristic function f(t) and let O(x) be the function in its Levy Khinchine canonical representation. Then F(x) is absolutely continuous if at least one of the following two conditions is satisfied: (i) O(x) is not continuous at 0, or 0. (ii) fro \ df)ac (x) - oo X The function (}ac(x) is the absolutely continuous component of O(x). We 0 f x =
=
write here and in the following
oo
==
- oo
J
-
+
oo
J
oo
+O
.
A similar sufficient condition vvas given by M. Fisz and V. S. Varadarajan who used the Levy canonical representation. In a subsequent paper H. G. Tucker ) gave sufficient conditions which assure that a discrete such that + 0 [or alter natively the discrete functions and defined by for the lA�vy canonical representation] produce the characteristic function of a purely singular infinitely divisible distribution function. These sufficient conditions are not satisfied for an example given by P. Hartman and A. Wintner of discrete functions which produce a purely singular distribution function. A necessary and sufficient condition for the absolute continuity of an infinitely divisible distribution was also given by H. G. Tucker and this we now state. For the formulation of this condition it is convenient to
( 1963)
(1964 O(x) 0( 0) - 0( - 0) M(u) N (u) (5.5 .8) ==
(1942)
M(u)
N (u)
(1965),
(•)
i . e . absolutely co n tinuou s , or continuous singular, or a mixture of an absolutely '-� ontinuous and n singular component.
126
write
CHARACTERISTIC FUNCTIONS
(5.5.8) in a slightly different form. We put 2 1 M ( ) J � oo :: dO(x) G (u) oo N (u) J l + x2 dfJ(x) u
==
0 for u 0-
for u
=
== -
u
X
<
>
2
The I.Jevy canonical representation is then given by
oo 2 2 (5.5 .16) log f(t) ita-a t /2 + f 00 (e 1 - �uu 2) dG (u). u"
==
1
-
u
We also introduce the following notation. Let Gac (u), G8 (u) and Gd ( ) be the absolutely continuous, the singular, and the discrete component of G ) , respectively, and write pi (x) for the infinitely divisible distribution function which is obtained if G (u) is replaced by Gi in ==
(u (5.We 5 .16).can now formulate Tucker'
(u) (i ac, s, d)
s necessary and sufficient condition :
Theorem 5.5. 7 . Let F (x) be an infinitely divisible distribution function with characteristic function given by (5.5.16). A necessary and sufficient condition that F (x) be absolutely continuous is that at least one of the following five conditions holds:00 (i)
J 00 dGac (u) 2
oo ;
O(u) not continuous at u 0] ; a 0is[i.e.absolutel y continuous; is absolutely continuous; is singular , d ps (x) is continuous but not absolutely continuous, while F * F8 is absolutely continuous.
> (ii) (iii) Fa (x) (iv) F8 (x) (v) Fa (x)
Remark.
=
==
The theorem does not state that each of the conditions (i) to (v) is necessary, but it states that at least one of them is necessary. Each of these conditions is sufficient for the absolute continuity of F (x) . 5.6 A limit theorem We have shown (theorem 5 .3 .3) that a characteristic function which is the limit of a sequence of infinitely divisible characteristic functions is also infinitely divisible. In the present section we show that under certain con ditions the limit of a sequence of characteristic functions is infinitely divisible, even if the elements of the sequence are not infinitely divisible characteristic functions. We consider in the following an infinite sequence of finite sets of characteristic functions. Such a system {.f:t3 == 1 , 2, . .
( t)} (j
.
, k.,. ;
127
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
n
. . . , ad. inf.) can be arranged in a two-dimensional array : /11 (t) , f1 2 (t) , . . . , f1kl (t); f21 (t), f22 (t), . . . , f2k,. (t);. (5 .6. 1 ) . . . . . . . . . . . . . . . .. ................ . . . . . . . . . . . . . . . .. We form the (fini�e) products fn (t) ITj= 1 fnj (t) of the functions in each row of the scheme (5 .6. 1 ) and wish to investigate their limits. As usual, we denote by Fn3 (x) the distribution function which corresponds to fn3 (t). The following theorem contains a very im portant result. Theorem 5 .6. 1 . Let {fn3(t)} (j 1 , 2, . . . , k'fl ; n 1 , 2, . . . , ad. inf. ) be a system of characteristic functions and suppose that , for all t, (5 .6.2) lim [ sup I fn i (t) - 1 1] 0. Denote by gn (t) the characteristic function determined by oo (eitre _ l )dF,.; (x + rx.,;)} (5 .6.3) log gn (t) 1�1 { it a... ; + f where rxn, f lxl < -rX dFn3 (x) atld where 0 is constant. The necessary and sufficient condition for the convergence of the sequence of characteristic functions fn(t) = j=ITl fn; (t) (5 . 6 .4 ) characteristic function f(t) is that the sequence gn (t) converge to a limit. 'then the limits of the sequences fn (t) and gn (t) coincide. '11 he characteristic functions gn (t) are infinitely divisible. This can be by writing them in the canonical form (5 .5 . 1 ) with f x O(x) j2:= l l y+2y dFni (y + r:l..n;) a � [rxn; + f - +xx 2 dF,.; (x + <Xn;)J oo by noting that the gn ( t ) are finite products of limits of Poisson-type l�huructcristic functions. 1,heorem indicates that it is possible to =
1 , 2,
'
'
kn
==
=
=
=
=
00
=
1:
a
>
kn
lo
a
seen
==
-
and
3 =1
2
00
00
=
or
kn
1
5 .6. 1
128
CHARACTERISTIC FUNCTIONS
replace the investigation of the limit of a system of arbitrary characteristic functions [subject to the restriction 5 .6.2)] by the investigation of the limit of a sequence of infinitely divisible characteristic functions. This cir cumstance explains the great importance of theorem 5 . 6. 1 in connection with the study of limit distributions for sums of independent random variables. We do not intend to discuss limit theorems in this monograph and will therefore not be in a position to appreciate the full significance of this theorem. For its proof we refer the reader to B . V. Gnedenko A. N. Kolmogorov (1 954), p. 1 1 2 , where this result can be found in its proper context. In connection with our investigation of factorization problems we will use a corollary to theorem 5 .6. 1 .
(
Corollary to theorem 5 . 6. 1 . Let f(t) be a characteristic function and suppose that f(t) admits a sequence of decompositions f(t) = IT fn; (t) (n = 1 , 2, . . .) where thefn; ( t) (j = 1 , 2, . . . , kn ; n = 1 , 2, . . . ) form a system of character istic functions which satisfy (5 .6.2) . Then f(t) is infinitely divisible. The corollary follows immediately from theorem 5 .6. 1 if we observe that fn (t) = f(t ) . kn
Jr= l
5.7 Characteristic functions of stable distributions In this section we discuss a class of infinitely divisible distribution functions, the so-called stable distributions. Stable distributions and their characteristic functions are important in connection with certain limit theorems and were originally introduced in this context. Our study of these distributions is motivated by the fact that the class of stable character istic functions is of independent interest and occurs also in some problems not related to limit theorems. is said to be stable if to every A distribution function > > and real there corresponds a positive number and a real number such that the relation
b2 0,
c1, c2
c
F(x)
b 0 , 1 b
(5 .7. 1 ) holds. The characteristic function of a stable distribution is called a stable characteristic function. ]�quation (5 .7. 1 ) is not so much a property of an individual distribtition function but is rather a characteristic of the type to which
F(x)
F (x)
129
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
belongs. It would therefore be more appropriate to say that a distribution belongs to a stable type if its type is closed with respect to convolutions. The defining relation 5 .7. can be expressed in terms of characteristic functions as 5 .7. where y be positive real numbers ; it follows then from Let (5 .7.2) that
( 1)
( 2)
= c-c1- c2 . b�, b�, . . . , b� n f (b� t) f(b� t) . . . f(b� t) = f(b' t) eiy't where is some real number, while b ' is a positive number. If we put b; = 1 (j = 1, . . . , n) and write bn for the corresponding value of b ', then we get y
'
or
f(t) = {!(:J exp [ - ��Jr.
T he last formula implies the following result :
Theorem 5 . 7 .1. A stable characteristic function is always infinitely divisible.
We see therefore that a stable characteristic function has no real zeros. We can take logarithms in (5 .7 .2) and express this equation in terms of the second characteristic We obtain (5 .7 .3 ) Since is the logarithm of an infinitely divisible characteristic function, we can write it in the canonical form 5 .5 as
cfo(t). cfo(bl t) +cp(b2 t) = cp(bt) +iyt. cp(t) ( .1) 2 ) 1 itx + 4>(t) = ita + Jf _"" co (eitx _ 1 - 1 +x 2 : d()(x). follows that 2 2 r it ) 1 y +b y oo cp(bt) = iatb + J - co (e� v - 1 - 1 + b - 2y 2 b - 2y 2 d()(b - 1 y) . Since the function z/(1 +b 2 z 2 ) is bounded, we see that the integral z y oo oo b J 00 1 + b 2 z 2 dO(z) = J 00 1 +y 2 d()(b - 1 y) ex ists. We write X
It
0
t
-
-
and obtain, by means of an elementary computation,
(5 .7. 4-)
2 2 1 y ) it +b y cfo(bt) = ita + J oo ( - 1 - -+y-2 b- 2 2 d()(b - 1 y). y b
--- 00
eit·u
1
130
CHARACTERISTIC FUNCT IONS
We introduce again the functions
2 M(u) J �"' ;; dO(y) where u 0 oo 2 1 + y N (u) J y 2 d()(y) where u > 0 and write a 2 () ( + 0 ) - 0 ( - 0 ) . With this notation we obtain from (5 .7.3) and ( 5. 7. 4) the relation -0 2 2 b a itabl - 2 t 2 + J - (eit11 - 1 - 1 z+"tyy 2) dM(b - 1 y) ( oo 2 it y ) b 1 i t 11 1 + J +o e - 1 +y 2 dN (b - y)+ita - 22a 2 t 2 o oo it y ) J 1 11 _ i t + J (e 1 - 1 +y 2 dM(b2- y) + +o (eit11 _1 - 1 it+yy 2) dN (b2- 1y) o 2 2 b a J itab - 2 t 2 + (eit11 - 1 - 1 it+yy 2) dM (b - 1 y) oo it y ) . e 1 ( t '� � + J +o � 1 +y2 tMV(b - 1y) +iyt. From the uniqueness of the canonical representation we see that a 2 (b 2 -1 b� - b�) 01 (5 .7.5a) M(b -1 y) M(b!1 y+M(b211 y) if y 0 (5 .7.5b) (5 .7.5c) N(b- y) N (b1 y)+N(b2 Y) if y > 0. We first determine the function M(u) (u < 0). Let {3 1 , /3 2 , • • • , fln be n positive real numbers ; it follows from (5 .7.5b) that there exists a positive number fJ {3({3 1 , {J 2 , • • • , fln) such that M({J1 y)+M(f32y)+ . . . +M(fJnY) M(f3y) . We substitute here {33 1 (j 1 , . . . , n) and write {J( l , 1 , . . . , 1) An and see that nM (y) M (yAn) or (1/n)M(y) M(y/A- ) Here y < 0 and A n 0 . Using this reasoning we see that to every positive rational number r m/n (m , n positive integers) there corresponds a positive real number A A(r) Am/An such that (5 .7.6) rM(y) M(Ay) (y 0). The function A A(r) is defined for all rational r > 0 ; we show next that A (r) is non-increasing for rational values of the argument. Let r1 and r2 be two rational numbers and suppose that r2• Since = =
=
1
l
<
u
1
00
b2
1
- oo
=
- 00
=
=
<
=
=
=
=
=
=
=
=
>
=
=
=
==
n
·
=
<
r1 <
131
INFINITELY DIVI SIBLE CHARACTERISTIC FUNCTI ONS
M(u) 0 we see that r1 M(u) � r2 M(u) or, according to (5 .7 .6), M [A(r1)u] M[A(r2)u]. Since M(u) is non-decreasing and u 0 we conclude that A( r1 ) A(r 2 ). By the same reasoning we can show that A (r) is strictly decreasing, provided that M (u) 0. Let us suppose from now on that M ( u) 0. We now define a function for all positive real values of x by means of if x is a positive rational number (5 · 7 · 7) B(x) - {A(x) l.u.b. A(r) if x 0 is irrational. It follows from this definition that B( x) is non-increasing and it is easy to show that B( x) is strictly decreasing. Let now be an arbitrary positive real number ; then there exist two sequences {rv } and {r�} of rational numbers such that the rv approach x from below while the r� tend to x from above. Since rv x r� we have B(rv ) > B(x) > B(r�) and hence yseeB(rv)that yB(x) yB(r�, ) for any 0. Since M(u) is non-decreasing we M [ yB(rv)] � M[yB(x)] � M[yB(r�)]. It follows from (5 .7.7) and (5 .7.6) that rv M (y ) � M[yB(x)] � r�M (y). We let tend to infinity and see that for every real positive x there exists a B(x) > 0 such that (5 .7.8) xM(y) M [yB(x)] (y 0). Since the function M (u) is non-decreasing and has the property that M (- oo ) 0, we see that B(O) oo , B( 1 ) 1 , B( oo) 0. 'fhe strictly decreasing function z B(x) has an inverse function x {J(z). This function is defined for z 0 and is single-valued and non-negative. We rewrite (5 .7. 8) in terms of {J(z) and see that to every real z > 0 there corresponds a {J(z) > 0 such that (5 .7.9) {J(z)M(y) M(yz) satisfied. Let 1n1 (y) and m 2 (y ) be two solutions of (5 .7.9) and suppose nz1 (y) 0. We put m ) y { 2 m(y) mt (Y) �
�
<
�
=!=
=/=.
_
r> x
>
x
<
<
<
y
<
<
v
<
=
=
=
=
=
�
=
=
=
is that
=I=
=
a n d sec that
zy ) {J(z)m2 (y) m2 (y) m(y). 1n(zy) mm21((zy) {J(z)m1 (y) m1 (y) indicates that the quotient of two solutions of (5 .7.9) is a constant. (y) I y I a solution and {J(z) I z 1 - cx . Therefore the
' rh if? M o reover
=
=
tn 1
=
� "" tl
is
=
=
=
1 32
CHARACTERISTIC FUNCTIONS
general solution of (5 .7.9) has the form
M(y) C i Y 1 -rtl . t
=
M MJ � 1 u 2 dM(u) is finite ; this permits the conclusion 1 2. We have there fore found that 2, u 0). M(u) C1 l u 1 - cx1 (C1 0, 0 (5 .7. 1 0) The solution (5 .7. 10) includes the case M(y) 0, since we admitted the possibility that C1 0. We substitute (5 .7. 10) into (5 .7 .5b) and see that ( 5 . 7 . 1 1 a) C1 [brt1 -b�1 -b�1] 0. The function N (u ) can be determined from relation (5 .7. 5 c) in the same way in which M(u) was found. One obtains (5 .7. 1 2) N (u) - C2 urta (C2 0, 0 (X2 2, u 0) and notes that c2 [b<Xa - b�a - b�a] 0. (5 .7. 1 1 b) We show next that a 2 0 implies C1 0 so that M(u) 0 and C 2 N(u) 0. We conclude from (5 .7.5a) that a 2 0 implies b 2 -b� - bi 0 . Since (X 1 2, 2 2, we infer from (5 .7. 1 1 a) and (5 .7. 1 1b) that hand, M(u) [or N(u)] is not identically zero, Cthen 1 CC2 > 00.[orIf,Con2 >the0]other . We put b 1 from (5 .7. 1 1 a) b2 1 and conclude 1 [or (5 .7. 1 1 b)] that brx1 (or brt2) 2. Then necessarily b 2 2 so that it follows from (5 .7.5a) that a 2 0. We finally show that (X 1 • Suppose that C1 > 0, C2 > 0, and put (X 2 b2 1 ; it follows from (5 .7 . 1 1 a) and (5 .7. 1 1 b) that ba;1 2 ba;s again b 1 so that (X l (X2 · We have therefore determined the canonical representation (in Levy ' s
Since ( co ) 0 we must have oc1 > 0 and since (y ) is non-decreas ing we see that C1 � 0. We know (theorem 5 .5 .2) that the integral =
oc
�
=
<
OC t
<
<
<
=
=
=
�
=
=
=
oc
=
=
=
=
=
=
=
=
=
=I=
<
=
>
<
=
=I=
<
<
=
=
=1=
=
=
=
form) of stable distributions and summarize our result.
Theorem 5 .7.2. The characteristic function of a stable distribution has the canonical representation 2 u log f(t) ita - � t 2 + J � ( e _ 1 - � 2) dM (u) (5 .7. 1 3) 1 u oo + J oo (eitu _ 1 - 1 itu+u 2) dN(u) where either a 2 0 and M (u) 0, N (u) 0 or 0, (u) C1l u 1 - cx (u 0), (u) - C2 u-- « (u 0). uu
=
o
=1=
a2
==
M
=
=
=
<
N
=
>
INFINITELY D IVISIBLE CHARACTERISTIC FUNCTIONS
The parameters are here subject to the restrictions 2, cl � 0, c2 � 0, cl + c2 > 0. 0 Conversely, any characteristic function of the form (5 .7. 1 3 ) is stable.
133
< rx <
The last statement of the theorem is easily verified by elementary com putations. The parameter rx is called the exponent of the stable distribution. It is possible to obtain an explicit formula for the second characteristic of stable distributions by evaluating the integrals
· ztu of- oo (e"'.t 1 + u 2) I udlcxu+ l (5 .7 . 1 4a ) and oo ) itu du tu ( 1 ( 5 . 7. 14b ) f ei 1 +u 2 ucx + t o which occur in their canonical representation. The computations are 2. 1 and 1 carried out separately for the three cases 0 1, 1 . It is then easily seen that the We first consider the case integrals f 0 oo u 2 j uduj 1 +cx and f oo u 2 du1 + 1 +u u cx - 1 +u u_
-
1
-
0
<
< a <
�
<
rx
< rx <
==
o
are finite. Therefore one can rewrite (5 .7. 1 3) in the form
= ita' + ocC1 f�ao (eit l ) I u�:+I +ocC2 J � (eitu - 1 ) �:1 • We suppose first that t 0; changing the variables of integration in (5 .7. 1 5 ), we get (5 .7. 1 6) log f ( t) ita'+ oct" [cl f� (e 1 ) V�:IX + C2 f� e • 1 ) V�: l] .�et r be the contour consisting of the segment [r, R] of the real axis, the arc z Re# (0 � rp � �) of the circle with radius R around the origin, the segment [iR , ir] of the imaginary axis, and the arc z = re# (� � rp � 0 ) the circle with radius r around the origin. It follows from Cauchy' s that dz = 0. ( - 1) J
(5 .7. 1 5)
log f(t)
u
_
>
=
-
I
i"
-
=
of thcorctn
p
eiz
-- 1 -+· (,t
z
(
i
-
1 34
CHARACTERISTIC FUNCTIONS
Moreover it is easily seen that the integrals over the circular arcs tend to zero as r -+ or as -+ Therefore
R 0. oo ( - 1 ) dv = e- vr. cx/2 L1 (rx) J v1 + � d oo 1 ) (rx) (e-Y = J L1 1� 0.
0,
e�v •
o
where
y �
0
Similarly
dv oo -iv J o (e - 1) v1 + �
=
<
eirecx/2 L1 (rx) .
It follows from (5 .7. 1 6) that
log f(t) = ita ' + t"' cx.L 1 (oc)(C1 + C2 ) cos
�IX [ 1 - i �: + �: tan �IX] .
Considering the Hermitian property of characteristic functions and writing nrx. c = - rxL 1 (rx)(C1 -1- C2) cos 2 >
fJ
we see that for
0
0
cl - c2 , C1 + C2 < oc < 1 and every t, _
_
(
log f(t) = ita ' - c J t l "' 1 + i{J
(5 .7. 1 7a)
where c > and ] fJ I < 1 . We next consider the case 1 u 2 du o 1 + u 2 u"'
0
oo J
� tan �oc) ,
It is easily seen that u 2 du "" 1 + u 2 1 u I" < oo
< a < 2. =
o
J-
·
By changing the constant a, we can rewrite (5 .7. 1 3 ) in the form log f(t) = du du . . . itu itu '' ) C e rx e ( 1 t 1 ( t ) rx C - -z u + 2 - - z u �+ 1 ' tta + 1 t cx 0 U IUJ + or for t > (5 .7. 1 8)
0,
o J - oo
log f(t)
oo J
=
135
INF INITELY DIVISIBLE CHARACTERISTIC FUNCT IONS
:
We integrate the function (e - iz _ 1 + iz) z + l along the contour r and,
""J
repeating the argument used above, we see that dv einrt./2 L 2 ( rx) (e- i• - 1 + iv) + l v� o while . dv _ (e�v 1 zv ) cx+ l = e-vr�1 2 L 2 (rt..) 0 v where dv (e - v - 1 + v) i +cx > 0. L 2 ( rt..) = 0
J oo
=
0
0
J
oo
v
t 0 rx log f(t ) = ita"-ctrt. ( 1 + ip tg � )
We then see from (5 . 7 . 1 8) that for
>
nrt..
C1 - C2 . = For < 0, where - a.(C1 + C2 ) L 2 (a.) cos z > 0 while C + 1 C2 • p can be determined by means of the Hermitian property of character istic functions and we have for 1 < rt.. < 2
c ==
f(t)
t
f(t) = ita"- cj t jrt. ( 1 + iP � tg �rx) with c 0, I ,B l � 1 . We still have to discuss the case = 1. We note that (see page 49 ) log
(5 . 7 . 1 7 b ) >
J oo 1
a
cos y n = d y 0 2 y2 and use this to compute the integrals in (5 . 7 . 1 3 ) . We see that for > 0 • cos u - 1 u du it u du u t _ d u+z s1n tu ei - 1 - u2 1 + u2 u2 o o 1 + u2 u2 o oo sin t u du . 1. du - -t + z 1m 2 u2 s�o u( 1 + u 2 ) sin v + i lim dv e V2 2 �o i v + _ dv 2 v( 1 v 2 ) It is eas i ly seen that sin x 1 d = 1" sin x 1 . x 00 d A x 2 2 o e� X2 - x( l + x ) x x( l + x 2 ) , <
J 00 (
)
=J ( 00
.
J
-
00 t
n - n-t
)
e
.J
[J { t J et 8
00
(
t
Jt oo 8
) � ]} ) J (
t [J � e:
00
s
t )
-
-
J
136
CHARACTERI STIC FUNCTIONS
moreover,
8t sin v f dv lim 8
8-+0
so that
v2
fst dv == log t
lim 8-+0 8
=
v
-
foo (e�u _ 1 ztu· ) du2 = - n-t - xt. og t+ zt. 1 +u 2 u 2 o Since the two integrals in (5 .7. 1 4) are complex conjugates , we see that f o oo (e t _ 1 1 itu+ u 2) duu 2 = f oo (e _ 1 + 1 itu+ u 2) duu2 ·t
iu
-
so that for
t
-
1
-
-
o
'JT
>
log
A
.
- itu
•
---2 t + zt og t - A"zt
0
1
f(t) = ita"-(C1 + C2) i t+ ( C1 -C2)it log t.
It follows from the Hermitian property that for rx
= 1 and all real
f(t) == ita"- cj t 1{ 1 + iP �� log I t 1 } . C Cl2. Here c = (C1 + C2 ) z and p = C1 + C2 (5 .7 . 1 7c)
t
log
:n
We have therefore obtained the following result :
Theorem 5 .7.3 . characteristic function f( t) is stable if, and only if, its second characteristic has the form<*> cfo(t) = log f(t) = iat - cj t I" { 1 + iP � ( j t j , oc)} (5 .7. 1 9) where the constants c, fJ, rx satisfy the conditions c 0, I fJ I � 1 , 0 rx � 2, while a is a real number. The function ( l t I , a.) is given by (nrx/2) if rx 1 (\ t \ rx) = {tan (2/ ) og I t I if rx = 1 . We note that (j t j, 2) 0, so that one obtains the normal distribution A
w
w
w
n
'
1
�
w
<
#
=
for rx = 2. We remark that P . Levy ( 1 937a) used the term stable distribution to describe a somewhat narrower class. He used instead of ( 7. 1 ) the equation (5 .7.20) ( 41t )
F (;) * F (;) = F G)
5.
We follow in our notation B. V. Gnedenko-A. N. l{olmogorov ( 1 954) an d I-Jo,eve (1963). This differs from the notation used by other authors who follow l,cvy (1 93 7a) and nsaign the opposite sign to � in the canon ical forn1 (5 .7. 1 9) .
1 37
INFINITELY D IVISI BLE CHARACTERISTIC FUNCTIONS
as the defining relation. P. Levy [ ( 1 93 7a), p. 208] called the distribu tions defined by (5 .7. 1 ) quasi-stable distributions. We adopt here the terminology used by B . V. Gnedenko-A. N. Kolmogorov (1 954) and we will call the sub-class defined by (5 .7.20) the stable distributions in the restricted sense. The characteristic functions of these distributions can be determined by an argument similar to the one which we used in deriving the representation (5 .7. 1 9). The only essential difference between the two classes occurs if rx = 1 . In this case (5 .7.20) yields only the characteristic function of the Cauchy distribution, log f( t ) = - c/ t I + a t , which corres ponds to the case oc 1 , f3 = 0 in (5 .7. 1 9). If rx # 1 then the characteristic function of the class defined by (5 .7.20 ) is obtained by putting a 0 in (5 .7. 1 9). It is sometimes co nvenient to modify the representation ( 5. 7 . 1 9) and to write the characteristic function of stable distributions with exponent rx =f:. 1 in a different form. We show that the second characteristic of a stable distribution with exponent oc # 1 is also given by the formula<*>
i
=
(5 .7.21)
cp(t)
ia t - Aj t I " exp
=
=
n
{ - i � ;}
Here rx is the exponent of the stable distribution, while A > 0 and y are the parameters to be determined. Comparing (5 .7. 1 9) and ( 5 .7.21), we obtain the relations (5 .7 .22a)
c
ny
= A. cos -
2
f3 ==
ny 'Jtrx cot tan . T T
Formula (5 .7.22a) gives the parameters c and fJ in terms of rx, A and y. We can also obtain expressions for A and y as functions of rx, c and fl. For this we introduce a quantity L\ , defined by the equation
nrx . 2 nrx 2 2 2 � = cos + {3 s1n - = 2 2
'J'l(J. 2 cos 2
cos 2 'l'lJ' 2
.
nrx 1 cos - = � - cos 2 2 ny
( nrx) - I A = c� cos
(5 .7.22b)
Z
sgn � = sgn (1 - (X) . ( *' ) I f tX = 2,
we
put
y
=
0
so
that for·mula ( 5 . 7. 21 ) is a lso valid in this case.
138
CHARACTERISTIC FUNCTIONS
c 0, 0
0.
The last relation in (5 .7 .22b) follows from the inequalities � A � Using the relation I � 1 one can conclude that I y I � oc if < oc < 1 , � 2 - oc if 1 < oc � 2. We write while K(oc) == 1 - 1 1 - oc I and see that \ y j � K(oc). We note that K(oc) oc if O < oc < 1 , while K(oc) < oc if 1 < oc < 2. lf we put y == K(oc)� we obtain the representation n (oc) r) [ex exp (5 .7.23)
{J I
I rl
=
cp(t) iat - y[ t 0 , 0 oc � 2, oc =
{-i : � }
I I # 1 , I � I � 1 . The constants A and c are scaJe
< where A � factors, and by a suitable choice of the variable they can b e made equal to 1 .
5.8 Frequency functions of stable distributions Let be the characteristic function of a stable distribution. It follows It is easily seen that from (5 .7. 1 9) that I is I == exp absolutely integrable over ( - oo , oo ) and we then obtain from theorem 3 .2.2 the following result :
f(t)
[- c l t l cx] .
f(t)
f(t)
Theorem 5 .8. 1 . All stable distributions are absolutely continuous.
In this section we study the analytical properties of the frequency functions of stable distributions and shall refer to these as stable frequency functions or stable densities. We assume first that oc # 1 ( oc is the exponent of the stable distribution) and defer the investigation of the case oc = 1 . We denote the frequency function of the stable distribution with parameters oc, y, A by Pa (x ; oc, y, A) and write p(x ; oc, y, A) for p 0 (x ; oc, y, A). These functions can be determined by means of the inversion formula (theorem 3 .2.2), and we obtain from (5 .7.2 1 )
a,
(5 . 8 . 1 a)
Pa (x : oc, y, A )
=
�2 J � exp [- itx + ita - At('J. e- irryf2] dt 00 + _!_ J exp [itx - ita - At('J. einy12] dt 2n o
or (5 . 8. 1 b)
Pa ( x ; oc, y, A)
=
! Re J oo exp [ - itx + ita - At
'JT,
0
(oc
ll.
The following relations follow immediately from (5 . 8 . 1 a) : (5 . 8 .2a) Pa (x ; oc, y , A ) = p(x - oc, y, A ) (5 .8.2b) p (x ; rx , y, A) = A- t!cxp(A- 1/a x ; rx , y, 1 ) (5 . 8.2c) p (x ; oc, y, A) = p( - x ; oc , - y, A)
a;
e- iny 2] dt. f
# 1)
1 39
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
Equations (5 .8 .2a) and (5 .8.2b) indicate that it is sufficient to study the = 1 of the parameters. frequency function only for the values a = For the sake of brevity we shall write for (X, y, 1 ). We say that is the standardized density and refer to as its second parameter. Explicit expressions for stable frequency functions in terms of element ary functions are known only in a few isolated cases. We obtain from 7.21 ) for (X = == the characteristic function of the normal distribution, while 5 . 7 . 1 9) yields for (X == 1 , fJ = the characteristic function of the Cauchy distribution. In addition to these distributions, only the stable frequency corresponding to (X = �, = � is known to admit representation by a simple formula involving elementary functions (see p. 1 43). In view of this situation it is of interest to obtain series expansions for stable densities. We first consider the case where < (X < 1 and assume also that > (in view of 5 . 8 .2c) the condition > is not a serious restriction) . We see from (5 . 8 . 1 b) that
0, A Pay(x) p(x; y
Pay (x)
(
2, y 0
0
y 0
x 0
x 0
(
(5.
(5 . 8.3) Let (5 .8.4) where
g(z) = exp [ - ixz -za. exp (- iny; 2)],
z is a complex variable. Denote the arc of the circle with centre at
z 0 and radius p which is located in the fourth quadrant by {pe icf> . 2 o} c and consider a closed contour r consisting of the segment [ - ir, -iR] of the imaginary axis ( r R), the arc C the segment [R, r] of the real axis, and the arc C . According to Cauchy's theorem we have J rg(z) dz 0. ( 5 .8.5a) We next consider the integral along the arc C , I(C?') f g(z)dz = ir f o exp [ - ixr eicfo _ ra. eicPa. e-in1'12 + i�] d�. =
=
p
r
•
<
-�
"' � ....::..-: .....-:::. � �
R'
=
r
Or
==
Then
- n/2
I I( C,) I :::; r J :
12
exp
It is then easily seen that = lim (5 . 8.5b) r--+0
l(Cr) 0.
We next show that also
(.
5 H. 5 c )
1 i tn I C1 u)
.U
·>- ex>
(
=
0.
[-xr sin � -r« cos (foc + n;)] wp.
140
CHARACTERISTI C FUNCTIONS
IyI �
Since that
ex
1 it is always possible to find an 0 and a cp 0 such ny ny > cfo o rx + z > cfo rx + z
<
e >
n
holds for 0
2
cp �
�
( I
e.
We have
f : exp [- xR sin cp - Ra cos (foc + n;)J df 2 n 1 + R [ exp [ - xR sin f - Ra cos (f oc + ;) J df,
II C ) � R R
and it is easily seen that each term in this inequality tends to zero as R goes to infinity, so that .8. c holds. We see therefore from (5 .8.5a), (5 .8.5b) and (5 .8.5c) that
(5 5 ) f � exp [- ixt-ta. e-inY/2] dt = - i f� exp { - x - a exp [ - i;(y +oc)] } ay. y
y
It follows from (5 .8.3) that
i a [ x exp exp y { ! i J: { y ;(y +oc)] }ay} a. 1 { t . t f = Re - o e - exp [ - a e - •n!r + a ) /2J dt} . x nx We expand exp[ - ta. x-oc e - in(y + a.) / 2] into a series and note that it is pos sible(*> to exchange the integration and the summation and get c -1 ' k a. ) 1 (x ) ( P ar (x) = !k r(ock + 1 ) sin [kn(y + oc) /2] , nx k'£.1 provided that x > 0 and 0 rx 1. Using formula (5 .8.2c) we obtain an expansion for x 0, and it is then possible to obtain a formula which is valjd for x > 0 and x 0, namely (5 .8.6) k 1 1 k n ) (oc oc + ) 2 k2 -�� __!__ [ sin rx arg x) J ( I x 1 - a.) k . = y ) � (x Par ( + nx k=I n Here arg x = n for x 0 and arg x = 0 for x > 0. We consider next the case where 1 rx 2 and assume again that x > 0 . We choose the following contour for integrating the function g(z) defined by equation (5 . 8 .4). In the case when y 0 the contour consists of i : ) n 1 [r e t ( xp - J , R exp ( - inzl: I )J , the cir the straight-line segmen P ar (x) =
Re
z
oo
00
0
-1
<
<
<
<
(
•
<
<
<
<
( tlfl ) See
E. W.
Hobson (1 927)
vol . 2 , p . 306.
141
INF INI'I'ELY D IVISIBLE CHARACTERISTIC FUNCTIONS
Reitfo with _ n�: I � 4> � 0, the segment [R, r] of the real axis, and the circular arc reitfo with 0 � cp � - n�: 1 . If y > 0 we use the contour which consists of the line segment [r, R] of the real axis, the circular arc Rei4> with 0 � 4> � ;:. the line segment [R exp (i;:). r exp (i;:)J . and the circular arc rei4> with ;: 4> 0. It is easily seen that in both cases the integrals taken over the circular arcs tend to zero as r 0 , or as R � oo. It follows from Cauchy's theorem that cular arc z
=
z
z
=
=
z
;;;.
=
;;;.
�
(5 . 8 .7)
] J exp [ - ixt -ta. e 2 dt e 2a. J exp [ -ixu - ua.J du or r 00 i 1 ] L exp [ -ixt - ta. e 2 dt rx. - e2a. J o exp [ -ixi·e2a.] e-•i· my
oo
0
ny
i
=
iny
e 2a
0
iny
=
inv
00
00
1
ny
1-1
ds
(the last expression is obtained from (5 . 8 .7) by introducing a new variable iny
s ua. in the integral on the right-hand side). We expand exp [ - ixsa. e2a.] 1
=
into a series and see, as before, that the order of integration and sum mation may be exchanged. In this way we obtain
r -+ 1 . oo z nz + rx)k] ( rx y ( ) k 2 a. z [ ' dt e exp t x) ixt [ exp . ] 2: fo - < k X k= 1 rx We see then from (5 . 8.3) that for x > 0 r (k + t ) n(y + rx Pa.y (x) - n2_x k=l:i rx.k. sin [k 2rx )J ( - x)k. Using relation (5 . 8.2c) one obtains a similar formula for x 0. We summarize these results in the following statement : rrheorem 5 . 8 .2. The stable frequencies admit the following representation by tonrz;ergent series. "n
oo
_ .!.Y
=
/�
•
=
-
•
1
<
1 42
CHARACTERISTIC FUNCTIONS
1, lf O (5 . 8 . 8 a ) 1 ) k - (ock + 1 ) ( 2 oc rxP r (x) _!_nx ki;=l ��. sin [kn (y + oc - arg x) J (I x 1 -o:) k , 2 n while for 1 < oc � 2, (5 . 8. 8b ) k ( + 1) r l k Po:, (x) = nx1 koo=l ( - 1 ) k .' oc s1n. [k-2noc(y + oc - -2ocn arg x)] l x l k holds. < oc <
=
-
L:
-
The expansions of stable frequency functions into convergent series were obtained independently by H. Bergstrom ( 1 952) and W. Feller ( 1 952) . Several interesting properties of stable frequency functions follow from theorem 5 .8.2. We assume that # 1 and select I a. in the representation 5 .7. 1 ) 1 in formula (5 .7.20)] . It follows [this corresponds to the choice of ,8 1 from (5 . 8 . 8a) that 0 < < 1 0 if > 0, and also 0 if < 0, 0 < < 1. To formulate this result we introduce the following terminology which will also be useful later. We say that a distribution function F ) is bounded to the left and that is its left extremity ; in symbols, lext [FJ , if for any s > 0 we have F - s ) 0 while > 0 . Similarly vve say that is bounded to the right, and that is its right extremity ; in symbols, rext [ F] , if F (b - s) < 1 for any positive s while 1. Distributions which are bounded either to the right or to the left are called one-sided distributions, distributions which are bounded both to the right and to the left are called finite distributions. Our preceding result can now be formulated in the following manner.
oc
Po:, (x) == Po:, (x) ==
F(x) b ==
I== = y I x y = -oc, oc x y = oc, oc
a (a ==
F(a + s) b
( 2
(x
a=
F(b) =
Theorem 5 . 8.3 . The stable distribution functions with exponent 0 oc 1 and parameter I y I = oc are one-sided distributions. They are bounded to the right (with rext [F] = 0) if y == - oc and bounded to the left (with lext [F] = 0) £f y == + oc. Remark. It is not possible to apply a similar reasoning to formula (5 .8.8b) since we have always I y I � 2 - oc oc in the case when 1 < a. � 2. V. M. Zolotarev ( 1 954) as well as P. Medgyessy (1 95 6) obtained dif <
<
<
ferential equations for stable frequency functions with rational exponentB. V. M. Zolotarcv ( 1 956) also derived a number of relations between stable
143
INFINI TELY D IVIS IBLE CHARACTERISTIC FUNCTIONS
distribution functions (density functions). A simple relation of this type is equation 8 .2c). Theorem .8.2 can also be used to express a stable density with exponent greater than in terms of a density with exponent Let be the exponent of a standardized stable density with second parameter and suppose that 2 � > Using formulae (5 .8.8a) and .8.8b ), we derive easily the following result :
rx
rx
(5. 5
y
1
1/rx.
rx 1. (5 1 yTheorem 5.8. 4 . Let rx* 1ja. and y* rx + 1 ; then Pa* y * (x) x - (a*+ 1 ' pay {x -ex* ) for x 0 and 1 < rx � 2 . It is easily seen that I y* I � rx* so that Pa*y* (x) is indeed a stable fre quency function. Theorem 5.8. 4 is due to V. M. Zolotarev (1954) who gave a different proof which did not use the series expansions of theorem 5 .8.2. He also obtained a similar relation for stable distribution functions [V. M. Zolo tarev (1956)]. A particular case is of some interest. Let rx 2, y 0 then rx * = y* � and the corresponding density is, according to theorem 5.8.3 , bounded to '14 we obtain from theorem 5.8.4 the e the left. Since p20 (x) � "' 2 n stable density with parameters rx � ' y �' namely : if x < O 0 1 - x- 3/2 e - 1/(4ro> if x > 0 . ( 5 .8. 9 ) P l. (x) Z vn The frequency function ( 5 .8. 9 ) can also be obtained directly from the series expansion ( 5 .8.8a) it was derived by P. Levy (1939) by a different ==
=
=
>
==
==
;
==
=
==
==
l
==
;
rnethod.(t) Apart from the normal distribution, the Cauchy distribution and the distribution given by ( .8. ), no stable distributions are known whose frequency functions are elementary functions. However, V. M. Zolotarev ( 1 054) expressed the standardized(§) frequency function of stable laws fo r certain combinations of the parameters and fJ in terms of higher t ranscendental functions. These combinations of the parameters are ex == i-, f3 == 1 ), == f , fJ == 0) , � fJ == �' fJ == 1 ), ' �' f3 arbitrary) .
5 9
( (rx
rx
{rx
{rx
(a. ==
=
1),
==--=
("!") B. V.
Gn edenko-A. N. l{olmogorov (1 954) ttlso found by N. V. Smirnov.
(§)
;w us
i . e . those obtained by putti ng
a =
0,
c =
mention that this
1 i n ( 5 . 7. 1 4)
.
frequen cy functi on
144
CHARACTERI STIC FUNCTIONS
We study next the analytical properties of stable densities and see from that they have the form and
(5.8.8b)
(5.8.8a)
1 (x -a.) nx Pa. (x) 1 -CI>2 ( I X , -a.) ,
(5 .8. 1 0)
=
x 0 for x <
- I
for
(0
0
nx
and
>
1 nx
< ex <
1)
'Y1 (x) for x > 0 (5.8.11) Pa., (x) = 1 2) (1 - 'Y2 (I x l ) for x 0, b(f zk , (j = 1 , 2) with where
:nx
=
�
<
00
k=l
=
00
�
k=l
=
=
•
=
=
=
1
�
=
oo
z
=
00
r
hm
and
(5 .8. 1 2b)
z
=
1: =
1
..!__ lim sup k I ck lp/k
ep
lc� oo
k�oo
/
=
1 45
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
ck
respectively. We substitute in these formulae for the the expressions for the a�> and see after a simple computation (again involving Stirling ' s for mula) that
<1>2 (z)
'Y(z)
<1>; (z)
'Y(z)
p(x;
'F(z)
( t)
(-c t
p(x; 1 , 0, c) = (x 2c+ c 2) . n
x
ic
This is a rational function with poles at the points = + and is therefore regular for all real The radius of convergence of the Taylor series of 1 , 0, around the point = 0 is equal to We study next the case fJ # 0 in view of the fact that a relation similar to (5 .8.2c) is also valid for oc == 1 , it is no restriction to assume that fJ > 0 . Using the reasoning which yielded the expression (5 .8. 1 b), we see that
p(x;
x.
c)
(5 .8. 1 3 ) We write
z
x;
c.
p(x; 1 , {J, c) = ! Re J : exp { - itx - c{1 + � i log t] } t . g(z) == - ixz - cz - 2(J ciz log z, a
1t
where is a complex variable, and consider again the closed contour r used in deriving (5 .8.8a) . As in the earlier discussion we show that lim
(5 .8. 1 4a)
T---+0
f
Or
exp
[g(z)] dz = 0.
(•> The use of the notation p(x ; 1 , 0, c) cannot create any confusion since the symbol f'(x ; oc , y, ;'\), i n troduced on page 1 38 and based on the representation (5.7. 2b ) , i s not dt�fi ned for
« =
1.
146
CHARACTERISTIC FUNCTIONS
� lim I exp [g(z)] dz = 0 .
Subdividing the range 0 � cp n of integration along small cp 0 , one can also show that (5 .8. 1 4b)
R-+ ro
C
R
at a sufficiently
On
The assumption that fJ > 0 is needed in deriving (5 .8. 1 4b ). One con cludes finally from Cauchy ' s theorem, (5 . 8 . 1 4a) , (5 . 8 . 1 4b) and (5 .8. 1 3 ) that (5 .8. 1 5 )
p(x; 1 , {3, c) = ! I: [si
n (1
+ [J)ct] exp
p(x;
{ - xt - � ct log t} dt.
We wish to study the analytic character of 1 , {J, c) in the case where fJ # 0 . Without loss of generality we can put c = 1 ; for the sake of brevity we write instead of 1 , {J, 1 ) . We expand e - xt in (5 . 8 . 15) and ex change the order of summation and integration. In this way we obtain {1 t log t t 1 a:J < 1 ) k 2 a:J f' [ sin ( 1 ) t p :x!' P ex = - "\:'
P,a (x)
or
pp(x)
n6
p(x; I
_
k!
+ ]
o
(
d )
n
(5 . 8. 1 6 ) where (5 .8. 1 6a) Let n1 = (n/2f3)rJ, where 'YJ > 1 may be chosen arbitrarily large, and put t1 = exp (rJ1). We write the integral in (5 .8. 1 6a) as the sum of three inte grals ]1, J 2 and ] 3, taken over the intervals (0, 1 ), (1 , t 1) and ( t1 , oo ) res pectively, and estimate ] 1 , ]2 and ] 3 • Since max [ - t log t = e - 1 \Ve see that
]
(5 .8. 1 7a) and (5 .8. 1 7b )
11 2 1
tk + 1
� (k � 1 )
(the estim ate for J 2 follows from the fact that t log t We have
so that I Ja l
>
� I� t e ( - ?� t log t) dt. ''
x
p
0 for t
>
1 ).
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
t1 , we get ro ro k 1 1 3 1 � f t e YJt dt � f tk e -tJt dt; t l therefore (5 .8. 1 7c) I f 3 1 � 'YJ - k - l k ! It follows from (4. 8 . 1 7a), (5 . 8. 1 7b ) , (5 .8. 1 7c) and (5. 8. 1 6a) that k 1 [ k k +1 'I'J 'I'J C t 1 k l ak l ::::; TJ - - (k + l ) ! + (� + l ) ! + l J
1 47
In view of our choice of
0
+
or (5 .8. 1 8) We see therefore that
ak l 117c � '1'}- 1 [1 + o( l)] . Since 'YJ can be arbitrarily large, we conclude that lim sup I ak 1 1 /lc = 0 I
so that pp ( x) is an entire function. We rewrite (5 .8. 1 8 ) in the form 1 (5 .8. 1 9) I I = Ok 'YJ -Tc- [1 where Ole is a real number such that 0 � O � 1 . Since PtJ (x) cannot be a polynomial, there exists necessarily a subsequence okj of the o k such that O�c > 0 . In order to simplify the notation we write in the following 0 1 1 instead of 01ci · Using (5 .8. 1 9), we see that j log j j log j = O(logJ). log I (j + 1 ) log '1'} - log hence log hm sup og - 1 = oo. k-+ oo 'fherefore pfJ (x) is [see (5 . 8 . 1 2a)] an entire function of infinite order. We summarize these results in the following statements.
ak
+ o(1 )]
a1 1- 1
k
O; + o( l )
-
.
k k I I ak I
frequencyfunction of a stable distribution with character eorem 5 . 8 .5 . The1 has the form istic exponent 1 <1> 1 (x -ct) for x 0 nx = A) 1 p( x ; ( I x l-ex ) for x < 0,
rx <
>
rx, y,
�-
148 where <1>1 ( ) and/(1 <1>) 2 (z) are entire functions of order (1 -ex) - 1 and type 1: = AP ( 1 -ex )r1. -r1. . The frequency function of a stable-distribution with exponent 1 is an entire function of order ex(ex- 1) 1 and type 1: = A-p/\1. (ex- 1 ) �-\1./(cx - 1) . Theorem 5 .8.6. Stable densities with exponent ex 1 are entire functions of infinite order 'if {3 0 but are rational functions if {3 = 0. In this case they have poles at the points ic and - ic. CHARACTERISTIC FUNCTIONS
z
p =
oc
p ==
>
==
#
5. 9
Asymptotic expansions and integral representations of stable densities It is sometimes convenient to have asymptotic expansions of stable density functions. In Section we will also use a representation of the derivative of a stable density by an integral. In the present section we derive some of these formulae. As a first example we derive an asymptotic formula for stable densities with exponent < < which is valid for large positive values of and We see from that
5.10
1 ex 2, Pcxx. y (x), (5.8.1b) (5.8.7) Par (x) ! Re {exp (i;;) J � exp [ - ixu exp (i;;) - ua] a } We introduce a new variable by putting u tx-1 e-in/<2cx) and get (5. 9 .1) Pcxy (x) = 1 1) oc in 2 "' / e �; dt ( ( p J p t t ex p � ex ) ex Re { [ i [i )] n n : (� :x J } u
=
=
x - "'
According to Taylor's formula we have
t n + cx n + \1. < ( n 1 x cx k � - (- 1 yc x - e - �.nk/ 2 t(J.k + () exp - tC( x -rx. e - �. /2 [ (n + 1 ) ! J k=o k! 1. For the sake of brevity we write 4> o ;oc (oc + y - 1) and where I () I Ik = f � t"'k exp ( - t eicl>o) dt. We then obtain from (5. 9 .1) the expression n . 1 1 ) in(y { ] mk Tc . C1. k /2 Jk = x (x exp e (1) (5.9 . 2 ) Pcxy ) -nx Re [ 2ex � k! n
1)
=
�
=
1
k=o
1)
'
149
INFINI TELY DIVISIBLE CHARACTERI STI C FUNCTIONS
In order to determine the integral Ik we change the path of integration from the positive real axis to the line == u e-icf>o , where 0 � u < oo . To show that this is permissible we consider the function g(z) == zak exp z eicf>o and the circular arc r lim f'-'}- 00
{z : z ==
r
t [- ] eicf> } , - cp0 � cp � 0, and conclude that
f g(z) dz = 0 and also lim J g(z) dz = 0 . In this way we see that r
=
r-�
l1c = exp
r
[-icp0rxk-icp0] r(rxk+ 1 ).
We substitute this into (5 .9.2) and obtain the asymptotic formula (5 .9.3) 1) 1 n (-1 r( ( sin ) = x -ak + O ( - a (n + ) ) 2: a, 2
l k [ ) k rxk + n l ) (rx x x +y P J k! JlX k= O as x and 1 < rx 2. vVe compare formula (5 .9.3) 'vith (5 .8.6) and see that the series in (5 .8.6 ) is convergent for 0 rx < 1 but is still useful as an asymptotic series if 1 < rx 2. It is sometimes of interest to have asymptotic expansions as x tends to zero. We treat as an example the case where 0 < rx < 1 while x 0. In -
<
-+ oo
<
<
>
Section 5 . 8 we had
(5 . 8 . 1 b) We again use Taylor's formula and write
( 5 . 9 .4)
+l +l 7c n n ix) t x k t e-it:£ = � + (I O I ' k . n ) ( 1 + k=o ] IlO tk exp ( - ta. e-inyf2) dt n
(
()
r
•
We write
� 1 ).
k =
and obtain from (5 .9.4) and (5 .8. 1 b) the equation 1 J a.y ( ) = - Re � ( l ) I n +l
k +l n n { ( ix) x } () + P x n k=o k l ]k n + . •
·
We compute J1c by changing the path of integration and justify this change by applying Cauchy's theorem. We choose the line as
the
new
z=
u
exp (
inyj2rx)
path and see easily that
.Tic = oc- l
,
0 � u <
oo,
r('� ! 1 ) exp [iny(k + 1 ) /(2oc)J,
150
CHARACTERI STI C FUNCTI ONS
so that (5.9.5) r
(n +rx 2)
n+ 1
x
•
+ 0 (n + 1 ) ! This is an asymptotic formula (for small x) if 0 < rx < 1 , and it can be shown that the series (5 .9.5) is convergent if 1 < rx < 2. Formula (5 .9 .5) is due to H. Bergstrom ( 1 952). The asymptotic behaviour of stable density functions was also studied by Yu. V. Linnik ( 1 954) and by A. V. Skorohod ( 1 954). A. V. Skorohod ( 1 954) and I. A. Ibragimov-Yu. V. Linnik ( 1965) also gave comprehensive surveys of these formulae. In the same way one can derive formulae for the derivatives of stable frequencies. As an example<*> we mention k+2 ( 1 )k + 1 r , 1 rx (x) xk cos (k + 1 ) - + 1 + = (5 .9.6) 2: P rxy rx k f 2 rx 2rx n k=o n+3 r (:/.., xn + 1 +0 (n + 1 ) ! We note that (5 .9.6) can be obtained from (5 .9.5) by formal differentiation. In Section 5 . 1 0 we shall need also the representation of the derivative P �a. (x) of a stable density P rxa. (x) by an integral taken over a finite interval, and we now derive the following result.
( )
n
( )
[n
·
(y ) ny]
·
Theorem 5 .9. 1 . Let 0 < rx < 1 ; then for x > 0,
� ,x2/(a - Il [ b(cf) exp [ - xa./(a. - u a(c/>)] dcfo sin rxcp ) 1 /(l -a. ) sin ( 1 - rx )� _ ( where a(cp) - Sln cp .Sln rxcp and '2/ ( 1 - rx> 2rx cos cp sin (1 - rx) � ) sin rx cf> ( ( ) 1 = b (cp) (1 ) sin c/J sin cp while P�a. (x) 0 for x < 0 . The last statement follows from theorem 5 .8.3 , so that we have only to
(5 . 9 . 7)
P�a (x) = •
_
- IX
IX
=
prove (5 .9.7).
(life) We write here and
to the variable
x.
i n the
followin g Prxy (x) for the derivative of
Pa.y
(x) w i th respect
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTI ONS
151
We differentiate (5 .8. 1 a) to get an expression for p�, (x) which is similar to (5 .8. 1 b) and see that P�r (x) =
(5 .9. 8)
oo ( - it) exp [ - itx - ta. e- inyf2] dt,
�n Re Jf o
provided that rx # 1 . We introduce the new variable t = vx1/
! x21
n
f "" ( - iv) exp { - xa./
Jo
or P�r (x) =
(5 .9.8b)
! x21<"'- 1 > Re
f "" (iv) exp {x"'l [iv - va. einyf 2] } dv .
Jo According to the assumptions of theorem 5 .9 . 1 we have 0 < rx < 1 ; in this case I y � rx. We substitute y = rx in (5 .9 .8b) and obtain
I
p:m_ (x) =
I�et and put
n
! x2/ Re n
Jo
g(z) = iz - za. eimx/2 (z complex) h ( z) =
so
f "" (iv ) exp {x"'/
! x2/
n
that p:m_ (x) = Re
J : h(z) dz
where the integral is to be taken along the positive real axis. Our next aim is the computation of the expression Re
J: h(z) dz. This will be greatly
facilitated by showing that the path of integration can be replaced by a curve along which the function g(z) is real. It is easy to determine such a c u rvc . I.�et z = p ei c/J ; then
( �) - poe sin oc(cf> + �).
lm g(z ) = p sin cf> +
Clearly Im g(z) = 0 if z = p ei4> , where n 1/(1 - cx> sin rx cp + z ( 5 . 9. <)) p == p ( 4>) = sin cf> + ' Ji
( ) � ( )
152
CHARACTERISTIC FUNCTIONS
( nz)
while lim p( cp) = cx11 < 1-ct> and denote the cfo� - n/2 path z = p(cp) eic/J, - n/2 � cp � n/2 , by r. The curve r has the point z = - icx11 < 1 -ct> of the imaginary axis as its initial point and intersects the 1 real axis in the point z0 = [sin cxn/2] 1 1 <1- ct> � 1 . Let Zn be the point of intersection of r with the circle of radius n and centre at the origin. We denote the arc of the circle z = n ei4> located in the first quadrant and having the points Z = n and Zn as endpoints by Qn, and WC write r for the part of r located between the points zl and Zn Let
We note that p +
= oo
n
•
CT
{z : z
=
=
r eicfo, 0 � cp � - n/2 }
be the arc of the circle with centre at z = 0 and radius r which is located in the fourth quadrant. We consider the contour which consists of the arc cr ' the segment L\r = [ - ir ' - ioc1/(1 - ct) ] of the imaginary axis, the arcs r and Qn and the segment [n, r] of the real axis. It follows from Cauchy' s theorem that
K
n
r h (z) dz
J
so that
r h(z) dz +
J
(5 .9. 1 0)
Or
It is easily seen that (5 .9. 1 1 a)
J
0.
lim r h (z) dz J Qn
=
0.
r-+0
Or
r
h (z) dz + r h(z) dz J rn J Qn
=
r n h (z) dz . Jr
00
\J I
we see that
h(z) dz +
=
'n-4
Since
J tlr
0.
J(
h (z) dz
lim
We show next that (5 .9. l l b)
r
=
Q
,.
h (z) dz � n
J
n/ 2 0
h (n ei
L h(z) dz \ � ! ,x2/
We select a cp0 such that
(
. n n( l - ex) 0 < 1> o < min 2 ' 2cx
)
153
INFINITELY DIVISIBLE CHARACTERISTI C FUNCTIONS
and conclude that
- nxoc/ (rx- l> sin cp
1 2/ (oc - l> n 2 n / 2 x exp
J
+ n-
This means that
cb o
J
Qn
h (z) dz =
o( l )
dcp . as n
--+ oo ,
so that (5 .9. 1 1 b) is proved. We finally note that therefore (5 .9. 1 1 c)
Re
J
�r
g( - iy) is real for real
y;
h (z) dz = 0.
It follows from (5 .9. 10), (5 .9. 1 1 a), (5 .9. 1 1 b) and (5 .9 . 1 1 c) that 00 h(z) dz = Re h(z) dz. P � oc (x) = Re ( 5 .9. 1 2)
J
f
0
rn
In view of the definition of the contour r we know that ei� cp)] = Re ei� cp)], so that
g[ p(
g[ p(
(5 .9. 1 3 ) We substitute into (5 .9. 1 3) for p(cp) the expression given in (5 .9.9) and see, after an elementary computation, that ( 5 . 9 . 1 4)
g[e��. p( 4>)] = =
a(cp)
1 1 a ( 1 ) sin sin IX (cf + �) sin
(cfo+ ;)
- a (cf + ;)
[(1 - IX)(cp + �)J sin IX ( cfo+ ;)
is defined in the statement of theorem 5 .9. 1 . Since where the function z == cp) eicf> on the contour r we see easily that cos 2cfo] drp sin 2cp Re (iz dz) = and obtain from (5 .9 .9) the expression
p(
where
-[pp' + p 2 Re (iz dz) = [p(cf ) PB (cf + ;)acp ,
OS_ll(�_ sin cp -_2 cos cp sin rup ( ��� cp) = cos cp cos zcp. B (l - ex) stn ocrp
+
1 54
CHARACTERISTIC FUNCTIONS
It follows from (5 .9 . 1 2) and (5 .9. 1 4) that (5 .9. 15) P�� (x) =
! x2/(a- 1) J : [p (� - ;)J 2 B(�) exp { - x�/(o:- l> a(cp) } dcp .
A simple computation yields the expression 2oc s � i� ( 1 oc)� B(�) = (5 .9 . 1 6) - 1. s1n We put (5 .9 . 17) si� n oc cos � si� ( 1 2 > _ -cx ;n 2 B(� ) = = ( 1 - oc) s1n s1n 2 and obtain the statement of theorem 5.9. 1 . The following alternative expression for B( ) is easily obtained from (5 .9 . 1 6) : 1 si� (2 = B(� ) ( 5 .9 . 1 6a) -1 1 - rx s1n and this will also be used.
�� ; f - rx rx
[ rxcpcfo]
2 [ ) b(cp) p(c? J cp
{rx
rxcfo
{
rxcp
rx)cp - t}
oc)cp }
Corollary 1 to theorem 5 .9 . 1 . The function a(cp ), defined in theorem 5 .9 . 1 , is strictly increasing in the interval [0, n] . Let, for cp fixed, VJ (oc) rx cot rxcp - cot �- Clearly '!fJ(1 ) 0 while �: 0 , =
=
so that
rx cot rxcp
cp
cot for 0 < < 1 . Moreover, it is easily seen that 1 cot cot + (1 cot (1 log a(� ) = d� 1_ > (1 cot ( 1 - cot > 0, which proves the corollary.
rx d
>
�
2 2 cp rx) {rx rxcprx rx)cp cp rx)
rx)cp }
Corollary 2 to theorem 5 .9 . 1 . The function b(cp), in the statement of theorem 5 . 9 . 1 , has exactly one change of sign in the interval [0, n] . In view of (5 .9 . 1 7 ) and (5 .9. 1 6a) it is sufficient to show that u(�) oc si�s1n(2rxcp- rx)cfo _ 1 =
has exactly one change of sign in [0, n] . We note that u(O) = 1 - fX while u(n) == - ( 1 + oc)/(1 - ex) < 0, so that at least one change of sign occurs in
155
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
the interval. An elementary computation shows that
u ' (c/> ) where v(cp) so that
v '(cp)
==
=
=
v
(cf> ) rxcf> 2 sin (:/..,
(1 - rx) sin 2cp - sin 2(1 - rx)cp
-
2( 1 - (:/..,) [cos 24> cos 2 ( 1 - (:/..,)cpJ.
It is then easily seen that there exists a unique value cp0 such that
n,
0 < cfoo < while v' (cp 0) 0 , and we get cp 0 n /(2 - rx). It follows that v(cp) has exactly one minimum inside [0 , n] , so that v (cp) and therefore also u ( cfo has at most one change of sign in this interval. The statement of the corollary follows immediately from (5 .9. 17). It is also necessary to derive a result similar to theorem 5. 9 . 1 for the cas e where the exponent rx > 1 . ==
=
)
Theorern 5 .9 .2. Let 1 < a. 2 ; then for x 0, 1 (5 .9. 1 8) P�.ll.- 2 (x) n x2/(ll.- 1 ) J :n::n:/ll. b1 (0) exp {xa/ tll.- 1) a1 (0)} dO, while for x < 0, 1 (x) (5 .9. 1 8a) P�.ll._ 2 n-- l x \ 2/(ll.- 1) J b2 (0) exp {-lx jll./(a- 1) a2 (0)}d0, where [ [ sin () 1 / (ll. - 1 ) sin ( rx - 1 )0 - sin ()] 1 / (cx - 1 > sin ( rx - 1 ) fJ . , a 2 (fJ) a1 ( fJ ) stn rxO s1n rx()J s1n rx() s1n rxfJ and [ - sin ()] 2/ (ll. - 1) { 2rx cos fJ sin ( rx - 1 ) 0 1 b 1 (0) } (a. - 1 ) sin rxO sin rxO [ sin () 2 / (cx - 1 > { 2cx. cos () sin ( - 1 )0 } 1 b 2 (0) sin rxOJ ( rx - 1 ) sin O I n order to simplify the notation we write p'(x) instead of P�.cx - 2 (x) in the proof of theorem 5 .9.2. We consider first the case x 0 and substitute cx - 2 into (5 .9.8b) and see that oo p'(x) n� x2/ l<X- l) Re J (iz) exp {x"/l<X- l ) g(z)}dz <
==
>
-
=
o :n:jct.
=
==
•
•
.
.
_
=
oc
==
_
•
rx
>
?'
==
=
where
o
156
CHARACTERISTI C FUNCTIONS
We.,..determine first, as in the proof of theorem 5 .9 . 1 , a curve along which g(z) is real. It is easily seen that the curve r 1 , given by 1 /
(
)
( ) satisfies this requirement. Moreover, p (� ) = 0 while p (: - ;) = oo. Let
Zn = n eic/> n be the point of intersection of r 1 and the circle of radius n with centre at the origin and write Cn for the arc of this circle which is located in the first quadrant between the real axis and the point Zn It is not difficult to show that •
f
c,.
\ o(l)
(iz) exp {x"f
as n � oo, and we conclude from Cauchy's theorem that
J: (iz) exp {x"/<<X- l) g(z) } dz n/2 f (ipp' - p 2 ) e2ic/> exp [xcx/ (cx - 1 > g ( p eicl>)] d� = 0 . + nj n
cx - /2 We use the fact that g [p(� ) ei4>] is real and introduce the new variable
() = 4> +
� and
obtain after a somewhat tedious but quite elementary
computation formula (5 .9. 1 8). We consider next the case x < 0 and see from (5 .8.2c) that P : .y (x ) = - P � . - y x I ) (x = - I x I < 0). We put y = rx 2 and write again p ' (x) for P�,(f. - 2 (x) and see from (5 .9.8a ) that 1 (zz) exp { - 1 x l cx/ ((1. - t > g (z) } dz p'(x) = x 1 2 / (cx - l ) Re (5 .9 . 1 9)
(I
J oo
-I
o
n
where
•
g (z) = iz - zcx eincx/2 • Again it is easily seen that lm g(p eicf>) = 0 if z defined by p(cp )
=
sin (4> + �) sin � (4> �)
1/(CX - 1 )
+
=
(-2 � n
p ei4> is on the curve r 2
¢ �
( �) (:Y
so that g(z) is real along r2• We have p -
=
;<
.. -
n (:/..,
u,
)2
n -
p
(� - � )
=
oo,
157
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
r 2 goes through the point - irx- 1/(a.- 1) of the imaginary axis and approaches asymptotically the line z r exp [i(:- ;)J , (0 � r < . We also note that g( - iy ) y - ya. for real and positive y , so that the inte gral in (5 .9. 1 9) is purely imaginary along the negative imaginary axis. Let n eicf>n be the point of intersection of r and the circle of radius n with so that
oo
=
==
Zn
=
2
centre at the origin, and let Cn be the arc of this circle located in the first quadrant between the real axis and the point Zn . Then
f On (iz) exp {- I x la./(a.- 1> g(z)} dz o( 1 ) (n =
� oo
).
- ioc- 1/(a.- 1>]
We consider the contour which consists of the segment [0, of the imaginary axis, the arc of r 2 between the origin and Zn , the arc Cn and the segment [n, 0 of the real axis. We apply Cauchy ' s theorem and let tend to infinity and conclude that
n
]
Re
{ f (iz) r
,
exp [ -
I x 1 "'1("' - 11 g(z)] dz + J: (iz) exp [ - 1 x 1"'/(<X-ll g(z)] dz} =
It follows that
p ' (x)
=
! 1 x 1 2/!<X-ll
n
·
0.
J (iz) exp [ - 1 x la/(a.- 1>g(z)] dz. r.
Using the argument which we employed before, we obtain (5 .9. 1 8a).
Corollary 1 to theorem 5 .9.2. Let
X > 0.
1 < rx < 2 ;
b1
then P�.a.- 2 (x) < 0 for
To prove the lemma we need only show that (0) < 0 for n/rx < (} < Since sin rxO < 0 in this interval it is sufficient to show that (O) = (rx - 1 ) sin rx0 - 2rx cos 0 sin (rx - 1 )0 > 0 for nj rx < 0 < n . A simple computation shows that (O) = rx sin (2 - rx)O - sin rx0 0.
n.
y
y > 2 to theorem 5 .9.2. The function a 2 (0) which occurs in (5 .9. 1 8a) is Corollary strictly increasing in the interval [0, / ] Corollary 3 to theorem 5 .9.2. The function b 2 (0) which occurs in (5 .9. 1 8a) has exactly one change of sign in the interval [0, / ] n oc .
n rx .
'r'he proof of the last two corollaries is analogous to the proof of corol laries 1 and 2 to theorem 5 .9. 1 . 'fheorems 5 .9. 1 and 5 .9.2 expressed the derivatives of stable frequency functions in terms of certain integrals. V. M. Zolotarev ( 1 964) derived somewhat similar representations for stable distribution functions. In the
1 58
CHARACTERISTIC FUNCTIONS
next theorem we present his result ; we use here the notation of formula ( for stable characteristic functions. The characteristic function of a stable distribution with exponent r:t.. =1= 1 and parameters = A = 1 , y = K( r:t.. ) d is then given by . nK (r:t..) z log f(t ; r:t.. , d) = - I IC( exp •
5.7.23)
{ t
t
-
<5}
2
ftl
a 0,
F (x ; r:t.., d) for the corresponding distribution function. Theore1n 5.9 .3. If r:t.. 1 and x > 0 then
We write
#
F (x ; r:t.. , d) =
where
f
1 n/2 �(1 - d) + exp { - Vex (x, cp) } dcp, r5j2 n n 1 n/ 2 exp { - Vex (x , cp) } dcp, 1-1WK ) TC - (cx /2cx
V (x, cp) = xcx/ (ll. - l) C( If r:t.. =1= 1 but x =
f
ij r:t.. < 1 ij r:t.. > 1
1 / ! <X <X l [( - 1 )cf> + � <5K ( ) ( ) ) <5 � sin ( 1Xcf> + K J C
IX
OS
-
IX
IX
cos c/> cos cp one has r:t.. , d) = ![ 1 - dK (r:t..) /r:t..] . In the case where x < one obtains the corresponding representations from the above formulae and the relation 1 - F ( - x ; r:t.. , d) = F(x ; r:t.. , - d ). For the proof we refer the reader to Zolotarev ' s paper, quoted above. This paper also contains a similar formula for r:t.. = 1 .
0
•
F(O; 0
5.10 Unimodality of stable distributions In this section we prove the following theorem which is due to I. A. Ibragimov-K. E. Czernin.
Theorem 5 . 10. 1 . All stable distributions are unimodal. The proof is carried out in several steps. We first study symmetric stable distributions (i.e. y = 0) ; then asymmetric stable distributions with ex treme values of the parameter y [i.e., I y I K (r:t.. ) or equivalently I d I = 1 , =
respectively I fJ I = 1] ; and finally arbitrary stable distributions.
Lemma 5 . 10. 1 . All symmetric stable distributions are unimodal. Theorem 4.5. 3 states that the function 1 f(t) + I t ,.. (0 < � 2) =
1
IX
1 59
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
is the characteristic function of a symmetric unimodal distribution. According to theorem 4.5 .5 this is also true for the function 1
We conclude finally from theorem 4.5 .4 that = exp = lim n
f(t)
n� oo
(- I t let)
f (t)
is also the characteristic function of a symmetric unimodal distribution, so that the lemma is proved.
Lemma 5 . 10.2. Stable distributions with unimodal.
Iy I
=
K (rx)
and rx
=1= 1
are
b(cp
We consider first the case rx < 1 . The function ), which occurs in the statement of theorem 5 .9. 1 , has, according to corollary 2 to theorem 5 .9 . 1 , exactly one zero in the interval (0, n) . Let a be this zero and write formula (5 .9.7) in the form p:m (x)
= ! x21<"- 1 { J : b(4>) exp [ - xcx/(cx- l) a(cfo)] dcp + J: b(4>) exp [ - x"/
Let x0 be an arbitrary zero of the function P�o: (x) ; we differentiate P� a(x) with respect to x and see easily from corollary 1 to theorem 5 .9 . 1 that (5 . 10. 1 ) P� ( x o ) <
! IX: 1 x&1<"- 1 ) a(a) { J : b(4>) exp [ - �/(O<- l) a(4>)] d4>}
=
0.
We see from (5 . 10. 1 ) that there exists only one value x0 in the interval (0, oo ) at which P �a (x) becomes zero. The corresponding distribution is therefore unimodal. We have treated the case y = K (rx) = rx ; the validity of the lemma for y = - rx follows from the relation (5 .8.2c). In the case where 2 � rx > 1 we use theorem 5 .9 .2 and its corollaries instead of theorem 5 .9. 1 . Corollary 1 of theorem 5 .9.2 shows that (when K ( et.. ) = rx - 2), Pa.a- 2 (x) is decreasing and never vanishes for x > 0 . ?' = ' l 'he argument given for the case rx < 1 can again be applied if one replaces corollaries 1 and 2 to theorem 5 . 9.1 by corollaries 2 and 3 to theorem 5 .9 .2. If y = 2 - rx the result follows again from (5 .8.2c). l1' or the discussion of the case where y < K ( rx) we need two lemmas. ' 1 ,he first expresses a stable density with parameters (rx, y) in terms of densities with parameters (rx, 0) and (rx, oc) , while the second deals with a transforn1ation of x2 p�)' (x) .
-
I I
160
CHARACTERISTIC FUNCTIONS
Lemma 5 . 10.3 . Let rx < 1 and 0 < y < rx ; then 1 x -y) ( oo (Y) (x) Pay = a 2 b J Pao Paa b dy 1 n /cx . ny 1 /cx sin -(rx - y) sln 2 a= . n where and b = . nrx2 1
a
1
0
s1n 2 rx
sln 2
= I t I« exp [ - i � 7J we can easily verify that 1 oo x - y) ( (5 . 1 0 .2) (x) = Pay ab J _ 00 Pao a Pcxa (Y) dy. We note (see theorem 5 .9. 1 ) that Paa (u) 0 for u < 0 and differentiate (5 . 10.2) with respect to x and obtain the statement of the lemma. Lemma2rx 5 . 10.4. The function A('r, a) obtained by substituting x = e- -r:, . . . • zn • th e strz.p - oo < < oo, = n a znto x 2 p a' y (x) zs a h armonzc -hunctzon Since log fat, ( t)
-
b
=
y
J
-
nl((rx) I a I < 2rx We use formula (5 .9.8) and put
7:
v tx and obtain x 2 p� , (x) = ! Re J � (iv) exp [iv-va x- cx einYI 2] dv A( a) = ! Re J oo (iv) exp [iv-va e-ra eiaa] dv. •
so that
=
T,
(5 . 10.3)
n o An elementary computation shows that () 2 A () 2 A = 0 2 07: oa2
+
so that the lemma is proved. In our discussion we consider first the case 0 < rx < 1 and assume also (x) [lemma that 0 < y < rx. We conclude from the unimodality of 5 . 10. 1 ] and lemma 5 . 10.3 thatp� y {x) > O for x � O. We denote the smallest zero of (x) by x0 x0 (y). Clearly x0 (0) 0 while x0 (y) > 0. We consider the strip 0 � x < oo, 0 � y � rx and denote by � the set of all points (x, y) in this strip for which x > x0 (y) and p�y (x) > 0. In order to prove that Pay (x) is unimodal, we must show that the set � is emp ty. Let � be the closure of � . The set � is obviously bounded. The Zrx mapp1ng x y - a takes the str1p 0 � x < co , 0 � y � rx 1nto·the
p� Y
·
=
=
= e- \
·
=
n
P a .o
·
1 61
INFIN ITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
�,
strip - oo < -c < oo, 0 � a � and a set � 1 corresponds in this mapping to �- The function x 2 p:.Y (x) is transformed by this mapping into the a) . Suppose now that the set � is not empty. It harmonic function follows then from the definition of � that the function A(,;, a) vanishes on the boundary of �1 • Since 1:, a) is harmonic we have then necessarily A( T, a) = 0 for ( 1:, a) E � 1 • In view of the definition of � this is impossible, so that � is necessarily empty. This proves that stable distributions with 0 < rx < 1 and y � 0 are unimodal ; formula (5 .8.2c) shows that the state ment is also true for y < 0. We consider next the case 1 < rx � 2. We conclude from (5 .8.8b) that yp:.y (O) > 0 for y f:. 0 and use the mapping of lemma 5 . 10.4 in the same way as in the case where rx < 1 to show that the stable distributions corresponding to parameter values 1 < rx � 2, y =? 0, y # K(rx) are also unimodal. We still have to consider the case rx = 1 . We write f(t I rx, C1 , C2 ) for stable characteristic functions in the Levy canonical representation (see theorem 5 .7.2) and have d z tu ·t (5 . 10.4) log f(t I oc, cl, C2 ) = Cl oc + u 2 I u i o: + 1 d • t 1+ C2 rx 1 + 2 uoc+ 1 for 0 < rx < 2. We see from formula (5 . 10.4) that
A('r,
A(
I I
o
· J (e"'- 1 - 1 ) u ooJ o (e"' u ztu· ) u u - 00
-
(5 . 10.5)
(
lim t t 1 1 - ! , C1 , c2
n-+CX>
n
)
=
f(t 1 1 , c1 , C2 ) ·
Since we have already shown that stable distributions with exponent rx # 1 are unimodal, we conclude from (5 . 10.5) and from theorem 4.4.4 that stable distributions with exponent rx = 1 are also unimodal, so that theorem 5. 10. 1 is completely proved. 5. 1 1
Self-decomposable distributions
We defined stable distributions by means of the functional equation ( 5 . 7 .2). It is possible to introduce other classes of characteristic functions in a somewhat similar manner. As an example we mention the characteristic functions f(t) which obey the relation (5 . 1 1 . 1 ) f ( t) = f ( ct) fc ( t)
for every c (0 < c < 1 ), where fc (t) is some characteristic function. The functions (5 . 1 1 . 1 ) were introduced by P. Levy and A. Ya. Khinchine [see Levy (1 937a), p. 1 92, or second edition (1954), p . 1 95 ] , and one calls this family of characteristic functions the class of self-decomposable
1 62
CHARACTERISTIC FUNCTIONS
characteristic functions<*> [Loeve ( 1 955)] . In the present section we dis cuss some properties of this class.
Theorem 5 . 1 1 . 1 . All self-decomposable characteristic functions are infinitely divisible.
We first show that a function which satisfies (5. 1 1 . 1 ) never vanishes. We give an indirect proof and assume that f(t) has zeros. Then there exists a It follows from (5 . 1 1 . 1 ) such that f ( ) = O while f ( ) # O fo r l l < = 0 while fc # 0 for I I < that fc We see from theorem 4. 1 .2, putting = 1 and = 2, that
t0
(t0)n
t0
(t) t t0/
[
t
(�o) 2]
t t0 • t t0 •
l fc (t o) 1 2 1 . f( t o/2 ) . . . . . . t o b c / 1s contmuous m c, we ob tam a contrad1ct1on S mce J c (2) ' f( t o Z ) choosing c sufficiently close to 1 , so that the functions f(t) an d fc ( t) never 4 1 - fc
.f
� 1-
=
y
=
vanish. To prove the theorem we note that
and see that (5 . 1 1 .2)
t
n
(t). (t) J J k. n k= l IT
=
Since f ( ) is continuous and never vanishes, we conclude that lim fk.n
k
k n)
(t)
==
1
uniformly in ( 1 � � and in every finite t-interval. It then follows from the corollary to theorem 5 . 6. 1 that f ( t ) is infinitely divisible. n-+oo
Corollary to theorem 5 . 1 1 . 1 . Let f(t) be a self-decomposable characteristic function; then fc (t) is infinitely divisible. Let m < n; we re,vrite ( 5 . 1 1 .2) in the form k m k t f t f f( t ) . ) / ( IT ) ( ( k k ( k k IT 1 1 / ) ) n m k=m+ l n k= l m c Suppose that m increases as n increases in such a manner that n ·
=
->-
<*> Some authors [e.g. B. V. Gnedenko and A . N. l(olmogorov (19 54) an d others] refer to this family as the "L-class". We do not use this te rminology in order to avoid c9nfusion with the 2' -class introduced in Chapter 9. ·
163
INFINITELY DIVISIBLE CHARACTERISTIC FUNCTIONS
(ct)
as n -+ oo . The first factor then tends to f while the second factor tends to a characteristic function fc which by the argument used in the proof of the theorem is infinitely divisible. Our next aim is the determination of the canonical representation of self-decomposable characteristic functions f ( Since f is infinitely divisible, we can write it in the Levy canonical form (theorem and see that
(t),
(t)
t).
5.5 .2)
ita-a2t2/2+ I = : (eitu _ 1 - 1 �uu 2) dM(u) oo itu it u _ + I +o (e 1 - 1 + u 2) dN(u), where a2, M(u) and N(u) satisfy the conditions of theorem 5.5. 2 . Substituting tc for t in (5.11.3), we obtain after simple change of the variable of integration (5.11.4) log f(ct) ita1-a2c 2 t2/2+ I = : (eitu _ 1 - 1 �uu2) dM (:) + I +o (eitu _ 1 itu+u 2) dN (uc) where 0 < c 1o and oo (1 -c2\u3 (1 -c2)u3 a1 ca+c I - oo (1 + c2 u2)( 1 + u2) dM(u)+c J +o (1 + c2 u2)(1 + u2) dN(u). We see from (5.11.3) and (5. 1 1. 4) that (5 . 1 1.5) log ;g;) = ita2 -a2(1 -c2)t2j2 u _ u (e + I= : it 1 - 1 � u 2) d [M(u) - M (:)J + J :0 (eiru _ 1 - 1 �uu 2) a[N(u)-N (:)J where a 2 a-a1 • According to the corollary of theorem 5.11.1, (t) J(t)/f(ct) infinitely divisible ; therefore ( 5 .11.5) is its canonical representation and conclude from the uniqueness of this representation that M(u)-M( ujc) and N(u)-N(ujc) must be non-decreasing. Therefore (u1) -M (u1/c) M (u2) -M (u2/c) (5.11.6) {MN(v1)-N(v1/c) � N(v 2 )-N(v 2 jc) (5.11.3)
log _f (t)
==
a
==
00
<
==
1
==
is we
==
fc
�
wheneve r
(5. 1 1 . 7)
_
l
1 64
CHARACTERISTI C FUNCTIONS
(
c
c M(u)
Conversely , if the inequalities 5 . 1 1 .6) hold for every (0 < < 1 ) then is the characteristic function of an infinitely divisible distribu tion, so that is self-decomposable. Suppose now that and N satisfy (5 . 1 1 .6) for all for which (5 . 1 1 .7) holds. We then have (5 . 1 1 .8) Let < b and > 0 and choose and so that = ea - b . We put = ea+h , = ea so that = b . It then follows from (5 . 1 1 .8) that = eb +h , N(eb+h) - N(eb) N(ea+h) - N(ea) . We write then =
f(t) /f(ct)
f(t) b vb v (u) u u2 , 2 N(u2/c)-N(u1/c) � N (u2) -N (u1). v2 h / a b c a v1jc e v2 c v1 N (e11) A(v); � A(b+h)-A(b) � A(a+h)-A(a) a+h x (say) or if we put b A(x) � �[A(x+h)+A(x-h)]. The function A(x) is therefore concave and has everywhere finite left hand and right-hand derivatives. The right-hand derivative never exceeds the left-hand derivative, and both are non-increasing as x increases. Since A(v) N(ev) we have A '(v) ev N '(ev). Putting u ev, we see that uN '( u) is a non-increasing function. In exactly the same way one shows that uM' ( u) is non-increasing. Suppose converseiy that the functions M(u) and N(u) have the property that uM '(u) and uN '( u) are non-increasing and that 0 < c < 1 . Then : M' (:) � uM'(u) for u 0 : N ' (:) uN '(u) for u > 0. From these inequalities we obtain (5 . 1 1 .6 ) by integration, so that the infinitely divisib le distributions determined by the functions M(u) and N (u) are self-de composable. We have therefore obtained the following result : Theorem 5 . 1 1 .2. An infinitely divisible characteristic function is self decomposable if, and only if, the functions (u) and N (u) in its Levy canonical representation have left- and right-hand derivatives everywhere and if the function uM' ( u) is non-increasing for u < 0 while uN '( u) is non increasing for u > 0. Here M'(u) and N'(u) denote either the right or left derivatives, possibly different ones at different points. Corollary to theorem 5 . 1 1 .2. All stable characteristic functions are self decomposable. =
=
=
=
=
<
�
1Vl
The corollary follows immediately from theorems 5 . 1 1 .2 and 5 .7.2. For some time it was believed that all distribution functions of self-
1 65
INFINITELY DIVISI BLE CHARACTERISTIC FUNCTIONS
decomposable characteristic functions are unimodal. K. L. Chung showed in Appendix II of his translation of Gnedenko-Kolmogorov ( 1 954) that the proof given there for this statement is not valid. I. A. Ibragimov ( 1 957) gave an example intended to show that there exist self-decomposable distributions which are not unimodal. However, T. C. Sun ( 1 967) pointed out that Ibragimov' s construction contained an error, so that the question of the unimodality of this class is still open. The only known result at present is due to A. Wintner ( 1 956) who proved that all symmetric self decomposable distributions are unimodal. L. Kubik ( 1 961 /62, 1 962/63) studied certain analogies which exist between the family of infinitely divisible characteristic functions and the class of self-deco mposable characteristic functions. He characterized the latter class of functions in a manner which is similar to the way in which theorem 5 .4.2 characterizes infinitely divisible characteristic functions. We finally mention the semi-stable distributions introduced by P. Levy (1 93 7a). They are defined by means of the functional equation = (q # 0, q # 1 ) for the second characteristic. V. M. Zolotarev ( 1 963 ) investigated the smoothness properties (absolute continuity, differentiability, analyticity) of self-decomposable distribution functions. These properties depend on the functions and and on the presence or absence of a normal component.
cp(qt) �cp(t)
M
N
6 F A C T O R I Z A T I O N P R O B LE M S- G E N E R A L T HEORE M S F RO M THE A R I T H ME T I C O F D I S T R I B UT I O N F UN CT I O N S In the preceding chapter we discussed a number of examples which indi cated that the analogy between the factorization of integers and the de composition of characteristic functions is rather limited. While a great number of remarkable decompositions of characteristic functions is known , we have only few general results, and one has the impression that the arithmetic of distribution functions has not yet reached a final stage in its development. In this chapter we present the most important general theorems concerning the factorization of characteristic functions, and this treatment will be supplemented by Chapters 8 and 9. The separation is justified by the different tools used : in the present chapter we deal with problems which can be handled without using the theory of functions of a complex variable, while complex variable methods are essential in deriving the results discussed in Chapters 8 and 9 . 6. 1 Some notations and lemmas For the investigation of the general factorization theorems we need certain lemmas which we discuss in this section.
Lemma 6.1.1. Let f ( t) be the characteristic .function of a symmetric distribu tion, then 1 - f(2t) � 4 [ 1 - f(t)] for any real t. Since the characteristic function of a symmetric distribution is real (theorem 3.1. 2 ), the assertion of len1ma 6.1.1 follows immediately from theorem 4.1. 2 . Corollary to lemma 6.1.1. Let f(t) be a characteristic function and suppose that I f(t) I == 1 in some neighbourhood I t l � of the origin. Then f(t) is the characteristic function of a degenerate distribution. To prove the corollary we apply repeatedly the lemma to the function 1 in every finite interval. I f ( t) 1 2 and see that I f ( t) I We next introduce an operation which is applicable to any characteristic function . Let f(t) be an arbitrary characteristic function ; then there exists �
=
167
FACTORIZATION PROBLEMS-GENERAL THEOREMS
a such that / f( t ) I > 0 for 0 � t � For a fixed a satisfying this relation we define (6.1.1) Na [J(t)] Na (f) - J : log I f(t) I dt. a real number
a.
=
=
The following properties of this operator are easily established : (i) � 0 (ii) = 0 then (iii) If = /1 /2 + ( /2) == (iv) (/)
Na (eJit)m Naf(t) ( ) (t) (t) Na (f) Na (ft) Na Na ;:,: J : [ 1 - / f(t) I ] dt (v) Na (f) = 0 if, and only if, f(t) is the characteristic function of a degenerate distribution. Properties (i), (ii) and (iii) follow immediately from (6.1.1 ); ( iv) is a consequence of the inequality - log / f(t) J = - log [ 1 - ( 1 l f(t) I )J � 1 - / f(t) / while ( v) is easily obtained from (ii) and from (iv). The quantity Na (f) is a measure of the departure of the distribution belonging to f ( t) from a degenerate distribution. We will refer to Na (f) as the Na value of f( t). The main object of this section is the proof of the follo\ving lemma : Lemma 6.1.2 . Let {Fn (x) } he a sequence of distribution functions and denote byx {fn (t) } the corresponding sequence of characteristic functions. Suppose that == 0 is a median of F ( x) (n == 1, 2, . . . ) and that there exists a real a 0 such that (6. 1 .2) nlim (fn) = 0, Na -+oo then -
-
>
'll
Lim Fn (x) == s(x) . n� oo
m (m - )
We say that the point x = is a median of the distribution function Jt,(x) if the inequalities F s � �, F + s � � hold for any s > 0. 'fhe assumptions of the lemma imply that for n sufficiently large fr� # 0 for 0 � � Using ( iv) we see that
(t)
(m )
t a. J)l - I J.. (t) l 2] dt � z J : [l - J fn(t) j] dt 2Na (fn) · Moreover it follows from lemma 6.1.1 that J :a [1 - I j,, ( t) 12] dl = 2 J : [ 1 - I .fn (2t) I 2J dt � 8 J )1 - I fn ( t) / 2] dl. �
168 We combine the last two inequalities and conclude from assumption (6.1.2) of the lemma that a 2 r 2 J I lim / t) 1 dt 0. ( [ ] ,. n-+ oo J It is then easily seen that for sufficiently large fn ( t) 0 for 0 � t � 2a, so the argument which we used can be repeated. In this way we see that, for every T 0, (6.1.3) n-+limoo Jr T [ 1 - [fn (t) [ 2] dt 0. We denote by Pn(x) 1 -Fn( - x - 0) the conjugate distribution of Fn (x) and write (6.1.4) Fn(x) Pn(x) * Fn(x) for the symmetric distribution whose characteristic function is I fn ( t) [ 2 • We denote by 1 ) (x
=
0
#
n
>
=
0
=
=
=
the standardized normal distribution and consider the distribution defined by
(6.1.5) Gn (x) Fn (x) *
=
=
=
=
=
and see that
T 0 tx e - t'/2 [ I /. (t) 1 2 - 1] dt t
Since for any ! r T sin
n Jo
>
�
L:J r T [1 - l In (t) ! 2] dt, n Jo
·
169
FACTORIZATION PROBLEMS-GENERAL THEOREMS
we conclude from
(6.1.3) that
lim
n-+ oo
so that
(6.1.6)
Lim n-+oo
In (x)
=
0
Gn (x)
It follows from the continuity theorem that lim gn = e- t2/2 lim J
(t)
n-+ oo
so that
fn (t) j 2 lim /fn (t) / 2 1 n-+ oo
e - t212
=
n-+ oo
and therefore Lim
=
(6.1.7) n-+ oo Fn (x) s(x). We write (6.1. 4 ) in the form P., (x) f " ro F.. (x-y)dPn ( Y) =
=
and get
P., (x) f� F.. (x-y) dPn( Y) � Fn (x-s) F"n (s) Fn (x - s)[1 -Fn( -�s - 0)] , where is an arbitrary positive number. Since by assumption x median of Fn (x) we see that Fn (x) � �Fn (x-s). We conclude from the last relation and (6.1. 7 ) that for any x < 0 0. F (x) (6.1.8) nlim n -+ On the other hand, we see by a similar reasoning that 1 - P.. (x) f [ 1 -Fn (x - y)] dPn ( Y) � � [ 1 - Fn (x+s)] that for any x 0 lim Fn (x) 1. ( .1. 9) I�'ormulae (6.1.9) and (6.1.8) imply the assertion of the lemma. ;;::
oo
=
e
6
;;::
>
n-+ oo
0 is a
=
oo
so
=
008
=
General decomposition theorems In this section we discuss three general theorems concerning the facto ri zation of distribution functions and characteristic functions. The first two of these theorems are due to A. Ya. Khinchine, the last is due to I-1 . Cramer. 6.2
1 70
CHARACTERI STIC FUNCTIONS
Theorem 6.2. 1 . Every characteristic function can be represented as the product of at most two characteristic functions which have the following property: one does not have any indecomposable factors while the other is the convergent product of a finite or denumerable sequence of indecomposable factors. Le t f(t) be an arbitrary characteristic function and denote the corre sponding distribution function by F (x). Since f(t) is continuous and f(O ) 1 , there exists a real a such that f(t) 0 if I t I � a ; in the follow (X. ing we fix such a value a and write Na (f) If f(t) does not have any indecomposable factors then the theorem holds. We suppose therefore that f(t) has indecomposable factors. Then (X/2 ; it is possible that f(t) has a prime factor<*> p 1 (t) such that Na (p 1 ) it follows then from (iii) [see p. 1 67] that one can write f(t) P 1 (t) f1 (t) (X/2 while Na (f1 ) < (X/2. In this case we repeat the where Na (p 1 ) procedure with f1 (t) but use (X/4 instead of (X/2 as the lower bound for the Na-value of its prime factor. If f1 (t) has an indecomposable factor whose Na-value exceeds (X/4, then one obtains a decomposition f( t) P1 (t) P 2 (t) f2 (t) (X/4 (j 1 , 2) ( t ) while every indecomposable factor g(t) where Na ( P 3) of f2 (t) has the property that Na (g) < rt/4. In the case where no indecom posable factor with Na-value greater than rt/2 exists, we search for prime (X/4. In the case where such factors p(t) which satisfy the relation Na (p) factors exist one obtains a decomposition into at most four factors .f(t) P1 (t) Pn2 (t) f2 (t) \vhere 1 � n 2 � 3 . Here the p3(t) are indecomposable factors and satisfy the inequality Na ( P 3) (X/4, while every prime factor g( t ) of f2 (t) has the property that Na ( g ) < (X/4. We repeat this procedure and see that f(t) can be decomposed in the #
=
=
>
=
>
=
=
>
>
• • •
=
>
following manner :
(6.2. 1 ) are indecomposable factors such that Na (p3) > (Xj2k where the 3 (j = 1 , 2, of 1 � � 2 1 ) and where every prime factor has the property that Na (g) < rx j2 . It can happen that for some k � 1 the characteristic function/Jr (t) has no indecomposable factors. Then our process terminates and we see that the theorem holds. We must therefore prove the theorem only in the case
fk (t)
p (t) . . . , n1c ;
-
k
g( t)
terms "prime factor" an d ind ecomp osable factor syn onymously. (1") Note that accord i n g to our cons truction N(t (p1) > a./2 .
( tlfc ) We use
the
nk k
1 71
FACTORIZATION PROBLEMS-GENERAL THEOREMS
where the factorization process does not terminate ; the factors p 3 ( t) then form an infinite sequence. Since
� Na {p;) < Na =1
we see that the series
is convergent , so that the sum
(j )
k +m � Na {pj ) j= k +l
converges to zero as k tends to infinity ; this convergence is uniform in m ( m > 0). We now apply lemma 6. 1 .2 and see that there exist real numbers A v .v ' , such that lim eitAv.v' IT pk (t) = 1 v-+oo k= v uniformly in every finite t-interval I t I � and v ' > v. We write pk ( t) = Pk ( t) exp [iwk ( t)] and see that
T
tAv.v' + 2: w k (t) = 2nBv .v' (t) + o( 1 ) as V -+ oo k=v where Bv.v' ( t) assumes only integer values. The left-hand side of ( 6.2.2) is continuous, moreover Bv.v' (0) = 0 ; hence Bv.v' (t) = 0 for sufficiently large v and we have v'
(6.2.2)
tAv.v' + � wk (t) = o( 1 ) as v -+ 00 . k =v It is no restriction<*> to assume that w7c ( 1 ) == 0 so that A v.v' ,,
� wk (t)
We see therefore that v'
k -= v
==
o( 1 )
=
o(
1) and
as v -+ oo.
li1n IT pk (t) == 1 v-+oo lc= v u niformly in I t I � and v ' > 7). rrhe infinite product
( 6.2.3)
T
IT P j (t) j= l 00
is then convergent ; let v( t) be its limit. It follows from ( 6.2.3) that
v(t) (•)
'fh is
cu n
be
Hl� l� ll
if
one
=
k
lim IT P3 (t) lc->-
00
j=
-
1
n1ultip lics each Pk (t)
by
cxp
[ - £t w1c ( 1 )] .
172
CHARACTERISTIC FUNCTIONS
where the convergence is uniform in every finite t-interval. We see then from the second version of the continuity theorem (theorem 3 .6.2) that is a characteristic function. Let s > 0 be an arbitrary positive number ; according to (6.2.3) we have
v(t)
k+m I IT l j=k+l
pj(t)- 1
< s
(m
>
0, I t I �
T)
if k is sufficiently large. Since one can conclude easily that
l fk (t)-fk+m (t) l < (m 0 , l t l � T). This means that the sequence {fk ( t)} also converges to a characteristic function. Denote u(t) = lim fk (t). It follows from ( 6.2. 1) that f(t) = v(t) u(t). The function u( t) has no indecomposable factor ; this follows easily from the fact that each indecomposable factor of u(t) must be a prime factor of fk (t) for all k. But such a factor cannot exist since the Na-values of the prime factors ofjk (t) tend to zero as k goes to infinity. This completes the e
>
k--"" 00
proof of theorem 6.2. 1 . The second decomposition theorem supplements the preceding result by characterizing the distributions which have no indecomposable factor.
Theorem 6.2.2. <*> A characteristic function which has no indecomposable factor is infinitely divisible. Let f(t) be a characteristic function which has no indecomposable factors and denote by D f(t) = f1 (t)f2 (t) · · · fn(t) (D) an arbitrary decomposition of f ( t) where all fi ( t) are characteristic func tions. Suppose that a is a positive number such that f(t) 0 if I t I � a; we write then v(D) = max Na (fi) l
mm
< • > The converse of theorem 6.2. 2 is not true . 'fhis will be shown later.
1 73
FACTORIZATION PROBLEMS-GENERAL THEOREMS
v
It follows from the definition of that there exists a sequence of decom positions say ) f ( t) = fn. l ( t)fn.2 ( t) · · · fn.kn ( t) ( n = 1 , 2, for which converges to so that
(Dn)
{Dn }, v(Dn)
.
v v v(Dn) < v + 1 /n (n = 1 , 2, . . .) . Let fin> ( t ) be the factor of Dn for which v(Dn) = Na (fin>) and write fr> ( t) for the product of all other factors of Dn . Then v Na ( fin> ) < v + 1 /n (n = 1 , 2, . . . ) (6.2.4) •
•
�
�
f { t) = fin> { t)f�n> { t). Let Fin) (x), F�n> (x) and F (x) be the distribution functions corresponding to fin>, f�nl and f respectively ; it is no restriction<*> to assume that x = 0 is a median of F�n> (x). According to Helly ' s first theorem the sequence Fin> (x) contains a convergent subsequence, it is only a simplification of our nota tion if we assume that the sequence Fin> (x) itself is a convergent sequence . We prove next that the limit of this sequence is necessarily a distribution function ; this is established if we can show that for every 1J > 0 and suffi ciently large values of a > 0 and n one has Fin> { - a) <
1]
while FT> {a) > 1 - 1') .
We carry the proof indirectly and assume that one of these inequalities, for instance the second, is not satisfied for a > 0 and arbitrarily large n. Then for any b > 0 1 - F (b) = �
rX> oo [1 - Fin> (b -y)] dF�n> (y) J:l [1 - Fin> (b -y)] dF�n> (y)
� [ 1 - Fin> (b + 1 )] [ 1 - F�n> ( - 1 ) ] � � 1') . This however contradicts the assumption that F (x) is a distribution function. The proof of the inequality Fin) ( - a) < 1J for sufficiently large a > 0 and n is carried in a similar manner and so we have shown that
Lim Fin) (x) = F1 (x) n-+oo is a distribution function. We write f1 ( t) for the corresponding character istic function. We consider next the sequence Fkn> (x) ; it also contains a convergent subsequence and we use again the notation F�> (x) for this convergent subsequence. Let F2 (x) == Lim F�n> (x) ; n->-oo <•>
'fhis cnn ulwtlys be accomplished by ll translation which does not affect the Na
...
valucs .
1 74
CHARACTERISTIC FUNCTIONS
we show that F2 (x) is also a distribution function. We have for any a > 0 and b > 0
[J a"'+ b [1 - Fin> (a -y)] dF�n> (y)
1 - F (a) �
� [l - Fin> ( - b)] [1 - F�n> (a + b) ] .
F"'or sufficiently large b we have Limoo Fin> ( - b) = F1 ( - b) < � n� and therefore 1 - F�n> (a + b ) � 2[ 1 - F (a)] . This indicates that the left-hand member of this inequality tends to zero as a increases ; in a similar manner one can show that F�n> (x) tends to zero as x goes to - oo provided that n is sufficiently large. Thus F2 (x) is a distribution function and n�oo is its characteristic function. It follows from (6.2.4) that f ( t) = !t ( t )f2 ( t ) while
Na (ft)
= 'V.
v
We next show by an indirect proof that < � Na ( f) . Let us therefore suppose that v � �Na (f) ; it follows from (iii) {page 1 67) that Na {/2) � v. If we decompose /1 and /2 once more, we obtain a decomposition
(D*)
f = g1 g2 ga g4
v(D*) < v. But this contradicts the definition
which has the property that of v, so we can conclude that
< � Na ( f) . Therefore there exists a decomposition of f ( t ) such that < � a ( f) . Each factor of is a characteristic function without indecomposable factors and we can apply the result to a factor of and see that < lNa ( f) . < We iterate this procedure to obtain the statement of the lemma. We proceed to prove theorem 6.2.2. Let {sn} be a sequence of decreasing positive numbers such that lim fn 0 . n�oo It follows from lemma 6.2. 1 that there exists, for each n, a decomposition t) = fn.l { t )fn .2 { t) (Dn) fn .1rn { t) V
D v(D) N
D
D
v �v(D)
=
f(
•
•
•
1 75
FACTORIZATION PROBLEMS-GENERAL THEOREMS
such that for j
=
1 , 2 , . . . , kn while
lim kn = 00 . n�oo Using lemma 6. 1 .2 we conclude that it is possible to find constants ('J..n.i { j = 1 , . . . , kn ; n = 1 , 2 , . . . ) such that lim {fn.i { t) exp [it('J..n .i] } = 1 n�oo where the convergence is uniform for 1 � j � kn and in every finite interval I t I � We write fn.i (t) = Pn.i (t) exp [iwn.i (t)] (6.2.5) f (t) = p(t) exp [iw(t)] where wn.i (0) = w(O) = 0. Then
{
T.
n�oo (uniformly in I t I �
hence also
lim [wn,j (t) - tw n.i ( 1 )] n� oo
Writing
we see that (6.2.6)
T
n�oo and for 1 � j � kn )· We see then that lim [wn,j ( 1 ) + ('J.,n,j] = 0, n-+oo
gn,i (t)
=
=
0.
]} Pn.i (t) exp { [w n,j (t) - tw n .A l ) + t k--; .
w( 1 )
t
and conclude that (6.2.7) lim gn,3 (t) = 1 ; n�oo the convergence here is uniform in I t I � I�" rotn the relation Ten
T and for j
TI Jn,j (t) j=l and from (6.2.5) and (6.2.6) we can easily see that J( t)
=
=
1 , 2,
. . .
, kn.
176 It follows from (6.2.7) that the assumptions of the corollary to theorem 5 .6.1 are satisfied ; we finally conclude from this corollary that f(t) is CHARACTERISTIC FUNCTIONS
infinitely divisible. The first two theorems discussed in this section show that there are three possibilities for the product representation of an arbitrary characteristic function ( :
f t) (I) f(t) has no indecomposable factor (in this case it is neces sarily infinitely divisible) ; (II) f(t) is the product of a finite or denumerable sequence of indecomposable factors ; (III) f(t) is the product of two characteristic functions /1 (t) and /2 (t) where /1 (t) has no indecomposable factors, while /2 (t) is the finite or denumerable product of indecomposable factors.
The decomposition is in general not unique ; this is illustrated by the example discussed in Section and also by the multiple factor (p . ization of the characteristic function defined by The first of these examples refers to a purely discrete distribution, while the function is the characteristic function of an absolutely continuous distri bution. In the next section we will find some further examples of multiple factorizations of absolutely continuous distributions. The converse of theorem is not true. We have already given (page an example of an infinitely divisible characteristic Section function which is the product of an indecomposable characteristic function and an infinitely divisible characteristic function. The characteristic function
5.1 104) g( t),
( 5.5 .12).
(5.5.12) 124,
5 .5)
6.2.2
p- 1 t (p > 1) f(t) p-e i =
of the geometric distribution which we considered at the end of Section permits an even more remarkable factorization. It is easily seen that
5.4
p - 1 t Jl p2k pe2it•2k . p - ei 1 =
oo
+
+
We see therefore that the characteristic function of the geometric distri bution is infinitely divisible but admits nevertheless a representation as a product of an enumerable sequence of indecomposable characteristic functions. Our next theorem indicates that the existence of infinitely divisible distributions with indecomposable factors is not a rare occurrence.
Theorem 6.2.3. An infinitely divisible character£stic function g(t) whose Levy canonical representation is determined by the constants a 0 and = a =
177
FACTORIZATION PROBLEMS- GENERAL THEOREMS
by the functions O < u < c N(u) {�(u - c) ifotherwise and M (u) 0 always has an indecomposable factor. Here k > 0 and c > 0 are arbitrary real constants. The characteristic function g( t ) is then given by fc (e1w - 1 - itu+ u 2) du. log g( t) k 1 Let be a real number such that 0 < s < � and introduce the functions if ( � - s) c < u < ( � + s )c -s (6.2.8a) cx1 (u) 1 elsewhere in (0, c) 0 outside (0, c) 1 f ( � - s) c < u < ( � + ) c { +s cx (6.2. 8b) 2 (u) - 0 if I u-c/2 1 � ) (6.2. 8c) log g; (t) k s: (euu_ t - �: 2 cx ( u) du (j 1 , 2). 1 Clearly k[cx1 (u) + cx 2 (u) ] N '(u) so that log g( t) log g1 ( t) + lo g g2 ( t) . (6.2.9) The function g2 ( t ) is, according to the representation theorem 5.5 .2, the characteristic function of an infinitely divisible distribution. We show next that g1 ( t) is also a characteristic function provided that is sufficiently small. We define a sequence of functions flv(x) by means of the recurrence relations {31 (x) kcx1 (x) {J,. (x) s :,,,fln -l (x- t) {Jl ( t) dt s: fln -l (X-t) {Jl(t) dt. 0 if We conclude from these relations and from (6.2.8 a) that f3n (x) either x 0 or x � nc and note also that I f3n (x) I kn cn - 1 . We remark that f3n (x) is the n-fold convolution of {3 1 (x) with itself so that J :" e t {J.. (x) k" [ s : eitre (1;1 (x) dxr· series � ( 1 /n !) f3n (x) n= 1 =
=
=
s
0
==
i
_
sc
;
=
s
=
=
=
B
=
=
=
=
�
�
i
'fhe
dx
"
=
00
is absolutely and uniformly convergent ; therefore
(6.2. 1 0)
s: L�1 �/ (x)] dx e1""
..
=
exp
[k J: eit" cx1 (x) dx] - 1.
1 78 We write
CHARACTERISTIC FUNCTIONS
c A. = k J rx1 (x) dx
and
o
and obtain from (6.2. 8c) and (6 .2.10)
o
X
1 + x 2 rx1 (x) dx
oo 1 g1 (t [ + J eitx ( i �n . Pn(x) ) dx] exp (-A.-itn). )
Let
c 1J = k J
=
0
n- 1
'
then
gt (t) = J'"' oo d 1 (x). In order to sho\v that (t) is a characteristic function we must prove that G1 (x) is a distribution function. Clearly G1 ( ) = 0, while we see from (6.2.8c) that G 1{ + ) = g1{ 0) 1. We must still show that G1{x) i& non- decreasing ; we do this by proving that 00� 1 n (x) I n . fJ is no n-negative for all x, provided that s is chosen sufficiently small. We first remark that {31 (x) is non-negative except in the interval (-�2 -s)c < x < ( � + s)c; moreover it is easily seen that {J 2 (x) tends to k ( c - I c - x I) uniformly in the interval 0 < x < 2c as s tends to zero. One can also show that {3 2 ( x) and {J ( x) as well as 1 1 (x) (x) + + {J fJI 2! 2 3 ! fJa (x) are non-negative for all real x if s is sufficiently small. Let s be such s0 a value. For n � 4 we can rewrite the relations defining the (x) in the form Pn + 2 (x) J :" Pn (x-t) {J2 (t)dt (n 2, 3 , . . .) and see that fln+ 2 (x) � 0 for all x and all n � 2 if s0 • Therefore ito: G
g1
oo
- oo
=
n -:-
-,
3
=
f3n
=
=
e =
G1 (x) is the distribution function whose characteristic function is (t). We show next by means of an indirect proof that g1 (t) is not g1infinitely divisible. Let us then assume tentatively that g1 (t) is an i nfinitely divisible characteristic function. 'fhen g ( t) admits a Levy and
1
FACTORIZATION PROBLEMS-GENERAL THEOREMS
N1 (t).
179
canonical representation with some non-decreasing function The derivative exists almost everywhere and is non-negative. of It follows from the uniqueness of the canonical representation that the relation ( ) = = N� ( ) ( ) � ( ) is valid almost everywhere in the interval (0, but this contradicts 6.2.8b . Hence cannot be infinitely divisible. It follows from theorem 6.2.2 that g1 must have an indecomposable factor, and we see from that this is ' also true for so that theorem 6.2.3 is proved. In exactly the same way in which we proved theorem 6.2.3 it can be shown that an infinitely divisible characteristic function whose Levy canonical representation is determined by the constants a = a = 0 and by the functions = < < 0 and = 0 and for or > 0 always has an indecomposable factor. We = 0 for < can therefore reformulate our result :
N� (t) N1 (t)
N' x k g1 (t)
( ) (6.2. 9)
(t)
M(u)
N(u) u -c u
x + kcx2 x kcx2 x c);
g( t),
M(u) k(u + c)
-c u
Corollary 1 to theorem 6.2.3 . Let f (t) be an infinitely divisible characteristic function and suppose that the functions M(u) and N(u) which occur in its canonical representation satisfy the following condition: there exist two positive constants k and c such that at least one of the relations M'(u) > k almost everywhere in ( - c, 0) or N' (u) > k almost everywhere in (0, c) holds. Then f(t) has an indecomposable factor. We consider only the case where the condition is satisfied in the interval (0, c). Then f(t) has an infinitely divisible factor of the form required by theorem 6.2. 3 , so that the corollary is established. Let f(t) now be a characteristic function which satisfies the conditions of this corollary. The function f(t) can be written as an infinite product f(t) = II [f(t)] 2-s. Each factor [f(t) ] 2-s also satisfies the conditions of the corollary, so that we co
s=l
obtain the following result :
Corollary 2 to theorem 6.2.3 . Suppose that the infinitely divisible character istic function f(t) satisfies the condition of the corollary 1 , then it is divisible by the product of an infinite sequence of indecomposable characteristic functions. We finally remark that the conditions of corollary 1 are satisfied by the Gamma distribution and also by all non-normal stable distributions. Generalizations of theorem 6.2.3 were given by R. Shimizu ( 1964) [see also B. Ramachandran (1967)] . We mention here only one of his results which shall refer later. ju11ction g(t) 'tht!ortJ1n o.2.4. An infinite!:>' to
we
di�visibh) rhararll)ristir
2ohose Lecz'y
1 80
CHARACTERISTIC F UNCTIONS
canonical representation is determined by the constants a 0 and the functions k(b-c) for 0 < u b N (u) k( - c) for b < u < c and M(u) 0 0 for � c always has an indecomposable factor. Here k > 0 is an arbitrary constant, while the constant c satisfies the inequality 0 < 2b < c. =
=
a
=
�
u
=
u
The proof is similar to the proof of theorem 6.2.3 . We select first a point such that 2 < < and a number s > so that 2b < - s) < ( + s) < . We define if < < -s elsewhere in outside (b, + s if ( - s) < < ( + s) cx 2 ( otherwise. The functions cx.1 and cx 2 determine again-according to formula (6.2.8c)-two functions g1 ( t) and g 2 (t) . The function g 2 (t) is an infinitely divisible characteristic function, while it can be shown that g1 is, for sufficiently small s, a characteristic function but not infinitely divisible.
b d c
d
0
d(1
d1 c d(1 -e) u d(1 + e) (b, c) c) d1 u d1
1 0 { 1 u) 0 (u) (u) =
(t)
Indecomposable characteristic functions We have already given several examples of indecomposable character istic functions, and we showed at the end of the last section that a rather wide class of infinitely divisible characteristic functions has indecompos able factors. This, however, is almost the only general theorem concerning indecomposable characteristic functions which we know at present. There is no general method for finding the prime factors of a given characteristic function ; our knowledge consists mostly of interesting special examples. In the present section we will make a few general remarks about prime factors and also list a number of remarkable decompositions. We consider next an arbitrary distribution function F( ) (which is not assumed to be of a pure type) and suppose that it is the convolution of two distribution functions F1 (x) and F2 6.3
x
(x): F ( x) J 00 F1 (x-t)dF2 (t). 00 Suppose that � is a point of increase of F1 (x) and a point of increase of F2 (x); it is then easy to see that � + is a point of increase of F(x). Similarly, if � is discontinuity point of F1 (x) and a discontinuity point of F2 (x) =
a
rJ
rJ
rJ
181 then � + 'f} is a discontinuity point of F (x) .(t ) It can also be shown that every discontinuity point ' of F (x) can be written in the form ' = � + 'fJ where � is a discontinuity point of F1 (x) while is discontinuity point of F2 (x) . Let {�i } and {'fJj} be the ( finite or enumerable) sets of discontinuity points of F1 (x) and F2 (x) respectively and denote the discontinuity points of F(x) = F1 (x) * F2 (x) by {'k } · Since the elements of the set {Ck } can be written in the form {�i +'fJ j } we see that every difference � i-�k must occur among the differences of ,i _ 'k at least as many times as there are
FACTORI ZATION PROBLEMS-GENERAL THEOREMS
'fJ
a
different n-values. From these considerations we obtain easily the following results :
(1) Suppose that all the differences Cj- Ck between the discontinuity points of a purely discrete function F (x) are different. Then F(x) is an indecomposable distribution function.(§)
(2) Suppose that the purely discrete distribution function F (x) has at least n 2 discontinuity points and that it is not possible to find n pairs of discontinuity points which differ by the same number. Then is indecomposable. (3) A finite distribution which has two discontinuity points, one at each extremity, is always indecomposable. The last statement follows from the earlier remarks and from the relations lext = lext lext rext rext rext
F(x)
\
[F1 * F2] [F1 * F2]
=
[F1] + [F2] [F1] + [F2]
F1 F2 •
which hold for the convolution of two finite distributions and In Chapter 3 (corollary to theorem 3 .3 .3) we showed that the number N of discontinuity points of a purely discrete distribution function has lower and upper bounds which are determined by the numbers of dis continuities of its factors. It can be shown that this corollary is also true if the distribution is not purely discrete, the same limits (n �N� are valid also in the general case. We then obtain by induction the following result : ( A purely discrete distribution which has exactly n 1 discontinuity points has at most n indecomposable factors. This maximum can only be attained if the discontinuity points are the ( n consecutive terms of an arithmetic series.
+ m- 1
4)
+ 1)
nm)
+
(-!') These statements follow from the inequality Jt1 (g + '1J + h 2) - F (f + 7J - h1) > [F1 (g + h 2 - k 2) - F1 (g - h� + k1)] [F2 ( 'YJ + k 2) - F2 ('YJ - k1)].
l h� rc
(§)
hl
0, h2
0, k l > 0, k 2 > 0. distribution function F (.x) is indecomposable if its characteristic
'"�e say that the fu nction is indecomposable.
>
>
1 82
CHARACTERISTIC FUNCTIONS
We consider next a purely discrete distribution whose discontinuity points are the consecutive terms of a finite arithmetic series. It is then no restriction<*> to assume that this series consists of the integers 2, . . , n. In studying this class of distributions it is more convenient to use the probability generating function than the characteristic function. Let ak be the saltus of the distribution at the point k ( k the prob ability generating function is then the polynomial
0, 1, .
=
0, 1, . . . , n) ; 1).
(6.3.1) P (y) ak yTc (ak > 0, ak The substitution y eit transfortns P (y) into the characteristic function f(t) P (eit) ; the corresponding distribution function is given by =
� k=O
� k=O n
n
=
=
=
F (x)
n
=
� a�c s(x - k) . lc=O
Each decomposition ofj ( t) corresponds to a factorization of the generating function P (y) into the product of polynomials with non-negative co efficients. If no such decomposition exists thenf(t) is indecomposable. The number of factors of F (x) reaches its possible maximum if, and only if, the generating function has real, negative zeros. We assume next that all coefficients of the polynomial are equal and write
n
(6.3.1) n 1 Pn (y) n=
1
� yk k=o �
=
1 - yn n{ 1 - y )
for the generating functions of this sub -class. Since
Pnm ( Y)
=
Pn ( Y) Pm (yn)
Pm ( Y) Pn (Ym)
=
we see that the distributions of this class admit multiple decompositions, provided that the index is not a prime number. Using the present in the notation we could rewrite the example at the end of Section form P6 (y) P2 (y) P3 { y 2) P3 (y) P2 (y 3) . If
n
=
n
=
p�t p�2 •
5.1
=
• •
p�s ( CXt
+ +
h! ! cx2 !
!
CX 2
·
·
·
+
CX s
=
h)
is the decomposition of n into prime factors, then one can obtain in this way CX t
. . . CXs
different decompositions of Pn (y) into prime factors. M. Krasner B . Ranulac have shown that these are the only decompositio�s of
Pn (y) .
(1937)
The problem of decomposition into prime factors is therefore com-
<•> Since the decomposition properties of distribution functions linea r transformations.
are
invarian t un d e r
183
FACTORIZATI ON PROBLEMS-GENERAL T.HEOREMS
pletely solved<*> for the fa1nily of distributions with equal and equally spaced jumps. The indecomposable distributions which we have so far studied all had a finite set of discontinuity points. We show now that an indecomposable distribution can have an enumerable set of discontinuity points and can also be absolutely continuous or purely singular. Let { P v } be the sequence of prime numbers and suppose that the distribution function has its discontinuity points at �v = log Pv (v = . . . . It is then clear that the differences between discontinuity points are all different, so that is necessarily indecomposable. The following lemma will be used in our construction of a characteristic function which belongs to an absolutely continuous, indecomposable distribution functio11.
F(x)
1, 2, )
F (x)
Lemma 6.3 .1. Let p(x) be a frequency function which has a normal com ponent, then p(O) > 0. If p(x) has a normal component then it can be written in the form 2 x y) p(x) = �2n J -oo oo exp [ - � ; : J dF(y) where F(y) is a distribution function. Hence 2 ) + ( oo tt p(O) = �2n J - exp [ - 2 � J dF(y) > 0 oo a
a
a
a
and the lemma is proved. Let now
(6.3.2)
!( =
t) ( 1 - t 2) e-
Since
t s/2
=
_
d 22 (e -t"/2) . dt
1 J oo exp [itx - -x 2 dx, 2J V2n - oo see that j (t) = Jzn J oo oo x 2 exp [itx - �] It follows then that f ( t) is the characteristic function of the density 1 p(x) = vz; x 2 e - x e -t2 1 2 =
we
<• >
dx.
s; 2 .
remark by J. 1-Iadamard, which is app ended to the paper by l{rasner ltnn u l uc, t h i� p roh l t•tn wns also s ol ve d ind<'pcndcntly an d simultan eously by A. Licnard u n d ]J . A . ]{ni kov. A cco rd i n g to
a
1 84
CHARACTERISTI C FUNCTIONS
0
.1 (t) has no normal component (1 - t 2) (- a 2 t 2/2) (a 2 < 1 ). The only possible factors <*> have either the form (1 -t) e - t21 2 or the form 212• These factors do not satisfy the necessary conditions of (theorem 1 + t) e - t2.1.1 and cannot therefore be characteristic functions. Hence f(t) Since p(O) = we see from lemma 6.3 that f and therefore also no component of the form exp
is indecomposable. We have thus demonstrated that an absolutely continuous distribution function can be indecomposable. We add a few remarks which refer to the presence of normal components. Since the characteristic function (6.3 .2) is indecomposable we see that = is also an indecomposable characteristic function. We consider next the characteristic function = = ( 6.3 .3) and show that it has a normal component. This is the case if = is a characteristic function for some A such that I < 1 . Let
h(t) (1 - � t 2) e -tz/4
g(t) [h(t)] 2 (1 - t 2 + lt 4) e - t2f2
g1 (t) (1 - t 2 +lt 4) exp ( - A 2 t 2/2) AI 00 1 P1 (x) = -2 J - oo e - �txg1 (t)dt ; •
it is easily seen that ( 6 . 3 . 4) ( )=
n
P1 x + 1 1 + + 4] exp [ - z:; 2] 2 2 2 � 2 � � 4 r ; ) z ( ( ( r A �2n [! ; The function p1 ( x) is a frequency function if, and only if, the polynomial lz4 + ( 1 - 2� 2)Z 2 + ( 1 - � 2 + 4�4) is non -negative for all real z. It is easy to see that this is the case if A 2 � 1. Moreover, for A 2 = 1 we see that p 1 [ ( 3 v2)/4] = 0 so that g1 (t) can have no normal component. It follows then that for A 2 = 1 the characteris +
tic function
is indecomposable. We have just shown that the product of two characteristic functions < * > This follows fron1 thcorcn1 8 . 1 .2.
1 85
FACTORIZATION PROBLEMS-GENERAL THEOREMS
without normal components can have a normal component and have also obtained the factorization e-t2/4] e-t212 = [( 1 _ = (1 - + = [( 1 - t2j2 ) 2 e- at2fs] [e - t2fs] , where the factors ( 1 e- ats;s are indecomposable e - t2/4 and (1 characteristic functions. Our next example will show that the Poisson distribution has a similar property. The product of two characteristic functions which have no Poissonian factor may have a Poissonian component. Let A > 1 ;
!t 2)
t 2 !t4) it 2)
g(t)
t 2/2)2
( A 2 - 1 ) 1/ 2 /2 (t) = 2 2
and
A _ e it
/1 (t)
2
•
Clearly is the characteristic function of an indecomposable law, and it is not difficult to show that is also a characteristic function. More over we can write
'fhen
/2 ( t)
fl (t)f2 (t) = Je ; �) exp [fot(2v e�2����w -i]
is a characteristic function which has the Poisson factor
( (
exp { 1 /A) eit - 1 ) } while neither have Poisson factors. This is trivial for the nor indecomposable characteristic function If, on the other hand, would have a Poissonian factor exp Lu(eit _ 1 )] ( p > then
/1 (t) /2 (t)
/1 (t).
0),
/2 (t)
/2 (t) exp [ - #(eit - 1 )] = ell v'( l - A - 2) exp [ -# eit + v=�1 2 � j e2 m w VA
�
'--
'�
would be a characteristic function ; if we expand the right-hand side of this cq uation according to powers of eit we then see that the coefficient of eit is negative, so that exp [ - ft(eit _ 1 )] cannot be a characteristic function. ' rhis shows that (t) has no Poissonian component. 'fhe characteristic function is an example of a characteristic fu nction of an absolutely continuous, unbounded distribution function wh ich is indccon1posablc.
f2 (t) /2
(6. 3 .2)
1 86
CHARACTERISTIC FUNCTIONS
We next derive a theorem which enables us to construct certain interest ing examples of indecomposable distribution functions.
Theorenz 6.3 . 1 . Let F(x) be a distribution function and n be an integer. JiVrite (6.3 .5) Pn = F(n + 1 -0) - F(n-0) and define the distribution function (x) by (6.3 .6) F (x) = � Pnc(x-n) and introduce for for which Pn > 0, distribution functions Fn (x) by 0 ij X < 0 1 if n)-F(n-0) F(x � x< 1 (6.3 .7) ] + [ O P ifx ;?; 1. 1 Suppose that (a) P 2k + l = 0 for all k ; (b) p0 > 0; (c) ( x) is indeco1nposab le; (d) the distribution functions F2 k (x) have no com1non, non-degenerate factor. Then the distribution function F(x) is indecomposable. We give an indirect proof and assume that F(x) admits a decomposition (6.3.8) F = G * H, where G and H are both non-degenerate distributions. We introduce the quantities qn = G(n + 1 -0)-G(n-0) and r'll = H(n + 1 -0)-H(n - 0) and define the distribution functions G(x) and Gn (x) [respectively fi(x) and Hn (x)] corresponding to G(x) [ respectively H(x)] by replacing, in formulae (6. 3 .6) and (6.3 .7), Pn and F by qn and G [respectively rn and H] . In view of (b), we can assume without loss of generality that (6.3 .9) q0 > 0 and r 0 > 0. P
00
n= - oo
n,
n
P
We next show that (6.3 . 1 0) P = a * fl. It follows from (a) and (6. 3 .8) that
P21c = F(2k + 2 - 0) - F(2k -O) = f f dG(x) dH( y). 27c
<m + ·v <.:: 2k - l- 2
1 87
FACTORIZATION PROBLEMS--GENERAL THEOREMS
On the other hand it is easily seen that
so that { 6. 3 . 1 1 )
P 2k =
f f 2 dG(x) dH( y)
27c < x +v<
�
m + n= 2k
qm
2k+
Yn
and (6. 3 . 10) follows. We conclu � e from (c) that one of the factors in (6. 3 . 10) must be degenerate. Let H be this factor. We see from (6.3 .9) that for j -:/= 0 (6. 3 . 1 2) Y 0 = 1 ; Y1 = 0 and = ( 6.3 . 1 3) In view of (6.3 . 1 2) we have Y 0 = H(1 - 0) ( 6.3 . 1 4a) H( - O) = 1 . Moreover we see from (6.3 . 1 3) and assumption (a) that = 0 or (2k - O) - (2k - 1 - 0) = 0 ; hence G(2k - y - O) = (2k - O) for 0 � y < 1 . (6.3 . 1 4b) We next show that for a k such that > 0 the relation = (6.3 . 1 5) * If holds. We have
P 2k q2k·
-
q2k -t
G
G
G
p 2k
F21c G2k G2k * H = f ' G2k (x - y) dH( y)
or, using (6.3 . 1 4a) and (6.3 . 14b),
oo
1 G2k * H = q_!_2k J [G(x - y + 2k) - G(2k -y - O)] dH ( y � =
so
1
q 2k
-
0
[F (x + 2k) - F ( 2k - O) ] =
F2k (x) ,
that (6.3 . 1 5) holds. We conclude from assumption (d) that H (x) is degenerate and the statement of the theorem is proved. W c use the theorem to construct examples of indecomposable distribu t ions which are absolutely continuous or purely singular. JJct A and B be real numbers such that 0 < A < 1 , 0 < B < 1 and A In is irrational. The function if O > X 0 if O � x < A x/2 Jt, (x) = A/2 if A � X < 2 [A B -1- (2 - A)(.� - 2)] /{2R) if 2 � X < 2 -+- B 1
if
X
�
2 -1- IJ
188
CHARACTERISTIC FUNCTIONS
is then an absolutely continuous distribution. We have 1 - A /2, Pi 0 (j #- j #- 2) . P o A /2 , P 2 =
=
P (x)
=
0,
=
� e(x) + ( t - �) e(x - 2), so that conditions (a), (b) and (c) of
theorem 6 . 3 . 1 are satisfied. We also have if x < X if � x < A and F2 ( ) x) F0 ( A
0
0
=
0
X
=
0
X if 0 � X < B B 0
if X <
1 if A � x 1 if B � x . The corresponding characteristic functions are sin At/2 sin Btj2 itA/2 itB/2 + + an d J 2 ( t ) - e J o ( t) - e A t/2 Bt /2 respectively. Since A /B is irrational we see that /0 ( t) and /2 ( t) have no common zeros, and therefore also no common factor, so that condition ( d) is also satisfied. Therefore F ( x) is indecomposable. This example has already been given by P. Levy ( 1 952), and theorem 6.3 . 1 is a modification of his construction. We now construct an indecomposable, purely singular distribution. Let t it/2 e c(t) IT cos -. _
_
00
=
33
j= l
be the characteristic function of the singular distribution constructed in Chapter 2 over Cantor's ternary set [see pp. 8 to 9 and formula (2. 1 .7)] . We write C(x) for the corresponding distribution and put CA (t) c(A t) and write CA (x) for the distribution function of CA (t) . Let again A and B be two real numbers such that < A < 1 , < B < 1 and A/B irra tional. Let P o and p2 be two positive numbers such that Po + p2 1 . Then it is easily seen that F (x) p0 CA (x) +p2 CB (x - 2) is a purely singular distribution function. Moreover it satisfies the condi tions of theorem 6.3 . 1 and is therefore indecomposable. We next discuss several factorizations of the rectangular distributions. The characteristic function of the rectangular distribution over the range ( - 1 , + 1 ) is sin t r ( t)
0
=
0
=
=
Clearly
=
sin t t
=
2 sin (t/2) cos (t/2) t
t
=
.
cos (t/2)
. �i� ( t 2 )
/
�2
.
189
FACTORIZATION PROBLEMS-GENERAL THEOREMS
We iterate this procedure and get sin =
t (rrn cos -t ) sin (tj2n) . t k=1 2k tj2n Since sin (tj2n) lim = 1 tj2n -?-oo n we see that r(t) can be written as the product of an infinite sequence of _
r ( t)
-
indecomposable: factors : sin = II cos r(t) =
t
(6.3 .16)
t
oo
k =1
2k . t
We know that the rectangular distribution is not infinitely divisible ; formula indicates that it is possible to decompose a characteristic function which is not infinitely divisible into a product of infinitely many indecomposable factors. The decomposition is not unique. It is easy to verify that + sin sin cos =
(6 . 3.16)
(6.3.16) t (t/3) [2 (2t/3) 1] . t t/3 3 We repeat the procedure which led to (6. 3 .16) and obtain t sin t cos (2t/3) + 1] [2 IT cos (6.3.lJ) r(t) = t = 3·2k . 3 We have therefore obtained two different representations of the charac teristic function r(t) as an infinite product of indecomposable factors. k=l
We give next another interesting decomposition of the rectangular distribution. Let
/1 < = II cos 22k +1 k=1 00
t t) t !2 (t) = A cos z2k
(6.3 .19)
00
It follows from the corollary to theorem that /1 {t) characteristic functions of convergent symmetric Bernoulli Moreover we conclude from the corollary to theorem well as /2 are characteristic functions of purely singular 'I,hc product
3.7.9
and /2 ( t) are convolutions. that /1 as distributions.
3.7.10
(t)
t fl (t) /2 (t) n. cos 2k+l , see from (6.3.16) that =
and we
((,. 3 . 20) rG)
=
/1 (t) fm ( t ) .
00
(t)
190
CHARACTERISTIC FUN CTI ONS
(6.3.19)
(6.3.20)
Formulae and show that it is possible to represent the rectangular distribution as the convolution of two purely singular distribu tions. Several authors have raised the question whether it is possible to repre sent the rectangular distribution as a convolution of two absolutely con tinuous distributions. T. Lewis showed that this is not possible, and that the convolution of two absolutely continuous distributions cannot be a rectangular distribution. We also note that is the characteristic function of a finite distribution ; we will show l ater [corollary to theorem that the characteristic function of a finite distribution is always the product of a finite or of a denumerable sequence of indecomposable factors. Using the examples of decompositions discussed so far, we are in a position to summarize the Lebesgue properties of convolutions :
(1967)
r(t)
3
8.4.1 ]
(A) The convolution of two discrete distributions is always discrete. (B) A convolution which contains one absolutely continuous com ponent is absolutely continuous. (C) The convolution of a discrete and a singular distribution is always singular. (D) The convolution of two singular distributions is continuous. It is either purely singular or purely absolutely continuous, or a mixture of a singular and an absolutely continuous com ponent.
Remarks.
3.3.2. (1965 ) .
Statements (A) and (B) follow from theorem (C) is a consequence of some results contained in a paper by H. Tucker In connection with (D) it is interesting to note that H. Tucker constructed an infinitely divisible distribution ( x) , produced by a purely discrete function O (x) in the Levy-Khinchine representation, such that is purely singular while F * is absolutely continuous. Theorems and can also be used to construct examples of purely singular distributions whose con volution is singular. It would be interesting to have a necessary and sufficient condition which assures that the convolution of two singular distributions is absolutely continuous. No such condition is known at present.
F
F
3.7 .9
F
3.7.10
7
A N A L Y T I C C H A RA C T E R I S T I C F U N C T I O N S
We now introduce the class of analytic characteristic functions. This class includes many characteristic functions which are important in probability theory and in mathematical statistics. In the present chapter we consider the general theory, and in Chapters and 9 we study factorization problems. In the following sections we will denote real variables by t and y and a complex variable by = t y . We introduce the following definition. A characteristic function ( t) is said to be an analytic characteristic function if there exists a function of the complex variable which is regular in the circle I I < p ( p > and a constant � > such that A( t) = for I t I < � - We can express this in an informal manner by say ing that an analytic characteristic function is a characteristic function which coincides with a regular analytic function in some neighbourhood of the origin in the complex z-plane. As examples of distributions with analytic characteristic functions we mention : the Normal distribution, the Gamma distribution, and the Poisson distribution. Stable distributions with exponent ex < 2 provide examples of characteristic functions which are not analytic.
8
f(t)
z f+i A(z) 0) z
0
z
The strip of regularity and the integral representation From no\v on we assume that is an analytic characteristic function. We know (corollary to theorem 2.3 .2) that all moments of the correspond ing distribution exist and that it admits a Maclaurin expansion oo i k ex = for I I < p complex) 7o l
f(t)
(7.1.1) f(z) k'Eo k /' zk z (z where p > 0 is the radius of convergence of the series. We write for the even part of j (z) fo (z) = �[f(z) + f( - z)] for the odd part of f(z) (z) = �[f( z) - f ( - z) ] / 1 ' rhcn the two series fO (N ) = �;, ( -(21 k)) ! and
,..
(7. 1 .2)
k
O
k
r:x2k
Z
2k
192
CHARACTERI STIC FUNCTIONS
also converge in circles about the origin. We denote the radii of convergence of these series by p0 and p 1 From the inequality •
we
see that
0C2k-1
[
P 2k-1
1 OC2k oc2k-2 . (Zk) + � (2k - 1 ) ! (Zk - 1 ) ! 2 (2k) ! (2k - 2) ! Here and in the following we write again ock and {3k for the algebraic and absolute moments of order k. We conclude from (7 . 1 .3) that p 1 ;;:::: p 0 ;;:::: p and also that the series zk {3k � k=O k ! converges for I z I < P o . Let � be a real number and denote the radius of convergence of the Taylor series ofj0 {z) [respectively of/1 (z)] around � by p0 (�) [ respectively p 1 ( �)] . According to corollary 2 to theorem 2.3 . 1 we have < �) I I f k) <�) I oc 2k and I f32k-1 so that Po (�) ;;:::: P o (0) = P o ;;:::: P and P 1 ( �) ;;:::: P 1 (0) = P 1 � P · The Taylor series of/0 (z) and of/1 (z) around � therefore converge in circles of radii at least equal to p. The same is therefore true for the expansion of f(z) around � ' so that f(z) is regular at least in the strip I Im (z) I < p. We have already mentioned that the series
(7. 1 .3)
�
J
oo
2
converges for I
f<2lc - 1) �
�
£ PI; I y l k k=O /?, •
y I < p . Clearly
k�o �� ! Y !k k�o ' :t r Al x !k dF (x) = r /11"l dF (x) for any A and I y I < p . Therefore the integral J:oo e!Yrc! dF(x) �
exists for I
y I < p , hence the integral
f oo oo
e;zz
dF (X)
is convergent whenever I eizx J � e l vxl , where the integral
z
=
t + iy . This means that
1 93
ANALYTIC CHARACTERISTIC FUNCTIONS
t
y
is convergent for any and I I < p. This integral is a regular function in its strip of convergence and agrees with for real z, therefore it must provided that I J < p . agree with also for complex values
f(z)
f(z) z t + iy,
y The integral J: ei""' dF(x) converges in a strip - ex < lm (z) < +{3 oo
where
rx
�
p,
=
{J �
p
and is regular inside this strip. We write
f(z) = J: e..., dF(x)+ J � oo eizz dF (x) = 2'1 (z) + 2'2 (z). The functions 21 (z) and 22 (z) are Laplace integrals, convergent in the half-planes y > - ex and y < f3 respectively. Let z = iw; then w = -iz = -it +y and 2'1 (iw) = J � e - =dF(x) =
.
rfhe corollary can sometimes be used to decide whether a given function could be a characteristic function. We illustrate this by an example. Let
f1 (t) = [( 1 - :) ( 1 - a : i ) ( 1 a : )J b
and w i th
tl
� b
>
0.
-
w
-
1
194
CHARACTERI STIC FUNCTIONS
It is easy to see that both these functions are analytic characteristic
functions. Their quotient
f(t) = f!12 (t)(t) satisfies the elementary necessary conditions for characteristic functions, f( - t) = f(t), I f(t) I � f(O) = 1 for real t. However the condition of the corollary to theorem 7.1.1 is violated since f(t) has no singularity on the imaginary axis while it has a pair of conjugate complex poles b - ia. 1"'herefore f ( t) cannot be a characteristic function. Suppose that a distribution function F(x) has an analytic characteristic function f(z) whose strip of regularity is lm (z) {3. It is then possible to express and f3 in terms of F(x). Using classical results [see Widder (1946) pp. 42 :ff. ] concerning the abscissa of convergence of a Laplace integral, one obtains f3 1. log F( - x) 1. { log [ 1 -F(x)] } . = - 1m sup = - 1m sup X X Let f(z) be an analytic characteristic function ; according to theorem 7.1.1 it can be represented as the Fourier integral f(z) = J: eiZfJJ dF(x) [ Im ( ) {3] . +
- ex <
<
ex
ct.
x� oo
x� oo
- ex <
oo
Therefore
z <
d ) r (z) = d��. f(z) = i• f oo x• ei"'" dF(x) . \Ve write z == a + y where and y are real and where y < {3, then I r) (a + iy) I r ) I I• e - xy dF(x). r = 2k (k = 0, 1, 2, . . . ) is an even integer, then this becotnes I j<2kl (a + iy ) I J x 2 k e - XY dF(x) = I f2kl (iy) !, - oo
a
i
<
If
<
so that
max [ f< 2k>
- oo < a < oo
oo
00
X
- oc <
oo
(a + iy) [ == [ f<2k> (iy) [ .
We have therefore derived the following result :
Then I f(z) I be an analytic characteristic function. Theorem 7 .1.2 . Let f(z) of r any horizontal line contained ink>the interior attains its maximum alongimaginary f(2 ( ) of even orde on the . axis. The strip of regularitysanze off(z) have the property derivati?.'es
z
its
195
ANALYTIC CHARACTERISTIC FUNCTI ONS
The relation
f(t + iy) � f(iy)
I I is very important in the theory of analytic characteristic functions. We say that functions satisfying this inequality have the "ridge property" and we refer to them as "ridge functions" .
Corollary to theorem 7 . 1 .2. An analytic characteristic function has no zeros on the segment of the i1naginary axis inside its strip of regularity . The zeros and the singular, points of an analytic characteristic function are located symmetrically witlz respect to the imaginary axis.
The first part of the corollary follows immediately from theorem 7 . 1 .2 ; we obtain the statement about the location of the zeros and of the singulari ties of the characteristic function (z) if we observe that the functional relation (7. 1 .4) Tz) = holds not only in the strip of convergence of the Fourier integral but in the entire domain of regularity of (z). It is in general possible to continue an analytic characteristic functio11 beyond the strip of regularity. However, an analytic characteristic function n1ay have a natural boundary. I. V. Ostrovskii (1 966) showed that the boundary of any region which satisfies certain conditions can be the natural boundary of an analytic characteristic function. These conditions are consequences of the ridge property and of the relation (7. 1 .4) f(z) = which all analytic characteristic functions satisfy. The strip of regularity of an analytic characteristic functionf(z) can also be the whole z-plane ; in this case f(z) is an entire (integral) function. We next derive a result concerning the order<*) of an entire function. Let (z) be an entire characteristic function. We denote by == max l (z) I
f
f
f(- z)
f
f(-z)
f
M(r;f) f the maximum modulus of f ( ) in the circle I z I � r. This value is assumed on the perimeter of this circle<*> and we see from theorem 7 . 1 .2 that M(r ;f ) == max [f(ir),f(-ir)] . We formulate this result in slightly different way. /�e11una 7. 1 . 1 . Iff(z) is an entire characteristic function, then [f(ir)+ f(-ir)] � M(r;f) � l [f(ir) + f( - ir)] . f(z) is an entire characteristic function, then the integral representa is valid in the whole plane so that f (ir) + f( - ir ) = 2 fco co cosh rx dF(x) . (7. 1 .5) z
If tion
l zl � r
a
9
1 6
CHARACTERISTI C FUNCTIONS
(7.1.5) and the lemma that cosh rx dF ( x) ;::;: H e � T + e- �•) r M ( r ; f ) ;::;: r J J ;::;: � e�r f dF (x) J
It follows from
l x l > <5
dF (x)
l x l >6
l x l > <5
where � is an arbitrary positive constant. We write
0
0
r:x =
J dF(x) 0 l xl > <5
F(x) s(x)
�
= and note that r:x = for every � > if, and only if, where denotes the degenerate distribution. From the preceding inequality we obtain M (r ; f) � � r:x <5r . (7. 1 .6) Since the order p of an entire function f(z) is (see Appendix D) log log M (r ; f) . p = 1 1m sup 1og r-+oo and have proved the that p � provided that r:x > we see from following theorem :
s(x)
e
(7.1.7)
r
(7.1.6) 1, 0, Theorem 7.1. 3 . The order of an entire characteristic function which does not reduce to a constant is at least equal to 1.
We will resume the study of entire characteristic functions in the next section, but proceed now to discuss some convexity properties of analytic characteristic functions. We introduced in Section 1 . the moment generating function
4
(y) J : e11"' dF (x). This function is defined for distributions for which the integral (7 . 1 .8) exists for all J y I R, where R is some positive constant. If f(z) is an analytic characteristic function, then we can take R = min ( f3) and see that its moment generating function exists and that M(y) f(-iy). We see from (7 . 1 . 8 ) that M (y ) is real and positive while M "(y) 0. Therefore f ( -iy) is real and positive and is a convex function of y for all y for which the representation by a Fourier integral is valid. Moreover M (y) = f( iy) 1. is strictly convex unless f(z) 7
( . 1 . 8)
M
=
oo
<
=
r:x,
�
-
=
We next discuss a less trivial convexity property of analytic character istic functions and their derivatives of even order. Let f(z) be an analytic characteristic function which has - ex < Im (z) < {J as its strip of regu larity ; according to theorem ( ) 1 � Suppose that for some y 0 such that - ex < Y o < fJ we have f( Zk> ( 0) = 0. that (z) = 0, so that f(z), and therefore also It follows from
7.1.9
7k.1.2 l /(27c> ( t + iy) l f(2 > (iy) l . (7.1.9) /(2Tc>
iy
1 97
ANALYTIC CHARACTERISTIC FUNCTIONS
f(t) for real t, is a =polynomial of degree 2k. Since f(t) is bounded, this is only possible if k 0 and f ( t) 1. We see therefore that the derivative f< 2k) (z) of even order of an analytic characteristic function has no zeros on the segment of the imaginary axis contained in its strip of regularity unless f( z) 1 . Each point iy of this segment has a neighbourhood in which f< 2k) (z) is regular and different from zero. In this neighbourhood log f< 2 k (z) is defined and regular. We can therefore write f< 2k) (z) = e0k
=
)
rx
ex; <
<
�
<
<
<
t=o
t=o
z
t=o
rx
O
,
t= o
�
<
rx
<
<
=
7o2
Analytic characteristic functions and their distribution functions In this section we deal with the relation between the properties of an analytic characteristic function and its distribution function. As a first step we will derive a necessary and sufficient condition which a distribution function must satisfy in order that its characteristic function be an analytic characteristic function. In the preceding section we have seen that the moment generating functio n exists for every distribution function which has an analyti c characteristi c function. ,..fhc . converse statement follows from the argun1cnt used in the proof of theorem 'rhus distribution functions 111 (.�) whi ch. have an alytic characteristic functions are exactly those for
(7.1.8)
7 .1 .1.
F(x)
1 98
CHARACTERISTIC FUNCTIONS
\vhich the moment generating function exists. This remark leads to a rather obvious criterion : The distribution function F (x) has an analytic characteristic function if, and only if, the following two conditions are satisfied : (i) the distribution F (x) has moments of all orders k 1 /p is finite. (ii) lim k sup [I
rxk I lk !] 1/Tc
� oo
rxk
=
These conditions are equivalent to the statement that the series
f(z) = k�o :; (iz)k
> 0)
represents a function which is regular in the circle I z I < p (p and which agrees with the characteristic function of F (x) for real values of We note that it is easy to construct distributions which have moments of all orders but do not have analytic characteristic functions. Such a distribution then necessarily violates condition (ii). As an example we mention the distribution whose frequency function is exp ( - l v'x fo r x (x) = for x < The corresponding moments are easily computed. We find = + so that
{0�
p
J)
z.
>0 0.
rxk (2k 1)! c:� 'r/k = k
Hence all moments exist but do not satisfy (ii) . This distribution has another interesting property. Although its moment generating function does not exist, it is completely determined by its moments. It is known [see Shohat-Tamarkin ( 1 943), theorem 1 . 1 1] that a of its distribution function is completely determined by the sequence
1 2 / 7c diverges. Since rxk = (2k + 1 ) ! rx]; k= l 00
moments, if the sum �
<
{rxk }
( 2k + 1 ) 2 k
it is easily seen that this condition is satisfied. Our next result is more useful and is directly applicable to the distri bution function F ( x).
Theorem 7.2.1. The characteristic function f(t) of a distribution function F (x) is an analy tic characteristic function if, and only if, there exists positive constant R such that the relation 1 - F (x) + F ( - x) = O(e - rx) as x -+ (7.2. 1 ) holds for all positive r R. The strip of regularity off(z) then contains the strip I lm (z) I < R. Remark. The positive constant R may be infinite. In this case (7 . 2 .1) holds for all positive real r and f ( z) is an entire function. a
<
oo
199
ANALYTIC CHARACTERISTI C FUNCTI ONS
.2.1) 1 F(x) O(e-rx) x F(-x) O(e - rx) R. R kJ eiYI:• dF(x) eiYik [ 1 -F(k - 1 )] . Te- l so Using condition (i), we see that 1 - F(k - 1) = O( e- r
We first note that (7 is equivalent to the silnultaneous validity of the relations = as � oo (i) = (ii) as X � 00 . We prove first the sufficiency of these conditions. Let y be a real number such that I y I < and choose a positive r so that I y I < r < Let k be a positive integer ; then -
<
�
�
� oo ,
<
�
a
<
�
oo
�
a
small-no matter what b is-by choosing integral exists and is finite. We also have
�
•
a
sufficiently large. Thus the
f � eiYix dF (X) = f� eiYml dF (X)
1 f =:+ ei Yxl dF(x) < eiYik F(- k + 1 ) ,
C� k K�. d 0.
a.nd we conclude from (ii) that there exists a constant such that }1, ( for sufficiently large say for > We choose + � C� > and two real numbers c > K ' , > n ow an integer We see then that
e - rlc K ' K�
k, I c i u > -l < er C' 1 f -c elvxldF (x) � _1 - e- (T-I YI >
- k 1)
- c- d
_ _ _
-=--
and apply an argument, similar to the one used above, to show that the i ntegral
r
"'
e l voo l
dF (x) exists and is finite.
Combining this with our
200
oo x dF (x), and therefore also J e'IIX dF ( x), l e earlier result we see that f " oo oo . Let = t iy , then the exists and is finite for all y such that I y I R oo z dF ( x) is also convergent for any t and I Y I R e integral f (z) = J oo and represents a regular analytic function, so that the sufficiency of our CHARACTERISTIC FUNCTIONS
'll
i
l
<
z
+
<
"'
condition is established. We next prove that the condition (7.2. 1 ) [ or (i) and (ii)] is necessary,
oo and suppose that the characteristic function f(z) = J ei dF (x) is an 00
""'
analytic characteristic function whose strip of regularity is the strip = min (ex, {3) and let x > 0 be a real number ; - ex; < Im (z) < {3. Let then the two integrals
R
J : �'II"' dF (u)
J- "'oo eY"' dF (u)
and
R. y R r r1 R. J : e dF u e "' [ F x or 0 � [ l - F (x)] e � C e -
and let We choose a number r < exist and are finite for all I I < Then there exists a constant C such that r1 be such that < < C > ( ) � l - ( )] � 0 T• '-'
• '
rx
oo .
x
-
distribution has therefore an entire characteristic function. However, it is possible to make more precise statements concerning finite distributions. These are closely related to properties of one-sided distributions witl1 analytic characteristic functions which we shall discuss first.
Theorem 7 .2.2. Let F (x) be a distribution function with an analytic character istic function. F (x) is bounded to the left [respectively to the right] if, and only if, its characteristic function is regular in the upper [respectively lower] half-plane and if there exists a finite positive constant c such that l f (z) I � ec l zl provided that lm (z) > 0 [respectively lm (z) 0]. <
We first show that our condition is necessary and we suppose that<*>
a
= lext
[F] and consider the integral J � i dF (x) where
<• > The symbol lext is defined in Section
e
5 . 8,
page
w
142.
z =
t + iy . In
201
ANALYTIC CHARACTERISTIC FUNCTIONS
0
the case where a � it is clear that this integral is regular in the half-plane If a < we write y = lm (z) >
0.
0
J : eixz dF (x) J: ei'"" dF (x) + f � ei"'" dF (x) ; =
the first integral is an entire function while the second is regular in the upper half-plane. We assume thatf(z) is an analytic characteristic function. Therefore f(z) is regular in a horizontal strip containing the real axis in its interior and admits in this strip the integral representation f(z)
J: oo ein dF (x).
=
Since f(z) is regular in the upper half-plane we see that the region of validity of this representation contains the half-plane lm (z) > in its interior. Therefore l f(z) I
for y
=
=
f oo
eitm -
0
J: e-11"' dF (x)
�
oo Im (z) .> 0 and we can show easily that
( 7 . 2 . 2) l f(z) 1 :( e -av :( e la l v :( e lall z l , provided that y > We next prove the sufficiency of the condition and assume that f (z) is an analytic characteristic function which is regular in the upper half-plane and which satisfies the inequality lf(z) I � ec l z l ( c > then it can be shown provided that Im (z) > 0. Let here z == iy (y > that
0.
0),
h
0);
=
- lim sup 1 log f(iy ) u-+oo Y is finite. Let s be an arbitrary positive number and let and be two < and h - x2 = 2.s . We then see from the real numbers such that representation of f(z) as a Fourier integral that f(iy)
=
f oo
x1
x1 x2
00
e- 11"' dF (x) �
I :: e-11m dF (x)
� e -11"''
x2
[F(x2) F(x )] -
1
.
'fhe defi nition of h implies that - h + s > y - 1 log f(iy ) or that f(iy) < e - u(h - e)
F(x2)-F (x1) 0
=
e - y ( x2+ e> .
0 F 2 ) - F ( x1) 0
� for arbitrary B > and suffi 'J ,hcrefore e - 118 > == cien tly large y . This, however, is only possible if (x when eve r .t' 1 < .x2 = h 2e ; this means that (x) is bounded to the left and
t h at
-·
lext
[Jl]
F
� h.
20 2
CHARACTERISTIC FUNCTIONS
This completes the proof concerning distributions which are bounded hence from the left. However, we see from that log � also holds and we have = or the inequality � = lext
(7.2.2) h a [F] (7.2.3) lext [.F] = - lim sup ! log f(iy) . y-->- oo
We can therefore state
f(iy) ay, h a
Y
Corollary to thereom 7. 2 .2. If F(x) is a distribution function which is bounded to the left and has an analytic characteristic function, then (7 .2.3 ) lext [.F] = - lim sup Y! log f(iy); if F (x ) is bounded to the right and has an analytic characteristic function, then (7.2. 4) rext [F ] = lim sup y! log f( - iy). Y--* 00
1/--* 00
The proof has been given only for distributions which are bounded to the left ; the proof of the statements concerning distributions which are bounded from the right is quite similar and is therefore omitted.
Remark. Let k(x) be an arbitrary convex function such that k(O) = 0; it is then easily seen that k(x)jx is a non-decreasing function for x > 0. Let function which is regular in the half-plane f(z) belma(z)characteristic = y ( ex > 0). According to theorem 7.1 .4, the function log f(iy ) is a convex function of y for y > 0, and we conclude that [log f(iy)]/y is a non-decreasing function of y . Therefore it is possible to replace in the formula for the left extremity the lim sup by lim, and to write instead of (7 .2.3) (7.2 .3a) lext [.F] = - lim Y! log f(iy). - ex; <
Y--* 00
Using a similar argu1nent one obtains
(7.2.4a)
rext [F ] = lim ! log f( - iy) . y-->- 00
y
F(x)
These limits will of course be infinite if the distribution function is unbounded either to the left or to the right. If the distribution is finite, then we can combine the results of and its corollary and obtain the following statement : , theorem
F(x) 7.2.2 F(x) be a non-degenerate andfinite distribution function . 2.3 . Letfunction Theorem 7.cteristic (t) of F (x) is then an entire function of exTheon charat j>e 1: > 0 and of.forder 1 which has irifinitely 1nan)J zeros. Conp ential y
203
ANALYTIC CHARACTERI STI C FUNCTIONS
versely, an entire characteristicfunction of exponential type 1: > 0 and of order 1 belongs always to a finite distribution. Moreover the two extremities of F (x) are given by ( 7. 2 .3 ) and (7. 2 . 4). Let = lext [F ], b = rext [F], c = max ( I a 1 , j b !). We see then from theorem 7.2.2 that I f(z) I :( ecl zl , so that M(r; f) :( ecr. It follows from theorem 7.1.3 that f ( ) is an entire function of order 1 of exponential type not exceeding c. According to Hadamard's factorization theorem<*> f( ) = G ( ) eaz where G ( ) is the canonical product formed with the zeros of f ( ) . Si�ce I f(t) I � 1 for real t, we see that G ( ) cannot be a polynomial and must therefore have infinitely many zeros. The second statement of theorem 7 . 2 .3 as well as the formulae for the extremities follow immediately from theorem 7 .2. 2 . Remark 1. A one-sided distribution does not necessarily have an analytic characteristic function. As examples we mention the stable distributions with exponent 0 1 and f3 = 1 which were treated in theorem 5.8.3. A specific example was given by formula (5.8.9). A one-sided distribution may have an entire characteristic Remark 2. function, and the order of this function can exceed 1. an example we a
z
z
z
z
z
z
< rx <
+
As
mention the characteristic function which is obtained by truncating the standardized normal distribution at the point zero.
3. An interesting modification of the continuity theorem for Remarh characteristic functions of one-sided distributions was established by Zygmund (1951). He showed that in the case of one-sided distributions A.
the condition that the sequence of characteristic functions should converge over every finite interval can be replaced by convergence over a fixed interval around = 0. For a precise statement as well as for the proof we refer the reader to A. Zygmund's paper.
t
Retnark 4. The characteristic function of a finite distribution necessarily infinitely many zeros. These need not, however, be real [Example : .f ( t ) == ( + eit) ]. Remark 5. Entire characteristic functions of order 1 and maximal type do not belong to finite distributions. Remark 6. If B(x) is a non-decreasing function of bounded variation h as
P
q
such that its spectrum Sn is contained in the finite interval [a, b] then its (i' ouricr-- Stieltjes transform
<*)
b(t) = J oo
Sc.�c
00
eilm JB(x) =
Copson ( 1 93 5), pp . 1 74·-1 75.
J : eitm dB(x)
204
CHARACTERISTIC FUNCTIONS
1 and exponential type not exceeding max (J a j , I b 1 ). Remark 7. I f a distribution function F (x) has an entire characteristic function of order and exponential type then � lext (F ] < rext [F ] � A similar statement is true if F(x) is a function of bounded variation whose Fourier-Stieltjes transform is an entire function of order 1 and exponential is an entire function of order 1
type
r
- 1:
r.
r.
We next study the order and type of entire characteristic functions. For this purpose we need three lemmas :
Lemma 7 .2. 1 . Let ex > 0 and k > 0 ; then the integral J� exp (izx - kx1+cx) dx I( z) 1 + 1 /oc: and type k oc( :oc:) Hl/oc . is an entire function of order We expand the factor eizx into a power series, and since the order of integration and summation may be exchanged we see that n r (iz) I (z) ,,_L.o n ! J o xn e -kxl +cx dx . We introduce the new variable y kx1 +cx in the integral and obtain I ( z) Cn zn where n ) n i 1 + ( c n ! r 1 + ex (1 + ex) k1
r
p =
00
=
tl
l
00
=
=
=
n
� 00
n =O
=
"tail behaviour" of the corresponding distribution function. In order to study this behaviour it is convenient to introduce three functions. Let be a distribution function ; we write for > 0
x
T(x) 1 -F(x) + F(-x) log [ T (x)]- 1 T1 ( ) xl +cx ( ex > 0 ) (7 .2.5) log log [T (x)] - 1 T2 (x) log x We note that T1 (x) depends on the positive parameter ex. X
=
=
=
F(x)
ANALYTI C CHARACTERISTIC FUNCTIONS
205 > 0.
Lemma 7.2.2. Let F(x) be a distribution function and ex 0 and k Suppose that there exists an x0 > 0 such that1 T(x) � exp ( kx +cx) for x � X 0• Then F(x) has- an1 entire characteristic function f(z) which is either of order equal to 1 + ex and type � ex[k1/cx (1 + ex)1 + 1/cx] - 1 or of order less than 1 + ex -I. Let A > x0 and r > 0 ; we see then (integrating by parts) that AI e'"" dF(x) = - I A e'"'d [ 1 -F(x)] Xo Xo A A o r erx [ 1 -F(x0)] - e [ 1 - F(A)] + r I Xo [ 1 - F(x)] erx dx. We let A tend to infinity and conclude from the assumption of the lemma that I 00 e'"' dF (x) [ 1 -F (x0)] + r I 00 exp (rx - kx1 +ex) dx. Since r· e'"'dF(x) e'"'• F(x0), we have I 00 e'"' dF(x) e""• + r I � exp (rx-kx1 +cx) dx. (7.2.6) 00 Similarly one can show that (7.2.7) I e- ·"'dF(x) e'""' + r Jr o exp (rx - kx1 +cx) dx. Since M (r, f) = m ax [f(ir),f(-ir)] we see from (7.2.6) and (7.2.7) that M(r, f) e'""' + r I� exp (rx -kx1 +cx) dx. >
-
1:
=
� e"""'
�
�
�
oo
�
oo
oo
�
- oo
�
The statement of lemma 7 .2.2 follows easily from lemma 7 .2. 1 and from the last inequality. .�
'
Lemma 7.2.3 . LetA F(x) be a distribution function with characteristic and let 0, > 0 be two constants. Suppose that there exists functionf(t) a constant R such that M(r ; f) exp [Ar1 +1l] for r � R. Then lim inf T2 (x) 1 + l ift and T(x) exp { -x1 +p-l- e) .for any 0 and sufficiently large x. from (7. 1 .6) that for > 0 and r � R 11 (x) 2 ( rx Ar1 +tt) . >
#
�
�
x� oo
�
e >
We sec
x
�
exp
-
+
206
CIIARACTERI STIC FUNCTIONS
x ;:::: x0 2R�J and {�x)1/11- so that r �1 R; then we get T(x) � 2 exp [ - (2 -A) ( � x) +11--1] and we conclude from formula (7 .2.5) that lim inf T2 (x) ;:::: 1 + 1 / For any > 0 and sufficiently large x, one then has 1 T2 (x) ;:::: 1 + - - s . Using again (7. 2 .5), one obtains the statement of the lemma. We study next entire characteristic functions of order greater than 1. Theorem 7.2.4. The distribution function F(x) has an entire characteristic function f(z) of order 1 + cx -1 {ex > 0) and of intermediate type 7: if, and only if, the following two conditions are satisfied: ( cx7: - ) ( ) hm mf T1 (x) (1 + IXy +oc (ii) T(x) > 0 for all x > 0. We first prove that the condition is necessary, and assume thatf(z) is an entire function of order 1 + cx- 1 and finite type > 0. Clearly (ii) is necessary, since T(x) 0 means that F(x) is finite, so that f(z) would have order 1. Moreover it is possible to find for any > 0 a value R R( ) such that (7.2.8) provided that r � R. It follows from ( 7.1.6 ) and (7. 2 .8) that (7.2 .9) T(x) � 2 exp [- rx + ( 7: + s) r1 + - ] for x > 0, r � R. (�Y;"' and Let a be an arbitrary positive number and let x axcx ; then r ;:::: R. It follows from (7 .2. 9) that 1 ] log - log 2+x� + 1 [a - ( + s ) T(x) We put
r =
=
,u .
X-HO
e
,u
1 •
•
•
=
x� oo
I
cx
=
e
cx
1:
=
1
�
r =
�
so that
x (7.2.10 ) as
-+ oo .
Therefore lim inf x- ->-
oo
T1 (x) � a-(7: + s)a1 +cc1 •
1:
x0 =
a1 + cx-l
e
207
ANALYTI C CHARACTERI STIC FUNCTIONS
This relation holds for any a > 0 and in particular for that value of which maximizes the right-hand side of (7.2. 0 , that is for
a
1) a = {ex/[{ r +s)(1 + ex)] }ct. We substitute this value of a into (7.2. 1 0 ) and get 1 ex( r s) ct ] + [ . lim inf T1 (x) l +ct (1 +ex) Since s > 0 is arbitrary we see that 1 ( exr)ct li m inf T1 (x) (7. 2 . 1 1 ) (1 + r:x) We show next by means of an indirect proof that the inequality sign cannot hold in (7 .2. 1 1 ) . Suppose therefore that -r1 ( ex )ct y lim inf T1 (x) > ( 1 + ex 1 ct ( exr ) Then it is possible to find a k > (1 + y + such that T1 (x) ;;:,: k for x sufficiently large. Using (7 .2.5), we see that T(x) � exp ( - kx1 +ct) for suffi ciently large x and conclude from lemma 7.2.2 that (7.2. 1 2) M ( r ; f) � exp [( r ' + s ) r1 +ct-l ] [k1 11ct(1 + r:x)1 + 1/ct] - 1 ex < r. for any s > 0 and sufficiently large r, where r ' Since the order of f(z) is, by assumption, 1 + ex - , it follows from (7.2. 1 2) that the type off (z) is at most equal to r', hence less than r. This contra dicts the assumptions of the theorem ; therefore the inequality sign cannot hold in (7 .2. 1 1 ) , so that the necessity of ( i) is established. We still have to show that conditions (i) and (ii) are sufficient. Clearly (ii) implies that f(z) is not a function of exponential type and that T1 (x) is defined for x > 0. Let k < (exr - 1)ct { 1 + r:x) - 1- ct. (7. 2. 1 3) x1 (k) such that T1 (x) k for In view of (i) , there exists a value x1 x1 . It follows from (7.2.5) that T(x) � exp ( - kx1 +ct) (7 .2. 1 4) X u and we conclude from lemma 7.2.2 that f(z) is an entire func for tion whose order and type r' are such that either 1 + ex - 1 and r' � exj [k11cx (1 + r:x)1 +11ct] (7.2. 1 5) x� oo
>
x� oo
�
l +oc "
+ oc "
x� oo
cz
oc
=
x
=
�
x
or
�
�
p
p =
(7.2. 1 6) We sh o w next that (7.2. 1 6) cannot hold . We give an indirect proof and 'assu n1c therefore tt�n tativcly the val id ity of (7.2. 1 6). It is then possible to
208
CHARACTERISTIC FUNCTIONS
oc such that M(r ; f) exp (r1 + 11Y) for sufficiently large r, say r R. It follows from this inequality and lemma 7 .2. 3 that for any > 0 T (x) � exp ( - x1 + y-e),
find a number y >
�
s
�
provided that x is taken sufficiently large. We again apply lemma 7.2.2 and see thatf(z) is an entire function whose order p cannot exceed 1 + (y - s) - 1 • Since s is arbitrary, we see that p � 1 + y - 1 < 1 + ex - • But then M(r ; f) � exp and we see from lemma 7 .2.3 that lim inf T2 {x) � 1 + y > 1 + ex . (7.2. 17)
1 (r1 +"-1) ,
4
We also see from (7. 2 . 1 ) and (7. 2 . 5 ) that T1 (x) (7 .2. 1 8) x Ts<x> - < 1+ . Since ex and r are finite and positive , (i) implies that lim inf =
� 00
T1 (x) is finite
and positive. Equation (7 .2. 1 8 ) indicates that this is only possible if (7.2. 1 9) lim inf T2 (x) = 1 + ex.
6
Relation (7 .2. 1 7), derived under the tentative assumption (7. 2 . 1 ), con tradicts (7.2. 1 9), so that necessarily (7 .2. 1 5 ) is valid and p = 1 + ex - t, as stated in the theorem. Since is only subject to condition (7.2. 13) but is otherwise arbitrary , we deduce easily from (7.2. 1 5) that (7 .2.20) 7:1 � 7:. We show, again by an indirect proof, that the inequality sign in (7 .2.20) leads to a contradiction. Suppose therefore that r ' < r. Then there exists a r ' ' such that r' < r ' ' < r and M ( f) � exp ( 7:" for sufficiently large The last inequality has the same form as (7.2.8). We use the reasoning which led from (7.2.8) to (7.2. 1 1 ) and see that
k
r.
r1 +cx-1)
r;
( ex/ r " ) \1. ( ex/r) . . h��f Tl (x) � > {1 + {1 + This contradicts assumption ( i) of the theorem, so that r ' = 1: and the proof is completed. It is also possible to derive conditions which assure that a distribution function has an entire characteristic function of a given order greater than 1 and of intermediate but unspecified type, or of maximal or minimal type.
ocy +cx
oc)H"' . r�-
209 Theorem 7.2.5. The distribution f nction F(x) has an entire characteristic u function f(z) of order 1 + cx- 1 (ex > 0) if, and only if, the following two con ditions are satisfied: (i) lim inf T2 (x) = 1 + oc (ii) T(x) > 0 for all x > 0 . In view of theorem 7.2.4 it is clear that the conditions are necessary. To prove that they are sufficient, we note that (i) implies that T(x) � exp ( x1 + e< - e) fot' any > 0 and sufficiently large x. Using the argument which we employed in the proof of theorem 7.2.4, we can show that f(z) has order 1 + cx. - 1 • Theorem 7.2.6. The distribution function F(x) has an entire characteristic function of order 1 + cx- 1 (ex > 0) and of minimal type if, and only if, the following three conditions are satisfied: (i) lim inf T2 (x) = 1 + ex (ii) T(x) > 0 for all x > 0 (iii) lim T1 (x) exists and lim T1 (x) = + Theorem 7.2.7. The distribution function F(x) has an entire characteristic function of order 1 + cx- 1 (ex > 0) and of maximal type if, and only if, the following three conditions are satisfied: (i) lim inf T2 (x) = 1 + ex (ii) T(x) > 0 for all x 0 (iii) lim inf T1 (x) = 0. ANALYTI C CHARACTERISTIC FUNCTIONS
s
-
oo .
x---+ oo
>
It is also possible to obtain results concerning distributions whose characteristic functions are entire functions of order 1 . The method of proof is similar to that used in proving theorem 7.2.4. We therefore list here only the relevant results.
Theorem 7.2.8. 1The distribution function F(x) has an entire characteristic function of order and maximal type if, and only if, (i) T(x) > 0 for all x > 0 (ii) lim T2 (x) exists and lim T2 (x) = Theorem 7 .2. 9 . An entire function of order 1 and minimal type cannot be a characteristic function. +
oo.
,_rhe ]ast theorem is only a reformulation of a result from the th eory of en tire functions which asserts that a non-constant entire function of at
210
CHARACTERISTIC FUNCTIONS
most first order and minimal type cannot be bounded on some line [ see B. Ya. Levin ( 1964) , p. 5 1] . For a detailed proof of theorems 7 .2.5 to 7 .2.9 we refer to B . Ramachandran ( 1962). Order and type of entire functions provide means of studying their growth. This study can be refined by introducing proximate orders and types with respect to proximate orders [ see e.g. Levin ( 1964), pp. 3 1 :ff. ] . It is also po3sible to investigate the behaviour of characteristic functions having given proximate orders. For these studies we refer the reader to H. J. Rossberg (1966), (1 967a), (1 967b ). We finally remark that there exist entire characteristic functions of infinite order. Let f ( t ) be an arbitrary characteristic function ; it follows from lemma 5 .4. 1 that exp [f( t) - 1] is also a characteristic function. We define the sequence of functions f( t) /(1) ( t) (7.2 .21) f
{
=
(n
n
7.3
Criteria for analytic characteristic functions In Chapter we discussed various criteria for characteristic functions. We have seen that the necessary and sufficient conditions developed by Bochner, Cramer and Khinchine are not easily applicable. It is therefore desirable to derive less general results which are applied more readily. These results are usually restricted to certain classes of functions ; in this connection the problem arises whether it is possible to characterize those functions which are regular in a (complex) neighbourhood of the origin and are characteristic functions. This problem is still unsolved, but a number of results , giving sometimes necessary and so1netimes sufficient conditions for analytic functions to be characteristic functions, were found. The present section deals with these criteria. In some instances we only mention conditions and give appropriate references, but a very important criterion for a class of entire characteristic functions will be studied in detail. We note first that some of the results treated in Section 7 . 1 can be re garded as criteria for analytic characteristic functions. 'l.,hus theorems 7 7 . 1 .2 and thei r corollaries give necessary conditions which a function
.1.1 ,
4
2 11
ANALYTIC CHARACTERISTI C FUNCTIONS
regular in a neighbourhood of the origin must satisfy in order to be a characteristic function. The same is true of theorem 7. 1 .4 or of P. Levy's result (theorem 7. 1 .3) that a non-constant entire function of finite order must have at least order and must have infinitely many zeros if its order is equal to It is easy to establish a condition similar to the one listed in theorem Let be an analytic characteristic function ; then
1
1. 4.1.2. f (z) Re [f(iy) - f(t + iy)] = I : "' e - ( 1 - cos tx ) dF(x) "' 2 e - ( 1 - cos 2tx)dF(x). � � J "'"' e - sin txdF(x) = 1 I "' '""
��
Therefore
11'"
[f(iy)- f(t + iy)]
[f(iy) - f(2t + iy)] .
Re ?;: l Re We iterate this procedure and obtain the following result :
Theorem 7.3.1. Let n be a non-negative integer; the inequality 4 -n Re [f(iy)- f(2n t + iy)] Re [f(iy) - f(t + iy)] is then satisfied for every analytic characteristic function f(z), provided that the point = iy is in the interior of the st1�ip of regularity off(z). ?;:
z
The ridge property gives an upper bound for the values of an analytic characteristic function along a line which is parallel to the real axis and is located in the interior of the strip of regularity. It is also possible to derive a lower bound for the values of an analytic characteristic function along the imaginary axis in the strip. Let be an analytic characteristic function which has the strip - ex < Im < {J as its strip of regularity (ex > 0, {J > 0, z = Since
f(z) (z)
t +iy).
"'
1 - f (�} = I "' [ 1 - e- vx/2] dF (x) we conclude from Schwarz ' s inequality that i y )2 I\ � I - oo [ 1 - ze - vx/2 e- yx] dF (x) ! ( 1 00
or
n,
I
[!(�)T � f(iy )
+
( - ex < Y < {3).
We apply this inequality repeatedly and see that for any positive integer
(7.3.1) f(iy) � [t(t)Tn
( - ex < Y < fJ).
212
CHARACTERISTIC FUNCTIONS
7.1.2 that log f(z) is defined in - Im z {3. It is easily seen log f(z) � �� (iz)i,
It follows from the corollary to theorem rx a region which contains the segment that in this region =
00
j=l
<
<
J.
K1 is the cumulant of order j. We then have zn log [1(;)] = - Y Kt + fo 2( j�)i zn�� t > yi. We combine the last equation with the inequality (7 . 3 . 1), and letting n tend to infinity we see that log f(iy ) -yK1 or f(iy) � e p ( - yK1) . where
�
x
We therefore obtain the following result :
Theorem 7.3.2 . Let f(z) be an analytic characteristic function which has the strip Im (z) = y f3 as its strip of regularity . Then f(iy ) exp (-yK1),providedthat y f3. Here K1 = i- 1f '(O) is the cumulant of order 1 (first moment) of the distribution corresponding to f(z). Theorem 7.3 .2 is also a necessary condition which an analytic characteristic function must satisfy. It will be used in Chapter 8. We next discuss a sufficient condition which is applicable to certain analytic functions. Let () be a real number ; the function [ 1 -(it/0) ] -1 is always a charac - �
<
<
- �
<
<
�
teristic function (it belongs either to an exponential distribution or to the conjugate of such a distribution) . Since the product of two characteristic functions is always a characteristic function, we see that the reciprocal of a polynomial which has only purely imaginary roots is always a characteristic function. It follows from the continuity theorem that the reciprocals of canonical products<*> of genus zero or 1 which have only purely imaginary roots are characteristic functions. Necessary conditions for rational functions were given by E. Lukacs-0 . Szasz ( 1 954a) and for reciprocals of the last paper also contains a necessary polyno1nials by K. Takano and sufficient condition for the reciprocals of polynomials of degree not exceeding Sufficient conditions for a special class of rational functions are given by E . Lukacs-0. Szasz 9 b and by A. Zemanian ( 9 , ( 1 961). The most important result concerning criteria for analytic characteristic functions refers to a class of entire functions which we now introduce.
3.
< =Kc> Sec rritchtnarsh ( 1 939),
(1951);
(1 54 )
p . 250 .
1 59)
213
ANALYTIC CHARACTERISTIC FUNCTIONS
It is convenient to adopt the following notation for iterated exponential functions : = = exp =
e1 (z) ez, e2 (z) ee1(z> , . . . , ek (z)
Our object is to derive the following theorem :
[ek- t (z)].
Theorem 7.3.3. Let v=O be a polynomial of degree m > 2 and denote by fn (t) = Kn en [P(t)] where K;; 1 = en (c0) . Then fn ( t) cannot be a characteristic function. The constant Kn is determined by the fact that every characteristic function equals 1 for t = 0. A particular case of theorem 7.3.3 is of great interest and is quite often useful. If we put n = 1 in theorem 7.3.3 , then we obtain the following corollary :
Corollary to theorem 7.3.3 (Theorem of Marcinkiewicz). Let Pm (t) be a polynomial of degree m > 2 and denote by f(t) = exp [Pm (t)]. Then f(t) cannot be a characteristic function. The corollary to theorem 7.3.3 was first given by J. Marcinkiewicz ( 193 8) and is therefore frequently called the Theorem of Marcinkiewicz.
It is often useful and has been applied by many authors in studies con cerning the characterization of the normal distribution. Marcinkiewicz derived his result in a different manner ; he obtained it as a special case of a more general theorem (see theorem which will be discussed later. We introduce first the following notation which will be used throughout the proof of theorem Let
7.3.3.
7.3.4)
cp1 (z) = v=l cv zv denote a polynomial of degree m without constant term and with m 0. coefficients c h c 2 , . . . , cm are arbitrary, real or complex, numbers. J )cfine the real functions cx1 (t, y ) and {3 1 (t, y) as tl1e real and imaginary p arts, respectively, of c/J 1 (z) so that c/J 1 (z) = cx1 (t, y) + i{31 (t, y ) where t-1- iy . Moreover define A 1 (t,y) = cx1 (t,y)-cx (0, ). y 1 + £flv ( = 1, 2, . . . , m ; cxv, flv real) and obtain for the write cx , 1 p olynotnial c/> 1 ( ) the expression (cxv � 1 , i{J1,) (t I" i_yy'. (7.3 .2) q> t ( ) = � m
�
C
rhc
.�
v
�:;::
We
C,11
z
==
z
� 716
ti HII l
=1=
21 4
CHARACTERISTIC FUNCTIONS
( t + iy) according to the binomial theorem and get (t+ iy)2v = ( - 1)v y2vt±o(��) ( �! 2Y - i; k±1 (ziv 1 ) ( �!2y -1} and l 7c1 -t 2 ) )( ± {� 1 1 1 v(t+ iy)2v- = { - 1) y2v y (2vk - 1 y2 2 ) 1 v +<�: e 2k ( �!2Y} We note that the expressions in the braces are functions of tjy and see that they contain certain polynomials in t /y • It is convenient to introduce 2 2 formally these polynomials. We denote by / s [ 1 s 2 (7. 3 .3) v. m = k�1 (2k)( - �)k-t for s � 2 and V1(�) 1 s + 1) ] ] [ ( s 1) / [ ( s s / 2 2 (7.3 .4) = k� (2k - 1 ) ( - �) k -1 = k� (2k + 1 ) ( - �)k W. (�) O 1 for s � 1.
We expand the powers of
Tc = l
=
The symbol [x] denotes here, as usual, the greatest integer contained in x. In this \vay \Ve obtain
(7.3 .5)
(t + iy)2V = ( - l )v y2V { [ t - ;: v2v (;:)] - i; w2 ,( ;:)} (t+ iy)2v -1 = ( - 1 )�-- 1 y2v- 1 {; W2v_ 1 ( ;:) + { 1 - ;: V2v- 1 (;:)] }
We write in the following (7.3 .6)
and obtain from (7.3 .5) and (7 .3 .6) by means of elementary computations (7.3 .7)
{( - 1)1!•Hl/2ly. [1 -;: v. ( ;:)] +( - 1)1•12lb. ; w. ( ;:)}y• +i{( - 1)[(s-1l/2ly8 � W8 (;:) +( - 1)1•12lb8 [ 1 - ;: V8 ( ;:)] } y• for s = 1 , 2, . . =
.
, 1n .
ANALYT IC CH ARACTERISTIC FUNCT IONS
t,
t,
215
The last formula permits the computation of ext ( y) and of f3t ( y) ; one obtains immediately
(7.3 .8)
t /2] Y 1 - t : V8 ( t : s < ( + y 1 )] > s[ 01: 1 (t, y) = �t { Y Y s= + { )[s/21 bs ; W. (;:) } y• -1
and
{Jl (t, y) = s=�t {< - 1 y(s- 1)/21 Ys Y!_ W. (Yt :) + ( - 1 y•/21 b . [ 1 - ;: v. ( ; : )]} y • . Since At (t, y) = cx1 (t, y) - ext (0, y) we obtain from (7.3 .8)
(7.3 .9 )
(7.3 . 1 0)
; ( ;:)}
;: ( ; :)
{
v y. vv A 1 (t, y) = � ( - 1 )Hv - 1l/2l yv + ( - 1 )[v/21 bv wv v 1 We introduce a new variable � = (t2jy2) (� � 0) and write t v v Av {�) = { - 1 y ( - 1 ) /21 Yv � Vv ( � ) -� { - 1 y /21 �v � /2 Wv (�) (7.3 . 1 1 ) v Bv (�) = ( - 1 Y( - 1)/2] Yv �l/2 Wv (�) + { - 1 Yv/2l �v [1 - � Vv (�)] ; with this notation( t ) we have
{
(7.3 . 1 2)
fJt [y V�, y] =
v
� Bv (�)y . m
v= t For the proof of theorem 7.3 .3 we need several lemmas and formulate next the following two statements concerning the coefficients of the highest power of y in the polynomials A t [y v'f, y] and f3t [y V�, y] .
Lemma 7.3 . 1 . Let m 4; then it is possible to find a real number �m > 0 such that Am (�m) > 0 while Bm (�m) 0. Lemma 7.3 .2. Let m = 3 and 0; then there exists a �� > 0 such that = 0 then there exists a A 3 (�;) < 0 and B 3 (��) 0. If m = 3 and �� > 0 such that A3 (��) > 0 and B3 (��) 0. �
=I=
=I=
?'s
y3
=1=
=1=
y3
In order to prove these statements we study the polynomials V8 (�) and W8 (�) and show that they can be expressed in terms of Chebyshev poly notnials or trigonometric functions of an auxiliary variable. ('t) f1'1 is here II
nnd in the
following the positive square root of e.
216 We consider the expression (1 +i v� ) s, where s is a positive integer and I � I < n /2. Then � 0, and se � = arc tan v� with (7.3.13 ) (1 + i v�) s = (1 + �)s/2 (cos s� + i sin s�). For s 2 we expand (1 + i v� ) s according to the binomial theorem and obtain (7.3 .14) ( 1 + i v�)s = 1 -�Vs (�) + i WWs (�) . We note that (1 +� ) 812 = (cos �) - s and get from (7.3.13) and (7. 3 .14) 1 - �V. (�) = (cos sf)!(cos cfo)• = (1 + �)•12 T. ( v'(l\ �)) (7.3.15) WW. (�) = (sin scfo)/(cos cfo)" = (1 +�)·12 Us-1 ( v'( l\ �)) where T8 (x) = cos (s arc cos x) and Us - 1 (X) = sin (s arc cos2 x) v'(1 -x ) CHARACTERISTIC FUNCTIONS
�
t
�
are the Chebyshev polynomials of the first and of the second kind re spectively. We introduce for the sake of brevity the notation y<m - 1 )/2] = { {) )[m/2 ] = and express the functions and If in terms of the variable we write = tan 2 � tan 2 = = Bm (tan 2 then we get from and sin cos r =
(7.3.16) {Y ( -- 11 �m Ym �Am (�) Bm (�) � (7.3.17) C(�) Am ( �) D(�) �), (7.3.11), (7.3 .15) (7.3.16) m� +� (7. 3 .1 8 ) C(�) [ 1 _ {COS m� �)mJ {COS �)m (7.3.19) D(�) = y {CsinOS mcfo�)m + {CcosOS mcfo . m �) We next prove lemma 7.3.1 by showing that it is always possible to find a �0 such that C(�0) > 0 while D(�0) 0. We give the following rules for the selection of � 0 : (I) If y > 0 and � 0, select �0 so that nj2m < �0 ' < njm while tan m�0 �jy . (II) If y > 0 and � < 0, select �0 so that njm < �0 < S nj4n-t while tan m�0 - fljy. {)
=1=
� =I= =I=
217 (III) If y = 0 and � > 0, select �0 so that nj2m �0 njm. (IV) If y = 0 and � 0 , select �0 so that njm �0 5nj4m. (V) If y 0, select a value �0 which satisfies the following three conditions : 2n n (a) m �o m (b) tan m�0 -�/m y, {c) h(�0) = y( cos �0- cos m�0) +� sin m�0 > 0. We must still show that it is possible to select �0 in case (V) so that condition (c) is satisfied. We first observe that h( �) = y( cosm � - cos m�) in m� is a continuous function and that h(2njm) > 0. Hence the +� s function h (�) is positive in some neighbourhood of � = 2njm, so that a selection in accordance with (c) is possible. The assumption em 0 implies that y and � cannot vanish simul taneously, so that our selection rule covers all possibilities. Using this fact as well as the assumption m ;:::: 4, it is easily seen that the value �0 whose selection we have just described satisfies the conditions C(�0) > 0 and D(� o) 0. But then it follows from (7.3.17) that �m = tan 2 � 0 satisfies the assertion of lemma 7.3 . 1 . We next prove lemma 7.3 .2. We see from ( 7 .3 .11) that A 3 (�') = - 3y3 �' - �3 V(�')(3 - �' ) B3 (�') = - r3 v(�')(3 -�')- �3 (1 - 3 �'). If y 3 0 and y 3 �3 0 we choose �� > 3, and if y 3 !5 3 ;:::: 0 we choose 0 �� 3. If y3 = 0 and< �3 > 0 we select �� > 3 ; if �3 0 we select 0 �� 3. Obviously it is possible to select �� in agreement with this rule so that B 3 ( ��) 0. This completes the proof of lemma 7.3.2. In the following we assume that m ;:::: 3 and choose �m and �� in accord ance with lemma 7.3.1 and 7.3.2 respectively. We write (7.3.20) Av = Av (�m), Bv = Bv (�m) and obtain from ( 7.3.12) (7.3.2 1) A 1 [yy(�m), y] = Am ym + Av yv. Now let m 4 ; then A I [Y v(�m), y] = Am ym [ 1 + o( 1)] as y We see from lemma 7.3.1 that Am > 0, so that A 1 [ y v( �m) , y] is positive sufficiently large positive values of y . We consider next the case m = 3 and write = sgn y = y!I y I · We choose so that ey3 0. Then A 1 [ y v'(�:; ) , y] = A3 s! y i 3 +- A2 y 2 + A1 s! y l = A 3 ei Y I 3 [ 1 + o(1)] Iyj ANALYTI C CHARACTERISTIC FUNCTIONS
-
<
<
=I=
-
<
<
<
<
<
<
,
=1=
=I=
<
<
=I=
<
<
<
<
=I=
�
m-1
;::::
v=l
fo r
s
<
� oo .
s
as
��
>
oo .
21 8
CHARACTERISTIC FUNCTIONS
We know from lemma 7 . 3 .2 that sA 3 > 0, so that A1 [y v'�;, y] becomes positive if the sign of y is opposite to the sign of y 3 and if I y is sufficiently large. We summarize our findings in the following statement :
I
Lemma 7.3 .3A. Let m 3 and suppose that one or the other of thefollowing two conditions is satisfied: (i) m > 3 or m = 3 and y 3 = {1 3 = 0 (ii) m 3 and y 3 = {3 3 0 . Then there exists a �m 0 and an A > 0 such that A 1 [ y v�m' y] = A I y lm [ 1 + o(1 )] where the estimate holds in case (i) as y -+ oo , but in case (ii) as ( - sgn y )y oo . Then there exists also a value Y = Y ( m) such that A1 [y v�m ' y] > 0 provided that in case (i) y Y while in case (ii) one must require �
=
=I=
�
3
-+
�
( - sgn Ya) Y � 1T. The chief instrument in the proof of theorem 7.3.3 is the following lemma :
Lemma 7.3 . 3 . Let () be an arbitrary real number. If 3 , then it is possible to find real numbers �m 0 and y* such that for t* = y* V�m and some integer g1 the relations A1 (t*, y*) > 0, {1 1 ( t*, y*) - 2g 1 n = () are satisfied. m
�
�
To prove lemma 7. 3 . 3 we must study the function (31 (t, y ). We choose again �m in accordance with lemmas 7.3 . 1 and 7.3 .2 respectively and con sider the polynomial v=l
Here Bv is given by (7.3 .20). Let Y be the number determined by lemma 7. 3 . 3A ; since Bm =1= 0 we conclude from (7 .3 .22) that B( y) = Bm ym [ 1 + o( 1 )] as I Y I -+ 00 . This means that B( y) is monotone if y is sufficiently large. We can there fore find a Y0 > Y such that B( y) is monotone for I y I � Y0• In view of lemma 7.3 .3A it is always possible to find a real y 0 such that I Yo I > Yo and A 1 [ y o V �m ' y0] > 0. Let () be an arbitrary real number, then there exists an integer g such that 0 -J- 2ng � B( y 0) < 0 + 2n(g + 1).
ANALYTIC CHARACTERISTIC FUNCTIONS
219
yy0 0 y y, B(y) y1 B(y1) y1 B(y1) y1 0, y1 ! A1 [y1 y1] 0, B( y1) - {31 [ y1 y1] .1. y* y 1 t* y1 y
We consider from now on only such values of for which > and l I � l Y o I · For such values of is either monotone increasing or monotone decreasing. In the first case we can find a real number such for which that = () + 2(g + 1 )n ; in the second case there exists a == 0 + 2gn . Since I we see from lemma � I Y o I and Y o > V�m' V�m ' () is an 7.3 .3A that > while () = integer multiple of 2n. To complete the proof of lemma 7. 3 . 3 we need only put an�. = v'�m· We are now ready to prove theorem 7.3 = Let
v= O be a polynomial of degree m > 2 ( 0) and K;; 1 = en (c0). We carry an indirect proof of the theorem and suppose therefore that In (t) == Kn en [P(t)] is a characteristic function. The function In ( t) agrees for real values of with the function A (z) == Kn en [P(z)] so that it is an entire characteristic function. From now on we consider this characteristic function also for complex values of the argument = t + iy and apply the ridge property (theorem em
=I=
z
z
7 . 1 .2) of analytic characteristic functions. This theorem indicates that necessarily
(7 • 3 • 23 )
t
R( Y ) =
t,
ln (t +iy) "' fn (iy)
� l
for all real and y. We now introduce the functions (7. 3 .24) == ( v == 2, where == and note that ) and that = exp We obtain easily from definition (7.3 .24) of the functions the recursion formula (7. 3 .25) = exp ( = 2, . . . , n). We now introduce the functions ( 7 .3 .2S a) = ) ( = 2, 3 , and write for the imaginary part of for the real part, cp1, (z) , so that ( 7 .3 .25b) = ) ( = ·
Kv [ev (c0)] - 1 (O) 1 1, . . . , n l v 11 (z) l (z)[4>1 (z)] . v {Kv-\ [lv- l (z) - 1 ]} v lv (z) ...,n . c/Jv(z) Kv!1 [ lv- 1(z)- 1 ] v rt.v (t, y) fJv (t, y) 4>v (z) rt.v (t, y) + if3v (t, y) v 1, 2, . . . , n (7 . 3 .2S c) lv (z) = exp [c/>v (z)] (v = 1 , 2, . . . , n) . (7 .3 .26) � (p1, iit.,,) ( == 2, . . . , n ) . Hnd
We set
K;- 1
cxp
-1-
·v
220
CHARACTERISTIC FUNCTIONS
v-\ = ev- l (c0) we see that K:;; 1 = exp (Kv \) or exp (Pv + i.Av ) = e 2 ( Pv- t + iAv- t ) , therefore (7.3 .27) Pv + iAv = exp (Pv- t + i.Av_ 1 ) + 2gv ni where gv is an integer. It follows from (7 .3 .27) that (7. 3 .28) Av = exp ( Pv -t) sin A v -1 + 2gv n. We combine (7.3 .2S a), (7 .3 .2Sc) and (7.3 .26) to get �v (z) = exp [pv -1 + iAv -1] {exp [cxv -1 (t, y) + iPv -1 ((t, y)=] 2,- 13}, Since K
v
)
. . . , n .
We separate real and imaginary parts in the last formula and obtain re cursion formulae for and cos (7.3 .29a) = exp [Pv -1 - exp (Pv - 1 ) cos (v = 2, 3 , . . . , n) (7.3 .29b) sin = exp [Pv -1 - exp (Pv - 1 ) sin (v = 2, 3 , . . . , n) . We now define the functions y) (v = 1 , 2, . . . , n ) = and see from (7 .3 .29a) that (7.3 . 30) = {exp COS [Av-1 + exp [Pv -1 + (0 , - cos (0 , v = 2, 3 , . . . , n . We apply lemma 7.3 .3 and select e = A 1 • Then it is possible to find a pair such that of real numbers (7. 3 .3 1 ) A1 >0 while (7.3 .32) = 2g1 n (g 1 integer). We show next that a similar relation holds for all functions fJv namely = 2gv n ( 7.3 .33) where are the numbers determined according to lemma 7.3 .3 and used in (7.3 .3 1) and (7.3 .32) ; is given by (7.3 .28 ) and gv is an integer. We prove (7.3 . 33) by induction. Formula (7.3 .32) indicates that (7. 3 . 3 3) is valid for v = 1 ; we suppose now that it holds for all subscripts inferior to v. We then have in particular = 2g n . Substituting this into (7 .3 .29b) and using (7 .3 .28) we see that sin = - exp = - Av + 2gv n . r-f hus (7. 3 .33) is generally valid.
rxv (t, y) Pv (t, y): + (Xv -1 (t, y)] A [Av -1 + Pv -1 (t, y)] (XV (t, y) v -l + rxv -t (t, y)] A [Av -1 +Pv -t (t, y)] Pv (t, y) v -l Av (t, y) rxv (t, y) - rxv (O , Av (t, y) [Av -1 (t, y)] y) Pv -1 (t, y)rx] - 1 y)] [Av -1 + Pv -l ]} ( v ) t* , y* (t*, y*) P1 (t*, y*) + A1 (t, y,) Pv (t*, y*) + Av t*, y* Av Pv -1 (t*, y*) + Av -1 v -l (Pv -t) Av -l Pv (t*, y*)
221
ANALYTIC CHARACTERISTIC FUNCTIONS
We see from (7. 3 . 30) and (7.3 .33) that A ( , * ) = {exp
[Av_1 (t*, y*)] - cos [Av -t + f3v -expt (O, y*)1]}+ {0, y*) [ v - !Xv -1 ] for v = 2, 3 , . . . , n. From this formula we see that the relation Av -1 (t*, y*) > 0 implies that Av (t*, y*) > 0. We can therefore conclude from (7.3 .3 1 ) that {7.3 .34) An (t *, y*) > 0 . We defined earlier the function R(t, y) as fn ( t + i ) . R(t' Y) = v t* y
X
P
y
fn ( iy) it follows from (7.3 .25b) and (7. 3 .25 c) that ( = exp {An ( We have therefore determined a pair of real numbers such that (7.3 . 35) ) > But this contradicts (7. 3 .23) which must be satisfied if fn ( ) is a charac teristic function. This contradiction completes the proof of theorem 7. 3 .3 since it shows that fn ( cannot be a characteristic function if m > 2. In the case where m � 2 the iterated exponentials fn ( ) = n can be characteristic functions. The function f1 ( ) = exp where {2 a1 and are both real, � 0, is a characteristic function (of a normal or of a degenerate distribution). It follows from the recursion formula (7.3 .25 ) and from lemma 5 .4. 1 that fv (z) as defined by (7.3 .24) is a charac teristic function for all values of v . We note that for m == 1 and 1 = we obtain for n == 2 a Poisson distribution and for == 3 a Neyman type distribution , fa ( ) = exp {,u exp We have already mentioned that Marcinkiewicz derived a particular case of theorem 7. 3 .3 in a different manner. He obtained it as a special case of a 1nore general theorem which gives a necessary condition which an entire function of finite order must satisfy if it is a characteristic function. We n ow state this theorem of Marcinkiewicz. '
R t, y) R(t*, y* 1. t)
a2
a2
n
t
t, y) }.
t
t*, y* t
t e [P(t)] [ - a2 + ia1 t]
c 1 A [ (A(eit _ 1 )) - 1 ] }.
An entire function finite order whose exponent of to1l7)ergence is less than cannot be a characteristic function. '/,heorem 7.3 .4. of p > 2 p1 p l n the proof of theorem 7.3 .4 we use a number of theorems from the theory of functions of a complex variable. The results needed may be fo und, for i nstance, in Copson (1 935), pp. 1 65-175 .
222
CHARACTERI STIC FUNCTIONS
Letf(z) be an entire function of finite order p. By Hadamard ' s factoriza tion theorem we can write f z) in the form (7.3 .36) f(z) = G (z) exp z) where (z) is the canonical product of the zeros of f(z) and where H (z) is a polynomial of degree m � p. We denote by p1 the exponent of con vergence of the zeros of f z) ; it is easily seen that p = max (p1, m) . If p1 < p then necessarily p = m. It is known that the order of a canonical product equals its exponent of convergence. Let (z) be a canonical product of order p1 ; then for any s > 0 the modulus I (z) I � exp z IPl + provided that I z I is sufficiently large. We will also use the following result which is due to E. Borel. If (z) is a canonical product of order p1 and if s is an arbitrary positive number, then there exists an infinite number of circles of arbitrarily large radius on each of which the inequality I ( ) I > exp ( - I z I Pl + e) holds. Let z = and denote by r = z I = We see then that there exist arbitrarily large values of r such that I I > exp ( - rP 1+ e). On the other hand we know that for arbitrary s > 0 and sufficiently large I � exp (rPl+e). We combine the last two inequalities and see that there exists an increasing sequence {r�c} of positive real nun1bers such that lim rk = oo
(
G
[H ( ]
(
G G
[I
�],
G
Gz
Vt 2 +y 2 •
I
t + iy
G(t + iy) G (iy) I
k-+ 00
which has the property that for arbitrary
y
s
> 0 and sufficiently large k
Rl (t, y) cg(;:{) > exp ( - 2r�1+8) provided that t 2 +y 2 r�. We consider next f2 {z) = exp [H(z)] and write (7. 3 . 3 8) R2 (t, y) = I exp [H(t + iy) -H (iy)] I so that i f(t y ) + (7.3 . 39) R(t, y) f(iy) = R1 (t, y) R2 (t, y).
(7. 3 . 3 7)
=
=
=
I
We give an indirect proof for theorem 7.3 .4 and assume therefore that f(z) is an entire characteristic function of order p > 2 and suppose that the exponent of convergence p1 of the zeros off (z) is less than p, Pi < p. We again apply theorem 7 . 1 .2 and see that necessarily � 1 for all real and
(7.3.40) R(t, y) t y.
223
ANALY TIC CHARACTERISTIC FUNCTIONS
p1 p
p 1n, H(O) �1 (z) = H(z) = R2 (t, y) = exp [A 1 (t, y)] .
< Since we have = where m is the degree of the polynomial = 0 (since f( O) = and use the notation of We see also that the preceding proof and write
H(z).
1)
� (rxv v=l m
v
+ if3 )z v
so that (7.3 .41 ) We see then from (7.3 . 37), (7.3 .39) and (7 .3 .41) that there exists an infinite sequence of indefinitely increasing positive numbers such that for an arbitrary s 0 > exp [ - 2 �1 + e + A1 (7.3 .42) provided that k is sufficiently large and that = We next define an infinite sequence of points in the z-plane. In order to be able to apply lemma 7.3 .3A we subject these points to the following restrictions : (i) = (ii) 1 1 = 0 (iii) if m 3 or m = 3 while ?' a = f3 a = 0, then (iv) if m = 3 and ?'a = f3a =I= 0, then { - sgn ?'a) 0. From (i) and (ii) it is seen that all these points are located in the same We deduce from lemma 7.3 .3A quadrant and that I I = that (7.3 .43) = A + o(1)] as k -+ oo where 0. We denote by Ql = and obtain from (7.3 .42) and (7.3 .43 ) as k � oo. exp { - 2 r�1 + e + Qlr� ) Since by assumption = m > we can choose the arbitrary positive quantity s so that s < m . We conclude from the last inequality that exp {Qlr� as /� � oo. Since Q( 0 we can determine k so large that This, however, contradicts (7.3 .40 ) and we see therefore that f(z) cannot be a charac teristic function and have thus completed the proof of theorem 7.3 .4. In conclusion we mention, without proof, another theorem of this type.
rk
> R(t, y)
(t, y)]2, 2 t +y r�. (tk, yk)
t1c Yk V�m t1c + iyk rk >
yk > yk >
Yk rlc/ v(1 + �m) · 1 (tk, y1,) .Aj Y1c Jm [ 1 A> A(1 +�m)-m1 2 [1 + o{ 1 ] } R(tk, yk) > p p1 , p1 + R(tk, yk) > [1 + o(1 )] } > R(tk, yk) > 1.
Theorem 7.3 .5.
Let
Pm (t) = � be a polynomial of degree The function f(t) = exp [lt1 (eit _ 1) +A2 (e - it _ 1) + Pm (t)] i f , and onl is haracter tic function i f , lt 0, lt 2 0, y 1 P1(t) = (it)-a2t 2 where a1 and a2 are real and a2 0. m
m.
a
c
a1
is
v=O
Cv l
v
�
�
�
m
� 2
and if
224
CHARACTERISTI C FUNCTIONS
This theorem contains again as a special case the theorem of Marcin kiewicz (corollary to theorem 7.3 .3). Marcinkiewicz ' s theorem is obtained by putting = = 0. For the proof, which is similar to the demonstra tion of theorem 7.3 .3 , the reader is referred to Lukacs ( 1 958). Several authors have discussed related necessary conditions for entire or meromorphic functions to be characteristic functions. These conditions can all be considered to be extensions of Marcinkiewicz ' s theorem. I . F. Christensen ( 1962) studied functions of the form
A1 A2
j(t) = Kn g(t) en [Pm (t)] ,
g(t)
where is a characteristic function subject to certain restrictions. R . Cairoli (1 964 ) investigated similar problems for meromorphic functions of finite order. H. D . Miller (1 967) studied entire functions of the form or {exp }, where and are entire functions {exp while is a polynomial. The method in all these cases is similar to that used in proving theorem 7. 3 .2 ; the principal tool is the ridge property (7 . 3 .44) 1� which is valid for all y if is an entire characteristic function. <*> Far-reaching generalizations of Marcinkiewicz ' s theorem were obtained by I . V. Ostrovskii (1963 ). His work is based on a careful study of entire functions which belong to families characterized by the following in equalities : (7.3 .4Sa) � < oo) ( - oo < (7.3 .4Sb) � ( - oo < , y < co ) It is easily seen that the class described by (7 .3 .4Sb) contains the class described by (7.3 .45a) which in turn is wider than the family of ridge functions. The basic results of Ostrovskii ' s paper are theorems on entire functions belonging to these classes. These theorems are interesting on account of their applicability to the theory of characteristic functions. The reasoning which yields these results on entire functions is tedious, and the discussion would exceed the scope of this monograph. We therefore list, as a lemma, only one of Ostrovskii ' s results and also indicate its application .
g(t) f
P ( t)
[P(t)]} f
[P(t)]
g(t) f(t)
l f
l f(t + iy) l M( l y l ; f) Re f(t + iy) M( ! y l; f)
t, y
Lemma 7.3 .4. Let A(w) and b(z) be entire functions and suppose that A(w) does not reduce to a constant. Let f(z) = A[b(z) ] . If the function f(z) satisfies (7.3 .4S a) then b(z) is either a polynomial of degree not exceeding 2 or an entire function of not less than order 1 and of normal type. We deduce from the lemma the following results concerning characteris tic functions :
<*> I.
F. Christensen and R. Cairoli also considered functions which are not entire. However, they had to assume that these functions are regular in a half-plane which con tains the origin in its interior. Inequality (7. 3.44) is then valid in this half-plane.
225
ANALYTIC CHARACTERISTIC FUNCTIONS
Theorem 7.3 .5. Suppose that an entire characteristic function is the f(t) superposition of tzvo functions A(w) and b(z), that is, f(z) = A[b(z)]. Then b(z) is either a polynomial of degree not exceeding 2 or an entire function of not less than order 1 and of normal type. Remark . Theorem 7.3 .2, and therefore also Marcinkiewicz's theorem, are particular cases of theorem 7.3 .5 . Corollary 1 to theorem 7.3= .5 . Let b(z) be an entire function of order 1 and minimal type; thenf(z) exp [b(z)] cannot be a characteristic function . Corollary 2 to theorem 7.3 .5 . Let b(z) be an entire function of order less than 1 , then f (z) = exp [b(z)] cannot be a characteristic function. Corollary 1 answers a question raised by Yu. V. Linnik, while corollary 2 solves a problem posed by D. Dugue. I. V. Ostrovskii ' s paper also contains a generalization of theorem 7.3 .4 .
7.4
Periodic analytic characteristic functions The characteristic function of a lattice distribution which has the origin as a lattice point has the form = � Pv eitrv (7.4. 1)
f(t)
where
r is a real number and
k
�
P v � 0,
� Pv = 1 .
r
Let be an arbitrary integer ; it follows from (7.4. 1) that w = 2nk j is We see therefore that a characteristic function can be a period of a periodic function ; however, a periodic characteristic function is not necessarily analytic. The characteristic functions discussed in theorem 4.3 .2 are examples of periodic characteristic functions which are not analytic. In the present section we discuss briefly the properties of analytic characteristic functions which are single-valued and periodic. We consider first the case where has a purely imaginary period w = real) ; it is then no restriction to assume that > 0. We wish to avoid the discussion of trivial cases and suppose therefore that ¢= 1 . Let - rx < Im < {3, ( ex > 0, f3 > 0), be the strip of regularity of we first show that necessarily � min rx, {3) . We give an indirect proof and assume that < min ( ex , {3) . The points z2 = are then in the interior of the strip of regularity of and i t follows from theorem 7 . 1 .4 that (ir; ) +
f(t).
f(z)
(n
f(z)
f(z)
- in f ( 7 .4. 2) ! (O)
"�''
n
=
,
• ··
f ( i ) n "":i"·· · .
.
in
n
(z)
f(z); <
'V
n
(
z1 = in, f(z)
226
CHARACTERISTIC FUNCTIONS
f
f(O)
On the other hand it follows from the periodicity of (z) that = = ff ( n ) + n ) = 1 so that n )] /2 = 1 in contra ( n) = diction with (7.4.2) . The indirect proof is therefore completed and we have always 'YJ � min (ex, {3) . But the equality sign would imply that the origin is a singular point of (z) so that always n > min ( ex, {3). But then at least one of the inequalities n > ex or 'YJ > (3 holds. If n > ex [respectively n > {3] then (n - ex) [respectively - (n - {3)] is a singular point off(z) located in the upper [respectively lower] half-plane. Therefore n - ex � {3 , and we have established the following result :
f(O)
f( - i
fi
f
i f( - i
i
i
analytic characteristic function has a Theorem 7.4.1. If a non-constant purely imaginary period = in (n > 0), then this period is at least equal to the width of the strip of regularity off(z), that is I I = n � ex + {3. We consider next the case where f(z) has a complex period = � + ir . w
w
w
J
The case � = 0 (purely imaginary period) has just been treated, so that we may assume � =1= 0. Using (7. 1 . 4) and the assumption that w is a period of (z), we conclude easily that w and - w are also periods. Therefore 2� and 2ni are also periods of (z) so that f(2�) = 1 . ( 7.4.3) We conclude then from theorem 2. 1 .4 thatf(z) is the characteristic function of a lattice distribution whose lattice points are the points where 1 - cos 2�x vanishes. Therefore (z) is given by
f
f
f
(7.4.4)
f(z) =
i s
s = oo
� P s exp ( zn /�)
s = - oo
where (7 .4.5)
P s � 0,
f
00
� Ps = 1 . 8 = '-
00
If n = 0, then (z) is simply periodic and has a real period � ' so that = f(�) = 1 , and we see by the same argument that it can be written as
f(O)
(7.4. 6 )
f(z) =
00
� s = - oo
is
P s exp (2n z /�)
where the P s satisfy again (7.4.5). If n =I= 0 thenf(z) is given by (7.4.4) and is a doubly periodic function which necessarily has a real and also a purely imaginary period. We summarize this in the following manner :
Theorem 7.4.2. An analytic characteristic function which is single-valued and simply periodic has either a real or a purely imaginary period. The period is real if, and only if, the characteristicfunction belongs to a lattice distribution which has the origin as lattice point. Let f ( z) be an entire characteristic function which does not reduce to a a
constant and assume that it is periodic . From theorem 7 . 4. 1
we
see that it
227
ANALYTIC CHARACTERISTIC FUNCTIONS
cannot be doubly periodic, and we can conclude that it must have a real period and have the form
(7.4.6). Theorem 7 .4.3 . If a characteristic function is an entire periodic function then it is necessarily the characteristic function of lattice distribution which has the origin as a lattice point. a
It is easy to give examples of analytic characteristic functions which are periodic. We mention the Poisson distribution whose characteristic function has the real period 2n ; the distribution with frequency function = cosh (nx/2) ] - 1 has the characteristic function f(z) = 1 /(cosh z) which is regular in the strip Im (z) < n/2 and which has the purely imaginary period 2ni. A doubly periodic characteristic function was constructed by M . Girault ( 1 955) who showed that the elliptic function
[2
p(x)
I
I
f(z) =
2n - 1 1 + k 2n - I eiz 1 -k rroo 1 + k 2n - 1 1 - k2n -l eiz oo
..
is a characteristic function. This function has the real period 2n , the purely imaginary period log and the strip of regularity Im (z) < ! log k j . 7 .4.2 In conclusion we remark that one could regard theorems also as conditions which a single-valued, periodic analytic and function must satisfy in order to be a characteristic function.
7.4.3
4i k
I
I 7.4.1,
7.5
Analytic characteristic functions as solutions of certain differential equations Regression problems lead sometimes to a differential equation for the characteristic function. After all solutions of this equation are found, one has to determine those which can be characteristic functions. This is often the most difficult part of the problem and it is therefore desirable to find general properties of characteristic functions which satisfy certain differ ential equations. In the present section we discuss a result due to A. A. Zinger and Yu. V. Linnik, which is of great theoretical interest. We write for the derivative of order s of and consider the differential equation jn j ... l () . + l i(j f( l) ( ( = + .5 ) � Aj ...jn ' l'he Aj1... jn are real constants \vhile the sum is here taken over all non negative integers j1 , j , , In which satisfy the condition jt +j2 + . . - + In � = ( js � 0 ;
f<s> (t)
f(t) t) . . . fUn t) c [f t ] n
(7 .1
(7. 5 .1a)
2
•
•
•
m
s 1, . . . , n).
W c ass tune that at least one coefficient with j1 +j2 + . . . +In = rn is different from zero and denote by 'Ill the ord(!r of this d ifferential e qu ati o n .
228
CHARACTERISTIC FUNCTIONS
We adjoin to the differential equation (7.5 . 1 ) the polynomial
A (xl'
(7.5.2)
1
•
.
n s
. . . ' Xn) = -n , (s�o�....sn> �A X . . Jl···J
31 1
•
•
•
xs' nn. .
The first summation is here to be extended over all permutations of the numbers ( 1 , 2, . . . , n) ; the second summation over satisfying (7.5 . 1 a) . a ll integers The differential equation (7 .5 . 1 ) is said to b e positive definite if its adjoint polynomial (7.5 .2) is non-negative. We can now state the result of A . A . Zinger and Yu. V. Linnik.
{s1 , s2 , , jsn) ,jn 1, •
•
•
•
•
•
Theorem 7.5 . 1 . Suppose that thefunctionf(t) is, in a certain neighbourhood of the origin, a solution of the positive definite differential equation (7 .5 . 1 ) and assume that m n - 1 . If the solution f(t) is a characteristic function then it is necessarily an entire function. ;>,:
We state first a lemma , which uses only some of the assumptions of theorem 7.5 . 1 and which therefore yields less information concerning the solutions of (7 .5 . 1 .
) Lemma 7.5 . 1 . Suppose that the characteristic function f(t) is, in a certain neighbourhood of the origin, a solution of the positive definite equation (7 .5 ). Then f(t) has derivatives of all orders at the origin. Lemma 7.5 . 1 is certainly true if the distribution function F (x) of f(t) .1
is a finite distribution [see theorem 7.2.3] . We therefore assume in the following that for all x > 0 (7.5.3) F ( - x) + 1 - F (x) > 0. We remark that the assumptions of the lemma imply that can be differentiated at least times. Moreover , is necessarily an even number if is non-negative. Since is the characteristic function of F (x), we know that
m
A(x1 , x2 , , Xn) (7 .5 .4) J<3l (t) = ii r ' xi eitm dF (x) •
•
•
oo
f(t)
m f(t) (j = 0, 1 , . . . , m).
In view of (7.5 .2) and (7.5 .4) we can write (7.5 . 1 ) in the form (7.5 .5)
J 00
J 00 A(x1, , x.,) exp [it(x1 + . . . + Xn)] dF (x1) dF (xn) 00 c J oo 00 J 00 exp [it(x1 + . . . + x.,)] dF (x1) dF (xn)· 00 00 •
•
=
•
•
•
•
•
•
•
•
•
•
•
•
•
·
(t)
We give an indirect proof for the lemma and assume therefore that / has only a finite number of derivatives. Then there exists an even integer
29 2
ANALYTIC CHARACTERI STIC FUNCTIONS
2p such that f ( t) can be differentiated at the origin 2p times but not (2p + 2) times. Clearly, one has 2p m 2. The function on the right of (7 .5 .5) can then be differentiated 2p - + 2 times. Since A(x1, • • • , Xn) is non-negative we can conclude from Fatou ' s lemma 00 [see00 Titchmarsh (1 939) p. 346] that J 00 • • • J 00 A (x�> . . . , x..) (x1 + . . . + x.,)2P-m+ 2 exp [it(x1 + . . . + x )] dF (x ) • • • dF (xn) 00 00 J 00 • • • f 00 (x1 + . . . + x.,)2P -m+2 exp [it(x1 + . . . + x )] F(x1) • • • dF(xn) d or , putting t = 0, (7.5.6) s: <Xl . . . s: <Xl A(xl> . . . ' x..)(xl + . . . + x..)2P -m+ 2 dF (x1) • • • dF (xn) = f 00 • • • f : (x1 + . . . + x,.)2p-m+2 dF (x1) . . . dF (x,.) . 00 The differential equation (7 .5 . 1 ) has by assumption the order m so that the polynomial A(x1, • • • , xn) contains the mth power of at least one variable. It is evidently no restriction to assume that x1 is this variable ; one can then write (7.5 .7) A(x1, • • • , Xn) = A0 (x2, • • • , Xn)x�+ A 1 (x2, • • • , Xn)x� - 1 + . . . + Am (x2, . . . ' Xn) · Since A(x1, • • • , Xn ) is non-negative we conclude that A 0 { x 2 , • • • , x,.) is also a non-negative polynomial. It is always possible to find a bounded region 0'17,_1 in the ( 1) dimensional space Rn _1 of the variables (x 2 , • • • , Xn) such that tln _ , dF(x2)dF(x3) • • • dF(x..) = oc > 0 (7.5 .8a) while (7.5 .8b) min nO -1 A o (x2, Xa, • • • ' Xn) � > 0. This follows from (7.5 .3) an d the fact that the equation A0 {x2, • • • , Xn) = 0 determines an algebraic surface in Rn_1• We use here, and in the following, the symbols C1 , C 2, • • • to denote arbitrary positive constants. We see from (7 .5. 7) that it is possible to find a sufficiently large C 2 > 0 such that for I XI I > c2 and ( x 2 , . . . ' Xn) nn-1 the relations C3xr;: A (x , • • • , Xn) {I x + -1- • • • x.,, I I x1 I < 7 ·5 ·9) �
�
m
..
x
=c
x
1
..
x
c
00
n
cl
1
hol d .
•.
x2
+
�
E
� c4
-
230
CHARACTERI STIC FUNCTIONS
( x 1 , , n) Qn -1· (x2, I x l l c2 m A(x1 , x2, , n) {7 .5 . 1 1 ) f A(x1 , , ) (x1 . . . n)2P -m + 2 dF (x1) dF (xn) K Qn
of the n-dimensional be the set of all the points Let X space which satisfy the condition . . . ' X-n) E and (7.5 . 1 0) > Since is even and � 0 we conclude from (7.5 .6) that X •
•
nn
where
•
•
•
•
•
•
•
Xn
-� X
+
•
•
•
�
f ' J: ro (x1 . . . + x,.)2l> - m + 2 dF(x1) dF (x,.) is a (finite) positive constant. Substituting (7.5.9) into (7.5 . 1 1), we see that K
=
c
C3 qv- m + 2 f
00
•
•
+
•
•
xiv + 2 dF (x1) dF (x,.) C5 Jf
•
•
+ 2 ) dF(x x't_P ::; ; K. 1 J This inequality indicates that the moment of order 2p 2 of F (x) exists ; this is in contradiction with the assumption concerning p, so that the On
•
•
=
•
lx1l > Gil
+
indirect proof of lemma 7.5 . 1 is completed. We proceed now to prove theorem 7.5 . 1 . As a first step we show that is an analytic characteristic function. We need the following lemma.
f(t) Lemma 7.5 .2. Let G be a positive integer; then eG > GGjG ! . To prove the lemma we note that
eG
=
G i GG . > � G '. J. .t 3- = 0 00
m be two positive integersN ; according to lemma 7.5 .2 we have (2N m)2 +m < e2N + m m)! (2N + or 2N + m (7.5 . 1 2) < e. N 1/( ) ] + m 2 ! [(2N m) We again use the region Qn - t introduced in the proof of lemma 7.5 . 1 and write Xn l i dF (x 2) dF ) (x h; I 2 · n f It is then possible to find a positive number b such that (7.5 . 1 3 ) h; < b i b 0 (j 1 , 2, . . . , 2N ). We consider also the set of those points (x1 , x2 , , xn) of the n-dimen sional space which satisfy the relations (7. 5 . 1 4) I I c2 and ( n) nn
Let N and
+
+
=
nn - 1
X
+
X3
+
. . .
+
•
•
•
=
•
Xt
�
X 2 ' X 3'
•
•
•
'
X
E
•
•
-1 ·
This set is bounded, therefore there exists a positive constant C6 such that
231
ANALYTIC CHARACTERISTIC FUNCTIONS
(7.5.15) I = J
2N x x x . ) ( x J + + l n r;: l [ l ( · · 2 l
l xtl
X
•
•
<
•
�
-
e
<
b,
m-
•
00 •
•
where
(7. 5.19a)
•
•
·
Ire� I > Oa
•
•
·
•
•
232
CHARACTERISTIC FUNCTIONS
(7.5 .15), to both sides of (7.5 .19) and see 0 � j�=O (2j�\J - 1) ifJ2N +m -jbj � C7 ]+ J. It follows from this inequality, and (7. 5 .15) , that (7.5.20) l b o f32N +m -2NbdJ2N +m - 1 1 � C7 ]+ b o C� +m + j=�2(2j�J {J2N +m-; b;. We estimate next the expressions on the right of (7. 5 . 20). We see from (7. 5 .13) and (7.5.17) that 2�N (2N) f32N +m -ibi � M N -t-m eb0 �2N (2N+m-J•)! (2N. ) (bjM)'.. j =2 3= 2 J J
We add the integral I, defined in easily that
·
2
We note that
(2N + m J.) .' (2f!) 2N(2N - 1) j!. . . (2N-j + 1) (ZN + m _J.) .' < .� (2N + m)! so that (7.5.2 1 ) j�= 2 (2J1!) {32N +m -; b1 � (2N +m)! M2N+m eb 0(eb!M _ 1). We turn now to the expression (7. 5 .19a) and see that (2N)! � • • j� jl {Jj2 • • • {Jjn {3 f 1 jl + +jn =2 N } • • • • } n • We again use (7 .5 .17) to show that ] � (2N)! M2N en where is the number of terms in the multinomial expansion of (x1 + x2 + . . . + xn) 2N. It is not difficult to show that the number of terms in a homogeneous polynomial of degree p in n variables cannot exceed (p +n-n-1 1 ) .' using this fact we conclude that (7.5.22) J � (2N + n - 1)! M2N enj(n-1)! It follows then from (7. 5 .20 ), (7. 5 .21) and (7. 5 . 22) that ' 1)! I f32N +m - 2Nbl bo 1 f32N +m -l l � (2N + n - 1)! M2N en C7 bo 1 /(n+ c� +m+ (2N + m) ! M2N+m e(eb!M _ 1 ). According to the assumptions of theorem 7.5.1 we have n- 1 � m _
1
=
1·
...
•
f
a
a
233
ANALYTIC CHARACTERISTIC FUNCTIONS
so that
I ,82N +m -2Nb1 b() 1 ,82N +m -21NI +m m n 1 � (2N + m)! M {M- e C7 b0 + (C6/M) 2N +m + e(eb!M _ 1) }. In view of the definition of M we then have (7.5.23) I ,82N +m -2Nb1b0 1 ,82N +m -1 l � � (2N + m)! M2N +m . For the further discussion of (7.5.23) we consider two mutually exclusive possibilities described by the inequalities (7.5.24) 2Nbl b0 11 ,82N +m -1 � �,82N +m (7.5.25) 2Nb1 b0 ,82N +m -1 > �,82N +m· We examine first the case where (7. 5 .24) holds. Then ,82N +m -2Nb1 b() 1 ,82N +m -1 � �f32N +m · We see then from (7.5. 23) that {7.5. 26) ,82N +m � {2N + m)! M2N+m . We consider next the second case and assume that (7.5. 25) holds. It is known [see (1. 4 . 7 )] that {7 .5.27) ,82N +m -1 � {{J2N +m) [1 - 1/(2N +m)] · We substitute this into (7.5. 2 5) and see easily that < (4Nb) 2N +m m ,82 + N or, using (7.5.12) , ,82N +m < (2N+m)! (2be) 2N +m < (2N + m)! M2N+m . It follows that (7.5.26) is also valid in the second case, so that lemma 7.5.3 is proved. We show next that condition (7 . 5 .17) holds for any positive integer k. We establish this fact by induction ; in view of lemma 7.5.3 it is only necessary to show that condition (7 .5 .17) holds also for k 2N + m - 1. We substitute the expression ( 7.5. 2 6) into (7.5.27 ) and see that 1 m 2 + N ! ) M (2N m + m 1) m + > + ( ( N N / 2 2 � P2N +m - 1 � "' (fJ2R N +m) � [{ 2N+m)! ] 1/ (2N +m) It follows from (7.5.12) that ,82N +m -1 � e(2N + m- 1) ! M2N+m - I . Thus condition (7 .5 .17) holds for k 2N + m - 1 and therefore also for all positive integers k. We have then 1 1 /k R rx 1c ( I k! 1 ) �� (k! ) /k �� Me1;k and conclude thatf(t) is an analytic characteristic function which is regular least in the strip I Im (z) I < 1/M. We write as usual f(z) for the function of the complex argument z t + iy (t, y real) which agrees with the characteristic fu nction f(t) axis. ==
==
�
at
on
==
the real
234
CHARACTERISTIC FUNCTIONS
We complete the proof of the theore1n by showing that f(z) is an entire function. This is accomplished by proving that the integral (7.5 .28) exists and is finite for arbitrary real y . We give an indirect proof and suppose that the least upper bound 1J of all I y I for which the integral (7 .5 .28) exists is finite. Then
1
1J < � M
0
We now select a real y > 0 such that 1 (7.5.29) n -M < Yo <
oo .
'fJ ·
Since f(z) is regular in the strip I Im (z) I < 1], the relation (7.5 .5) is also valid if we replace the real variable t by the complex argument z t + with y < We do this and differentiate the new relation 2N times with respect to z and then put z = In this way we obtain the equation
I I 'fJ ·
=
iy
iy 0• (7.5.30) r:o J A(xh . . . ' Xn)(xl + . . . + Xn)aN exp [y0 (x 1 + . . . + Xn)] dF (x 1 ) • • • dF (xn) = J • • • J (x1 + . . . + Xn)aN exp [y0 (x1 + . . . + Xn)] dF (xi) . . . dF(xn) · We divide both sides of (7 .5 .30) by An where A = J dF(x) 00
00
c
. . .
00
X
00
00
00
00
00
00
eY•"'
and introduce the distribution function
1
G(x) = A J
x
dF(v). We see then from (7.5 .30) that G(x) satisfies a relation which corresponds to the equation (7.5 . 1 8) for F(x). We conclude as before that the charac teristic function g(t) of G(x) is regular at least in the strip I Im (z) I < 1 /M so that J dG(x) exists and is finite if l ui < 1 /M. We see from (7 .5 .29) that it is always possible to select a real u 0 such that 1 1J ·- y o < u o (7.5 .3 1 )
-
-
oo
e11 ov
oo
oo
e""'
<
VI . J
235
ANALYTIC CIIARACTERISTIC FUNCTIONS
Then the integral
J oo 00 exp [(u0+y0)x] dF(x) = A J oo 00 exp (u0x)dG(x) exists and is finite. In similar manner one can show also that the integral 00 J exp [-(u0 + y0)x] dF(x) a
00
exists and is finite. In view of the definition of 1J this is impossible, so that the proof of theo:r,em 7.5 . 1 is completed. A. A. Zinger and Yu. V. Linnik ( 1 957) also give in their paper further conditions on the polynomial Xn ) and on the solution f(t) which ensure that the only positive definite solutions of the equation (7 .5 . 1 ) are the characteristic functions of normal distributions.
A(x1 , x2, , •
•
•
8
FA C T O R I Z A T I O N O F A N A LYT I C C H A RA C T E R I S T I C F U N C T I O N S
6
In Chapter we dealt with the factorization of distribution functions and of characteristic functions and derived several general theorems. In the present chapter we restrict ourselves to the study of decompositions of analytic characteristic functions. This specialization permits us to obtain further results by applying the tools furnished by the theory of functions of a complex variable. 8.1
Properties of the factors of an analytic characteristic function Let f ( z) be an analytic characteristic function which has the strip - ex < lm (z) < f3 ( ex > 0 , f3 > 0) as its strip of regularity. Suppose � thatf(z) is decomposable and has the two non-degenerate characteristic functions ( t) and ( t) as factors. Then (8. 1 . 1) f(t) = f (t) f (t) for real t ; the corresponding distribution functions then satisfy the relation
/1
\
/2
1 2 oo oo (8 . 1 .2) F(x) J oo FI (x-y)dF2 (y) = J oo F2 (x-y)dF1(y). Let A > 0, B > 0 and � 2 > �1 be four real numbers ; it follows from (8 . 1 .2) that (8 . 1 .3) F(�2)- F(�I) r )F1 (�2 - y) - F1 (�1 -y)] dF2 ( y). =
�
We choose a fixed real number v such that - ex < v < f3 ; since f(z) is an analytic characteristic function we know that the integral
00 J 00 dF ( ) exists and is finite and that oo dF ( ) : dF ( ) J oo J where a and b (b > a) are two real numbers. We next consider the integral J : e""'dF(x) and represent it as the limit of Darboux sums. We construct a sequence of subdivisions of the interval [a, b] by defining ev"'
e""'
b- a
xy�> = a + zn ( j - 1 )
x
�
X
e""'
{j = 1 ' 2, . . . ' (2n + 1)
x
and n
==
1 ' 2, . . . }
FACTORIZATION OF ANALYTIC CHARACTERI STIC FUNCTIONS
237
so that
(8.1.4)
We can then write
(8.1.5) n . p � > [ ex (vxj F(xj� 1) (x ) 1)F } ] n-+oo We denote by n ( p j 1 1 ex F [F (x ) (xj�1 (vx y) > j ] if v > 0 · { hi,n (y , v) _- exp (vx)� 1) [F1 (x)� 1- y) - F1 (x)n> >-y) - y)] if v < 0 for j = 1 ' 2, . . . ' zn and by gn (y; v) = � hi.n (y; v) . We see then from ( 8 .1. 3 ) and ( 8 .1. 5 ) that (8.1.6) s: e""'dF(x) !� JB A g,.. ( y; v)dF2 ( y) . Using ( 8 . 1 . 4) together with the inequality < X( n +t > < C +t > 2n = lim �
i=l
2n
j=l
�
(n+ t> X2i -1
we see that
X2ni + l
2j
so that
gn ( y; v) � gn+t ( y; v) . From the definition of the functions gn ( y) it follows that they are Darboux sums and that lim gn ( y; v) = f y ev(u + z> dF1 (z) . a-b- y n-+oo We then apply to (8. 1 .6) the monotone convergence theorem [Loeve ( 1 955) , p . 1 24] and conclude that J : e""' dF(x) J B A [!� g,.. (y; v)] dF2 (y) >
or
oo >
f '"' e""'dF(x) J>""' dF(x) JB /wu:=>"" dF1 (z)J dF2( y) .
We note that
>
>
238
CHARACTERISTIC FUNCTIONS
so that
I"' 00 emedF(x) [J B /1YY dF2 ( y)J [ I:+ : evzdF1 (z)J . �
The integral on the left of this inequality is finite and independent of Carrying out the necessary passages to the limit, we see that the integrals
a, b, A, B.
I "' oo evz dF1 (x) I oo oo e�'11 dF2 (y)
(8.1.7)
and
exist and are finite and that
(8.1.8) Here v is a real number such that - oc < v < {3, so that the integrals (8.1.7) exist for all such v. But then the integrals /1 (z) = I: oo ei""' dF1 (x) and /2 (z) = I: oo ei""' dF2(x) exist and are finite for all complex z su ch that - oc < (z) < {3, and we see that f1 (z) and f 2 (z) are analytic characteristic functions whose strip of regularity is at least the strip of f(z). Moreover equation ( 8.1.1), which holds for real t, is also valid (by analytic continuation) in the entire strip of regularity of f(z). We summarize this result as Theorem 8.1.1. Letf(z) be an analytic characteristic function which has the strip - lm (z) < f3 as its strip of regularity. Then any factor f1 (z) of f(z) is also an analytic characteristic function which is regular, at least in the strip of regularity off (z). We now turn back to inequality (8.1.8). There exist two real numbers a1 and a2 such that 0 < F2 {a1) while 1 > F2 {a2). Then 00I dF2 (x) ea"' [1 - F2 {a2)] f v > 0 J'" 00 e1YY dF2 (y) r·"' e""' dF2 (x) ea•• F2 (a1) v < 0. Let C - 1 = min [F2 (a1), 1 - F2 (a 2)] and a = max [I a 1 j, I a 2 j ] ; we then see that J �oo e..., dF1 (x) � C tfl"l I oo e,., dF (x). Corollary to theorem 8.1.1. Let f(z) be a decomposable analytic charac teristic function with st1�ip of regularity - oc < m ( ) < {J and suppose that Im
ex <
�
a,
e'""'
i
�
if
�
00
I
z
239 f1 (z) is a factor off(z). Then there exist apositive constants C and a such that f1 (-iv) c e lvl f( - iv) for all v satisfying - ex < v < {3. FACTORIZATION OF ANALYTIC CI-IARACTERI STIC FUNCTIONS
�
We next consider an important particular case and suppose that f(z) is an entire characteristic function.
Theorem 8.1.2. Every factor f1 (z) of an entire characteristic function f(z) is an entire characteristic function. The order of the factors of an entire characteristic function f(z) cannot exceed the order off(z). The first part of this statement follows immediately from theorem 8.1.1. The second part is a consequence of the relation M ( r; f1 ) c ear M (r; f) which is easily obtained from the corollary and from the equation M (r; f) = max [f(ir), f( - ir) ] which was derived in Section 7.1. Corollary to theorem 8.1.2. Let f(z) be an entire characteristic function of order > 1 and type 7: and suppose that f1 (z) is a factor off(z). If the order of f1 (z) is also then the type off1 (z) cannot exceed the type 7: �f f(z), 7:1 � 7:. �
p
1:1
p,
The statement of the corollary is obtained in the same way as the state tnent of the theorem , using the definition of the type given in Appendix D.
Re11zark 1. The statement of the corollary does not hold if either = or if < where p1 is the order of f1 (z). Remark 2.e (zLet f(z) be an entire characteristic function without zeros so that f(z) = cb > [4>(z) entire, z = t + iy] . Then every factor f1 (z) of f(z) is also an entire characteristic function without zeros and therefore has the form f1 (z) = ecb1 (z> where 4>1 (z) is an entire function. p1
1
p
p,
'Ve conclude this section by deriving a property of entire characteristic functions without zeros.
Theorem 8.1.3. Let f(z) be an entire characteristic function without zeros which has a factor f1 (z). The entire functions 4>(z) == log f(z) and 4>1 (z) = log f1 {z) then satisfy the relation M(r ; 4> 1) 6rM(r + 1 ; 4>) + Cr(r + 1), where C is a positive constant. For the proof of the theorem we need two lemmas. (*) Le1nnza 8.1.1. Let f(z) be a function which is regular in a region G, let point of G, and let � be the distance between z 0 0 == t 0 + iy 0 be anofinterior and the boundary G. Then -z ) d0+ i{J 0 • (8.1 . 9) f(z) = 1 I u(t0 + cos 0,y0+ s 0) e -+ ((zz-z0 ) �
z
2
n
n
2n
o
p
p
m •
p ew
p
w
( • > J.jet w = f + iTJ be a complex number nnd let f(w) be a function which cct·tnin region. We write then u(�, 'YJ) for the real part of f(w).
o
is
.
regular in
240
CHARACTERISTIC FUNCTIONS
Moreover, 2n 1 (8.1.9a) f '(z ) = J u(t0 + cos 0, Yo + s1n. 0) e- "'.0 dO. ere is an interior point of the region G; is a point in the interior of the Hcircle with centre z0 and radius such that I I < < � ' while flo = lm [f(zo)] . The representation (8.1. 9 ) is known as Schwarz ' s formula ; for its proof see Markushevich (1965) [vol. 2, p. 151 ] . If we differentiate (8.1. 9 ) with respect to z and put = z we obtain (8.1. 9a). Lemma 8.1.2. Letf(z) be an entire characteristic function [z = t + iy ; t, y real], then there exists a positive constant M = M1 , which depends on f but is independent of y, such that log f(iy) - M I y I · -yK1, where K1 = if'(O). According to theorem 7.3. 2 we have log f(iy ) The statement of the lemma follows from the fact that -y K1 K1 I I y I I so that in this case M = I K1 I · If K 1 = 0, M is an arbitrary if K1 0, positive number. We proceed to the proof of theorem 8.1.3 and write (S. l . l O) {uu(t,1 (t,yy) )==ReRe[4>[c/>(t1+(ti+y)]iy)] It follows easily from theorem 7 .1.2 that (8.1.1 1 ) 0 � u1 (0, y)- u1 (t, y) � u(O , y)-u(t, y) 2M(r; 4>), where r = I t+ iy I · Since f1 (z) is a factor of f(z) there exists an entire characteristic func tion f2 (z) without zeros such that f(z) = f1 (z) f2 (z). We write 4> 2 (z) = log /2 (z) and u 2 (t, y) = Re [4> 2 (t + iy) ] , so that (8.1.12) u1 (t, y) == u(t, y) - u2 (t, y). We conclude from lemma 8.1. 2 that there exist positive constants M1 and M2 such that log f1 (iy) - Mj I y I (j = 1, 2) and note that u1 (0, y) = log I f1 (iy) I == log f1 (iy). Hence (8.1.13) (0, y) - Mj I y I (j = 1, 2). It is also easily seen that (8.1.14) u(t, y) = log I f(t, y) I � M(r 4>), where r = (t 2 + y 2)1 12 • It follows from (8.1.12), (8.1.13) and (8.1.14) that - M1 I Y I � u1(0, y) = u( O , y )-u2 (0, y) � u( O , y ) + M I Y I 0
-
np
p
p
o
z0
z
p
z
z - z0
p
0
�
�
�
=I=
�
�
Uj
�
;
2
24 1
FACTORIZATION OF ANALYTIC CHARACTERISTIC FUNCTIONS
or
-M1 I Y I � u1 (0, y) � M( y; 4>)+M2 I Y I · Therefore there exists a positive constant C such that (8.1.15) I u1 (0, y) I � M(y; 4>) + C I y I · Clearly I u1 (t, y) I � I u1 (0, y) I + I u1 (0, y) -u1 (t, Y) I or, using (8.1.11) and (8.1.15), l u1 '(t, y) l � M( y; 4>)+ C i y i + 2M(r ; 4>). Since I y I � r we have (8.1.16) l u1 (t, y) I � 3M(r ; 4>) + C I y I · We apply formula (8.1.9a) of lemma 8.1.1 to 4>1 (z). Since 4>1{z) is an entire function we may put p 1 and we write also z, t and y instead of z0, t 0 and y0, respectively. We obtain cP� (z) � J 2" u 1 (t + cos (), y + sin 0) e - w dO. It follows from (8.1.16) that 1 4>� (z) l � 6M(r + 1 ; 4>) +2C (r + 1). ==
=
1'l
0
Since
we see that
1 4>1{z) l 6rM (r + 1 ; 4>) + 2Cr(r + 1 ). This is the estimate given in theorem 8.1.3. Corollary 1 to theorenz 8.1.3. Let f(z) be an entire characteristic function without zeros which has a factor f1 (z) and write 4>(z) l g f(z) , 4>1 (z) log f1 (z). The order p 1 of 4>1 (z) cannot exceed the order p of 4>(z). Moreover , if p1 p then the type of 4>1 (z) cannot exceed the type of 4>(z). �
==
o
=
=-
The statement of the corollary follows immediately from the theorem and the definitions of order and type of an entire function given in Appen dix D.
Remark.
8. 1.3 (0, y) 1 (0, y)-u1 (t, y) (8.1.11 ) (8.1.15). y) (0 , y) - y) l u1 (0 ,y) l B(y)
The estimate of theorem can sometimes be improved , and u better namely if it is possible to find for u1 bounds than those of formulae and Suppose that we have (8 . 1 .1 1 a) 0 � u1 u1 (t, � A( t ,
(8. 1 .15 a)
�
242
CHARACTERISTIC FUNCTIONS
A(t, y)
B(y)
where are non-decreasing functions. Repeating the pre and vious argument we get � ttl and � We give an example which we shall use in the next section. Let exp where is real, while � and � We suppose that f z) admits the decomposition,
I (t, y) I A(t, y) + B(y) ( 8.1.17) 14>I (z) l 2 l z i A(t + 1 , y + 1) + 2 l z i B(y+ 1) (z t+iy) . f(z) {A(eiz _ 1) + ipz-yz2}, y 0 A 0. ( p f(z) f1 (z)f2 (z). The function f(z) is an entire characteristic function without zeros ; we write again u(t, y) Re [log f(t + iy )] Re [4>(t + iy )] and use analogous notations for the factors f1 (z) and f2 (z). Then f(i t y ) (8.1.18) u(O ,y)-u(t,y) = log f(t + iy) = 2A[11 sin 2 2 + yt2, so that we see from (8.1.11 ) that (8.1 .19) A(t, y) 2A elvl +y t 2 . According to lemma 8.1.2 there exist two positive constants M1 and M2 such that =
=
=
=
=
=
and we see that . . a According to our assumptions we have
(8 1 20 )
so that (8. 1 .20b) Hence so that
1>1 (iy) log f(iy)- 4>2 (iy) 1U (0, y) � A(e- v- 1)- ttY + YY 2 + M2 1 Y I · I Ut (0, y)] :( Aelvl + yy 2 + O( I Y 1) , =
(8.1. 2 1) We see therefore from (8.1.17 ), (8.1.19) and (8.1.21) that (8.1.22) l 4>1 (z) l O { l z l exp [ I Im (z) I J + I z l 3 } ( l z l =
and have obtained the following result :
� oo
)
Corollary 2 to theorem 8.1.3. Let f(z) be the characteristic function of the convolution of a normal and a Poisson distribution, f(z) = exp [A(eiz _ 1) + ittz-y 2] . z
243
FACTORIZATION OF ANALYTIC CHARACTERISTIC FUNCTIONS
Iff1 (z) = exp [4>1 (z)] is a factor off(z), then 4>1 (z) = O { l z l exp [ j lm (z) IJ + I z J 3 } as I z I -+ oo .
8.2 Factorization of certain entire characteristic functions Certain entire characteristic functions have interesting factorization properties. We next prove an important theorem concerning the decom position of the normal distribution ; this theorem was first conjectured by P. Levy and somewhat later proved by H. Cramer.
Theorem 8.2.12 2(Cramer's theorem). The characteristic function f(t) = exp [i,ut- a t /2] of the nornzal distribution has on�y 2normal factors. Mthenoreover, if f(t) =df1 (t)f2 (t) with2 • fi (t) = exp [itti t-a�t /2] (j = 1, 2), tt 1 + tt 2 = tt an ai +a� = a The function f(t) is an entire function without zeros ; it follows then from theorem 8 . 1 .2 that the same is true for its factors and that the order of these factors cannot exceed 2. Therefore f1 (z) has the form f1 (z) exp [g1 (z)] and it follows from Hadamard ' s factorization theorem that g1 ( ) is a polynomial of degree not exceeding 2. Let for real argument t, g1 (t) = a0 + a1t+a2t 2 ; since f(O) = 1 we see that a0 = 0. From the rela tion g1 { - t) = g 1 (t) we conclude that a1 = itt 1 is purely imaginary and that Since a characteristic function is bounded for real values of its aargument 2 is real. we deduce finally from l f1 (t) j = exp [a2 t 2] that a 2 � 0 and set a2 = - lai. Thus f1 (t) = exp [itt 1 t-lai t 2] is the characteristic function of a normal distribution. The same argument applies to f2 ( t) while the relation between the parameters off(t) and those of its factors is established by elementary reasoning. =
z
We discussed in Section 6.2, without giving any examples, characteristic functions which have no indecomposable factors. Cramer ' s theorem shows that the characteristic function of the normal distribution belongs to the class of characteristic functions without indecomposable factors. Our next theorem indicates that the characteristic function of the Poisson distribution also belongs to this class. The following factorization theorem was derived by D. A. Raikov and is in some respects similar to Cramer ' s theorem.
's theorem). The characteristic function f(t) Theorem 8.2.2 (Raikov Poissonian factors. has onl =Morexp [A(eifit_ 1)] of the Poisson distribution y eover f(t) = f1 (t)f2 (t) with f1 (t) = exp [Ai (eit - 1)] (j = 1 , 2) then A1 A2 = A. -1-
To prove the theorem
(8.2. 1 )
.f ( /)
�=
we
suppose that cxp [A ( £lu - 1 )] .f1 ( t).f.,. ( t) ==
244
CHARACTERISTIC FUNCTIONS
is decomposed into two non-degenerate factors. Since the convolution of a discrete and a continuous distribution is always continuous , we see that /1 ( t) and /2 ( t) are necessarily characteristic functions of discrete distri butions. The Poisson distribution f(t) has its discontinuity points at the non-negative integers ; it is then no restriction to assume that the discon tinuity points of /1 ( t) and /2 ( t) are also non-negative integers. Then /1 (t) = � av eitv and /2 { t) = � bv eitv with av � bv � v=O v=O 00 _lV and where f(t) = e- J. � , e"'tv . v=O v=O V . v=O Since f(t) is an entire function without zeros, the same is also true for /1 ( t) and /2 ( t), so that these series also converge for arbitrary complex values of the argument. We now introduce a new variable w = eit ; this transforms the characteristic functions /1 ( t), /2 ( t) and f ( t) into the gener ating functions g1 (w), g 2 (w) and g(w) respectively. Here � i. g(w) = e- � , w v , g1 (w) = � av wv , g 2 (w) = � bv wv v =O V • v=O v=O and g(w) = g1 (w) g2 (w). The coefficients of these power series satisfy the equation 00
0,
00
0,
•
-
00
00
00
-
(8. 2 . 2) and it follows from the non-negativity of the av and b v and from the relation that
_Av 1 i. av � b0- e - , . v. Since g(w) = exp [.A(w - 1 )] is an entire function, we conclude from (8.2.3) that g1 w) is also an entire function, and we see that for real t g1 (t) � b(; 1 g(t). It is also easy to verify that M(r ; g) � b 0 M (r, g1) so that the order of g1 (w) cannot exceed the order of g(w) . The function g(w) is an entire function of order 1 without zeros ; therefore g1 (w) has the same property. We conclude from Hadamard's factorization theorem that g 1 {w) has exactly the order 1 . Since g1 (1) = we see that g 1 (w) = exp [.A1 (w - 1 )] so that /1 (t) = exp [.A1 ( eit 1)] is the characteristic func tion of a Poisson distribution. A similar argument applies to /2 ( t) and it is A1 + A2 = A. A2 � easily seen that A 1 �
( 8.2.3)
-
"
(
1
_
0,
0,
245
FACTORIZATION OF ANALY TIC CHARACTERISTIC FUNCTIONS
The following corollary follows almost immediately from Raikov ' s theorem.
Corollary to theorem 8.2.2. A Poisson-type distribution<*> has only Poisson type factors. One can summarize theorems 8. 2 .1 and 8.2. 2 by introducing the follow
ing definition. A family of characteristic functions (or distribution func tions) is said to be factor-closed if the factors of every element of the family belong necessarily !O the family. The preceding results mean that the nor mal family, as well . as the family of Poisson type distributions, is factor closed. H. Teicher showed that a family which contains the binomial distributions is factor-closed. For the binomial distributions this fact was In this connection we mention an already noted by N. A. Sapogov interesting result which describes another family of characteristic functions which is factor-closed. Yu. V. Linnik derived the following generalization of the theorems of Cramer and Raikov.
(1954)
(1951).
( 1957)
Theorem 8.2.3. Let = exp {A(eit _ 1 ) + i,ut- � a 2 t 2 } f(t) (,u real, a 2 0, A � 0) be the characteristic function of the convolution of a normal and of a Poisson distribution. Suppose that f(t) has the decomposition f(t) = f1 (t)f2 (t) . Then f3 (t) = exp {Ai (eit - 1) + itti t- !a� t 2 } (j == 1 , 2) where A = A1 + A2 and a2 = ai + a�. We note that theorems 8. 2 .1 and 8.2.2 can be obtained from this result as particular cases. However, the proof of theorem 8. 2 .3 requires more powerful analytical tools than theorems 8.2.1 and 8.2. 2 . This is explained by the fact that theorem 8.2.1 deals with an entire function of finite order �
while theorem 8.2.2 treats the characteristic function of a lattice distri bution. Under the assumptions of theorem 8.2. 3 both these advantages are lost and the proof becomes much more complicated. For the proof of theorem we need certain results from the theory of analytic functions which we state as lemmas.
8.2.3 Lemma 8.2.1. Let f(z) be a function which is regular in the angle == {z : 0 z I < oo, ex arg (z) � f3 } and which satisfies the following I conditions: where < n/({3 - ) (i) l f (z) I M1 exp {I z I P) for z (ii) l f (z) I � M on the lines z == ei cx and z == x e if1 forming the boundary of Then l f(z) I M for all z :(
!!)
:(
:(
�
E !?!)
!!) .
·�---- --------
<*> ,-fhnt is
n
x
E
p
!!).
d istribution w i th characteris tic fu n c ti on of the form
f( t) =
cxp
[tip. ··I· A(e'l.ll1 - 1 )].
ex .
4
2 6
CIIARACTERISTIC FUNCTIONS
Lemma 8 .2. 1 is a special case of the Phragmen- Lindelof theorem ; for its proof we refer the reader to Titchmarsh or to Markushe [p. vich [vol. 2, p . 214] .
(1939) 176] (1965) Lemma 8.2.2. Let f(z) be an entire periodic function with period T, such that the inequality l f(z) I K ea lzl (K and a are real and positive constants) holds. Then 2 i f(z) = ±T ck exp { ; zk} is a trigonometric polynomial with = [a I T l /2n] . Lemma 8 .2.2 is a consequence of the theorem [see Markushevich (1967), vol. 3, p. 143 ] which states that a non-constant, periodic entire function of exponential type is necessarily a trigonometric polynomial. :(
k
7:
We proceed to prove theorem 8 .2.3 and suppose that the characteristic function (8.2.4) admits a decomposition
(8.2.5) f(t) = /1 (t)/2 ( t).
We see from theorem 8 . 1 .2 and the fact that f(t) is an entire character istic function without zeros that are entire characteristic and /2 functions without zeros. Therefore = exp [ 1 (j = 1 , 2) where the are entire functions which are real for = = ( We see oo, real) and have the property that from corollary 2 to theorem 8 . 1 .3 that = (8.2.6) I exp [ I Im I J + I 1 3 } (I I -+ oo). Up to this point we have considered = Re [4> 1 (z)] as a function of the real variables and y . For the completion of the proof it is necessary and to continue to y) into the complex plane. It will be convenient to introduce the function = (8. 2.7) We note that is an entire function which is real for real Therefore admits an expansion
fi (z)
(z) 4>i - oo < y < y 4>1 (z) O { l z t u1 (t, fix y g(z) 4>1 ( -iz). g(z) g(z) a1c
(t)
/1 (t) 4> (z)]
4>1 (0) 0.
(z)
z u1 (t, y)
z
z.
g(z) =
00
�
k=O
ak zk
z t iy (t, y real) then [g(z)] [g(t i ] �[g(t iy) + g(t - iy)]. [4>1 { -iz)] [4>1 (y- it)] = u1 (y, -t)
where the coefficients are real. Let = + Re = Re + + y) = On the other hand, we see from (8.2. 7) that = Re Re [g(z)] = Re
z iy
FACTORIZATION OF ANALYTIC CHARACTERI STIC FUNCTIONS
247
so that (8.2.8) u1 , 'fhe right-hand side of equation (8 .2.8) is, for fixed an entire function of t and can be continued into the complex plane. In the following we write w) if we consider also complex values of the second variable. Since u1 w) 1 1( w), we see from (8.2.8) and (8.2.6) that <w >l (8. 2 .9 ) w � oo . w 1 3) w) 0( 1 w u1 We now introduce the function K (w) u 1 (0, w) - u1 ( 2n , w) . Since u1 (0, w) and u1 (2n, w) are entire functions, we see that K (w) is an entire function. It follows from (8. 1 . 1 1) and (8. 1 . 1 8) that 0 and w � oo, (8.2. 10a) K (w) 0( 1 ) if Im (w) while one sees from (8.2.9) that (8 .2. 10b) K (w) 0 and w -+ 0( 1 w 1 3) if Re (w) Moreover , one has for all w (8.2. 10c) K (w) as w � oo. O[exp ( I w We use the last three estimates to prove the following statement.
(y -t) = � fg(t + iy)+g(t - iy)] .
(y,
y,
g(w+iy) = � (y- i g(w-iy) == � -y- i (y, = I eiRe + I {I I == = = =
I I
=
= I I
1 3 12)]
Lemma 8 .2.3 . The fu ct
)
I I oo.
reduces to a constant. We consider the function {}(w) == K (w)(w + 1 ) - 3 . n
ion K (w)
This function is analytic in the half-plane Re (w) � 0 ; in view of the estimates (8.2. 10a), ( 8.2. 1 0b) and (8.2.10c) , it satisfies the conditions<*> of lemma 8.2. 1 in each of the angles
-�
�
arg (w) � 0 and 0 � arg (w) �
�-
We conclude from lemma 8.2. 1 that for Re (w) � 0, (8.2 . 1 1 ) K (w) 0( 1 w 1 3) as w -+ oo. We use the function {}1 j w l K (w)(w - 1) -3 , which is analytic in the half-plane Re (w) � 0, to show in the same way that (8 .2. 1 1 ) is valid also for Re (w) � 0. Therefore the entire function J( ( w) satisfies (8.2. 1 1) for all w, so that it is necessarily a polynomial of degree not exceeding 3. We conclude from the estimate (8.2. 10a) that J( ( w ) is necessarily a constant.
==
I I
=
( • > with J
p =
3 /2, {3 - IX
=z 1r
/2.
248
CHARACTERISTIC FUNCTION S
We are now ready to complete the proof of theorem 8.2. 3 . It follows from the definition of the function and from that = is a constant, we see Since, according to lemma the function that satisfies the relation ) g( z (z) = (z ) where is a constant. V\Te put z (8 .2. 12) g1 (z) == g(z) (z 2n ) .
K(w) (8.2.8) -2K( - w) g(w + 2ni)+ g(w -2ni)- 2g(w). 8.2.5, K(w) g(z) g +2ni + - 2ni -2g c, c c -g - i - 2nt and see from the preceding equation that g1 (z) is periodic with period 2ni. Moreover we see from (8.2.6) that oo . g1 (z) = O [exp (3 1 z l /2)] as I z I The function g(z) satisfies the conditions of lemma 8.2.2 (with T = 2ni, a = 3 /2 == t'), and applying it we get g1 (z) == A0+A1 ez + A 2 e -z, where A0, A 1 , A 2 are constants. We see from (8.2.6) that g(z) == 0( 1 z j 3) as Re (z) -+ - oo ; the same is therefore true for g1 (z), so that A 2 = 0 and (8.2.13) g1 (z) == A0+A1 ez. In view of (8.2. 1 2) and (8.2.13) we have g(z)-g(z- 2ni) == B0+ B 1 z+B 2 ez with B 0, B 1 and B 2 constant. We put B B0+iB B 1 2 1 2 g2 (z) = g(z) z - -. ze. . . z-2nz 4-nz 2nz Repeating the reasoning \vhich led to (8. 2 .13), we see that g 2 (z) == C o + Cl ez, where C0 and C1 are constants. Using the definition of g2 (z) we conclude that ( 8.2.14) g(z) == D 0+ D 1 z+ D 2 z 2 + D 3 e + D 4 zez where the coefficients Di (j == 0, 1 , 2, 3, 4) are constants. These constants are real, since g(z) is real for real z. We see from (8. 2 . 7 ) that g(O) = 0; therefore, D o == - Da. We put z == y + it and separate the real and imaginary parts in ( 8.2.14) and obtain u1 (y, t) D1y+ D2 (y 2 - t 2)+ D3 (ev cos t - l ) + D4 e11(y cos t - t sin t). It follows from the estimate (8.1. . 20b) that D4 == 0. Therefore ul (y, O)-u1(y , t) = D2 t 2 + 2D3 eY sin 2 �. -+
=
249
FACTORIZATION OF ANALY TIC CHARACTERISTIC FUNCTIONS
t.
t=
This expression must be non-negative for all real y and If we put n and let y tend to oo we see that and if we put t n and let y tend to oo we see that D 2 Therefore
D3 � 0, + = � 0. g(z) = D1 z + D2 z 2 + D3 (ez- 1) (D2 � 0, D3 � 0). If we write D 1 ft 1, D 2 = y = �ai, D3 = A 1 we see that �1 (z) g( -iz) has the form �1 (z) = itt 1 - ai Z 2/2 + A 1 (eiz _ 1 ) ==
=
z
so that the theorem is proved. Some of the factorization theorems for analytic characteristic functions admit interesting generalizations which we discuss in Chapter The results of Raikov's theorem can also be extended in another direc tion. P. Levy b and D. A. Raikov studied the multiplicative structure of finite convolutions of Poisson type distributions and obtained a number of interesting results. We now introduce certain notations which will be used in formulating these results. Let be a real constant ; we denote by
(1937 )
(1938)
A�0 (8.2.15) F(x; A) = e- A � klA s(x- k) oo
9.
k
k o
A. (8.2.15); (t)
the distribution function of the Poisson distribution with parameter We write therefore for distributions of the type of clearly the characteristic function of Poisson type distributions is f == exp where a > and y are real numbers. Let a 1 a an be n positive numbers ; we write A{a1, a2 , , an) for the set of real numbers which can be represented in the form
F [(x-y)/a ; A] [iyt+A(eita _ 1 )] A � 0, 0 < 2< ... < + gn an, g1 a1 + g 2 a 2 + where the g 1 7 g 2 , , gn are arbitrary non-negative integers such that g1 + g 2 + . . . + gn > 0. The set A(a 1 , a 2 , . . . , an) has no finite accumulation point ; it is therefore possible to arrange its elements in an increasing •
•
•
· · ·
•
sequence
•
•
A1
==
a1
< A 2 < . . . < An . . . .
We say that the n numbers a 1 , a 2 , . . . , an are rationally independent if no relation
8.2.16) r1 a1 + r2 a2 + . . . + ron an = 0 holds where the r1, r 2 , . . . , rn are rational numbers such that l r1 l + l r2 ! + . - + l rn l > 0. other words linear relation (8.2.16) with rational coefficients between
(
In the
ah
a
·
. . . , lT,,.� can only hold if all the coeffi cients are zero. Wc now state l{aikov's resu lts.
250 Theorem 8 .2.4. Let y1, y2 , • • • , Yn be n arbitrary real numbers, and let A1, A2 , • • • , An be n non-negative numbers while 1, 2, • • • , are n positive numbers. The characteristic function of the distribution F(x �:n ; An) F(x) F(x �1Y1 ; A1) F(x �2Y2 ; A2) then has only factors of the form 1 )] exp [iyt + � ( where the Ak are the elements of A( 1, • • • n) and where y and are real numbers. We note that the factors of F(x) are not necessarily convolutions of CHARACTERI STIC FUNCTIONS
a
*
*
=
Ak < an
a
. . .
an
a
*
iA kt cxAk e ,
ocAk
a
Poisson type distributions since the coefficient ocA k may be negative. We will give later an example of such a characteristic function.
Theorem 8.2.5 . Let , be n rationally independent positive • • • numbers. The distribution x x x y 1 2 �:n ; An) ( ) ( ( ) �: � A A F F(x) F 1 ; 1 F ; 2 then has only factors of the same form, namely � � � x 1 X X 2 ) ( ) ( ( F1 (X) F 1 ; #1 F 2 ; #2 • • • F n ; fln) where �i �. 0 while O � fli � Aj(j 1 , ) Paul Levy ( 1 93 8b) has shown that theorems 8.2.3 and 8.2.4 are valid even if the numbers a 1 , a 2 , • • • , have arbitrary signs. Theorem 8.2.6. Let a1, a2 , • • • , be n positive numbers which satisfy the condition The distribution x x x y 1 2 * ) ( ( ) ( � F �:n ; An) F(x) F 1 ; A1 F �: ; A2 has only components of the same form, namely !5 � � x x 1 X 2 F1 (X) F( 0'1 ; #1) F ( 0'2 ; #2) • • • F( n ; ftn) where �i 0 while 0 � fli � Aj(j 1, 2, . . . , n). a1 , a2 ,
an
*
=
=
a
*
* . . .
a
=
*
*
*
an
. . . , n .
an
an
*
=
=
�
*
. . .
*
*
*
O'n
=
For the proof of the last three theorems the reader is referred to the paper by Raikov ( 1 93 8).(t)
(t) We prove in the next chapter two theorems [theorems 9.4. 2 and 9.4.4] which generalizations of Raikov's theorems 8 . 2 . 6 and 8 . 2. 5 respectively.
are
251
FACTORIZATION OF ANALYTIC CHARACTERISTIC FUNCTIONS
(1 37 )
In his remarkable paper P. Levy 9 b studied convolutions of Poisson type distributions of a somewhat more specialized character. He considered real polynomials and the entire functions exp If the coefficients of are all non-negative, then the coefficients in the Taylor series expansion of exp about the origin are also non-negative so that is a moment generating function. How exp ever, can be a generating function even if has negative co efficients. P. Levy derived a necessary and sufficient condition which the polynomial ::m : ust satisfy in order that exp should be a probability generating function. The generating functions studied by P. Levy belong to distributions of the form
P(x) P(x) P(x)] [ [P(et) -P(1)]
M(t) M(t) P(x) =
[P(x)].
P(x) [P(x)-P(1)]
F1 (;1 ; A1) * F2 (:2 ; A2) * . . . * Fn (:} An) where the positive numbers a 1 , a 2 , , an are all integers. We conclude this section with the discussion of an example which was •
•
•
studied by D. A. Raikov as well as by P. Levy. We consider the polynomial
(8.2.17) P(x) 1 +ax-f3x 2 + cx3 +dx4 of degree four. The numbers a, {3, c , d are assumed to be positive. We compute [P(x)] 2 and [P(x)] 3 and see that it is possible to determine the coefficients a, {3 , d in such a way that [P(x)] 2 and [P(x)] 3 have no k negative coefficients.(t) Then [P(x)] 2k P(x)]2} and [P(x)] 2k + 1 {[ [P(x)]3 {[P(x)] 2} k - t also have non-negative coefficients for k 1. We form (8.2.18) exp [P(x)] � [P��W and see that under these conditions only the quadratic term in exp [P(x)] can have a negative coefficient. The coefficient of the quadratic term of exp [P(x)] is easily determined ; it is [(a 2/2) -{J]e. If we suppose that (8.2.19) then exp [P(x)] has only non-negative coefficients. The function exp [P(x)-P(1)] is then a generating function, so that (8.2.20) g(t) exp {a eit -f3 e2it + c e3it + d e4it -a-c- d + {3 } a characteristic function. The function (8. 2 .20) cannot be an infinitely =
c,
=
=
;::::
=
=
0
1·
=
is
divisible characteristic function. To show this we note that the coeffi cients of the linear and of the quadratic term of the polynomial in the arc and {3/n respectively. The condition corres exponent of ponding to (8.2 . 1 9) will therefore be violated for large so that
[g(t)] 11'r� ajn
(-J-)
' l'hcRt' co nditions
a rc
for instance
sntitd1cd
n
if
a ::-::-; c :o.=;
d
and fJ
��
1.
[g(t)] 11n
252
CHARACTERISTIC FUNCTIONS
n
cannot be a characteristic function if is chosen sufficiently large. The function can be used to construct an interesting decomposition. The characteristic function of the distribution
g(t)
F(x) = F(x ; a) * F(lx ; c) * F(lx ; d) f(t) = exp {aeit + ce8it + de4it _ a-c -d}.
is then
This convolution of three Poisson type distributions also admits the factorization = exp [,B( 2 - 1 We conclude from theorem that must have an indecomposable factor and see that a convolution of three Poisson type distributions can have indecomposable factors. Since every factor of is also a factor of we conclude from theorem and from a result of P. Levy ( t) that there exist indecomposable characteristic functions of the form P. Levy (1 937b) considered polynomials of the form
f(t) g(t) e it )] . 6.2.2 g(t) 8.2 .4
f(t)
g(t)
P1 (x) = ax+ f3x 2 -yx3 + bx 4 + cxs P2 (x) = a'x -{3x 2 +yx3 +b 'x4
and
(8.2.20).
and showed that it is possible to determine the coefficients in such a way that = exp and = exp are both indecomposable characteristic functions. Therefore = is the characteristic function of a convolution of three Poisson type distributions and provides an example of the factorization of an infinitely divisible characteristic function into two indecomposable factors. We conclude this section by listing several theorems which indicate that certain functions can be characteristic functions , provided a parameter is suitably chosen. These theorems are somewhat similar to theorem since they can also be used to prove the existence of infinitely divisible characteristic functions having an indecomposable factor.
{P1 (eit) -P1 ( 1 )} {P2 (eit) - P2 ( 1)}
/1 (t) /2 (t)
f(t)
/1 (t) /2 (t)
6.2. 3
Theorenz 8.2. 7. Let = pI be a rational number and suppose that the integers p and are relatively prime and that 1 < p < For given positive numbers A1, A2 andy it is possible to select a sufficiently small positive number that /1 {t) = exp {-yt it A1 (e - 1 ) + A2 (ecxit - 1 ) (eitfq - 1 )} a characteristic function. q
so is
ex
q
2
q.
-v
+
(t) P. Levy (1937b) has shown that a
function
v
of the form exp [P (x) - P ( l )] (P (x) a polynomial) cannot be a generating function un less a term with negative coefiicient is p receded by one term and followed by at least two terms with positive coefficien ts .
253 Theorem 8.2.8. Let oc be an irrational number, 0 < ex < 1 . For given positive numbers A1 , A2 and y it is possible to select sufficiently small positive numbers v and so that the function 2 f2 (t) = exp { -yt +A1 (eit _ 1 )+A2 (ecxit _ 1)-v(errit _ 1)} is a characteristic function. Theorem 8.2.9. Let G(u) be afunction which is continuous and non-decreasing in the interval [b1 , b2] and suppose that G(b2)-G(b1) > 0 and let y be a positive constant. Then it is possible to select sufficiently small positive numbers v and so that the function f3 (t) = exp {-yt 2 + f bt, (ei1" - l)dG(u)-v(eitYJ _ 1)} b is a characteristic function. Theorems 8. 2 .7, 8.2. 8 and 8.2.9 are due to Yu. V. Linnik ; for their proof we refer the reader to Chapter 8 of Linnik ( 1964). Remark. We see from the Remark 1 following theorem 5.5.1 that the characteristic functions /1 ( t), /2 ( t) and /3 ( t) are not infinitely divisible and therefore have indecomposable 'factors. FACTORIZATION OF ANALYTIC CHARACTERISTIC FUNCTIONS
1J
1J
We mention here another open problem of the arithmetic of distribution functions. It is known that many infinitely divisible characteristic functions have indecomposable factors ; however, it is only possible to determine these factors in a few cases. It would be interesting to study methods which would permit the determination of indecomposable factors of infinitely divisible characteristic functions. 8.3
Determination of certain entire characteristic functions by properties of their factors In studying factorizations we disregard the trivial degenerate factors. It is therefore convenient to introduce the following terminology. We say that two characteristic functions are equivalent and write and
/1 (t) /2 (t) (t) (t) /1 !2 r--.1 if /1 ( t) == eiat f2 ( t) where a is a real number. Similarly we say that the second characteristics � 1 ( t) == lo g /1 ( t ) and � 2 ( t) == log /2 ( t) are equivalent (in symbols cfo 1 (t) r--.� � 2 (t)) if �1 (t) == ait + �2 (t). With this notation we can express the fact that two characteristic func tions /1 ( t) and /2 ( t) belong to distributions of the same type (t) by stating that there exists a constant a > 0 such that /1 (t) r--.� /2 (t/a). we show that certain entire characteristic functions can be I n this section
("f")
For the sake of b.-evi ty we will
any
thnt }'1 (t) nnd J� (t)
nrc
of the
smnc
typ e .
254
CIIARACTERISTIC FUNCTIONS
characterized by properties of their factors. We derive first a theorem which is the converse of Cramer ' s theorem.
Theorem 8.3.1. Let f(t) be a decomposable characte1�istic function and suppose that all factors off(t) are of the type off(t). Then f(t) is the charac teristic function of a normal distribution. We prove first that f ( t) is infinitely divisible. Let f(t) = fl (t) f2 (t) be a decomposition of f(t). It follows then from the assumptions of the theorem that there exi$t two positive constants c1 and c2 such that (8.3.1) f(t) � f(cl t)f(c2 t). We apply the same decomposition to each factor on the right-hand side of (8.3.1) and see that f(t) � f(ci t)f(cl C2 t)f(cl c2 t)f(c� t) so that [f( c1 c2 t) ] 2 is a factor of f(t). According to the assumption of the theorem there exists then a positive constant c3 such that [f(c1 c2 t)] 2 l
But this means that is the square of a characteristic function. We repeat this argument to show that for any positive integer is the 2kth power of some characteristic function. It follows (see the remark following the corollary to theorem that is infinitely divisible. Therefore has the canonical representation
k, f(t)
5.3.3) f(t) f(t) oo 2 ( . itx ) 1 x + (8.3.2) log f(t) l
=1=
s
- oo
e
FACTORIZATION OF ANALYTIC CHARACTERISTIC FUNCTIONS
c > 0 such that h, (t) --- !(;) oo (eitx _l - itx 2) 1 +2x 2 dH (x) J - oo 1 +x x oo (eitx!c _ 1 - itxjc2) 1 +2x 2 dO(x). 1 +x x J
255
is a factor of f(t) ; hence there exists a or
e
�
- oo
By a simple transformation of the integral on the right-hand side of this relation we see that
oo (eitx _ 1 - itx 2) 1 + 2x 2 dH, (x) J - oo 1+x . x J (e"'tv _ 1 - 1 it+yy 2) 1 y+y2 2 c12 (1+ c+y2 y 22) dO(cy). It follows that 2 2 x 1 c y + H, (x) C + J 2 ( 1 +y 2) dO(cy) �
ao
- ao
=
C +s
- oo C
He (x) O(x) c(a+s) . [c(a-s), ] O(x), c s) � � c(a+ s) �c� (8 .3 .3) a- s � c � + We see from (8.3 .3) that c tends to 1 as s � 0 ; at the same time the interval which contains all th e points of increase of O(x) shrinks to the point x a ; hence x a is the only point of increase of O(x), and O (x) has the form O(x) As(x - a) (A > 0) . Then 2 1 a + log f (t) A 2 (e"'ta - 1) a and it is easy to show thatf(t) cannot have a proper decomposition (8.3.1 ). This shows that a 0 leads to a contradiction with the assumptions of our theorem, so that a 0 is necessarily the only point of increase of O(x). This
where is a constant. The function increases only in the interval [a - s, a ] , therefore Since a is a grows only in point of increase of it must lie in this interval, i.e., (a a so that a a if a > 0 a+e a-e a a if a < 0. a e =
=
=
•
�
=I=
=
means thatf(t) is the characteristic function of a normal distribution , so that theorem 8. 3 . 1 is proved.
256
CHARACTERISTIC FUNCTIONS
8 2 1)
It follows from Cramer ' s theorem (theorem . . that a normal charac teristic function has only factors of its own type. Theorem is therefore the converse of Cramer ' s theorem and we obtain immediately the following characterization of the normal distribution.
8.3.1
Corollary to theorem 8.3.1. The decomposable characteristicfunctionf(t) is the characteristic function of a normal distribution if, and only if, allfactors of f(t) are of the type off(t). Our next theorem gives a common property of normal distributions , Poisson type distributions and their conjugates.
Theorem 8.3.2. Suppose that the characteristic function f(t) has an infinite set of non-equivalent factors and assume that f(t) has the following property : if f1 (t) and f2 (t) are any two factors of f(t), then either f1 (t) is a factor of f2 (t) or f2 (t) is a factor of f1 (t). Then f(t) is the characteristic function of either the normal distribution or of a Poisson-type distribution or of the conjugate to a Poisson-type distribution. For the proof of theorem 8.3 .2 we need the following lemma. Lemma 8.3.1. If a characteristic function f(t) is divisible by an arbitrary integer power of a characteristic function g(t), then g(t) belongs necessarily to a degenerate distribution. If the conditions of the lemma are satisfied, then f(t) = [g(t)]n hn (t) (n = 1 , 2, . . .) where hn ( t) is some characteristic function. Therefore (8.3.4) I f(t) I == I g(t) I n I hn (t) I � I g(t) In (n = 2, . . .) . We now show that the assumption that g(t) is non-degenerate leads to a contradiction. It follows from the corollary to lemma 6.1.1 that there exists a � > 0 such that I g(t) I < 1 for 0 < t < �- We choose such a t and let n tend to infinity in (8.3.4) and see that I f(t) I can be made arbitrarily small, provided 0 < t < �- This contradicts the fact that f(t), as a characteristic function, is continuous at t = 0 andf( O ) == 1, so that the lemma is proved. We proceed to the proof of theorem 8.3 .2 and show first that the characteristic function f(t) has no indecomposable factors. We give an indirect proof and assume therefore tentatively that f1 (t) is an indecom posable factor of f( t). According to the assumptions of the theorem, every other factor g(t) of f(t) is divisible by some power of f1 (t). We see then from lemma 8.3 . 1 that there exists a highest power of f1 (t) which is a factor of g(t). Let n be the exponent of this power, so that g(t) = [f1 (t)]� h(t). The factor h( t) is not divisible by f1 ( t) it follows from the assumptions of the theorem that h(t) must be a factor of f1 (t), but since f1 (t) is indecom posable, h(t) is necessarily degenerate, so that (8.3.5) g(t) "' [fl (t)] n . t,
;
257
FACTORIZATION OF ANALYTIC CHARACTERISTIC FUNCTIONS
If the characteristic function is non-degenerate it can, according to lemma On the other not be divisible by arbitrarily large powers of /1 hand we see from that every factor of is equivalent to some power of /1 so that can have only a finite number of non-equivalent factors. This contradicts the assumption of the theorem, so we must con clude that has no indecomposable factors. According to theorem is then infinitely divisible. Therefore we can write in the canonical form i X ex p � +
8.3 .1,
(8.3.5) ( t), f(t) f(t)
f(t) (8.3.6) f(t)
.N
(t).
f(t)
f(t) [J (e'-tro 1 - tx 1 + 2 dO(x) . _ 1 x 2) x 2 J OO
"
6.2.2
•
oo
O(x)
We show next-again by means of an indirect proof-that has only a single point of increase. Let us therefore assume tentatively that this is not true and that has the points and as points of increase. We select > so that and construct two functions if X ro
O(x) a 1 a2 8 0 a1 + 8 < a2 - 8 < a; - 8 a3 - 8 � x < a1 + 8 (8.3.7) H1(x) O(x)-O(a1-8) 0 ( a1 + ) - 0 (a1 -8) if a1 + 8 � x for j 1, 2. The functions 0(x)- H; (x) (j 1, 2) are non-decreasing and bounded, so that the functions 2 1 x x u.. fi (t) exp [ J'X) (e - 1 - 1 : x 2) :2 dH; (x)] (j 1, 2) are characteristic functions. Moreover /1 ( t) as well as /2 ( t) are factors of f(t). We conclude then from the conditions of the theorem that one of these factors must divide the other. If /2 (t) would be a factor of/1 (t), then 2 itx 1 /1 ( t) + r 00 ( 8.3.8) /2 (t) = exp { J _ oo (e" " - 1 - 1 + x 2) x 2 d[H1(x) -H2 (x)]} would be a factor of f ( t) and therefore an infinitely divisible characteristic function. However we see from (8.3. 7 ) that H1 (x)-H2 (x) is not mono tone, so that the expression (8.3.8) cannot represent an infinitely divisible characteristic function. Therefore /2 (t) cannot be a factor of /1 (t). In the same way we can rule out the possibility that /1 ( t) is a factor of /2 ( t) and therefore obtain a contradiction with the assumptions of the theorem. This contradiction shows that O(x) has exactly one point of increase. Let x a be this point. If a 0, we see from (8 . 3 . 6) that f(t) is the characteristic function of a normal distribution ; if a > 0 then f(t) is the characteristic function of a Poisson-type distribution ; if a < 0 then f(t) is the conjugate ·
if
e
=
=
=
=
=
00
·t
=
X
==
of a Poisson-type characteristic function. This completes the proof of theorem 8.3 .2. Its converse is trivial, so that it can provide a characterization of the family of all distributions which belong to the type of the normal, the Poisson or the conjugate Poisson distribution .
25 8
CHARACTERISTIC FUNCTIONS
We finally mention a result due to I. A. Ibragimov (1 956b) which gives a characterization of the normal distributions. He considered the class ff of infinitely divisible distribution functions which have the following property : if E ff and if the convolution = Q is infinitely divisible then H is infinitely divisible. Ibragimov showed that the class ff coincides with the family of all normal distributions.
F(x)
F(x)
F*H
8.4
Infinitely divisible analytic characteristic functions In this section we discuss analytic characteristic functions which are infinitely divisible. We have seen earlier that an infinitely divisible charac teristic function does not vanish for real values of its argument and we now extend this remark.
Theorem 8.4.1. Let f(z) be an analytic characteristic function and suppose that it is infinitely divisible. Then f(z) has no zeros in the interior of its strip of regularity . Since f(t) is an infinitely divisible characteristic function, [f(t)] 1 1n is a characteristic function for any positive integer n and is also a factor of According to theorem 8 . 1 . 1 the function [f(z)] 11n is an analytic f(t). characteristic function which is regular at least in the strip of regularity of f(z). If1 nf(z) should have a zero at some point inside this strip, then f(z)] 1 would have a singularity at the point for sufficiently large n, [which is impossible. The statement of theorem 8. 4 .1 cannot be improved. This is shown by z0
z0
·
constructing an analytic characteristic function of an infinitely divisible distribution which has zeros on the boundary of its strip of regularity. Let > > be two real numbers and put == It is easy to show that
w a+ib.
a 0, b 0
w l it/w (1 it/ ) )( f (t) (1 - itja) 2 is an analytic characteristic function which is regular in the half-plane Im (z) > - a and \vhich has tvvo zeros - iw and - iw on the boundary of this region. Moreover it admits the representation Iogj(t) = mit+ I � ( euu _ l - �: 2 ) dN(u) 1 =
where
and
N (u)
=
-2
J� e- at (1 - cos bt)t - 1 dt.
FACTORIZATION OF ANALYTIC CHARACTERISTIC FUNCTIONS
259
2 f(t) is Corollary 1 to theorem 8.4.1. An infinitely divisible entire characteristic function has no zeros. P. Levy (1 93 8a) raised the question whether an entire characteristic function without zeros is infinitely divisible and solved it [P. Levy ( 1 93 7 c)] by constructing an example of an entire characteristic function without zeros which is n·ot infinitely divisible. The characteristic function (8.2.20) is such an example. Moreover our argument in Section 8.2 indicates that it is possible to determine the coefficients in such a manner that (8.2. 20) According to P. Levy's representation theorem (theorem 5 . 5 . ) infinitely divisible and therefore provides the desired example.
represents an entire and indecomposable characteristic function without zeros.
Corollary 2 to theorem 8.4. 1 . The characteristic function of a finite distri bution cannot be infinitely divisible. The corollary follows immediately from theorem 7 .2.3 and corollary 1 to theorem 8.4. 1 . Corollar 3 to theorem 8.4.1. The characteristic function f(t) of a finite y distribution is always the product of a finite or denumerable number of in decomposable factors. From corollary 2 and from theorem 6.2.2 we conclude that f(t) must
have indecomposable factors. It is also easily seen that it can have no infinitely divisible factors since all its non-degenerate factors are entire functions of order and cannot therefore be infinitely divisible. The preceding theorem and its corollaries can be regarded as necessary conditions which an analytic characteristic function must satisfy in order to be infinitely divisible. For instance it follows from theorem that the characteristic function determined by formula ( 5.5 is not infinitely divisible. We used this fact-without proving it-in an example discussed in Section 5 .5. Vv"e now give anoth er application of the theorems discussed in the present section. Let be an infinitely divisible analytic characteristic function which {3. Then has no factor of has the strip of regularity - < lm the form g(t) for which log p - log f3 . - (X < I:
1
.12)
f(z)
=
oc peit� +(1 -p)eitTJ
8.4.1
(z) < f(t) (1 -p) <
"' - 1]
It is easily seen that the existence of such a factor would produce a contra diction with theorem 8.4. 1 . We have already rcxn.arkcd that the second characteristic �( In ( is defi ned for every characteristic function in a (real) neighbourhood of the
t)
==
f t)
260 origin. Let f(z) be an analytic characteristic function which has the strip (z) < f3 as its strip of regularity and suppose that f(z) has a -zeroex
'""
'
.
u
the strip of regularity. We denote by � (z) = log f(z) that branch of the function log f( z) which, for real z, is given by (8.4. 1). The function �(z) is regular in the strip Im (z) {3. Now let be real ; we can apply (8 .4. 1) and see that �( - h ) - � �( 1. ,./... " ( ) - Im \f'
-ex < t
or
< t t + h) + t2 2 (t) h oo 1 - cos h u t � "(t) = - lim J ei h 2 u 2/2 dK(u) h---+0
u
h_,.o
so that
- oo
w·'{
�"(t) = J - oo dK (u). -
K
�
i·tu
Since ( u) is bounded and non-decreasing we see that is, except for a constant factor, a characteristic function. Moreover, it follows from the analyticity of �(z) that � " (z) is, except for a constant factor, an analytic Irn ( ) {J. characteristic function which is regular in the strip The integral
�"(t)
ex <
(8.4.2)
- � " (z) =
J : oo dK (u) iu•
z<
FACTORIZATION OF ANALYTIC CHARACTERISTIC FUNCTIONS
z.
261
converges in this strip and is a regular function of Let ' be a complex number such that and select a. ' > so that lm (') > Then the integrals � lm (') �
- ex < - rx'
f'
rx < < fJ {J' < {J.
0, {J' 0
( u)
ro f both exist and are finite. From this it follows easily that (8.4.2) can be ro
e - f1 '
u
dK ( u) and
integrated under the integral sign from (8 .4.3)
-�'(,)+� '(0) = f ro
- oo
00
' e"" " dK
0 to ' and we obtain
eiC�tU- 1 dK (u) .
By a similar argument one can show that it is permissible to integrate the expression on the right-hand side of (8.4.3) under the integral sign In this manner one obtains from to z, provided that lm (z) - 1 - i u) dK u) _
0
�'(0) =
< {J. -ex < cp(z) = [�'(O)]z + f ro (ei... z - 00
u
�
Since iK1, where K1-the first cumulant-is real, we see that (8.4. 1) holds in the entire strip of regularity ofj(z), so that theorem 8.4.2 is established.
9
I N F I N I T E LY D IV I S I B LE C H A RA C T E R I S T I C F U N C T I O N S W I T H O UT I ND E C O MP O SAB LE FA C TO R S
6.2.2)
Khinchine's theorem (theorem indicates that a characteristic func tion which has no indecomposable factors is always infinitely divisible. We have seen from theorem that the converse is not true ; i.e. an infinitely divisible characteristic function can have indecomposable factors. This situation suggests the investigation of the family of infinitely divisible characteristic functions which do not admit indecomposable factors. This family is usually denoted by 0, and one of the most important problems of the arithmetic of distribution functions is the study of the class 0 • The present chapter deals with this topic. It follows from theorems . . , and that the class 0 contains the Normal distribution, <*> the Poisson distribution, and the convolution of a Normal and a Poisson distribution. Theorems and provide other examples of members of 0, while an example given on page shows that not all convolutions of Poisson-type distribution functions belong to A systematic study of the class 0 was carried out by Yu. V. Linnik ; his work was first published in a series of papers in the Russian probability journal and later presented in a monograph [ Linnik These investi gations were continued by other authors.
6.2 .3
I
8 2 1 8.2.2 8.2.3 I
I0•
I
I 8. 2.5 8.2 .6
I
251
(1964)].
class 2 we first introduce some terms which are convenient in the discussion of these studies. We have shown that every infinitely divisible characteristic function f can be written in the canonical form 9. 1
The
(t) (9.1.1)
o it u ) dM (u) f e _ ( i u l t 2 log f(t) = ita - yt + 1 + u 2 f oo it u i e _ ( t u + + o 1 1 + u 2) dN(u) where a is real, y � 0 , and where the functions M(u) and N(u) satisfy the conditions listed in theorem 5.5 . 2 . - oo
(:t)
We have defined the class 10 as a family of characteristic functions. We will also speak of distribution functions belonging to 10, meaning that the corresponding charac teristic function is in 10 •
CHARACTERISTIC FUN CTI ONS WITHOUT INDECOMPOSABLE FACTORS
263
We shall call M (u) and N ( u) the spectral functions of f ( t), or of the corresponding distribution function F (x) ; more specifically, we refer to M (u) [respectively N (u)] as the spectral function of the negative [res pectively positive] spectrum. The negative [ respectively positive] Poisson spectrum of the infinitely divisible characteristic function f ( t), or of its distribution function F (x), is the set of all points of increase of the function for the negative and positive and M(u) [ respectively N (u)] . We write Poisson spectrum respectively. We call the set u simply the Pois son spectrum ofj(t) [or F (x)] . An infinitely divisible characteristic function is said to have a bounded negative [positive] Poisson spectrum if there exists a number [respectively b] such that
SM SN SM SN
d
J =: dM (u) 0 u: dN (u) 0J =
=
The Poisson spectrum ofj(t) is bounded if the positive as well as the nega tive Poisson spectrum is bounded. An infinitely divisible characteristic function f(t) is said to have a finite spectrum if
(9.1.2) logf(t) ait-yt 2 + j=l� Aj (eitw _ 1)+ :i=�l A_1(e-itv1 - 1), where m and are non-negative integers and y � 0, A1 > 0, A_; > 0, > 0, v1 > 0. If either m or is equal to zero then the corresponding m
=
n
n
n
# :i
sum is om itted. The infinitely divisible characteristic function f(t) is said to have a denumerable Poisson spectrum if
) i ; ft l 2 _ J f1 t (9.1.3) log f(t) ait - yt + j="i:l A1 (ei 1 _ 1 + flj2 + :i=�t A _1 (e - �'tVj 1 + 1i+tv1vj ) where A; > 0, A_1 > 0, � 0 and where the series and (9.1.3a) converge so that 2 (9 .1.3b) l-tj�< e. A1 tti + vJ�< e. A_j v tends to zero as approaches zero. The numbers v1 and p1 are called the Poisson frequencies ofj(t) . The A1 and A_1 are called the energy parameters of the frequencies p1 and v1 respectively. < =
oo
-
2
y
s
We also introduce a class *> cP of infinitely divisible characteristic fu nctions which has the following properties : (i ) The Poisson spectrum of a characteristic function f E 2 is
('"') 'fhis clnRR should not be confused with fun ctions (f.., cJuss) trcntcd in Section 5 . '1 1 . - - --- -----�-·�-
..
the cl ass of sclf-decotnposablc characteristic
264
CHARACTERISTIC FUNCTIONS
9. .4
( 1 )
either finite or denumerable. Therefore sentation
f(t) admits the repre
f t iat - r= 1 m =-� oo .Am.r (ei�-tm.rt 1i�-t+mfl.rm2t.r) where a is real, 0, Am,r � 0 (r = 1 , 2; m = 0, + 1, + 2, . . . ) , flm.1 > 0, Pm. 2 < 0. t:,_' ' 2 2 yt2 + �
log ( ) =
y
00
�
-1-
··� . 1 /J.2 ""' � (1.1) ""' /J.2 < ��,,1--'· 1.. kJ kJ ll.m ,r lum,r (1 + lum ,r ) r= 1 m = - oo ..,� \ ( iii) � A.m.r �-t! .r tends to zero as s � o<*)�·,, 00
�
vv .·
l,um,r l < e
·
(r 1, 2; m 1. <
= 0, (iv) The quotients flm + 1.r/flm .r = natural numbers greater than It follows that · · · /l- 1. 1 flo.1 < fl 1.1 f.l- 1.2 > flo.2 > # 1. 2 > and lim Pm.1 == + 00 lim Pm.l = m �- oo �+ oo lim #m, 2 == - 00. lim ftm. 2 = ·
·
·
·
·
·
<
0, 0,
m�- oo
+
1,
+
. .
2, . ) are
�+ oo
In this section we derive the following property of characteristic func tions of the class !l'.
Theorem 9.1.1. Letf(t) and suppose that the energy parameters off(t) satisfy for some k 0 the condition (9.1.5) Am.r = O[exp ( - k�-t�.,.)] (nt -+ + r = 1, 2) ; then �(z) = log f(z) is an entire function, so that the characteristic function f(z) is an entire function without zeros. Moreover , �(z) = O { j z f 2 exp [N(Im (z)) 2] } (as l z l -+ ) where N > 0 is a constant. For the proof of theorem 9.1.1 we need several lemmas concerning >
E
.ft'
oo ,
oo
analytic functions. We now state these lemmas, but since their proofs are not easily accessible in the literature we give them in Appendix E (the motivation for this separation of the statements and of their proofs is our wish to avoid disrupting the discussion of the theorems concerning the characteristic functions of the class 0) .
I Lemma 9 .1.1. Suppose that the function (u) is non-decreasing in the half open interval 0 < � a (a < ) and that Ja 2 dN (u) < Then the integral N
u
( Ill& )
Con dition
(iii) is
a
oo
consequence
of
+O
(ii).
u
oo.
265
CHARACTERISTIC FUNCTIONS WITHOUT INDECOMPO SABLE FACTORS
converges absolutely and uniformly on any bounded set of the z-plane, so that f(z) is an entire function. Moreover the esti1nate f(z) O { l z l 2 (1 + exp [ Re (z)])} holds as I z I oo. Lenzma 9 . 1 .2A. Suppose that the function f(z) admits the representation f(z) � dP exp (ZnTp z) where the coefficients dP satisfy, for some k > 0, the relation dP O[exp ( - kp2)] (p � oo) while T > 0. Then f(z) is an entire periodic function with period iT and O {[Re (z)] 2 } if Re (z) > 0 (9. 1 .6) log I f(z) I {0(1) if Re (z) � 0. Lemnza 9 . 1 .2B. Suppose that the entire function f(z) is periodic with purely imaginary period iT and that O {[Re (z)] 2 + log l z l } if Re (z) > 0 (9. 1 .7) log l f(z) l = {O(log I z I) if Re (z) � 0. Then f (z) admits the expansion 2np ( exp d f(z) P"'£,0 P T ) where the coefficients dP satisfy, for some k > 0, the relation dP = O [exp (- kp 2)] asp oo. Remark. The estimate (9. 1 .7) follows from (9. 1 .6). It would therefore be possible to use (9 . 1 . 7) as a necessary and sufficient condition for the series representation of f(z). In view of the later application of the lemmas it is a
=
�
=
p=O
==
==
=
oo
z
�
more convenient to present the necessary and the sufficient condition separate! y. We now proceed to the proof of theorem 9. 1 . 1 and suppose that is a characteristic function of the class cP which satisfies the condition (9 . 1 .5). Then == log f(t) can be written in the form (9. 1 .4) ; we con sider first the positive Poisson spectrum of and write
f(t)
�(t)
(eir"'umolt - 1 - 1 i+#mfl,lmt.l) (ei1 m .1t - 1 - 1 i#m+ ft.lm,lt ) + m=l; Am,l eif-tm.lt
� 1Lm,l £.J � Am,l -'.J
m =
oo
'l
_
=
rn .- - oo
AJ L + s2
J ,ct N(u)
f(t)
2
2
+- Sa
=
�
(say). � 0
tn """
oc.
-'.J
_
( i .t)
tt l � A 1 + m.l .£.I 2 1 + flm.l m=l m
A.m , 1 r(tt - p,., , 1). We can then write the first sun1 "--91 as
266 an
CHARACTERISTIC FUNCTIONS
integral
S1 = J :: (euu_ 1 - 1 �:2)dN (u) . This integral has (if we put it == ) the form of the integral in lemma 9.1.1. We see from (9. 1 .3b) that the conditions of the lemma are satisfied, and we conclude that S1 is an entire function. 'Ve can therefore consider "-9- 1 also for complex values of the variable t and obtain from lemma 9.1.1 the estimate S1 0{1 t 2 ! ( 1 + exp Cuo.1 Im (t)])} the quotients l are integers greater as I t I � oo. Since f ( t) tt . 1 than 1 , and we can write s2 p�= 1 dp exp (itt1.1 pt) where 0 if P ¢ Wm. 1 # 1 . l }:= 1 { p ll.m,1 1. f P #1-.11 We see from (9 .1.5) that for p #m. 1 /tt 1 . 1 the coefficient dP Am.1 0 [exp {- ktt!.1)] 0( - ktti.1 p 2). We apply lemma 9.1. 2A and we see that S2 is an entire function of the complex variable t and that s2 O {exp [N (Im (t)) 2]} as I t I for some N > 0. The third sum S3 is a linear function. We treat the negative Poisson spectrum in the same way and obtain the estimate for �( ) stated in theorem 9 .1.1. z
=
E
2,
=
d
=
==
=
�
flm . l
00
==
=
flm . 1
·
=
� 00
=
z
9.2
A sufficient condition for membership of 10
I
The problem of characterizing the class 0 has not been solved completely at present. We only have some necessary and some sufficient conditions for membership of this class. In this section we prove a sufficient condition ; a necessary condition will be given in Section 9.3 .
Theorem 9. 2 .1. Let f(t) be a characteristic function of the class whose energy parameters and frequencies satisfy the following conditions: (9.2.1) )�m.r O[exp [ - k(,u�.r)]] (m + oo ; r 1 , 2) where k is a positive constant. Then f(t) I that isf( t) has no indecomposable factor. Condition (9.2.1) is identical with (9.1.5) used in the proof of theorem 9.1.1. We now assume that the characteristic function f ( t) can be factored f(t) f1 (t) f2 (t). 2
=
E
=
�
0,
=
267
CHARACTERI STIC FUNCTIONS WITI-IOUT INDECOMPOSABLE FACTORS
f(t)
It follows from theorem 9 . 1 . 1 that is an entire characteristic function without zeros, and we see from this fact and from theorem 8.1 .2 that are entire characteristic functions without zeros. and We can therefore write = 1 , 2), where = ec/>J ( t> = ecf>( t > , and are entire functions ; these functions can be continued into the complex z-plane, z = We introduce
/1 (t) /2 (t) � 1 ( t) �2 (t)
f(t)
(j
/; (t)
�( t),
t + iy . g(z) �1 ( - iz) �1 ( y- it) u(t, y) Re [g(z)]. I /1 ( y - it) 1 I /1 ( - iz) I =
=
and
=
Then
=
> = eu ( t.y
and we see from the ridge property of analytic characteristic functions (p. 1 95) that
/1 ( - it) !( -it) l f1 ( y-it) l l f(y-it) l or (9.2.2) 0 � u(t, 0)- u(t, y) � �(-it)- Re [�(y-it)]. Applying the estimate of theorem 9 . 1 . 1 , we conclude that (9.2.3) 0 � u(t, 0) -u(t, y) 0[1 z 1 2 exp (Nt 2)] as I z I 1 � ---- �
----
=
-+
oo.
We next derive two sim ilar estimates. We see from (9. 1 .2) that
�(-it) - Re [�(y-it)] yy 2 +2 r�l m � co Aw (sin ,Umz YY We substitute for y 2n fls. / and obtain (using property (iv) given in the definition of the -class) that s 1 ( 1 (9.2.4) �{ -it) - Re [�(2ntts, - it)] 2m =�- Am.1 sin flms.,11]n) 2 2 n 2n ) 2 fl + 2 � Am.2 (sin fls.I ) + y (Ps.I 2
=
=
=
oo
� �
-->-
m r - � 00
oo and
A
o tn .�
e''/11 ·2'
e�t m . 2t
m .2
•
m = - oo
vVe note that
t
/1
e�tm .lt
oo
as
e"m . .t .
.•
(
si n f!_�,r��-!2
n) 2
1-ls, l
�
� �
lt1m , :li < I1Mo l
A,
m.
+
2
(tt . n) 2 m 'j:
1-ls H
L:
ll'm•JI :> /',.t
A1n,2
=
0( 1 )
as
t
-+
oo.
268 We conclude from (9 . 2 .2), (9. 2 . 4 ) and the last two estimates that (9.2.5) 0 � u( t' 0) - u(t' 2:n:,u-;,i) (ZA.s- 1,1 + o( 1)) (sin .u.;s.1'l1 r exp (.u. - 1,1 t) as t -+ oo (s == 0 , 2, . . .) . In the same way we obtain the estimate (9.2 .6) 0 � u(t, 0) - u(t, 2ntts.l) ,:;; (ZA.s - 1,2 + o(l )) (sin .Usfl-s].,22 r exp (.Us- 1,2 t) (t _,. - ) . We next derive an estimate for f(z). It follows from theorem 9.1.1 and from the definition of g(z) that (9.2.7) �( - iz) = 0{1 z 1 2 exp [N (Re (z)) 2] }. Moreover we see from theorem (8.1.3) that (9.2 .8) M(r;g) � 6rM (r + 1 , �) + O(r 2) CHARACTERI STIC FUNCTIONS
,:;;
:n;
+ 1, +
00
:n;
and obtain the following result :
Lemma 9.2 .1. For all complex z (z t + iy t, y real), the estimate g(z) == O { l z l 3 exp [N ( Re (z)) 2] } ( l z l -+ oo ) holds. Here N is a positive constant. Let be an integer (positive, negative or zero ) and put (9.2.9) gq,r (z) = g(z) exp ( - flq.r z) (r == 1, 2), and write Uq,r (t, y) = Re [gq,r (t + iy)] (t, y real). We shall need estimates for the expressions uq.r (t, 0 ) - uq,r (t, 2nttq./ ). One has Uq,r (t, 0)-uq,r (t, 2nttq./ ) = = g( t) exp { - fl q.r t)- Re {g(t + 2nittq./ ) exp [ - ftq,r ( t + 2nipq,/ )] } = {u(t, 0)- u(t, 2n,uq,/) } exp { - flq.r t). We apply the estimate (9. 2 . 5 ) in the case where r = 1 [respectively ( 9. 2 . 6) for r = 2] and conclude that (9.2.7a) uq,l (t, 0) - uq,l (t, 2npq,l ) = 0( 1 ) as t -+ + oo (9.2.7b) uq,2 (t, 0) - uq,2 (t, 2npq,l ) = 0(1) as t � - oo . Lemma 9.2.2. The functions gq,r (z) (r = 1, 2) can be written as sums (9.2 .10) g(],r (z) = g�j; > (z) + g�.r > (z) ( r = 1 , 2). =
q
;
269 The summands g�� > and g�.r > are entire functions which are real for real z and which admit the estimates (as I I oo) 0 5 exp [N (Re ( )) ] } if Re ( ) > 0 1 1 { { gq r ( ) O( l z l 5) , if Re ( ) � 0 - {00({11 115)5 exp [N (Re ( )) ] } ifif ReRe (( )) < 0.0 gq,r ( ) Here N is positive constant. CHARACTERISTIC FUNCTIONS WITHOUT INDECOMPOSABLE FACTORS
<+ >
(- )
a
z
z
_
z
-+
z
z
z
z
z
2
z z
z
2
z
�
It follows from the definition of the function gq,r (z) that it is real for real z and that ( .2. ) Let < < and H > and consider the rectangle which has the points and i as vertices. We integrate the function + + Z5 gq,r (C) 2ni C5 (C - z) along the contour of this rectangle. According to Cauchy' s theorem, this integral is equal to gq,r (z) if z is inside the rectangle, but equals zero if z that the is outside the rectangle. It follows from the estimate integrals along the horizontal sides of the rectangle tend to zero as tends to oo, while and are fixed. Therefore ( .2. 2 ) gq,r (z) i oo oo < Re ( z) < � [ b + i gq,r (C) dC _ � r a + gq,r (C) dC - if J a-ioo C5 (C - z) 2ni J b - i oo C5 (C - z) if Re (z) or Re (z) > We consider the function g�� > (z) defined by
9 11 0 0 a b a iH, b iH, b-iH a - H
9 1
(9 .2.11)
a b
Zni
0
t g (C) dC +ioo g�� > ( ) = -. J . c;,�( t: 2nz t -too -) z
z5
z
a
for Re ( z)
H
b
< 1.
We see that the value of the integral defining g��> does not change if the limits oo and + i oo are replaced by b - i oo and + i oo respectively, where > This means that it is possible to extend g��> (z) into the half therefore g�; > (z) is an entire function. For values z with plane Re ( z) Re (z) > we select > Re ( z) and obtain the representation oo gq (C) C 5 b z gq , r (h + iy ) dy 00 r d [ [ , +i go(+,r > (z) = 2� ni J b - ioo ( t;, - z) = 2n J - oo + iy) 5 + iy - z) .. It follows easily that g�; > ( z) is real for real z . Combining and we see that for Re (z) > z5 gq,r ( C) d C (+) . (9 2 1 4) + CtJ.r ( z) -.r5 ( .r C(l.r z) - 2·---· . nt 1 - " ro � r, - z )
1 -i 1 b 1. � 1; 1 b (9 · 2· 13) c;,s 1 (9.2.13), oo f l+i ( •
•
b
(b
·
(b (9.2.12)
270
CHARACTERISTIC FUNCTIONS
Moreover
I
r b +i oo gq,, ( = 0 (1) < I z I J b -iro - )
t:) ac;
C5 ( C Z
-7
oo)
if I Re (z) - b � 1 . The estimates stated in the lemma for g��> (z) are obtained from (9.2.14), (9.2.1 3) and (9.2. 1 1 ). We define g�.r > (z) = gq,r (z) -g�� > (z) and obtain easily the second estimate of the lemma. We saw that the functions g�� > (z) and g�.r > (z) are entire functions which are real for real z. The Maclaurin expansions of these functions therefore have real coefficients, so that g��) (x + iy ) and g�� > (x - iy) [respectively g�.r ) (x + iy) and g�.r ) (x - iy)] are complex conjugate for x and y real. Writing
u�� > (x , y) = Re [g�� > (x + iy) ] , u�.r > (x, y) = Re [g�.r > (x + iy)] we have u��> (x, y) = �[ g�� > (x + iy) + g��> (x - iy)] (9.2. 1 5) . ( ) ( . + ) 1 ) ) ( + ( ( ) ( x y x, [ z y - 2 gq,r gq,r - zy)] . Uq,r The functions on the right-hand side of (9 .2. 15) are entire functions. One can therefore consider the equations ( 9.2. 1 5) as definitions of u�� > (x, y) and u�.r > (x , y) for complex x (and fixed y). We use the estimates of lemma 9 .2.2 and see that 0 { 1 x 1 5 exp [N (Re (x)) 2] } if Re (x) > + < ) (9 .2. 1 6a) uq,r > (x ' Y = O( J if Re (x) � if Re (x) � 0( 1 < ) ( (9.2. 1 6b) y uq,r > ' - O {J x exp [N (Re (x)) 2] } if Re (x) We introduce the functions J(q,t (x) = u�1) (x, - u�i > (x, 2nttq.l ) Kq,2 (x) = u�.2 > (x, u�.2! (x, 2n�-tq.l ). Clearly these are entire functions , and we see from (9 .2. 1 6a) and (9.2. 1 6b) that they admit the estimates O { I x l5 exp [N (Re (x) ) 2] } if Re (x) > K (9.2.1 7a) q,l (x) = if Re (x) 0( if Re (x) � (9.2. 1 7b) Ka.2 (x) = O { J x 1 5 exp [N (Re (x)) 2] } if Re (x) as I x I -+ oo. For the study of the functions Ko..r (x) ( r = 1 , 2) we need two analytical results. The first of these can be derived from lemma 8.2. 1 .
{
X
X
{ X 1 5) { X 1 5) 15
{ 1 X 1 5) {0( 1 X 1 5)
0 0 0 < 0.
0) 0)-
0 �0 0 <0
CHARACTERISTIC FUNCTIONS WITHOUT INDECOMPOSABLE FACTORS
271
Lemma 9.2. 3 . Suppose that the function f(z) is regular in the half-p lane Re (z) 0 and that it satisfies thea conditions (i) I f(z) I � M1 I z + l l for Re (z) = 0 (ii) I f(z) I � M2 eb (z + t ) c for lm (z) = (iii) I f(z) I � M3 exp [d (Re (z)) 2] I z + l ie for Re (z) 0 where M1 , M2 and M3 are positive constants, while a, b, c, d are non-negative constants and c a. Then J f (z) I � M1 l z + 1 1a exp [b Re (z)] in the half-plane Re (z) 0. Lemma 9.2.4. Let f(z) be an entire function which satisfies the condition I f(z) I � exp {k Re (z) + O(log I z I ) } [Re (z) � 0] where k is some real constant. Suppose that f(z) can be represented in the form (2njz) f(z) = � (a; + b ; z) exp T with T > 0 and where the series converges1 uniformly on every bounded set. Then a1 = b1 = 0 for j > w [k T (2n) -· ] . The proofs of lemmas 9.2.3 and 9.2.4 are given in Sections E3 and E4 �
z
�
0
�
�
;
00
oo
=
respectively of Appendix E. We return to the investigation of the functions Kq.r (x) and prove the following statement.
Lemma 9 .2. 5 . The functions Kq,r (x) (r 1 , 2) are polynomials of degree not exceeding 5 . Since uq, r (x, y ) = u��> (x, y ) + u�.r > (x, y) we see that Kq,1 ( x) = [uq,1 ( x, O ) - uq,1 (x, 2nttq, 11 )] - [u�. 1 > (x, 0) - u�. 1 > (x, 2nttq.l )] . =
In view of (9.2.7a) and (9.2. 1 6b) we obtain for real x the estimate as x tends to + oo , (9 .2. 1 8) We see from (9.2.1 7a) that Kq.1 (x) = O {l x l 5 exp [N (Re (x)) 2] } ( l x l -+ ) in the half-plane Re (x) � The conditions of lemma 9.2.3 (with / = Kq . l ; = = 5, = = N) are satisfied, so that (9.2. 1 8) holds in the half plane Re (x) � We see from (9.2. 17a) that (9.2. 1 8) holds also for Re (x) � so that (9.2. 1 8) is valid in the entire x-plane. Let
a c
0,
b 0, d 0.
oo
0.
Kq, l (x) = � 00
i=O
ax i
i
be the Maclaurin series for Kq,t (x) and consider the function
H(zv)
=
K(J.I
(e'0)
=
2: 00
.1 ; ()
a1 ewi .
272
CHARACTERI STIC FUNCTIONS
Since {9 .2. 18 ) holds for all real or complex x, we conclude that = O {exp [5 Re (w)] } . The function H(w) therefore satisfies the conditions of lemma 9.2.4 (with = 2n, b; = = k = 5 , w = 5) so that i = for j > 5 . Therefore Kq. t (x) is a polynomial of degree not exceeding 5 . The statement con cerning Kq,2 (x) is proved in the same way. = 1 , 2) given by lemma The information concerning the Kq,r (x) 9.2.5 permits us to get more precise results on the functions g�}> (x) and g�. 2 > (x) .
H(w) 0,
f H, T
a 0
(r
Lemma 9.2.6. The functions g�}> (x) and g�.2 > (x) admit the expansions gq< +,l ) (x)
(9 .2. 19a)
=
g�. 2 > (x)
( 9.2. 1 9b)
� (a.1�q. 1> + bJ�q. l> x) exp [u. rvq, l J'x] + Sq,l (x) j= l 00
00
� (aj:� + bJ;� x) exp [flq. 2 jx] + Sq, 2 (x) j= l bj:� (9.2. 19c) I a�� I + I b]:; = O {exp ( - kj 2) } ( j --+ oo ; = 1 , 2) som e k > 0. Sq,r (x) e =
where the real constants a�:� and satisfy the condition I r The ar polynomials of degree not exceeding 7 and for have real coefficients. We p rove only the statement concerning g�} > (x), since the statement concerning the second function is proved in the same way. To simplify the notation we write in the proof of formula (9.2. 1 9a) .A. and S(x) instead of g�}> (x), 2ni/flq. t and Sq, t (x) respectively. After the completion of the proof we revert to the original notation. It follows from the definition of tl1e function Kq. t (x) and from (9.2. 15 ) that Kq, t (x) = �}> (x) - � {g�} > (x + 2n flq. 11 ) + g�} > ·(x - 2niflq. l ) } . Since Kq. t (x) is a polynomial of at most fifth degree, we obtain (using our simplified notation) the relation
h(x),
g
i
h(x + A.) - 2h(x) + h (x - A.) � ci xi where the c i are constants (which depend on the suppressed subscript q). We choose constants c; (also depending on q) such that the polynomial P (x) � c; x i satisfies the equation j=2 P (x + A) - 2P (x) + P (x - A.) � c i xi . =
=
j =O
7
=
The function h1 (x) = (9 .2.2 )
0
5
h(x) -P(x)
5
j=O
CHARACTERISTIC FUNCTIONS WITHOUT INDECOMPOSABLE FACTORS
then satisfies the equation
273
h1 (x+A)-2h1 (x) + h1 (x - A) 0 so that the function h2 (x) h1 (x)-h1(x-A) is periodic with period A. From the definitions of the functions h 1 (x) and h2 (x) and from lemma 9.2.2 we see that h2 (x) is an entire function and that for large I x I x F exp [N ( Re (x)) 2] } if Re (x) > 0 { {0 1 h2 (x) 0( I x 1 7) if Re (x) 0. The conditions of lemma 9.1. 2B are satisfied, so that (9.2.2 1) h2 (x) � d1 exp (flq.1jx) where d1 [ exp ( - kj 2 )] for some k. (We write here again d1 instead of 0 d<]>.) function h (x)-A - 1 xh (x) is periodic with period It is again The A. 1 2 possible to apply le a 9 . 1 .2B and we get (9.2.22) h1 (x)-A - 1 xh2 (x) � d1 exp (P,q,1jx) where d1 djq> O [exp ( - kj 2)] for some k. We now return to the original notation and see from (9 .2.20), ( 9.2.21 ) and (9. 2 . 22) that g (x) � (a�Jq.l> + b�.1q. 1> x) exp (rq,lJ·x) + � c'.1. xi where O[exp ( - kj 2)] I aj;i I + I b]:l l for some k 0. The statement of the lemma follows from the fact (estab lished in lemma 9.2. 2) that g�� > ( ) is real for real x. Let tq (z) g(z) - g�}> (z) exp (flq.t z) -g�.2 > (z) exp (flq.2 z) . Using relations ( 9.2.9 ) and (9. 2 .10), we obtain the following two repre sentations for tq (z): exp (flq, 1 z)- g�. 2 > (z) exp (ttq. 2 z) . g (z) (z) > � tq . 1 { (9·2· 23) tq (z) g�1 l (z) exp (,u0,2 z) -g�.1 > (z) exp (flq.l z) . =
=
<
=
=
00
j =O
=
mm
=
00
j=O
=
=
=
00
u
j=O
7
j=2
=
>
x
=
=
=
We apply the estimates of lemma 9.2.2 to these representations and see that � Re 1 5 exp if Re ta ( ) = � Re ( )] } if Re z 1 5 exp t<� ( ) = as
IzI
�> oo .
z 0{ 1 z z 0 {1
Cuq.l (z)] } [pq,2 z
(z) 0 (z) 0
274
CHARACTERISTIC FUNCTIONS
We introduce the expansions (9 .2. 1 9a) and (9 .2. 19b) into (9 .2.23) and see that
= r�=l j=� 2 (cj;� + zd}:�) exp (flq,,.jz) + Lq (z) (9 .2.24) where Lq (z) = tq (z) + Sq,t (z) exp (flq.t z) + Sq,2 (z) exp {flq.2 z) where cJ,qr\ = a�Jq-> l .r and dJq.r> = b.:;�q-) l ,r . As a consequence of (9.2. 1 9c) we have the estimate (9 .2.24a) I cj;� I + I d]:; I = O[exp ( - kj2)] (j --+ oo) . 2
g ( z)
00
�
�
We also note that Lq (z) is an entire function which is real for real z. Using the estimates for tq (z) we see that z j 7 exp [#q,t Re (z) ] } fo r Re (z) . (9 2. 24b) Lq (z) z 17 exp [#q,2 Re (z)] } for Re (z) � as z --+ We introduce the functions hq,t (z) g�} > (z) - �o..9q,t (z) exp (flq.t z) (9 .2.25) hq,2 (z) g�.2 ) (z) - sq,2 (z) exp (flq.2 z) . It follows from (9.2. 19a) and (9.2. 1 9b) that
{ 0 { = 0{ 11
I I oo.
{
(9 .2.26)
;::: 0 0
= =
hq,r (z)
so that
= j= 2 { cj:� + dj:; z) exp (flq,,.jz) � 00
2 (9.2.27 ) � hq.r (z) + Lq ( z) g( z) r=l where Lq (z) is the function defined in (9 .2.24). The functions hq,r (z) are entire functions and are real for real z . Let z t + iy ( t, y real) and write (9.2.28) Hq,r ( t, y ) hq,,. ( t ) - ! [hq,r ( t + iy) + h q,r ( t - iy) ] .
=
=
=
The right-hand side of this equation is for fixed y an entire function of t. The function Hq,,. ( t, y) can therefore be continued into the complex plane, and we write Hq,r ( y) for its analytical continuation. We consider the function Hq,r y) for fixed real y and complex and use the estimates of lemma 9.2.2 and formulae (9.2 . 25 ) and (9.2.28) and see that for --+ oo , > 0 1 7 exp [N (Re ( )) 2] } for Re (9.2.29a) Hq,t � for Re 17) for Re (9 .2.29b) Hq,2 ( 17 exp [N (Re (x)) 2] } for Re ( x) <
IXI
x, (x,
x {0{ 1 (x, y) - 0(1 x x ( ) O I { l 7 x' y) - 0{ 1 x _
x
x
( x) ( x) 0 ( x) � 0
0.
CHARACTERISTIC FUNCTI ONS WITHOUT INDECOMPOSABLE FACTORS
Let Aq (x , y)
275
=
Lq (x) - i[Lq (x + iy) + Lq (x - iy) ] . The function Aq (x , y) is , for fixed real y, an entire function of the com plex variable x and we see from (9.2.24b) that for I x I
-7- oo
- {0{0 { 11 1 1
exp fflq.1 Re (x)] } if Re ( x) � 0 x Aq (x y ) x I ' exp [#q. 2 Re (x)] } if Re (x) � 0. , For real t and real y we have
< 9 · 2 · 30)
_
=
Hq,r (t , y) Aq ( t, y)
hq,r (t) - Re [hq,r (t + iy )] = Lq ( t ) - Re [Lq ( t + iy)] . Using these formulae , as well as (9.2.27) and the relation u ( t , y)
we see easily that (9.2.3 1 )
u(t, 0) - u( t, y)
=
=
Re [g( t + iy)] ,
2
� Hq.r ( t, y) + Aq ( t , y) . r =l
We see from (9.2.5) that u ( t, 0) - u ( t, 2ntts.l)
=
0[exp ( tts - l.l t)] as t � oo. In view of our earlier estimate for Aq ( t , y ) and formula (9.2.29b) we see easily that for > q + { 9 .2.32a)
Hq, t { t, 2ntts. l)
and
=
s
1
0[exp {tts- 1.1 t)]
(
s
=
q + 2, q + 3 . . . )
Hq. 1 ( t , 2npq_;1,1 ) = O [t 7 exp (flq. 1 t )] as t -+ + We see from (9.2.29a), (9.2.32a) and (9.2.32b) that the q + 1 , the conditions of functions Hq.1 ( t, 2ntts. l ) satisfy, for integer lemma 9.2. 3 and we conclude that
(9.2. 32b)
(9.2.33a)
oo.
s�
Hq, l (x , 2nps.l )
=
0 { 1 x 1 7 exp [tts- 1.1 Re (x)] }
[ Re ( x) � 0, and we see from (9 .2.29a) that, for I x I -+ oo ,
0( 1 1 7)
s
=
q + 1 , q + 2, . . .]
for Re (x) � 0. Hq, 1 ( x , 2ntts. l ) = x By means of a simple computation we obtain from (9.2.28) and (9.2.26) the representation
(9.2.33b)
(9.2.34)
Hq. 1 (x , y )
=
2}�2 (cj�l + dj';l x) (sin /lq,tyr exp (flq.dx)
+
'., yd(a) st• n (l"a .11Y• ) exp (/lq, X)
£.J :1 � 2 00
j)
t
)
•
•
276
CHARACTERISTIC FUNCTION S
We substitute y = 2n fls. 1 (with s == q + q + 2, . . . ) into . 2 .34 ) and obtain a series of the form treated in lemma 9.2.4 with coefficients a; =
9. 5
( 2.3 )
T
b;
/ 0 0
=
/
1,
( (
2) + dj�l 2n sin 2/la.dn fls. l fl s.1 )2
(9
2cJ�l sin flo..dn fls.1 2dJ�l sin fla.dn fls.1
and = 2n flq. r Then w = fls - 1 • 1 flq.l and the coefficients aj and b; vanish if j > fls - 1 • 1 flq.l (s = q + q + 2 , ) It follows from ( 2.3 ) th at • -l for fls- 1 .1 flq-.11 d(j.q1) ) fls .1 flq.1 (s = q + ' q + 2 ' and therefore also q • -1 for #s - 1 , 1 flq-.11 fls .1 flq.1 (s = q + ' q + 2 ' . . . ) . cj( , 1) = The coefficients cj�i may be different from zero only if j belongs to the set ] 1 = {flq +p .1/flq. 1 };' 1• (It follows from the assumptions of the theorem that J1 is a set of integers.) We show next that dj�i = even for j E J1 • We carry an indirect proof and assume that d(:f ¥= We put y = 2njflj.l in .2.34) and see that
1,
9. 5 1 ... 1
.... <J < <J <
0.
(9
Ha.1 ( t, 2np,;,l )
=
0
;
2dJ�l t ( l + o ( l )) sin2 # 1 n exp (P,J - 1,1 t ) j,l
(9 0
(t
-+ oo) .
This contradicts .2.32a) so that for j = 2, 3 , . (9 .2.36) dJ;i = We next derive an inequality for the coefficients cj� . Let Am.r be the energy parameters of f ( t ) . We show that for m = q + 2 , q + 3 , . . . and j = Pm - 1•1 flq.l the relation . flm - 1.1 q> & ., .c0r 1 = � c� 2 3 7) 1' ""' J .1 Am- 1 , 1 • • • flq.1 is valid. We give an indirect proof for and assume that for some does not hold. Let = flm - 1 • 1 flq.l integer m � q + 2 the inequality be the corresponding subscript. Then Zn sin flm 1 ' 1 n (1 + o ( l )) exp (Jlm - 1 , 1 t) as t _,. co . = 2c�i Ha.1 t , flm .1 flm.1 It follows then from .2.3 1 ) , .2.3 ) and . 2 .2 b ) that n sm flm - 1.1n ( l + o ( l )) exp ( - l .l t) = 2c� � u( t , O ) - u t, Z flm i flm.1 flm.l as t + oo . The last relation leads to a contradiction with ( .2 . ) so that the validity of .2.3 7) is established.
(9
0
(
0
-+ (9
. ..
�
)
(9.2.37) (9.2 .37)
y
(
(
i
(9
)
(9 0
(
p
(9 9
y
9 5,
277
CHARACTERISTIC FUNCTIONS WITHOUT INDECOMPOSABLE FACTORS
The function Hq. 2 (x, y) can be treated in a similar manner. One obtains an expansion corresponding to (9.2.34) with coefficients cj�� and One can again show that j;� = 0 for j = 2, 3 . . . while the coefficients cj;i may be different from zero only if j belongs to the set ]2 = {ttq + P. 2/flq. 2}; 1 and where 2 (9.2.37a) 0 � cj;i � Am - 1 .2 for j = Pm 1 flq.2 for m = q + 2, q + 3 . . . . (q> for p = rvm,r rvq,r We write cPeq.r> = Am,r and m = q + 1 , q + 2, . . . and obtain from (9 .2.26) and (9.2.27) the representation
dj;J .
d
-
·
u. ju.
(9.2.3 8)
00
2
g (z) = � � A��r exp (flm.r z) + La (z) r=1 m=q + 1
where (9.2.3 8a) 0 � A.��r � Am.r (m = q + q + 2 , . . . ) . The representation is valid for each q = 0, + 1 , + 2, . . . . We select two arbitrary integers q1 and q2 , q1 < q2 and write (9.2.3 8) for q == q1 and q = q2 and subtracting the two equations we obtain (9.2.39 ) 00 00 (q > q1) - Am.2 (q s> l exp rvm , l z) = - � [A(m.2 s ] exp rvm,2 z) � [A.(mq,1>1 - Am.2.J m =�+ 1 m =�+ 1 2 q2 - � � ).��� exp (ttm.r z) - Lq1 (z) + Lq (z) . r=1 m=qt+1 We write A(z) for the sum on the left of (9.2. 39) and see from (9.2.38a) and from condition (9.2. 1 ) of theorem 9.2. 1 that for Re (z) � 0. A (z) = To estimate A(z) for Re (z) 0 we use again (9.2.3 8a), (9.2. 1 ) , (9.2.24b) and the fact that #m.2 < 0 and obtain for the four terms on the right of (9.2.39 ) the estimates z exp [flq1, 1 Re (z)] } 0(1 ) , O {exp [flq2,1 Re (z)] and z j7 exp [flq2,1 Re (z) ] } respectively. Therefore z exp [flq2, 1 Re (z)] } for Re (z) � 0. A(z) == We see that the function A(z) satisfies the conditions of lemma 9.2.4 with k = fla2.u a1 == 0 if j is not one of the integers {ttm. 1/ftq2,1 }:- qa + 1 , h i = 0 for j = 0, + 1 , + 2 . . . = 2n /flq2, 1 . Then w = 1 and we see that � ( q1) � ( q2 ) .cOI'" m - q 2 + 1 ' q2 + 2 ' • • • • 1 ' ll.m,l - ll.rn, l = 0 Similarly one can prove that � ((/ .) _ 1Lw, � (q.2) - 0 f0 1 '"'l = �(f2 1 1 ' q2 + 2 ll.m.2
1,
(u.
(u.
2
0(1) �
0{1
}, 0{ 1 1 7
0{ 1 1 7 ;T
-
..
-
..
m '
� .-
'
•
•
•
·
278
CHARACTERISTIC FUNCTIONS
Since q1 and q2 are arbitrary we conclude that the A��r do not depend on q ; we therefore write Am.r instead of A��r and obtain the following representation for g (z) : (9.2.40)
00
00
g(z) = � � A.m .r exp Cum .r z) + Lq (z) r=l m =q + 1
where (9.2.40a) 0 � Am .r � Am.r ( m = 0 , + 1 , + 2 , . . . ) and where this representation holds for all integers q. We introduce the function (9.2.4 1 )
(fi (z) =
� r=1
�
J:m .r
(eZ!Jm,r - 1 1Zftm� ) . + flm .r _
m = � oo We repeat the reasoning used in the proof of theorem 9 . 1 . 1 and see that �(z) is an entire function and that �(z) = 0 {1 z l 2 exp [N (Re (z)) 2] } (9.2.42) where N > 0 is a constant. We introduce the function L(z) = g(z) - �(z) . To prove theorem 9.2. 1 we must show that L(z) = jiz 2 + /Jz where p is real while ji � 0. The first step in the proof is the demonstration that L(z) is a polynomial of degree not exceeding We see from (9.2.42) and lemma 9 .2. 1 that there exists a positive con stant A such that I L(z) I � A l z 1 3 for Re (z) = 0. According to formulae (9.2.40) and (9 .2.40a) we can represent L (z), for each q = 0, + 1 , + 2, . . . , as
3.
L(z) =
J:m,r ( 1 + flm .r : ) ± � r=1 m=q+ 1 1 + flm .r £ J:,.,, ( - 1 - flm.� ) + Lq (z) ± 1 + flm .r r=1 m = oo
e/-lm.rz
= � 1 + � 2 + Lq (say) . The sum � 1 is a linear function of z and we have � 1 = 0 ( 1 z l ) as l z l -+ oo . We next use lemma 9 . 1 . 1 and estimate � 2 in the same way in which we estimated s 1 in the proof of theorem 9. 1 .2, and obtain � 2 = O {l z l 2 exp [/,tq, 1 Re (z)] } + O { I z l 2 exp (/,ta. 2 Re ( z)] } ( l z l -+ oo) .
CHARACTERISTIC FUNCTIONS WITHOUT INDECOMPOSABLE FACTORS
279
Using these estimates for � 1 and � 2 and the estimate (9.2.24b ) for Lq (z), we conclude that z exp Luq.t Re (z)] } if Re (z) � 0 ( 9.2.43 ) L (Z) = z I ' exp [#q 2 Re (z)] } if Re (z) � 0, as I z I -+ We apply lemma 9.2.3 to the function L (z) (with M1 = a = 3, = = flq.u c = 7) and see that J L(z) � I z exp [,uq t Re (z)] if Re (z) � 0 . I f one applies lemma 9.2.3 to the function L( - z) (with M1 = a = 3, b = = - flq. 2 , c = 7) one sees that z 1 3 exp Luq.2 Re (z)] if Re (z) � 0 . L (z) � We note that the constant A in these estimates is independent of q and that q can be chosen arbitrarily from the positive or negative integers. We therefore let q tend to we finally and since lim flq.r == 0 ( r =
b d
d
{0{0 { 1 1 7 1
oo.
I A 13
I
.
A,
,
A,
I AI
obtain the estimate
oo,
q-?-
1 , 2)
00
A 13
I L (z) I � I z which is valid for all z, so that the entire function L(z) is necessarily a polynomial of degree not exceeding 3 . We note that L(z) is real for real z and that L ( O) = 0 ; therefore L(z) = Jz3 + jiz2 + /1z, where (J, r and J are real constants. we had u( t , y) = Re [g(t + iy)] , so that u( t , 0) - u (t, y) = g(t) - Re [g( t + iy)] or since g(z) = {1(z) + L(z) u (t, 0 ) - u(t, y) == f(t) - Re [f(t + iy)] + L(t) - Re [L( t + iy)] . It is easily seen that L(t) - Re [L(t + iy)] = (3 Jt + y)y 2 • I f one of the relations J = 0, y � 0 were not satisfied then we could find a t such that 3Jt + y < 0. We fix such a value of t and see from ( 9.2.41 ) that �(t) - Re [f(t + iy)] = o(y 2) as y -+ Hence, for such a fixed t and y -+ oo , we would get u (t, 0) - u(t, y ) = o( y2 ) + (3 Jt + y)y 2 -+ This contradicts ( 9.2.2 ) and we see that necessarily J = 0, y 0. There fore
oo. oo.
1<
�
280
CHARACTERISTIC FUNCTIONS
f1 ( t)
s o that the characteristic function belongs to the class 2 ; this means that every factor of and theorem is infinitely divisible, i.e. E 9 .2. 1 is proved. Theorem 9.2. 1 gives a sufficient condition which assures that a charac teristic function This condition can be of the class 2 belongs to weakened if belongs to a lattice distribution. I. V. Ostrovskii (1964) obtained the following result :
f(t)
f(t)
f(t) I0
I0 •
f( t)
Theorem 9 .2.2. Let f(t) be the characteristic function of a lattice distribution with span � and suppose that (i) f(t) (ii) Am.r o(exp [ - 2� - 1 I flm .r ! log {� - 1 I flm.r I)] ) as m + 1 , 2. Then f(t) belongs to I0• For the proof we refer to Ostrovskii ' s paper. Remark. A. A. Goldberg-!. V. Ostrovskii (1967) constructed an ex ample which shows that there exist characteristic functions which belong to the class but not to I0 • This example also indicates that for charac teristic functions of lattice distributions of span � 1 the condition (ii) of theorem 9 .2.2 cannot be replaced by Am .r O [exp { - 1 flm.r I) ] as m + E
2
-+
=
2
r =
9.3
=
1 , 2.
=
A necessary condition for membership of
oo ;
r =
-+
oo ,
10
We now present a necessary condition which an infinitely divisible characteristic function with Gaussian component<*> must satisfy in order to belong to
I0 • Theorem 9.3 .1 . If an infinitely divisible characteristicfunction with Gaussian component belongs to I0 then it necessarily belongs to the class To prove the theorem we assume that the characteristic function f(t) I0 and has a Gaussian component. We show first that f(t) has a 2.
E
finite or denumerable Poisson spectrum. We give an indirect proof and assume therefore that the positive Poisson spectrum has a (non-constant) continuous component,( t) so that where
f(t) f1 (t) f2 (t), =
<• > We say that an infinitely divisible characteristic function has a Gaussian com
ponent if y > 0. (t) This means that in the decomposition N (u) = a1 Na (u) + a 2 Nc (u) (a1 > 0, a2 > 0, a1 + a2 = 1 ) of N (u) into a discrete and a continuous component, a2 ¥:. 0 and Nc (u) is not constant.
281 with a continuous spectral function N (u) for which N(b 2 ) > N(b 1) . CHARACTERISTIC FUNCTIONS WITHOUT INDECOMPOSABLE FACTORS
According to theorem 8.2.9 it is possible to determine positive numbers and 1J so small that
{ -yt 2 + s:: (eitu- 1 ) dN v(eit'Y} _ l )}
v
( u) = exp /3 is a characteristic function. Since Ia is not infinitely divisible it necessarily has an indecomposable factor. Writing }, = Ia exp we see that I (t) has an indecomposable factor. This contradicts the assumption l(t) E l0, so that cannot have a continuous component. The same argument is used if the negative Poisson spectrum has a non constant continuous component. We see therefore that E l0 implies that the spectrum of j (t) is either denumerable or finite. We can therefore write log in the form
(t)
(t) l (t) l2 (t) (t) {v(eitrJ _ 1) N(u)
l(t)
f(t)
t ft; 2) / 2 , p ( � it _ 1 J 1 e log f(t ) ait -y t + (9.3 . 1 ) A +• ttj j=l00 + j�= t (eitP' - 1 - 1ztv;+ vj2) ' where<*> A:; 0, A_; � 0, y > 0 . If the spectrum is denumerable we assume that the conditions (9 . 1 . 3a) and (9 . 1 .3b) are satisfied. Suppose that the positive Poisson spectrum contains at least two points, let and p / > tt be two frequencies of the positive spectrum and let A and A ' be the corres =
1 "' - 1
�
#
ponding energy parameters. We show next that the quotient � = #Itt' is a rational number. The characteristic function f(t) then has a factor = exp /1 If � is irrational then it follows from theorem that /1 and therefore also has an indecomposable factor. This contradiction shows that � is necessarily rational, say � = /q, where and q are integers and can be assumed to be relatively prime, < q . We apply the reasoning used to conclude that /1 and therefore also before and use theorem has an indecomposable factor unless p = 1 . The negative Poisson belongs to the class 2. spectrum is treated in a similar way, so that
{- yt 2 +A(eit�t _ 1)+A' (eitp,/a._ 1)} . 8.2.8 (t) , f(t), p p p 8.2.7 (t), f(t), f(t) Remark. The presence of a Gaussian component is essential since y > 0 is necessary for the validity of theorems 8.2. 7 , 8. 2 .8 and 8.2.9. (t)
9.4
Infinitely divisible characteristic functions with bounded Poisson spectrum In this section we study the factorization of infinitely divisible charac teristic functions with bounded Poisson spectrum. We also derive sufficient ( •) I n order to usc (9. 3 . 1 ) in case of a dcn u rnerable
the poss ibil i ty thnt on l y
n
fi n i te n u r n b e r o f e n ergy pan1n1ctcrs as
well
finite sp ectru m is positive .
as a
we
admit
28 2
CHARACTERISTIC FUNCTIONS
conditions which assure that a characteristic function with bounded spectrum belongs to 0 • We use for the spectra the notations of Section 3 . 7 and have to supple ment these by introducing a convenient notation for the vectorial sum of identical summands. We define the symbol ( A recurrently by writing (1)A A and ( A ( - 1 A ( for 2, 3, . . . . We also write
I
=
)
( oo A
==
n) ( n)A . l n=
n ) + )A
=
U 00
n
n)
=
We need the following lemma :
Lemma 9.4 .1. Let A be a closed set on the real line which is contained in the finite interval [a, b] , where 0 < a < b < oo. Then ( oo)A is a closed set. We note that (n)A [na, nb], and since a > 0 any finite interval can intersect at most a finite number of the sets ( n )A . Let x ( oo)A ; then there c
E
exists a sequence of points {x7c} in ( oo )A which converges to x. The interval (x - 1 , x + 1 ) contains therefore almost all elements of this sequence {xk}· 1 ) intersects only a finite number of the However, the interval (x - 1 , sets (n)A . Therefore there exists at least one set ( A which contains an infinite subsequence of the {xk}· The set is closed (t so that x E ( A and therefore also x E ( oo )A ; hence ( oo)A is closed.
x+
(n)A
n)
)
n)
Theorem 9. 4 . 1 . Let f(t) be an infinitely divisible characteristic function without normal component and which has a Poisson spectrum A such that 0 < a sup x < oo. Then any factor f1 (t) of f(t) has the inf x < b form /1 (t) exp [iyt + J� (eitu - l )dN(u)] . where N (u) is a function of bounded v-ariation which is non-decreasing in the half open interval [a, 2a) and which has a spectrum �o.9. N [( oo)A] [a, b] . The constant y is real. Without loss of generality we can assume that f ( t ) is given by f(t) exp [ J� (eitu - l ) dN0 (u)J . (9.4.1 ) where N 0 (u) is non-decreasing and has the spectrum �o.9. N0 = A . Then f(t) c{ 1 + kil [ J� eitu dN0 (u)T /k!} where c exp [- J � dN 0 (u)J . Let F(x) be the distribution function =
=
a: E A
a: E A
=
c
n
=
=
=
(t) We have seen in Section 3 .7, p . 5 7, that the vectorial sum of two closed an d bounded
sets is closed.
283
CHARACTERISTIC FUNCTIONS WI THOUT INDECOMPOSABLE FACTORS
corresponding to f(t) ; then (9.4.2 )
x c{e(x}+ k� Nf (x)/k !}
F( ) =
(x)
Here N�· denotes the k-fold convolution of N0 with itself. We see from lemma 3 .7 .4 that SN:· == (k) SN0 = (k)A == (k)A . It follows from (9.4. 1 ) that (9.4.3) �9F [ ( oo )A] {0} where {0} is the set containing only the point 0. We assume now that f(t) admits a decomposition f(t) = /1 (t) /2 (t). Then * F2 F (x) = F1 where F1 and F2 are the distribution functions corresponding to /1 {t) and f2 {t) respectively. We see from (9.4. 1 ) and from the assumption concerning the spectrum A of N 0 (u) that log f(t) is an entire function of order 1 and type not exceeding Therefore f(t), and hence also /1 (t), is an entire characteristic function without zeros. Moreover, we conclude from corollary 1 to theorem 8 . 1 .3 that log /1 (t) is an entire function of type not exceeding We see from lemma 3 .7 .4 that -
�-
(x)
(x)
(x)
(x),
b.
b.
(+
(+
) SF 2 ; ) SF2 � �9F1 since [0, oo) � SF we conclude that SF1 and �9F2 are both bounded from the left. It is no restriction ( t) to assume that the infimum of �9F\ is the Point 0 . Then 0 E SF1 and 0 E �9F2 , so that �9F = �9F1
+
(9 .4.4) �9F1 u SF3 c SFl ( ) SF2 c SF . We see from (9.4.3) that the point 0 is an isolated point of SF . Let = ( - a1, 0) u (0, a1) for the union of the two open a1 < a and write intervals ( - a1, 0) and (0, a1) . We see from (9.4.3 ) that does not contain any points of �9F, therefore c �9�. We conclude from (9.4.4) that c �9�1 s o that the point 0 is an isolated point of �9F1 • This means that F1 has a discontinuity at the origin. Let be the saltus of F1 at 0 . Then F1 = is a non-decreasing function of where > 0 and v.rhere bounded variation such that (9 .4.5) c ( oo)A c [a, oo). The characteristic function f1 {t) of F1 (x) is therefore given by
V
ds(x) + G(x), Sa
V
d
/1 (t) = 8
("!")
��
V
d
G(x)
d + f: ei1"' dG(x).
V
(x)
'fhis can be shown by replacing F1 (x) by F1(x �j- 8) and F.,.( x) by F2(x - 8) where I ext [F1] .
284
CHARACTERI STIC FUNCTIONS
We select a positive real number n so large that
G11(x) = J : e -rrvdG(y). Let t be real ; then (9.4.6) J � eit:n dG17 (x) J � dG17 (x) < d
write
J � e-'Yf.ll dG(x) < d and
<
and we see that (t, or
1J
real)
�1 (t + in) = log /1 (t + in) = log {d + J � eu... dG17 (x)}
(9.4.7)
a�*(x) be the k-fold convolution of the function a'YJ(x). We see from (9 .4.6) that the series ( - 1 ) k - 1 a�· (x)j(kd k) converges for all x. We k= 1 write N'Y} (x) = ( - 1 )k -1 a�· (x)j(kd k). The function N'Y} (x) is a function 1 k = of bounded variation. Since Sa'YJ = Sa we see from (9 .4.5) that SN17 ( oo)Sa = p1 (k)Sa fJ1 (k) [ ,.U1 (n)AJ = ( oo)A. It follows from (9 .4.7) and the definition of the function N'YJ (x) that (9.4.8) �1 ( -r: + in) = log d + J� eiT"' dN17 (x) ( n real). We mentioned earlier that � 1 ( ) is an entire function of exponential type not exceeding b. According to remark 7 following theorem 7.2.3 , the spec trum �o.9. N'YJ is contained in the finite interval [-b, b] . Since � 1 ( ) is an entire function, relation (9.4.8 ) also holds for complex values of T ; we substitute = t - in (t, real) into (9 .4.8) and write N (x) = J "' e11'7 dN17 (y). In this way we obtain (9.4.9 ) �1 (t) = log d + J � eu... dN (x). Here SN = SN'Y} [( oo)A] [-b, b] = [( oo)A] [a, b]. We see from ( 9.4.9 ) that /1 (t) = exp [�1 (t)] = d k}:.o [J � eit"' dN (x)Tjk!. Let
� 00
� 00
c
c
-r:,
z
z
't'
1J
-b
c
n
n
The corresponding distribution function is given by (9 .4. 10)
F1 (x) = a{s(x) + k�1 Nk• (x) jk } . !
285
CHARACTERISTIC FUNCTIONS WITHOUT INDECOMPO SABLE FACTORS
H(x) k�= 2 Nk*(x)jk! so that (9.4.11) F1 (x) d{s(x)+N(x)+H(x) } where k 2a, S �9H oo) . ( ) [ N k= 2 Let x 1 and x2 be two points such th at a � x1 < x2 < 2a, it follows from (9. 4 .11) that 0 � F1{ x2)-F1 {x1) d[N(x2)-N(x1)], so that N(x) is non-decreasing in the interval [a , 2a). We see further from (9.4.9) that d exp [- J � dN(x)] ; hence cfo1 (t) J� (eifw - 1)dN (x) so that the theorem is proved. Theorem 9. 4 .1 can be used to derive interesting conditions which assure that a characteristic function belongs to the class I0 • Theorem 9.4.2. Let f(t) be an infinitely divisible characteristic function without normal component, and suppose that its Poisson spectrum lies in the closed interval [a, b] where 0 < a < b � 2a. Then f(t) belongs to I The theorem follows from theorem 9. 4 .1 in the case where b < 2a. We must therefore only consider the case b 2a. Let f1 (t) be a factor of j (t) . We saw in proving theorem 9. 4 .1 that /1 (t) is an entire characteristic function without zeros ; in view of the statement of theorem 9. 4 .1 this factor has the form /1 (z) ex {iyz + f [a.2a) (eizu_ 1 ) dN(u) +A(e2iaz _ 1 )} . Here z t + iy (t, y real) and N(u) is non-decreasing in the half open interval [a , 2a) over which the integral is taken. We have therefore to prove only that A � 0. We give an indirect proof and assume tentatively that A < 0. An elementary computation shows that f1 (t � iy) exp { J e- vu (cos tu - 1) dN (u) + A e- 2a11 (cos 2at- 1 )}. [a.2a) /1 (ty) We put here t t0 4a and see that /1 (t o + iy) exp { - e - [ - J e(2a - (cos t u - 1) dN (u)] . [ a . 2a ) /1 {iy) } =
Let
00
=
c
U 00
c
=
=
=
0•
=
=
=
p
=
=
=
We note th at
=
n
2av
A.
u> v
0
286
CHARACTERI STIC FUNCTIONS
therefore
f1�(t o +_iy_) 1 (iy)
{- e- 2a11 [A - o(1)] } as y --+ If A < 0 this means that f1f(t1 o(zy): iy) > 1 for y < 0 and I y I sufficiently large. But this contradicts the ridge property , so that A 0. Hence the theorem also holds in the case where b 2a. Remark 1. The assumption that 0 < a and b � 2a is essential. If 0 or b > 2 a then theorem 6.2.3 (respectively theorem 6 .2.4) can be used to construct counter-examples. Remark 2. An analogous result can be obtained for infinitely divisible ---
=
oo .
exp
�
=
a
=
characteristic functions without normal component with bounded negative Poisson spectrum.
Theorem 9 .4.2 has an interesting consequence which illustrates the important role of the class 0 •
I Theorem 9.4.3 . Every infinitely divisible characteristic function can be represented as-a product of at most denumerably many factors belonging to I Let f(t) be an infinitely divisible characteristic function whose Levy canonical representation (theorem 5 .5 .2) is determined by the constants a and a 2 and the functions M ( u) and N(u). We introduce, for k 0 , 1, 2, . . . , the functions if u � - 2k+ 1 0 if - 2k+ 1 � u � - 2k Mk (u) M (u) - M ( - 2k+ 1) 1 0•
+
=
+
=
and Nk (u)
=
M ( - 2k) - M( - 2k+ )
if - 2k � u < 0
0 N (u) - N (2k) N(2k + 1) - N (2k)
if 0 < u � 2k if 2k � u � 2k + 1 if 2k+ 1 � u.
f�1) (t) [.fk2> (t)] u [N ] f(t) exp (iat - a2 t 2/2) IJ f�1> (t) ffc2> (t) and see from theorems 9.4.2 and 8.2.1 that all factors in this representation belong to I
We write for the infinitely divisible characteristic function without normal component whose Levy canonical representation is de termined by Mk ( ) k (u) . Then =
0•
00
k = - oo
We introduced in Section 8 .2 (p. 249) the notion of a finite set of rationally independent numbers. For the next theorem we need an exten sion of tl1is concept.
CHARACTERISTIC FUNCTIONS WITHOUT INDECOMPOSABLE FACTORS
A
287
A set of points on the real line is said to be a set with (rationally) in dependent points if every finite subset of is a set of rationally independent points.
A
Theorem 9.4.4. Let f(t) be an infinitely divisible characteristic function without normal component and suppose that its Poisson spectrum A is positive and forms a closed, bounded set with independent points. Then f(t) belongs to I sup x. inf x and b Let As a consequence of our assumption that A is a set with independent points we see easily that the sets (k)A (k 1 , 2 , . . . ) are pairwise dis joint. Let n be the largest positive integer such that na b; then for k n. (9 .4. 12) [(k)A] [a, b] The characteristic function f ( t) satisfies the conditions of theorem 9. 4 Any factor f1 (t) of f(t) therefore has the form /1(t) exp {iyt+ f � (eitu _ l)dN(u)} with [ oo(A )] [a, b], SN a =
0•
=
a: E A
a: E A
=
==
n
>
0
�
.1.
=
n
c
In view of (9.4. 12) we can write
(9.4. 1 3 )
SN
c
[ p1 (k)AJ [a, b]. n
(u) be the restriction of N (u) to the set [(m)A] [a, b] (m 1 , N m 2, . . . , n) and consider the Fourier-Stieltjes transforms of these functions of bounded variation : �m (t) J eitu dNm (u). Let
==
n
=
(m)A
Then
(9.4. 14) We see from (9.4. 14) that the function exp
[}�1 cf>m (t)J is, except for a
constant positive factor, a characteristic function. Therefore there exists a non-decreasing function of bounded variation defined on such that
G(x)
[a, oo]
288
CliARACTERISTIC FUNCTIONS
Hence
f oo
J
a
or
eit"' dG(x) = exp [m£= 1 Jf eitudNm(u)J i t ( " (u) dN = � t f 1 } k1 ! k2 ! � . . k,.! k k ( Jr eitu dN2 (u)) 2 • • • ( Jr eitu dN,. (u)) " (m)A
X
( 2) A
(9.4. 1 5) so that
G(X)
� .£.J
-
Nk:1 * Nk: * • • • Nk�/(k1 ·' k2·' • n '· ) • 2
n
•
•
k
N�J has as its spectrum the set (k1)A( + ){k2)[(2)A] { +) . . . { + )(kn) [(n)A] = {k1 + 2k2 + . . . nkn)A. If x ( m)A, then k1 + 2k2 + . . . + k = m and we conclude from (9.4. 1 5) and the fact that the sets ( k)A are disjoint that n
The function IT* j=1
•
J
+
E
n n
(9 .4. 1 6)
f eux dG(x) = (m)A
�
k1+ 2k2 + ... + nkn =m
[4>1 (t)]k1 [4>n(t)]knj(k1 ! . . . kn !). •
•
•
We see therefore that the expression on the right of (9 .4. 1 6) is the co efficient of in the expansion of (9 .4. 17) exp It follows that (9 . 4 . 1 7 ) is, except for a constant positive factor, a characteris tic function, provided > 0. We also see from (9.4. 1 6) that
ym
[y4>1 {t)+y 2 4>2 (t)+ . . . +yn 4>n( t)] . y J eu., dG(x) = cfo1 (t), so that 4>1 (t)/4>1 (0) is a characteristic function. Since, according to our assumption, /1 (t) is a factor of f( t), there exists a characteristic function /2 ( t) such that (9.4. 1 8) /1 (t)/2 (t) = f(t) and we can repeat the earlier reasoning and show that (9.4. 19) /2 ( t) = C exp {i�t + 1p1 (t) + VJ2 (t) + . . . + (t) } . Here C and � are constants while the functions VJm ( t) have the form (t) = Jf eu"' aN (x) (m = 1 , 2, . . . , n), A
1f'n
'lflm
(m) A ,...,
[a,lJl
289
CHARACTERI STIC FUNCTIONS WITHOUT INDECOMPOSABLE FACTORS
where N is a function of bounded variation such that
[a, b] [ ml.J1 (m)Al We see from (9. 4 .18) that log /1 (t) + log /2 (t) = log f(t) or, in view of (9.4.14) and (9. 4 .19), [4>1 (t) + VJ1 (t)] + [4>2 (t) +VJ2 (t)] + . . . + [4>n (t) +VJn (t)] = log /{t) . The spectral function of f(t) has the set A as its spectrum, while 4>m (t) + "Pm (t) has (m)A as its spectrum. The sets (m)A are pairwise disjoint, and we conclude easily that (9.4.20) VJm (t) == 4>m (t) (m == 2, 3 , ) As in the case of (9. 4 .17) we conclude from (9. 4 . 20) that, except for a constant factor , exp { YVJ1 (t) - y 2 1> 2 (t) - . . . - yn 4>n (t) } is a characteristic function, provided y > 0. But then the functions Y4>1 (iv) + Y 2 4>2 (iv) + . . . + ynn 4>n (iv) YVJ1 (iv) -y 2 4>2 (iv) - . . . - y 4>n (iv) are convex functions of the real variable if y > 0 . This is only possible if 4>; ' (iv) == 0 (j == 2, ) Since the entire functions 4>1 (t) are Fourier - Stieltjes transforms of func tions of bounded variation we see easily that the functions 4>1 ( t) (j = 2 , . . . , m) reduce to constants. We put (9.4.2 1) 4> (t) == 4>, (0) == (j == 2, . . . , m) , and substituting (9 . 4 . 2 1) into (9. 4 .14) we see that /1 (t) = C exp [iyt + 4>1 (t) + + . . . + en] or /1 (t) == c1 exp [iyt + 4>1 (t)]. Similarly we obtain from (9. 4 . 2 1 ), (9. 4 . 2 0) and ( 9. 4 .19) /2 (t) == C2 exp [i�t + (t)]. The statement of the theorem follows ftom the fact that the functions (t) and 1p1 (t) are , except for a positive constant factor, characteristic 4>1functions. Remark 1. Theorems 8.2.6 and 8.2.5 are particular cases of theorems 9.4.2 and 9.4.4 respectively. Remarl� 2 . Extensions of theorems 9.4.1, 9.4.2 and 9.4.3 can be o n Cu s (1968) in I. V. Ostrovskii (1966). SN
n
c
. . . , n .
-
v
. . . , n .
c1
1
C2
'lfJ 1
in
ppcn
and
f
u
d
29 0
CHARACTERISTIC FUNCTIONS
9.5 Theorems concerning certain factorizations The methods used in the last three sections make it possible to derive results concerning the possible factors. of certain infinitely divisible distri butions. <*> We list in the following a typical result.
Theorem 9.5 . 1 . Let f(t) be a characteristic function which admits the repre sentation , og f(t) i-1 { :�: (aVT +bP,it) exp (i#,t) + E 1 Am, exp (ivm,, t)} + L(it) where the parameters occurring in this representation and the function L(z) satisfy the following conditions: (a) �1 > 0, � 2 < 0 ; r 1, 2) and (b) n1 and n 2 are integers such that < nr < ( n1�1 > n2 �2 ; nr and n; > 0 (r 1, 2) [if n; nr (c) n� and n� are integers, n; ,nr- 1 then the sum � is omitted]; ( d) the coefficients apr and bpr are real, mr 0, vm1 0, vm2 < 0 ( 1 , . . . ). Moreover , ( d1) v1r n;. �r (r 1, 2) , ( d 2 ) vm + 1 .rf vmr is a natural number greater than 1, O [ex (- kv!1) ] ; (d3) for some k > 0 we have Amr (e) L( z) is an entire function which is real for real z and satisfies the estimate (as I z I ) 2 exp [� � Re (z)] } if Re (z) 1 1 { 0 z 0{ L(z) O { J z J2 exp [�� Re (z)] } if Re (z) 0, where �� and �� are real numbers such that max [n 2 � 2 , (n 1 - 1 )�1] � �� < n 1�1 and n 2 �2 < �� � min [(n2 - 1 )�2 , n1 �1]. Let f1 (t) be a factor off (t). Then f1 (t) has the form log /1 (t) ;f,1 {:�n� (liP,+ bVT it) exp (i#, t) + }}_ .%m, exp (ivmr t)} + L(it ) , 1 where the apr and bpr are real constants and where the coefficients J:mr satisfy the inequality 0 � �r � Amr· The function L(z) is entire, realfor real z, and the estinzates { 1 1 3 exp [�� Re (z) ] } if Re (z) 0 z 0{ L(z) O { J z J 3 exp [�� Re (z)] } if Re (z) 0 hold for I z I I
=
oo
oo
�
m ==
==
A
>
�
==
==
p
-+ oo
�
<
=
=
==
( «c)
-+ oo .
==
=
nr
2,
=
;?;:
<
See Yu . V. Linnik (1 964), Chapter 9, and I. V. Ostrovskii ( 1 965).
29 1
CHARACTERISTIC FUNCTIONS WITHOU T INDECOMPOSABLE FACTORS
Corollary to theorem 9.5 . 1 . Suppose that the conditions of theorem 9. 5 . 1 are satisfied and that L(z) = (yz 2 + pz + ex) e1Jz with ex, {3, y and 1J real and 1J 0, where max [(n t - 1 ) �t ' n 2 � 2] < 1J < min [(n 2 - 1 ) � 2 , n t �t] · Then the function L (z) which occurs in the representation of ft (t) is given by L (z) fi1JZ with 0. ¥=
=
ii
�
For the proof of theorem 9.5 . 1 and its corollary the reader is referred to the paper by I . V. Ostrovskii (1 964 ). In this paper Ostrovskii also con siders the case where the constant 1J = 0 or where = 0. The .s ame paper contains several theorems similar to theorem 9.5 Theorem 9 .5 . 1 and its corollary can be used to derive conditions which assure that th e convolution of Poisson-type characteristic functions belongs to 10 •
L(z) .1.
Theorem 9 .5 .2. Let f(t) = exp {}�1 Am [exp (i,um t)- l]} (Am > 0, ,u1 < ,u2 < ,u3) be the characteristic function of the convolution of three Poisson type distri butions.<*> �o.9. uppose that one of the following four conditions is satisfied: ( i) fl t < 0, p 3 > 0, 0 < p2 < min {ft3 , I fl t 1 ) , (ii) fl t < 0, # a > 0, 0 > p 2 > max { - fl3 , ft t ), (iii) 0 < fl t < tt 2 < min (2fl t , tt 3), (iv) 0 > P t > tt2 > m ax (2tt3 , ft t ) · Then every factor of f(t) is also a convolution of at most three Poisson-t y pe distributions, so that f( t) belongs to I0 •
We indicate the proof of theorem 9.5 .2 in the case when condition (i) is satisfied. We choose = = 1, = = 0, 1 and = == A 3, == and put and = (3, == 0 (for 2 = It is then easily seen that > 1 and r == 2). Let further = the conditions of theorem 9.5 . 1 are satisfied and that is the convolution of three Poisson-type characteristic functions. The statement of theorem 9.5 .2 follows almost immediately. In his paper I . V. Ostrovskii indicates a similar result for the convolution of four Poisson-type distributions.
nt n' 1, n 2 , , � � t t 2 fl ft3 a 0 -{At + A2 + A3) b02 Att At 2 At m 1, L(z) A2 e.u2z. f(t) <•> It was shown in Section 8.2,
belong to 10•
p.
n� Amr
==
252, that such a convolution does not necessa rily
ex - D E C O M P O S I T I O N S
10
In this chapter we extend some factorization theorems for analytic char acteristic functions. The results presented are, strictly speaking, of an analytical nature but are closely connected with the arithmetic of distri bution functions. Most of these studies were originally motivated by other, more penetrating investigations of the theorems of Raikov and Cramer. We say that a characteristic function f(t) admits a (finite) ex-decomposi tion if there exist characteristic functions and positive numbers ex1, ex 2 , , such that the relation n = II
(t), /2 (t), . . . , fn ( t) /1 cxn f(t) j= 1 [/; (t)J O:j holds either in an interval f t I < � on which f(t) is different from zero or on a sequence of points {tk} such that lim t k = 0. The powers of the characteristic functions /1 (t) are defined by [/1 (t)] o:1 = exp [ex 1 log f1 (t)], where we take for log /1 ( t) that branch of the logarithm for which log /1 (0) = 0 and which is continuous. Denumerable -decompositions are defined in a •
•
•
k�oo
ex similar way : the finite product in the representation of the characteristic function f(t) is replaced by an infinite product. General th eorems on a-decompositions of analytic characteristic functions The first theorem of this section is related to theorem 8 . 1 . 1 .
10. 1
Theorem 10. 1 . 1 . Let /1 (t),/2 (t), . . . ,fs (t) be arbitrary characteristic func tions and let ex2, , be positive real numbers. Suppose that f(t) is an analytic characteristic function which has no zeros inside its strip of regularity and that the relation II [fj (t) J O:j = f(t) ( 10 . 1 . 1 ) j=1 holds in a neighbourhood of the origin. Then thefunctionsf1 ( t) (j == 2, . . . , s) are analytic characteristic functions and are regular at least in the strip of regularity off( t) and ( 10 . 1 . 1 ) is valid in this strip . In the following we write, as usual, F1 (x) and F (x) for the distribution functions corresponding to /1 ( t) and f ( t) respectively. We show first that the theorem holds if the distribution functions F1 ( x) (j = 1 , 2, . . . ,' s) and cx1 ,
•
•
•
cxs
s
1,
F (x) are symmetric. <*>
will use in the following the properties of symmetric distributions, mainly th eorems 3 . 1 . 2 and 3 . 1 . 3 . ( * ) We
293
oc- DECOMPOSITIONS
We note that it is no restriction to assume that 1 0 . 1 . 2) rx i ?;: 1 (j == 1 , 2, . . . , s) . This can always be achieved by raising both sides of ( 10 . 1 . 1 ) to an integer power. We first prove<*> that the second moments of the distribution functions (j = 1 , 2, . . . , s) exist. The characteristic functions are real and
(
fi ( t) oo f3(t) = J - oo cos tx dFi(x) = 1 - 2 J sin 2 -z dFi(x) so that /;(t) � exp { - 2 r ' oo sin 2 � dF1(x)} Let 4>( t) = log f ( t) be the second characteristic of F (x) we see then from
Fi( x)
oo
-
�
oo
;
(10. 1 . 1 ) that
hence oo
- 00
Kj 2, . . . ad inf. ) .
We
write
ooJ
tx dFj(x) � z
1 (j = 1 , 2, . . . , s) . f 2oc, J for the jth cumulant of and note that K2i - l = 0 (j = 1 , It follows from the preceding inequality that sin 2 21>(t) K2 ) � - 2 = + o ( 1 ) as -+ 0 . 1 2 4 sin 2
-
rfo( t) f(t)
.
§(tx) dFi (x t
t t OCj OCj It follows from Fatou's lemma [see Titchmarsh ( 1 939) , section 10. 8 . 1 ] that the second moments of the distributions Fi (x) (j = 1 , 2, . . . , s) exist. We show next by induction that the distributions Fi(x) have finite moments of all orders. We assume therefore that the distributions Fi (x) (j = 1 , 2, . . . , s) have moments of order 2k and show that this im ·
- oo
-
plies the existence of the moments of order 2k + 2. We differentiate equation (10 . 1 . 1 ) 2k times and obtain on the left side a sum where each term contains derivatives of the We arrange the terms on the left side into three groups and write (10. 1 .3) S1 + S2 + Sa = j(2 k> Here
fi (t).
(t).
(t) (t) (t)
(10 . 1 .4)
sl
JJ2k) .� rx; f <
(t) = f(t) j = l 8
:J
(t) t)
(t)
contains all the derivatives of order 2k while Sa contains only derivatives of even order not exceeding 21?. - 2 ; the sumnland S2 consists of all
<• > The proo f
was
su ggested by R. G. I.Jaha.
(t)
294
CHARACTERISTIC FUNCTIONS
terms which contain a derivative of odd order. We note that each term of S2 necessarily contains two derivatives of odd order, so that [see state 0. We remark further ment (i) of the corollary to theorem 3 . 1 .3] S 2 (0) that each term on the left side of (10.1 .3) has, except for a constant co efficient, the form { n1 { na > { nm fa": . fa, fa , where each is one of the integers 1 , 2, . . . , s and where the positive integers 1 , , satisfy the relation and
( t)
=
2 ) �r > [ t t t) /�1 ) ) J 2 [ [ t (J ) (t) J (t) J . • Jam ( t) J
a1 r r2, , rm nh n 2, (10. 1 .5) �j = l n1 r1 = 2k . •
•
•
•
•
•
m
nm
We see easily from (10.1 .3) that Sa S1 (0) S2 ( 1 0 . 1 .6) + +
k> (0 ) S1 (t) -2 (2 t) (t) -2 Sa ( 0) /(2k> (t) -f(2 t t [ [2 It follows from the corollary to theorem 3 . 1 .3 and from the definition of the functions S2 ( t ) and Sa (t) that Sa (t)- Sa (0) S2 (t) d an t2 t2 tend to finite limits as t goes to zero. Moreover, we conclude from the fact that f ( t ) is an analytic characteristic function that f2k) ( t)- f(2k) (0) liiil t2 exists and is finite. Hence this is also true for 1. sl (t)- sl (O ) Im i2 . We see from (10.1 .4) that sl (t) - sl (o ) � . /J 27c> (t)- fJ 2k> (O) � . +�2lc> (t) !1 (t)- J( t) = t2 t 2f:i\t) j=l j= l t2 It is easy to see that the second sum on the right of this equation tends to a finite limit as t goes to zero ; therefore � !J2k> ( t) -jj2k> (0) ) 2 � f oo x 2k sin 2 !tx x (- 1 ( ) .. ,. 2 2 j=l [ [ j= l also has a finite limit as t approaches zero. Then this is also true fo� each summand on the right of this equation and we use again Fatou ' s lemma to conclude that the moment of order 2k + 2 exists for the distribution func tion F1 (x) (j = 1 , 2 , . . . , s) . This completes the induction. We prove next that the functions /1 ( t) are analytic characteristic func=
.
•
t�o
t--+0
.£.J lf.. :J
.£.J
rx
_
=
k-1
kJ
.£.J lf.. :J J j
ll.. . 'J
- 00
•
I
dF:J.
295
a -DECOMPOSITI ONS
tions. We raise equation ( 10 . 1 . 1 ) to the power 2k and differentiate it 2k times. We write g ( t) = [f ( t)] 2k and obtain ( 1 0 . 1 . 7) S1 * (t) + S2 * ( t) + Sa * (t) = g( 2k> (t) . Here S1 * (t), S2 * (t) and Sa * (t) contain the same kind of terms which we had in S1 (t), S2 (t) and Sa (t) respectively ; expressions (10. 1 .7) and (10. 1 .3) differ only in the numerical values of the coefficients. This difference is due to the fact that we raised (10.1 . 1 ) to the power 2k. We have then Jj2k> (t) sl * (t) - f(t) . � 2ka.; f ( ) . :J t j= l Let be the distribution function which belongs to g(t) and denote by ex�0> , the algebraic moments of order r of . . . , Fs F1 ex�l > . . . , ex�s> , respectively, and put t = 0 in equation (10.1 .7) . Since s2 * (0) = 0 we obtain ( 10. 1 .8 ) S1 * (O ) + Sa * (O ) = ( 1 ) k ex �l where 8
G(x)
G(x), (x),
(x)
-
( 10. 1 .9 )
sl * (0 ) = ( - 1 ) k � 2kex :i ex�l· j= l We conclude from the fact that we raised ( 10 . 1 . 1 ) to the power 2k that 8
Sa * (O) = ( - 1 ) 'c C where C is a positive constant. It follows then from ( 10. 1 . 8 ) and (10.1 .9) that
( - l)k [S1 * (0 ) + Sa * (0 )] =
so that
� 2kex1 ex�k + C = ex�� •
j= l
(j = 1 , 2, . . . , s ; k = 1 , 2, . . . ) . The number ex�� is the (2k) th moment of the distribution function belonging to [f(t)] 2k, that is, of a distribution function which depends on k. It is therefore not possible to conclude from (10. 1 . 10) and the fact that f ( t) is an analytic characteristic function that the power-series expansion of f1 (z) converges, at least in the circle of convergence of f(z) . Our next aim is to show that the f1 (z) are analytic characteristic functions. Let be the radius of convergence of f(z) ; according to Cauchy ' s integral formula we have 2k d 2k ) f( 2k [ ] ! ) ( z dz = . Cl.. 2(ok> = dt 2k [/( t)] 2k l 2 k+ 2:Jl'l C Z t=O ( 1 0 . 1 . 1 0)
ex �� < ex�o,J
R
where C is the circle I z I =
J
R/2 . Let M0 = sup I f(z) I , then (]
296
CHARACTERISTIC FUNCTIONS
2M0jR, and we see from ( 1 0 . 1 .1 0) that rfw�� < ( 2k) ! Mik (j = 1 , 2, . . . , s) . It follows then that fi (z) = fi (t + iy) is an analytic characteristic function which is regular at least in the strip I Im (z) I < M1 1 • One also sees easily that the fj (z) have no zeros in this strip and that the relation (10 . 1 . 1 ) holds in I Im (z) I < M1 1 • We introduce the functions g (z) = fj ( - iz) = J'" oo dF; (x) (j = 1 , 2, . . . , s) g(z) = f ( - iz) = r' e""' dF(x) oo where z = t + iy (t, y real) . The integrals representing the functions gj (z) converge at least in the circle I z I < M1 1 and the relation ( 10.1 .1 a) 11 [gi (z)] cx1 = g(z) 1 j= holds in this circle ; the function g(z) is regular in the circle I z I < R.
where M1 =
i
lf"'
s
In order to prove that the analytic characteristic functions fi (z) are regular, at least in the strip of regularity of f(z), we must show that the radius of convergence of the series expansion of fi (z) around the origin is We carry the proof indirectly and assume that at least at least equal to It is no restric o ne of the series has a radius of convergence inferior to tion to assume that /1 (z) has the smallest radius of convergence r 1 < Clearly r 1 is also the radius of convergence of g 1 ( z) . We note that the functions gj(z) have non-negative coefficients and conclude from Prings heim's theorem<*> that the point z = r 1 is a singular point of g 1 (z). Let � < r 1 2 be a small positive number and put r/),. = r1 - �. We see from ( 1 0 . 1 . 1 a) that the relation
R.
R.
R.
j
( 1 0. 1 . 1 b)
[g i (rLl + w)] ct1 == g (rLl + w) 11 j= l s
I
is valid for sufficiently small w 1 . The expansion of g j ( rLl + w) according to is powers of w has non-negative coefficients and the coefficient of 1 gi (rLl + w) O �, d n. w= In order to obtain an estimate for this coefficient we raise ( 10 . 1 .1 b) to the power n, differentiate n times, and put w == 0. We can again assume that rfwj > . 1 and therefore obtain a sum of positive terms and conclude that nrfwj (10. 1 . 1 1 ) g(ra) "2. [g(rt. + w w = O g; (ra + w) w = < o ; 1 g; (ra)
wn
dn wn
�
1,
p.
<•> See Titchmarsh (1 939),
3 89.
p.
dn dwn
2 1 4,
or
1-Iille (1 962) , 1 ,
p.
dn dwn
1 33,
or
>J
' n
Markushevich (1 965).
297 The function g(r� + w) is regular for I w I < R - r1 • We put � (R - r1 )/2 and apply Cauchy's integral to estimate the expression on the right of (10.1.11). We see that n n f d n w g(r Ll + )] f [ · n (10.1.12) dw. . dwn [g(rLl + w)] 2nz Let p(rLl) sup I g(rLl + w) I , since (R+ r1 ) /2 > rLl + � we see that p(rLl) C (r1) where C(r1) sup I g(z) I is a positive function of r1 but does not depend on � . It follows then from (10.1.12) that dn [g(rLl+w)]"' � n! [C(r1)] n n! [Ct (rt)]"' 15"' dw"' where C1 (r1 ) is a function of r1 and is independent of �. The terms on the left of (1 0.1.11) are all positive, so that d"',. [g; (rLl + w)]"' /1 � n! gitLl1 [Ct (rt)]"'. d g rLl The radius of convergence of the expansion of g ( rLl + w) according to powers of w is therefore not less than [ C1 (r1 ) ] -1 for any (0, r1 /2). But the function g 1 has a singularity at the point z r 1 , so that the radius of convergence of g1 (rLl w) cannot exceed �. Select � so small that < • The assumption that r1 < R then leads to a contradiction. The [C1 (r1)]of- 1convergence of fj (z) around the origin is therefore at least equal radius to R, so that the characteristic functions fj ( z) are regular, at least in the strip of regularity of f(z) . We have therefore established theorem 10.1.1 in the case where the distributions F(x), F1 ( x), . . . , Fs (x) are symmetric, and must now consider the general case.
a - DECOMP OSITIONS
==
w =O
=
=
wn + 1
!w! =6
lw l =6
<
=
lzl = (R+rl)/2
=
w =o
,W
w =O
i
=
+
Ll E
Ll
For this discussion we need the following lemma which is of independent interest.
10 .1.1. Let g(z) be an analytic characteristic function which has the stri
Lemma 'YJ
- ex <
- ex <
=
=
� -·�·· ·· - � - -
298 is exalso an Imanalytic characteristic function which is regular in the strip - - 'Y} < (z) < {3- 17. Let G(x) be the distribution function of g(t) ; the integral C J e - 11"' dG(x) CHARACTERISTIC FUNCTIONS
=
oo
oo
exists and is finite and positive. We put
H(x) � J � e- 11Y dG(y); =
oo
this is a distribution function and we see that
x x x J J t 17 e"' dG x) e� t dH(x) e ( C is its characteristic function. Moreover, it follo\vs from the assumption that characteristic function that h ( t) is also analytic and that git(z)hasis thean analytic strip of regularity - ex - 'YJ < Im (z) < {J We now proceed with the proof of theorem 10.1.1 and suppose that the conditions of the theorem are satisfied by the characteristic functions f(t), /1 (t), . . . , fs( t). It follows from equation (10.1.1) that < 1 o .1.13) II [fj
=
1
-
oo
-
.
==
oo
oo
-
.
oo
- 1] .
•
=
-
j=1
-
=
=
i= 1
=
oc- DECOMP OSI TI ONS and we can conclude that the characteristic functions
299
fj (t + in o) fj (in o)
1, . . . , s) f1(z+ irJ 0)
(z) ({3 + w irJ z 0 + fi (w) (j 1, . . . , s) (w) {3. 10.1.1 f(z) f(z) (z) fj (z) (n. f1 (z) (z) (2n - 1 (z) 10.1.1 [(1964) 4.2.1 ] Theorem 10 .1.1 a. Let /1 ( t), /2 ( t), . . . , fs (t) be arbitrary characteristic functions and let och oc2 , , be positive real numbers. Let {tk } be a sequence of real numbers such that tk 0 and lim tk = 0. Suppose that f(z) is an analytic characteristic function which has no zeros in its strip of regularity and that the relation (10.1.1) holds at the points of the sequence {tk }· Then the functions fj (t) (j = 1, 2, . . . , s) are analytic characteristic functions and are regular, at least in the strip of regularity off( t), and the relation ( 10 .1.1) holds in this strip . (j = 2, are regular at least in the strip I Im oc) /2. There I < is also regular at least in this strip. We write = fore and see that the analytic characteristic functions = 2, are regular at least in the strip - oc < Im < Theorem is therefore prov�d in the case where the strip of regularity of has two horizontal boundary lines. We consider finally the case where is regular in the half-plane Im > oc. In this case we can start with the strip oc, oc) and prove by induction that is regular in the strip is regular in the half) oc for any Therefore < - oc < Im plane Im > oc and the proof of the theorem is completed. Theorem was modified by Yu. V. Linnik theorem in the following way. •
•
•
OC8
=I=
k--* 00
We mention next a theorem which shows that denumerable oc-decom positions are possible.
Theorem 10.1.2. Let fj(t) be a sequence of characteristic functions and let {oc1} be a sequence of positive numbers which are bounded away from zero (i.e. there exists an oc 0 0 such that oc1 oc0for allj). Suppose that f(t) is an analy tic characteristic function which does not have any zeros in its strip of regularity and assume that the relation (10.1.14) II [fj(t)]ctj = f(t) holds in a real neighbourhood of the origin. Then the functions fj (t) are analytic characteristic functions and are regular, at least in the strip of regularity off(z), and the relation (10.1.14) is valid in this strip . This theorem also has a modification which corresponds to theorem 10 .1.1 a. Theorern 10 . 1 . 2a . Let {/1 (t)} be a sequence of characteristic functions and let {oc1 } be sequence of positive numbers which are bounded away fronl zero. >
00
j= l
a
>
300
CHARACTERISTIC FUNCTIONS
Suppose thatf(t) is an analytic characteristicfunction which does not have any zeros in its strip of regularity . Let {tk } be a sequence of real numbers such that tk 0 and lim tk 0 . Suppose that the relation (10 . 1 . 1 4) holds at the points tk; then the functions f1 (t) are analytic characteristic functions and are regular, at least in the strip of regularity off(t), and the relation (10. 1 . 14) valid in this strip. =I=
k---+ oo
=
is
The proofs of theorems 10 . 1 .2 and 1 0 . 1 .2a are very similar to the proof of theorem 10. 1 . 1 and are based on the same idea. One begins by sym metrizing the characteristic functions and proves first that the second moments of the ( exist and then, by induction, the existence of all moments of the ( . This is done by dividing the (2k)th derivative of ( into three sums, exactly as in the proof of theorem 1 0 . 1 . 1 . The proof of the analyticity is also based on the idea used in the earlier proof and leads to a majoration of the moments as in ( 1 0. 1 . 1 ) . The reasoning is, of course, more complicated than in the case of the proof of theorem 10 . 1 . 1 , since infinite series occur and require a careful consideration of technical detail to justify the necessary operations (such as the term-by-term differentiation of the infinite series). The proof that relation (10. 1 . 1 4) is valid in the strip of regularity is obvious in the case of theorem 1 0 . 1 . 1 but calls for a more care ful discussion in the case of denumerable �-decompositions. In view of the similarity of the demonstrations we omit here the proof of theorems 10 . 1 .2 and 10 . 1 .2a and refer instead to the book of B. Ramachandran ( 1 967) where the proofs are presented in full detail. The preceding theorems of this section contain the assertion that the characteristic function on the right-hand side of (10. 1 . 1 ) and of { 1 0 . 1 . 1 4) does not vanish. It was shown by B. Ramachandran (1 965) and by R. Cuppens ( 1 963b) that this restriction is superfluous [ see also B . Ramachandran ( 1 967) ] . Results which are in some respects similar to theorem 10 . 1 . 1 a have been obtained by several authors. We mention here a theorem which is due to R. G. Laha ( 1 960) .
f1 t) f1 t)
f t)
f(t)
Theorem 1 0 . 1 .3 . Let {t1c} (k 1 , 2, . . . ) be a sequence of real numbers such that tk > 0 while t_k tk for any k > 0 and lim tk 0. Let f(t) be a characteristic function and let VJ(z) be a function of the complex variable ze (z t+iy; t, y real) which is regular in a circle about the origin. Suppos that f( tk) VJ( tk) for all k; then f (t) is an analytic characteristic function and f{z) VJ(z) in the strip of regularity. = +
=
+
-
k---+
00
=
=
=
=
For the proof we refer the reader to the paper quoted above. The follow ing particular case is sometimes of interest.
Corollary to theorem 1 0 . 1 .3 . Letf(t) be an even characteristic function and let VJ(z) be function of the complex variable z (z + iy ; y real) which is a
=
t
t,
oc-DECOMPOSITIONS
301
1·egular in a neighbourhood of the origin and which is even for real values of the argument. Suppose that {tk} is a sequence of real numbers such that lim t 0 = k k --* 00 and that f( tk) = VJ( tk) for all points tk. Then f( t) is an analytic characteristic function and f(z) = VJ(z). 10.2 Special results concerning ex-decompositions In Section 10. 1 we assumed only that the function subjected to an ex-decomposition is an analytic characteristic function. In the present section we consider other assumptions concerning this function. We first treat oc-decompositions of entire characteristic functions and then study the oc-decomposition of the characteristic functions of lattice distributions and of some infinitely divisible distributions.
Theorem 10.2. 1 . lfthefunctionf(t) of theorem 1 0 . 1 . 1 or of theorem 1 0. 1 . l a is an entire function of finite order then each function f1 (t) is an entire characteristic function of order not exceeding It follows immediately from theorem 10 . 1 . 1 that the f1 ( t) are entire functions whenever f(t) is an entire characteristic function, so we have only to prove the statement concerning the order of the functions f1 ( t). We introduce the symmetric characteristic functions g(t) = f(t) f( - t) and g1 (t) = f1 (t) f1 ( - t) and denote by ii�) (j = 1 , 2, . . . , s) the moment of order k of the distri bution corresponding to g1 (t). Since g(z) , g1 (z), . . . , gs (z) are entire func tions, equation (10 . 1 . 1 3) holds for all complex z. We can therefore put z = iy (y real) in ( 10. 1 . 1 3 ) and get (1 0.2. 1 ) II [ g (iy)JC(j = g(iy). We note that g(iy) and g1 (iy) are real and that a2k y 2k 1 ( 10.2.2) gi (zy) - k�o (2k) ! It follows from ( 10. 2 . 1 ) and ( 10.2.2 ) that ( 10.2.3) [g1(iy)]ct1 � g(iy) (j = 1 , 2, . . . , s). We denote, as usual, by M(r; g i) and M(r; g) the maximum modulus of the function g1(z) and g(z) respectively and see from theorem 7. 1 .2 that ir) g) = g(ir) = g( M(r ; { (1 0.2.4 ) M (r; g ) = g (ir) = g1 ( - ir) (j == 1 , 2, . . . , s). p,
p.
8
j =l
:i
•
�
-
00
�
- (j)
7
1
•
1
It follows from (10.2.3) and ( 10.2.4) that
(M {
r;
g1)] "1 �
M (r; g).
302
CHARACTERISTIC FUNCTIONS
But this means that the order of g1 (z) cannot exceed the order p of g(z). We see finally from theorem that the order of j1 (z) cannot exceed p . We next consider applications of these results. It follows then from theorem Suppose that = exp that the functions are entire functions of order not exceeding are entire functions Moreover, one sees from that the without zeros and must therefore have the form = exp (j = We have therefore obtained the following theorem :
8.1. 2 f(t) [i,ut- � a 2 t 2]. f1(t) ( 1 0.1.1) /1 (t) [i,u1 t - � a; t 2]
10.2.1 2.
f1 (t) 1, 2, . . . , s). �
Theorem 10 .2.2. Let /1 ( t), r:x/2 ( t), . . . , fs ( t) be arbitrary characteristic functions and let och oc2, , s be positive real numbers. Suppose that the relation 22 II [fi (t)]ctj exp [i,ut - ia t ] holds in a neighbourhood of the origin. Then the characteristic functions /; ( t) (j 1, 2, . . . , s) belong to normal distributions. Theorem 10.2. 2 is a generalization of theorem 8. 2 .1 (Cramer ' s theorem). This extension is due to A. A. Zinger and Yu. V. Linnik. D. Dugue (1957 a) , (1957c) gave a different proof for theorems 10.1.1 and 10.2.2; he deduced •
•
•
s
=
j=1
=
these results from properties of the products of positive powers of ab solutely monotonic functions. We prove next an oc-decomposition theorem for lattice distributions. This theorem is an important tool in studying the oc-decomposition of the Poisson distribution but has also some independent interest.
Theorem 10.2.3. Let /1 (t), /2 (t), . . . , Is (t) be arbitrary characteristic functions and let och oc2, , ocs be positive real numbers. Suppose that f( t) is the characteristic function of a lattice distribution F(x) and that the relation (10. 2.5) II [fj (t)]ctj f(t) holds. The characteristic function f1 ( t) then belongs also to a lattice distribution Fj (x). Moreover, if f(x) is an entire characteristic function without zeros which belongs to a lattice distribution whose lattice points are the non negative integers, then each F1 (x) is a one-sided lattice distribution whose dis continuity points are contained in a set of the form ,u1 + ( 0, 1, 2, . . . ad inf.) where 0. � The first assertion of the theorem is an immediate consequence of theorem 2.1. 4 . If / ( t) is a lattice distribution then there exists a real •
8
j=1
•
•
=
v v =
8
j=1
OC ; ,Uj =
oc- DECOMPOSITIONS
303
that I f(t0) I = 1. But then necessarily I fi (t0) / = 1 ( j = 1, t0 0 such 2, . . . , s), so that fi ( t) also belongs to a lattice distribution. To prove the second part of the statement we apply formula (7.2.3a) and i=
see that
[F ] = - lim (1 /y) log f(iy) 0 where s (10.2.7) - (1/y) log f(iy) = � ocj [ - (1/y) log _{, (iy)] . The fi(t) are, according to theorem 10.2.1, entire characteristic functions and #i = - lim (1/y) log fi (iy) is the left extremity of Fi ( x) . We see from (10. 2 .6) and (10.2.7) that all #i are finite and that s (10. 2 .8) � OCj ftj 0. Since F ( x) has its discontinuity points at the non-negative integers we have f(2n) 1 and therefore also I fi (2n) I = 1 (j = 1, 2, . . . , s). It is then easy to see that the discontinuity points of Fi (x) are contained in the set Pi+ where runs through all non-negative integers. The oc-decomposition theorem for the Poisson distribution is an exten sion of Raikov's theorem (theorem 8. 2 . 2 ). Theorem 10.2.4. Let f1 (t),f2 (t), . . . ,fs (t) be arbitrary characteristic functions and let och oc2, , oc8 be positive numbers. Suppose that the re lation s {10.2.9) II [fi(t)]ctj = exp [A(eit _ 1)] (A ?;: 0) holds in a neighbourhood of the origin. Then fi { t) exp [.Ai (eit - 1) + it--t1 t)] where Aj 0 and #i are real numbers. To prove theorem 10. 2 . 4 we set f(t) = exp [A(eit _l ) ] in theorem 10.2.3 and conclude that (10.2.10) fi( t) = eit�-tJ � p�>eitv (10.2 .6)
lext
=
1/-+ 00
j=l
1/-+ 00
=
j=l =
v,
v
•
•
•
j=l
==
?;:
00
where
v=O
p �> � 0, � p�> = 1 (j 1, 2, . . . , s ; 00
and
v=O
=
v
=
0, 1, 2, . . . )
304
CHARACTERISTIC FUNCTIONS
It follows from the last equation and the assumption (10.2. 9 ) of the theorem that {1 0.2. 1 1 ) holds for real t. We see from theorem 10. 1 . 1 that the functions /; (t) are entire characteristic functions and conclude from (1 0.2. 1 1 ) that they have no zeros. Relation (1 0.2. 1 1 ) is therefore valid also for complex values of the variable. We put z complex) and write
w = eiz (
g1 (w) = � p�> wv and see easily that the g1(w) are entire functions without zeros. We can then rewrite (1 0.2. 1 1 ) in the form (1 0.2. 1 2) IJ [ g1 (w)]ctj = exp [A.(w - 1)]. The power series for the functions g1 ( w) and also for the function g(w) = exp [A.(w - 1 )] have non-negative coefficients, so that M(r; g1) = g;(r) and M(r; g) = g(r). Since for r > 1 the functions g1 (r) and g(r) are increasing functions of r , we see that g1(r) g1(1) = 1 and conclude from (10.2. 1 2) that g1(r) = M(r; g1) exp [A.(r - 1 )] for r 1 . The function g 1 ( w) is therefore an entire function of order not 00
v =O
s
j=l
.•
;?;:
�
;::::
exceeding 1 . Since it has no zeros, we conclude from Hadamard's factoriza tion theorem that it has the form exp or, since (1 ) 1, exp [ 1 )] . We see finally from (10.2.9) that (t) exp ( eit _ 1 ) t so that the theorem is proved.
g1 =
Remark.
g1 (w) = (A.1 w +f31) g1 (w) = A.1 (w f:i = [A.1 + i,u1 ]
The statements of theorems 10.2.2, 10.2. 3 and 10.2.4 are also valid if one replaces the assumption that (10.2.4) [respectively (10.2.5) or (1 0.2.9)] is valid in a real interval containing the origin by the assumption that these relations are satisfied in the points of a sequence {tk} such that
oc-DECOMPOSITIONS
tk
=I= 0, while lim
k-+ oo
305
tk = 0. It is also possible to derive corresponding de-
numerable oc-decomposition theorems.
Yu. V. Linnik (1 959) obtained an oc-decomposition theorem for infinitely divisible characteristic functions.
Theorem 1 0 .2.5. Let /1 (t), /2 (t), . . . , fs (t) be arbitrary characteristic functions and let och oc2, , be positive numbers. Let {tk } be a sequence of real numbers such that tk 0 and klim t = 0 . Suppose that f(t) is a charack --*oo teristic function of the class which has a bounded Poisson spectrum and that the relation (10. 2. 1 3 ) II [fj (t)] OCj = f(t) holds at all points of the sequence {tk }· Then the f1 (t) belong also to and the relation (10.2. 1 3 ) holds for all t. The functions f1 (t) are infinitely divisible entire characteristic functions and their spectra are subsets of the spectrum of f(t). For the proof we refer to Linnik (1 959) or to the monograph of Linnik ( 1 964) . •
i=
•
•
OC8
.P
8
j=l
.P
We also note that the proof of theorem 9 .2. 1 uses only the ridge property of analytic characteristic functions. Using this fact, an oc-decomposition theorem corresponding to theorem 9 .2. 1 can be derived. We conclude this section by mentioning a few additional results of the type discussed in this chapter. R. Cuppens (1 963b) and B. Ramachandran (1 965) have proved a de numerable oc-decomposition theorem for the convolution of a binomial and a Poisson distribution with the same span. R. G. Laha and E. Lukacs ( 1 962) considered the situation of theorem 10. 1 .1 but replaced the assump tion that is an analytic characteristic function by the premise that has derivatives up to the order 2N and obtained a finite oc-decomposition theorem. A corresponding denumerable oc-decomposition theorem is due to R. Cuppens (1 963 a).
f(t)
f(t)
11
B O U N D A RY C H A RA C T E R I S T I C F U N C T I O N S
In Chapter 7 we introduced analytic characteristic functions and studied their properties. In the present chapter we deal with characteristic functions which are boundary values of analytic functions. We say that a characteristic function is the boundary value of an analytic function if there exists a complex-valued function of the complex variable = + which is regular in the rectangle
f(t)
A(z)
z t iy { I t I < �, o < y < b} [respectively in the rectangle { I t I < �, - a < y < 0}] and has the f(t) for I t I < Ll and y > 0 [respectively for property that lim A(t+iy) I t I < Ll and y < 0]. The class of characteristic functions just described 11�0
=
includes the class of analytic characteristic functions but is more extensive. For the sake of brevity we will call "boundary characteristic functions" those characteristic functions which are boundary values of analytic functions without being analytic characteristic functions. If is a bound ary characteristic function then we can extend its definition to complex = values of the variable by writing
f(z) A(z).
f(t)
The integral representation In this section we derive a number of properties of boundary charac teristic functions which are similar to results for analytic characteristic functions obtained in Chapter We give first a necessary and sufficient condition which a distribution function must satisfy in order that its characteristic function be a boundary characteristic function. 11.1
7.
Theorem 1 1 . 1 . 1 . Let F (x) be a distribution function and f(t) be its charac teristic function. The function f(t) is the boundary value of an analytic function A(z) (z t +iy ; t, y real) which is regular in the rectangle I t I < 0 < y < b if, and only if, the integral f' oo e- •�<JJ dF (x) exists and is finite for 0 y < b but does not exist for y < 0. =
d,
�
We first prove that the condition of the theorem is sufficient and assume therefore that
307
BOUNDARY CHARACTERI STIC FUNCTIONS
y < b. Let g1 (z) = J� eizre dF(x) (1 1 . 1 . 1) g2 (z) = J � e= dF(x). The function g 1 ( ) is regular for lm (z) < b, while g 2 (z) is regular for lm ( ) > 0. Therefore oo z) = g1 (z)+g2 (z) = J oo ei F(x) A( . is regular in the strip 0 < lm (z) < b ; moreover, oo lim A(t+ iy) = J eitz dF ( x) = f ( t). oo To prove the necessity of the condition we assume that f ( z) is a boundary characteristic function. Let g 1 (z) and g2 (z) again be given by (1 1 . 1 . 1 ) , then f(t) = gl (t)+ g2 (t). (1 1 . 1 . 2) The function f( z) is regular in a rectangle, say in D1 = { I t I < �, 0 < y < b }, while g 2 ( ) is regular in the upper half-plane. Therefore g1 (z) is regular in D1 ; on the other hand, it follows from the definition of g1 (z) that it is regular in the lower half-plane, so that g1 (z) is regular in the rectangle D 2 which is symmetric to D1 with respect to the real axis. It follows then from Schwarz ' s symmetry principle ( see Appendix E) that g 1 (z) is regular in the rectangle D = {I t I < �, I y I < b}. We first assume that F(O) 0 and consider the function g1 (t) = 1 J 0 e'"'dF ( ) F(O) F(O) This is an analytic characteristic function whose strip of regu larity con tains the strip I lm (z) I < b. Therefore gl (iy) = J� oo e--1/x dF(x) exists and is finite for I y I < b. Since the integral J� e-""" dF(x) exists for y 0, we see that Joo oo e-11"' dF(x) exists and is finite for 0 y < b, so the necessity of the condition is proved if F( O) 0. In the case where F(O)A criterion = 0 we note that f (t) = g 2 (t) and obtain the necessity of the condition. analogous to the statement of theorem 1 1 . 1 . 1 holds for characteristic functions which are boundary values of functions regular in ct n l {I t I < �, - a < y < 0 } contained in the lower half-plane. e in the proof theorem 1 1 . 1 . 1 indicates
is finite fo r 0
�
00
z
z
""'
d
1/ t O
z
i=
-
't
;;;;:
a
re a g e The argument u s d
X ·
oo
i=
of
�
that
a
308
CHARACTERIST IC FUNCTIONS
boundary characteristic function can be represented by a Fourier Stieltjes integral in a horizontal strip. Let < < be the strip of greatest width in which the boundary characteristic function admits the representation
0 y f3
f(z)
( 11.1.2) f(z) f ' oo eizz dF (x) ( 0 < Im (z) < {J). The strip 0 < lm (z) < {3, in which (11.1. 2) is valid, is called the strip of regularity of the boundary characteristic function f(z) . The validity of the representation ( 11.1. 2) is the reason for the similarity of many properties =
of boundary characteristic functions and of analytic characteristic functions. The discussion of these properties is facilitated by the following lemma :
f(z) be a boundary characteristic function with the strip Let Lemma 11.1.1. of regularity 0 < lm (z) < f3 and choose a real 'YJ such that 0 < 'YJ < f3. Then ) f(z+ i 'YJ (11.1.3) h(z) f(i'YJ) is an analytic characteristic function which is regular in the strip lm (z) < f3 - 'YJ . Lemma 11.1.1 is analogous to lemma 10 .1.1 for analytic characteristic functions and is proved in the same way. The distribution function corresponding to h(z) is (11.1. 4) H(x) � r oo e- 1]11 dF(y), where C f(i'YJ) and F(x) is the distribution function corresponding to f(z). Corollary 1 to theorem 11.1.1. The strip of regularity of a boundary characteristic function f(z) has one or two horizontal boundary lines. One of these is always the real axis. The purely imaginary points on the boundary are singular points off(z). Corollary 2 to theorem 11.1.1. Boundary characteristic functions have the ridge property moreover the zeros and the singular points of boundary characteristic functions are located symmetrically with respect to the imaginary . axzs. Corollary 3 to theorem 11.1.1. A boundary characteristic function has no zeros on the segment of the imaginary axis located in its strip of regularity . Corollary 4 to theorem 11.1.1. Let f(z) be a boundary characteristic unction whose strip of regularity is 0 < lm (z) y < {3. Then log f(iy) is fconvex for 0 < y < =
'YJ <
=
==
.
:J
(3.
==
309
BOUNDARY CHARACTERISTI C FUNCTIONS
Corollary 5 to theorem 11.1.1. Let F (x) be a distribution function which has a boundary characteristic function with strip of regularity 0 < Im (z) < {3. Then log F(-x) . = - 1m sup Similarly, iff(z) has - rx < Im (z) < 0 as its strip of regularity then log [ 1 - F(x)J} { = lim sup rx . These corollaries follow immediately from lemma 11.1.1 and the corre sponding theorems of Chapter 7. Theorem 11.1.2. Let F(x) be a distribution function andf(t) its characteristic function. F (x) is bounded to the left (or right) if, and only if, f(t) is regular in the upper (respectively lower) half-plane and if I j(z) I � eclzl for some c > 0 and Im (z) > 0 [respectivel y Im (z) < 0] . The extremity of F(x) is given by lext [F] = - lim y - 1 log f(iy) [respectively rext [F] = lim y 1 log f( iy ) ] . The formulae for the extremities were derived in Chapter 7 under the p
R
1.
x� oo
x� oo
y� oo
-
X
X
y� oo
-
assumption thatf(z) is an analytic characteristic function. We now see that they are also valid if this restriction is dropped. To prove theorem we first note that the given distribution and the distribution which is defined by have the same extremities. The statement follows immediately from lemma and from theorem and its corollary.
7.2.2
Remark.
11.1.2 H(x)
(11.1.4)
11.1.1
F(x)
A one-sided distribution function has either an analytic characteristic function or a boundary characteristic function. We next consider factorizations of boundary characteristic functions.
Lemma 11.1.2. Let F(x), F1 (x) and F2 (x) be distribution/unctions and f(t),f1 (t) andf2 (t) their characteristicfunctions. Suppose that f e-11"' dF(x) exists and is finite for 0 � y < b. If F = F1 * F2 then the integrals J e- 11"' dF1(x) (j = 1, 2) exist and are finite for 0 y < b, and the relation 00 f "' e-11"' dF (x) = f e -uo: dF1 (x) f: e- uo: dF2 (x) holds for 0 y oo
oo
oo
�
oo
�
<
b.
00
oc
oo
310
CHARACTERISTIC FUNCTIONS
The proof of the lemma is completely analogous to the proof of the convolution theorem.
Theorem 1 1 . 1 .3 . Let f(t) be a boundary characteristic function with strip of regularity 0 < Im (z) < {3. Then any factor /1 (t) of f(t) is regular, at least in the strip of regularity off(t). Since /1 (t) is a factor of f ( t), there exists a characteristic function /2 ( t) such that f(t) = /1 (t)/2 (t). Let F(x), F1 (x) and F2 {x) be the distribution functions which correspond to f(x), /1 (x) and /2 (x) respectively. Then oo F = F1 * F2• We see from theorem 1 1 . 1 . 1 that the integral f e- 11"' dF(x) is finite for 0 < Im ( z) < {3, and we conclude from lemma 1 1 . 1 .2 that the oo integrals f "' e -u oo dF; (x) (j = 1 , 2) are also finite for 0 < Im (z) < (J. Therefore f1 (z) (j = 1 , 2) is also regular at least in this strip ; moreover we see from lemma 1 1 . 1 .2 that the e uation f(iy) = f1 (iy )f2 (iy) holds in the strip of regularity of f(z). The relation f(z) = /1 (z) /2 (z), valid in the strip 0 Im (z) < {3, then follows by analytic continuation. 00
q
�
Theorem 1 1 . 1 .3 is analogous to theorem 8. 1 . 1 for analytic charac teristic functions ; it shows that the factors of boundary characteristic functions are either analytic characteristic functions or boundary charac teristic functions. We conclude this section by mentioning another property of boundary characteristic functions noted by A. Zygmund (1 95 1 .
) Theorem 1 1 .1 .4. Let {Fn (x)} be a sequence of distribution functions and let {fn (t)} be the corresponding sequence of characteristic functions. Suppose that the fn (t) are boundary characteristic functions and that they are regular in fixed strip (independent of n). The sequence of distribution functions converges weakly to a distribution function F(x) if, and only if, the following two con ditions are satisfied: (i) the functions fn (t) converge to a limiting function f(t) in a fixed interval around the origin ; (ii) f(t) is continuous at t = 0. a
Infinitely divisible ·b oundary characteristic functions In this section we study boundary characteristic functions which are infinitely divisible and one-sided infinitely divisible distributions. As an example of such a characteristic function we mention the stable distribution with parameter � = y = whose frequency function was given by f�rmula (5 .8.9). 1 1 .2
�, Lemma 1 1 .2.1 . An infinitely divisible boundary characteristic function has no zeros in the interior of its strip of regularity. The lemma corresponds to theorem 8.4. 1 and is proved in the same way.
311
BOUNDARY CHARACTERISTIC FUNCTIONS
The next theorem shows that a canonical representation of infinitely divisible distributions also holds in the strip of regularity of boundary characteristic functions. This is similar to the statement of theore m 8. 4 Since a boundary characteristic function does not necessarily have a finite second moment, the representation cannot be the Kolmogorov representa tion 11sed in theorem 8.4.2. We will use as our starting-point the Levy canonical representation and will have to modify our reasoning somewhat.
.2.
Theorem 11.2.1. Let f(z) be an infinitely divisible boundary characteristic function. Then the canonical representationo )2 dM(u) (11.2.1 ) log f(z) = iza- z z2 + Jr -- oo ( e'•u - 1 - 1 izu u + ( )2 dN (u) + J + o eiw - 1 - 1 izu +u is valid in the interior of the strip of regularity off(z). The constants a and and the spectralfunctions M(u) and N(u) satisfy the conditions of theorem 5.5.2. We first assume that 0 < Im (z) < f3 is the strip of regularity of f(z). It follows from lemma 11. 2 .1 that log f(z) is regular in 0 < Im (z) < f3 and continuous in 0 � Im (z) < {3. Since f(t) is infinitely divisible it admits the Levy representation ( 11. 2 .1 ) for real t. We write for Im (z) � 0 ( izu ) l ( 11. 2 . 2) �1 (z) = J + o eizu _ - 1 + u 2 dN(u). The function �1 (z) is regular for Im (z) > 0 and continuous for Im (z) 0. We put for Im ( ) 0 o i _ izu ) r- ( �2 (z) = J oo e zu 1 - 1 + u 2 dM(u); ( 11. 2 .3 ) the function � 2 (z) is regular for Im (z) 0 and continuous for Im (z) 0. Let VJ(z) = Iog f(z) -iaz- � a 2 z 2 -�1 (z). ( 11.2. 4) It follows from our assumptions that VJ (z) is regular for 0 < Im (z) < f3 and continuous for 0 � Im (z) < {3. Since f(t) is infinitely divisible we see from its Levy canonical representation that VJ(t) = � 2 (t) for real t. We conclude then from Schwarz's reflection principle tha t VJ(z) is Im (z) < fl. the analytic continuation of � 2 (z), so that � 2 (z) is regular Therefore �� ' (z) s regular in Im (z) {3. For Im (z) < 0 we have from (11.2.3 ) the integral representation ��' (z) = J=: e'Zl' u2dM(u). a2
oo
a
2
co
�
�
z
<
<
i
-
J ..
�
in
312
CHARACTERI STI C FUNCTIONS
We introduce the non-decreasing function
L(u) = J � oo v 2 dM (v) (u
and see tha t
�" ( z) = -
<
0)
J =: e-izu dL(u).
The function �" (z) is-except for a constant factor-an analytic charac teristic function with strip of regularity lm (z) < {J ; therefore its repre sentation by a Fourier integral is valid in this strip. We then see easily that the representation (1 1 .2.3) can be extended and is valid for lm ( z) < {J. lm (z) < {J we see from the equations ( 1 1 .2.2), Since VJ (z) = cp 2 (z) in 0 (1 1 .2.3) and 1 1 .2.4 that log z admits the representation (1 1 .2. 1 ). The proof follows the same lines if the strip of regularity ofj z is given by - ex� < Im (z) < 0. We turn now to the study of infinitely divisible one-sided distributions. In tl1is connection we need the following result :
(
)
�
f( )
()
Lemma 11.2.2. Let F (x) be distribution function which is bounded from the left (right) and let f(t) be its characteristic function. Then the factors of f(t) belong also to distribution functions which are bounded from the left (right). a
The lemma follows easily from theorem 7 .2.2 and lemma 1 1 . 1 . 1 .
Theorem 1 1 .2.2. Let f(t) be the characteristic function of an infinitely divisible distribution function F(x). The distribution function F(x) is bounded to the left if, and only if, the following three conditions are satisfied: (i) a 2 = 0 (ii) M (u) is constant for u < 0 (iii) J : udN(u) < Here a 2 is the constant, M (u) and N(u) are the spectralfunctions occurring in the canonical representation (1 1 .2. 1 ) off(t). If conditions (i), (ii) and (iii) are satisfied, then oo 2 dN(u). lext [F ] = a- J 1 +u We first prove that the conditions are necessary. (i) If a 2 > 0, we see from (1 1 .2. 1 ) that f(t) = exp ( - � a2 t 2) g(t) where g(t) is the infinitely divisible distribution without normal factor which is determined by the constant a and the spectral functions M(u) and oo .
U
o
31 3
BOUNDARY CHARACTERI STIC FUNCTIONS
N(u). This means thatf(t) has a normal factor, contradiction to lemma 11.2.2. (ii) If M (u) is not constant for u < 0, then there exists a finite interval [a, b] , < b < 0 such that C = M(b) - M(a) > 0 . The function g(z) = � exp [ J : (eiz« - 1)dM(u)J is an entire characteristic function which is a factor ofj(z). But g(z) cannot satisfy the conditions of theorem 7 . 2 . 2 , so that g( t) cannot be the charac teristic function of a distribution bounded to the left. This contradicts lemma 11. 2 . 2 , so that the necessity of (ii) is proved. For the proof of the necessity of (iii) we can therefore assume that (i) and ( ii) are valid, and we see from ( 11. 2 .1) that for y > 0 1 3 u log f (iy) = ay+ f (e - uu _ 1 + yu) dN (u) -y f1 1 + u 2 dN(u) + J� (e - uu _ 1 + 1 :uu 2) dN(u). We write l R(y) == J e - vu_y1 + yu dN (u) in
a
o
-
and get
(11.2.5)
o
0
l u3 2dN (u) - J dN(u). logf(iy) ;?;: - ay+yR(y)-y J 1 +u 1 oo
o
We give an indirect proof for (iii) and assume tentatively that
(11.2.6) J : udN(u) = oo. If we can show that (11.2.6) implies (11.2.7) lim R(y) = oo In view of theorem then it follows from ( 1 1.2.5) that lim � Iogf(iy ) = Y 11.1.2, this contradicts the assurrtption that f (t) belongs to a distribution bounded from the left. The necessity of (iii) will therefore be established as soon as we show that (11.2.7) follows from (11. 2 . 6 ). Let H(u) be defined by H (u) = J : vdN (v) (u > 0 ) . 1"'hen H(u) is non-decreasing and we see from (11. 2 . 6 ) that (11. 2 . 8 ) li (O) = Y-+ 00
y� oo
..
oo •
oo .
314
CHARACTERISTIC FUNCTIONS
(e-x - 1 + x)jx is positive and non-decreasing in l u_ e 1 e v + yu l v ;;;;: u R(y) J yu dH (u) J v +v dH( yv) so that R(y) ;;;;: e -1 [H( l )-H(�)J . so that the necessity of (iii) It follows from (11. 2 .8) that lim R(y) = +
It is easily seen that {0, + oo ). Therefore =
o
1
oo,
y-+ 00
is completely proved. We prove next the sufficiency of the conditions (i), (ii) and (iii). We assume that these conditions hold, and we obtain, for real the canonical representation
u i _ log f(t) = iat + J � ( e tu 1 - � 2) dN(u). 1 u
t,
If we replace in the integral the real variable t by the complex variable z = t+ then we obtain a function which is regular in the half-plane > 0 and continuous in � 0. Therefore f(t) is either an analytic characteristic function or a boundary characteristic function, and we see from theorem that the canonical representation is valid in the upper half-plane. Therefore
y
iy
y
11.2 .1 u _ uu a e log f( i y) = - y+ J �( 1 + 1 : u 2) dN(u) (y ;;;;: 0). (11.2 . 9) We put oo u _ l e v Q( y) = J y dN(u) and see from ( 11.2 . 9) that (11.2.10) log f(iy) = - ay+y J 1 + u 2 dN(u)+yQ(y). It follows easily from assumption (iii) of theorem 11.2. 2 that J 1 +u 2 dN(u) < and that lim Q(y) = 0. 0
oo
o
oo
U
U
oo
o
y-+ oo
Therefore we conclude from (1 1 .2. 10) that
iy a - J oo 1 +uu 2 dN(u),
lext [F ] = - lim ! log f( ) = u-+ oo
y
o
so that the proof of the theorem is completed. A theorem concerning infinitely divisible distributions which arc bounded to the right can be stated and proved in the same way.
M I X T U R E S O F D I S T R I B U T I O N F U N C '"f i O N S A N D T RA N S F O RMA T I O N S O F C H A RA C T E R I S T I C FUN CTI O NS 12
In this chapter we discuss briefly certain integral transforms of distribu tion functions. These transformations can be used to construct new characteristic functions from given characteristic functions. Mixtures of distribution functions be n distribution functio11s ; we saw in Let G1 G2 Section that
12.1
(x), (x), . . . , Gn (x) 2.1 F (x) � a1 G1 (x) is also a distribution function, provided that a1 0 (j 1, 2, ) and � a; 1 . We can regard F(x) as a mixture of the distribution functions G1 (x), . . . , Gn (x) with weights ah . . . , an . In the present section we consider a 1nore general mixing procedure and apply it also to the corresponding character istic functions. Let G (x, y) be a family of functions which has the following properties : (i) for each value of y the function G (x, y) is a distribution function . 1n x ·, (ii) G (x, y) is a measurable function of y. The functions G (x, y ) form a family of distribution functions which depends on a parameter y. In the following we consider only families {G (x, y)} of distribution functions which satisfy conditions (i) and (ii). An exhaustive discussion of mixtures of distributions was given by H. Robbins (1948). Let H(y) be an arbitrary distribution function ; we form the expression oo (12.1.1) F(x) f G(x, y)dH(y) and see easily from the dominated convergence theorem [ Loeve (1963) pp. 124- 127] that F(x) is a distribution function. The corresponding characteristic function is then given by (12.1.2) f(t) s:oo g(t, y) dll ( y) =
n
j=l
�
n
j=l
=
=
00
=
=
. . . , n
316
CHARACTERISTIC FUNCTIONS
where
i1"' e d.,
g( y) J :"" G (x, y) . Mixtures of distributions occur in a great variety of practical applications and were used by W. Feller (1943) to study contagious distributions. Two particular cases of (12.1.1) are of some interest. (I) If G (x, y ) is a purely discrete distribution, G(x, y) = � Pv ( y) s(x -�v), then F(x) = � [ J :00 Pv (y)dH(y)] e(x - �v) t,
=
f)
is also a discrete distribution. The distribution which is obtained for
pv { y) = 11 Y" �v = v (v = 0, 1 , 2, . . . ) e
-
v.
-
r,
is called the compound Poisson distribution. ( II ) If
H(y) = � Pv s( y-nv) a purely discrete distribution then ( 1 2. 1 . 1 ) yields F (x) = � Pv G (x, 'fJv)· We put here v A Pv = v . , 'YJv = V and let G(x, ) = [ G(x)]"'* be the v-fold convolution (t) of G(x) with itself ( = 0, 1, 2, . . . ) . Then v A F (x) = v�=O [G (x)]"'* is called the generalized Poisson distribution. Its characteristic function is f(t) = exp {A[g(t)- 1] } . In the following \Ve consider a slightly more general mixture of distribu tion functions. rfhe process still has the form ( 12.1.1) but we relax the assumptions concerning the weight function H(y) in so far as we do not require that H (y) be a distribution function. We will only assume that H (y) is a non-decreasing function whose total variation is e qual to 1. We = 00 J "
is
'V
v
e - .\
v
oo
(t) Thus G (x, v) is defined by G (x, 1 ) G (x, v)
for
v ==
2, 3, . . . .
=
00
,
-
.\ e- -, V.
G (x) and the relations
G (x -y, v - 1 ) dG ( y)
317
MIXTURES AND TRANSFORMATI ONS
- oo) =1= 0 and make no assumptions therefore admit the possibility that concerning the values of at its discontinuity points.
( H H( y) Theorem 12.1.1. The function (12.1.3) F(x) J oo G(x, y)dH (y) is a distribution function whenever {G (x, y) } is a family of distribution functions which has the properties (i ) and ( ) if, and only if, the conditions (a) H (y) is non-decreasing oo 1 (b) J oo dH ( y) are satisfied. We note that the characteristic function of F(x) is (1 2. 1 .4) j(t) J oo 00 g(t, y)d ( y), where g( t, y) is the characteristic function of G (x, y) . The sufficiency of the conditions follows easily from the properties of the family G (x, y) and from the dominated convergence theorem. To prove that conditions (a) and {b) are necessary we specialize the family G (x, y). Let and 'YJ 2 be two arbitrary real numbers such that 1] 1 < 'YJ 2 and select 1) if 'YJ < y 'YJ x s( { G (x, y) s(x) if y or y 1]2• It is then easily seen that F(x) s(x - 1) [H('YJ 2)-H(n1)] +s(x)[1 - H('YJ2)+H (n1)]. If F(x) is a distribution function then we must necessarily have H ('YJ2)- H ('YJt) 0 s(x) for ally and see that which proves (a). To prove (b) we select G (x, y) 00 F(x) e(x) J 00 dH ( y) =
00
ii
=
lJ
=
'Y}l
�
1
=
2
� 'Y} 1
>
=
�
=
=
so that (b) must be satisfied. We remark that condition (a) is necessary only to assure that the weight function should produce a distribution function, whatever family, satis fying (i) and ( ii), is used in (12. 1 .3). We illustrate this by an example where a non-monotone weight function is used to transform a suitably chosen family into a new distribution. Let H ( y)
=
1
\/(2)[:yt(2) - i] [e( y - 1 ) + e(y + 1 ) - V(2) s( y)]
318
CHARACTERISTIC FUNCTIONS
be the weigl1t function and consider the family of normal distributions that is ( t) with mean and standard deviation
y
2a,
) x-y G (x, y) ( 2a . Then F(x) v'(2) [ �(2)- 1 ] [�(x�l ) + � (x:al ) - v'(2)�(;:)] . =
ci>
=
.This is an absolutely continuous function with derivative
F' (x) 2ay'(4n) �v'(2)- 1 ] {exp [- (x - 1)2 /8 a 2] + exp [- (x+ 1) 2 / 8a 2) - y (2) exp [ - x 2 j 8 a 2]}. The function F(x) is a distribution function whenever F' (x) 0 for all x; it is easy to show that this condition is satisfied if a 4 1og1 The characteristic function of F(x) is, according to (12.1. 4), given by f(t) _- [ v(2)v(2)cos-t-1 t ] exp (-2a2 t 2). =
X
�
2
z·
�
Transformations of characteristic functions We have already noted that the mixture of distribution functions in duces a mixture of the corresponding characteristic functions. We now to discuss certain transformations of use the results of Section characteristic functions. 12.2
12.1 Theorem 12.2.1. Let {fv (t)} be an arbitrary sequence of characteristic functions and {av } be sequence of real numbers. The necessary and sufficient condition that (12.2 .1) f(t) � av fv (t) should be a characteristic function for every sequence of characteristic functions is that (12.2 .2) v This follows from theorem 12.1.1 if we put H( y) � av c(y -v). a
=
00
v=O
=O
(t) Here
=
4)(x)
=
1
V 2 77
00
v=O
f ro
_ 00
exp
( z2/2 ) dz. -
3 19
MIXTURES AND TRANSFORMATIONS
g(t) be an arbitrary characteristic function and write fv (t) [g(t)] v v = 0, 1 , 2, . . . . We obtain immediately the following Corollary to theorem 12.2. 1 . Let g( t) be a characteristic function and let A(z) be a function of the complex variable z which is regular in r z I < R, where R > 1 . The function A [g(t)] is also a characteristic function if, and only if, A(z) has a power= series expansion about the origin zoith non-negative coefficients and if A( 1 ) 1 . The corollary can also be derived directly from theorem 12. 1 . 1 if we set H (y) = v av s(y - v) and G(x, y) = [ G(x)] v* for v � y < v + 1 . An interesting generalization of the corollary to theorem 12.2. 1 has Next we let = for corollary :
�
been derived by C. S. Herz ( 1 963) and also by A. G. Konheim-B. Weiss ( 1 965).
Theorem 1 2.2.2. Let =A(z)A[g(t, be a function of the complex variable z which has that f(t) )] is a characteristic function whenever g(t) is the propert y a characteristic function. Then A(z) can be represented by a series, convergent for I z I 1 , which has the fornz � a A(z) = where the arn.n are real and where am.n ;:::: 0 and � � a n = 1 . Clearly the function A(z) need not be regular ; a simple example is the function A(z) = I 1 2 • For the proof of theorem 12.2.2 've refer the reader �
00
rn = O
00
n m,n zrn z
n=O
00
00
m
.
m = O n=O
z
to the papers quoted above. In a subsequent paper A. G. Konheim-B. Weiss (1 968) investigated transformations of non-negative definite functions into infinitely divisible non-negative definite functions.( t) They obtained the following result, formulated here in terms of characteristic functions.
Theorem 12.2.2a. Let O(z) be a complex-valued function of the complex variable The function O(z) has the propert that f(t) = O[g(t)] is an z. y infinitely divisible characteristic function whenever g( t) is a characteristic function if, and only if, O(z) = exp [cA(z) - 1 ] , where c is a positive constant, while A(z) is the function defined in theorenz 12.2.2. The sufficiency of the condition follows from theorem 12.2.2 and De Finetti' s theoretn ; for the proof of its necessity the reader is referred to the paper quoted above. (t) These
Hu thors worked in d1c tnore general framework of locally compact Abelian groups havin g clelnc n t H c)f nrb itru l'i ly high ord er. M
3 20
CHARACTERISTIC FUNCTIONS
Theorem 12.2 .3. Let g(t) be an arbitrary characteristic function and let p be real number such that p > 1 ; then f(t) = pp--g(t)1 is an infinitely divisible characteristic function. Let n be an arbitrary integer and put H(y) = v=O� av s(y- v) a
00
[p - 1 ] 1/n
where
(1 +n)(1 +2n) 1)n . . . [1 ] +(ka ak - 0 ( )k k , for k = 1, 2, . . . and set G (x, y ) = [G (x )] v* if v y v + 1. This shows that 1/ n [ ] p 1 f(t) = p-g(t) is a characteristic function for any positive integer n ; in other words, f ( t) is an infinitely divisible characteristic function. Theorem 12. 2 .3 follows also from the corollary to theorem 12. 2 .1 if we put 1/n 1 ] p [ A(z) = p - z and understand that A(z) is the principal value of this power. We next discuss a few additional transformations. Let V (x) be a non decreasing function of bounded variation defined on the interval [0, M] p
.
wh 1le
_
�
�
.
<
and let
g(z) = J : e""' dV (x) . Then the function g(z) /g( 1) satisfies the conditions of the corollary of theorem 12. 2 .1. Suppose that f(t) is a characteristic function ; then h(t) = g[f(t)] g(l) is also a characteristic function . The transformation given by theorem 12. 2 .1 was derived by using step function H(y) as the weight function of a mixture. We next specialize H(y) in different manner and assume that H(y) is a non-decreasing function such that H(O ) = 0 while H(1) = 1. Moreover we suppose that g(t, y) is a function of the product ty so that g(t, y) = g(ty) where g(u) is some characteristic function. We then obtain from theorem 12.1.1 the a
following result.
a
321
MIXTURES AND TRANSFORMATIONS
Theorem 1 2.2.4. Let g(u) be an arbitrary characteristic function and suppose that H (y) is a non-decreasing function such that H(y) = 0 if y < 0, hile H(y) = 1 if y > 1 . Then f(t) = J >(ty) dH (y) = J: g(u) dH (ujt) is also a characteristic function. w
Theorem 12.2.4 can also be used to derive transformations of charac teristic functions which are of some interest. We give some applications of theorem 1 2.2.4.
Corollary to theorem 1 2.2.4. Let g(u) be an arbitrary characteristic function and p � 1 a real number. The function (12.2.3) f(t) = ptP f t g(u)uP - l du is then a characteristic function. The corollary follows from theorem 12.2.4 by putting 0 if y < 0 H(y) = yP if 0 � y < 1 (p � 1 ) 1 if y � 1 . 0
t f(t) t J g(u)du
If we put in the corollary p = 1 , we see that the function 1 ( 12.2.3a) = -
0
g(u)
is a characteristic function whenever is a characteristic function. The transformations (1 2.2.3) and ( 12.2.3a), as well as some generalizations, were investigated by M. Girault (1 954) and by H. Loeffel ( 1 956). A. Ya. Khinchine was the first to study the transformation ( 12.2.3 a), and his results have been presented in Section 4.5 . We apply the technique of mixtures to construct operators which transform characteristic functions into other characteristic functions. Let be a distribution function which has a finite second moment cz 2
F(x) = f., x 2 dF(x) and et f(t) be the characteristic function of F(x). Then 1 H(x) = f -� y 2 dF(x) also a distribution function. We use in the following H (x) as weight I
oo
oc 2
-
is
oo
a
function for certain mixtures.
(a)
.
J Jet g(u) Cc,
��
e'Lu - 1 , . tu
be the characteristic function of
a
rectangular
322
CHARACTERI STIC FUNCTIONS
distribution. Then
k(t) = J oo g(tx)dH(x) = -�12 J -oo
eitx
_
1
x2 dF(x)
oo is, according to theorem 1 2.2. 3 , a characteristic function. A simple coin putation shows that (t) ' ! k(t) = tf"-(0)! ' (0). (b) Let g( u) = the same procedure shows that 2 x oo k(t) = J - cx2 dF(x) = f-f,-", (0)(t)oo is a characteristic function. (c) We now modify our assumption and suppose that F(x) is bounded to the left with lext [F] = 0 and that the first moment cx 1 of F(x) exists . Then if X < 0 H1 (x) = _!_ J "' y dF (y) if x ;;:. 0 cx 1 is a distribution function. If we use H ( x) as a ""�eight function for see that g(u) = (t) oo 1: _!_ oo = x (x) = dF(x) Jcx1 J f ( 0) is also characteristic function. 1 (d) The function g( t) = . is the characteristic function of a rect zt angular distribution over the interval [0, 1 ] . For this distribution the left extremity is zero and the mean equals � , so that, according to (c), ) (t) 2( 1 + it g ' (t) = g' (0) = - t 2 is a characteristic function. Therefore g(t) = "' g ( - t) = 2( -- 1t 2- it) is also a characteristic function. We again use H (x) as a weight function and see that k(t) = - f';(O) J oo g(tx)x 2 dF(x) = t 2 ), (O) J ( 1 itx) dF(x) so that k(t) = t 2 ), (0) [J (t) - 1 tf (0)] .
t�
- oo
eiu ;
eitx _
0
eiu ,
a
o
've
oo
eito: dH1
eit
1
o
eit"'
-
eit - eit
gl
e
·t
1
it e
---
00
00
00
-
is a characteristic function.
'
eit
"'
-
-
3 23
MIXTURES AND TRANSFORMATIONS
We summarize these results.
Theorem 1 2.2.5. Let Th T2 , T3 and T4 be operators defined by 0) (t)-f f ' ' ( (a) T1 f(t) = tf" ( O ) f " (t) (b) T2j(t) = f" (O) ! ' (t) (c) Ta f(t) = f ' (O ) (d) T4 f(t) = 2 f, f(t) [ - 1 - tf ' ( 0)] . t (O) Suppose that the domains of these operators are characteristic functions f(t) which satisfy the following conditions: In cases (a), (b) and (d), thef(t) are characteristic functions whose distri butions have finite second moments ; in case (c), the f(t) belong to distributions with finite first moment and left extremity at the point 0. These operators transform characteristic functions satisfying these con ditions into other characteristic functions. Remark. If we apply an operator Ti (i = 1 , 2, 3 , 4) to an analytic characteristic function contained in its domain, then the transformed function is also in the dotnain of Ti , so that its application can be iterated.
As an example we consider the characteristic function f(t) = e-tz; 2 • The functions and
_ - 1 )k H2k-1 (X2 k
( (t) -ts;2 1 k e e _ T T (t) rt2k-1 - 1 2 t are then characteristic functions. Here Ilk (x) is the Hermite polynomial of degree k defined by the relation c l d ' 2 Hk (x) = ex / ( ) while cx 2 k = (2k)! j2k k ! is the (2k)th moment of the normal distribution vvith mean zero and variance 1 . ,-f he characteristic functions h2k ( t) are indecomposable, while the h2k_ 1(t ) are decomposable and alvvays have a normal factor. The functions h2k (t) h2k (t) belong to the class of entire characteristic functions of - t 2;2
z
dxk
and
_1
e - x'/ 2 ,
order 2 which have on1y a finite number o f �eros. ,.fhc fa cto ri zati o n s of t h is claBs a rc completely known [sec 1�. l.�ukacs (1 967)] .
324
CHARACTERISTIC FUNCTIONS
We mention two other transformations which are obtained as mixtures of characteristic functions.
Theorem 1 2.2.6. Let F(x) be a distribution function with characteristic functionf(t). Suppose that F(x) is bounded to the left and that lext [F] 0 . If exp [VJ(t)] is the characteristic function of an infinitely divisible distribution and if A is a positive number, then g(t) f [- iAVJ(t)] is a characteristic function. J � eiuY dF(y) we see that Since f(u) g(t) f [- iA1fJ(t)] J: exp [Ay1p(t)] dF(y) . According to our assumption, exp [AYVJ( t)] is characteristic function for y > 0, so that g(t) is a mixture of characteristic functions, and the statement follows from theorem 12.1.1. A particular case of some interest is obtained by putting VJ(t) h(t) - 1 where h ( t) is an arbitrary characteristic function. It follows from lemma 5 .4. 1 and theorem 12. 2 .6 that f(t) f [i(1 -h(t))] is a characteristic function , provided that the distribution which belongs to f(t) satisfies the conditions of theorem 12. 2 . 6 . Theorem 12.2.7. Let f(v'iz) be an analytic characteristic function and suppose that the corresponding distribution function F(x) is bounded to the left and that lext [F] 0; then f(iz) is also a characteristic function. Let F(x) be the distribution function of f(v'iz) . Then p*(y) J : 2 � exp ( - r;) aF (x) �
=
=
=
=
a
=
=
=
=
is the frequency function of a mixture of normal frequency functions. Let
oc:
=
J:oo y• p*(y)dy
be the moments of this mixture. Then cx:k- t
=
0
2) 1 y k 2 exp ( - 4 dF (x) dy. y oc2� x J J z v';x We change the variable of integration by putting y u v2x and see, after an elementary computation, that ( 2 k) 4 ( 1 2 .2 . ) cxh cx2k while
=
*
=
2 r 00 r 000 0
k!
!
=
325
MIXTURES AND TRANSFORMATIONS
rxk is the moment of order k of F (x). The characteristic function j(v'iz) has the expansion k i rx k f( Viz) k!
where
-
=
oo
so that
f(u) Therefore
:i"
k'i:.o
� =
.£.J k=O
rxk u 2k
k'
•
.
k ( !( zz .) z and we see from (12.2.4) that k 1 rx ( . ) !( zz ) � (2k) f :k z Since this is the characteristic function which belongs to the frequency function p*(y), the statement is proved. � - 1) = �0 k!
-
(Xk
2k
oo
2k
k O
•
As an example we mention the characteristic function
f(t)
=
. ViZ . . s1n vTz
D. Dugue (1 966) has shown that this is the characteristic function of a distribution which is closely related to the distribution function of Kolmo gorov' s statistic used extensively in the theory of non-parametric statistical tests. We conclude this chapter with the discussion of transformations which are not the result of mixtures of distributions. be an arbitrary characteristic function and denote its distribution Let function by Then
g(t)
G (x). h(u) J "g(y) dy J u J =
=
0
0
00
- oo
eiux
dG (x) dy.
It is easily seen that the order of the two integrations can be exchanged, so that
h(u) J =
We introduce the integral (1 2.2.5) so that
00
eiux _ l
dG(x). zx .
- 00
�(t) - L J >(y) dy du =
cfo(t)
= -
J ' h(u) du J t J 0
=
0
ex:>
1 - ei·uro �
zx.
dG
(x) dtt.
326
CHARACTERISTIC FUNCTIONS
It is again possible to exchange the order of the integrations and one obtains
�(t) J oo (eitx _ 1 - itx) dG(x) x2 . =
-
oo
The last formtda agrees with the Kolmogorov canonical representation (theorem 5 .5 .3) and we conclude that the function as defined by ( 2.2.5 is the logarithm of an infinitely divisible characteristic function which has a finite second moment. We have therefore obtained the follovv ing result :
�( t),
1 ),
Theorem 1 2.2.8. Let g(y) be an arbitrary characteristic function; then f(t) exp { - J : J : g(y) dy du} (12.2.6) is the characteristic function of an infinitely divisible distribution with finite second moment. As an example we consider the characteristic function g( t) e- l tl of the Cauchy distribution. The corresponding function ( 1 2.2.6) is then f1 (t) exp (- I t I+ 1 - e- ltl) ; ( 12.2.7) this is an infinitely divisible characteristic function with finite second moment. The function f2 ( t) exp ( e- l tl - 1) is also ( lemma 5 . 4. 1) an infinitely divisible characteristic function, and we obtain from ( 12.2.7) tl1e =
=
·
=
=
relation
e-ltl f1 (t) f2 (t). This indicates that it is possible to decompose the Cauchy distribution in =
such a way that both factors are infinitely divisible but do not belong to stable distributions.
APPENDIX A The notations 0 and
The notation 0.
o
Let f(x) and g(x) be two functions and assume that g(x) is positive for sufficiently large x. We say that f(x) is at most of the order of g(x) as x tends to infinity an� write f(x) O[ g(x) ] as x -+ oo if there exists a value x 0 and a constant > 0 such that I f(x) f < Ag(x) for x � x0. Thus f(x) O[g(x)] means that the quotient l f(x) 1/g(x) is bounded for sufficiently large x. A. l
A
=
=
Examples. 2 yx
it
O(x), x + 1 0(1), exp ( y'log x) O(x), exp ( x) O(x), 1 jx O(x -312 ), x sin x O(x). In all these examples we have taken for granted that the statement holds as x -+ oo. We write f(x) 0( 1 ) to express that f (x) is bounded as x increases. We list a few rules for the- use of these notations. (I) /1 (x) O[g1 (x) ] , /2 (x) O[g 2 (x) ] imply that /1 (x) +/2 (x) O [g1 (x) +g 2 (x) ] . > 0 is a constant then f(x) O[ag(x)] implies ( II) If f(x) O[g(x)] . (III ) If /1 (x) O[g 2 (x)] then /1 (x) /2 (x) O [ g1 (x) ] a nd /2 (x) O[g1 (x) g 2 (x) ] . y o " o ". Let f(x) and g(x) be both defined and positive for A.2 sufficiently large x. We say that f(x) is of smaller order than g(x) as x ·-+ oo and write f(x) o [g(x)] as x ->- oo if f(x) lim ro� oo g(x) log x o(x), x o(x312 ), etc. We list a few properties of this symbol. (I) f(x) o [g (x) ] implies f(x) O [g(x) ] . o [ g 2 (x)] then /1 (x) /2 (x) (I I ) I f /1 (x) O [g 1 (x)] a nd /2 (x) o[g1 (x) g2 (x)] . We write f(x) o(1 ) to indicate that f(x) tends to zero. =
=
=
=
=
=
=
=
=
=
a
=
=
=
=
=
The s mb l
=
=
Examples.
=
=
=
=
=
=
0.
=
=
328
APPENDICES
The same symbols 0 and o are used if x does not tend to infinity but to some finite value ; it is also possible to use this notation if the variable assumes only integer values as it tends to infinity. This cannot lead to any misunderstanding since the context will always indicate the variable and the limit which it approaches.
APPEN D I X B Schwarz's inequality We prove this inequality in the form in which we need it : namely as an inequality which refers to Lebesgue-Stieltjes integrals with respect to a distribution function. Let F (x) be a distribution and consider two real-valued functions g(x) and h(x) and suppose that g 2 (x) and h 2 (x) are both integrable with respect to F (x) over ( - oo, + oo) . Then
oo
J oo [u g(x) + v h(x)) 2 dF (x)
is a non-negative quadratic form in the variables u and v, so that the discriminant of this form is non-negative. This yields 2 [h(x)) 2 dF (x) g(x} h(x) dF (x) � [g(x)) 2 dF (x)
J J 00 which is the desired inequality. [ J : oo
J: oo
00
AP P E N D I X C Weierstrass' approximation theorem We need here only the trigonometric approximation theorem of Weierstrass and introduce the following notation. We denote by the class of all continuous functions f(x) , defined for all real x , which are periodic with period We define trigonometric polynomials Tn (x) of period 2n and degree n
CL
L.
� n
( cxv cos vx + ,Bv sin vx). v =O It is sometimes convenient to write these in complex form as +n Tn (x ) 2: av eivx V= - n Tn (x)
=
=
329
APPENDICES
av
Tn (x)
where the can easily be expressed in terms of the cxv and f3v· If is a trigonometric polynomial with period 2n then (2n / ) is a trigono metric polynomial with period
Tn x L L. eierstrass' (trigonometric) approximation theorem. Let f(x) c2T&; then W for every e > 0 there ·exists a trigonometric polynomial Tn (x) (of period 2n) such that I f(x) - Tn (x) I < e for all real x. If f( x) CL then f [Lyj(2n)] C2n so that one obtains essentially the same appro ximation theorem for the functions of C the approximating trigonometric polynomials then have necessarily the period L. E
E
E
L;
A convenient proof of the theorem may be found in I. P. Natanson (1955) [see § 2] or in N. I. Achieser (1956) [see § 22] .
AP P E N D I X D Order and type of entire functions
Let f (z)
=
� ck zk be an entire function. 00
k=O
We denote by f) (D. 1 )
M(r ;
=
I
max f(z) I lzl
r.
the maximum modulus off(z) in the circle I z I � This value is assumed on the perimeter of the circle. The order p of an entire function f(z) is defined as log log f) . . p = 11m sup (D.2) og 1 r-+ oo One has 0 � p � oo. In this monograph we are in general not interested in functions of order inferior to 1 ; if p < oo then we say thatf(z) is an entire function of finite order. An entire function f(z) of finite order p is said to be of type 1: if lo g ( ; f) . = 1:. 1 1m sup (D.3)
M (r ; r
r-+ oo
Mr rP
An entire function f(z) of finite order p is said to be of minimal type if 1: = 0, of normal (or intermediate) type if 0 < 1: < oo, and of maximal type if 1: = oo. Entire functions of order 1 and finite type ( r < oo ) or of order inferior to 1 are called ent i re functions of exponential type.
330
APPENDICES
Order and type of an entire function can be expressed in terms of its coefficients ; one has log p = hm sup (D.4) 1og I 1_ 1 and, if 0 < p < oo ,
.
(D.S)
'l'
k k k-+ oo ck
k f ck k p . l l ep k-+oo
= _!_ lim sup
For the proof of these statements we refer the reader to E. Hille ( 1 962) [see pp. 1 82-1 88] or A. I . Markushevich ( 1 965) [see vol. II, Chapter 9] .
AP P E N D I X E Proof of lemntas needed in Chapter 9 E. l 9. 1 . 1 . \V e note that
Proof of lemma
[(em - zw) dw = ez - z- 1
and introduce the function
z ez 1 z 2 k(z) z2 z J ew (z - w) dw. It is easily seen that I k(z) I � for I z I � 1 . We write z = x+iy (x, y real) and consider the case I z I > 1 . Since k(z) = z- 2 J: (z - u)eudu+iz - 2 e"' J: (z - x - iv)eivd�', ==
o
=
.
1
we see that Therefore
l k(z) l � 1 + 2 exp [Re (z)] for all z. Since 3 zu zu ezu - 1 - 1 + u 2 = (zu) 2 k(zu) 1 +u 2 (E. 1 . 1 ) � 2u 2 { 1 + eu < z) ) { I 1 2 + I z I) , we conclude that the assumption Ja u 2 dN(u) < oo implies +
.Re
-l- 0
--
Z
th e uniform
33 1
APPEND ICES
convergence of the integral defining f(z) on every bounded z-set. The function f(z) is therefore an entire function. We see from (E. l . l ) that I f(z) I �
4 j z j 2 { 1 +ea Re (z)) J a 2 a 2 2 {) 81 1 J z
+o
u
dN
u
+o
u
dN ( u
)
1 and Re (z) > 0 if I z I > 1 and Re ( z) � 0 . if l z l >
The estin1ate of the lemma follows immediately.
Proof of lemmas 9.1.2A and 9. 1 . 2B exp ei z ) where the coefficients satisfy the estimate Letf(z) = }:. (E.2. 1 ) dP = 0 [exp ( - kp 2 )] ( P --+ oo ) . E.2
p O
dp
Condition (E.2. 1 ) ensures that the series for f(z) converges absolutely and uniformly in every bounded set of the z-plane. Therefore f(z) is an entire function which obviously has the period i T. We write Re (z) and see that
x= npx npx Z Z }:. { 2 e exp xp f(z) ( -kp + T )} I � }:. 1 I I ( T )=o 2 x = o{ex; (�� 2 t }:. ;xp [ - k ( p - YJ } :; = o [exp (��:)]. 2 x n ] The last estimate follows from the fact that � exp [ - k ( p is ) kT a continuous periodic function of x with real period kTjn and is therefore bounded. If x = Re (z) � 0 we see that I f(z) I � � I dP I = 0(1 ) and p =O
dv
p=O
p = - oo
00
p =O
lemma 9. 1 .2A is proved. We proceed to the proof of lemma 9. 1 .2B. We assume that the entire function f(z) is periodic with period i T and that the estimates (9 7) hold. We expand f( iy) into a Fourier series,
.1. f(iy) =
v
� oo dv exp oo
2ni p y ( T ) ( - oo < y < oo)
where
T 2ni p 1 y (E. 2 .2) dP = .. J / { y) exp ( - T ) dy (p = 0, + 1, + 2, . . . ) . 1 l_.�et be complex variable and consider the entire function A( C) = f(iC) ( � 2i'JTjJC/1., ). [Iror (1�.2.2).] t
•
C cxp
a
0
real C this is the integrand in
We
332
APPENDICES
integrate C) around the rectangle whose vertices are the four points 0, iO, iO + and T ( 0 real). According to Cauchy ' s theorem this integral is zero. Since the function is periodic with period T, the integrals along the vertical sides of the rectangle cancel, and we see that 2 P f( iy - 0 ) exp d� = ( y + iO) dy.
A(T
A( C)
� J� It follows that ( 2npO) p ex d (E.2.3) I 11 I �
[ �
]
max f(iy - 0 ).
T o
[� 0 + O(log o)J .
We let 0 tend to + oo and see that d1J from (E.2.3) and (9. 1 .7) the estimate d� We put 0 where k
=
=
-
-
=
=
0 for p < 0. If () < 0 we obtain
[ ei 0 + N0 2)] .
o exp
:/r and get the desired estimate d11
n; 2
=
O( - kp 2 )
• 2 NT
Proof of lemma 9.2. 3 Let z = t + iy (t, y real) ; we show first that the function O(z) = (z + 1 ) - c e -bz f(z) is bounded in the half-plane Re (z) � 0. We select a point z0 = t0 + iy0 in the first quadrant ; i.e. z 0 E [ (t, y) : t > 0, y > 0] . Let � e be the angle formed by the rays t = [(t, y ) : y = 0, t � 0] and
E. 3
t. =
[(t, y) : y �;. t 0J . We select e > 0 so that z0 =
�
E
�
•.
We put Oe (z) = O(z) exp ( isz 2 ), then for z E �e we have I O e (z) l = I O(z) l exp ( - 2sty) � M3 exp (dt 2 - 2sty) � M3 exp (dl z l 2). M oreover, I Oe (z) I � I O(z) I � M2 on the ray t and I Oe (z) I � M3 on the ray te . We can therefore apply lemma 8. 2 . 1 with � = �e M = ' n d max { M2 , M3 ), f3 = 2 > ex = arctan � and p = 2 < nj{J . 2 Then I Oe (z) I � M for z E �e and max (M2 , M3 ) exp (2st0 y0). I O(z0) I
�
333
APPENDICES
We let
tend to zero and see that I O(z 0) I � max (M2 , M3). The point z0 is an arbitrary point of the first quadrant, so that O(z) is bounded in the closed first quadrant. In a similar way<*> one shows that t � 0, � 0] O(z) is also bounded in the closed fourth quadrant and therefore in the half-plane Re (z) � 0. We consider the function f(z) = (z + 1 )c- a o (z). 01 (z) = (z + 1 ) - a On the boundary of the half-plane Re (z) � 0 we have l 01 (z) I � M1 while in the half-plane Re (z) � 0 01 (z) = O[j Z + 1 l e- a] . The assumptions of lemma 8.2. 1 are again satisfied if we identify � with the half-plane Re (z) � 0 and put f(z) = 01 (z), M = Mh ex = = and p = � - We see then that for Re (z) � 0 01 (z) I � Mh or I f(z) I � M1 ! z + 1 1 a exp [b Re (z)] , as stated in lemma 9.2. 3 . s
[(t, y):
e - bz
f3 n/2
y
- n/2,
I
lemma
9.2.4 Proof of Let f1 {z) = f(z + iT ) -f (z) ; the function f1 (z) is entire and (E.4. 1 ) l f1 (z) l � exp {k Re (z) + O(log l z l ) } [Re (z) � 0] . It follows from the representation of f(z) that E.4
/1
(iy) . � =
j = - oo
( iTb;) exp
(2nTijy) .
According to the assumption of the lemma, this series converges uniformly on the interval 0 � � T and is therefore the Fourier series of its sum f( iy). We repeat the reasoning which led from formula (E.2.2) of Appendix E.2 to (E.2.3) and see that 2 0 max f f1 exp J 0) 1 (E.4.2) I iTb3 �
y
(�)
(iy -
o
Fo r 0 < 0 we can apply the estimate (E.4. 1) and get ·o - kO + O(log I 0 I b; I :::; exp
[2i_,
we let e tend to - 00 and conclude that (E.4.3) bi = 0 fo r j > w = [l� T/{2n)] . ( 1!11 )
'ro show th is
we
consider inH tcn<.l of 06
(2') the
fu n ction
I )J .
0(�)
exp
-
( i£� 2).
334
APPENDICES
We next put
In view of (E.4. 3) we have
• j2 (zy) =
Moreover
f /2 (z) I
.� oo
J =w+ l
a1 exp
(2nqy) T
( - oo < y < oo) .
I) }
exp {k Re (z) + O(log I z [ Re (z) Using the same argument as before, we see that �
� 0] .
(i0) max I /2 (iy - 0) 1 . The estimate for /2 (z) yields, for 0 < 0, the inequality [ 2 ·o exp i - kO + O(log I 0 I) . I a; I J I a; I � exp
o
:>;
We let 0 -+ - oo and see that a1 pletes the proof of lemma
9 .2.4.
=
0 for j
> w
=
[kT/(2n)]. This com
AP P E N D I X F Schwarz's reflection principle be two domains such that 0 while and Let n n D2 is an interval y on the real axis. Let / (z) be regular in and continuous and continuous in u y. Suppose u y and let/2 (z) be regular in in that for � E y lim / (z) lim /2 (z) =
151 D1 D2 = D1 1 D2 D2 D1 h(�) 1 = where the approach is from D1 in the first and from D 2 in the second limit. Then there exists a function f(z) regular in D1 u D 2 u y which coincides with f1 {z) in D1 and with /2 (z) in D 2 • For the proof we refer to Hille (1 959), p. 1 84. In Chapter 1 1 we used for D1 the interior of a rectangle located in the upper half-plane and for D2 the interior of the rectangle which is located symmetrically to D1 with respect to the real axis. D1 D2
z��
z��
L I S T O F EXA M P L E S O F C H A R A C T E R I S T I C F U N C T I 0 N S <��> �-
- -�----
--
---
Chapter and
Section 1 .2
-�
8 9 12
1 .4 1 .4 1 .4 2.1 2.1 2.2
13 14 1 2 , 13 18 19 1 9, 20
2.3 2.3 2.3
22 23 24
3.6
53
3.6
54
3 .7
67
4.3
84-5
4.3 5.1 5.1 5 .3 5.3 5.5 5.5 5.5
85 1 04 104 109 1 10 1 21 1 22 1 22-3
< •>
,�.
Table of discrete d . Table of absolutely continuous d. Cantor d . Purely singular, strictly increasing d. d.f. having mon�ents of order inferior to m but not of order m or of higher order. Table of moments. Recurrence relations for moments of singular d. (ref. to) two different d. f. having the same sequence of mon�ents. Table of c.£. c. f. of Cantor d. Behaviour of L = lim sup f(t) for singular d.
6 7
1 .2 1 .2 1 .2 1 .4
-
Description of example
Page
___. _
-- --
...... ...... .... . ,
I I
ltl� oo
c. f. for which f'(O) exists but not the first moment. c.f. which is nowhere differentiable. A c. f. which has an e xp ansion f(t) = 1 + o(t), a lthough the first moment does not exist. The weak converge nce of a sequence {Fn} of d. f. to a d. f. F(x) does not imply the convergence of the sequence of moments of the Fn to the moments of F. The weak convergence of a sequence {Fn} of d. f. to a limiting d. F(x) does not imply the convergence of the cor responding densities. Symmetric Bernoulli convolutions exhibiting different be haviour of L = lim sup /( t)l . c. f. of singular d. with L > 0 1 t!4- oo or L = 0 . An ab s olutely continuous d. may have a c. f. which is not abs olutel y integrable . The c. f. of two different d. can agree over a finite interval. Multiple factorizations of c. f. Cancellation law invalid in arithmetic of d. f. A c. f. which has no re al zeros need not be i.d. The absolute valu e of a c.f. is not nece s sarily a c. f. Table of canonica l rep resenta tions of c. f. Two different c. f. can have the same absolute value. Two different c f. can have the same square.
I
.
_
Abbrcviutions used :
= characteristic fu nction (s), d . = distribution (s), d . f. dis tribu t ion functiotl (R), i . d . = infinitely c.liviAib le. c. f.
&:JI
336
LIST O F EXAMPLES
Chapter and Section
5.5 5.5 5.5 5.8 6.2 6.2 6.3 6.3 6.3 6.3 6.3 6.3 6.3 7.1 7.2
7.2 7.2 7.3 7.4 7.4 8.2 8.4 8 .4 9.2 12.1 1 2 .2 1 2 .2
Page
Description of example
A c.f. f( t) such that f( t) is not i.d. but I f( t) I is i. d. An i.d. c.f. may be the product of two factors which are not i.d. 1 23-4 An i.d. c. f. which has an indecomposable factor (factor explicitly given) . A stable density with exponent a = ! . 1 43 An i . d. c.f. can be the product of a denumerable number of 1 76 indecomposable c.f. i.d. c.f. which have indecomposable factors. 1 79 1 83-4 c. f. of an absolutely continuous and unbounded indecom posable d. Product of two c.f. , neither of which has a normal component, 1 84 can have a normal factor. Product of two c.f. , neither of which has a Poissonian com 1 85 ponent, can have a Poissonian factor. Construction of a c. f. which belongs to a finite and inde 1 88 composable absolutely continuous d. Construction of a c. f. which belongs to a finite, purely singu 188 lar, indecomposable d. Factorization of rectangular d. (it can be represented in two 1 89 ways as an infinite product of indecomposable factors) . Factorization of rectangular d. into a product of two purely 1 89 singular d. Quotient of two c. f. need not be a c. f. 1 94 A d. which has moments of all orders but has not an analytic 1 98 c. f. Nevertheless the sequence of moments determines this d. completely. A one-sided distribution may have an entire c. f. of order 203 greater than 1 . The infinitely many zeros of the c. f. of a finite d. t:leed not be 203 real. References to examples of rational c. f. 212 A periodic c. f. which is not analytic. 225 A doubly periodic c. £. 227 Convolution of three Poisson type d. can have an indecom 252 posable factor. i.d. c.f. with zeros on the boundary of its strip of regularity. 258 Entire c. f. without zeros which is not i. d. 259 Reference to an example which shows that a c. f. can belong 280 to !l! but not to I0 • Mixture using a weight function which is not monotone . 317 320-3 Examples of transformations of c. f. Examples of transformations applied to exp ( - t2 /2 ) which 323 yield entire c.f. of order 2 with a finite number of zeros.
1 22 1 22
REFEREN CE S ACHIESER, N. 1 . (1 956). Theory of Approximation. Transl. from Russian, New York, Frederick Ungar. [Russian originally published by Ogiz, Moscow-Leningrad ( 1 947) .] AKUTOWICZ, E. J. (1 959). On extrapolating a positive definite function from a finite interval. Mathematica Scandinavica, 7, 1 57-1 69. AKUTOWICZ, E. J . (1 960) . Sur ! ' approximation par certaines fonctions entieres. Ann. Scientifiques Ecole Normale Superieure (3e serie), 77, 281-301 . BERGSTROM, H. (1 952) . On some expansions of stable distributions . Arkiv for Matematik, 2, 375-378. BLUM, J.-ROSENBLATT, M. (1 959). On the structure of infinitely divisible distribu tions, Pacific ]. Math. , 9, 1 -7. BOAS, R. P. ( 1 967) . Lipschitz behaviour and integrability of characteristic functions . Ann . Math. Statist. , 38, 32-36. BOCHNER, s . (1 93 2). Vorlesungen ilber Fourier 'sche Integrate. Leipzig, Akademische Verlagsgesellschaft. Reprinted by Chelsea Publishing Co. , New York, N.Y. ( 1 948). English trans!. : Lectures on Fourier Integrals, Annals of Math. Studies, No. 42, Princeton University Press, Princeton, N.J . (1 959) . BOHR, H. (1 932). Fastperiodische Funktionen. Ergebnisse d. Mathematik l /4, Berlin, J. Springer. English trans!. (1 947) : Almost periodic functions, Chelsea Publishing Co. , New York, N.Y. CAIROLI, R. (1 964) . Sur les fonctions caracteristiques des lois de probabilite. Publ. Inst. Statist. Univ. Paris, 13, 45-5 3 . CHRISTENSEN, 1 . F. (1 962). Some further extensions of a theorem of Marcinkicwicz . Pacific ]. Math. , 12, 59-67. CHUNG, K. L. ( 1 95 3). Sur les lois de probabilite unimodales . C.R. Acad. Sci. Paris, 236, 583-584. COPSON, E. T. ( 1 93 5). An Introduction to the Theory of Functions of a Complex Variable. Oxford, Clarendon Press. CRAMER, H. ( 1 939). On the representation of a function by certain Fourier integrals. Trans. Amer. Math. Soc. , 46, 1 9 1 -20 1 . CRAMER, H. ( 1 964) . Mathematical Methods of Statistics. Princeton University Press, Princeton, N.J . CRUM, M. M. (1 956). On positive definite functions. Proc. London Math. Soc. , (3), 6, 548-5 60 . CUPPENS, R. ( 1 96 3 a) . Sur Ia decomposition d 'une fonction 2q fois derivable a l'origine en produit infini des fonctions caracteristiques . C.R. Acad. Sci. Paru, 256, 3 806-3808 . CUPPENS, R. ( 1 963b). Sur un theoreme de Mamay. C.R. Acad. Sci. Paris, 257, 586-5 88 . CUPPENS, R . (1 969) . O n the decomposition of infinitely divisible probability laws without norm al factor. Pacific J. Math. , 28, 6 1 -76 . DUGUE, n . ( 1 9 5 5 ) . Sur l ' approximntion d ' u nc fonct ion caractcristiquc par sa scric de l-4"ouric:r . C.l� . Acad. Sci. Jlaris, 240,
1 5 1-1 52 .
33 8
REFERENCES
DUGUE, D. ( 1 9 5 7a). Resultats sur les fonctions absolument 1nonotones et applica tions a l ' arithmetique des fonctions de type positif. C.R. Acad. Sci. Paris, 244, 71 5-71 7. DUGUE, D. ( 1 957b) . Arithmetique des lois de probabilites . Memorial des Sciences Math. , 137. Paris, Gauthier-Villars . DUGUE, D. ( 1 957c) . Sur le theoreme de Levy-Cramer. Publ. Inst. Statist. Univ. Paris, 6, 21 3-225 . DUGUE, D. ( 1 966) . Sur les lois de Kolmogoroff et de von Mises . C.R. Acad. Sci. Par�, 262, 999-1 000. DUGUE, D.-GIRAULT, M . (195 5). Fonctions convexes de P6lya. Publ. Inst. Statist. Univ. Paris, 4, 3-1 0. ESSEEN, c . G. (1 944) . Fourier analysis of distribution functions . Acta Mathematica, 77, 1 -1 2 5 . EVANS, G . c . (1 957). Calculation of moments for a Cantor-Vitali function. Herbert Ellsworth Slought Memorial paper No . 6 , Supplement to Amer. Math. Monthly, 64, No. 8 , 22-27. FELLER, w. ( 1 943). On a general class of "contagious" distributions. Ann. Math. Statist. , 14, 389-400 . FELLER, w. (1 952). On a generalization of Marcel Riesz ' potentials and the semi groups generated by them. Medd. Lunds Univ. Mat. Sem. , Tome Supplemen taire Marcel Riesz, 73-8 1 . FISZ, M.-VARADARAJAN, v. s. ( 1 963). A condition for absolute continuity o f in finitely divisible distribution functions . Z. f. Wahrscheinlichkeitstheorie, 1, 3 3 5-339. GIL-PELAEZ, J . ( 1 95 1 ) . Note on the inversion theorem. Biometril�a, 38, 48 1-482. GIRAULT, M. (1 954). Les fonctions caracteristiques et leurs transformations . Publ. lnst. Statist. Univ. Paris, 4, 223-299. GIRAULT , M. ( 1 95 5). Analyticite et periodicite des fonctions caracteristiques . Publ. Inst. Statist. Univ. Paris, 5, 91-94. GNEDENKO , B. V.-KOLMOGOROV, A. N. ( 1 9 54). Li1nit distributions for sums of inde pendent random variables. (Trans!. from Russian by K. L. Chung), Cambridge, Mass. , Addison-Wesley Publishing Co. GOLDBERG, A. A.-osTROVSKII, 1 . v. (1 967). An application of a theorem of W. K. Hayman to a problem in the theory of the decomposition of probability laws . Ukrain. Mat. Zurnal, 19, 1 04-106. [A. A. roJibA6epr. - II. B . OcTpOBCKIIit. llpiiMeHeHIIe TeopeMLI Y. R .
XeiiMaHa K o;n;HOMY norrpocy Teopd pasJio:nteHHii
19 (1 967) , 1 04-1 06 .] HAHN, H.-ROSENTHAL, A. ( 1 948) . Set Functions. Albuquerque, N. M . , Univ. of New Mexico Press. HALMOS, P. R. (1 950) . Measure Theory. D. Van Nostrand Co. , New York. HARDY, G. H. (1 963). A Course in Pure Mathematics (1 0th edn) , Cambridge, Univ. Press. HARDY, G. H.-LITTLEWOOD, J . E.-P OLYA, G . ( 1 934) . Inequalities. Cambridge, Univ. Press. HARTMAN, P.-WINTNER, A. (1 942) . On the infinitesimal generators of integral convolutions. Amer. ] . Math. , 64, 273-298. HAUSDORFF, F. (1 927) . Mengenlehre (2nd rev. cdn) . Berlin-Leipzig, Walter de Gruyter & Co. HERZ, c. s. ( 1 963). Fonctions operant sur les fonctions definies positives. Annales de l ' lnstitut Fourier, 13, 1 6 1-1 80. HILLE, E. (1 959, 1 962). Analytic Function Theory, vol. I ( 1 9 59), vol. II (1 962) . Ginn & Co . , Boston, Mass . nepoHTHOCTHLIX aaKoHoB . YKpaiiHCI{II:fi MaT. jl{ypHaJI ,
3 39
REFF.RENCES
HOBSON, E. w. (1 927) . The theory of functions of a real variable, I , I I . Cambridge, Univ. Press ; reprinted by Dover Publications, New York (1 957). IBRAGIMOV, 1 . A . (1 956a) . On the composition of unimodal distributions . Teor,i'ya veroyatnostei i ee primeneniya, 1, 283-288. English trans!. : Theory of proba qility and its applications, 1, 25 5-260. IBRAGIMOV, I . A. (1 956b) . A theorem in the theory of infinitely divisible laws . Teoriya veroyatnostei i ee primeneniya, 1 , 48 5-489. English trans!. : Theory of probability and its applications, 1 , 440-444. IBRAGIMOV, I. A. ( 1 957) . Remark on a probability distribution of class L. Teoriya veroyatnostei i ee primeneniya, 2, 1 21 -1 24. English trans!. : Theory of probability and its applications, 2, 1 1 7-1 1 9 . IBRAGIMOV, 1 . A.-LINNIK, YU. v. (1 965). I ndependent and stationary dependent variables. Moscow, Izdat. Nauka. [II. A. H6parHMOB-I0 . B . JlnHHHK . I-le3aBHCJ:IMble n CTan;noHapHo CB.H3aHHble neJIH'IHHhl. MocKBa ( 1 965) , l3)l;aT. HayKa .] INGHAM, A. 1. (1 936). A note on Fourier transforms. ]. London Math. Soc. , 9, 27-3 2. J ESSEN, B .-WINTNER, A. ( 1 93 5 ) . Distribution functions and the Riemann Zeta function. Trans. Amer. Math. Soc. , 38, 48-88. J OHANSEN, s. ( 1 966) . An application of extreme point methods to the representation of infinitely divisible distributions. Z. f. Wahrscheinlichkeitstheorie, 5, 304-3 1 6 . J ORDAN, c . (1 950). Calculus of Finite Differences. New York, Chelsea Publishing Co. KAWATA, T. (1 940). On the division of probability laws. Proc. Imp. Acad. Tokyo, 1 6 , 24 9-254. KERSHNER, R. ( 1 936). On singular Fourier transforms. Amer. ]. Math. , 58, 450-45 3 . KERSHNER, R.-WINTNER, A . ( 1 93 5 ) . On symmetric Bernoulli convolutions. Amer. ]. Math. , 57, 541 -545 . KONHEIM, A. G.-WEISS, B. ( 1 965). Functions which operate on characteristic func tions. Pacific ]. Math. , 1 5, 1 279-1 293 . KONHEIM, A. G.-WEISS, B . (1 968) . A note on functions which operate. Pacific ]. Math. , 2 4, 297-302 . KRASNER, M.-RANULAC, B . (1 937) . Sur une propriete des polynomes de Ia division du cercle. C.R. Acad. Sci. Paris, 2 04 , 3 97-399. KREIN, M. G . ( 1 940) . Sur le probleme du prolongement des fonctions hermitiennes positives et continues. C.R. (Doklady) Acad. Sci. USSR, 2 6 , 1 7-20. !{REIN, M. G . (1 943) . On the representation of functions by Fourier-Stieltjes integrals . Ucenie Zapiski Kuibishevskogo Gosud. Pedag. i Ucitelskogo lnst., 7 , 1 23-1 48 [M. r RpeiiH. 0 IIpe)l;CTaBJieHHH <JlYJII{IJ;IlH lUITerpaJiaMH <Jlypbe . CTHJITneca. YlJeHble 3anHCKH l{yit6blmencKOI'O rocy)l;. Ile)J;arorHlJeCKOI'O H YliHTeJibCI{OI'O
7, 1 23-1 48.) KUBIK, L. ( 1 96 1 /62). A characterization of the class L of probability distribution s. Studia Math. , 2 1 , 254-252. KUBIK, L . ( 1 962/63). Some analogies between the class of infinitely divisible dis tributions and the class L of distributions. Studia Math., 22, 1 97-209. KURATOWSKI, c. (1 952). Topologie, vol. I (3rd edn) . Monografie Matematyczne XX : Polska Akademia Nauk, Warszawa. LAHA , R. G. ( 1 960) . On a property of positive definite functions. Bull. Amer. Ma th. Soc. , 66, 388-391 . LAH A , R. G.-LUKACS, E. (1 962). On a factorization of characteristic functions which have a finite number of derivatives at the origin . Publ. lnst. �Statist. Univ. Paris, 1 t , 221-224. LETT/\ , o . (1 963). Ei n c Dctncrku ng zu r J(ennzei ehnu. n g dcr charakteristischcn liHCTIITyTa ,
Fu.nktioncn . Z.
f. HlahrsclteinNthlu�itstht'Orie, 2,
69 -74 .
340
REFERENCES
LEVIN, B . YA. (1 964). Distribution of zeros of entire functions. Amer. Math. Soc. , Providence, R. I . [Russian original published Moscow, 1 956.] LEVINSON, N. (1 936) . On a class of non-vanishing functions. Proc. London Math. Soc. , (2), 41 , 393-407. LEVINSON, N. (1938) . A theorem relating to non-vanishing and analytic functions . ]. Math. Phys. , 1 6 , 1 85-190. LEVY, P. ( 1 93 1 ). Sur les series dont les termes sont des variables eventuelles in dependantes. Studia Math. , 3, 1 1 9-1 5 5 . LEVY, P. (1937a). Theorie de l 'addition des variables aleatoires. Paris , Gauthier Villars. [2nd edn, Paris, 1 954.] LEVY, P. ( 1 937b) . Sur les exponentielles de polynomes. Ann. Scientifiques Ecole Normale Superieure (3e serie) , 73, 23 1 -292. LEVY, P. ( 1 937 c) . L ' arithmetique des lois de probabilite et les produits finis des lois de Poisson. C.R. Acad. Sci. Paris, 204, 944-946 . LEVY, P. (193 8a) L' arithmetique des lois de probabilite. ]. Math. Pures et Appl. , 103, 1 7-40. LEVY, P. ( 1 93 8b) . L' arithmetique des lois de probabilite et les produits finis des lois de Poisson . Actualites Scientifiques et lndustrielles, No. 73 6 (Colloque de Geneve III) , 25-59. Hermann, Paris. LEVY, P. ( 1 939) . Sur certains processus stochastiques homogenes. Compositio Mathematica, 7, 283-3 3 9 . LEVY, P. ( 1 9 5 2) . Sur une classe des lois de probabilite indecomposables. C.R. Acad. Sci. Paris, 235, 489-49 1 . LEVY, P. ( 1 96 1 ) . Quelques problemes non resolus de Ia theorie des fonctions caracteristiques. Annali Mat. Pura e Appl. (ser. 4) , 53, 3 1 5-3 32. LEVY, P. ( 1 962). Extensions d ' un theoreme de D . Dugue et M. Girault. Z. f. Wahrscheinlichkeitstheorie, 1, 1 59-1 73 . LEWIS, T. ( 1 967). The factorization of the rectangular distribution. ]. Applied Prob. , 4, 52 9-5 42 . LINNIK, YU v. ( 1 95 3) . Linear forms and statistical criteria : I, II. Ukrain Mat. Z. , 5, 207-243 , 247-290. English trans!. in Selected Translations Math. Statist. and Prob. , 3, 1 -40 , 41-90 . Amer. Math. Soc. , Providence, R . I . (1 962) . LINNIK, YU v. ( 1 957) . On the decomposition of the convolution of Gaussian and Poissonian laws. Teoriya veroyatnostei i ee primeneniya, 2, 34-59. English trans! . : Theory of probability and its applications, 2, 3 1 -57 . LINNIK, YU v. ( 1 959) . On " oc-factorizations" of infinitely divisible probabilistic laws. Vestnik Leningrad Univ. ( 1 959) , 1 4-2 3 . English trans! . in Selected trans lations Math. Statist. and Prob. , 2, 1 59-1 69. Amer. Math. Soc. , Providence ,R.I. LINNIK, YU v. ( 1 964) . Decomposition of Probability Distributions. Oliver and Boyd, Edinburgh-London. [Russian original published Leningrad, 1 960 .] LOEFFEL , H. (1 956) . Beitrage zur Theorie der charakteristischen Funktionen. Mitt. Verein. Schweiz. Versich. Math., 56, 3 3 7-3 8 1 . LOEVE, M. (1 955). Probability Theory. D . Van Nostrand, New York (3rd edn, 1 963). LUKACS , E . (1958). Some extensions of a theorem of Marcinkiewicz. Pacific ]. Math. , 8, 487-501 . LUKACS, E. (1 964) . A linear mapping of the space of distribution functions onto a set of bounded continuous functions . Z. f. Wahrscheinlichkeitstheorie, 3, 1 -6 . LUKAcs, E. ( 1 96 7). O n the arithmetic properties o f certain entire characteristic functions. Proc. 5th Berkeley Symp. Math. Statist. and Prob. , 2, Part I, 401 -41 4. Univ. of Calif. Press, Berkeley and Los Angeles . LUKACS, E.-szA.sz, o. ( 1 9 54a) . Certain Fourier transforms of distributions : II. Canad. ]. Math. , 5, 1 86-1 89 . .
.
.
.
341
REFERENCES
LUKACS, E.-SZAsZ, o. (1 954b). Non-negative trigonometric polynomials and certain rational characteristic functions. J. Research Nat. Bureau Standards, 52, 1 5 3-1 60. MARCINKIEWICZ, J. (1 93 8) . Sur une propriete de la loi de Gauss . Math. Zeitschr. , 44, 6 1 2-6 1 8. Reprinted in J. Marcinkiewicz, Collected Papers. Panstwowe wydawnictwo Naukowe Warszawa, 1 964. MARKUSHEVICH, A. 1 . (1 965-67) . Theory of Functions of a Complex Variable, vol. I, II (1 965), III ( 1 967). Trans!. from Russian by R. A. Silvermann. Englewood Cliffs, N.Y. , Prentice Hall. MEDGYESSY, P. (1 956). Partial differential equations for stable density functions and their applications. Magyar Tud. Akad. Mat. Kutat6 Intez. Kozl. , 1, 489-5 1 8. MEDGYESSY, P. (1 963) . On the interconnection between the representation theorems of characteristic functions of unimodal distributions and of convex charac teristic functions . Magyar Tud. Akad. Mat. Kutat6 Intez. Kozl. , 8, 425-430. MILLER, H. D . (1 967) . Generalization of a theorem of Marcinkiewicz. Pacific ]. Math. , 2 0, 26 1 -274 . NATANSON, 1 . P. (1 955). Konstruktive Funktionentheorie. Berlin, Akademie Verlag. [Russian original published by Ogiz, Moscow-Leningrad, 1 9 5 1 .] NOACK, A. ( 1 950) . A class of variables with discrete distributions . Ann. Math. Statist. , 21, 1 27-1 32. OSTROVSKI I, I. v. ( 1 963) . Entire functions satisfying some special inequalities con nected with the theory of characteristic functions of probability laws. Khar kovskogo Univ. Mat. Obshestva, 29, 1 45-1 68. English trans!. in Selected Translations Math. Statist. and Prob. , 7, 203-234. Amer. Math. Soc. , Provi dence, R. I . OSTROVSKII, 1 . v . (1 964). On the decomposition of infinitely divisible lattice laws. Vestnik Leningrad Univ. , 19, 5 1-60. [II . B . OcrrpoBCKHfi. 0 paaJiomeHHHX p emeTqaTbiX oearpaiiHtiHO )J;eJUIMbiX 3aROHOB . BecTHHK JleHnnrpap;CKOI'O YHHBepcHTeTa ,
19, 5 1 -60 (1 964) .] OSTROVSKI I, 1 . v. (1 965). Some theorems on the decomposition of probability laws. Trudi Mat. Inst. Steklova, 79 ( 1 965), 1 98-23 5 . English trans!. : Proceedings of the Steklov Institute of Mathematics, No . 79 (1 965), 221 -259. Amer. Math. Soc. , Providence, R. I . (1 966) . OSTROVSKII, 1 . v. ( 1 966) . On the factorization of multidimensional infinitely divisible probability laws without Gaussian component. Vestnik Khar kovskogo Gosud. Univ. (Ser. Meh.-Mat.), 32, 5 1 -72. [II. B. OcrpoBCKHfi. 0 pa3JIOffieHIIJIX MHOI'MepHbiX Be3rpaHJiqfiQ p;eJieMbiX 3aKOHOB 6e3 rayccOBOfi KOMTIOHeHTbl. BecTHHR XapKOBCKOI'O rocyp;. YHHB . Cep . Mex . -MaT . , 32, 5 1 -72.]
PALEY, R. E. A. c.-WIENER, N. ( 1 934) . Fourier transforms in the complex domain. Amer. Math. Soc. Colloquium Publ. No. 1 9, Amer. Math. Soc., New York, N.Y. PITMAN, E. J . G. ( 1 956). On the derivation of a characteristic function at the origin. Ann. Math. Statist. , 27, 1 1 5 6-1 1 60. PITMAN, E. J . G. (1 96 1 ). Some theorems on characteristic functions of probability distributions. Proc. 4th Berkeley Symp. Math. Statist. and Prob. , 2, 393-402. Univ. of Calif. Press, Berkeley and Los Angeles. P6LYA, G.-8ZEGO, G. ( 1 925). Aufgaben und Lehrsiitze aus der Analysis, I . J. Springer, Berlin. American Edition : Dover Publications, New York (1945). UAIKO\\ D. A . (1 938). On the decomposition of Gauss and Poisson laws . Izvest. Al?.ad. Naull SSSlt (Ser. Mat.), 2, 9 1 ·-1 24. [�. A . Pa�lH,o u . 0 pa:J:IIo�mm iJu t :Jt1JCOJ J OB l 'u,y,�mL 11 l l ytt(',(',onn. . l1 :mot'/J'l1JJ A H'.It)\ · l l n.yH CCO P, Ce p. Mwr. , 2, 9 1 - -1 24.] . .
342
RAIKOV,
REFERENCES
D. A. ( 1 940) . On positive definite functions. Doklady Akad. Nauk SSSR, 2 6, 857-862. [�. A. PaitKon . 0 noJim-KnTeJihHO onpe;-t;eJieiHibiX cpyHK�uax. �OKJia)l;bi AKa)];. HayK CCCP, 26, 857-862 .] RAMACHANDRAN, B. (1 962). On the order and type of entire characteristic functions. Ann. Math. Statist. , 33, 1 238-1 25 5 . RAMACHANDRAN, B . ( 1 965). An extension of a theorem of Mamay with applica tion. Sankhyii, A, 2 7, 303-3 1 0. RAMACHANDRAN, B. (1967). Advanced Theory of Characteristic Functions. Statistical Publishing Society, Calcutta. RIESZ, F. ( 1 9 3 3 ) . Uber Satze von Stone und Bochner. Acta Univ. Szeged, 6, 1 84-1 98. RIESZ, M.-LIVINGSTONE, A. E. ( 1 95 5). A short proof of a classical theorem in the theory of Fourier integrals . Amer. Math. Monthly, 62, 434-43 7. ROBBINS, H. (1948) . Mixture of distributions, Ann. Math. Statist. , 19, 360-369. ROSSBERG, H. J. ( 1 966) . Wachstum und Nullstellenverteilung ganzer charak teristischer Funktionen. Monatsberichte Deutsch. Akad. Wiss. Berlin, 8, 275-286. ROSSBERG, H. J . ( 1 967a). Der Zusammenhang Z\vischen einer ganzen charak teristischen Funktion einer verfeinerten Ordnung und ihrer Verteilungs funktion. Czechoslovak Math. ]. , 17(92) , 3 1 7-3 34. ROSSBERG, H. J. ( 1 96 7b) . Ganze charakteristische Funktionen mit vollkommen regularem Wachstum. Czechoslovak Math. ]. , 17(92) , 33 5-346. SALEM, R. ( 1 943) . On some singular monotonic functions which are strictly in creasing . Trans. Amer. Math. Soc. , 53, 427-439 . SAPOGOV, N . A. ( 1 9 5 1 ). The stability problem for a theorem of Cramer. lzvest. Akad. Nauk SSSR (Ser. Mat.), 15, 205-21 8 . English trans!. in Selected Translations Math. Statist. and Prob. , 1 , 41-5 3 . Amer. Math. Soc. , Providence, R.I.
SCHMETTERER, L . ( 1 965) . Some theorems on the Fourier analysis of positive definite functions . Proc. Amer. Math. Soc. , 16, 1 141-1 146 . SCHWARTZ, L. ( 1 941 ). Sur le module d e Ia fonction caracteristique du calcul des probabilites . C.R. Acad. Sci. Paris, 212, 41 8-421 . SHIMIZU, R. (1 964). On the decomposition of infinitely divisible characteristic functions with a continuous Poisson spectrum. Ann. lnst. Statist. Math. , 16, 3 87-407. SHOHAT, J. A.-TAMARKIN, J . D. ( 1 943 ) . The Problem of Moments. (Mathematical Surveys, 1 .) Amer. Math. Soc. , New York, N.Y. SKOROHOD, A. v . ( 1 9 54) . Asymptotic formulas for stable distribution laws. Doklady Akad. Nauk SSSR (N. S.), 98, 73 1 -734. English trans!. in Selected Transla tions Math. Statist. and Prob. , 1, 1 5 7-1 61 . Amer. Math. Soc. , Providence, R. I .
SUN, T . c. ( 1 967) . A note on the unimodality of distribution functions of the class L. Ann. Math. Statist. , 38, 1 296-1 299. TAKANO, K . ( 1 95 1 ) . Certain Fourier transforms of distributions . Tohoku Math. ]. , (2), 3, 306-3 1 5 . TEICHER, H. (1 954) . On the factorization of distributions . .1-lnn. Math. Statist. , 25, 769-774. TITCHMARSH, E. c. (1 937) . Introduction to the Theory of Fourier Integrals. Oxford, Clarendon Press . TITCHMARSH, E. c . ( 1 9 39) . The Theory of Functions (2nd edn) . Oxford , Univ. Press. TUCKER, H. G. ( 1 962) . Absolute continuity of infinitely divisib1e distributions . Pacific ]. Math. , 1 2, 1 1 25-1 1 29.
REFERENCES
343
TUCKER, H. G. (1 964). On continuous singular infinitely divisible distribution functions. Ann. Math. Statist. , 35, 3 30-3 3 5 . TUCKER, H. G. (1 965). On a necessary and sufficient condition that an infinitely divisible distribution be absolutely continuous. Trans. Amer. Math. Soc. , 1 1 8, 3 1 6-3 30. WIDDER, D. v . (1 946). The Laplace Transform. Princeton, Univ. Press. WINTNER, A. (1 936) . On a class of Fourier transforms. Amer. ]. Math. , 58, 45-90 . WINTNER, A. (1 938) . Asymptotic distributions and infinite convolutions (planographed lecture notes) . Edwards Brothers, Ann Arbor, Michigan. WINTNER, A. (1 947) . The Fourier Transforms of Probability Distributions. Balti more, Md (published by the author). WIN'TNER, A. (1 956). Cauchy' s stable distributions and an "explicit formula" of Mellin. Amer. ]. Math. , 78, 81 9-861 . ZEMANIAN, A. H. ( 1 959) . On the pole and zero location of rational Laplace trans formations of non-negative functions. Proc. Amer. Math. Soc. , 10, 86 8-872 . ZEMANIAN, A. H. (1 96 1 ) . On the pole and zero locations of rational Laplace trans formations of non-negative functions, I I . Proc. Amer. Math. Soc. , 12, 870-874. ZINGER, A.-LINNIK, YU. v. (1 957). On a class of differential equations and its application to some questions of regression theory. Vestnik Leningrad Univ. , 12, 1 21 -1 30. English transl. in Selected Translations Math. Statist. and Prob. , 3, 1 8 1-1 90. Amer. Math. Soc. , Providence, R. I. ZOLOTAREV, v. M. (1 954) . Expression of the density of a stable distribution with exponent oc; greater than 1 by means of a density with exponEnt 1 /oc . Doklady Akad. Nauk SSSR, 98, 73 5-73 8. English trans!. in Selected Translations Math. Statist. and Prob. , 1 , 1 6 3-1 67. Amer. Math. Soc. , Providence, R. I. ZOLOTAREV, v. M. (1 956). On analytic properties of stable distribution laws. Vestnik Leningrad Univ. , 1 1 , No. 1 , 49-5 2. English trans!. in Selected Translations Math. Statist. and Prob. , 1, 207-21 1 . Amer. Math. Soc. , Providence, R. I. ZOLOTAREV, v. M. ( 1 963). Analytical structure of the infinitely divisible laws of the L-class . Litovskii Mat. Sbornik, 3, 1 23-1 24. [B. lVL 3oJioTapen . AHaJiwrnqeckoe cTpoeHHe 6esrpaHnqHo )J;eJieMbiX sakoHoB KJiacca L. JlHTOBckHit MaTemaTHqecknii
3, 1 23-1 24.] ZOLOTAREV, v. M. (1 964) . On the representation of stable laws by integrals. Trudi Mat. Inst. Steklova, 71 (1 964), 46-50. English trans!. in Selected Translations Math. Statist. and Prob. , 6, 84-88. Amer. Math. Soc. , Providence, R. I . ZYGMUND, A. ( 1 947) . A remark on characteristic functions. Ann. Math. Statist. , 18, 272-276 . ZYGMUND, A. (1 95 1 ). A remark on characteristic functions. Proc. 2nd Berkeley Symp. Math. Statist. and Prob. , 369-372 . Berkeley, Univ. of California Press. ZYGMUND, A. (1 95 2) . Trigonometrical Series (2nd edn, corrected reprint of 1 st edn , Monographic Mat. 5, Warszawa, 1 93 5). Chelsea Publishing Co. , New York, N.Y. C6opHHk,
I N D EX* Abel summability, 41 absolute moment, 1 0, 25 absolutely continuous, 4, 66 - - d . ' 4, 5, 38, 7 5 - monotone, 302 ACHIESER, N. I . , 329, 3 37 adjoint polynomial, 228 AKUTOWICZ, E. J., 89, 3 37 algebraic moment, 1 0 almost periodic, 1 9, 36 ex-decomposition, 292, 301 -, denumerable, 292 -, finite, 292 - for i.d.d. , 305 - - lattice d. , 302 - - normal d. , 302 - - Poisson d. , 303 - of a. c. f. , 292, 301 , 302 analytic c.f. , 1 91 ff. - -, boundary values of, 306 - -, convexity property, 1 96, 1 97 - -, factorization of, 2 36 - -, i. d. , 25 8 ff. approximation theorem of Weierstrass, 28, 1 02, 328 arithmetic of d.f. , 103, 1 04, 1 66, 1 82 :ff. , 252 asymptotic expansions of stable densi ties, 1 48
boundary c. f. , ridge property of, 308 - -, strip of regularity of, 308, 3 1 0 - value of analytic f. , 306 bounded d. (to left, right), 1 42 - to (left, right), 1 42 - variation, 320 (C, 1 )-summability, 41 CAIROLI, R. , 224, 3 37 cancellation law, 1 22 canonical product, 222 - representation, 1 1 3 :ff. - -, Kolmogorov, 1 1 9 - -, Levy, 1 1 8, 1 76, 1 78-1 79 - -, Levy-Khinchine, 1 1 7 - - of stable c.f. , 1 32 - -, table of, 1 21 Cantor' s ternary set, 8 Cauchy d. , 7, 8, 1 2, 1 8, 85, 91 , 1 08, 1 21 , 1 37, 1 39, 3 26 Characteristic function, 1 1 , 1 5 - -, analytic, 1 91 - -, boundary, 306 :ff. - -, decomposable, 1 0 3 , 238, 254 - -, indecomposable, 1 0 3 , 1 09, 1 79 - -, i. d. , 1 07, 1 08, 1 09, 1 21 , 1 22 - -, periodic, 225 - -, table of, 1 8 - -, transformation of, 3 1 5 , 3 1 8 characteristic, second ( second c.f. ) , 26 , 253 characterization, 254 - of normal d . , 254 - of normal, Poisson, conjugate Poisson d., 256 Chebyshev polynomials, 21 6 chi square d. , 8 Choquet ' s theorem, 1 1 8 CHRISTENSEN, I. F. , 224, 3 37 CHUNG, K. L. , 99, 1 64, 3 3 7 closed limit inferior, 62 closure theorems, 1 1 1 , 1 1 2 complex conjugate, 1 5 components of a d.f. , 3 8 =
BERGSTROM, H. , 1 42, 1 50, 3 37 Bernoulli convolution, symmetric, 64, 66, 67 Beta d. , 7, 8 , 1 8 binomial d. , 6, 1 4, 1 8 BLUM, J. R. , 1 24, 3 37 BoAs, R. P. , 25 , 3 37 BocHNER, S. , 71 , 210, 3 37 Bochner' s theorem , 71 , 79 BOHR, H. , 1 9, 36, 3 3 7 BOREL, E. 222 ' boundary c.f. , 306 - -, extremities of, 309 - -, factorization of, 309
* The following abbreviations are used in the index : c .f.
characteristic function ; analytic characteristic function ; d distribution ; d.f. distribution functions ; a.c.f. f. function ; i.d. infinitely divisible ; i . d . d . infinitely divisible distribution. =
=
=
=
=
=
=
INDEX
composition, 3 7 concave, 91 conjugate complex, 1 5 - d. , 29, 30, 1 6 8 continuity interval, 2 - point, 2 , 29 - theorem, 47, 48, 88, 1 02 - - for bounded non-decreasing functions, 52 - -, second version of, 5 3 continuous, 1 25 -, absolutely, 4, 1 25 - part of d.f. , 3 - singular, 1 25 - (to the right), 2 convergence in the mean, 76 -, radius of, 1 9 1 -, uniform (of a sequence of c.f.), 50 -, weak, 43, 44, 48 convergence theorem, 237, 3 1 5 , 3 1 7 - -, dominated, 3 1 5 , 3 1 7 - --, monotone, 23 7 convergent sequence of d.f. , 42, 43 convex, 83, 9 1 - function, 202 convexity properties of a.c. f. , 1 96, 1 97 convolution, 37, 41 - of normal and Poisson d. , 245 -, symmetric Bernoulli, 64, 66, 67 - theorem, 36 -, v-fold, 3 1 6 convolutions, infinite, 5 5-67 -, -, convergence criteria for, 59-6 1 -, -, convergence of, 59 COPSON, E. T. , 203, 221 , 3 37 CRAMER, H. , 1 , 1 1 , 1 3, 1 4, 21 , 37, 75, 1 69, 210, 243 , 292, 3 37 Cramer ' s criterion, 73, 2 1 0 - theorem, 243, 245 , 254, 256, 302 - -, converse of, 254 criteria for c. f. , 68, 210 - - convergence of infinite convolutions, 59-6 1 CRUM, M . M. , 91 , 3 3 7 cumulant generating function, 26 cumulants, 26 CUPPENS, R. , 289, 300, 305, 3 3 7 CZERNIN, K. E. , 1 5 8 Darboux sums, 37, 1 1 2, 236, 237 decomposable c. f. , 103, 238, 254 decomposition of d. , 3 - theorem, 1 69, 1 70 - - , general , 1 69 De Finetti' s theorem, 1 1 2 degenerate d. , 5,,_, 1 8, 1 9, 1 08, 1 2 1 , 1 66 degree of freedom , 8
345 densities, stable, 148 density function, 5, 3 3 denumerable ex-decomposition, 292 derivative, symmetric, 25 differential equations, 227, 228 - -, c. f. as solutions of, 228 - --, positive definite, 228 Dirichlet conditions, 86 discontinuity point!' 2 discontinuous part of a d. f. , 3 discrete part, 3, 4 distribution : Beta, 7, 8 , 1 8 binomial, 6 , 1 4, 1 8 Cauchy, 7, 8, 1 2, 1 8, 85, 91 , 1 08, 1 21 , 1 37, 143, 3 26 chi square, 8 compound Poisson, 3 1 6 degenerate, 5 , 1 8, 1 9, 108, 1 21 , 1 66 exponential, 8, 1 3 Gamma, 7, 1 3, 1 8, 1 08, 1 09, 1 20, 1 21 , 1 79, 1 91 Gaussian (Gauss-Laplace), 7 generalized Poisson, 3 1 6 geometric, 6 , 1 1 3, 1 76 hypergeometric, 6 Laplace, 7, 1 3 , 1 8, 88, 1 09, 1 22 negative binomial, 6, 1 4, 1 8, 1 03 , 1 21 Neyman type A, 221 normal, 7, 1 3 , 1 8, 91 , 1 08 , 1 21 , 1 3 6, 143, 1 91 , 21 3, 243 , 254, 25 5 Pascal, 6 Poisson, 6, 1 4, 1 8 , 1 08, 1 21 , 1 8 5 , 1 9 1 , 22 1 , 227, 243 rectangular, 7, 8, 1 09, 1 89 Simpson ' s, 7 Student ' s, 7, 1 2, 1 3 triangular, 7 uniform, 7 distribution : bounded, 142, 201 , 202 conjugate, 29, 30, 1 6 8 fin�e, 142, 1 81 , 200, 228, 259 i. d. , 1 03 lattice, 6 , 1 7, 225 , 245 , 302 one-sided, 1 42, 200-202, 309 stable, 1 28 :ff. symmetric, 30, 292 unimodal, 91-99 distribution function : - -, absolutely continuous, 6, 39, 75 - -, discrete, 5, 6, 36, 41 - --, indecomposable, 1 81 , 1 83 - - of a.c. f. , 1 97 ff. - -, singular, 8, 9, 1 9 dominated convergence th eorem, 3 1 5 , 317
346
INDEX
DU GUE , D . , 86, 87, 302, 325, 3 37, 3 38
elliptic function, 227 energy parameter, 263 entire characteristic function, 1 95 , 1 9 8, 206 , 209, 210, 2 39 - - -, determination by properties of factors, 253 :ff. - -, factorization of, 23 8 - - - of infinite order, 210 - - - - finite order and minimal type, 209 - - - - - - - maximal type, 209 - - -, order of, 1 9 5 , 1 98, 20 5-210 - - -, type of, 205-21 0 entire function, 1 9 5, 329 :ff. equivalence (of c. f. or second c. f.), 25 3 EssEEN, C. G. , 20, 54, 3 3 8 EvANs, G. C . , 1 4, 3 38 exponent of convergence, 222 - - stable d., 1 3 3, 1 42, 1 47, 148 exponential d. , 8, 1 3 - type, entire function of, 203 extension of factorization theorems for a. c. f. , 292 ff. - - non-negative definite functions, 89-9 1 - - - - - indeterminate 90 ' ' - - - - - unique 90 ' ' extremities , formulae for, 202, 309 - of d.f. with boundary c.f. , 309 extremity (left, right) of a d.f. , 142 -
Faa di Bruno's formula, 27 factor-closed family, 245 factor, indecomposable, 1 03, 1 70, 1 76 - of a.c.f. , 23 6 - - c.f. , 1 03 factorization of a.c.f. , 236 ff. - - boundary c.f. , 3 1 0 - - entire c.f. of finite order, 239 - - i.d. a.c.f. , 258 :ff. - problems , 1 03 , 1 22, 1 67, 1 9 1 , 236 ff. - theorem, Hadamard ' s, 203 , 222 , 243 , 244 - -, Weierstrass ' , 88 Faltung, 37 Fatou ' s lemma, 229, 293 , 294 FELLER, vv. , 1 22, 142, 3 1 6, 3 3 8 Finetti ' s theorem, 1 1 2 finite ex-decompositions , 292 - d. , 1 42, 1 8 1 , 202 , 228 , 25 9 FISZ, M. , 1 2 5, 3 3 8 Fourier coef-ficients , 36, 86 integral> 1 93 , 1 94 - inversion theorem , 84 - series , 86 -
·
Fourier transforms, 1 1 freedom, degree of, 8 frequency, Poisson, 263 - functions of stable d . , 1 3 8, 147 - -, stable, 1 3 8, 1 47 function, \Veicrstrass ' , 23 - of bounded variation, 320 Gamma d . , 7, 1 3, 1 8, 1 08, 1 09, 1 20, 1 2 1 , 1 79, 1 91 Gauss-Laplace (law of), 7 generating fw1.ction, cumulant, 26 - -, moment, 10, 1 96 , 1 97, 251 - -, probability, 1 0 , 1 82 genus , 21 2 geometric d. , 6, 1 1 3, 1 76 GIL-PELAEZ, J . , 3 3 , 3 3 8 GIRAULT, � . , 1 9, 20, 87, 227, 321 , 3 38 GNEDEN KO, B. v. , 54, 1 04, 1 28, 1 36 , 1 37, 143, 1 62, 1 6 5 , 3 38 GoLDBERG, A. A. , 280, 3 38 HADAMARD, }. , 1 8 3 Hadamard ' s factorization theorem, 20 3, 222, 243 , 244 HAHN, H. , 1 0 1 , 3 3 8 HALMOS, P. R. , 62, 3 3 8 HARDY, G. H . , 23, 8 3 , 3 3 8 HARTMANN, P . , 1 24, 1 25 , 3 3 8 HAUSDORFF, F., 62, 3 3 8 Reily' s first theorem, 44 , 49, 72, 1 73 - second theoren1., 45, 72, 82, 1 1 6 - - -, extension of, 47, 49, 72 , 1 1 6 Hermite polynomials, 78, 323 Hermitian., 71 , 77 HERZ, c. s . , 3 1 9, 338 HILLE, E., 3 30 , 3 34, 338 HINCIN, see KHINCHINE HoBsoN, E. W. , 2, 1 40, 3 3 9 hypergeometric d. , 6
I 0 , 266, 280, 28 1 ff. -, necessary conditions for member ship, 280, 281 -, sufficient conditions for mcrnber ship, 266, 281 ff. IBRAGIMOV, I . A. , 99, 1 5 0, 1 5 8 , 1 6 5 , 258, 339 imaginary part (Im) , 1 92 increase, point of, 2 indecomposable absolutely continuous d.f. , 1 8 3 - c.f. , 1 03, 1 09, 1 79, 1 8 1 , 252 - d. , 1 8 1 , 1 82, 1 83 - factor, 103, 1 70, 1 76 independent, ration a1ly, 249, 287 infin ite convolut ion , 5 5 ff.
347
INDEX
infinitely diviM iblc a . c . f. , 2 5 H fi. - - boundary c . f. , 3 1 0 f l'. - - c . f. , <..h.! fi nition , 1 07 - - -, cxmnpk�s , 1 08 - - -, factorization, 1 22
- - distrib ution,
1 08
- - -, cx-dccotnposi tion of, 299, 301
- - - one-sided ' 3 1 2 ' with bounded Poisson spectrum, 281 ff. - - - vvith Gaussian component, 280, 28 1 INGHAM, A. I. , 1 0 5 , 3 39 i ntegrable, quadratically, 76 integral function : see entire function integral representation, 1 9 1 - - of a.c.f. , 1 9 1 -1 93 - - of boundary c.f. , 306 - - of stable densities, 148 - transfonn, 9 inversion formulae, 3 0 - - for absolutely integrable c. f. , 3 3 - theorem, 3 1 iterated exponentials, 21 3 -
·-
}ESSEN, B. , 1 9, 20, 64, 67, 3 3 9 }OHANSEN, 8 . , 1 1 8, 339 }ORDAN, C. , 27, 3 39 jump , 2 KAWATA, 1�. , 1 04, 1 07, 3 3 <) kernel, 1 0, 99 KERSHNER, R. , 1 9, 67, 3 3 9 KHINCHINE, A. YA. , 87, 92, 1 04, 21 0 - phenomenon, 1 04 Khinchine ' s, criterion, 77, 2 1 0 - theorem, 262 KOLMOGOROV, A. N. , 54, 1 28, 1 3 6, 1 3 7, � 43 , 1 62, 1 6 5 , 326, 3 3 8 -, canonical representatio:1, 1 1 9, 1 21 , 326 -, - - of a c . f. , 260 I
lattice d . , ex-decompos ition of, 302 - points , 6, 225 £-class, 1 62 .P -class, 1 62, 262-266, 280 Lebesgue decomposition of c. f. , 1 9 - - theorem, 4 - measure , 66 - properties , 1 24, 1 90 left extremity, 142 LETTA, G. , 91 , 3 39 LEVIN, B . YA. , 210, 340 LEVINSON, N. , 1 0 5, 340 LEVY, P. , 63, 86, 89, 9 5 , 1 3 6, 1 3 7, 143 , 1 61 , 1 6 5, 1 88, 21 1 , 243 , 245 , 250, 25 1 , 252, 259, 340 Levy canonical representation, 1 1 8 , 1 2 1 , 1 3 2, 1 6 3, 1 64, 1 76, 1 79 Levy-l(hinchine canonical representation, 1 1 7, 1 1 8, 1 21 , 1 24, 1 25 , 1 90 LEWIS, rr. , 1 90, 340 Li, 62 L rENARD, A. , 1 83 Lim (weak limit), 43 limit in the mean (l.i.m.), 76 - inferior, closed, 62 - theorem, 1 07, 1 26-1 28 limits of d . f. , 42 ff. LINNIK, Yu. V. , 97, 1 50, 225 , 227, 228, 23 5 , 245 , 25 3 , 262, 290, 299, 302, 305, 340, 343 Lipschitz condition, 25 LITTLEWOOD, J . E. , 8 3 , 3 3 8 LIVINGSTONE, A. E. 84, 342 ' LOEFFEL, H. , 321 , 340 L OEVE , M. , 1 , 4, 1 1 , 1 3 6 , 1 62, 23 7, 3 1 5 , 340 LUKACS, E. , 1 02, 212, 224, 305, 3 2 3 , 339, 340, 341 Maclaurin expansion, 23 , 1 9 1 MARCINKIEWICZ, } . , 21 3 , 221 , 224, 341 -, theorem of, 21 3 , 221 , 224 MARKUSHEVICH, A. I. , 59, 240, 246 , 296 , 33 0, 341 Mathias , theorem of, 79 maximum modulus, 1 95 , 301 , 3 29 mean, convergence in the, 7 6 MEDGYESSY, P. , 95, 1 42, 341 median, 1 67 MILLER, H. D . , 224, 341 mixtures of d . , 3 1 5-3 1 8 modulus, maximum, 1 9 5 , 301 , 3 29 Moivre-Laplace, law of, 7 moment, 1 0 , 1 1 ff. , 1 3 , 20 ff. , 25, 42, 1 98 -, algebraic, 1 0 -, absolute, 1 0 , 25, .26 -·, facto rial, 1 0
348 moment generating function, 1 0, 1 96, 1 98, 25 1 -, symmetric, 25 moments, table of, 1 3 monotone convergence theorem, 237
Na [f(t)] , Na [/] , 1 67 Na-value, 1 67 NATANSON, I . P. , 3 29, 341 negative binomial d. , 6, 1 4, 1 8 , 108, 1 21 Neyman type A d. , 221 NoACK, A. , 1 4, 341 non-degenerate d . , 202 non-negative definite function, 70, 88 - - - - on finite interval, 89 normal d. , 7, 1 3 , 1 8 , 91 , 108, 1 21 , 1 3 6, 143 , 1 9 1 , 21 3 , 23 5 , 242, 243 , 254-5 3 27 one-sided d. , 1 42, 200, 202 , 309 operators which transform c.f. into other c.f. , 3 1 9, 3 21 , 323 order (of entire function), 1 96, 204, 239, 301 , 329-33 0 order and type of entire function, 3 29330 OsTROVSKn, I . V. , 1 95 , 224, 225 , 280, 289, 290, 291 , 341 0,
o,
PALEY, R. E. A. c. , 76 , 341 Parseval ' s theorem, 76, 105 parts of a d.f. , 4 Pascal d . , 6 periodic c.f. , 225 PITMAN, E. J. G. , 24, 25, 341 Plancherel ' s theorem, 76 point of increase, 2 - spectrum of a d.f. , 56, 57 Poisson d. , 6 , 1 4, 1 8 , 1 08, 1 21 , 1 8 5 , 1 9 1 , 221 , 227, 243 - -, ex-decomposition of, 303 - -, compound, 3 1 6 - -, generalized, 3 1 6 - frequencies, 263 - spectrum, 263 , 281 :ff. - - (bounded, denumerable, finite, negative, positive), 263 - type d. , 1 1 2 PoLvA, G. , 1 3 , 83 , 3 3 8, 341 - condition, 83 , 8 5 - theorem, 105 - type c.f. , 85, 87, 1 04 polynomial, Chebyshev, 21 6 -, trigonometric, 28, 328 positive definite differential equation, 228 prime factor, 1 70, 1 80, 1 82, 1 8 3
INDEX
PRINGSHEIM, A. ' 84 probability density function, 5 , 7 - generating function, 10, 1 82 product, canonical, 222 - representation, trivial, 1 03 pure d.f. , 4, 5 - type, c. f. of, 1 9 purely discrete d.f. , 1 7 Quadratically integrable function, 76 quasi-stable, 1 37 radius of convergence, 1 9 1 RAIKOV, D . A. , 89, 1 83 , 243, 245 , 250, 25 1 , 292, 341 , 342 Raikov ' s theorem, 243 , 245 , 303 RAMACHANDRAN, B. , 1 79, 2 1 0, 300, 342 RA.NULAC, B . , 1 83 , 3 3 9 rationally independent, 249 - - points, set with, 287 real part (Re), 1 7 rectangular d . , 7, 1 3 , 1 8 , 1 09, 1 89 reflection principle, Schwarz ' s, 3 1 1 , 3 34 regular, 1 91 , 1 93 regularity, strip of, 1 9 1 , 1 9 3 , 23 6 , 308, 3 1 0 ridge functions , 1 95 , 224 - property, 1 95 , 21 1 , 224 - - of boundary c. f. , 308 Riemann-Lebesgue lemma, 1 9 RIESZ, F. , 91 , 342 RIESZ, M . 84, 342 ' right continuous, 2 - extremity, 1 42 RoBBINS, H . , 3 1 5 , 342 RosENBLATT, M. , 1 24, 3 3 7 RosENTHAL, A. , 101 , 3 3 8 RossBERG, H. ] . , 210, 342
249, 305,
307, 23 8,
SALEM, R. , 9, 342 saltus, 2, 3 5 , 3 6 SAPOGOV, N. A. , 245 , 342 SCHMETTERER, L. 86, 342 ' SCHWARZ, L. , 20, 342 Schwarz ' s inequality, 1 4, 328 - reflection (symmetry) principle, 307, 3 1 1 , 3 34 second characteristic , 26, 253 self-decomposable, 1 6 1 -1 6 5 semi-invariant, 26 semi-stable, 1 6 5 set with rationally independent points, 287 set-theoretic notations, 5 5 sets , vectorial sum of, 57
349
lN H HX HH I M1 1.t l , H . , 1 79 , 342 HlJOII A'I', J . A. , 1 2 , 1 98, 342 � irn pHo n ' H d . , 7 singu lnr, 4, 8 , 1 9 , 20, 36, 64 H r
PoiRson, 2 63 ---- , hou nd ed, 263, 281 , 282 --, denumerable, 263 -, finite, 26 3 -, -, negative, 263 - , - , p o s i t ive, 263 stable c. f. , 1 28 - densities, 148 - -, asymptotic expanston of, 1 481 50 - -, integral representation of, 148, 1 50-1 58 stable d. , 1 28, 1 79, 1 91 - - in the restricted sense, 1 3 7 - frequency function, 1 3 8 - - -, order of, 1 47-148 - - -, type of, 147-148 - type, 1 29 step function, 3 Stirling ' s formula, 80, 144 strip of regularity of an a.c.f. , 1 91 , 1 93, 236, 23 8 - - - - boundary c.f. , 308, 3 1 0 strongly unimodal , 99 Student's d. , 7, 1 2, 1 3 sum, vectorial (of sets), 57 summability, Abel, 41 -, (C, 1 ), 41 SuN, T. C. , 1 6 5, 342 symmetric Bernoulli convolution, 6468 - d . , 30, 292 - kth derivative, 25 - moment, 25 symmetry principle of Schwarz, 307, 3 1 1 , 3 34 SzA.sz, 0. , 2 1 2, 340, 341 SZEGO, G. , 1 3 , 341
-, -, -, -,
table of canonical representations of i.d.c.f. , 1 21 - - discrete d. , 6 - - frequency f. , 7 - - moments , 1 3 TAKANO, K. , 21 2, 342 TAMARKIN, J. D. , 1 2, 1 98, 342 TEICHER, 1-1. , 245, 342 theorem : llochncr's, 71 , 79
cloMu r·r, I l l co11tinu ity , 4H , 5 .1
convolutio n , 3 7 Cram 6r'•• 7 :l , 2ii·J , 2 5 4 • " 1 , ·1 1 2 D e I·1:<� Jnottl Fourit':r in vcl��t iou , H4 I�Iel 1 y 'K :fi r·Mt , 44· - s econd , 4! - -, cxt�n.a inn of. 4 7 invcrs,i on, 3 1 l{hinchinc '• , 77 Kolmogot·ov'a .rv]�l·cttcntat i o n , 1 19 Krein's, 89 Levy's represcntntiot1 , 1 1 8 Levy-l{hinchin(j 'tt :•�ctlt·cHcntution , ·
117 limit, 1 26
Marcinldewicz's, 2 1 3 , 2 2 1 M athias ' , 79 P6lya's , 83
243 uniqueness fo r c.f. , 28 Weierstrass ' approxilnation, 328 TITCHMARSH, I�. c . , 1 9 , 3 1 , 49, 59, 84, 86, 2 1 2, 229, 246, 293, 296 , 342 transformations of c. f. , 3 1 5 , 3 1 8 triangular d . , 7 trigonometric polynomial, 28, 328 trivial product representation, 1 03 TUCKER, H. G. , 1 25, 1 26, 1 90, 343 type of c. f. , 253 - - entire c.f. of order 1 , 202, 203 - - d.f. , 1 6 -, stable, 1 29 Raikov' s,
uniform convergence (of sequence of c. f.), 50 - d. , 7 unimodal d. , 91 , 9 5 -, strongly, 99 unimodality of stable d. , 1 5 8 uniqueness theorem, 28 :ff. - - for almost periodic f. , 36 VARADARAJAN, V. 8 . , 1 25 , 338 vectorial sum (of sets), 5 7 vertex (of unimodal d.), 9 1 weak convergence, 43 , 44, 48 Weiers trass' approximation theorem, 28, 1 02, 3 28, 329 - factorization theorem, 88 - function, 23 weight function, 3 1 6 WEISS, B . , 3 1 9, 3 39 WIDDER, D. v. , 1 93, 1 94, 343
350 WIENER, N. , 76 , 341 WINTNER, A. , 19, 20, 24, 64, 67, 1 24, 1 25, 1 65, 33 8, 3 3 9, 343 ZEMANIAN, A. H. , 21 2, 343
INDEX
ZINGER, A. A. , 227, 228, 23 5 , 302, 343 ZOLOTAREV, v. M. , 142, 143 , 1 57, 1 65, 343 ZYGMUND, A. 22, 25, 92, 203 3 1 0, ' ' 343