Roussas G A Course in Mathematical Statistics

Contents
A Course in Mathematical Statistics

Second Edition
ii
Contents
This Page Intentionally Left Blank
Contents
iii
A Course in Mathematical Statistics

Second Edition
George G. Roussas
Intercollege Division of Statistics University of California Davis, California
ACADEMIC PRESS
San Diego New York

London Boston Sydney Tokyo Toronto
iv
Contents
This book is printed on acid-free paper. Copyright 1997 by Academic Press
All rights reserved. No part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher.
ACADEMIC PRESS 525 B Street, Suite 1900, San Diego, CA 92101-4495, USA 1300 Boylston Street, Chestnut Hill, MA 02167, USA http://www.apnet.com ACADEMIC PRESS LIMITED 2428 Oval Road, London NW1 7DX, UK http://www.hbuk.co.uk/ap/
Library of Congress Cataloging-in-Publication Data Roussas, George G. A course in mathematical statistics / George G. Roussas.2nd ed. p. cm. Rev. ed. of: A rst course in mathematical statistics. 1973. Includes index. ISBN 0-12-599315-3 1. Mathematical statistics. I. Roussas, George G. First course in mathematical statistics. II. Title. QA276.R687 1997 96-42115 519.5dc20 CIP
Printed in the United States of America 96 97 98 99 00 EB 9 8 7 6 5 4 3 2 1
Contents
To my wife and sons
vi
Contents
This Page Intentionally Left Blank
Contents
vii
Contents
Preface to the Second Edition xv Preface to the First Edition xviii
Chapter 1
Basic Concepts of Set Theory 1

1.1 1.2* Some Denitions and Notation Exercises 5 Fields and -Fields 8 1
Chapter 2
Some Probabilistic Concepts and Results 14

2.1 2.2 2.3 2.4 2.5* Probability Functions and Some Basic Properties and Results 14 Exercises 20 Conditional Probability 21 Exercises 25 Independence 27 Exercises 33 Combinatorial Results 34 Exercises 40 Product Probability Spaces 45 Exercises 47
vii
viii
Contents
2.6*
The Probability of Matchings 47 Exercises 52
Chapter 3
On Random Variables and Their Distributions 53

3.1 3.2 3.3 3.4 Some General Concepts 53 Discrete Random Variables (and Random Vectors) 55 Exercises 61 Continuous Random Variables (and Random Vectors) 65 Exercises 76 The Poisson Distribution as an Approximation to the Binomial Distribution and the Binomial Distribution as an Approximation to the Hypergeometric Distribution 79 Exercises 82 Random Variables as Measurable Functions and Related Results 82 Exercises 84
3.5*
Chapter 4
Distribution Functions, Probability Densities, and Their Relationship 85

4.1 The Cumulative Distribution Function (c.d.f. or d.f.) of a Random VectorBasic Properties of the d.f. of a Random Variable 85 Exercises 89 The d.f. of a Random Vector and Its PropertiesMarginal and Conditional d.f.s and p.d.f.s 91 Exercises 97 Quantiles and Modes of a Distribution 99 Exercises 102 Justication of Statements 1 and 2 102 Exercises 105
4.2
4.3 4.4*
Chapter 5
Moments of Random VariablesSome Moment and Probability Inequalities 106

5.1 5.2 5.3 Moments of Random Variables 106 Exercises 111 Expectations and Variances of Some R.V.s 114 Exercises 119 Conditional Moments of Random Variables 122 Exercises 124
Contents
ix
5.4
5.5 5.6*
Some Important Applications: Probability and Moment Inequalities 125 Exercises 128 Covariance, Correlation Coefcient and Its Interpretation 129 Exercises 133 Justication of Relation (2) in Chapter 2 134
Chapter 6
Characteristic Functions, Moment Generating Functions and Related Theorems 138

6.1 6.2 6.3 6.4 6.5 Preliminaries 138 Denitions and Basic TheoremsThe One-Dimensional Case 140 Exercises 145 The Characteristic Functions of Some Random Variables 146 Exercises 149 Denitions and Basic TheoremsThe Multidimensional Case 150 Exercises 152 The Moment Generating Function and Factorial Moment Generating Function of a Random Variable 153 Exercises 160
Chapter 7
Stochastic Independence with Some Applications 164

7.1 7.2 7.3 7.4* Stochastic Independence: Criteria of Independence 164 Exercises 168 Proof of Lemma 2 and Related Results 170 Exercises 172 Some Consequences of Independence 173 Exercises 176 Independence of Classes of Events and Related Results 177 Exercise 179
Chapter 8
Basic Limit Theorems 180

8.1 8.2 8.3 8.4 Some Modes of Convergence 180 Exercises 182 Relationships Among the Various Modes of Convergence 182 Exercises 187 The Central Limit Theorem 187 Exercises 194 Laws of Large Numbers 196 Exercises 198
Contents
8.5 8.6*
Further Limit Theorems 199 Exercises 206 Plyas Lemma and Alternative Proof of the WLLN 206 Exercises 211
Chapter 9
Transformations of Random Variables and Random Vectors 212

9.1 9.2 9.3 9.4 The Univariate Case 212 Exercises 218 The Multivariate Case 219 Exercises 233 Linear Transformations of Random Vectors 235 Exercises 240 The Probability Integral Transform 242 Exercise 244
Chapter 10
Order Statistics and Related Theorems 245

10.1 10.2 Order Statistics and Related Distributions 245 Exercises 252 Further Distribution Theory: Probability of Coverage of a Population Quantile 256 Exercise 258
Chapter 11
Sufciency and Related Theorems 259

11.1 11.2 11.3 11.4 Sufciency: Denition and Some Basic Results 260 Exercises 269 Completeness 271 Exercises 273 UnbiasednessUniqueness 274 Exercises 276 The Exponential Family of p.d.f.s: One-Dimensional Parameter Case 276 Exercises 280 Some Multiparameter Generalizations 281 Exercises 282
11.5
Chapter 12
Point Estimation 284

12.1 Introduction 284 Exercise 284
Contents
xi
12.2
Criteria for Selecting an Estimator: Unbiasedness, Minimum Variance 285 Exercises 286 12.3 The Case of Availability of Complete Sufcient Statistics 287 Exercises 292 12.4 The Case Where Complete Sufcient Statistics Are Not Available or May Not Exist: Cramr-Rao Inequality 293 Exercises 301 12.5 Criteria for Selecting an Estimator: The Maximum Likelihood Principle 302 Exercises 308 12.6 Criteria for Selecting an Estimator: The DecisionTheoretic Approach 309 12.7 Finding Bayes Estimators 312 Exercises 317 12.8 Finding Minimax Estimators 318 Exercise 320 12.9 Other Methods of Estimation 320 Exercises 322 12.10 Asymptotically Optimal Properties of Estimators 322 Exercise 325 12.11 Closing Remarks 325 Exercises 326
Chapter 13
Testing Hypotheses 327

13.1 General Concepts of the Neyman-Pearson Testing Hypotheses Theory 327 Exercise 329 Testing a Simple Hypothesis Against a Simple Alternative 329 Exercises 336 UMP Tests for Testing Certain Composite Hypotheses 337 Exercises 347 UMPU Tests for Testing Certain Composite Hypotheses 349 Exercises 353 Testing the Parameters of a Normal Distribution 353 Exercises 356 Comparing the Parameters of Two Normal Distributions 357 Exercises 360 Likelihood Ratio Tests 361 Exercises 369 Applications of LR Tests: Contingency Tables, Goodness-of-Fit Tests 370 Exercises 373
13.2 13.3 13.4 13.5 13.6 13.7 13.8
xii
Contents
13.9
Decision-Theoretic Viewpoint of Testing Hypotheses 375
Chapter 14
Sequential Procedures 382

14.1 14.2 14.3 14.4 Some Basic Theorems of Sequential Sampling 382 Exercises 388 Sequential Probability Ratio Test 388 Exercise 392 Optimality of the SPRT-Expected Sample Size 393 Exercises 394 Some Examples 394
Chapter 15
Condence RegionsTolerance Intervals 397

15.1 15.2 15.3 15.4 15.5 Condence Intervals 397 Exercise 398 Some Examples 398 Exercises 404 Condence Intervals in the Presence of Nuisance Parameters 407 Exercise 410 Condence RegionsApproximate Condence Intervals 410 Exercises 412 Tolerance Intervals 413
Chapter 16
The General Linear Hypothesis 416

16.1 16.2 16.3 16.4 16.5 Introduction of the Model 416 Least Square EstimatorsNormal Equations 418 Canonical Reduction of the Linear ModelEstimation of 2 Exercises 428 Testing Hypotheses About = E(Y) 429 Exercises 433 Derivation of the Distribution of the F Statistic 433 Exercises 436
424
Chapter 17
Analysis of Variance
17.1
440
17.2
One-way Layout (or One-way Classication) with the Same Number of Observations Per Cell 440 Exercise 446 Two-way Layout (Classication) with One Observation Per Cell 446 Exercises 451
Contents
xiii
17.3
17.4
Two-way Layout (Classication) with K ( 2) Observations Per Cell 452 Exercises 457 A Multicomparison method 458 Exercises 462
Chapter 18
The Multivariate Normal Distribution 463

18.1 18.2 18.3 Introduction 463 Exercises 466 Some Properties of Multivariate Normal Distributions 467 Exercise 469 / and a Test of Independence 469 Estimation of and Exercises 475
Chapter 19
Quadratic Forms 476

19.1 19.2 Introduction 476 Some Theorems on Quadratic Forms 477 Exercises 483
Chapter 20
Nonparametric Inference 485

20.1 20.2 20.3 20.4 20.5 20.6 Nonparametric Estimation 485 Nonparametric Estimation of a p.d.f. 487 Exercise 490 Some Nonparametric Tests 490 More About Nonparametric Tests: Rank Tests 493 Exercises 496 Sign Test 496 Relative Asymptotic Efciency of Tests 498
Appendix I
Topics from Vector and Matrix Algebra 499

I.1 I.2 I.3 I.4 Basic Denitions in Vector Spaces 499 Some Theorems on Vector Spaces 501 Basic Denitions About Matrices 502 Some Theorems About Matrices and Quadratic Forms 504
Appendix II
Noncentral t-, 2-, and F-Distributions

II.1 Noncentral t-Distribution 508
508
xiv
Contents
II.2 II.3
Noncentral x2-Distribution 508 Noncentral F-Distribution 509
Appendix III
Tables
1 2 3 4 5 6 7
511
The Cumulative Binomial Distribution 511 The Cumulative Poisson Distribution 520 The Normal Distribution 523 Critical Values for Students t-Distribution 526 Critical Values for the Chi-Square Distribution 529 Critical Values for the F-Distribution 532 Table of Selected Discrete and Continuous Distributions and Some of Their Characteristics 542
Some Notation and Abbreviations
545
Answers to Selected Exercises
547
Index
561
Contents
xv
Preface to the Second Edition
This is the second edition of a book published for the rst time in 1973 by Addison-Wesley Publishing Company, Inc., under the title A First Course in Mathematical Statistics. The rst edition has been out of print for a number of years now, although its reprint in Taiwan is still available. That issue, however, is meant for circulation only in Taiwan. The rst issue of the book was very well received from an academic viewpoint. I have had the pleasure of hearing colleagues telling me that the book lled an existing gap between a plethora of textbooks of lower mathematical level and others of considerably higher level. A substantial number of colleagues, holding senior academic appointments in North America and elsewhere, have acknowledged to me that they made their entrance into the wonderful world of probability and statistics through my book. I have also heard of the book as being in a class of its own, and also as forming a collectors item, after it went out of print. Finally, throughout the years, I have received numerous inquiries as to the possibility of having the book reprinted. It is in response to these comments and inquiries that I have decided to prepare a second edition of the book. This second edition preserves the unique character of the rst issue of the book, whereas some adjustments are affected. The changes in this issue consist in correcting some rather minor factual errors and a considerable number of misprints, either kindly brought to my attention by users of the book or located by my students and myself. Also, the reissuing of the book has provided me with an excellent opportunity to incorporate certain rearrangements of the material. One change occurring throughout the book is the grouping of exercises of each chapter in clusters added at the end of sections. Associating exercises with material discussed in sections clearly makes their assignment easier. In the process of doing this, a handful of exercises were omitted, as being too complicated for the level of the book, and a few new ones were inserted. In
xv
xvi
Contents Preface to the Second Edition
Chapters 1 through 8, some of the materials were pulled out to form separate sections. These sections have also been marked by an asterisk (*) to indicate the fact that their omission does not jeopardize the ow of presentation and understanding of the remaining material. Specically, in Chapter 1, the concepts of a eld and of a -eld, and basic results on them, have been grouped together in Section 1.2*. They are still readily available for those who wish to employ them to add elegance and rigor in the discussion, but their inclusion is not indispensable. In Chapter 2, the number of sections has been doubled from three to six. This was done by discussing independence and product probability spaces in separate sections. Also, the solution of the problem of the probability of matching is isolated in a section by itself. The section on the problem of the probability of matching and the section on product probability spaces are also marked by an asterisk for the reason explained above. In Chapter 3, the discussion of random variables as measurable functions and related results is carried out in a separate section, Section 3.5*. In Chapter 4, two new sections have been created by discussing separately marginal and conditional distribution functions and probability density functions, and also by presenting, in Section 4.4*, the proofs of two statements, Statements 1 and 2, formulated in Section 4.1; this last section is also marked by an asterisk. In Chapter 5, the discussion of covariance and correlation coefcient is carried out in a separate section; some additional material is also presented for the purpose of further clarifying the interpretation of correlation coefcient. Also, the justication of relation (2) in Chapter 2 is done in a section by itself, Section 5.6*. In Chapter 6, the number of sections has been expanded from three to ve by discussing in separate sections characteristic functions for the one-dimensional and the multidimensional case, and also by isolating in a section by itself denitions and results on momentgenerating functions and factorial moment generating functions. In Chapter 7, the number of sections has been doubled from two to four by presenting the proof of Lemma 2, stated in Section 7.1, and related results in a separate section; also, by grouping together in a section marked by an asterisk denitions and results on independence. Finally, in Chapter 8, a new theorem, Theorem 10, especially useful in estimation, has been added in Section 8.5. Furthermore, the proof of Plyas lemma and an alternative proof of the Weak Law of Large Numbers, based on truncation, are carried out in a separate section, Section 8.6*, thus increasing the number of sections from ve to six. In the remaining chapters, no changes were deemed necessary, except that in Chapter 13, the proof of Theorem 2 in Section 13.3 has been facilitated by the formulation and proof in the same section of two lemmas, Lemma 1 and Lemma 2. Also, in Chapter 14, the proof of Theorem 1 in Section 14.1 has been somewhat simplied by the formulation and proof of Lemma 1 in the same section. Finally, a table of some commonly met distributions, along with their means, variances and other characteristics, has been added. The value of such a table for reference purposes is obvious, and needs no elaboration.
Preface to the Second Contents Edition
xvii
This book contains enough material for a year course in probability and statistics at the advanced undergraduate level, or for rst-year graduate students not having been exposed before to a serious course on the subject matter. Some of the material can actually be omitted without disrupting the continuity of presentation. This includes the sections marked by asterisks, perhaps, Sections 13.413.6 in Chapter 13, and all of Chapter 14. The instructor can also be selective regarding Chapters 11 and 18. As for Chapter 19, it has been included in the book for completeness only. The book can also be used independently for a one-semester (or even one quarter) course in probability alone. In such a case, one would strive to cover the material in Chapters 1 through 10 with the exclusion, perhaps, of the sections marked by an asterisk. One may also be selective in covering the material in Chapter 9. In either case, presentation of results involving characteristic functions may be perfunctory only, with emphasis placed on moment-generating functions. One should mention, however, why characteristic functions are introduced in the rst place, and therefore what one may be missing by not utilizing this valuable tool. In closing, it is to be mentioned that this author is fully aware of the fact that the audience for a book of this level has diminished rather than increased since the time of its rst edition. He is also cognizant of the trend of having recipes of probability and statistical results parading in textbooks, depriving the reader of the challenge of thinking and reasoning instead delegating the thinking to a computer. It is hoped that there is still room for a book of the nature and scope of the one at hand. Indeed, the trend and practices just described should make the availability of a textbook such as this one exceedingly useful if not imperative. G. G. Roussas Davis, California May 1996
xviii
Contents
Preface to the First Edition
This book is designed for a rst-year course in mathematical statistics at the undergraduate level, as well as for rst-year graduate students in statisticsor graduate students, in generalwith no prior knowledge of statistics. A typical three-semester course in calculus and some familiarity with linear algebra should sufce for the understanding of most of the mathematical aspects of this book. Some advanced calculusperhaps taken concurrentlywould be helpful for the complete appreciation of some ne points. There are basically two streams of textbooks on mathematical statistics that are currently on the market. One category is the advanced level texts which demonstrate the statistical theories in their full generality and mathematical rigor; for that purpose, they require a high level, mathematical background of the reader (for example, measure theory, real and complex analysis). The other category consists of intermediate level texts, where the concepts are demonstrated in terms of intuitive reasoning, and results are often stated without proofs or with partial proofs that fail to satisfy an inquisitive mind. Thus, readers with a modest background in mathematics and a strong motivation to understand statistical concepts are left somewhere in between. The advanced texts are inaccessible to them, whereas the intermediate texts deliver much less than they hope to learn in a course of mathematical statistics. The present book attempts to bridge the gap between the two categories, so that students without a sophisticated mathematical background can assimilate a fairly broad spectrum of the theorems and results from mathematical statistics. This has been made possible by developing the fundamentals of modern probability theory and the accompanying mathematical ideas at the beginning of this book so as to prepare the reader for an understanding of the material presented in the later chapters. This book consists of two parts, although it is not formally so divided. Part 1 (Chapters 110) deals with probability and distribution theory, whereas Part
xviii
Contents Preface to the First Edition
xix
2 (Chapters 1120) is devoted to statistical inference. More precisely, in Part 1 the concepts of a eld and -eld, and also the denition of a random variable as a measurable function, are introduced. This allows us to state and prove fundamental results in their full generality that would otherwise be presented vaguely using statements such as it may be shown that . . . , it can be proved that . . . , etc. This we consider to be one of the distinctive characteristics of this part. Other important features are as follows: a detailed and systematic discussion of the most useful distributions along with gures and various approximations for several of them; the establishment of several moment and probability inequalities; the systematic employment of characteristic functionsrather than moment generating functionswith all the well-known advantages of the former over the latter; an extensive chapter on limit theorems, including all common modes of convergence and their relationship; a complete statement and proof of the Central Limit Theorem (in its classical form); statements of the Laws of Large Numbers and several proofs of the Weak Law of Large Numbers, and further useful limit theorems; and also an extensive chapter on transformations of random variables with numerous illustrative examples discussed in detail. The second part of the book opens with an extensive chapter on sufciency. The concept of sufciency is usually treated only in conjunction with estimation and testing hypotheses problems. In our opinion, this does not do justice to such an important concept as that of sufciency. Next, the point estimation problem is taken up and is discussed in great detail and as large a generality as is allowed by the level of this book. Special attention is given to estimators derived by the principles of unbiasedness, uniform minimum variance and the maximum likelihood and minimax principles. An abundance of examples is also found in this chapter. The following chapter is devoted to testing hypotheses problems. Here, along with the examples (most of them numerical) and the illustrative gures, the reader nds a discussion of families of probability density functions which have the monotone likelihood ratio property and, in particular, a discussion of exponential families. These latter topics are available only in more advanced texts. Other features are a complete formulation and treatment of the general Linear Hypothesis and the discussion of the Analysis of Variance as an application of it. In many textbooks of about the same level of sophistication as the present book, the above two topics are approached either separately or in the reverse order from the one used here, which is pedagogically unsound, although historically logical. Finally, there are special chapters on sequential procedures, condence regionstolerance intervals, the Multivariate Normal distribution, quadratic forms, and nonparametric inference. A few of the proofs of theorems and some exercises have been drawn from recent publications in journals. For the convenience of the reader, the book also includes an appendix summarizing all necessary results from vector and matrix algebra. There are more than 120 examples and applications discussed in detail in
xx
Contents Preface to the First Edition
the text. Also, there are more than 530 exercises, appearing at the end of the chapters, which are of both theoretical and practical importance. The careful selection of the material, the inclusion of a large variety of topics, the abundance of examples, and the existence of a host of exercises of both theoretical and applied nature will, we hope, satisfy people of both theoretical and applied inclinations. All the application-oriented reader has to do is to skip some ne points of some of the proofs (or some of the proofs altogether!) when studying the book. On the other hand, the careful handling of these same ne points should offer some satisfaction to the more mathematically inclined readers. The material of this book has been presented several times to classes of the composition mentioned earlier; that is, classes consisting of relatively mathematically immature, eager, and adventurous sophomores, as well as juniors and seniors, and statistically unsophisticated graduate students. These classes met three hours a week over the academic year, and most of the material was covered in the order in which it is presented with the occasional exception of Chapters 14 and 20, Section 5 of Chapter 5, and Section 3 of Chapter 9. We feel that there is enough material in this book for a threequarter session if the classes meet three or even four hours a week. At various stages and times during the organization of this book several students and colleagues helped improve it by their comments. In connection with this, special thanks are due to G. K. Bhattacharyya. His meticulous reading of the manuscripts resulted in many comments and suggestions that helped improve the quality of the text. Also thanks go to B. Lind, K. G. Mehrotra, A. Agresti, and a host of others, too many to be mentioned here. Of course, the responsibility in this book lies with this author alone for all omissions and errors which may still be found. As the teaching of statistics becomes more widespread and its level of sophistication and mathematical rigor (even among those with limited mathematical training but yet wishing to know why and how) more demanding, we hope that this book will ll a gap and satisfy an existing need. G. G. R. Madison, Wisconsin November 1972
1.1 Some Denitions and Notation
Chapter 1
Basic Concepts of Set Theory

A set S is a (well dened) collection of distinct objects which we denote by s. The fact that s is a member of S, an element of S, or that it belongs to S is expressed by writing s S. The negation of the statement is expressed by writing s S. We say that S is a subset of S, or that S is contained in S, and write S S, if for every s S, we have s S. S is said to be a proper subset of S, and we write S S, if S S and there exists s S such that s S. Sets are denoted by capital letters, while lower case letters are used for elements of sets.
S S' s1 s2
Figure 1.1 S S; in fact, S S, since s2 S, but s2 S .
These concepts can be illustrated pictorially by a drawing called a Venn diagram (Fig. 1.1). From now on a basic, or universal set, or space (which may be different from situation to situation), to be denoted by S, will be considered and all other sets in question will be subsets of S.
1.1.1 Set Operations

1. The complement (with respect to S) of the set A, denoted by Ac, is dened by Ac = {s S; s A}. (See Fig. 1.2.)
1 Basic Concepts of Set Theory
A Ac
S
Figure 1.2 Ac is the shaded region.
2. The union of the sets Aj, j = 1, 2, . . . , n, to be denoted by

A1 A2 An or
U Aj ,
j =1
is dened by
U A j = {s S ; s A j for at least one j = 1, 2, , n}.

n j =1
For n = 2, this is pictorially illustrated in Fig. 1.3. The denition extends to an innite number of sets. Thus for denumerably many sets, one has
U A j = {s S ; s A j for at least one j = 1, 2, }.

j =1
S
Figure 1.3 A1 A2 is the shaded region.
A1
A2
3. The intersection of the sets Aj, j = 1, 2, . . . , n, to be denoted by
A1 A2 An
is dened by
or
I Aj ,
j =1
I A j = {s S ; s A j for all j = 1, 2, , n}.

n j =1
For n = 2, this is pictorially illustrated in Fig. 1.4. This denition extends to an innite number of sets. Thus for denumerably many sets, one has
I A j = {s S ; s A j for all j = 1, 2, }.
j =1
S
Figure 1.4 A1 A2 is the shaded region.
A1
A2
4. The difference A1 A2 is dened by

A1 A2 = s S ; s A1 , s A2 .
{ {
} }
Symmetrically,
A2 A1 = s S ; s A2 , s A1 .
c Note that A1 A2 = A1 Ac 2, A2 A1 = A2 A 1, and that, in general, A1 A 2 A2 A1. (See Fig. 1.5.)
S
Figure 1.5 A1 A2 is ////. A2 A1 is \\\\.
A1
A2
5. The symmetric difference A1 A2 is dened by
A1 A2 = A1 A2 A2 A1 .
Note that
) ( ) (
A1 A2 = A1 A2 A1 A2 .
Pictorially, this is shown in Fig. 1.6. It is worthwhile to observe that operations (4) and (5) can be expressed in terms of operations (1), (2), and (3).
S
Figure 1.6 A1 A2 is the shaded area.
A1
A2
1.1.2 Further Denitions and Notation

A set which contains no elements is called the empty set and is denoted by . Two sets A1, A2 are said to be disjoint if A1 A2 = . Two sets A1, A2 are said to be equal, and we write A1 = A2, if both A1 A2 and A2 A1. The sets Aj, j = 1, 2, . . . are said to be pairwise or mutually disjoint if Ai Aj = for all i j (Fig. 1.7). In such a case, it is customary to write
A1 + A2 , A1 + + An = A j and
j =1 n
A1 + A2 + = A j
j =1
instead of A1 A2, U A j, and U A j, respectively. We will write U j A j, j A j, I j A j, where we do not wish to specify the range of j, which
n j =1
j =1
will usually be either the (nite) set {1, 2, . . . , n}, or the (innite) set {1, 2, . . .}.
S
Figure 1.7 A1 and A2 are disjoint; that is, A1 A2 = . Also A1 A2 = A1 + A2 for the same reason.
A1
A2
1.1.3
Properties of the Operations on Sets
1. S c = , c = S, (Ac)c = A. 2. S A = S, A = A, A Ac = S, A A = A. 3. S A = A, A = , A Ac = , A A = A. The previous statements are all obvious as is the following: A for every subset A of S. Also 4. A1 (A2 A3) = (A1 A2) A3 A1 (A2 A3) = (A1 A2) A3 5. A1 A2 = A2 A1 A1 A2 = A2 A1 6. A (j Aj) = j (A Aj) A (j Aj) = j (A Aj)
(Associative laws) (Commutative laws) (Distributive laws)
are easily seen to be true. The following identity is a useful tool in writing a union of sets as a sum of disjoint sets. An identity:
UA
j
c c c = A1 + A1 A2 + A1 A2 A3 + .
There are two more important properties of the operation on sets which relate complementation to union and intersection. They are known as De Morgans laws:
i
) )
c U Aj = I Aj , j j c I Aj = U Aj . j j
c
ii
As an example of a set theoretic proof, we prove (i).

PROOF OF (i)
We wish to establish and

c b) I jAc j ( U j A j) .
a) ( U jAj)c I jAc j
1.1 Some Denitions and Exercises Notation
We will then, by denition, have veried the desired equality of the two sets. a) Let s ( U jAj)c. Then s U jAj, hence s Aj for any j. Thus s Ac j for every j and therefore s I jAc . j
c b) Let s I jAc j . Then s A j for every j and hence s Aj for any j. Then s U jAj and therefore s ( U jAj)c.
The proof of (ii) is quite similar. This section is concluded with the following:
DEFINITION 1
The sequence {An}, n = 1, 2, . . . , is said to be a monotone sequence of sets if: ii) A1 A2 A3 (that is, An is increasing, to be denoted by An), or ii) A1 A2 A3 (that is, An is decreasing, to be denoted by An). The limit of a monotone sequence is dened as follows: ii) If An, then lim An = U An , and
n n=1
ii) If An, then lim An = I An .

n n=1
More generally, for any sequence {An}, n = 1, 2, . . . , we dene

A = lim inf An = U
n n=1 j= n
I Aj, U Aj .
and
A = lim sup An = I
n
n=1 j= n
are called the inferior limit and superior limit, The sets A and A . respectively, of the sequence {An}. The sequence {An} has a limit if A = A
Exercises
1.1.1 Let Aj, j = 1, 2, 3 be arbitrary subsets of S. Determine whether each of the following statements is correct or incorrect. iii) (A1 A2) A2 = A2; iii) (A1 A2) A1 = A2; iii) (A1 A2) (A1 A2) = ; iv) (A1 A2) (A2 A3) (A3 A1) = (A1 A2) (A2 A3) (A3 A1).
1.1.2 Let S = {(x, y) 2; 5 x 5, 0 y 5, x, y = integers}, where prime denotes transpose, and dene the subsets Aj, j = 1, . . . , 7 of S as follows:
A1 = x, y S ; x = y; A3 = x, y S ; x 2 = y 2 ; A5 = x, y S ; x 2 + y 2 4 ; A7 = x, y S ; x 2 y.
( )
( ) ( )
A2 = x, y A4 = x, y A6 = x, y
( ) S ; x = y ; ( ) S ; x ( )
y 2 ; S ; x y2 ;
2
( )
List the members of the sets just dened. 1.1.3 Refer to Exercise 1.1.2 and show that:
7 7 iii) A1 U A j = U A1 A j ; j =2 j =2
7 7 iii) A1 I A j = I A1 A j ; j =2 j =2
7 7 iii) U A j = I Ac j; j =1 j =1 7 7 iv) I A j = U Ac j j =1 j =1 c
by listing the members of each one of the eight sets appearing on either side of each one of the relations (i)(iv). 1.1.4 Let A, B and C be subsets of S and suppose that A B and B C. Then show that A C; that is, the subset relationship is transitive. Verify it by taking A = A1, B = A3 and C = A4, where A1, A3 and A4 are dened in Exercise 1.1.2. 1.1.5 Establish the distributive laws stated on page 4.
1.1.6 In terms of the acts A1, A2, A3, and perhaps their complements, express each one of the following acts: iii) Bi = {s S; s belongs to exactly i of A1, A2, A3 , where i = 0, 1, 2, 3}; iii) C = {s S ; s belongs to all of A1, A2, A3 };
1.1 Some Denitions and Exercises Notation
iii) D = {s S; s belongs to none of A1, A2, A3}; iv) E = {s S; s belongs to at most 2 of A1, A2, A3}; iv) F = {s S; s belongs to at least 1 of A1, A2, A3 }. 1.1.7 Establish the identity stated on page 4.
1.1.8 Give a detailed proof of the second identity in De Morgans laws; that is, show that
c I Aj = U Aj . j j
1.1.9 Refer to Denition 1 and show that
iii) A = {s S; s belongs to all but nitely many As}; = {s S; s belongs to innitely many As}; iii) A ; iii) A A = lim A . iv) If {An} is a monotone sequence, then A = A n n 1.1.10 Let S = 2 and dene the subsets An, Bn, n = 1, 2, . . . of S as follows:
1 2 1 An = x, y 2 ; 3 + x < 6 , 0 y 2 2 , n n n 1 Bn = x, y 2 ; x 2 + y 2 3 . n
( )
( )
Then show that An A, Bn B and identify A and B. 1.1.11 Let S = and dene the subsets An, Bn, n = 1, 2, . . . of S as follows:
1 An = x ; 5 + < x < 20 n
1 , n
3 Bn = x ; 0 < x < 7 + . n
An = A and lim B = B exist (by Then show that An and Bn, so that lim n n n Exercise 1.1.9(iv)). Also identify the sets A and B. 1.1.12 Let A and B be subsets of S and for n = 1, 2, . . . , dene the sets An as follows: A2n 1 = A, A2n = B. Then show that
lim inf An = A B,
n
lim sup An = A B.
n
1.2* Fields and -Fields

In this section, we introduce the concepts of a eld and of a -eld, present a number of examples, and derive some basic results.
DEFINITION 2
A class (set) of subsets of S is said to be a eld, and is denoted by F, if (F 1) F is a non-empty class. (F 2) A F implies that Ac F (that is, F is closed under complementation). (F 3) A1, A2 F implies that A1 A2 F (that is, F is closed under pairwise unions).
1.2.1
Consequences of the Denition of a Field
1. S, F.
n 2. If Aj F, j = 1, 2, . . . , n, then Un j = 1 A j F, Ij = 1 A j F for any nite n.
(That is, F is closed under nite unions and intersections. Notice, however, that Aj F, j = 1, 2, . . . need not imply that their union or intersection is in F; for a counterexample, see consequence 2 on page 10.)
PROOF OF (1) AND (2) (1) (F1) implies that there exists A F and (F 2) implies that Ac F. By (F 3), A Ac = S F. By (F 2), S c = F. (2) The proof will be by induction on n and by one of the De Morgans laws. By (F3), if A1, A2 F, then A1 A2 F; hence the statement for unions is true for n = 2. (It is trivially true for n = 1.) Now assume the statement for unions is true for n = k 1; that is, if
A1 , A2 , , Ak1 F , then
U Aj F .
j =1
k1
Consider A1, A2, . . . , Ak F. By the associative law for unions of sets,

k1 A = U j U A j Ak . j =1 j =1
k
1 By the induction hypothesis, Uk j = 1 A j F. Since Ak F, (F 3) implies that

k k1 U A j Ak = U A j F j =1 j =1
and by induction, the statement for unions is true for any nite n. By observing that
n c A = I j U Aj , j =1 j =1
n
* The reader is reminded that sections marked by an asterisk may be omitted without jeo* pardizing the understanding of the remaining material.
-Fields 1.1 Some1.2* Denitions Fields and and Notation
we see that (F2) and the above statement for unions imply that if A1, . . . , An F, then In j = 1 A j F for any nite n.
1.2.2 Examples of Fields

1. C1 = {, S} is a eld (trivial eld). 2. C2 = {all subsets of S} is a eld (discrete eld). 3. C3 = {, S, A, Ac}, for some A S, is a eld. 4. Let S be innite (countably so or not) and let C4 be the class of subsets of S which are nite, or whose complements are nite; that is, C4 = {A S; A or Ac is nite}. As an example, we shall verify that C4 is a eld.
PROOF THAT C4 IS A FIELD
i) Since S c = is nite, S C4, so that C4 is non-empty. ii) Suppose that A C4. Then A or Ac is nite. If A is nite, then (Ac)c = A is nite and hence Ac C4 also. If Ac is nite, then Ac C4. c iii) Suppose that A1, A2 C4. Then A1 or Ac 1 is nite and A2 or A2 is nite. a) Suppose that A1, A2 are both nite. Then A1 A2 is nite, so that A1 A2 C4.
c c b) Suppose that A1 , A2 are nite. Then (A1 A2)c = A1 Ac 2 is nite c since A1 is. Hence A1 A2 C4.
The other two possibilities follow just as in (b). Hence (F1), (F2), (F3) are satised. We now formulate and prove the following theorems about elds.
THEOREM 1
Let I be any non-empty index set (nite, or countably innite, or uncountable), and let Fj, j I be elds of subsets of S. Dene F by F = I j I F j = {A; A Fj for all j I}. Then F is a eld.
PROOF
i) S, Fj for every j I, so that S, F and hence F is non-empty. ii) If A F, then A Fj for every j I. Thus Ac Fj for every j I, so that Ac F. iii) If A1, A2 F, then A1, A2 Fj for every j I. Then A1 A2 Fj for every j I, and hence A1 A2 F.
THEOREM 2
Let C be an arbitrary class of subsets of S. Then there is a unique minimal eld F containing C. (We say that F is generated by C and write F = F(C).)
PROOF
Clearly, C is contained in the discrete eld. Next, let {Fj, j I } be the class of all elds containing C and dene F(C) by
F C = I F j.
j I
( )
10
By Theorem 1, F(C) is a eld containing C. It is obviously the smallest such eld, since it is the intersection of all elds containing C, and is unique. Hence F = F(C).
DEFINITION 3
A class of subsets of S is said to be a -eld, and is denoted by A , if it is a eld and furthermore (F3) is replaced by (A 3): If Aj A, j = 1, 2, . . . , then U j =1 Aj A (that is, A is closed under denumerable unions).
1.2.3
Consequences of the Denition of a -Field
1. If Aj A, j = 1, 2, . . . , then I j = 1 A j A (that is, A is closed under denumerable intersections). 2. By denition, a -eld is a eld, but the converse is not true. In fact, in Example 4 on page 9, take S = (, ), and dene Aj = {all integers in [j, j]}, j = 1, 2, . . . . Then U j = 1 A j is the set A, say, of all integers. Thus A is innite and furthermore so is Ac. Hence A F, whereas Aj F for all j.
1.2.4
Examples of -Fields
1. C1 = {, S } is a -eld (trivial -eld). 2. C2 = {all subsets of S } is a -eld (discrete -eld). 3. C3 = {, S, A, Ac} for some A S is a -eld. 4. Take S to be uncountable and dene C4 as follows: C4 = {all subsets of S which are countable or whose complements are countable}. As an example, we prove that C4 is a -eld.
PROOF
i) Sc = is countable, so C4 is non-empty. ii) If A C4, then A or Ac is countable. If A is countable, then (Ac)c = A is countable, so that Ac C4. If Ac is countable, by denition Ac C4. iii) The proof of this statement requires knowledge of the fact that a countable union of countable sets is countable. (For proof of this fact see page 36 in Tom M. Apostols book Mathematical Analysis, published by Addison-Wesley, 1957.) Let Aj, j = 1, 2, . . . A. Then either each Aj is countable, or there exists some Aj for which Aj is not countable but Ac j is. In the rst case, we invoke the previously mentioned theorem on the countable union of countable sets. In the second case, we note that
A = I Acj , U j j = 1 j = 1 c
which is countable, since it is the intersection of sets, one of which is countable.
1.1
-Fields Some1.2* Denitions Fields and and Notation
11
We now introduce some useful theorems about -elds.

THEOREM 3
Let I be as in Theorem 1, and let Aj, j I, be -elds. Dene A by A = I jI Aj = {A; A Aj for all j I }. Then A is a -eld.
PROOF
i) S, Aj for every j I and hence they belong in A. ii) If A A, then A Aj for every j I, so that Ac Aj for every j I. Thus Ac A. iii) If A1, A2, . . . , A, then A1, A2, . . . Aj for every j I and hence U j =1 Aj A A A j; for every j I; thus U . j =1 j
THEOREM 4
Let C be an arbitrary class of subsets of S. Then there is a unique minimal -eld A containing C. (We say that A is the -eld generated by C and write A = (C).)
PROOF
Clearly, C is contained in the discrete -eld. Dene
C = I all -elds containing C .

By Theorem 3, (C ) is a -eld which obviously contains C. Uniqueness and minimality again follow from the denition of (C ). Hence A = (C ). For later use, we note that if A is a -eld and A A, then AA = {C; C = B A for some B A} is a -eld, where complements of sets are formed with respect to A, which now plays the role of the entire space. This is easily seen to be true by the distributive property of intersection over union (see also Exercise 1.2.5). In all that follows, if S is countable (that is, nite or denumerably innite), we will always take A to be the discrete -eld. However, if S is uncountable, then for certain technical reasons, we take the -eld to be smaller than the discrete one. In both cases, the pair (S, A) is called a measurable space.
REMARK 1
( )
1.2.5 Special Cases of Measurable Spaces

1. Let S be ( the set of real numbers, or otherwise known as the real line) and dene C0 as follows: , x , , x , x, , x, , x, y , C0 = all intervals in = . x, y , x, y , x, y ; x, y , x < y
( (
)( ]( )[ ][ )[ ]
)(
By Theorem 4, there is a -eld A = (C0); we denote this -eld by B and call
12
it the Borel -eld (over the real line). The pair ( , B) is called the Borel real line.
THEOREM 5
Each one of the following classes generates the Borel -eld. C1 = C2 C3 C4 C5 C6 C7 C8
Also the classes C j, j = 1, . . . , 8 generate the Borel -eld, where for j = 1, . . . , 8, C j is dened the same way as Cj is except that x, y are restricted to the rational numbers. Clearly, if C, C are two classes of subsets of S such that C C , then (C) (C ). Thus, in order to prove the theorem, it sufces to prove that B (Cj), B (C j), j = 1, 2, . . . , 8, and in order to prove this, it sufces to show that C0 (Cj), C0 (C j), j = 1, 2, . . . , 8. As an example, we show that C0 (C7). Consider xn x. Then (, xn) (C7) and hence I n=1 (, xn) (C7). But
PROOF
{(x, y]; x, y , x < y}, = {[ x, y); x, y , x < y}, = {[ x, y]; x, y , x < y}, = {( x, y); x, y , x < y}, = {( x, ); x }, = {[ x, ); x }, = {( , x ); x }, = {( , x ]; x }.
I (, x ) = (, x ].
n n=1
Thus (, x] (C7) for every x . Since
(x, ) = (, x] ,
c
[x, ) = (, x) ,
c
7
it also follows that (x, ), [x, ) (C7). Next,
(x, y) = (, y) (, x] = (, y) (x, ) (C ), (x, y] = (, y] (x, ) (C ), [x, y) = (, y) [x, ) (C ), [x, y] = (, y] [x, ) (C ).

7 7 7
Thus C0 (C7). In the case of C j, j = 1, 2, . . . , 8, consider monotone sequences of rational numbers convergent to given irrationals x, y.
1.1
Some Denitions and Exercises Notation
13
2. Let S = = 2 and dene C0 as follows:
C0 = all rectangles in 2 =
} {(, x) (, x ), (, x) (, x ],
(, x] (, x ), (, x] (, x ], (x, ) (x , ), , [x, ) [x , ), , (x, y) (x , y), , [x, y] [x , y], x, y, x , y , x < y, x < y}.
The -eld generated by C0 is denoted by B2 and is the two-dimensional Borel -eld. A theorem similar to Theorem 5 holds here too. 3. Let S = = k (k copies of ) and dene C0 in a way similar to that in (2) above. The -eld generated by C0 is denoted by Bk and is the k-dimensional Borel -eld. A theorem similar to Theorem 5 holds here too.
Exercises
1.2.1 Verify that the classes dened in Examples 1, 2 and 3 on page 9 are elds. 1.2.2 Show that in the denition of a eld (Denition 2), property (F3) can be replaced by (F3) which states that if A1, A2 F, then A1 A2 F. 1.2.3 Show that in Denition 3, property (A3) can be replaced by (A3), which states that if
Aj A, j = 1, 2, then
I Aj A.
j =1
1.2.4 Refer to Example 4 on -elds on page 10 and explain why S was taken to be uncountable. 1.2.5 Give a formal proof of the fact that the class AA dened in Remark 1 is a -eld. and lim An, 1.2.6 Refer to Denition 1 and show that all three sets A, A n whenever it exists, belong to A provided An, n 1, belong to A. 1.2.7 Let S = {1, 2, 3, 4} and dene the class C of subsets of S as follows:
C = , 1 , 2 , 3 , 4 , 1, 2 , 1, 3 , 1, 4 , 2, 3 , 2, 4 ,
{ {} {} {} { } { } { } { } { } { } {1, 2, 3}, {1, 3, 4}, {2, 3, 4}, S }.
Determine whether or not C is a eld. 1.2.8 Complete the proof of the remaining parts in Theorem 5.
14
Some Probabilistic Concepts and Results
Chapter 2
2.1 Probability Functions and Some Basic Properties and Results

Intuitively by an experiment one pictures a procedure being carried out under a certain set of conditions whereby the procedure can be repeated any number of times under the same set of conditions, and upon completion of the procedure certain results are observed. An experiment is a deterministic experiment if, given the conditions under which the experiment is carried out, the outcome is completely determined. If, for example, a container of pure water is brought to a temperature of 100C and 760 mmHg of atmospheric pressure the outcome is that the water will boil. Also, a certicate of deposit of $1,000 at the annual rate of 5% will yield $1,050 after one year, and $(1.05)n 1,000 after n years when the (constant) interest rate is compounded. An experiment for which the outcome cannot be determined, except that it is known to be one of a set of possible outcomes, is called a random experiment. Only random experiments will be considered in this book. Examples of random experiments are tossing a coin, rolling a die, drawing a card from a standard deck of playing cards, recording the number of telephone calls which arrive at a telephone exchange within a specied period of time, counting the number of defective items produced by a certain manufacturing process within a certain period of time, recording the heights of individuals in a certain class, etc. The set of all possible outcomes of a random experiment is called a sample space and is denoted by S. The elements s of S are called sample points. Certain subsets of S are called events. Events of the form {s} are called simple events, while an event containing at least two sample points is called a composite event. S and are always events, and are called the sure or certain event and the impossible event, respectively. The class of all events has got to be sufciently rich in order to be meaningful. Accordingly, we require that, if A is an event, then so is its complement Ac. Also, if Aj, j = 1, 2, . . . are events, then so is their union U j Aj.
14
2.1 Probability Functions and Some Basic 2.4 Properties Combinatorial and Results
15
(In the terminology of Section 1.2, we require that the events associated with a sample space form a -eld of subsets in that space.) It follows then that I j Aj is also an event, and so is A1 A2, etc. If the random experiment results in s and s A, we say that the event A occurs or happens. The U j Aj occurs if at least one of the Aj occurs, the I j Aj occurs if all Aj occur, A1 A2 occurs if A1 occurs but A2 does not, etc. The next basic quantity to be introduced here is that of a probability function (or of a probability measure).
DEFINITION 1
A probability function denoted by P is a (set) function which assigns to each event A a number denoted by P(A), called the probability of A, and satises the following requirements: (P1) P is non-negative; that is, P(A) 0, for every event A. (P2) P is normed; that is, P(S ) = 1. (P3) P is -additive; that is, for every collection of pairwise (or mutually) disjoint events Aj, j = 1, 2, . . . , we have P(j Aj) = j P(Aj). This is the axiomatic (Kolmogorov) denition of probability. The triple (S, class of events, P) (or (S, A, P)) is known as a probability space.
REMARK 1
If S is nite, then every subset of S is an event (that is, A is taken to be the discrete -eld). In such a case, there are only nitely many events and hence, in particular, nitely many pairwise disjoint events. Then (P3) is reduced to: (P3) P is nitely additive; that is, for every collection of pairwise disjoint events, Aj, j = 1, 2, . . . , n, we have
n n P A j = P A j . j =1 j =1
( )
Actually, in such a case it is sufcient to assume that (P3) holds for any two disjoint events; (P3) follows then from this assumption by induction.
2.1.1 Consequences of Denition 1

(C1) P() = 0. In fact, S = S + + , so that
P S = P S ++ = P S +P + ,
( )
( ) ( )
or
1 = 1+ P +
( )
and
P = 0,
( )
since P() 0. (So P() = 0. Any event, possibly , with probability 0 is called a null event.) (C2) P is nitely additive; that is for any event Aj, j = 1, 2, . . . , n such that Ai Aj = , i j,
16

n n P A j = P A j . j =1 j =1
( )
Indeed, jn= 1P Aj .
( )
for
Aj = 0, j n + 1, P jn= 1Aj = P j= 1PAj = j= 1P Aj =
) (
( )
(C3) For every event A, P(Ac) = 1 P(A). In fact, since A + Ac = S,
P A + Ac = P S , or
) ()
P A + P Ac = 1,
( ) ( )
so that P(Ac) = 1 P(A). (C4) P is a non-decreasing function; that is A1 A2 implies P(A1) P(A2). In fact,
A2 = A1 + A2 A1 ,
hence
P A2 = P A1 + P A2 A1 ,
( )
( ) (
and therefore P(A2) P(A1).

REMARK 2
If A1 A2, then P(A2 A1) = P(A2) P(A1), but this is not true,
in general. (C5) 0 P(A) 1 for every event A. This follows from (C1), (P2), and (C4). (C6) For any events A1, A2, P(A1 A2) = P(A1) + P(A2) P(A1 A2). In fact,
A1 A2 = A1 + A2 A1 A2 .
Hence
P A1 A2 = P A1 + P A2 A1 A2
1 2 1
( ) ( ) = P( A ) + P( A ) P( A A ),
2
since A1 A2 A2 implies
P A2 A1 A2 = P A2 P A1 A2 .
(C7) P is subadditive; that is,
P U A j P A j j =1 j =1
( ) (
( )
and also
n n P U A j P A j . j =1 j =1
( )
17
This follows from the identities
U A j = A1 + ( A1c A2 ) + + ( A1c Anc1 An ) + ,

j =1 n
U A j = A1 + ( A1c A2 ) + + ( A1c Anc1 An ),

j =1
(P3) and (C2), respectively, and (C4). A special case of a probability space is the following: Let S = {s1, s2, . . . , sn}, let the class of events be the class of all subsets of S, and dene P as P({sj}) = 1/n, j = 1, 2, . . . , n. With this denition, P clearly satises (P1)(P3) and this is the classical denition of probability. Such a probability function is called a uniform probability function. This denition is adequate as long as S is nite and the simple events {sj}, j = 1, 2, . . . , n, may be assumed to be equally likely, but it breaks down if either of these two conditions is not satised. However, this classical denition together with the following relative frequency (or statistical) denition of probability served as a motivation for arriving at the axioms (P1)(P3) in the Kolmogorov denition of probability. The relative frequency denition of probability is this: Let S be any sample space, nite or not, supplied with a class of events A. A random experiment associated with the sample space S is carried out n times. Let n(A) be the number of times that the event A occurs. If, as n , lim[n(A)/n] exists, it is called the probability of A, and is denoted by P(A). Clearly, this denition satises (P1), (P2) and (P3). Neither the classical denition nor the relative frequency denition of probability is adequate for a deep study of probability theory. The relative frequency denition of probability provides, however, an intuitively satisfactory interpretation of the concept of probability. We now state and prove some general theorems about probability functions.
THEOREM 1
(Additive Theorem) For any nite number of events, we have

n n P U A j = P A j P A j A j j =1 j =1 1 j < j n
( )
)
)
P Aj Aj Aj
1 2
1 j1 < j2 < j3 n
+ 1
( )
n+1
P A1 A2 An .
PROOF (By induction on n). For n = 1, the statement is trivial, and we have proven the case n = 2 as consequence (C6) of the denition of probability functions. Now assume the result to be true for n = k, and prove it for n = k + 1.
18
We have
k k+1 P U A j = P U A j Ak+1 j =1 j =1 k k = P U A j + P Ak+1 P U A j Ak+1 j =1 j =1
k = P A j P A j1 A j2 1 j1 < j2 k j =1 + P A j1 A j2 A j3
( )
k+1
1 j1 < j2 < j3 k
+ 1
k+1
( )
k P A1 A2 Ak P A P A j Ak+1 + U k+1 j =1
= P Aj
j =1
1 ji < j2 < j3 k
( ) P( A A ) P( A A A )
1 ji < j2 k j1 j1 j2 j2 j3 k+1
+ 1
But
( )
k P A1 A2 Ak P U A j Ak+1 j =1
. )
(1)
k k P U A j Ak+1 = P A j Ak+1 P A j1 A j2 Ak+1 j =1 j =1 1 j1 < j2 k
) )
1 j1 < j2 < j3 k
P A j1 A j2 A j3 Ak+1
+ 1 + 1
Replacing this in (1), we get
( ) ( )
1 j1 < j2 jk 1 k k+1
P A j1 A jk 11 Ak+1
P A1 Ak Ak+1 .
k k+1 k+1 P U A j = P A j P A j A j + P A j Ak+1 j =1 j =1 j =1 1 j < j k + P A j A j A j + P A j A j Ak+1 1 j < j k 1 j < j < j k
( )
1 2
+ 1 +
( ) [ P( A A )
k+1 1 k
1 j1 < j2 < < jk 1
P A j A j Ak+1 k
k 1
19
( ) P( A A A ) = P( A ) P( A A ) + P( A A A )
+ 1
k+1 j=1 k+ 2 1 k k+1 j 1 j1 < j2 k+1 j1 j1 j2 1 j1 < j2 < j3 k+1 j2 j3
+ 1
THEOREM 2
( )
k+ 2
P A1 Ak+1 .
Let {An} be a sequence of events such that, as n , An or An . Then,

P lim An = lim P An .
n n
( )
PROOF
Let us rst assume that An . Then
lim An = U A j.
n j=1
We recall that
UA
j =1
c = A1 + A1c A2 + A1c A2 A3 +
(
(
) (
= A1 + A2 A1 + A3 A2 + ,
by the assumption that An . Hence
) (
P lim An = P U A j = P A1 + P A2 A1 n j =1
( ) (
2 1
)
n n1
( ) = lim[ P( A ) + P( A A ) + + P( A A )] = lim[ P( A ) + P( A ) P( A ) + P( A ) P( A ) + + P( A ) P( A )] = lim P( A ).

+ P A3 A2 + + P An An1 +
n n 1 1 2 1 3 2 n n1 n n
Thus
P lim An = lim P An .
n n
( )
Now let An . Then Ac n , so that

c lim An = U Ac j. n j=1
20
Hence
c c P lim An = P U Ac j = lim P An , n n j=1
( )
or equivalently,
c P I A j = lim 1 P An , or 1 P I A j = 1 lim P An . n j = 1 n j =1
( )]
( )
Thus
lim P An = P I A j = P lim An , n n j =1
( )
and the theorem is established. This theorem will prove very useful in many parts of this book.
Exercises
2.1.1 If the events Aj, j = 1, 2, 3 are such that A1 A2 A3 and P(A1) = 5 P(A2) = 12 , P(A3) = 7 , compute the probability of the following events:
12
c c c A A2 , A1c A3 , A2 A3 , A1 A2 A3c , A1c A2 A3c . c 1
1 4
2.1.2 If two fair dice are rolled once, what is the probability that the total number of spots shown is i) Equal to 5? ii) Divisible by 3? 2.1.3 Twenty balls numbered from 1 to 20 are mixed in an urn and two balls are drawn successively and without replacement. If x1 and x2 are the numbers written on the rst and second ball drawn, respectively, what is the probability that: i) x1 + x2 = 8? ii) x1 + x2 5? 2.1.4 Let S = {x integer; 1 x 200} and dene the events A, B, and C by: A = x S ; x is divisible by 7 , for some positive integer n ,
{ B = {x S ; x = 3n + 10
C = x S ; x 2 + 1 375 .
2.2 2.4 Conditional Combinatorial Probability Results
21
Compute P(A), P(B), P(C), where P is the equally likely probability function on the events of S. 2.1.5 Let S be the set of all outcomes when ipping a fair coin four times and let P be the uniform probability function on the events of S. Dene the events A, B as follows:
{ } B = {s S ; any T in s precedes every H in s}.

A = s S ; s contains more T s than H s ,
Compute the probabilities P(A), P(B). 2.1.6 Suppose that the events Aj, j = 1, 2, . . . are such that
P( A j ) < .
j=1
Use Denition 1 in Chapter 1 and Theorem 2 in this chapter in order to show ) = 0. that P(A 2.1.7 Consider the events Aj, j = 1, 2, . . . and use Denition 1 in Chapter 1 and Theorem 2 herein in order to show that P A lim inf P An lim sup P An P A .
n n
( )
( )
( )
( )
2.2 Conditional Probability

In this section, we shall introduce the concepts of conditional probability and stochastic independence. Before the formal denition of conditional probability is given, we shall attempt to provide some intuitive motivation for it. To this end, consider a balanced die and suppose that the sides bearing the numbers 1, 4 and 6 are painted red, whereas the remaining three sides are painted black. The die is rolled once and we are asked for the probability that the upward side is the one bearing the number 6. Assuming the uniform probability function, the answer is, clearly, 1 . Next, suppose that the die is rolled once as 6 before and all that we can observe is the color of the upward side but not the number on it (for example, we may be observing the die from a considerable distance, so that the color is visible but not the numbers on the sides). The same question as above is asked, namely, what is the probability that the number on the uppermost side is 6. Again, by assuming the uniform probabil. This latter probability is called the condiity function, the answer now is 1 3 tional probability of the number 6 turning up, given the information that the uppermost side was painted red. Letting B stand for the event that number 6 appears and A for the event that the uppermost side is red, the above-
22
mentioned conditional probability is denoted by P(B|A), and we observe that this is equal to the quotient P(A B)/P(A). Or suppose that, for the purposes of a certain study, we observe two-children families in a certain locality, and record the gender of the children. A sample space for this experiment is the following: S = {bb, bg, gb, gg}, where b stands for boy and g for girl, and bg, for example, indicates that the boy is older than the girl. Suppose further (although this is not exactly correct) that: P({bb}) = P({bg}) = P({gb}) = P({gg}) = 1 , and dene the events A and B as follows: A = children of one gender = 4 {bb, gg}, B = at least one boy = {bb, bg, gb}. Then P(A|B) = P(A B)/ P(B) = 1 . 3 From these and other examples, one is led to the following denition of conditional probability.
DEFINITION 2
Let A be an event such that P(A) > 0. Then the conditional probability, given A, is the (set) function denoted by P(|A) and dened for every event B as follows:
P BA = P A B ( ) (P( A) ) .
P(B|A) is called the conditional probability of B, given A. The set function P(|A) is actually a probability function. To see this, it sufces to prove the P(|A) satises (P1)(P3). We have: P(B|A) 0 for every event B, clearly. Next,
PSA =
P SA P A ( ) (P( A) ) = P(( A)) = 1,
and if Aj, j = 1, 2, . . . , are events such that Ai Aj = , i j, we have

A A P j = 1 A j A P j = 1 j P A j A = = P A P A j =1
( )
1 P A
( )
P( A
j =1
A =
j =1
P Aj A P A
( ( )
( )
)=
P( A
j =1
A.
The conditional probability can be used in expressing the probability of the intersection of a nite number of events.
THEOREM 3
(Multiplicative Theorem) Let Aj, j = 1, 2, . . . , n, be events such that

n1 P I A j > 0. j =1
Then
2.4 2.2 Conditional Combinatorial Probability Results
23
n P I A j = P An A1 A2 An1 j =1
) ( )( )
P An1 A1 An 2 P A2 A1 P A1 .
(The proof of this theorem is left as an exercise; see Exercise 2.2.4.) The value of the above formula lies in the fact that, in general, it is easier to calculate the conditional probabilities on the right-hand side. This point is illustrated by the following simple example.
REMARK 3 EXAMPLE 1
An urn contains 10 identical balls (except for color) of which ve are black, three are red and two are white. Four balls are drawn without replacement. Find the probability that the rst ball is black, the second red, the third white and the fourth black. Let A1 be the event that the rst ball is black, A2 be the event that the second ball is red, A3 be the event that the third ball is white and A4 be the event that the fourth ball is black. Then P A1 A2 A3 A4
= P A4 A1 A2 A3 P A3 A1 A2 P A2 A1 P A1 , and by using the uniform probability function, we have
)(
)(
)( )
P A1 =
( )
5 , 10
P A2 A1 =
3 , 9
P A3 A1 A2 =
2 , 8
P A4 A1 A2 A3 =
Thus the required probability is equal to
1 42
4 . 7
0.0238.
Now let Aj, j = 1, 2, . . . , be events such that Ai Aj = , i j, and j Aj = S. Such a collection of events is called a partition of S. The partition is nite or (denumerably) innite, accordingly, as the events Aj are nitely or (denumerably) innitely many. For any event, we clearly have:
B = B Aj .
j
Hence P B = P B Aj = P B Aj P Aj ,
j j
( )
)( )
provided P(Aj) > 0, for all j. Thus we have the following theorem.
THEOREM 4
(Total Probability Theorem) Let {Aj, j = 1, 2, . . . } be a partition of S with P(Aj) > 0, all j. Then for B A, we have P(B) = jP(B|Aj)P(Aj). This formula gives a way of evaluating P(B) in terms of P(B|Aj) and P(Aj), j = 1, 2, . . . . Under the condition that P(B) > 0, the above formula
24
can be reversed to provide an expression for P(Aj|B), j = 1, 2, . . . . In fact, P Aj B = Thus

THEOREM 5
P B A ) P( A ) P( B A ) P( A ) P A B = . ) ( P(B) ) = ( P(B ) P( B A ) P( A )
j j j j j i i i
(Bayes Formula) If {Aj, j = 1, 2, . . .} is a partition of S and P(Aj) > 0, j = 1, 2, . . . , and if P(B) > 0, then P Aj B =
)( ). P( B A ) P( A )
P B Aj P Aj
i i i
It is important that one checks to be sure that the collection {Aj, j 1} forms a partition of S, as only then are the above theorems true. The following simple example serves as an illustration of Theorems 4 and 5.
REMARK 4 EXAMPLE 2
A multiple choice test question lists ve alternative answers, of which only one is correct. If a student has done the homework, then he/she is certain to identify the correct answer; otherwise he/she chooses an answer at random. Let p denote the probability of the event A that the student does the homework and let B be the event that he/she answers the question correctly. Find the expression of the conditional probability P(A|B) in terms of p. By noting that A and Ac form a partition of the appropriate sample space, an application of Theorems 4 and 5 gives P AB =
( )
P BA P A +P BA P A
c
( )( ) (
P BA P A
( )( )
)( )
c
1 p 5p = . 1 4p+1 1 p + 1 p 5
Furthermore, it is easily seen that P(A|B) = P(A) if and only if p = 0 or 1. For example, for p = 0.7, 0.5, 0.3, we nd, respectively, that P(A|B) is approximately equal to: 0.92, 0.83 and 0.68. Of course, there is no reason to restrict ourselves to one partition of S only. We may consider, for example, two partitions {Ai, i = 1, 2, . . .} {Bj, j = 1, 2, . . . }. Then, clearly,
Ai = Ai B j ,
j
Bj
and
( ) = ( B A ),
j i i
j
i = 1, 2, , j = 1, 2, ,
{A B , i = 1, 2, , j = 1, 2, }
i
2.4
Combinatorial Exercises Results
25
is a partition of S. In fact,
(A B ) (A
i j
B j = if
(i, j ) (i, j )
i i
and
( A B ) = ( A B ) = A = S.
i j i j i, j i j
The expression P(Ai Bj) is called the joint probability of Ai and Bj. On the other hand, from
Ai = Ai Bj
j
and
Bj = Ai Bj ,
i
we get P Ai = P Ai B j = P Ai B j P B j ,
j j
( )
( )
(
(
)
)
(
(
)( )
)( )
provided P(Bj) > 0, j = 1, 2, . . . , and

P B j = P Ai B j = P B j Ai P Ai ,
i i
provided P(Ai) > 0, i = 1, 2, . . . . The probabilities P(Ai), P(Bj) are called marginal probabilities. We have analogous expressions for the case of more than two partitions of S.
Exercises
2.2.1 If P(A|B) > P(A), then show that P(B|A) > P(B) 2.2.2 Show that: i) P(Ac|B) = 1 P(A|B); ii) P(A B|C) = P(A|C) + P(B|C) P(A B|C). Also show, by means of counterexamples, that the following equations need not be true: iii) P(A|Bc) = 1 P(A|B); iv) P(C|A + B) = P(C|A) + P(C|B). 2.2.3 If A B = and P(A + B) > 0, express the probabilities P(A|A + B) and P(B|A + B) in terms of P(A) and P(B). 2.2.4 Use induction to prove Theorem 3. 2.2.5 Suppose that a multiple choice test lists n alternative answers of which only one is correct. Let p, A and B be dened as in Example 2 and nd Pn(A|B) (P(A)P(B) > 0).
26
in terms of n and p. Next show that if p is xed but different from 0 and 1, then Pn(A|B) increases as n increases. Does this result seem reasonable?
c c 2.2.6 If Aj, j = 1, 2, 3 are any events in S, show that {A1, Ac 1 A2, A 1 A 2 c A3, (A1 A2 A3) } is a partition of S.
2.2.7 Let {Aj, j = 1, . . . , 5} be a partition of S and suppose that P(Aj) = j/15 and P(A|Aj) = (5 j)/15, j = 1, . . . , 5. Compute the probabilities P(Aj|A), j = 1, . . . , 5. 2.2.8 A girls club has on its membership rolls the names of 50 girls with the following descriptions: 20 blondes, 15 with blue eyes and 5 with brown eyes; 25 brunettes, 5 with blue eyes and 20 with brown eyes; 5 redheads, 1 with blue eyes and 4 with green eyes. If one arranges a blind date with a club member, what is the probability that: i) The girl is blonde? ii) The girl is blonde, if it was only revealed that she has blue eyes? 2.2.9 Suppose that the probability that both of a pair of twins are boys is 0.30 and that the probability that they are both girls is 0.26. Given that the probability of a child being a boy is 0.52, what is the probability that: i) The second twin is a boy, given that the rst is a boy? ii) The second twin is a girl, given that the rst is a girl? 2.2.10 Three machines I, II and III manufacture 30%, 30% and 40%, respectively, of the total output of certain items. Of them, 4%, 3% and 2%, respectively, are defective. One item is drawn at random, tested and found to be defective. What is the probability that the item was manufactured by each one of the machines I, II and III? 2.2.11 A shipment of 20 TV tubes contains 16 good tubes and 4 defective tubes. Three tubes are chosen at random and tested successively. What is the probability that: i) The third tube is good, if the rst two were found to be good? ii) The third tube is defective, if one of the other two was found to be good and the other one was found to be defective? 2.2.12 Suppose that a test for diagnosing a certain heart disease is 95% accurate when applied to both those who have the disease and those who do not. If it is known that 5 of 1,000 in a certain population have the disease in question, compute the probability that a patient actually has the disease if the test indicates that he does. (Interpret the answer by intuitive reasoning.) 2.2.13 Consider two urns Uj, j = 1, 2, such that urn Uj contains mj white balls and nj black balls. A ball is drawn at random from each one of the two urns and
2.4
Combinatorial 2.3 Independence Results
27
is placed into a third urn. Then a ball is drawn at random from the third urn. Compute the probability that the ball is black. 2.2.14 Consider the urns of Exercise 2.2.13. A balanced die is rolled and if an even number appears, a ball, chosen at random from U1, is transferred to urn U2. If an odd number appears, a ball, chosen at random from urn U2, is transferred to urn U1. What is the probability that, after the above experiment is performed twice, the number of white balls in the urn U2 remains the same? 2.2.15 Consider three urns Uj, j = 1, 2, 3 such that urn Uj contains mj white balls and nj black balls. A ball, chosen at random, is transferred from urn U1 to urn U2 (color unnoticed), and then a ball, chosen at random, is transferred from urn U2 to urn U3 (color unnoticed). Finally, a ball is drawn at random from urn U3. What is the probability that the ball is white? 2.2.16 Consider the urns of Exercise 2.2.15. One urn is chosen at random and one ball is drawn from it also at random. If the ball drawn was white, what is the probability that the urn chosen was urn U1 or U2? 2.2.17 Consider six urns Uj, j = 1, . . . , 6 such that urn Uj contains mj ( 2) white balls and nj ( 2) black balls. A balanced die is tossed once and if the number j appears on the die, two balls are selected at random from urn Uj. Compute the probability that one ball is white and one ball is black. 2.2.18 Consider k urns Uj, j = 1, . . . , k each of which contain m white balls and n black balls. A ball is drawn at random from urn U1 and is placed in urn U2. Then a ball is drawn at random from urn U2 and is placed in urn U3 etc. Finally, a ball is chosen at random from urn Uk1 and is placed in urn Uk. A ball is then drawn at random from urn Uk. Compute the probability that this last ball is black.
2.3 Independence
For any events A, B with P(A) > 0, we dened P(B|A) = P(A B)/P(A). Now P(B|A) may be >P(B), < P(B), or = P(B). As an illustration, consider an urn containing 10 balls, seven of which are red, the remaining three being black. Except for color, the balls are identical. Suppose that two balls are drawn successively and without replacement. Then (assuming throughout the uniform probability function) the conditional probability that the second ball is red, given that the rst ball was red, is 6 , whereas the conditional probability 9 that the second ball is red, given that the rst was black, is 7 . Without any 9 knowledge regarding the rst ball, the probability that the second ball is red is 7 . On the other hand, if the balls are drawn with replacement, the probability 10 7 that the second ball is red, given that the rst ball was red, is 10 . This probability is the same even if the rst ball was black. In other words, knowledge of the event which occurred in the rst drawing provides no additional information in
28
calculating the probability of the event that the second ball is red. Events like these are said to be independent. As another example, revisit the two-children families example considered earlier, and dene the events A and B as follows: A = children of both genders, B = older child is a boy. Then P(A) = P(B) = P(B|A) = 1 . Again 2 knowledge of the event A provides no additional information in calculating the probability of the event B. Thus A and B are independent. More generally, let A, B be events with P(A) > 0. Then if P(B|A) = P(B), we say that the even B is (statistically or stochastically or in the probability sense) independent of the event A. If P(B) is also > 0, then it is easily seen that A is also independent of B. In fact,
P AB =
P B A)P( A) P( B)P( A) P A B = = P( A). ( ) (P(B) ) = ( P(B P( B) )
That is, if P(A), P(B) > 0, and one of the events is independent of the other, then this second event is also independent of the rst. Thus, independence is a symmetric relation, and we may simply say that A and B are independent. In this case P(A B) = P(A)P(B) and we may take this relationship as the denition of independence of A and B. That is,
DEFINITION 3
The events A, B are said to be (statistically or stochastically or in the probability sense) independent if P(A B) = P(A)P(B). Notice that this relationship is true even if one or both of P(A), P(B) = 0. As was pointed out in connection with the examples discussed above, independence of two events simply means that knowledge of the occurrence of one of them helps in no way in re-evaluating the probability that the other event happens. This is true for any two independent events A and B, as follows from the equation P(A|B) = P(A), provided P(B) > 0, or P(B|A) = P(B), provided P(A) > 0. Events which are intuitively independent arise, for example, in connection with the descriptive experiments of successively drawing balls with replacement from the same urn with always the same content, or drawing cards with replacement from the same deck of playing cards, or repeatedly tossing the same or different coins, etc. What actually happens in practice is to consider events which are independent in the intuitive sense, and then dene the probability function P appropriately to reect this independence. The denition of independence generalizes to any nite number of events. Thus:
DEFINITION 4
The events Aj, j = 1, 2, . . . , n are said to be (mutually or completely) independent if the following relationships hold: P Aj Aj = P Aj P Aj
1 k 1
) ( )
( )
k
for any k = 2, . . . , n and j1, . . . , jk = 1, 2, . . . , n such that 1 j1 < j2 < < jk n. These events are said to be pairwise independent if P(Ai Aj) = P(Ai)P(Aj) for all i j.
2.4
29
It follows that, if the events Aj, j = 1, 2, . . . , n are mutually independent, then they are pairwise independent. The converse need not be true, as the example below illustrates. Also there are
n n n n n n n + + + =2 =2 n1 2 3 n 1 0
relationships characterizing the independence of Aj, j = 1, . . . , n and they are all necessary. For example, for n = 3 we will have:
P A1 A2 A3 = P A1 P A2 P A3 ,
1 2 1 2
) ( ) ( ) ( ) P( A A ) = P( A )P( A ), P( A A ) = P( A )P( A ), P( A A ) = P( A )P( A ).

1 3 1 3 2 3 2 3
That these four relations are necessary for the characterization of independence of A1, A2, A3 is illustrated by the following examples: Let S = {1, 2, 3, 4}, P({1}) = = P({4}) = 1 , and set A1 = {1, 2}, A2 = {1, 3}, 4 A3 = {1, 4}. Then
A1 A2 = A1 A3 = A2 A3 = 1 , and
Thus
{}
A1 A2 A3 = 1 .
{}
P A1 A2 = P A1 A3 = P A2 A3 = P A1 A2 A3 =
1 . 4
Next,
1 1 1 = = P A1 P A2 , 4 2 2 1 1 1 P A1 A3 = = = P A1 P A3 , 4 2 2 1 1 1 P A1 A3 = = = P A2 P A3 , 4 2 2 P A1 A2 =
( ( (
( ) ( )
) )
( ) ( )
( ) ( )
but
P A1 A2 A3 =
1 1 1 1 = P A1 P A2 P A3 . 4 2 2 2
( ) ( ) ( )
Now let S = {1, 2, 3, 4, 5}, and dene P as follows:
P 1 =
({ })
1 , P 2 8
3 5 , P({5}) = . ({ }) = P({3}) = P({4}) = 16 16
30
Let
A1 = 1, 2, 3 , A2 = 1, 2, 4 , A3 = 1, 3, 4 .
Then
A1 A2 = 1, 2 ,
{ }
A1 A2 A3 = 1 .
{}
Thus
P A1 A2 A3 =
1 1 1 1 = = P A1 P A2 P A3 , 8 2 2 2
( ) ( ) ( )
but
P A1 A2 =
5 1 1 = P A1 P A2 . 16 2 2
( ) ( )
The following result, regarding independence of events, is often used by many authors without any reference to it. It is the theorem below.
THEOREM 6
If the events A1, . . . , An are independent, so are the events A1 , . . . , An , where Aj is either Aj or Ac j, j = 1, . . . , n. The proof is done by (a double) induction. For n = 2, we have to c show that P(A ). Indeed, let A 1 A 2) = P(A 1)P(A2 1 = A1 and A 2 = A 2. Then c P(A1 A2 ) = P(A1 A 2) = P[A1 (S A2)] = P(A1 A1 A2) = P(A1) P(A1 A2) = P(A1) P(A1)P(A2) = P(A1)[1 P(A2)] = P(A1 )P(Ac )P(A2 ). 2) = P(A1 c c c Similarly if A = A and A = A . For A = A and A = A , P ( A A ) 1 2 2 1 2 1 2 = 1 1 2 c c c c c c P(Ac A ) = P [( S A ) A ] = P ( A A A ) = P ( A ) P ( A A ) = P ( Ac 1 1 1 1 2 2 2 2 2 2 2) c c c c P(A1)P(A2) = P(A2)[1 P(A1)] = P(A2)P(A1) = P(A1 )P(A2 ). Next, assume the assertion to be true for k events and show it to be true for k + 1 events. That is, we suppose that P(A ) = P(A1 ) P(A 1 Ak k), and we shall show that P(A A ) = P ( A ) P ( A ). First, assume 1 k+1 1 k+1 that Ak +1 = Ak+1, and we have to show that
PROOF
P A1 Ak +1 = P A1 Ak Ak+1
1 k k+1
( ) = P( A) P( A )P( A ).
)
This relationship is established also by induction as follows: If A1 = Ac 1 and Ai = Ai, i = 2, . . . , k, then

P A1c A2 Ak Ak+1 = P S A1 A2 Ak Ak+1 = P A2 Ak Ak+1 A1 A2 Ak Ak+1
2 k k+1 1 2 k
( ) = P( A A A ) P( A A A A ) = P( A ) P( A ) P( A ) P( A ) P( A ) P( A ) P( A ) = P( A ) P( A )P( A )[1 P( A )] = P( A )P( A ) P( A )P( A ).

k+1 2 2 k k k+1 k+1 1 2 k k+1 1 c 1 2 k k+1
) [(
2.4
31
c This is, clearly, true if Ac 1 is replaced by any other A i, i = 2, . . . , k. Now, for < k, assume that
c P A1 Alc Al+1 Ak +1
c = P A1 P Alc P Al+1 P Ak +1
( )
( )( )
c l +1
and show that
P A1c Alc Alc+1 Al+ 2 Ak +1 =P A

Indeed,
c 1 c l l+ 2
( ) P( A )P( A )P( A ) P( A ).
k +1
P A1c Alc Alc+1 Al+ 2 Ak+1
= P A1c Alc S Al+1 Al+ 2 Ak+1 = P A A Al+ 2 Ak+1

c 1 c l
( (
) ) )
A1c Alc Al+1 Al+ 2 Ak+1 = P A A Al+ 2 Ak+1

c 1
P A A Al+1 Al+ 2 Ak+1

c 1 c l
= P A1c P Alc P Al+ 2 P Ak+1

c 1 c l l +1 l+ 2
(by the induction hypothesis) = P( A ) P( A )P( A ) P( A )[1 P( A )] = P( A ) P( A ) P( A ) P( A ) P( A ) = P( A ) P( A )P( A )P( A ) P( A ),

c 1 c 1 c l c l l+ 2 l+ 2 k+1 k+1 l +1 c l +1 c 1 c l c l +1 l+ 2 k+1
( ) ( )( ) ( ) P( A ) P( A ) P( A ) P( A ) P( A )
k+1
c l
as was to be seen. It is also, clearly, true that the same result holds if the Ais k which are Ac i are chosen in any one of the ( ) possible ways of choosing out of k. Thus, we have shown that
P A1 Ak P Ak+1 . Ak+1 = P A1 P Ak
( )
( ) ( ( )
Finally, under the assumption that

P A1 Ak , = P A1 P Ak
( )
take Ak +1 = A , and show that

c k+1
c c P A1 Ak Ak P Ak P Ak +1 = P A 1 +1 .
) ( )
( ) (
32
In fact,
c P A1 Ak Ak S Ak+1 Ak +1 = P A 1
( ) = P( A A ) P( A A A ) = P( A) P( A ) P( A) P( A )P( A ) (by the induction hypothesis and what was last proved) = P( A) P( A )[1 P( A )] = P( A) P( A )P( A ).
= P A1 Ak A1 Ak Ak+1
1 1 k 1 k k+1 k 1 k k+1 1 1 k k k+1 c k+1
) [(
))]
This completes the proof of the theorem. Now, for j = 1, 2, let Ej be an experiment having the sample space Sj. One may look at the pair (E1, E2) of experiments, and then the question arises as to what is the appropriate sample space for this composite or compound experiment, also denoted by E1 E2. If S stands for this sample space, then, clearly, S = S1 S2 = {(s1, s2); s1 S1, s2 S2}. The corresponding events are, of course, subsets of S. The notion of independence also carries over to experiments. Thus, we say that the experiments E1 and E2 are independent if P(B1 B2) = P(B1)P(B2) for all events B1 associated with E1 alone, and all events B2 associated E2 alone. What actually happens in practice is to start out with two experiments E1, E2 which are intuitively independent, such as the descriptive experiments (also mentioned above) of successively drawing balls with replacement from the same urn with always the same content, or drawing cards with replacement from the same deck of playing cards, or repeatedly tossing the same or different coins etc., and have the corresponding probability spaces (S1, class of events, P1) and (S2, class of events, P2), and then dene the probability function P, in terms of P1 and P2, on the class of events in the space S1 S2 so that it reects the intuitive independence. The above denitions generalize in a straightforward manner to any nite number of experiments. Thus, if Ej, j = 1, 2, . . . , n, are n experiments with corresponding sample spaces Sj and probability functions Pj on the respective classes of events, then the compound experiment
(E , E , , E ) = E
1 2 n
E2 En
has sample space S, where
S = S1 S n =
{(s , , s ); s S , j = 1, 2, , n}.
1 n j j
The class of events are subsets of S, and the experiments are said to be independent if for all events Bj associated with experiment Ej alone, j = 1, 2, . . . , n, it holds
2.4
Combinatorial Exercises Results
33
P B1 Bn = P B1 P Bn .
( )
( )
Again, the probability function P is dened, in terms of Pj, j = 1, 2, . . . , n, on the class of events in S so that to reect the intuitive independence of the experiments Ej, j = 1, 2, . . . , n. In closing this section, we mention that events and experiments which are not independent are said to be dependent.
Exercises
2.3.1 If A and B are disjoint events, then show that A and B are independent if and only if at least one of P(A), P(B) is zero. 2.3.2 Show that if the event A is independent of itself, then P(A) = 0 or 1. 2.3.3 If A, B are independent, A, C are independent and B C = , then A, B + C are independent. Show, by means of a counterexample, that the conclusion need not be true if B C . 2.3.4 For each j = 1, . . . , n, suppose that the events A1, . . . , Am, Bj are independent and that Bi Bj = , i j. Then show that the events A1, . . . , Am, n j = 1Bj are independent. 2.3.5 If Aj, j = 1, . . . , n are independent events, show that
n n P U A j = 1 P Ac j . j =1 j =1
( )
2.3.6 Jim takes the written and road drivers license tests repeatedly until he passes them. Given that the probability that he passes the written test is 0.9 and the road test is 0.6 and that tests are independent of each other, what is the probability that he will pass both tests on his nth attempt? (Assume that the road test cannot be taken unless he passes the written test, and that once he passes the written test he does not have to take it again, no matter whether he passes or fails his next road test. Also, the written and the road tests are considered distinct attempts.) 2.3.7 The probability that a missile red against a target is not intercepted by 2 an antimissile missile is 3 . Given that the missile has not been intercepted, the probability of a successful hit is 3 . If four missiles are red independently, 4 what is the probability that: i) All will successfully hit the target? ii) At least one will do so? How many missiles should be red, so that:
34
iii) At least one is not intercepted with probability 0.95? iv) At least one successfully hits its target with probability 0.99? 2.3.8 Two fair dice are rolled repeatedly and independently. The rst time a total of 10 appears, player A wins, while the rst time that a total of 6 appears, player B wins, and the game is terminated. Compute the probabilities that: i) ii) iii) iv) v) The game terminates on the nth throw and player A wins; The same for player B; Player A wins; Player B wins; Does the game terminate ever?
2.3.9 Electric current is transmitted from point A to point B provided at least one of the circuits #1 through #n below is closed. If the circuits close independently of each other and with respective probabilities pi, i = 1, . . . , n, determine the probability that: i) ii) iii) iv) v) Exactly one circuit is closed; At least one circuit is closed; Exactly m circuits are closed for 0 m n; At least m circuits are closed with m as in part (iii); What do parts (i)(iv) become for p1 = = pn = p, say?
1
2 A n B
2.4 Combinatorial Results

In this section, we will restrict ourselves to nite sample spaces and uniform probability functions. Some combinatorial results will be needed and we proceed to derive them here. Also examples illustrating the theorems of previous sections will be presented.
2.4
Combinatorial Results
35
The following theorem, known as the Fundamental Principle of Counting, forms the backbone of the results in this section.
THEOREM 7
Let a task T be completed by carrying out all of the subtasks Tj, j = 1, 2, . . . , k, and let it be possible to perform the subtask Tj in nj (different) ways, j = 1, 2, . . . , k. Then the total number of ways the task T may be performed is given by k j =1 n j. The assertion is true for k = 2, since by combining each one of the n1 ways of performing subtask T1 with each one of the n2 ways of performing subtask T2, we obtain n1n2 as the total number of ways of performing task T. Next, assume the result to be true for k = m and establish it for k = m + 1. The reasoning is the same as in the step just completed, since by combining each one of the m ways of performing the rst m subtasks with each one of j =1 n j m+1 nm+1 ways of performing substask Tm+1, we obtain m j = 1 n j nm+1 = j = 1 n j for the total number of ways of completing task T.
PROOF
The following examples serve as an illustration to Theorem 7.

EXAMPLE 3
i) A man has ve suits, three pairs of shoes and two hats. Then the number of different ways he can attire himself is 5 3 2 = 30. ii) Consider the set S = {1, . . . , N} and suppose that we are interested in nding the number of its subsets. In forming a subset, we consider for each element whether to include it or not. Then the required number is equal to the following product of N factors 2 2 = 2N. iii) Let nj = n(Sj) be the number of points of the sample space Sj, j = 1, 2, . . . , k. Then the sample space S = S1 Sk has n(S) = n1 nk sample points. Or, if nj is the number of outcomes of the experiment Ej, j = 1, 2, . . . , k, then the number of outcomes of the compound experiment E1 . . . Ek is n1 . . . nk. In the following, we shall consider the problems of selecting balls from an urn and also placing balls into cells which serve as general models of many interesting real life problems. The main results will be formulated as theorems and their proofs will be applications of the Fundamental Principle of Counting. Consider an urn which contains n numbered (distinct, but otherwise identical) balls. If k balls are drawn from the urn, we say that a sample of size k was drawn. The sample is ordered if the order in which the balls are drawn is taken into consideration and unordered otherwise. Then we have the following result.
THEOREM 8
i) The number of ordered samples of size k is n(n 1) (n k + 1) = Pn,k (permutations of k objects out of n, and in particular, if k = n, Pn,n = 1 2 n = n!), provided the sampling is done without replacement; and is equal to nk if the sampling is done with replacement. ii) The number of unordered samples of size k is
36
n Pn ,k n! = C n ,k = = k! k k! n k !
if the sampling is done without replacement; and is equal to
n + k 1 N n, k = k
if the sampling is done with replacement. [See also Theorem 9(iii).]

PROOF
i) The rst part follows from Theorem 7 by taking nj = (n j + 1), j = 1, . . . , k, and the second part follows from the same theorem by taking nj = n, j = 1, . . . , k. ii) For the rst part, we have that, if order counts, this number is Pn,k. Since for every sample of size k one can form k! ordered samples of the same size, if x is the required number, then Pn,k = xk!. Hence the desired result. The proof of the second part may be carried out by an appropriate induction method. However, we choose to present the following short alternative proof which is due to S. W. Golomb and appeared in the American Mathematical Monthly, 75, 1968, p. 530. For clarity, consider the n balls to be cards numbered from 1 to n and adjoin k 1 extra cards numbered from n + 1 to n + k 1 and bearing the respective instructions: repeat lowest numbered card, repeat 2nd lowest numbered card, . . . , repeat (k 1)st lowest numbered card. Then a sample of size k without replacement from this enlarged (n + k 1)-card deck corresponds uniquely to a sample of size k from the original deck with replacement. (That is, take k out of n + k 1, without replacement so that there will be at least one out of 1, 2, . . . , n, and then apply the instructions.) Thus, by the rst part, the required number is
n + k 1 = N n, k , k
as was to be seen. For the sake of illustration of Theorem 8, let us consider the following examples.
EXAMPLE 4
i(i) Form all possible three digit numbers by using the numbers 1, 2, 3, 4, 5. (ii) Find the number of all subsets of the set S = {1, . . . , N}. In part (i), clearly, the order in which the numbers are selected is relevant. Then the required number is P5,3 = 5 4 3 = 60 without repetitions, and 53 = 125 with repetitions. In part (ii) the order is, clearly, irrelevant and the required number is (N 0) N N + ( 1) + + (N ) = 2N, as already found in Example 3.
2.4
37
EXAMPLE 5
An urn contains 8 balls numbered 1 to 8. Four balls are drawn. What is the probability that the smallest number is 3? Assuming the uniform probability function, the required probabilities are as follows for the respective four possible sampling cases:
5 3 1 = 0.14; 8 7 4 6 + 3 1 3 28 = 0.17; 8 + 4 1 165 4
Order does not count/replacements not allowed:
Order does not count/replacements allowed:
Order counts/replacements not allowed:
(5 4 3)4 = 1 0.14;
8765 7
4 3 4 2 4 4 1 5 + 2 5 + 3 5 + 4 671 Order counts/replacements allowed: = 0.16. 84 4, 096
EXAMPLE 6
What is the probability that a poker hand will have exactly one pair? A poker hand is a 5-subset of the set of 52 cards in a full deck, so there are
52 = N = 2, 598, 960 5
different poker hands. We thus let S be a set with N elements and assign the uniform probability measure to S. A poker hand with one pair has two cards of the same face value and three cards whose faces are all different among themselves and from that of the pair. We arrive at a unique poker hand with one pair by completing the following tasks in order: a) Choose the face value of the pair from the 13 available face values. This can be done in (13 1 ) = 13 ways. b) Choose two cards with the face value selected in (a). This can be done in (4 2) = 6 ways. c) Choose the three face values for the other three cards in the hand. Since there are 12 face values to choose from, this can be done in (12 3 ) = 220 ways. d) Choose one card (from the four at hand) of each face value chosen in (c). This can be done in 4 4 4 = 43 = 64 ways.
38
Then, by Theorem 6, there are 13 6 220 64 = 1,098,240 poker hands with one pair. Hence, by assuming the uniform probability measure, the required probability is equal to
1, 098, 240 0.42. 2, 598, 960

THEOREM 9
i) The number of ways in which n distinct balls can be distributed into k distinct cells is kn. ii) The number of ways that n distinct balls can be distributed into k distinct cells so that the jth cell contains nj balls (nj 0, j = 1, . . . , k, k j=1 nj = n) is n n! = . n1! n2 ! nk ! n1 , n2 , , nk iii) The number of ways that n indistinguishable balls can be distributed into k distinct cells is
k + n 1 . n
Furthermore, if n k and no cell is to be empty, this number becomes
n 1 . k 1
PROOF
i) Obvious, since there are k places to put each of the n balls. ii) This problem is equivalent to partitioning the n balls into k groups, where the jth group contains exactly nj balls with nj as above. This can be done in the following number of ways:
n n n1 n n1 nk1 n! = n !n ! n !. nk n1 n2 1 2 k
iii) We represent the k cells by the k spaces between k + 1 vertical bars and the n balls by n stars. By xing the two extreme bars, we are left with k + n 1 bars and stars which we may consider as k + n 1 spaces to be lled in by a bar or a star. Then the problem is that of selecting n spaces for the n n1 ways. As for the second part, we now stars which can be done in k+n have the condition that there should not be two adjacent bars. The n stars create n 1 spaces and by selecting k 1 of them in n1 ways to place the k1 k 1 bars, the result follows.
( )
( )
2.4
39
REMARK 5
i) The numbers nj, j = 1, . . . , k in the second part of the theorem are called occupancy numbers. ii) The answer to (ii) is also the answer to the following different question: Consider n numbered balls such that nj are identical among themselves and distinct from all others, nj 0, j = 1, . . . , k, k j=1 nj = n. Then the number of different permutations is n . n1 , n2 , , nk Now consider the following examples for the purpose of illustrating the theorem.
EXAMPLE 7
Find the probability that, in dealing a bridge hand, each player receives one ace. The number of possible bridge hands is 52 52! N = . = 4 13, 13, 13, 13 13!
( )
Our sample space S is a set with N elements and assign the uniform probability measure. Next, the number of sample points for which each player, North, South, East and West, has one ace can be found as follows: a) Deal the four aces, one to each player. This can be done in
4 4! = 1! 1! 1! 1! = 4! ways. 1, 1, 1, 1
b) Deal the remaining 48 cards, 12 to each player. This can be done in 48 48! ways. = 4 12, 12, 12, 12 12!
( )
Thus the required number is 4!48!/(12!)4 and the desired probability is 4!48!(13!)4/[(12!)4(52!)]. Furthermore, it can be seen that this probability lies between 0.10 and 0.11.
EXAMPLE 8
The eleven letters of the word MISSISSIPPI are scrambled and then arranged in some order. i) What is the probability that the four Is are consecutive letters in the resulting arrangement? There are eight possible positions for the rst I and the remaining seven letters can be arranged in 7 distinct ways. Thus the required 1, 4 , 2 probability is
( )
40
7 8 1, 4, 2 4 = 0.02. 11 165 1, 4, 4, 2
ii) What is the conditional probability that the four Is are consecutive (event A), given B, where B is the event that the arrangement starts with M and ends with S? Since there are only six positions for the rst I, we clearly have
P AB =
( )
5 6 2 9 4, 3, 2
1 0.05. 21
iii) What is the conditional probability of A, as dened above, given C, where C is the event that the arrangement ends with four consecutive Ss? Since there are only four positions for the rst I, it is clear that
P AC =
( )
3 4 2 7 1, 2, 4
4 0.11. 35
Exercises
2.4.1 A combination lock can be unlocked by switching it to the left and stopping at digit a, then switching it to the right and stopping at digit b and, nally, switching it to the left and stopping at digit c. If the distinct digits a, b and c are chosen from among the numbers 0, 1, . . . , 9, what is the number of possible combinations? 2.4.2 How many distinct groups of n symbols in a row can be formed, if each symbol is either a dot or a dash? 2.4.3 How many different three-digit numbers can be formed by using the numbers 0, 1, . . . , 9? 2.4.4 Telephone numbers consist of seven digits, three of which are grouped together, and the remaining four are also grouped together. How many numbers can be formed if: i) No restrictions are imposed? ii) If the rst three numbers are required to be 752?
2.4
Combinatorial Results Exercises
41
2.4.5 A certain state uses ve symbols for automobile license plates such that the rst two are letters and the last three numbers. How many license plates can be made, if: i) All letters and numbers may be used? ii) No two letters may be the same? 2.4.6 Suppose that the letters C, E, F, F, I and O are written on six chips and placed into an urn. Then the six chips are mixed and drawn one by one without replacement. What is the probability that the word OFFICE is formed? 2.4.7 The 24 volumes of the Encyclopaedia Britannica are arranged on a shelf. What is the probability that: i) All 24 volumes appear in ascending order? ii) All 24 volumes appear in ascending order, given that volumes 14 and 15 appeared in ascending order and that volumes 113 precede volume 14? 2.4.8 If n countries exchange ambassadors, how many ambassadors are involved? 2.4.9 From among n eligible draftees, m men are to be drafted so that all possible combinations are equally likely to be chosen. What is the probability that a specied man is not drafted? 2.4.10 Show that
n + 1 m + 1 n+1 = . m+1 n m
2.4.11 Consider ve line segments of length 1, 3, 5, 7 and 9 and choose three of them at random. What is the probability that a triangle can be formed by using these three chosen line segments? 2.4.12 From 10 positive and 6 negative numbers, 3 numbers are chosen at random and without repetitions. What is the probability that their product is a negative number? 2.4.13 In how many ways can a committee of 2n + 1 people be seated along one side of a table, if the chairman must sit in the middle? 2.4.14 Each of the 2n members of a committee ips a fair coin in deciding whether or not to attend a meeting of the committee; a committee member attends the meeting if an H appears. What is the probability that a majority will show up in the meeting? 2.4.15 If the probability that a coin falls H is p (0 < p < 1), what is the probability that two people obtain the same number of Hs, if each one of them tosses the coin independently n times?
42
2.4.16 i) Six fair dice are tossed once. What is the probability that all six faces appear? ii) Seven fair dice are tossed once. What is the probability that every face appears at least once? 2.4.17 A shipment of 2,000 light bulbs contains 200 defective items and 1,800 good items. Five hundred bulbs are chosen at random, are tested and the entire shipment is rejected if more than 25 bulbs from among those tested are found to be defective. What is the probability that the shipment will be accepted? 2.4.18 Show that
M M 1 M 1 = + , m m m 1
where N, m are positive integers and m < M. 2.4.19 Show that
= x r x
x =0
m n
m + n , r
where
k = 0 if x
2.4.20 Show that
x > k.
i)
n n =2 ; j j=0
n
ii )
(1) = 0. j
j j=0
2.4.21 A student is given a test consisting of 30 questions. For each question there are supplied 5 different answers (of which only one is correct). The student is required to answer correctly at least 25 questions in order to pass the test. If he knows the right answers to the rst 20 questions and chooses an answer to the remaining questions at random and independently of each other, what is the probability that he will pass the test? 2.4.22 A student committee of 12 people is to be formed from among 100 freshmen (60 male + 40 female), 80 sophomores (50 male + 30 female), 70 juniors (46 male + 24 female), and 40 seniors (28 male + 12 female). Find the total number of different committees which can be formed under each one of the following requirements: i) No restrictions are imposed on the formation of the committee; ii) Seven students are male and ve female;
2.4
Combinatorial Results Exercises
43
iii) The committee contains the same number of students from each class; iv) The committee contains two male students and one female student from each class; v) The committee chairman is required to be a senior; vi) The committee chairman is required to be both a senior and male; vii) The chairman, the secretary and the treasurer of the committee are all required to belong to different classes. 2.4.23 Refer to Exercise 2.4.22 and suppose that the committee is formed by choosing its members at random. Compute the probability that the committee to be chosen satises each one of the requirements (i)(vii). 2.4.24 A fair die is rolled independently until all faces appear at least once. What is the probability that this happens on the 20th throw? 2.4.25 Twenty letters addressed to 20 different addresses are placed at random into the 20 envelopes. What is the probability that: i) All 20 letters go into the right envelopes? ii) Exactly 19 letters go into the right envelopes? iii) Exactly 17 letters go into the right envelopes? 2.4.26 Suppose that each one of the 365 days of a year is equally likely to be the birthday of each one of a given group of 73 people. What is the probability that: i) Forty people have the same birthdays and the other 33 also have the same birthday (which is different from that of the previous group)? ii) If a year is divided into ve 73-day specied intervals, what is the probability that the birthday of: 17 people falls into the rst such interval, 23 into the second, 15 into the third, 10 into the fourth and 8 into the fth interval? 2.4.27 Suppose that each one of n sticks is broken into one long and one short part. Two parts are chosen at random. What is the probability that: i) One part is long and one is short? ii) Both parts are either long or short? The 2n parts are arranged at random into n pairs from which new sticks are formed. Find the probability that: iii) The parts are joined in the original order; iv) All long parts are paired with short parts. 2.4.28 Derive the third part of Theorem 9 from Theorem 8(ii).
2.4.29 Three cards are drawn at random and with replacement from a standard deck of 52 playing cards. Compute the probabilities P(Aj), j = 1, . . . , 5, where the events Aj, j = 1, . . . , 5 are dened as follows:
44
A1 = s S ; all 3 cards in s are black , A2 A3 A4
{ } = {s S ; at least 2 cards in s are red}, = {s S ; exactly 1 card in s is an ace}, = {s S ; the rst card in s is a diamond, {
the second is a heart and the third is a club ,
A5 = s S ; 1 card in s is a diamond, 1 is a heart and 1 is a club . 2.4.30 Refer to Exercise 2.4.29 and compute the probabilities P(Aj), j = 1, . . . , 5 when the cards are drawn at random but without replacement. 2.4.31 Consider hands of 5 cards from a standard deck of 52 playing cards. Find the number of all 5-card hands which satisfy one of the following requirements: i) ii) iii) iv) v) Exactly three cards are of one color; Three cards are of three suits and the other two of the remaining suit; At least two of the cards are aces; Two cards are aces, one is a king, one is a queen and one is a jack; All ve cards are of the same suit.
2.4.32 An urn contains nR red balls, nB black balls and nW white balls. r balls are chosen at random and with replacement. Find the probability that: i) ii) iii) iv) All r balls are red; At least one ball is red; r1 balls are red, r2 balls are black and r3 balls are white (r1 + r2 + r3 = r); There are balls of all three colors.
2.4.33 Refer to Exercise 2.4.32 and discuss the questions (i)(iii) for r = 3 and r1 = r2 = r3 (= 1), if the balls are drawn at random but without replacement. 2.4.34 Suppose that all 13-card hands are equally likely when a standard deck of 52 playing cards is dealt to 4 people. Compute the probabilities P(Aj), j = 1, . . . , 8, where the events Aj, j = 1, . . . , 8 are dened as follows: A1 = s S ; s consists of 1 color cards , A2 A3 A4 A5 A6
{ } = {s S ; s consists only of diamonds}, = {s S ; s consists of 5 diamonds, 3 hearts, 2 clubs and 3 spades}, = {s S ; s consists of cards of exactly 2 suits}, = {s S ; s contains at least 2 aces}, = {s S ; s does not contain aces, tens and jacks},
2.5 Product 2.4 Combinatorial Probability Results Spaces
45
A7 = s S ; s consists of 3 aces, 2 kings and exactly 7 red cards , A8
{ } = {s S ; s consists of cards of all different denominations}.

A j = s S ; s contains exactly j tens ,
2.4.35 Refer to Exercise 2.4.34 and for j = 0, 1, . . . , 4, dene the events Aj and also A as follows:
{ } A = {s S ; s contains exactly 7 red cards}.
For j = 0, 1, . . . , 4, compute the probabilities P(Aj), P(Aj|A) and also P(A); compare the numbers P(Aj), P(Aj|A). 2.4.36 Let S be the set of all n3 3-letter words of a language and let P be the equally likely probability function on the events of S. Dene the events A, B and C as follows: A = s S ; s begins with a specic letter , B = s S ; s has the specied letter mentioned in the denition of A in the middle entry , C = s S ; s has exactly two of its letters the same . Then show that: i) ii) iii) iv) P(A B) = P(A)P(B); P(A C) = P(A)P(C); P(B C) = P(B)P(C); P(A B C) P(A)P(B)P(C).
Thus the events A, B, C are pairwise independent but not mutually independent.
2.5* Product Probability Spaces

The concepts discussed in Section 2.3 can be stated precisely by utilizing more technical language. Thus, if we consider the experiments E1 and E2 with respective probability spaces (S1, A1, P1) and (S2, A2, P2), then the compound experiment (E1, E2) = E1 E2 has sample space S = S1 S2 as dened earlier. The appropriate -eld A of events in S is dened as follows: First dene the class C by: C = A1 A2 ; A1 A1 , A2 A2 , where A1 A2 =
{(s , s ); s A , s
1 2 1 1
A2 .
46
Then A is taken to be the -eld generated by C (see Theorem 4 in Chapter 1). Next, dene on C the set function P by P(A1 A2) = P1(A1)P2(A2). It can be shown that P determines uniquely a probability measure on A (by means of the so-called Carathodory extension theorem). This probability measure is usually denoted by P1 P2 and is called the product probability measure (with factors P1 and P2), and the probability space (S, A, P) is called the product probability space (with factors (Sj, Aj, Pj), j = 1, 2). It is to be noted that events which refer to E1 alone are of the form B1 = A1 S2, A1 A1, and those referring to E2 alone are of the form B2 = S1 A2, A2 A2. The experiments E1 and E2 are then said to be independent if P(B1 B2) = P(B1)P(B2) for all events B1 and B2 as dened above. For n experiments Ej, j = 1, 2, . . . , n with corresponding probability spaces (Sj, Aj, Pj), the compound experiment (E1, . . . , En) = E1 En has probability space (S, A, P), where
S = S1 S n =
{(s , , s ); s S , j = 1, 2, , n},
1 n j j
A is the -eld generated by the class C, where
C = A1 An ; A j A j , j = 1, 2, , n ,
and P is the unique probability measure dened on A through the relationships
P A1 An = P A1 P An , A j A j , j = 1, 2, , n.
The probability measure P is usually denoted by P1 Pn and is called the product probability measure (with factors Pj, j = 1, 2, . . . , n), and the probability space (S, A, P) is called the product probability space (with factors (Sj, Aj, Pj), j = 1, 2, . . . , n). Then the experiments Ej, j = 1, 2, . . . , n are said to be independent if P(B1 B2) = P(B1) P(B2), where Bj is dened by
( )
( )
B j = S1 S j 1 A j S j + 1 S n , j = 1, 2, , n.
The denition of independent events carries over to -elds as follows. Let A1, A2 be two sub--elds of A. We say that A1, A2 are independent if P(A1 A2) = P(A1)P(A2) for any A1 A1, A2 A2. More generally, the -elds Aj, j = 1, 2, . . . , n (sub--elds of A) are said to be independent if
n n P I A j = P A j j =1 j =1
( )
for any
A j A j , j = 1, 2, , n.
Of course, -elds which are not independent are said to be dependent. At this point, notice that the factor -elds Aj, j = 1, 2, . . . , n may be considered as sub--elds of the product -eld A by identifying Aj with Bj, where the Bjs are dened above. Then independence of the experiments Ej, j = 1, 2, . . . , n amounts to independence of the corresponding -elds Aj, j = 1, 2, . . . , n (looked upon as sub--elds of the product -eld A).
2.6* The 2.4Probability Combinatorial of Matchings Results
47
Exercises
2.5.1 Form the Cartesian products A B, A C, B C, A B C, where A = {stop, go}, B = {good, defective), C = {(1, 1), (1, 2), (2, 2)}. 2.5.2 Show that A B = if and only if at least one of the sets A, B is . 2.5.3 If A B, show that A C B C for any set C. 2.5.4 Show that i) (A B)c = (A Bc) + (Ac B) + (Ac Bc); ii) (A B) (C D) = (A C) (B D); iii) (A B) (C D) = (A C) (B D) [(A Cc) (Bc D) + (Ac C) (B Dc )].
2.6* The Probability of Matchings

In this section, an important result, Theorem 10, is established providing an expression for the probability of occurrence of exactly m events out of possible M events. The theorem is then illustrated by means of two interesting examples. For this purpose, some additional notation is needed which we proceed to introduce. Consider M events Aj, j = 1, 2, . . . , M and set
S0 = 1, S1 = P A j ,
j =1 M
( )
S2 = M Sr = M
1 j1 < j2 M
P A j1 A j2 ,
1 j1 < j2 < < jr M
P A j1 A j2 A jr ,
S M = P A1 A2 AM .
Let also
Bm = exactly C m = at least m of the events A j , j = 1, 2, , M occur. Dm = at most

Then we have
48
THEOREM 10
With the notation introduced above
m + 1 m + 2 P Bm = S m S m+1 + S m+ 2 + 1 m m
( )
( )
M m
M SM m
(2)
which for m = 0 is
P B0 = S0 S1 + S 2 + 1
and
( )
( )
SM ,
(3)
P C m = P Bm + P Bm+1 + + P BM ,
( )
( ) (
( )
(4)
and
P Dm = P B0 + P B1 + + P Bm .
( )
( ) ( )
( )
(5)
For the proof of this theorem, all that one has to establish is (2), since (4) and (5) follow from it. This will be done in Section 5.6 of Chapter 5. For a proof where S is discrete the reader is referred to the book An Introduction to Probability Theory and Its Applications, Vol. I, 3rd ed., 1968, by W. Feller, pp. 99100. The following examples illustrate the above theorem.
EXAMPLE 9
The matching problem (case of sampling without replacement). Suppose that we have M urns, numbered 1 to M. Let M balls numbered 1 to M be inserted randomly in the urns, with one ball in each urn. If a ball is placed into the urn bearing the same number as the ball, a match is said to have occurred. i) Show the probability of at least one match is
1 1 1 + + 1 2! 3!
( )
M +1
1 1 e 1 0.63 M!
for large M, and ii) exactly m matches will occur, for m = 0, 1, 2, . . . , M is
1 1 1 1 1 + + + 1 m! 2! 3! =
DISCUSSION
( )
M m
1 M m !
1 M m 1 m! k = 0
( )
1 1 1 e k! m!
for
M m large.
To describe the distribution of the balls among the urns, write an M-tuple (z1, z2, . . . , zM) whose jth component represents the number of the ball inserted in the jth urn. For k = 1, 2, . . . , M, the event Ak that a match will occur in the kth urn may be written Ak = {(z1, . . . , zM) M; zj integer, 1 zj
2.6* The of Matchings 2.4Probability Combinatorial Results
49
M, j = 1, . . . , M, zk = k}. It is clear that for any integer r = 1, 2, . . . , M and any r unequal integers k1, k2, . . . , kr,, from 1 to M,
P Ak1 Ak2 Akr =

It then follows that Sr is given by
M r ! ) ( M! ) .
M M r ! 1 Sr = = . r! r M! This implies the desired results.

EXAMPLE 10
Coupon collecting (case of sampling with replacement). Suppose that a manufacturer gives away in packages of his product certain items (which we take to be coupons), each bearing one of the integers 1 to M, in such a way that each of the M items is equally likely to be found in any package purchased. If n packages are bought, show that the probability that exactly m of the integers, 1 to M, will not be obtained is equal to
k M m M M m m + k 1 M . 1 k m k = 0
( )
Many variations and applications of the above problem are described in the literature, one of which is the following. If n distinguishable balls are distributed among M urns, numbered 1 to M, what is the probability that there will be exactly m urns in which no ball was placed (that is, exactly m urns remain empty after the n balls have been distributed)?
DISCUSSION
To describe the coupons found in the n packages purchased, we write an n-tuple (z1, z2, , zn), whose jth component zj represents the number of the coupon found in the jth package purchased. We now dene the events A1, A2, . . . , AM. For k = 1, 2, . . . , M, Ak is the event that the number k will not appear in the sample, that is,
Ak = z1 , , zn n ; z j integer, 1 z j M , z j k, j = 1, 2, , It is easy to see that we have the following results:
n.
M 1 1 P Ak = = 1 , M M
( )
2
k = 1, 2, , M , k1 = 1, 2, , n k2 = k1 + 1, , n
P Ak Ak
1
M 2 2 = = 1 , M M
and, in general,
50
r P Ak Ak Ak = 1 , M
k1 = 1, 2, , n k2 = k1 + 1, , n M kr = kr 1 + 1, , n.
Thus the quantities Sr are given by

M r S r = 1 , r = 0, 1, , M . M r
n
(6)
Let Bm be the event that exactly m of the integers 1 to M will not be found in the sample. Clearly, Bm is the event that exactly m of the events A1, . . . , AM will occur. By relations (2) and (6), we have
P Bm =
( ) ( )
1
r =m
r m
r M r 1 M m r
k M m M M m m + k = 1 1 M , m k=0 k
( )
(7)
by setting r m = k and using the identity

m + k M M M m = . m m + k m k
(8)
This is the desired result. This section is concluded with the following important result stated as a theorem.
THEOREM 11
Let A and B be two disjoint events. Then in a series of independent trials, show that:
P A occurs before B occurs =

PROOF
P A
P A +P B
( ) ( )
( )
For i = 1, 2, . . . , dene the events Ai and Bi as follows:
Ai = A occurs on the ith trial, Bi = B occurs on the ith trial.

Then, clearly, required the event is the sum of the events
c c A1 , A1c B1c A2 , A1c B1c A2 B2 A3 , , c c A1c B1c An Bn An+1 ,
and therefore
2.6* The 2.4Probability Combinatorial of Matchings Results
51
P A occurs before B occurs
c c B2 A3 = P A1 + A1c B1c A2 + A1c B1c A2 c c + + A1c B1c An Bn An+1 +
[ (
(
) (
c c = P A1 + P A1c B1c A2 + P A1c B1c A2 B2 A3 c c + + P A1c B1c An Bn An+1 + c 1 c 1 c 1 c 1 c 2
) = P( A ) + P( A B ) P( A ) + P( A B ) P( A B ) P( A ) + + P( A B ) P( A B )P( A ) + (by Theorem 6) = P( A) + P( A B )P( A) + P ( A B )P( A) + + P ( A B )P( A) = P( A)[1 + P( A B ) + P ( A B ) + + P ( A B ) + ]

1 2 c 2 3 c 1 c 1 c n c n n+1 c c 2 c c n c c
c c 2 c c n c c
( ) (
) (
=P A
1 ( )1P A B
But
c P Ac Bc = P A B = 1 P A B = 1 P A+ B = 1 P A P B ,
( ) ( ) ( )
so that
1 P Ac Bc = P A + P B .
Therefore
) ( ) ()
)
P A occurs before B occurs =

as asserted.
P A
P A +P B
( ) ( )
( )
It is possible to interpret B as a catastrophic event, and A as an event consisting of taking certain precautionary and protective actions upon the energizing of a signaling device. Then the signicance of the above probability becomes apparent. As a concrete illustration, consider the following simple example (see also Exercise 2.6.3).
52
EXAMPLE 11
In repeated (independent) draws with replacement from a standard deck of 52 playing cards, calculate the probability that an ace occurs before a picture.
Let A = an ace occurs, B = a picture occurs.
4 13
Then P(A) = 1 4 = 13 = 1 . 13 4
4 52
1 13
and P(B) =
12 52
, so that P(A occurs before B occurs)
Exercises
2.6.1 Show that
m + k M M M m = , m m + k m k
as asserted in relation (8). 2.6.2 Verify the transition in (7) and that the resulting expression is indeed the desired result. 2.6.3 Consider the following game of chance. Two fair dice are rolled repeatedly and independently. If the sum of the outcomes is either 7 or 11, the player wins immediately, while if the sum is either 2 or 3 or 12, the player loses immediately. If the sum is either 4 or 5 or 6 or 8 or 9 or 10, the player continues rolling the dice until either the same sum appears before a sum of 7 appears in which case he wins, or until a sum of 7 appears before the original sum appears in which case the player loses. It is assumed that the game terminates the rst time the player wins or loses. What is the probability of winning?
3.1 Soem General Concepts
53
Chapter 3
On Random Variables and Their Distributions
3.1 Some General Concepts

Given a probability space (S, class of events, P), the main objective of probability theory is that of calculating probabilities of events which may be of importance to us. Such calculations are facilitated by a transformation of the sample space S, which may be quite an abstract set, into a subset of the real line with which we are already familiar. This is, actually, achieved by the introduction of the concept of a random variable. A random variable (r.v.) is a function (in the usual sense of the word), which assigns to each sample point s S a real number, the value of the r.v. at s. We require that an r.v. be a wellbehaving function. This is satised by stipulating that r.v.s are measurable functions. For the precise denition of this concept and related results, the interested reader is referred to Section 3.5 below. Most functions as just dened, which occur in practice are, indeed, r.v.s, and we leave the matter to rest here. The notation X(S) will be used for the set of values of the r.v. X, the range of X. Random variables are denoted by the last letters of the alphabet X, Y, Z, etc., with or without subscripts. For a subset B of , we usually denote by (X B) the following event in S: (X B) = {s S; X(s) B} for simplicity. In particular, (X = x) = {s S; X(s) = x}. The probability distribution function (or just the distribution) of an r.v. X is usually denoted by PX and is a probability function dened on subsets of as follows: PX (B) = P(X B). An r.v. X is said to be of the discrete type (or just discrete) if there are countable (that is, nitely many or denumerably innite) many points in , x1, x2, . . . , such that PX({xj}) > 0, j 1, and j PX({xj})(= j P(X = xj)) = 1. Then the function fX dened on the entire by the relationships:
fX x j = PX x j
( )
({ })(= P(X = x ))
j
for x = x j ,
53
54
and fX(x) = 0 otherwise has the properties:

fX x 0
()
for all x, and
f (x ) = 1.
X j j
Furthermore, it is clear that
P X B =
) f (x ).
X j x j B
Thus, instead of striving to calculate the probability of the event {s S; X(s) B}, all we have to do is to sum up the values of fX(xj) for all those xjs which lie in B; this assumes, of course, that the function fX is known. The function fX is called the probability density function (p.d.f.) of X. The distribution of a discrete r.v. will also be referred to as a discrete distribution. In the following section, we will see some discrete r.v.s (distributions) often occurring in practice. They are the Binomial, Poisson, Hypergeometric, Negative Binomial, and the (discrete) Uniform distributions. Next, suppose that X is an r.v. which takes values in a (nite or innite but proper) interval I in with the following qualication: P(X = x) = 0 for every single x in I. Such an r.v. is called an r.v. of the continuous type (or just a continuous r.v.). Also, it often happens for such an r.v. to have a function fX satisfying the properties fX(x) 0 for all x I, and P(X J) = J fX(x)dx for any sub-interval J of I. Such a function is called the probability density function (p.d.f.) of X in analogy with the discrete case. It is to be noted, however, that here fX(x) does not represent the P(X = x)! A continuous r.v. X with a p.d.f. fX is called absolutely continuous to differentiate it from those continuous r.v.s which do not have a p.d.f. In this book, however, we are not going to concern ourselves with non-absolutely continuous r.v.s. Accordingly, the term continuous r.v. will be used instead of absolutely continuous r.v. Thus, the r.v.s to be considered will be either discrete or continuous (= absolutely continuous). Roughly speaking, the idea that P(X = x) = 0 for all x for a continuous r.v. may be interpreted that X takes on too many values for each one of them to occur with positive probability. The fact that P(X = x) also follows formally by x the fact that P(X = x) = x fX(y)dy, and this is 0. Other interpretations are also possible. It is true, nevertheless, that X takes values in as small a neighborhood of x as we please with positive probability. The distribution of a continuous r.v. is also referred to as a continuous distribution. In Section 3.3, we will discuss some continuous r.v.s (distributions) which occur often in practice. They are the Normal, Gamma, Chi-square, Negative Exponential, Uniform, Beta, Cauchy, and Lognormal distributions. Reference will also be made to t and F r.v.s (distributions). Often one is given a function f and is asked whether f is a p.d.f. (of some r.v.). All one has to do is to check whether f is non-negative for all values of its argument, and whether the sum or integral of its values (over the appropriate set) is equal to 1.
3.2
Discrete Random Variables 3.1 Soem (and General Random Concepts Vectors)
55
When (a well-behaving) function X is dened on a sample space S and takes values in the plane or the three-dimensional space or, more generally, in the k-dimensional space k, it is called a k-dimensional random vector (r. vector) and is denoted by X. Thus, an r.v. is a one-dimensional r. vector. The distribution of X, PX, is dened as in the one-dimensional case by simply replacing B with subsets of k. The r. vector X is discrete if P(X = xj) > 0, j = 1, 2, . . . with j P(X = xj) = 1, and the function fX(x) = P(X = xj) for x = xj, and fX(x) = 0 otherwise is the p.d.f. of X. Once again, P(X B) = xjB fX(xj) for B subsets of k. The r. vector X is (absolutely) continuous if P(X = x) = 0 for all x I, but there is a function fX dened on k such that:
fX x 0
()
for all x k , and P X J = fX x dx

J
()
for any sub-rectangle J of I. The function fX is the p.d.f. of X. The distribution of a k-dimensional r. vector is also referred to as a k-dimensional discrete or (absolutely) continuous distribution, respectively, for a discrete or (absolutely) continuous r. vector. In Sections 3.2 and 3.3, we will discuss two representative multidimensional distributions; namely, the Multinomial (discrete) distribution, and the (continuous) Bivariate Normal distribution. We will write f rather than fX when no confusion is possible. Again, when one is presented with a function f and is asked whether f is a p.d.f. (of some r. vector), all one has to check is non-negativity of f, and that the sum of its values or its integral (over the appropriate space) is equal to 1.
3.2 Discrete Random Variables (and Random Vectors)

3.2.1 Binomial
The Binomial distribution is associated with a Binomial experiment; that is, an experiment which results in two possible outcomes, one usually termed as a success, S, and the other called a failure, F. The respective probabilities are p and q. It is to be noted, however, that the experiment does not really have to result in two outcomes only. Once some of the possible outcomes are called a failure, any experiment can be reduced to a Binomial experiment. Here, if X is the r.v. denoting the number of successes in n binomial experiments, then
X S = 0, 1, 2, , n ,
( ) {
n P X = x = f x = p x q n x , x
) ()
where 0 < p < 1, q = 1 p, and x = 0, 1, 2, . . . , n. That this is in fact a p.d.f. follows from the fact that f(x) 0 and
x n x = ( p + q) f (x) = p q x x =0 x =0 n n
= 1n = 1.
56
The appropriate S here is:

S = S, F S, F
(n copies).
In particular, for n = 1, we have the Bernoulli or Point Binomial r.v. The r.v. X may be interpreted as representing the number of Ss (successes) in the compound experiment E E (n copies), where E is the experiment resulting in the sample space {S, F} and the n experiments are independent (or, as we say, the n trials are independent). f(x) is the probability that exactly x Ss occur. In fact, f(x) = P(X = x) = P(of all n sequences of Ss and F s with exactly x Ss). The probability of one such a sequence is pxqnx by the independence of the trials and this also does not depend on the particular n sequence we are considering. Since there are ( x ) such sequences, the result follows. The distribution of X is called the Binomial distribution and the quantities n and p are called the parameters of the Binomial distribution. We denote the Binomial distribution by B(n, p). Often the notation X B(n, p) will be used to denote the fact that the r.v. X is distributed as B(n, p). Graphs of the p.d.f. of the B(n, p) distribution for selected values of n and p are given in Figs. 3.1 and 3.2.
f (x) 0.25 0.20 0.15 0.10 0.05 0 1 2 3 4 5 6 7 8 9 10 11 12 13 x n 12 p
1 4
1 Figure 3.1 Graph of the p.d.f. of the Binomial distribution for n = 12, p = . 4
() f (1) = 0.1267 f (2 ) = 0.2323 f ( 3) = 0.2581 f ( 4 ) = 0.1936 f ( 5) = 0.1032 f (6) = 0.0401

f 0 = 0.0317
() f ( 8 ) = 0.0024 f (9) = 0.0004 f (10 ) = 0.0000 f (11) = 0.0000 f (12 ) = 0.0000
f 7 = 0.0115
3.2
3.1 Soem Concepts Discrete Random Variables (and General Random Vectors)
57
f (x) 0.25
0.20 0.15 0.10 0.05
n 10 p
1 2
1 2 3 4 5 6 7 8 9 10
1 Figure 3.2 Graph of the p.d.f. of the Binomial distribution for n = 10, p = . 2
() f (1) = 0.0097 f (2 ) = 0.0440 f ( 3) = 0.1172 f ( 4 ) = 0.2051 f ( 5) = 0.2460

f 0 = 0.0010
() f ( 7) = 0.1172 f ( 8 ) = 0.0440 f (9) = 0.0097 f (10 ) = 0.0010

f 6 = 0.2051
3.2.2 Poisson
x , x! x = 0, 1, 2, . . . ; > 0. f is, in fact, a p.d.f., since f(x) 0 and
X S = 0, 1, 2, ,
( ) {
P X = x = f x = e
) ()
e = 1.
f ( x ) = e x! = e
x =0 x =0
The distribution of X is called the Poisson distribution and is denoted by P(). is called the parameter of the distribution. Often the notation X P() will be used to denote the fact that the r.v. X is distributed as P(). The Poisson distribution is appropriate for predicting the number of phone calls arriving at a given telephone exchange within a certain period of time, the number of particles emitted by a radioactive source within a certain period of time, etc. The reader who is interested in the applications of the Poisson distribution should see W. Feller, An Introduction to Probability Theory, Vol. I, 3rd ed., 1968, Chapter 6, pages 156164, for further examples. In Theorem 1 in Section 3.4, it is shown that the Poisson distribution
58
may be taken as the limit of Binomial distributions. Roughly speaking, suppose that X B(n, p), xwhere n is large and p is small. Then P X = x = n x ) , x 0 . For the graph of the p.d.f. of the P() ( xn ) px (1 p) e np ( np x! distribution for = 5 see Fig. 3.3. A visualization of such an approximation may be conceived by stipulating that certain events occur in a time interval [0,t] in the following manner: events occurring in nonoverlapping subintervals are independent; the probability that one event occurs in a small interval is approximately proportional to its length; and two or more events occur in such an interval with probability approximately 0. Then dividing [0,t] into a large number n of small intervals of length t/n, we have that the probability that exactly x events occur in [0,t] is x n x t approximately ( n 1 nt ) , where is the factor of proportionality. x )( n ) ( Setting pn = nt , we have npn = t and Theorem 1 in Section 3.4 gives that x x n x . Thus Binomial probabilities are approximated by ( nx )( nt ) (1 nt ) e t (xt ) ! Poisson probabilities.
f (x) 0.20 0.15 0.10 0.05 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 x
Figure 3.3 Graph of the p.d.f. of the Poisson distribution with = 5.
() f (1) = 0.0337 f (2 ) = 0.0843 f ( 3) = 0.1403 f ( 4 ) = 0.1755 f ( 5) = 0.1755 f (6) = 0.1462 f ( 7) = 0.1044 f ( 8 ) = 0.0653
f 0 = 0.0067
() f (10 ) = 0.0181 f (11) = 0.0082 f (12 ) = 0.0035 f (13) = 0.0013 f (14 ) = 0.0005 f (15) = 0.0001
f 9 = 0.0363 f n is negligible for n 16.
()
3.2
Discrete Random Variables 3.1 Soem (and General Random Concepts Vectors)
59
3.2.3 Hypergeometric
X S = 0, 1, 2, , r ,
( ) {
m n x r x f x = , m + n r
()
where ( m x ) = 0, by denition, for x > m. f is a p.d.f., since f(x) 0 and
f ( x ) = m + n = x r x m + n
1 1
x =0
m n
x =0
m + n = 1. r
The distribution of X is called the Hypergeometric distribution and arises in situations like the following. From an urn containing m red balls and n black balls, r balls are drawn at random without replacement. Then X represents the number of red balls among the r balls selected, and f(x) is the probability that this number is exactly x. Here S = {all r-sequences of Rs and Bs}, where R stands for a red ball and B stands for a black ball. The urn/balls model just described is a generic model for situations often occurring in practice. For instance, the urn and the balls may be replaced by a box containing certain items manufactured by a certain process over a specied period of time, out of which m are defective and n meet set specications.
3.2.4 Negative Binomial

X S = 0, 1, 2, ,
( ) {
r + x 1 x f x = pr q , x
()
0 < p < 1, q = 1 p, x = 0, 1, 2, . . . . f is, in fact, a p.d.f. since f(x) 0 and
x =0
f (x) = p
r
r + x 1 x pr q = x x =0 1 q
pr = 1. pr
This follows by the Binomial theorem, according to which 1
(1 x)
n + j 1 j = x , j j=0
x < 1.
The distribution of X is called the Negative Binomial distribution. This distribution occurs in situations which have as a model the following. A Binomial experiment E, with sample space {S, F}, is repeated independently until exactly r Ss appear and then it is terminated. Then the r.v. X represents the number of times beyond r that the experiment is required to be carried out, and f(x) is the probability that this number of times is equal to x. In fact, here S =
60
{all (r + x)-sequences of Ss and F s such that the rth S is at the end of the sequence}, x = 0, 1, . . . and f(x) = P(X = x) = P[all (r + x)-sequences as above for a specied x]. The probability of one such sequence is pr1qxp by the independence assumption, and hence
r + x 1 r 1 x r r + x 1 x f x = q . p q p= p x x
()
The above interpretation also justies the name of the distribution. For r = 1, we get the Geometric (or Pascal) distribution, namely f(x) = pqx, x = 0, 1, 2, . . . .
3.2.5
Discrete Uniform
X S = 0, 1, , n 1 ,
( ) {
f x =
()
1 , n
x = 0, 1, , n 1.
This is the uniform probability measure. (See Fig. 3.4.)

f (x)
1 5
n5
Figure 3.4 Graph of the p.d.f. of a Discrete Uniform distribution.
3.2.6
Here
Multinomial
k X S = x = x1 , , xk ; x j 0, j = 1, 2, , k, x j = n, j =1 k n! x1 x2 xk f x = p1 p2 pk , p j > 0, j = 1, 2, , k, p j = 1. x1! x 2 ! x k ! j =1
()
()
That f is, in fact, a p.d.f. follows from the fact that
f ( x) =
X
x 1 , , xk
n! xk p1x1 pk = p1 + + pk x1! xk !
= 1n = 1,
where the summation extends over all xjs such that xj 0, j = 1, 2, . . . , k, k j=1 xj = n. The distribution of X is also called the Multinomial distribution and n, p1, . . . , pk are called the parameters of the distribution. This distribution occurs in situations like the following. A Multinomial experiment E with k possible outcomes Oj, j = 1, 2, . . . , k, and hence with sample space S = {all n-sequences of Ojs}, is carried out n independent times. The probability of the Ojs occurring is pj, j = 1, 2, . . . k with pj > 0 and k j=1 p j = 1 . Then X is the random vector whose jth component Xj represents the number of times xj the outcome Oj occurs, j = 1, 2, . . . , k. By setting x = (x1, . . . , xk), then f is the
3.1 Soem General Exercises Concepts
61
probability that the outcome Oj occurs exactly xj times. In fact f(x) = P(X = x) = P(all n-sequences which contain exactly xj Ojs, j = 1, 2, . . . , k). The probx1 xk ability of each one of these sequences is p1 by independence, and since pk there are n!/( x1! xk ! ) such sequences, the result follows. The fact that the r. vector X has the Multinomial distribution with parameters n and p1, . . . , pk may be denoted thus: X M(n; p1, . . . , pk).
REMARK 1 When the tables given in the appendices are not directly usable because the underlying parameters are not included there, we often resort to linear interpolation. As an illustration, suppose X B(25, 0.3) and we wish to calculate P(X = 10). The value p = 0.3 is not included in the Binomial 4 5 = 0.25 < 0.3 < 0.3125 = 16 and the Tables in Appendix III. However, 16 4 5 probabilities P(X = 10), for p = 16 and p = 16 are, respectively, 0.9703 and 0.8756. Therefore linear interpolation produces the value:
0.9703 0.9703 0.8756
0.3 0.25 = 0.8945. 0.3125 0.25
Likewise for other discrete distributions. The same principle also applies appropriately to continuous distributions.
REMARK 2 In discrete distributions, we are often faced with calculations of x the form x =1 x . Under appropriate conditions, we may apply the following approach:
x
x =1
= x x 1 =
x =1 x =1
d x d = d d
x=2
x =1
d = d 1 1
Similarly for the expression
x x1
x2
Exercises
3.2.1 A fair coin is tossed independently four times, and let X be the r.v. dened on the usual sample space S for this experiment as follows:
X s = the number of H s in s.
()
iii) What is the set of values of X? iii) What is the distribution of X? iii) What is the partition of S induced by X? 3.2.2 It has been observed that 12.5% of the applicants fail in a certain screening test. If X stands for the number of those out of 25 applicants who fail to pass the test, what is the probability that:
62
iii) X 1? iii) X 20? iii) 5 X 20? 3.2.3 A manufacturing process produces certain articles such that the probability of each article being defective is p. What is the minimum number, n, of articles to be produced, so that at least one of them is defective with probability at least 0.95? Take p = 0.05.
, the Binomial Tables 3.2.4 If the r.v. X is distributed as B(n, p) with p > 1 2 in Appendix III cannot be used directly. In such a case, show that:
ii) P(X = x) = P(Y = n x), where Y B(n, q), x = 0, 1, . . . , n, and q = 1 p; ii) Also, for any integers a, b with 0 a 5. 3.2.6 Refer to Exercise 3.2.5 and suppose that P(X = 1) = P(X = 2). What is the probability that X < 10? If P(X = 1) = 0.1 and P(X = 2) = 0.2, calculate the probability that X = 0. 3.2.7 It has been observed that the number of particles emitted by a radioactive substance which reach a given portion of space during time t follows closely the Poisson distribution with parameter . Calculate the probability that: iii) No particles reach the portion of space under consideration during time t; iii) Exactly 120 particles do so; iii) At least 50 particles do so; iv) Give the numerical values in (i)(iii) if = 100. 3.2.8 The phone calls arriving at a given telephone exchange within one minute follow the Poisson distribution with parameter = 10. What is the probability that in a given minute: iii) No calls arrive? iii) Exactly 10 calls arrive? iii) At least 10 calls arrive? 3.2.9 (Truncation of a Poisson r.v.) Let the r.v. X be distributed as Poisson with parameter and dene the r.v. Y as follows:
Y = X if X k a given positive integer
and Y = 0 otherwise.
Find:
63
ii) P(Y = y), y = k, k + 1, . . . ; ii) P(Y = 0). 3.2.10 A university dormitory system houses 1,600 students, of whom 1,200 are undergraduates and the remaining are graduate students. From the combined list of their names, 25 names are chosen at random. If X stands for the r.v. denoting the number of graduate students among the 25 chosen, what is the probability that X 10? 3.2.11 (Multiple Hypergeometric distribution) For j = 1, . . . , k, consider an urn containing nj balls with the number j written on them. n balls are drawn at random and without replacement, and let Xj be the r.v. denoting the number of balls among the n ones with the number j written on them. Then show that the joint distribution of Xj, j = 1, . . . , k is given by
P X j = x j , j = 1, , k =
) (
nj j =1 x j
n1 + + nk n
( ),
)
0 x j n j , j = 1, , k,
x j = n.
j =1
3.2.12 Refer to the manufacturing process of Exercise 3.2.3 and let Y be the r.v. denoting the minimum number of articles to be manufactured until the rst two defective articles appear. ii) Show that the distribution of Y is given by
P Y = y = p2 y 1 1 p
)(
y2
y = 2, 3, ;
ii) Calculate the probability P(Y 100) for p = 0.05. 3.2.13 3.2.14 Show that the function f(x) = ( 1 )xIA(x), where A = {1, 2, . . .}, is a p.d.f. 2 For what value of c is the function f dened below a p.d.f.?
f x = c x I A x ,
()
()
where
A = 0, 1, 2,
} (0 < < 1).
3.2.15 Suppose that the r.v. X takes on the values 0, 1, . . . with the following probabilities: f j =P X=j = iii) Determine the constant c. Compute the following probabilities: iii) P(X 10); iii) P(X A), where A = { j; j = 2k + 1, k = 0, 1, . . .}; iv) P(X B), where B = { j; j = 3k + 1, k = 0, 1, . . .}.
()
c , 3j
j = 0, 1, ;
64
3.2.16 There are four distinct types of human blood denoted by O, A, B and AB. Suppose that these types occur with the following frequencies: 0.45, 0.40, 0.10, 0.05, respectively. If 20 people are chosen at random, what is the probability that: ii) All 20 people have blood of the same type? ii) Nine people have blood type O, eight of type A, two of type B and one of type AB? 3.2.17 A balanced die is tossed (independently) 21 times and let Xj be the number of times the number j appears, j = 1, . . . , 6. ii) What is the joint p.d.f. of the Xs? ii) Compute the probability that X1 = 6, X2 = 5, X3 = 4, X4 = 3, X5 = 2, X6 = 1. 3.2.18 Suppose that three coins are tossed (independently) n times and dene the r.v.s Xj, j = 0, 1, 2, 3 as follows: X j = the number of times j H s appear. Determine the joint p.d.f. of the Xjs. 3.2.19 Let X be an r.v. distributed as P(), and set E = {0, 2, . . . } and O = {1, 3, . . . }. Then: ii) In terms of , calculate the probabilities: P(X E) and P(X O); ii) Find the numerical values of the probabilities in part (i) for = 5. (Hint: If k k SE = kE k! and SO = kO k! , notice that SE + SO = e, and SE SO = e .) 3.2.20 The following recursive formulas may be used for calculating Binomial, Poisson and Hypergeometric probabilities. To this effect, show that:
p n x iii) If X B(n, p), then f ( x + 1) = q f ( x), x = 0, 1, . . . , n 1; x +1 iii) If X P(), then f ( x + 1) = x +1 f ( x), x = 0, 1, . . . ; iii) If X has the Hypergeometric distribution, then
f x+1 =
3.2.21
(m x)(r x) f x , () (n r + x + 1)(x + 1)
x = 0, 1, , min m, r .
i) Suppose the r.v.s X1, . . . , Xk have the Multinomial distribution, and let j be a xed number from the set {1, . . . , k}. Then show that Xj is distributed as B(n, pj); ii) If m is an integer such that 2 m k 1 and j1, . . . , jm are m distinct integers from the set {1, . . . , k}, show that the r.v.s Xj , . . . , Xj have Multinomial distributions with parameters n and pj , pj .
1 m 1 m
3.3
Continuous Random Variables 3.1 Soem (and General Random Concepts Vectors)
65
3.2.22 (Polyas urn scheme) Consider an urn containing b black balls and r red balls. One ball is drawn at random, is replaced and c balls of the same color as the one drawn are placed into the urn. Suppose that this experiment is repeated independently n times and let X be the r.v. denoting the number of black balls drawn. Then show that the p.d.f. of X is given by
b b + c b + 2c b + x 1 c n P X =x = x b + r b + r + c
)( (
)(
[ ( )] r (r + c ) [r + ( n x 1)c ] .
) ) )
b + r + 2c b + r + m 1 c
)]
(This distribution can be used for a rough description of the spread of contagious diseases. For more about this and also for a certain approximation to the above distribution, the reader is referred to the book An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed., 1968, by W. Feller, pp. 120121 and p. 142.)
3.3 Continuous Random Variables (and Random Vectors)

3.3.1 Normal (or Gaussian)
X S = , f x = x exp 2 2 2 1
( )
()
x .
We say that X is distributed as normal (, 2), denoted by N(, 2), where , 2 are called the parameters of the distribution of X which is also called the Normal distribution ( = mean, , 2 = variance, > 0). For = 0, = 1, we get what is known as the Standard Normal distribution, denoted by N(0, 1). Clearly f(x) > 0; that I = f x dx = 1 is proved by showing that 2 I = 1. In fact,
()
I2 = f x dx = f x dx f y dy x 2 y 1 1 = exp dx exp 2 2 2 2 2
()
() )
()
dy
1 1 2
e z
dz
d ,
upon letting (x )/ = z, so that z (, ), and (y )/ = , so that (, ). Thus
66
f (x) 0.8 0.6 0.4 0.2 2 1 0.5
1 2 0 1 2 N ( , 2 ) 3 4 5 x
Figure 3.5 Graph of the p.d.f. of the Normal distribution with = 1.5 and several values of .
I2 =
1 2
z 2 + 2
) 2 dz d = 1
2
0
e r
r dr d
by the standard transformation to polar coordinates. Or I2 = 1 2
e r
r dr
d = e r
0
r dr = e r
2 0
= 1;
that is, I2 = 1 and hence I = 1, since f(x) > 0. It is easily seen that f(x) is symmetric about x = , that is, f( x) = f( + x) and that f(x) attains its maximum at x = which is equal to 1/( 2 ). From the fact that max f x =
x
()
1 2
and the fact that
f ( x)dx = 1,
we conclude that the larger is, the more spread-out f(x) is and vice versa. It is also clear that f(x) 0 as x . Taking all these facts into consideration, we are led to Fig. 3.5. The Normal distribution is a good approximation to the distribution of grades, heights or weights of a (large) group of individuals, lifetimes of various manufactured items, the diameters of hail hitting the ground during a storm, the force required to punctuate a cardboard, errors in numerous measurements, etc. However, the main signicance of it derives from the Central Limit Theorem to be discussed in Chapter 8, Section 8.3.
3.3.2
Gamma
X S = actually X S = 0,
( )
( ) (
))
3.3
67
Here
1 x 1 e x , f x = 0 ,
()
( )
x > 0 > 0, > 0, x0
where () = 0 y 1 e y dy (which exists and is nite for > 0). (This integral is known as the Gamma function.) The distribution of X is also called the Gamma distribution and , are called the parameters of the distribution. Clearly, f(x) 0 and that f(x)dx = 1 is seen as follows.
f (x )dx = ( )
x 1 e x dx =
( ) ( )
y 1 e y dy,
upon letting x/ = y, x = y, dx = dy, y (0, ); that is,
f (x )dx = ( ) 0
y 1 e y dy =
1 = 1.
( )
REMARK 3
One easily sees, by integrating by parts, that
= 1 1 ,
and if is an integer, then
= 1 2 1 ,
( ) (
)(
( ) (
)(
()
where
1 = e y dy = 1; that is, a = 1 !
0
()
() (
We often use this notation even if is not an integer, that is, we write
= 1 ! = y 1 e y dy for > 0.
0
( ) (
For later use, we show that
1 1 = ! = . 2 2
We have
(1 2 ) 1 = y e y dy. 0 2
By setting
y1 2 = t 2 , so that y= t2 , dy = t dt , t 0, . 2
68
we get
1 1 = 2 e t 0 2 t
2
t dt = 2 e t
0
dt = ;
that is,
1 1 = ! = . 2 2
From this we also get that
3 1 1 = = , etc. 2 2 2 2
Graphs of the p.d.f. of the Gamma distribution for selected values of and are given in Figs. 3.6 and 3.7. The Gamma distribution, and in particular its special case the Negative Exponential distribution, discussed below, serve as satisfactory models for
f (x) 1.00 0.75 0.50
2, 1 1, 1
0.25
4, 1
Figure 3.6 Graphs of the p.d.f. of the Gamma distribution for several values of , .
f (x)
1.00
0.75
0.50 0.25
2, 0.5
2, 1
2, 2 4
Figure 3.7 Graphs of the p.d.f. of the Gamma distribution for several values of , .
3.3
69
describing lifetimes of various manufactured items, among other things, as well as in statistics. For specic choices of the parameters and in the Gamma distribution, we obtain the Chi-square and the Negative Exponential distributions given below.
3.3.3 Chi-square
For = r/2, r 1, integer, = 2, we get what is known as the Chi-square distribution, that is,
1 ( r 2 )1 x 2 x e , 1 r 2 f x = 2 r 2 0,
()
( )
x>0 x0
r > 0, integer.
2 The distribution with this p.d.f. is denoted by r and r is called the number of degrees of freedom (d.f.) of the distribution. The Chi-square distribution occurs often in statistics, as will be seen in subsequent chapters.
3.3.4 Negative Exponential

For = 1, = 1/, we get
e x , f x = 0 ,
()
x>0 x0
> 0,
which is known as the Negative Exponential distribution. The Negative Exponential distribution occurs frequently in statistics and, in particular, in waitingtime problems. More specically, if X is an r.v. denoting the waiting time between successive occurrences of events following a Poisson distribution, then X has the Negative Exponential distribution. To see this, suppose that events occur according to the Poisson distribution P(); for example, particles emitted by a radioactive source with the average of particles per time unit. Furthermore, we suppose that we have just observed such a particle, and let X be the r.v. denoting the waiting time until the next particle occurs. We shall show that X has the Negative Exponential distribution with parameter . To this end, it is mentioned here that the distribution function F of an r.v., to be studied in the next chapter, is dened by F(x) = P(X x), x , and if X (x ) = f ( x). Thus, it sufces to determine F here. is a continuous r.v., then dFdx Since X 0, it follows that F(x) = 0, x 0. So let x > 0 be the the waiting time for the emission of the next item. Then F(x) = P(X x) = 1 P(X > x). Since is the average number of emitted particles per time unit, their average x ( x ) = e x , since no number during time x will be x. Then P( X > x) = e 0! x particles are emitted in (0, x]. That is, F(x) = 1 e , so that f(x) = ex. To summarize: f(x) = 0 for x 0, and f(x) = ex for x > 0, so that X is distributed as asserted.
0
70
Consonant with previous notation, we may use the notation X (, ) or 2 X NE(), or X r in order to denote the fact that X is distributed as Gamma with parameters and , or Negative Exponental with parameter , or Chi-square with r degrees of freedom, respectively.
3.3.5 Uniform U(, ) or Rectangular R(, )

X S = actually X S = , and
1 , f x = 0,
( )
( ) [
])
()
x otherwise
< .
Clearly,
f x 0,
()
f (x )dx = dx = 1.
The distribution of X is also called Uniform or Rectangular (, ), and and are the parameters of the distribution. The interpretation of this distribution is that subintervals of [, ], of the same length, are assigned the same probability of being observed regardless of their location. (See Fig. 3.8.) The fact that the r.v. X has the Uniform distribution with parameters and may be denoted by X U(, ).
f (x)
1
Figure 3.8 Graph of the p.d.f. of the U(, ) distribution.
3.3.6 Beta
X S = actually X S = 0, 1 and
+ x 1 1 x f x = 0 elsewhere,
( )
( ) ( ))
)
1
()
( ) ( )()
0<x<1
> 0, > 0.
Clearly, f(x) 0. That f ( x)dx = 1 is seen as follows.
3.3
71
= x 1 e x dx y 1 e y dy 0 0 ( x+y ) = x 1 y 1 e dx dy 0 0
( )()
which, upon setting u = x/(x + y), so that

x= uy y du , dx = , u 0, 1 2 1 u 1 u
( )
y 1 u
and x + y =
y , 1 u
becomes = =
1
u 1
(1 u) (
1 u
y 1 y 1 e y + 1 e
du
(1 u)
dy
1 0
u 1
y 1 u
+1
du dy.
Let y/(1 u) = , so that y = (1 u), dy = (1 u)d, (0, ). Then the integral is
1 0
u (1 u)
1
+ 1 e du d
= + 1 e d u 1 1 u
0 0
= +
that is,
) u
1 0
( (1 u)
1
du
du;
= +
and hence
( )() (
(
) x (1 x)
1
dx
1 f (x )dx = ( )( ) 0 x (1 x )
1
dx = 1.
Graphs of the p.d.f. of the Beta distribution for selected values of and are given in Fig. 3.9.
REMARK 4 For = = 1, we get the U(0, 1), since (1) = 1 and (2) = 1. The distribution of X is also called the Beta distribution and occurs rather often in statistics. , are called the parameters of the distribution 1 and the function dened by 0 x 1 (1 x ) 1 dx for , > 0 is called the Beta function. Again the fact that X has the Beta distribution with parameters and may be expressed by writing X B(, ).
72
f (x) 2.5
3 3
5 3
2.0
2 2
1.5
1.0
0.2
0.4
0.6
0.8
1.0
Figure 3.9 Graphs of the p.d.f. of the Beta distribution for several values of , .
3.3.7 Cauchy
Here
X S = and
( )
f x =
()
1 2 + x
x , , > 0.
Clearly, f(x) > 0 and
f ( x )dx =
2 + x
dx =
1 1 1 + x
[(
) ]
dx
1 dy 1 = arctan y = 1, 1 + y 2
upon letting
y= x , so that dx = dy.
The distribution of X is also called the Cauchy distribution and , are called the parameters of the distribution (see Fig. 3.10). We may write X Cauchy(, 2) to express the fact that X has the Cauchy distribution with parameters and 2. (The p.d.f. of the Cauchy distribution looks much the same as the Normal p.d.f., except that the tails of the former are heavier.)
3.3.8 Lognormal
Here X(S) = ( actually X(S) = (0, )) and
3.3
3.1 Soem Concepts Continuous Random Variables (and General Random Vectors)
73
f (x) 0.3 0.2 0.1 2 1 0 1 2 x
Figure 3.10 Graph of the p.d.f. of the Cauchy distribution with = 0, = 1.
1 exp log x log f x = x 2 2 2 0,
()
x>0 x 0 where , > 0.
Now f(x) 0 and
()

f x dx =
log x log 1 exp x 2 2
dx
which, letting x = ey, so that log x = y, dx = eydy, y (, ), becomes
y log 1 = exp y 2 2 2 e 1
e y dy.
But this is the integral of an N(log , 2) density and hence is equal to 1; that is, if X is lognormally distributed, then Y = log X is normally distributed with parameters log and 2. The distribution of X is called Lognormal and , are called the parameters of the distribution (see Fig. 3.11). The notation X Lognormal(, ) may be used to express the fact that X has the Lognormal distribution with parameters and . (For the many applications of the Lognormal distribution, the reader is referred to the book The Lognormal Distribution by J. Aitchison and J. A. C. Brown, Cambridge University Press, New York, 1957.)
3.3.9 t 3.3.10 F
These distributions occur very often in Statistics (interval estimation, testing hypotheses, analysis of variance, etc.) and their densities will be presented later (see Chapter 9, Section 9.2).
We close this section with an example of a continuous random vector.
3.3.11 Bivariate Normal

Here X(S) = 2 (that is, X is a 2-dimensional random vector) with
74
f (x) 0.8 0.6 0.4 0.2

e2 e
1
2 0.5
Figure 3.11 Graphs of the p.d.f. of the Lognormal distribution for several values of , .
f x1 , x 2 =
1 2 1 2 1
2
e q 2 ,
where x1, x2 ;1, 2 > 0; 1 < < 1 and

q=
2 x 2 x 1 1 x 2 2 x 2 2 1 1 2 + 1 2 2 1 2 1
with 1, 2 . The distribution of X is also called the Bivariate Normal distribution and the quantities 1, 2, 1, 2, are called the parameters of the distribution. (See Fig. 3.12.) Clearly, f(x1, x2) > 0. That f(x1, x2)dx1dx2 = 1 is seen as follows:
2
2 x 2 x1 1 x 2 2 x 2 2 1 1 2 q = 1 2 + 1 1 2 2
x 2 x1 1 2 x1 1 = 2 + 1 . 1 1 2
Furthermore,
x2 2 x1 1 x 2 2 1 x 1 2 1 = 2 2 1 2 1 =
where
b = 2 +
1 2
x1 1 1 x2 b , x 2 2 + 2 = 1 2
2 x1 1 . 1
3.3
3.1 Soem Concepts Continuous Random Variables (and General Random Vectors)
75
z z f (x1, x 2 ) for z k
x2
x1
Figure 3.12 Graph of the p.d.f. of the Bivariate Normal distribution.
Thus
(
and hence
x b 2 x1 1 1 2 q = 2 + 1 2 1
f x1 , x 2 dx 2 =
x 1 1 exp 2 2 1 2 1 1

2 x2 b 1 exp 2 2 1 2 2 2 1 2 2
2
dx 2
x 1 1 exp 2 2 2 1 1 1
1,
2 since the integral above is that of an N(b, 2 (1 2)) density. Since the rst 2 factor is the density of an N(1, 1 ) random variable, integrating with respect to x1, we get
f ( x1 , x 2 )dx1 dx 2 = 1.

REMARK 5
From the above derivations, it follows that, if f(x1, x2) is Bivariate
Normal, then
f1 x1 = f x1 , x 2 dx 2
( )
is N 1 , 12 ,
(
(
and similarly,
f2 x 2 = f x1 , x 2 dx1
( )
2 is N 2 , 2 .
76
As will be seen in Chapter 4, the p.d.f.s f1 and f2 above are called marginal p.d.f.s of f. 2 The notation X N(1, 2, 12, 2 , ) may be used to express the fact that 2 X has the Bivariate Normal distribution with parameters 1, 2, 12, 2 , . 2 2 Then X1 N(1 , 1 ) and X2 N(2, 2 ).
Exercises
3.3.1 Let f be the p.d.f. of the N(, 2) distribution and show that: ii) f is symmetric about ; ii) max f x =
x
()
1 2
3.3.2 Let X be distributed as N(0, 1), and for a < b, let p = P(a < X < b). Then use the symmetry of the p.d.f. f in order to show that: iii) iii) iii) iv) For 0 a < b, p = (b) (a); For a 0 < b, p = (b) + (a) 1; For a b < 0, p = (a) (b); For c > 0, P(c < X < c) = 2(c) 1. If X N(0, 1), use the Normal Tables in Appendix III in order to show
(See Normal Tables in Appendix III for the denition of .) 3.3.3 that:
iii) P(1 < X < 1) = 0.68269; iii) P(2 < X < 2) = 0.9545; iii) P(3 < X < 3) = 0.9973.
2 3.3.4 Let X be a r . In Table 5, Appendix III, the values = P(X x) are given for r ranging from 1 to 45, and for selected values of . From the entries of the table, observe that, for a xed , the values of x increase along with the number of degrees of freedom r. Select some values of and record the corresponding values of x for a set of increasing values of r.
2 3.3.5 Let X be an r.v. distributed as 10 . Use Table 5 in Appendix III in order to determine the numbers a and b for which the following are true:
ii) P(X < a) = P(X > b); ii) P(a < X < b) = 0.90. 3.3.6 Consider certain events which in every time interval [t1, t2] (0 < t1 < t2) occur independently for nonoverlapping intervals according to the Poisson distribution P((t2 t1)). Let T be the r.v. denoting the time which lapses
77
between two consecutive such events. Show that the distribution of T is Negative Exponential with parameter by computing the probability that T > t. 3.3.7 Let X be an r.v. denoting the life length of a TV tube and suppose that its p.d.f. f is given by: f(x) = exI(0, )(x). Compute the following probabilities: iii) iii) iii) iv) P(j < X j + 1), j = 0, 1, . . . ; P(X > t) for some t > 0; P(X > s + t|X > s) for some s, t > 0; Compare the probabilities in parts (ii) and (iii) and conclude that the Negative Exponential distribution is memoryless; iv) If it is known that P(X > s) = , express the parameter in terms of and s.
3.3.8 Suppose that the life expectancy X of each member of a certain group of people is an r.v. having the Negative Exponential distribution with parameter = 1/50 (years). For an individual from the group in question, compute the probability that: iii) He will survive to retire at 65; iii) He will live to be at least 70 years old, given that he just celebrated his 40th birthday; iii) For what value of c, P(X > c) = 1 ? 2 3.3.9 Let X be an r.v. distributed as U(, ) ( > 0). Determine the values of the parameter for which the following are true: ii) P(1 < X < 2) = 0.75; ii) P(|X| < 1) = P(|X| > 2). 3.3.10 Refer to the Beta distribution and set: B , = x 1 1 x
0
dx.
Then show that B(, ) = B(, ). 3.3.11 Establish the following identity: n 1 p m1 n 1 x x m 1 0
n m
dx =
p n! x m1 1 x m1 nm ! 0
)(
n m
dx
= n p j 1 p j j= m
n j
3.3.12 Let X be an r.v. with p.d.f given by f(x) = 1/[(1 + x2)]. Calculate the probability that X2 c.
78
3.3.13 iii) iii) iii) iv) f(x) f(x) f(x) f(x)
Show that the following functions are p.d.f.s: = xex /2I(0, )(x) (Raleigh distribution); = 2 / x2ex /2I(0,)(x) (Maxwells distribution); = 1 e|x| (Double Exponential); 2 a = (c )( cx )+1IA(x), A = (c, ), , c > 0 (Pareto distribution).
2 2
3.3.14 Show that the following functions are p.d.f.s: ii) f(x) = cos xI(0,/2)(x); ii) f(x) = xexI(0,)(x). 3.3.15 For what values of the constant c are the following functions p.d.f.s?
ce 6 x , ii) f(x) = cx, 0 ,
3
x>0 1 < x 0; x 1
ii) f(x) = cx2ex I(0,) (x). 3.3.16 Let X be an r.v. with p.d.f. given by 3.3.15(ii). Compute the probability that X > x. 3.3.17 Let X be the r.v. denoting the life length of a certain electronic device expressed in hours, and suppose that its p.d.f. f is given by: f x =
()
c I 1,000 , 3,000 ] x . xn [
()
ii) Determine the constant c in terms of n; ii) Calculate the probability that the life span of one electronic device of the type just described is at least 2,000 hours. 3.3.18 Refer to Exercise 3.3.15(ii) and compute the probability that X exceeds s + t, given that X > s. Compare the answer with that of Exercise 3.3.7(iii). 3.3.19 Consider the function f(x) = x 1e x , x > 0 (, > 0), and:
iii) Show that it is a p.d.f. (called the Weibull p.d.f. with parameters and ); iii) Observe that the Negative Exponential p.d.f. is a special case of a Weibull p.d.f., and specify the values of the parameters for which this happens; iii) For = 1 and = 1 , = 1 and = 2, draw the respective graphs of the 2 p.d.f.s involved. (Note: The Weibull distribution is employed for describing the lifetime of living organisms or of mechanical systems.)
3.4 3.1 The Soem Poisson General Distribution Concepts
79
3.3.20
Let X and Y be r.v.s having the joint p.d.f. f given by:
f x, y = c 25 x 2 y 2 I (0 ,5 ) x 2 + y 2 .
Determine the constant c and compute the probability that 0 < X2 + Y2 < 4. 3.3.21 Let X and Y be r.v.s whose joint p.d.f. f is given by f(x, y) = cxyI(0,2)(0,5)(x, y). Determine the constant c and compute the following probabilities: i) ii) iii) iv) < X < 1, 0 < Y < 3); P( 1 2 P(X < 2, 2 < Y < 4); P(1 < X < 2, Y > 5); P(X > Y).
) (
) (
3.3.22 Verify that the following function is a p.d.f.:

f x, y =
1 cos y I A x, y , 4
) (
A = , , . 2 2
3.3.23
(A mixed distribution) Show that the following function is a p.d.f.
1 x e , 4 1 , f x = 8 x 1 , 2 0 ,
x0 0<x<2 x = 2, 3, otherwise.
()
3.4 The Poisson Distribution as an Approximation to the Binomial Distribution and the Binomial Distribution as an Approximation to the Hypergeometric Distribution
In this section, we rst establish rigorously the assertion made earlier that the Poisson distribution may be obtained as the limit of Binomial distributions. To this end, consider a sequence of Binomial distributions, so that the nth distribution has probability pn of a success, and we assume that as n , pn 0 and that
n = npn ,
for some > 0. Then the following theorem is true.
THEOREM 1
With the above notation and assumptions, we have

x n x n x e pn q n n x x!
for each xed x = 0, 1, 2, .
80
PROOF
We have n x n x n n 1 n x + 1 x n x pn q n pn q n = x x! = = n n 1 n x + 1 n n 1 x! n n
x
( ( (
) ) )
( ( (
) )
n x
n n1 nx +1 nx
) 1
x!
x n
1 1 n x n n 1 n
= 1 1
x 1 x 1 n 1 n n x! n
1 x 1 n e , n x n x! n 1 n since, if n , then
n 1 e . n
n
This is merely a generalization of the better-known fact that

1 e . n
n
The meaning of the theorem is the following: If n is large the x nx probabilities ( n are not easily calculated. Then we can approximate x )p q x them by e ( /x!), provided p is small, where we replace be np. This is true for all x = 0, 1, 2, . . . , n. We also meet with difculty in calculating probabilities in the Hypergeometric distribution
REMARK 6
m n x r x
m + n r
if m, n are large. What we do is approximate the Hypergeometric distribution by an appropriate Binomial distribution, and then, if need be, we can go one step further in approximating the Binomial by the appropriate Poisson distribution according to Theorem 1. Thus we have
THEOREM 2
Let m, n and suppose that m/(m + n) = pm,n p, 0 < p < 1. Then
3.4 3.1 The Soem Poisson General Distribution Concepts
81
m n r x r x p x q r x , m + n x r
PROOF
x = 0, 1, 2, , r .
We have
m n m! n! m + n r ! x r x r! = m + n m x ! n r x ! m + n ! x! r x ! r
)[ ( (
) )] (
r m x + 1 m n r + x + 1 n = x m+nr +1 m+n
) ( r m( m 1) [ m ( x 1)] n( n 1) [ n (r x 1)] . = x (m + n) [(m + n) (r 1)]

Both numerator and denominator have r factors. Dividing through by (m + n), we get
m x m n r x r m m 1 x1 = m + n m + n m + n x m + n m + n m + n r n n n 1 r x 1 m+n m + n m + n m + n m+n 1 r 1 1 1 1 m + n m + n r x r x m p q , ,n x
1
) )
since
m p and hence m+n
REMARK 7
n 1 p = q. m+n
The meaning of the theorem is that if m, n are large, we can approximate the probabilities
82
m n x r x m + n r
r by p x q r x x
by setting p = m/(m + n). This is true for all x = 0, 1, 2, . . . , r. It is to be x rx m observed that ( xr )( mm is the exact probability of having exactly x + n ) (1 m + n ) successes in r trials when sampling is done with replacement, so that the , remains constant. The Hypergeometric distribuprobability of a success, mm +n tion is appropriate when sampling is done without replacement. If, however, m m and n are large (m, n ) and n remains approximately constant c = p / q), then the probabilities of having exactly x successes in r (m n (independent) trials are approximately equal under both sampling schemes.
Exercises
3.4.1 For the following values of n, p and = np, draw graphs of B(n, p) and P() on the same coordinate axes: iii) iii) iii) iv) iv) n= n= n= n= n= 10, p 16, p 20, p 24, p 24, p = = = = =
4 16 2 16 2 16 1 16 2 16
, so that = 2.5; , so that = 2; , so that = 2.5; , so that = 1.5; , so that = 3.
3.4.2 Refer to Exercise 3.2.2 and suppose that the number of applicants is equal to 72. Compute the probabilities (i)(iii) by using the Poisson approximation to Binomial (Theorem 1). 3.4.3 Refer to Exercise 3.2.10 and use Theorem 2 in order to obtain an approximate value of the required probability.
3.5* Random Variables as Measurable Functions and Related Results

In this section, random variables and random vectors are introduced as special cases of measurable functions. Certain results related to -elds are also derived. Consider the probability space (S, A, P) and let T be a space and X be a function dened on S into T, that is, X : S T. For T T, dene the inverse image of T, under X, denoted by X1(T), as follows:
X 1 T = s S ; X s T .
( ) {
() }
3.5* Random Variables as Measurable Functions 3.1 Soem and General Related Concepts Results
83
This set is also denoted by [X T] or (X T). Then the following properties are immediate consequences of the denition (and the fact X is a function):
X 1 U T j = U X 1 T j . j j
( )
(1)
If T1 T2 = , then X 1 T1 X 1 T2 = .
Hence by (1) and (2) we have
X 1 T j = X 1 T j . j j
( )
( )
(2)
( )
(3)
Also
X 1 I T j = I X 1 T j , j j
( )
c
(4) (5) (6) (7)
X 1 T c = X 1 T
X 1 T = S , X 1
( ) [ ( )] ,
( ) () = .
Let now D be a -eld of subsets of T and dene the class X1(D) of subsets of S as follows:
X 1 D = A S ; A = X 1 T for some T D .
By means of (1), (5), (6) above, we immediately have
THEOREM 3
( ) {
( )
The class X1(D) is a -eld of subsets of S. The above theorem is the reason we require measurability in our denition of a random variable. It guarantees that the probability distribution function of a random vector, to be dened below, is well dened. If X1(D) A, then we say that X is (A, D)-measurable, or just measurable if there is no confusion possible. If (T, D) = (, B) and X is (A, B)measurable, we say that X is a random variable (r.v.). More generally, if (T, D) = (k, Bk), where k = ( k copies of ), and X is (A, Bk)measurable, we say that X is a k-dimensional random vector (r. vector). In this latter case, we shall write X if k 1, and just X if k = 1. A random variable is a one-dimensional random vector. On the basis of the properties (1)(7) of X1, the following is immediate.
THEOREM 4 COROLLARY
Dene the class C* of subsets of T as follows: C* = {T T; X1(T) = A for some A A}. Then C* is a -eld. Let D = (C), where C is a class of subsets of T. Then X is (A, D)-measurable if and only if X1(C) A. In particular, X is a random variable if and only if
84
X1(Co), or X1(Cj), or X1(C j) A, j = 1, 2, . . . , 8, and similarly for the case of k-dimensional random vectors. The classes Co, Cj, C j, j = 1, . . . , 8 are dened in Theorem 5 and the paragraph before it in Chapter 1. The -eld C* of Theorem 4 has the property that C* C. Then C* D = (C ) and hence X1(C*) X1(D). But X1(C*) A. Thus X1(D) A. The converse is a direct consequence of the denition of (A, D) = measurability.
PROOF
Now, by means of an r. vector X: (S, A, P) (k, Bk ), dene on Bk the set function PX as follows: PX B = P X 1 B = P X B = P s S ; X s B .
By the Corollary to Theorem 4, the sets X1(B) in S are actually events due to the assumption that X is an r. vector. Therefore PX is well dened by (8); i.e., P[X1(B)] makes sense, is well dened. It is now shown that PX is a probability measure on Bk . In fact, PX(B) 0, B Bk, since P is a probability measure. Next, PX(k) = P[X 1(k)] = P(S ) = 1, and nally,
PX B j = P X 1 B j = P X 1 B j = P X 1 B j = PX B j . j =1 j =1 j =1 j =1 j =1 The probability measure PX is called the probability distribution function (or just the distribution) of X.
( ) [ ( )] (
({
( ) })
(8)
( )
[ ( )]
( )
Exercises
3.5.1 Consider the sample space S supplied with the -eld of events A. For an event A, the indicator IA of A is dened by: IA(s) = 1 if s A and IA(s) = 0 if s Ac. iii) Show that IA is r.v. for any A A . iii) What is the partition of S induced by IA? iii) What is the -eld induced by IA? 3.5.2 3.5.3 Write out the proof of Theorem 1 by using (1), (5) and (6). Write out the proof of Theorem 2.
4.1 The Cumulative Distribution Function
85
Chapter 4
Distribution Functions, Probability Densities, and Their Relationship
4.1 The Cumulative Distribution Function (c.d.f. or d.f.) of a Random Vector Basic Properties of the d.f. of a Random Variable
The distribution of a k-dimensional r. vector X has been dened through the relationship: PX (B) = P(X B), where B is a subset of k. In particular, one may choose B to be an interval in k; i.e., B = {y k; y x} in the sense that, if x = (x1, . . . , xk) and y = ( y1, . . . , yk), then yj xj, j = 1, . . . , k. For such a choice of B, PX(B) is denoted by FX(x) and is called the cumulative distribution function of X (evaluated at x), or just the distribution function (d.f.) of X. We omit the subscript X if no confusion is possible. Thus, the d.f. F of a r. vector X is an ordinary point function dened on k (and taking values in [0, 1]). Now we restrict our attention to the case k = 1 and prove the following basic properties of the d.f. of an r.v.
THEOREM 1
The distribution function F of a random variable X satises the following properties: i) 0 F(x) 1, x . ii) F is nondecreasing. iii) F is continuous from the right. iv) F(x) 0 as x , F(x) 1, as x +. We express this by writing F() = 0, F(+) = 1.
PROOF In the course of this proof, we set Q for the distribution PX of X, for the sake of simplicity. We have then:
i) Obvious. ii) This means that x1 < x2 implies F(x1) F(x2). In fact,
85
86
x1 < x2
implies
(, x ] (, x ]
1 2
and hence
Q , x1 Q , x 2 ; equivalently, F x1 F x 2 .
] (
( )
( )
iii) This means that, if xn x, then F(xn) F(x). In fact,
x n x implies
and hence
(, x ] (, x]
n
Q , x n Q , x
by Theorem 2, Chapter 2; equivalently, F(xn) F(x). iv) Let xn . We may assume that xn (see also Exercise 4.1.6). Then
(, x ] ,
n
so that Q , x n Q = 0
] ( )
(, x ] and hence Q(, x ] Q( = ) 1; equivalently, F ( x ) 1.

n n n
by Theorem 2, Chapter 2. Equivalently, F(xn) 0. Similarly, if xn +. We may assume xn . Then
Graphs of d.f.s of several distributions are given in Fig. 4.1.

REMARK 1
i) F(x) can be used to nd probabilities of the form P(a < X b); that is
P a<X b =F b F a .
In fact, and Thus
() ()
(a < X b) = ( < X b) ( < X a) ( < X a) ( < X b). ) ( ) ( ) () ()
P a < X b = P < X b P < X a = F b F a .

ii) The limit from the left of F(x) at x, denoted by F(x), is dened as follows:
F x = lim F x n
n
( )
( )
with x n x.
This limit always exists, since F(xn), but need not be equal to F(x+)(=limit from the right) = F(x). The quantities F(x) and F(x) are used to express the probability P(X = a); that is, P(X = a) = F(a) F(a). In fact, let xn a and set A = (X = a), An = (xn < X a). Then, clearly, An A and hence by Theorem 2, Chapter 2,
P An P A , or lim P x n < X a = P X = a ,
n
( )
( )
or
lim F a F x n = P X = a ,
n
[ ( ) ( )] (
4.1 The Cumulative Distribution Function
87
or
F a lim F x n = P X = a ,
n
()
( )
or
F a F a =P X =a .
It is known that a nondecreasing function (such as F) may have discontinuities which can only be jumps. Then F(a) F(a) is the length of the jump of F at a. Of course, if F is continuous then F(x) = F(x) and hence P(X = x) = 0 for all x. iii) If X is discrete, its d.f. is a step function, the value of it at x being dened by
() ( )
F x =
( ) f (x )
j xjx
and
f x j = F x j F x j1 ,
( )
( ) ( )
where it is assumed that x1 < x2 < . iv) If X is of the continuous type, its d.f. F is continuous. Furthermore,
dF x dx
( )=f
(x)
F(x) 1.00 0.80 0.60 0.40 0.20
F(x) 1.00 0.80 0.60 0.40 0.20 0 (a) Binomial for n 6, p

1 . 4
0 (b) Poisson for 2.
F(x) 1.0 0 x x x . x 2 1
(x) 1.0 0.5 x
0 (d) N (0, 1).
(c) U (, ). Here F(x)
Figure 4.1 Examples of graphs of c.d.f.s.
88
at continuity points of f, as is well known from calculus. Through the relations

F x = f t dt and
()
()
dF x dx
( )=f
(x),
we see that if f is continuous, f determines F( f F ) and F determines f (F f ); that is, F f. Two important applications of this are the following two theorems. Often one has to deal with functions of an r. vector itself. In such cases, the resulting entities have got to be r. vectors, since we operate in a probability framework. The following statement is to this effect. Its precise formulation and justication is given as Theorem 7 on page 104.
STATEMENT 1
Let X be a k-dimensional r. vector dened on the sample space S, and let g be a (well-behaving) function dened on k and taking values in m. Then g(X) is dened on the underlying sample space S, takes values in m, and is an r. vector. (That is, well-behaving functions of r. vectors are r. vectors.) In particular, g(X) is an r. vector if g is continuous. Now a k-dimensional r. vector X may be represented in terms of its coordinates; i.e., X = (X1, . . . , Xk), where Xj, j = 1, . . . , k are real-valued functions dened on S. The question then arises as to how X and Xj, j = 1, . . . , k are related from the point of view of being r. vectors. The answer is provided by the following statement, whereas the precise statement and justication are given as Theorem 8 below.
STATEMENT 2
Let X and Xj, j = 1, . . . , k be functions dened on the sample space S and taking values in k and , respectively, and let X = (X1, . . . , Xk). Then X is an r. vector if and only if Xj, j = 1, . . . , k are r.v.s. The following two theorems provide applications of Statement 1. Let X be an N(, 2)-distributed r.v. and set Y = distribution is N(0, 1).
PROOF
X
THEOREM 2
. Then Y is an r.v. and its
In the rst place, Y is an r.v. by Statement 1. Then it sufces to show that the d.f. of Y is , where y = We have
X P Y y = P y = P X y +
()
1 2
e t
dt .
)
1 2
y +
t exp 2 2
dt =
u2 2
du = y ,
()
4.1 The Cumulative DistributionExercises Function
89
where we let u = (t )/ in the transformation of the integral.

REMARK 2
The transformation
of X.
THEOREM 3
of X is referred to as normalization
(i) We will show that the p.d.f. of Y is that of a 2 1-distributed r.v. by deriving the d.f. of Y rst and then differentating it in order to obtain fY. To this end, let us observe rst that Y is an r.v. on account of Statement 1. Next, for y > 0, we have
PROOF
i(i) Let X be an N(0, 1)-distributed r.v. Then Y = X 2 is distributed as 2 1. 2 2 X (ii) If X is a N ( , )-distributed r.v., then the r.v. ( ) is distributed as 2 1.
FY y = P Y y = P y X = 1 2
()
)
y 0
ex
dx = 2
1 2
ex
dx.
Let x =
t . Then dx = dt/2 t , t (0, y] and FY y = 2
()
1 2
1 2 t
e t 2 dt .
Hence
dFY y dy
( )=
1 2
1 y
e y
1 2
(1 2 )1
e y 2 .
Since fY( y) = 0 for y 0 (because FY( y) = 0, y 0), it follows that

1 (1 2 )1 y 2 y e , fY y = 21 2 0,
()
y>0 y 0,
1 and this is the p.d.f. of 2 1. (Observe that here we used the fact that ( 2 ) = .)
Exercises
4.1.1 Refer to Exercise 3.2.13, in Chapter 3, and determine the d.f.s corresponding to the p.d.f.s given there. 4.1.2 Refer to Exercise 3.2.14, in Chapter 3, and determine the d.f.s corresponding to the p.d.f.s given there.
90
4.1.3 Refer to Exercise 3.3.13, in Chapter 3, and determine the d.f.s corresponding to the p.d.f.s given there. 4.1.4 Refer to Exercise 3.3.14, in Chapter 3, and determine the d.f.s corresponding to the p.d.f.s given there. 4.1.5 Let X be an r.v. with d.f. F. Determine the d.f. of the following r.v.s: X, X 2, aX + b, XI[a,b) (X ) when: i) X is continuous and F is strictly increasing; ii) X is discrete. 4.1.6 Refer to the proof of Theorem 1 (iv) and show that we may assume that xn (xn ) instead of xn (xn ). 4.1.7 Let f and F be the p.d.f. and the d.f., respectively, of an r.v. X. Then show that F is continuous, and dF(x)/dx = f(x) at the continuity points x of f. 4.1.8 i) Show that the following function F is a d.f. (Logistic distribution) and derive the corresponding p.d.f., f.
F x =
()
1+ e
1 , x , > 0, ; (x + )
ii) Show that f(x) =F(x)[1 F(x)]. 4.1.9 Refer to Exercise 3.3.17 in Chapter 3 and determine the d.f. F corresponding to the p.d.f. f given there. Write out the expressions of F and f for n = 2 and n = 3. 4.1.10 If X is an r.v. distributed as N(3, 0.25), use Table 3 in Appendix III in order to compute the following probabilities: i) P(X < 1); ii) P(X > 2.5); iii) P(0.5 < X < 1.3). 4.1.11 The distribution of IQs of the people in a given group is well approximated by the Normal distribution with = 105 and = 20. What proportion of the individuals in the group in question has an IQ: i) At least 150? ii) At most 80? iii) Between 95 and 125? 4.1.12 A certain manufacturing process produces light bulbs whose life length (in hours) is an r.v. X distributed as N(2,000, 2002). A light bulb is supposed to be defective if its lifetime is less than 1,800. If 25 light bulbs are
4.2
The 4.1 d.f. of The a Random Cumulative Vector Distribution and Its Properties Function
91
tested, what is the probability that at most 15 of them are defective? (Use the required independence.) 4.1.13 A manufacturing process produces 1 -inch ball bearings, which are 2 assumed to be satisfactory if their diameter lies in the interval 0.5 0.0006 and defective otherwise. A days production is examined, and it is found that the distribution of the actual diameters of the ball bearings is approximately normal with mean = 0.5007 inch and = 0.0005 inch. Compute the proportion of defective ball bearings. 4.1.14 If X is an r.v. distributed as N(, 2), nd the value of c (in terms of and ) for which P(X < c) = 2 9P(X > c). 4.1.15 Refer to the Weibull p.d.f., f, given in Exercise 3.3.19 in Chapter 3 and do the following: i) Calculate the corresponding d.f. F and the reliability function (x) = 1 F(x); f (x ) ii) Also, calculate the failure (or hazard) rate H x = ( x ) , and draw its graph for = 1 and = 1 , 1, 2;
()
iii) For s and t > 0, calculate the probability P(X > s + t|X > t) where X is an r.v. having the Weibull distribution; iv) What do the quantities F(x), (x), H(x) and the probability in part (iii) become in the special case of the Negative Exponential distribution?
4.2 The d.f. of a Random Vector and Its PropertiesMarginal and Conditional d.f.s and p.d.f.s
For the case of a two-dimensional r. vector, a result analogous to Theorem 1 can be established. So consider the case that k = 2. We then have X = (X1, X2) and the d.f. F(or FX or FX1,X2) of X, or the joint distribution function of X1, X2, is F(x1, x2) = P(X1 x1, X2 x2). Then the following theorem holds true. With the above notation we have
THEOREM 4
i) 0 F(x1, x2) 1, x1, x2 . ii) The variation of F over rectangles with sides parallel to the axes, given in Fig. 4.2, is 0. iii) F is continuous from the right with respect to each of the coordinates x1, x2, or both of them jointly.
92
y y2
(x1, y 2)
(x1, y 1) x1
(x2, y 2)
Figure 4.2 The variation V of F over the rectangle is: F(x1, y1) + F(x2, y2) F(x1, y2) F(x2, y1)
y1 0
(x2, y 1)
x2
iv) If both x1, x2, , then F(x1, x2) 1, and if at least one of the x1, x2 , then F(x1, x2) 0. We express this by writing F(, ) = 1, F(, x2) = F(x1, ) = F(, ) = 0, where < x1, x2 < .
PROOF
i) Obvious. ii) V = P(x1 < X1 x2, y1 < X2 y2) and is hence, clearly, 0. iii) Same as in Theorem 3. (If x = (x1, x2), and zn = (x1n, x2n), then zn x means x1n x1, x2n x2). iv) If x1, x2 , then (, x1] (, x2] R 2, so that F(x1, x2) P(S ) = 1. If at least one of x1, x2 goes () to , then (, x1] (, x2] , hence
F x1 , x 2 P = 0.
REMARK 3
( )
The function F(x1, ) = F1(x1) is the d.f. of the random variable X1. In fact, F(x1, ) = F1(x1) is the d.f. of the random variable X1. In fact, F x1 , = lim P X1 x1 , X 2 x n
x n
= P X1 x1 , < X 2 < = P X1 x1 = F1 x1 . Similarly F(, x2) = F2(x2) is the d.f. of the random variable X2. F1, F2 are called marginal d.f.s.
REMARK 4
( )
It should be pointed out here that results like those discussed in parts (i)(iv) in Remark 1 still hold true here (appropriately interpreted). In particular, part (iv) says that F(x1, x2) has second order partial derivatives and
2 F x1 , x 2 = f x1 , x 2 x1x 2
) (
at continuity points of f. For k > 2, we have a theorem strictly analogous to Theorems 3 and 6 and also remarks such as Remark 1(i)(iv) following Theorem 3. In particular, the analog of (iv) says that F(x1, . . . , xk) has kth order partial derivatives and
4.2
93
k F x1 , , xk = f x1 , , xk x1x2 xk
) (
)
at continuity points of f, where F, or FX, or FX1, , Xk, is the d.f. of X, or the joint distribution function of X1, . . . , Xk. As in the two-dimensional case,
F , , , x j , , , = F j x j
( )
is the d.f. of the random variable Xj, and if m xjs are replaced by (1 < m < k), then the resulting function is the joint d.f. of the random variables corresponding to the remaining (k m) Xjs. All these d.f.s are called marginal distribution functions. In Statement 2, we have seen that if X = (X1, . . . , Xk) is an r. vector, then Xj, j = 1, 2, . . . , k are r.v.s and vice versa. Then the p.d.f. of X, f(x) = f(x1, . . . , xk), is also called the joint p.d.f. of the r.v.s X1, . . . , Xk. Consider rst the case k = 2; that is, X = (X1, X2), f(x) = f(x1, x2) and set f x1 , x 2 f1 x1 = x f x1 , x 2 dx 2 f x1 , x 2 f2 x 2 = x f x1 , x 2 dx1 .
( )
( )
( (
) )
Then f1, f2 are p.d.f.s. In fact, f1(x1) 0 and
f ( x ) = f ( x , x ) = 1,
1 1 1 2 x1 x1 x2
or
f1 (x1 )dx1 = f (x1 , x 2 )dx1 dx 2 = 1.

Similarly we get the result for f2. Furthermore, f1 is the p.d.f. of X1, and f2 is the p.d.f. of X2. In fact,
f x1 , x2 = f x1 , x2 = f1 x1 x B x x B P X 1 B = x B , x f x1 , x2 dx1dx2 = f x1 , x2 dx2 dx1 = f1 x1 dx1 . B B B
( )
( )
Similarly f2 is the p.d.f. of the r.v. X2. We call f1, f2 the marginal p.d.f.s. Now suppose f1(x1) > 0. Then dene f(x2|x1) as follows:
f x 2 x1 =
f x,x ) (f (x ) ) .
1 2 1 1
94
This is considered as a function of x2, x1 being an arbitrary, but xed, value of X1 ( f1(x1) > 0). Then f (|x1) is a p.d.f. In fact, f (x2|x1) 0 and
f ( x 2 x1 ) =
x2
1 f1 x1 1
( )
f ( x1 , x 2 ) =
x2
1 f1 x1 = 1, f1 x1
( )
( )
f ( x 2 x1 )dx 2 = f ( x ) f ( x1 , x 2 )dx 2 = f ( x ) f1 ( x1 ) = 1. 1 1 1 1
1
In a similar fashion, if f2(x2) > 0, we dene f (x1|x2) by:

f x1 x 2 =
f x, x ) (f (x ) )
1 2 2 2
and show that f (|x2) is a p.d.f. Furthermore, if X1, X2 are both discrete, the f(x2|x1) has the following interpretation:
f x 2 x1 =
f x,x P X =x, X =x ) (f (x ) ) = ( P(X = x ) ) = P(X

1 2 1 1 2 2 1 1 1 1
2
= x 2 X1 = x1 .
Hence P(X2 B|X1 = x1) = x B f (x2|x1). For this reason, we call f (|x2) the conditional p.d.f. of X2, given that X1 = x1 (provided f1(x1) > 0). For a similar reason, we call f (|x2) the conditional p.d.f. of X1, given that X2 = x2 (provided f2(x2) > 0). For the case that the p.d.f.s f and f2 are of the continuous type, the conditional p.d.f. f (x1|x2) may be given an interpretation similar to the one given above. By assuming (without loss of generality) that h1, h2 > 0, one has
(1 h )P(x < X x + h x < X x + h ) (1 h h )P(x < X x + h , x < X x + h ) = (1 h )P(x < X x + h ) (1 h h )[F (x , x ) + F (x + h , x + h ) F (x , x + h ) F (x = (1 h )[F (x + h ) F (x )]
1 1 1 1 1 2 2 2 2 1 2 1 1 1 1 2 2 2 2 2 2 2 2 2 1 2 1 2 1 1 2 2 1 2 2 2 2 2 2 2 2
+ h1 , x 2
)]
where F is the joint d.f. of X1, X2 and F2 is the d.f. of X2. By letting h1, h2 0 and assuming that (x1, x2) and x2 are continuity points of f and f2, respectively, the last expression on the right-hand side above tends to f(x1, x2)/f2(x2) which was denoted by f(x1|x2). Thus for small h1, h2, h1 f (x1|x2) is approximately equal to P(x1 < X1 x1 + h1|x2 < X2 x2 + h2), so that h1 f (x1|x2) is approximately the conditional probability that X1 lies in a small neighborhood (of length h1) of x1, given that X2 lies in a small neighborhood of x2. A similar interpretation may be given to f(x2|x1). We can also dene the conditional d.f. of X2, given X1 = x1, by means of
4.2
95
f x x 2 1 F x2 x1 = x x x f x x dx , 2 1 2
and similarly for F(x1|x2). The concepts introduced thus far generalize in a straightforward way for k > 2. Thus if X = (X1, . . . , Xk) with p.d.f. f (x1, . . . , xk), then we have called f(x1, . . . , xk) the joint p.d.f. of the r.v.s X1, X2, . . . , Xk. If we sum (integrate) over t of the variables x1, . . . , xk keeping the remaining s xed (t + s = k), the resulting function is the joint p.d.f. of the r.v.s corresponding to the remaining s variables; that is,
fi , , i xi , , xi
1 s 1
f x1 , , xk x , , x = f x , 1 , xk dx j dx j .
j1 jt
There are
k k k k + + + =2 2 1 2 k 1
such p.d.f.s which are also called marginal p.d.f.s. Also if xi1, . . . , xis are such that fi1, . . . , it (xi1, . . . , xis) > 0, then the function (of xj1, . . . , xjt) dened by
f x j , , x j xi , , xi =
1 t 1 s
f x1 , , xk fi , , i xi , , xi
1 s
is a p.d.f. called the joint conditional p.d.f. of the r.v.s Xj1, . . . , Xjt, given Xi1 = xi1, , Xjs = xjs, or just given Xi1, . . . , Xis. Again there are 2k 2 joint conditional p.d.f.s involving all k r.v.s X1, . . . , Xk. Conditional distribution functions are dened in a way similar to the one for k = 2. Thus
F x j , , x j xi , , xi
1 t 1
j j i i = ( x , , x )( x , , x x x f x , j , x j x i , , x i dx j dx j .
1 t 1 s j1 jt j1 jt j1 jt
) f (x , , x x , , x ) )
t t 1 s
We now present two examples of marginal and conditional p.d.f.s, one taken from a discrete distribution and the other taken from a continuous distribution.
EXAMPLE 1
Let the r.v.s X1, . . . , Xk have the Multinomial distribution with parameters n and p1, . . . , pk. Also, let s and t be integers such that 1 s, t < k and s + t = k. Then in the notation employed above, we have:
96
ii)
fi , , i xi , , xi =
1 s 1 s
n! x x pi pi q n r , xi ! xi ! n r !
q = 1 pi + + pi , r = xi + + xi ;
1 s 1 s
i1
is
that is, the r.v.s Xi1, . . . , Xis and Y = n (Xi1 + + Xis) have the Multinomial distribution with parameters n and pi1, . . . , pis, q. ii)
f x j1 , , x jt xi1 , , xi s
p j1 = x j1 ! x jt ! q
(n r )!
x j1
pj t 1 , q
xj
r = xi1 + + xi s ;
that is, the (joint) conditional distribution of Xj1, . . . , Xjt given Xi1, . . . , Xis is Multinomial with parameters n r and pj1/q, . . . , pjt/q.
DISCUSSION
i) Clearly,
(X
i1
= xi , , X i = xi X i + + X i = r = n Y = r = Y = n r ,
1 s s 1 s
) (
) (
) (
so that
(X
i1
= xi , , X i = xi = X i = xi , , X i = xi , Y = n r .
1 s s 1 1 s s
) (
Denoting by O the outcome which is the grouping of all n outcomes distinct from those designated by i1, . . . , is , we have that the probability of O is q, and the number of its occurrences is Y. Thus, the r.v.s Xi1, . . . , Xis and Y are distributed as asserted. ii) We have
f x j1 , , x jt xi1 , , xi s = n! x1 xk p1 = pk x1! xk !
, x ,x , ,x f x , ,x f x, ) ( f ( x , , x ) ) = f ((x , , x ))
j1 jt i1 is 1 k i1 is i1 is
n! x x pi1i1 pi si s q n r x ! x ! nr ! is i1
p p p p i is j1 jt = 1 xi1 ! xi s ! x j1 ! x jt !
xi1 xi s x j1
x jt
p j1 x j1 ! x jt ! q
(n r )!
(since n r = n ( x
x jt
p p q i is 1 xi ! xi ! n r ! 1 s
xi1 xi s x j1 + + x jt
i1
+ + xi s = x j1 + + x jt
x j1
pj t , q
EXAMPLE 2
as was to be seen. Let the r.v.s X1 and X2 have the Bivariate Normal distribution, and recall that their (joint) p.d.f. is given by:
97
f x1 , x2 =
1 2 1 2 1 2 1 exp 2 1 2
2 x 2 x1 1 x2 2 x2 2 1 1 + 2 . 1 1 2 2
2 We saw that the marginal p.d.f.s f1, f2 are N(1, 2 1), N(2, 2), respectively; that is, X1, X2 are also normally distributed. Furthermore, in the process of proving that f(x1, x2) is a p.d.f., we rewrote it as follows:
f x1 , x 2 =
1 2 1 2
x 1 1 exp 2 2 1 1 2
2 x b 2 exp , 2 2 2 2 1
where
b = 2 +
Hence
2 x1 1 . 1
f x 2 x1 =
f x1 , x 2 f1 x1
( )
)=
1 2 2
2 x2 b exp 2 2 1 2 2 2 1
2 which is the p.d.f. of an N(b, 2 2(1 )) r.v. Similarly f(x1|x2) is seen to be the 2 2 p.d.f. of an N(b, 1(1 )) r.v., where
b = 1 +
1 x2 2 . 2
Exercises
4.2.1 Refer to Exercise 3.2.17 in Chapter 3 and: i) Find the marginal p.d.f.s of the r.v.s Xj, j = 1, , 6; ii) Calculate the probability that X1 5. 4.2.2 Refer to Exercise 3.2.18 in Chapter 3 and determine: ii) The marginal p.d.f. of each one of X1, X2, X3; ii) The conditional p.d.f. of X1, X2, given X3; X1, X3, given X2; X2, X3, given X1 ;
98
iii) The conditional p.d.f. of X1, given X2, X3; X2, given X3, X1; X3, given X1, X2 . If n = 20, provide expressions for the following probabilities: iv) P(3X1 + X2 5); v) P(X1 < X2 < X3); vi) P(X1 + X2 = 10|X3 = 5); vii) P(3 X1 10|X2 = X3); viii) P(X1 < 3X2|X1 > X3). 4.2.3 Let X, Y be r.v.s jointly distributed with p.d.f. f given by f(x, y) = 2/c2 if 0 x y, 0 y c and 0 otherwise. i) Determine the constant c; ii) Find the marginal p.d.f.s of X and Y; iii) Find the conditional p.d.f. of X, given Y, and the conditional p.d.f. of Y, given X; iv) Calculate the probability that X 1. 4.2.4 Let the r.v.s X, Y be jointly distributed with p.d.f. f given by f(x, y) = exy I(0,)(0,) (x, y). Compute the following probabilities: i) P(X x); ii) P(Y y); iii) P(X < Y); iv) P(X + Y 3). 4.2.5 If the joint p.d.f. f of the r.v.s Xj, j = 1, 2, 3, is given by
f x1 , x 2 , x3 = c 3 e
c x1 + x2 + x 3
I A x1 , x 2 , x3 ,
where
A = 0, 0, 0, ,
i) Determine the constant c; ii) Find the marginal p.d.f. of each one of the r.v.s Xj, j = 1, 2, 3; iii) Find the conditional (joint) p.d.f. of X1, X2, given X3, and the conditional p.d.f. of X1, given X2, X3; iv) Find the conditional d.f.s corresponding to the conditional p.d.f.s in (iii). 4.2.6 Consider the function given below:
) (
) (
yx e y , f x y = x! 0,
( )
x = 0, 1, ; y 0 otherwise.
4.3 4.1 Quantiles The Cumulative and Modes Distribution of a Distribution Function
99
i) Show that for each xed y, f (|y) is a p.d.f., the conditional p.d.f. of an r.v. X, given that another r.v. Y equals y; ii) If the marginal p.d.f. of Y is Negative Exponential with parameter = 1, what is the joint p.d.f. of X, Y? )x+1 IA(x), where iii) Show that the marginal p.d.f. of X is given by f (x) = ( 1 2 A = {0, 1, 2, . . . }. 4.2.7 Let Y be an r.v. distributed as P() and suppose that the conditional distribution of the r.v. X, given Y = n, is B(n, p). Determine the p.d.f. of X and the conditional p.d.f. of Y, given X = x. 4.2.8 Consider the function f dened as follows:
f x1 , x 2 =
2 2 x1 + x2 1 1 3 3 exp x1 x 2 I [ 1, 1][ 1, 1] x1 , x 2 + 2 2 4e
and show that: i) f is a non-Normal Bivariate p.d.f. ii) Both marginal p.d.f.s
f1 x1 = f x1 , x 2 dx 2
( )
and
f2 x 2 = f x1 , x 2 dx1
( )
are Normal p.d.f.s.
4.3 Quantiles and Modes of a Distribution

Let X be an r.v. with d.f. F and consider a number p such that 0 < p < 1. A pth quantile of the r.v. X, or of its d.f. F, is a number denoted by xp and having the following property: P(X xp) p and P(X xp) 1 p. For p = 0.25 we get a quartile of X, or its d.f., and for p = 0.5 we get a median of X, or its d.f. For illustrative purposes, consider the following simple examples.
EXAMPLE 3
Let X be an r.v. distributed as U(0, 1) and let p = 0.10, 0.20, 0.30, 0.40, 0.50, 0.60, 0.70, 0.80 and 0.90. Determine the respective x0.10, x0.20, x0.30, x0.40, x0.50, x0.60, x0.70, x0.80, and x0.90. Since for 0 x 1, F(x) = x, we get: x0.10 = 0.10, x0.20 = 0.20, x0.30 = 0.30, x0.40 = 0.40, x0.50 = 0.50, x0.60 = 0.60, x0.70 = 0.70, x0.80 = 0.80, and x0.90 = 0.90. Let X be an r.v. distributed as N(0, 1) and let p = 0.10, 0.20, 0.30, 0.40, 0.50, 0.60, 0.70, 0.80 and 0.90. Determine the respective x0.10, x0.20, x0.30, x0.40, x0.50, x0.60, x0.70, x0.80, and x0.90.
EXAMPLE 4
100
Typical cases: F(x) 1 F(x) p
p xp 0 (a) F(x) p x 0 [ xp ] (b) x
0 F(x) 1 p (c)
xp
x F(x) 1 p
0 (d)
xp
[ xp
] (e)
Figure 4.3 Observe that the gures demonstrate that, as dened, xp need not be unique.
From the Normal Tables (Table 3 in Appendix III), by linear interpolation and symmetry, we nd: x0.10 = 1.282, x0.20 = 0.842, x0.30 = 0.524, x0.40 = 0.253, x0.50 = 0, x0.60 = 0.253, x0.70 = 0.524, x0.80 = 0.842, and x0.90 = 1.282. Knowledge of quantiles xp for several values of p provides an indication as to how the unit probability mass is distributed over the real line. In Fig. 4.3 various cases are demonstrated for determining graphically the pth quantile of a d.f. Let X be an r.v. with a p.d.f. f. Then a mode of f, if it exists, is any number which maximizes f(x). In case f is a p.d.f. which is twice differentiable, a mode can be found by differentiation. This process breaks down in the discrete cases. The following theorems answer the question for two important discrete cases.
4.3 4.1 Quantiles The Cumulative and Modes Distribution of a Distribution Function
101
THEOREM 5
Let X be B(n, p); that is,
n f x = px qn x , x
()
0 < p < 1, q = 1 p, x = 0, 1, , n.
Consider the number (n + 1)p and set m = [(n + 1)p], where [y] denotes the largest integer which is y. Then if (n + 1)p is not an integer, f(x) has a unique mode at x = m. If (n + 1)p is an integer, then f(x) has two modes obtained for x = m and x = m 1.
PROOF
For x 1, we have
n x n x p q x = f x1 n x 1 n x +1 p q x 1 f x
()
n! p x q n x x! n x !
(
That is,
n! p x 1 q n x +1 x 1! nx +1!
)(
nx +1 p . x q
f x
f x1
()
nx +1 p . x q
Hence f (x) > f (x 1) ( f is increasing) if and only if
(n x + 1) p > x(1 p),
or
np xp + p > x xp, or
(n + 1) p > x.
Thus if (n + 1)p is not an integer, f (x) keeps increasing for x m and then decreases so the maximum occurs at x = m. If (n + 1)p is an integer, then the maximum occurs at x = (n + 1)p, where f (x) = f (x 1) (from above calculations). Thus
x = n+1 p1
is a second point which gives the maximum value.

THEOREM 6
Let X be P(); that is,
x , x = 0, 1, 2, , > 0. x! Then if is not an integer, f(x) has a unique mode at x = []. If is an integer, then f(x) has two modes obtained for x = and x = 1.
f x = e
()
PROOF
For x 1, we have
102
f x
f x1
()
e x x! e
x 1
[ (x 1)!]
. x
Hence f (x) > f (x 1) if and only if > x. Thus if is not an integer, f (x) keeps increasing for x [] and then decreases. Then the maximum of f (x) occurs at x = []. If is an integer, then the maximum occurs at x = . But in this case f (x) = f (x 1) which implies that x = 1 is a second point which gives the maximum value to the p.d.f.
Exercises
4.3.1 Determine the pth quantile xp for each one of the p.d.f.s given in Exercises 3.2.1315, 3.3.1316 (Exercise 3.2.14 for = 1 ) in Chapter 3 if p = 4 0.75, 0.50. 4.3.2 Let X be an r.v. with p.d.f. f symmetric about a constant c (that is, f(c x) = f (c + x) for all x ) . Then show that c is a median of f. 4.3.3 Draw four graphstwo each for B(n, p) and P()which represent the possible occurrences for modes of the distributions B(n, p) and P(). 4.3.4 Consider the same p.d.f.s mentioned in Exercise 4.3.1 from the point of view of a mode.
4.4* Justication of Statements 1 and 2

In this section, a rigorous justication of Statements 1 and 2 made in Section 4.1 will be presented. For this purpose, some preliminary concepts and results are needed and will be also discussed.
DEFINITION 1
A set G in is called open if for every x in G there exists an open interval containing x and contained in G. Without loss of generality, such intervals may be taken to be centered at x. It follows from this denition that an open interval is an open set, the entire real line is an open set, and so is the empty set (in a vacuous manner).
LEMMA 1
Every open set in is measurable.

PROOF Let G be an open set in , and for each x G, consider an open interval centered at x and contained in G. Clearly, the union over x, as x varies in G, of such intervals is equal to G. The same is true if we consider only those intervals corresponding to all rationals x in G. These intervals are countably many and each one of them is measurable; then so is their union.
4.1 4.4* The Justication Cumulativeof Distribution Statements Function 1 and 2
103
DEFINITION 2
A set G in m, m 1, is called open if for every x in G there exists an open cube in m containing x and contained in G; by the term open cube we mean the Cartesian product of m open intervals of equal length. Without loss of generality, such cubes may be taken to be centered at x. Every open set in n is measurable. It is analogous to that of Lemma 1. Indeed, let G be an open set in m, and for each x G, consider an open cube centered at x and contained in G. The union over x, as x varies in G, of such cubes clearly is equal to G. The same is true if we restrict ourselves to xs in G whose m coordinates are rationals. Then the resulting cubes are countably many, and therefore their union is measurable, since so is each cube.
PROOF
LEMMA 2
DEFINITION 3
Recall that a function g: S is said to be continuous at x0 S if for every > 0 there exists a = (, x0) > 0 such that |x x0| < implies |g(x) g(x0)| < . The function g is continuous in S if it is continuous for every x S. It follows from the concept of continuity that 0 implies 0.
LEMMA 3
Let g: be continuous. Then g is measurable. By Theorem 5 in Chapter 1 it sufces to show that g1(G) are measurable sets for all open intevals G in . Set B = g1(G). Thus if B = , the assertion is valid, so let B and let x0 be an arbitrary point of B, so that g(x0) G. Continuity of g at x0 implies that for every > 0 there exists = (, x0) > 0 such that |x x0| < implies |g(x) g(x0)| < . Equivalently, x (x0 , x0 + ) implies g(x) (g(x0) , g(x0) + ). Since g(x0) G and G is open, by choosing sufciently small, we can make so small that (g(x0) , g(x0) + ) is contained in G. Thus, for such a choice of and , x (x0 , x0 + ) implies that (g(x0) , g(x0) + ) G. But B(= g1(G)) is the set of all x for which g(x) G. As all x (x0 , x0 + ) have this property, it follows that (x0 , x0 + ) B. Since x0 is arbitrary in B, it follows that B is open. Then by Lemma 1, it is measurable.
PROOF
The concept of continuity generalizes, of course, to Euclidean spaces of higher dimensions, and then a result analogous to the one in Lemma 3 also holds true.
DEFINITION 4
A function g : S k m (k, m 1) is said to be continuous at x0 k if for every > 0 there exists a = (, x0) > 0 such that ||x x0|| < implies ||g(x) g(x0)|| < . The function g is continuous in S if it is continuous for every x S. Here ||x|| stands for the usual norm in k; i.e., for x = (x1, . . . , xk), ||x|| = 12 (ik=1 xi2 ) , and similarly for the other quantities. Once again, from the concept of continuity it follows that 0 implies 0.
LEMMA 4
Let g: k m be continuous. Then g is measurable.
104
The proof is similar to that of Lemma 3. The details are presented here for the sake of completeness. Once again, it sufces to show that g1(G) are measurable sets for all open cubes G in m. Set B = g1(G). If B = the assertion is true, and therefore suppose that B and let x0 be an arbitrary point of B. Continuity of g at x0 implies that for every > 0 there exists a = (, x0) > 0 such that ||x x0|| < implies ||g(x) g(x0)|| < ; equivalently, x S(x0, ) implies g(x) S(g(x0), ), where S(c, r) stands for the open sphere with center c and radius r. Since g(x0) G and G is open, we can choose so small that the corresponding is sufciently small to imply that g(x) S(g(x0), ). Thus, for such a choice of and , x S(x0, ) implies that g(x) S(g(x0), ). Since B(= g1(G)) is the set of all x k for which g(x) G, and x S(x0, ) implies that g(x) S(g(x0), ), it follows that S(x0, ) B. At this point, observe that it is clear that there is a cube containing x0 and contained in S(x0, ); call it C(x0, ). Then C(x0, ) B, and therefore B is open. By Lemma 2, it is also measurable. We may now proceed with the justication of Statement 1.
PROOF THEOREM 7
Let X : (S, A) ( k, B k) be a random vector, and let g : ( k, B k) ( m, Bm) be measurable. Then g(X): (S, A) ( m, Bm) and is a random vector. (That is, measurable functions of random vectors are random vectors.)
PROOF
To prove that [g(X)]1(B) A if B B m, we have
[g(X)] (B) = X [g (B)] = X (B ),

1 1 1 1 1
1
where B1 = g 1 B B k
( )
by the measurability of g. Also, X (B1) A since X is measurable. The proof is completed. To this theorem, we have the following
COROLLARY
Let X be as above and g be continuous. Then g(X) is a random vector. (That is, continuous functions of random vectors are random vectors.)
PROOF The continuity of g implies its measurability by Lemma 3, and therefore the theorem applies and gives the result.
DEFINITION 5
For j = 1, . . . , k, the jth projection function gj is dened by: gj: k and gj(x) = gj(x1, . . . , xk) = xj. It so happens that projection functions are continuous; that is, The coordinate functions gj, j = 1, . . . , k, as dened above, are continuous. For an arbitrary point x0 in K, consider x K such that ||x x0|| < 2 k for some > 0. This is equivalent to ||x x0||2 < 2 or j =1 ( x j x ) < 2 which implies that (xj x0j)2 < 2 for j = 1, . . . , k, or |xj x0j| < , j = 1, . . . , k. This last expression is equivalent to |gj(x) gj(x0)| < , j = 1, . . . , k. Thus the denition of continuity of gj is satised here for = . Now consider a k-dimensional function X dened on the sample space S. Then X may be written as X = (X1, . . . , Xk), where Xj, j = 1, . . . , k are realvalued functions. The question then arises as to how X and Xj, j = 1, . . . , k are
PROOF
0j
LEMMA 5
105
related from a measurability point of view. To this effect, we have the following result.
THEOREM 8
Let X = (X1, . . . , Xk) : (S, A) ( k, B k). Then X is an r. vector if and only if Xj, j = 1, . . . , k are r.v.s. Suppose X is an r. vector and let gj, j = 1, . . . , k be the coordinate functions dened on k. Then gjs are continuous by Lemma 5 and therefore measurable by Lemma 4. Then for each j = 1, . . . , k, gj(X) = gj(X1, . . . , Xk) = Xj is measurable and hence an r.v. Next, assume that Xj, j = 1, . . . , k are r.v.s. To show that X is an r. vector, by special case 3 in Section 2 of Chapter 1, it sufces to show that X1(B) A for each B = (, x1] (, xk], x1, . . . , xk . Indeed,
PROOF
X 1 ( B) = (X B) = ( X j ( , x j ], j = 1, , k ) = I X j1 (( , x j ]) A .
j =1
The proof is completed.
Exercises
4.4.1 If X and Y are functions dened on the sample space S into the real line , show that:
{s S ; X (s) + Y (s) < x} = U [{s S ; X (s) < r} {s S ; Y (s) < x r}],

r Q
where Q is the set of rationals in . 4.4.2 Use Exercise 4.4.1 in order to show that, if X and Y are r.v.s, then so is the function X + Y. 4.4.3 ii) If X is an r.v., then show that so is the function X. ii) Use part (i) and Exercise 4.4.2 to show that, if X and Y are r.v.s, then so is the function X Y. 4.4.4 ii) If X is an r.v., then show that so is the function X 2. 1 ii) Use the identity: XY = 2 (X + Y)2 1 (X 2 + Y 2) in conjunction with part (i) 2 and Exercises 4.4.2 and 4.4.3(ii) to show that, if X and Y are r.v.s, then so is the function XY.
4.4.5 ii) If X is an r.v., then show that so is the function
1 X
, provided X 0.
ii) Use part (i) in conjunction with Exercise 4.4.4(ii) to show that, if X and Y , provided Y 0. are r.v.s, then so is the function X Y
106
Moments of Random VariablesSome Moment and Probability Inequalities
Chapter 5
5.1 Moments of Random Variables

In the denitions to be given shortly, the following remark will prove useful. We say that the (innite) series xh(x), where x = (x1, . . . , xk) varies over a discrete set in k, k 1, converges absolutely if x|h(x)| < . Also we say that the integral h x1 , , xk dx1 dxk converges absolutely if
REMARK 1
h( x1 , x2 , , xk ) dx1 dx2 dxk < .

In what follows, when we write (innite) series or integrals it will always be assumed that they converge absolutely. In this case, we say that the moments to be dened below exist. Let X = (X1, . . . , Xk) be an r. vector with p.d.f. f and consider the (measurable) function g: k , so that g(X) = g(X1, . . . , Xk) is an r.v. Then we give the
DEFINITION 1
iii) For n = 1, 2, . . . , the nth moment of g(X) is denoted by E[g(X)]n and is dened by: n g x f x , x = x1 , , xk n E g X = x n g x , f x1 , , xk dx1 dxk . 1 , xk For n = 1, we get
[ ( )]
[ ( )] ( ) [(
()() (
)] (
g x f x E g X = x g x1 , , xk f x1 , , xk dx1 dxk
[ ( )]
)(
106
107
and call it the mathematical expectation or mean value or just mean of g(X). Another notation for E[g(X)] which is often used is g(X), or [g(X)], or just , if no confusion is possible. iii) For r > 0, the rth absolute moment of g(X) is denoted by E|g(X)|r and is dened by:
Eg X
( )
r g x f x , x = x1 , , xk x = r g x , f x1 , , xk dx1 dxk . 1 , xk
() () (
) (
iii) For an arbitrary constant c, and n and r as above, the nth moment and rth absolute moment of g(X) about c are denoted by E[g(X) c]n, E|g(X) c|r, respectively, and are dened as follows:
E g X c
[( ) ]
( )
n g x c f x , x = x1 , , xk = x n g x , 1 , xk c f x1 , , xk dx1 dxk ,
[() ] () ( ) ] ( [(
() () ( ( ) (
and
r g x c f x , x = x1 , , xk x Eg X c = r g x , 1 , xk c f x1 , , xk dx1 dxk . r
For c = E[g(X)], the moments are called central moments. The 2nd central moment of g(X), that is,
E g X E g X
{(
= x g x , 1 , xk Eg X
) [ ( )]} g x Eg(X )] f ( x), [ ( )

2 2
x = x1 , , xk
2 1
dxk
[(
( )] f ( x , , x )dx
k
2 is called the variance of g(X) and is also denoted by 2[g(X)], or g ( X ), or just 2 2 , if no confusion is possible. The quantity + [ g(X )] = [ g(X )] is called the standard deviation (s.d.) of g(X) and is also denoted by g(X), or just , if no confusion is possible. The variance of an r.v. is referred to as the moment of inertia in Mechanics.
5.1.1 Important Special Cases

n n 1. Let g(X1, . . . , Xk) = X 1 X k , where nj 0 are integers. Then n E( X 1n X k ) is called the (n1, . . . , nk)-joint moment of X1, . . . , Xk. In particular, for n1 = = nj1 = nj+1 = = nk = 0, nj = n, we get
1 k 1 k
108
E X
( )
n j
x n xn j f x = j f x1 , , xk x x , ,x ) ( = xn f x , 1 , xk dx1 dxk j x n j fj xj x = x n f x dx j j j j
1 k
()
( )
( )
which is the nth moment of the r.v. Xj. Thus the nth moment of an r.v. X with p.d.f. f is
E Xn
( )
x n f x = x x n f x dx.
()
()
For n = 1, we get
xf x E X = x xf x dx
( )
()
()
which is the mathematical expectation or mean value or just mean of X. This quantity is also denoted by X or (X) or just when no confusion is possible. The quantity X can be interpreted as follows: It follows from the denition that if X is a discrete uniform r.v., then X is just the arithmetic average of the possible outcomes of X. Also, if one recalls from physics or elementary calculus the denition of center of gravity and its physical interpretation as the point of balance of the distributed mass, the interpretation of X as the mean or expected value of the random variable is the natural one, provided the probability distribution of X is interpreted as the unit mass distribution. In Denition 1, suppose X is a continuous r.v. Then E[g(X)] = g( x)f ( x)dx. On the other hand, from the last expression above, E(X) = xf ( x)dx. There seems to be a discrepancy between these two denitions. More specically, in the denition of E[g(X)], one would expect to use the p.d.f. of g(X) rather than that of X. Actually, the denition of E[g(X)], as given, is correct and its justication is roughly as follows: Consider E[g(x)] = g( x)f ( x)dx and set y = g(x). Suppose that g is differentiable and has an inverse g1, and that some further conditions are met. Then
REMARK 2
1 1 g( x) f ( x)dx = yf [g ( y)] dy g ( y) dy.
109
d On the other hand, if fY is the p.d.f. of Y, then fY ( y) = f [ g 1 ( y)] dy g 1 ( y) . Therefore the last integral above is equal to yfY ( y)dy, which is consonant with the denition of E ( X ) = xf ( x) dx. (A justication of the above derivations is given in Theorem 2 of Chapter 9.) n 2. For g as above, that is, g(X1, . . . , Xk) = X 1n X k and n1 = = nj1 = nj+1 = = nk = 0, nj = 1, and c = E(Xj), we get
1 k
E X j EX j
n x j EX j f x , x = x1 , , xk = x x EX n f x , 1 , xk dx1 dxk j j n x j EX j f j x j = xj x EX n f x dx j j j j j
( (
) ()
) ( ) ( ) ) ( )
which is the nth central moment of the r.v. Xj (or the nth moment of Xj about its mean). Thus the nth central moment of an r.v. X with p.d.f. f and mean is E X EX
=E X
x EX = x x EX
) f (x) = (x ) f (x)
n n x
) f (x)dx = (x ) f (x)dx.
n n
2 In particular, for n = 2 the 2nd central moment of X is denoted by X or 2(X) 2 or just when no confusion is possible, and is called the variance of X. Its positive square root X or (X) or just is called the standard deviation (s.d.) of X. 2 As in the case of X, X has a physical interpretation also. Its denition corresponds to that of the second moment, or moment of inertia. One recalls that a large moment of inertia means the mass of the body is spread widely about its center of gravity. Likewise a large variance corresponds to a probability distribution which is not well concentrated about its mean value. 3. For g(X1, . . . , Xk) = (X1 EX1)n (Xk EXk)n , the quantity
1 k
n n E X1 EX1 X k EX k is the (n1, . . . , nk)-central joint moment of X1, . . . , Xk or the (n1, . . . , nk)-joint moment of X1, . . . , Xk about their means.
1 k
4. For g(X1, . . . , Xk) = Xj(Xj 1) (Xj n + 1), j = 1, . . . , k, the quantity

x j x j 1 x j n + 1 f j x j x E Xj Xj 1 Xj n+1 = x x 1 x n + 1 f x dx j j j j j j
[ (
)]
) ( )
) ( )
110
is the nth factorial moment of the r.v. Xj. Thus the nth factorial moment of an r.v. X with p.d.f. f is
x x 1 x n + 1 f x E X X 1 X n+1 = x x x 1 x n + 1 f x dx.
[ (
)]
)()
)()
5.1.2
Basic Properties of the Expectation of an R.V.
From the very denition of E[g(X)], the following properties are immediate. (E1) E(c) = c, where c is a constant. (E2) E[cg(X)] = cE[g(X)], and, in particular, E(cX) = cE(X) if X is an r.v. (E3) E[g(X) + d] = E[g(X)] + d, where d is a constant. In particular, E(X + d) = E(X) + d if X is an r.v. (E4) Combining (E2) and (E3), we get E[cg(X) + d] = cE[g(X)] + d, and, in particular, E(cX + d) = cE(X) + d if X is an r.v. n (E4) E n j = 1 cj g j X = j = 1 cj E g j X .
( )]
[ ( )]
(
In fact, for example, in the continuous case, we have
n n E c j g j X = c j g j x1 , , xk f x1 , , xk dx1 dxk j =1 j =1
( )
) (
= c j g j x1 , , xk f x1 , , xk dx1 dxk
j =1 n
)(
= cjE gj X .
j =1
[ ( )]
The discrete case follows similarly. In particular, (E4) E ( jn= 1 c j X j ) = jn= 1 c j E ( X j ). (E5) If X 0, then E(X) 0. Consequently, by means of (E5) and (E4), we get that (E5) If X Y, then E(X) E(Y), where X and Y are r.v.s (with nite expectations). (E6) |E[g(X)]| E|g(X)|. (E7) If E|X|r < for some r > 0, where X is an r.v., then E|X|r< for all 0 < r < r. This is a consequence of the obvious inequality |X|r 1 + |X|r and (E5). Furthermore, since of n = 1, 2, . . . , we have |Xn| = |X|n, by means of (E6), it follows that
5.1 Moments of Random Exercises Variables
111
(E7) If E(Xn) exists (that is, E|X|n < ) for some n = 2, 3, . . . , then E(Xn) also exists for all n = 1, 2, . . . with n < n.
5.1.3 Basic Properties of the Variance of an R.V.

Regarding the variance, the following properties are easily established by means of the denition of the variance. (V1) 2(c) = 0, where c is a constant. (V2) 2[cg(X)] = c2 2[g(X)], and, in particular, 2(cX) = c2 2(X), if X is an r.v. (V3) 2[g(X) + d] = 2[g(X)], where d is a constant. In particular, 2(X + d) = 2(X), if X is an r.v. In fact,
2 g X +d = E g X +d E g X +d
2 2
[( ) ]
{[ ( ) ] [ ( ) ]} = E[ g( X) Eg( X)] = [ g( X)].

2
(V4) Combining (V2) and (V3), we get 2[cg(X) + d] = c2 2[g(X)], and, in particular, 2(cX + d) = c2 2(X), if X is an r.v. (V5) 2[g(X)] = E[g(X)]2 [Eg(X)]2, and, in particular, (V5) 2(X) = E(X 2) (EX)2, if X is an r.v. In fact,
2 g X = E g X Eg X
2
[ g( X)] 2 g( X)Eg( X) + [ Eg( X)] [ ( )] [ ( ) ( )] = E = E[ g( X)] 2[ Eg( X)] + [ Eg( X)] = E[ g( X)] [ Eg( X)] ,
2 2 2 2 2 2 2
the equality before the last one being true because of (E4). (V6) 2(X) = E[X(X 1)] + EX (EX)2, if X is an r.v., as is easily seen. This formula is especially useful in calculating the variance of a discrete r.v., as is seen below.
Exercises
5.1.1 Verify the details of properties (E1)(E7). 5.1.2 Verify the details of properties (V1)(V5). 5.1.3 For r < r, show that |X|r 1 + |X|r and conclude that if E|X|r < , then E|X|r for all 0 < r < r.
112
5.1.4 Verify the equality (E[ g( X )] =) g( x) fX ( x)dx = yfY ( y)dy for the case that X N(0, 1) and Y = g(X) = X2. 5.1.5 For any event A, consider the r.v. X = IA, the indicator of A dened by IA(s) = 1 for s A and IA(s) = 0 for s Ac, and calculate EXr, r > 0, and also 2(X). 5.1.6 Let X be an r.v. such that 1 P X = c = P X = c = . 2 Calculate EX, 2(X) and show that
P X EX c = 5.1.7 Let X be an r.v. with nite EX.
2 X
c2
( ).
ii) For any constant c, show that E(X c)2 = E(X EX)2 + (EX c)2; ii) Use part (i) to conclude that E(X c)2 is minimum for c = EX. 5.1.8 Let X be an r.v. such that EX4 < . Then show that ii) E(X EX)3 = EX3 3(EX)(EX)2 + 2(EX)3; ii) E(X EX)4 = EX4 4(EX)(EX3) + 6(EX)2(EX2) 3(EX)4. 5.1.9 If EX4 < , show that:
E X X 1 = EX 2 EX ; E X X 1 X 2 = EX 3 3EX 2 + 2EX ;
4 3 2
[ (
[ ( )( )] E[ X ( X 1)( X 2)( X 3)] = EX 6EX + 11EX
)]
6EX .
(These relations provide a way of calculating EXk, k = 2, 3, 4 by means of the factorial moments E[X(X 1)], E[X(X 1)(X 2)], E[X(X 1)(X 2) (X 3)].) 5.1.10 Let X be the r.v. denoting the number of claims led by a policyholder of an insurance company over a specied period of time. On the basis of an extensive study of the claim records, it may be assumed that the distribution of X is as follows: x f (x ) 0 0.304 1 0.287 2 0.208 3 0.115 4 0.061 5 0.019 6 0.006
iii) Calculate the EX and the 2(X); iii) What premium should the company charge in order to break even? iii) What should be the premium charged if the company is to expect to come ahead by $M for administrative expenses and prot?
113
5.1.11 green.
A roulette wheel has 38 slots of which 18 are red, 18 black, and 2
iii) Suppose a gambler is placing a bet of $M on red. What is the gamblers expected gain or loss and what is the standard deviation? iii) If the same bet of $M is placed on green and if $kM is the amount the gambler wins, calculate the expected gain or loss and the standard deviation. iii) For what value of k do the two expectations in parts (i) and (ii) coincide? iv) Does this value of k depend on M? iv) How do the respective standard deviations compare? 5.1.12 Let X be an r.v. such that P(X = j) = ( 1 )j, j = 1, 2, . . . . 2
ii) Compute EX, E[X(X 1)]; ii) Use (i) in order to compute 2(X). 5.1.13 If X is an r.v. distributed as U(, ), show that
+ EX = , 2
X
2
( )
( ) =
12
5.1.14 Let the r.v. X be distributed as U(, ). Calculate EXn for any positive integer n. 5.1.15 Let X be an r.v. with p.d.f. f symmetric about a constant c (that is, f(c x) = f(c + x) for every x). ii) Then if EX exists, show that EX = c; ii) If c = 0 and EX2n+1 exists, show that EX2n+1 = 0 (that is, those moments of X of odd order which exist are all equal to zero). 5.1.16 Refer to Exercise 3.3.13(iv) in Chapter 3 and nd the EX for those s for which this expectation exists, where X is an r.v. having the distribution in question. 5.1.17 Let X be an r.v. with p.d.f. given by f x =
()
I c ,c x . c2 ( )
()
Compute EXn for any positive integer n, E|Xr|, r > 0, 2(X). 5.1.18 Let X be an r.v. with nite expectation and d.f. F.
ii) Show that
EX = 1 F x dx F x dx;
0
( )]
()
114
ii) Use the interpretation of the denite integral as an area in order to give a geometric interpretation of EX. 5.1.19 Let X be an r.v. of the continuous type with nite EX and p.d.f. f.
c
ii) If m is a median of f and c is any constant, show that

E X c = E X m + 2 c x f x dx;
m
)()
ii) Utilize (i) in order to conclude that E|X c| is minimized for c = m. (Hint: Consider the two cases that c m and c < m, and in each one split the integral from to c and c to in order to remove the absolute value. m 1 Then the fact that f ( x)dx = m f ( x)dx = 2 and simple manipulations c prove part (i). For part (ii), observe that m (c x) f ( x)dx 0 whether c m or c < m.) 5.1.20 If the r.v. X is distributed according to the Weibull distribution (see Exercise 4.1.15 in Chapter 4), then:
1 2 1 2 ii) Show that EX = 1 + , EX 2 = 1 + , so that

2 1 2 X = 1 + 2 1 + 2 , where recall that the Gamma function is dened by = 0 t 1 e t dt , > 0; ii) Determine the numerical values of EX and 2(X) for = 1 and = 1 , 2 = 1 and = 2.
( )
()
5.2 Expectations and Variances of Some r.v.s

5.2.1 Discrete Case
1. Let X be B(n, p). Then E(X) = np, 2(X) = npq. In fact,
n n n n! E X = x p x q n x = x px qn x x! n x ! x = 0 x x =1
( )
=
x =1
( x 1)!(n x)! (n 1)! ( )( ) p q = np ! ! x n x 1 1 1 ( ) [( ) ( )] (n 1)! p q( ) = np p + q = np ( ) x![( n 1) x]!

n x 1 n 1 x 1 x =1 n 1 x n 1 x x= 0
n n1 !
px qn x
n 1
= np.
5.2
Expectations 5.1 Moments and Variances of Random of Some Variables R.V.s
115
Next,
E X X 1
n
[ (
)]
x n x x2 n 2 x2
! p q ) x! nn ( x)! n( n 1)( n 2)! ( = x( x 1) p p q x( x 1)( x 2)![( n 2) ( x 2)]! (n 2)! ( )( ) = n( n 1) p p q ( x 2)![(n 2) ( x 2)]! (n 2)! p q( ) = n( n 1) p x![( n 2) x]! = n( n 1) p ( p + q) = n( n 1) p . = x x1
x= 0 n 2 x=2 n 2 x2 n 2 x2 x=2 2 n 2 x n 2 x x= 0 2 n 2 2
)(
That is,
E X X 1 = n n 1 p2 .
Hence, by (V6),
[ (
)]
)] (
2 X = E X X 1 + EX EX
2 2 2 2 2
( ) [ (
( )
= n n 1 p 2 + np n 2 p 2
= n p np + np n p = np 1 p = npq.
2. Let X be P(). Then E(X) = 2(X) = . In fact, E X = xe
x= 0
( )
x x x 1 = xe = e x! x =1 x x1 ! x =1 x 1 !
= e Next,
= e e = . x = 0 x!
x
E X X 1 = x x 1 e
x= 0
[ (
)]
( (
) )
x x!
x x = 2 e = 2 . x x1 x 2 ! x = 0 x!
= x x 1 e
x=2
)(
Hence EX2 = 2 + , so that, 2(X) = 2 + 2 = . One can also prove that the nth factorial moment of X is n; that is, E[X(X 1) (X n + 1)] = n.
REMARK 3
116
5.2.2
Continuous Case
2n ! ( ) 2( (n)!) ,
n
1. Let X be N(0, 1). Then

E X 2 n+1 = 0, E X 2 n =
n 0.
In particular, then
E X = 0,
( )
2 X = E X2 =
( )
1 2
( )
2 = 1. 2 1!
In fact, E X 2 n+1 = But
x 2 n+1 e x
dx.
2 n +1 x 2 2
dx = x 2n +1e x 2 dx + x 2n +1e x 2 dx
2
= y 2n +1e y 2 dy + x 2n +1e x 2 dx
2 2
= x 2n +1e x 2 dx + x 2n +1e x 2 dx = 0.
2 2
Thus E(X2n+1) = 0. Next,
x
as is easily seen, and
2n
ex
dx = 2 x 2 n e x
0
2
dx,
x 2n e x 2 dx = x 2n 1de x
2
= x 2n 1e x = 2n 1
2 0
+ 2n 1
2
x 2n 2 e x 2 dx
2
x 2n 2 e x 2 dx,
and if we set m2n = E(X2n), we get then m2 n = 2 n 1 m2 n 2 , and similarly, m 2 n 2

2 n 4
( ) = (2 n 3)m
M m2 = 1 m0
m0 = 1 since m0 = E X 0 = E 1 = 1 . Multiplying them out, we obtain
( ) () )
5.2
Expectations 5.1 Moments and Variances of Random of Some Variables R.V.s
117
m2 n = 2 n 1 2 n 3 1
)( ) 1 2 ( 2 n 3)( 2 n 2)( 2 n 1)( 2 n) (2 n)! = = 2 ( 2 n 2)( 2 n) (2 1) [2( n 1)](2 n) (2 n)! (2 n)! . = = 2 [1 ( n 1) n] 2 ( n!)
n n
REMARK 4
Let now X be N(, 2). Then (X )/ is N(0, 1). Hence
X 2 X E = 0, = 1.
But
X 1 E = EX .
( )
Hence
1 E X = 0,
( )
so that E(X) = . Next,
X 1 2 2 = 2 X
and then 1 2 X = 1, 2 so that 2(X) = 2.
( )
( )
2. Let X be Gamma with parameters and . Then E(X) = and 2(X) = 2. In fact,
EX = =
( )
( ) ( )
xx 1 e x dx = x de x =
( )
x e x dx
x e x x 1 e x dx 0 0
( )
( )
x 1 e x dx = .
118
Next,
E X2 =
and hence
( ) (1)
(
x +1 e x dx = 2 + 1
2 X = 2 + 1 2 2 = 2 + 1 = 2 .
REMARK 5
( )
ii) If X is r2 , that is, if = r/2, = 2, we get E(X) = r, 2(X) = 2r. ii) If X is Negative Exponential, that is, if = 1, = 1/, we get E(X) = 1/, 2(X) = 1/2. 3. Let X be Cauchy. Then E(Xn) does not exist for any n 1. For example, for n = 1, we get
I=
x dx
2 + x
For simplicity, we set = 0, = 1 and we have
I=
2 1 x dx 1 1 d x = 1 + x 2 2 1 + x 2
( ) (
2 1 1 1 d 1+ x = log 1 + x 2 = 2 2 2 1+ x 1 = , 2
which is an indeterminate form. Thus the Cauchy distribution is an example of a distribution without a mean. In somewhat advanced mathematics courses, one encounters sometimes the so-called Cauchy Principal Value Integral. This coincides with the improper Riemann integral when the latter exists, and it often exists even if the Riemann integral does not. It is an improper integral in which the limits are taken symmetrically. As an example, for = 1, = 0, we have, in terms of the principal value integral,
REMARK 6
I * = lim =
1 A xdx 1 = lim log 1 + x 2 2 A 2 A 1+ x
A A
1 lim log 1 + A 2 log 1 + A 2 = 0. 2 A
[ (
)]
119
Thus the mean of the Cauchy exists in terms of principal value, but not in the sense of our denition which requires absolute convergence of the improper Riemann integral involved.
Exercises
5.2.1 If X is an r.v. distributed as B(n, p), calculate the kth factorial moment E[X(X 1) (X k + 1)]. 5.2.2 An honest coin is tossed independently n times and let X be the r.v. denoting the number of Hs that occur. iii) Calculate E(X/n), 2(X/n); iii) If n = 100, nd a lower bound for the probability that the observed frequency X/n does not differ from 0.5 by more than 0.1; iii) Determine the smallest value of n for which the probability that X/n does not differ from 0.5 by more 0.1 is at least 0.95; iv) If n = 50 and P(|(X/n) 0.5| < c) 0.9, determine the constant c. (Hint: In (ii)(iv), utilize Tchebichevs inequality.) 5.2.3 Refer to Exercise 3.2.16 in Chapter 3 and suppose that 100 people are chosen at random. Find the expected number of people with blood of each one of the four types and the variance about these numbers. 5.2.4 If X is an r.v. distributed as P(), calculate the kth factorial moment E[X(X 1) (X k + 1)]. 5.2.5 Refer to Exercise 3.2.7 in Chapter 3 and nd the expected number of particles to reach the portion of space under consideration there during time t and the variance about this number. 5.2.6 If X is an r.v. with a Hypergeometric distribution, use an approach similar to the one used in the Binomial example in order to show that
EX = mr , m+n
2 X =
( )
( ) . (m + n) (m + n 1)
mnr m + n r
2
5.2.7 Let X be an r.v. distributed as Negative Binomial with parameters r and p. ii) By working as in the Binomial example, show that EX = rq/p, 2(X) = rq/p2; ii) Use (i) in order to show that EX = q/p and 2(X) = q/p2, if X has the Geometric distribution. 5.2.8 Let f be the Gamma density with parameters = n, = 1. Then show that
120

n 1
e f ( x)dx = x= 0
x . x!
Conclude that in this case, one may utilize the Incomplete Gamma tables (see, for example, Tables of the Incomplete -Function, Cambridge University Press, 1957, Karl Paerson, editor) in order to evaluate the d.f. of a Poisson distribution at the points j = 1, 2, . . . . 5.2.9 Refer to Exercise 3.3.7 in Chapter 3 and suppose that each TV tube costs $7 and that it sells for $11. Suppose further that the manufacturer sells an item on money-back guarantee terms if the lifetime of the tube is less than c. ii) Express his expected gain (or loss) in terms of c and ; ii) For what value of c will he break even? 5.2.10 Refer to Exercise 4.1.12 in Chapter 4 and suppose that each bulb costs 30 cents and sells for 50 cents. Furthermore, suppose that a bulb is sold under the following terms: The entire amount is refunded if its lifetime is <1,000 and 50% of the amount is refunded if its lifetime is <2,000. Compute the expected gain (or loss) of the dealer. 5.2.11 then If X is an r.v. having the Beta distribution with parameters and ,
ii) Show that

EX n =
( ) ( ), ( ) ( + + n)
+ +n
n = 1, 2, ;
ii) Use (i) in order to nd EX and 2(X). 5.2.12 Let X be an r.v. distributed as Cauchy with parameters and 2. Then show that E|X| = . 5.2.13 If the r.v. X is distributed as Lognormal with parameters and , compute EX, 2(X). 5.2.14 Suppose that the average monthly water consumption by the residents of a certain community follows the Lognormal distribution with = 104 cubic feet and = 103 cubic feet monthly. Compute the proportion of the residents who consume more than 15 103 cubic feet monthly. 5.2.15 Let X be an r.v. with nite third moment and set = EX, 2 = 2(X). Dene the (dimensionless quantity, pure number) 1 by
X 1 = E .
1 is called the skewness of the distribution of the r.v. X and is a measure of asymmetry of the distribution. If 1 > 0, the distribution is said to be skewed to
121
the right and if 1 < 0, the distribution is said to be skewed to the left. Then show that: iii) If the p.d.f. of X is symmetric about , then 1 = 0; iii) The Binomial distribution B(n, p) is skewed to the right for p < skewed to the left for p > 1 ; 2
1 2
and is
iii) The Poisson distribution P() and the Negative Exponential distribution are always skewed to the right. 5.2.16 Let X be an r.v. with EX4 < and dene the (pure number) 2 by
X 2 = E 3,
where = EX , 2 = 2 X .
( )
2 is called the kurtosis of the distribution of the r.v. X and is a measure of peakedness of this distribution, where the N(0, 1) p.d.f. is a measure of reference. If 2 > 0, the distribution is called leptokurtic and if 2 < 0, the distribution is called platykurtic. Then show that:
ii) 2 < 0 if X is distributed as U(, ); ii) 2 > 0 if X has the Double Exponential distribution (see Exercise 3.3.13(iii) in Chapter 3). 5.2.17 Let X be an r.v. taking on the values j with probability pj = P(X = j), j = 0, 1, . . . . Set G t = pj t j ,
j =0
()
1 t 1.
The function G is called the generating function of the sequence {pj}, j 0. iii) Show that if |EX| < , then EX = d/dt G(t)|t = 1; iii) Also show that if |E[X(X 1) (X k + 1)]| < , then
E X X 1 X k +1 =
[ (
) (
)]
dk Gt dt k
()
t =1
iii) Find the generating function of the sequences n j n j p q , j and

j , e j! j 0, > 0;
j 0, 0 < p < 1, q = 1 p
122
iv) Utilize (ii) and (iii) in order to calculate the kth factorial moments of X being B(n, p) and X being P(). Compare the results with those found in Exercises 5.2.1 and 5.2.4, respectively.
5.3 Conditional Moments of Random Variables

If, in the preceding denitions, the p.d.f. f of the r. vector X is replaced by a conditional p.d.f. f(xj , . . . , xj |xi , . . . , xi ), the resulting moments are called conditional moments, and they are functions of xi , . . . , xi . Thus
1 n 1 m 1 m
x f x x 2 2 1 E X 2 X1 = x1 = x x f x x dx , 2 1 2 2 x 2 E X 2 X1 = x1 2 X 2 X1 = x1 = x x E X 2 X1 = x1 2
( (
) )
[ [
( (
) )
)] f (x x )
2 2 1
)] f (x x )dx .
2 2 1 2
For example, if (X1, X2) has the Bivariate Normal distribution, then f(x2 |x1) 2 (1 2)) r.v., where is the p.d.f. of an N(b, 2
b = 2 +
2 x1 1 . 1
Hence
E X 2 X1 = x1 = 2 +
2 x1 1 . 1
Similarly,
E X1 X 2 = x 2 = 1 +
1 x2 2 . 2
Let X1, X2 be two r.v.s with joint p.d.f f(x1, x2). We just gave the denition of E(X2|X1 = x1) for all x1 for which f(x2|x1) is dened; that is, for all x1 for which fX (x1) > 0. Then E(X2|X1 = x1) is a function of x1. Replacing x1 by X1 and writing E(X2|X1) instead of E(X2|X1 = x1), we then have that E(X2|X1 ) is itself an r.v., and a function of X1. Then we may talk about the E[E(X2|X1)]. In connection with this, we have the following properties:
1
5.3
Conditional 5.1 Moments of Random Variables
123
5.3.1 Some Basic Properties of the Conditional Expectation

(CE1) If E(X2) and E(X2|X1) exist, then E[E(X2|X1)] = E(X2) (that is, the expectation of the conditional expectation of an r.v. is the same as the (unconditional) expectation of the r.v. in question). It sufces to establish the property for the continuous case only, for the proof for the discrete case is quite analogous. We have
E E X 2 X1 = x 2 f x 2 x1 dx 2 fX x1 dx1
1
[(
)]
( )
= =
x 2 f x 2 x1 fX x1 dx 2 dx1
1
(
(
) ( )
) )
x 2 f x1 , x 2 dx 2 dx1 =
x 2 f x1 , x 2 dx1 dx 2
2
= x 2 f x1 , x 2 dx1 dx 2 = x 2 fX x 2 dx 2 = E X 2 .
( )
( )
Note that here all interchanges of order of integration are legitimate because of the absolute convergence of the integrals involved.
REMARK 7
(CE2) Let X1, X2 be two r.v.s, g(X1) be a (measurable) function of X1 and let that E(X2) exists. Then for all x1 for which the conditional expectations below exist, we have
E X 2 g X1 X1 = x1 = g x1 E X 2 X1 = x1
[ ( )
] ( )(
or
E X 2 g X1 X1 = g X1 E X 2 X1 .
Again, restricting ourselves to the continuous case, we have
[ ( ) ] ( )(

E X 2 g X1 X1 = x1 = x 2 g x1 f x 2 x1 dx 2 = g x1 = g x1 E X 2 X1 = x1 .
In particular, by taking X2 = 1, we get
[ ( )
( ) (
( )(
( )
x 2 f x 2 x1 dx 2
(CE2) For all x1 for which the conditional expectations below exist, we have E[g(X1)|X1 = x1] = g(x1) (or E[g(X1)|X1] = g(X1)). (CV) Provided the quantities which appear below exist, we have
2 E X 2 X1 2 X 2
[(
)]
( )
and the inequality is strict, unless X2 is a function of X1 (on a set of probability one). Set
= E X 2 , X1 = E X 2 X1 .
( ) ( )
124
Then
2 X2 = E X2
2
( )
) = E{[X (X )] + [ (X ) ]} = E[ X ( X )] + E[ ( X ) ] + 2 E{[ X ( X )][ ( X ) ]}. (

2 2 2 1 1 2 2 1 1 2 1 1
Next,
E X 2 X1 X1
2 2 1
{[
( )][ ( ) ]} = E[ X ( X )] E[ ( X )] E( X ) + E[ ( X )] = E{E[ X ( X ) X ]} E[ ( X )] E[ E( X X )] + E[ ( X )] (by (CE1)),

1 2 1 2 2 1 1 1 2 1 1
and this is equal to

E 2 X1 E 2 X1 E X1 + E X1
[ ( )] [ ( )]
( )
[ ( )]
[ ( )] (by (CE2)),
2
which is 0. Therefore
2 X 2 = E X 2 X1
and since
( )]
+ E X1 ,
2
[( ) ]
E X 2 X1
we have
( )]
0,
2 X 2 E X1 2 = 2 E X 2 X1 .
The inequality is strict unless
E X 2 X1
( ) [( )
[(
[
)]
( )]
= 0.
But
E X 2 X1
( )]
= 2 X 2 X1 , since E X 2 X1 = = 0.
( )]
( )]
Thus 2[X2 (X1)] = 0 and therefore X2 = (X1) with probability one, by Remark 8, which follows.
Exercises
5.3.1 5.3.2 Establish properties (CEI) and (CE2) for the discrete case. Let the r.v.s X, Y be jointly distributed with p.d.f. given by
5.4
Some Important Applications: Probability 5.1 Moments andof Moment Random Inequalities Variables
125
f x, y =
2 n n+1
if y = 1, . . . , x; x = 1, . . . , n, and 0 otherwise. Compute the following n ( n + 1) , and quantities: E(X|Y = y), E(Y|X = x). Hint: Recall that n x =1 x = 2 n n + 1 2 n + 1 ( )( ) n 2 . x =1 x = 6
5.3.3 Let X, Y be r.v.s with p.d.f. f given by f(x, y) = (x + y)I(0,1)(0,1)(x, y). Calculate the following quantities: EX, 2(X), EY, 2(Y), E(X|Y = y), 2(X|Y = y). 5.3.4 Let X, Y be r.v.s with p.d.f. f given by f(x, y) = 2e(x+y)I(0,)(0,)(x, y). Calculate the following quantities: EX, 2(X), EY, 2(Y), E(X|Y = y), 2(X|Y = y). 5.3.5 Let X be an r.v. with nite EX. Then for any r.v. Y, show that E[E(X|Y)] = EX. (Assume the existence of all p.d.f.s needed.) 5.3.6 Consider the r.v.s X, Y and let h, g be (measurable) functions on into itself such that E[h(X)g(Y)] and Eg(X) exist. Then show that
E h X gY X=x =h x E gY X=x.
[( )( )
] ()[( )
5.4 Some Important Applications: Probability and Moment Inequalities

THEOREM 1
Let X be a k-dimensional r. vector and g 0 be a real-valued (measurable) function dened on k, so that g(X) is an r.v., and let c > 0. Then
Pg X c
E g ( X) [ ( ) ] [ c ].
PROOF
Assume X is continuous with p.d.f. f. Then

E g X = g x1 , , xk f x1 , , xk dx1 dxk
[ ( )]
= g x1 , , xk f x1 , , xk dx1 dxk + c g x1 , , xk A A
1 k 1
( )( f ( x , , x )dx
)(
dxk ,
where A = {(x1, . . . , xk) k; g(x1, . . . , xk) c}. Then
126
E g X g x1 , , xk f x1 , , xk dx1 dxk
A A 1 k 1 k
[ ( )]
Hence P[g(X) c] E[g(X)]/c. The proof is completely analogous if X is of the discrete type; all one has to do is to replace integrals by summation signs.
)( ) c f ( x , , x )dx dx = cP[ g(X ) A] = cP[ g(X ) c].
5.4.1
Special Cases of Theorem 1

r
1. Let X be an r.v. and take g(X) = |X |r, = E(X), r > 0. Then EX r P X c = P X cr . cr
This is known as Markovs inequality. 2. In Markovs inequality replace r by 2 to obtain

EX 2 2 P X c = P X c c2
2 X
c
2
( )=
2 2
This is known as Tchebichevs inequality. In particular, if c = k, then P X k

REMARK 8
1 1 ; equivalently, P X < k 1 2 . 2 k k
Let X be an r.v. with mean and variance 2 = 0. Then Tchebichevs inequality gives: P[|X | c] = 0 for every c > 0. This result and Theorem 2, Chapter 2, imply then that P(X = ) = 1 (see also Exercise 5.4.6).
LEMMA 1
Let X and Y be r.v.s such that

E X = E Y = 0,
( )
( )
2 X = 2 Y = 1.
( )
( )
Then
E 2 XY 1 or, equivalently, 1 E XY 1,
( )
( )
and
( ) E( XY ) = 1
PROOF
E XY = 1
if any only if if any only if
( ) P(Y = X ) = 1.
P Y = X = 1,
We have
0 E X Y
= E X 2 2 XY + Y 2
= EX 2 2 E XY + EY 2 = 2 2 E XY
( )
( )
5.4
Some Important Applications: Probability 5.1 Moments andof Moment Random Inequalities Variables
127
and
0 E X +Y
= E X 2 + 2 XY + Y 2
2
= EX + 2 E XY + EY 2 = 2 + 2 E XY .
( )
( )
Hence E(XY) 1 and 1 E(XY), so that 1 E(XY) 1. Now let P(Y = X) = 1. Then E(XY) = EY2 = 1, and if P(Y = X) = 1, then E(XY) = EY2 = 1. Conversely, let E(XY) = 1. Then
2 X Y = E X Y
= EX 2
) [E(X Y )] = E(X Y ) 2 E( XY ) + EY = 1 2 + 1 = 0,
2 2 2
so that P(X = Y) = 1 by Remark 8; that is, P(X = Y) = 1. Finally, let E(XY) = 1. Then 2(X + Y) = 2 + 2E(XY) = 2 2 = 0, so that
P X = Y = 1.
THEOREM 2
(CauchySchwarz inequality) Let X and Y be two random variables with 2 , respectively. Then means 1, 2 and (positive) variances 12 , 2
2 E 2 X 1 Y 2 12 2 ,
[(
)(
)]
or, equivalently,
1 2 E X 1 Y 2 1 2 ,
and
E X 1 Y 2
[(
)(
)]
[(
)(
)] =
1
if and only if
P Y = 2 + 2 X 1 = 1 1
and
E X 1 Y 2
[(
)(
)] =
1
if and only if
P Y = 2 2 X 1 = 1. 1
PROOF
Set
X1 = X 1 , 1 Y1 = Y 2 . 2
128
Then X1, Y1 are as in the previous lemma, and hence

E 2 X1Y1 1
if and only if
1 E X1Y1 1
becomes
E 2 X 1 Y 2
[(
)(

2 1
2 2
)] 1
if and only if
1 2 E X 1 Y 2 1 2 .
The second half of the conclusion follows similarly and will be left as an exercise (see Exercise 5.4.6). A more familiar form of the CauchySchwarz inequality is E2(XY) (EX2)(EY2). This is established as follows: Since the inequality is trivially true if either one of EX2, EY2 is , suppose that they are both nite and set Z = X Y, where is a real number. Then 0 EZ2 = (EX2)2 2[E(XY)] + EY2 for all , which happens if and only if E2(XY) (EX2)(EY2) 0 (by the discriminant test for quadratic equations), or E2(XY) (EX2)(EY2).
REMARK 9
[(
)(
)]
Exercises
5.4.1 Establish Theorem 1 for the discrete case. 5.4.2 Let g be a (measurable) function dened on into (0, ). Then, for any r.v. X and any > 0,
P g X
[( ) ]
( )
Eg X
( ).
If furthermore g is even (that is, g(x) = g(x)) and nondecreasing for x 0, then
P X Eg X
( ). g ( )
5.4.3 For an r.v. X with EX = and 2(X) = 2, both nite, use Tchebichevs inequality in order to nd a lower bound for the probability P(|X | < k). Compare the lower bounds for k = 1, 2, 3 with the respective probabilities when X N(, 2).
5.5
Covariance, Correlation 5.1 Coefcient Moments of and Random Its Interpretation Variables
129
2 5.4.4 Let X be an r.v. distributed as 40 . Use Tchebichevs inequality in order to nd a lower bound for the probability P(|(X/40) 1| 0.5), and compare this bound with the exact value found from Table 3 in Appendix III.
5.4.5 Refer to Remark 8 and show that if X is an r.v. with EX = (nite) such that P(|X | c) = 0 for every c > 0, then P(X = ) = 1. 5.4.6 Prove the second conclusion of Theorem 2. 5.4.7 For any r.v. X, use the CauchySchwarz inequality in order to show that E|X| E1/2X2.
5.5 Covariance, Correlation Coefcient and Its Interpretation

In this section, we introduce the concepts of covariance and correlation coefcient of two r.v.s and provide an interpretation for the latter. To this end, for two r.v.s X and Y with means 1, 2, the (1, 1)-joint central mean, that is, E[(X 1)(Y 2)], is called the covariance of X, Y and is denoted by Cov(X,Y). If 1, 2 are the standard deviations of X and Y, which are assumed to be positive, then the covariance of (X 1)/1, (Y 2)/2 is called the correlation coefcient of X, Y and is denoted by (X, Y) or X,Y or 12 or just if no confusion is possible; that is, X 1 Y 2 E X 1 Y 2 = E = 1 2 1 2 E XY 1 2 . = 1 2
[(
)(
)] = Cov( X , Y )
1 2
( )
From the CauchySchwarz inequality, we have that 2 1; that is 1 1, and = 1 if and only if
Y = 2 +
2 X 1 1
with probability 1, and = 1 if and only if
Y = 2
2 X 1 1
with probability 1. So = 1 means X and Y are linearly related. From this stems the signicance of as a measure of linear dependence between X and Y. (See Fig. 5.1.) If = 0, we say that X and Y are uncorrelated, while if = 1, we say that X and Y are completely correlated (positively if = 1, negatively if = 1).
130
Y 2
2 1
1 2
y 2 y 2
2 1 2 1
(x 1 ) (x 1 )
2 1
1 0 1
Figure 5.1
For 1 < < 1, 0, we say that X and Y are correlated (positively if > 0, negatively if < 0). Positive values of may indicate that there is a tendency of large values of Y to correspond to large values of X and small values of Y to correspond to small values of X. Negative values of may indicate that small values of Y correspond to large values of X and large values of Y to small values of X. Values of close to zero may also indicate that these tendencies are weak, while values of close to 1 may indicate that the tendencies are strong. The following elaboration sheds more light on the intuitive interpretation of the correlation coefcient (= (X, Y)) as a measure of co-linearity of the r.v.s X and Y. To this end, for > 0, consider the line y = 2 + ( x 1 ) in the xy-plane and let D be the distance of the (random) point (X, Y) from the above line. Recalling that the distance of the point (x0, y0) from the a 2 + b 2 . we have in the present line ax + by + c = 0 is given by ax0 + by0 + c case:
2 1
D= X
1 Y + 1 2 1 2 2
1+
12 , 2 2
since here a = 1, b =
1 and c = 1 2 1 . Thus, 2 2
2
D = X 1 Y + 1 2 1 2 2
2
2
12 1 , + 2 2
and we wish to evaluate the expected squared distance of (X, Y) from the line 2 y = 2 + ( x 1 ) ; that is, ED . Carrying out the calculations, we nd
1
2 1
2 2 +2 D2 = 2 X 2 + 12Y 2 2 1 2 XY + 2 2 1 2 2 1 X
2 1 1 2 2 1 Y + 1 2 2 1 .
) (
(1)
Taking the expectations of both sides in (1) and recalling that
5.5
Covariance, Correlation 5.1 Coefcient Moments of and Random Its Interpretation Variables
131
2 2 EX 2 = 12 + 12 , EY 2 = 2 + 2
and E XY = 1 2 + 1 2 ,
( )
we obtain
ED2 =
2 2 12 2 1 2 12 + 2
( > 0).
(2)
Working likewise for the case that < 0, we get
ED2 =
2 2 12 2 1+ 2 12 + 2
( < 0).
(3)
For = 1 or = 1, we already know that (X, Y) lies on the line y = 2 + ( x 1 ) or y = 2 ( x 1 ), respectively (with probability 1). Therefore, regardless of the value of , by the observation just made, relations (2) and (3) are summarized by the expression
2 2 1 1
ED2 =
2 2 12 2 1 . 2 12 + 2
(4)
At this point, exploiting the interpretation of an expectation as an average, relation (4) indicates the following: For > 0, the pairs (X, Y) tend to be arranged along the line y = 2 + ( x 1 ) . These points get closer and closer to this line as gets closer to 1, and lie on the line for = 1. For < 0, the pairs (X, Y) tend to be arranged along the line y = 2 ( x 1 ) . These points get closer and closer to this line as gets closer to 1, and lie on this line for = 1. For = 0, the expected distance is constantly equal to 2 2 2 12 2 /( 12 + 2 ) from either one of the lines y = 2 + ( x 1 ) and y = 2 ( x 1 ) , which is equivalent to saying that the pairs (X, Y) may lie anywhere in the xy-plane. It is in this sense that is a measure of co-linearity of the r.v.s X and Y. The preceding discussion is based on the paper A Direct Development of the Correlation Coefcient by Leo Katz, published in the American Statistician, Vol. 29 (1975), page 170. His approach is somewhat different and is outlined below. First, consider the r.v.s X1 and Y1 as dened in the proof of Theorem 2; unlike the original r.v.s X and Y, the normalized r.v.s X1 and Y1 are dimensionless. Through the transformations x1 = x y and y1 = , we move from the xy-plane to the x1y1-plane. In this latter plane, look at the point (X1, Y1) and seek the line Ax1 + By1 + C = 0 from which the expected squared distance of (X1, Y1) is minimum. That 2 is, determine the coefcients A, B and C, so that ED1 is minimum, where
2 1 2 1 2 1 2 1 1 1 2 2
132
D1 = AX 1 + BY1 + C1 noticing that
2 , taking expectations, and A2 + B2 . Expanding D1
EX1 = EY1 = 0, EX12 = EY12 = 1, and E X1Y1 = ,
we obtain
ED12 = 1 +
2 AB C2 + . A2 + B2 A2 + B2
(5)
2 Clearly, for ED1 to be minimized it is necessary that C = 0. Then, by (5), the expression to be minimized is
ED12 = 1 + At this point, observe that A+ B
2 AB . A2 + B2
(6)
= A2 + B2 2 AB 0 A2 + B2 2 AB = A B ,
or equivalently, 1 2 AB 1. A2 + B2 (7)
From (6) and (7), we conclude that: 2 is minimized for A22AB = 1 and the minimum is 1 . If > 0, ED1 + B2 2 If < 0, ED1 is minimized for A22AB = 1 and the minimum is 1 + . + B2 2 Finally, if = 0, the ED1 is constantly equal to 1; there is no minimizing line (through the origin) Ax1 + By1 = 0. However, A22AB = 1 if and only if A = + B2 B, and A22AB = 1 if and only if A = B . The corresponding lines are y1 = x1, the + B2 2 main diagonal, and y1 = x1. Also observe that both minima of ED1 (for > 0 and < 0), and its constant value 1 (for = 0) are expressed by a single form, namely, 1 ||. 2 To summarize: For > 0, the ED1 is minimized for the line y1 = x1; for 2 2 < 0, the ED1 is minimized for the line y1 = x1; for = 0, ED1 = 1, there is no minimizing line. From this point on, the interpretation of as a measure of co-linearity (of X1 and Y1) is argued as above, with the lines y = 2 + ( x 1 ) x and y = 2 being replaced by the lines y = x and y1 = x1, ( ) 1 1 1 respectively.
2 1 2 1
133
Exercises
5.5.1 Let X be an r.v. taking on the values 2, 1, 1, 2 each with probability 1 . Set Y = X2 and compute the following quantities: EX, 2(X), EY, 2(Y), 4 (X, Y). 5.5.2 Go through the details required in establishing relations (2), (3) and (4). 5.5.3 Do likewise in establishing relation (5). 5.5.4 Refer to Exercise 5.3.2 (including the hint given there) and iii) Calculate the covariance and the correlation coefcient of the r.v.s X and Y; iii) Referring to relation (4), calculate the expected squared distance of (X, y = 2 Y) from the appropriate line y = 2 + ( x 1 ) or ( x 1 ) (which one?);
2 2 1 1
iii) What is the minimum expected squared distance of (X1, Y1) from the appropriate line y = x or y = x (which one?) where X 1 = X and Y1 = Y .
1 1 2 2
Hint: Recall that
n n+1 x = 2 x =1
n 3
) .
2
5.5.5 Refer to Exercise 5.3.2 and calculate the covariance and the correlation coefcient of the r.v.s X and Y. 5.5.6 Do the same in reference to Exercise 5.3.3. 5.5.7 Repeat the same in reference to Exercise 5.3.4. 5.5.8 Show that (aX + b, cY + d) = sgn(ac)(X, Y), where a, b, c, d are constants and sgn x is 1 if x > 0 and is 1 if x < 0. 5.5.9 Let X and Y be r.v.s representing temperatures in two localities, A and B, say, given in the Celsius scale, and let U and V be the respective temperatures in the Fahrenheit scale. Then it is known that U and X are related as 9 follows: U = 5 X + 32, and likewise for V and Y. Fit this example in the model of Exercise 5.5.8, and conclude that the correlation coefcients of X, Y and U, V are identical, as one would expect. 5.5.10 Consider the jointly distributed r.v.s X, Y with nite second moments for which E[Y (X + )]2 and and 2(X) > 0. Then show that the values is minimized are given by
134
= EY EX ,
( ) X, Y . ( ) (X )
Y
is called the best linear predictor or Y, given X.) = X+ (The r.v. Y

5.5.11 If the r.v.s X1 and X2 have the Bivariate Normal distribution, show that the parameter is, actually, the correlation coefcient of X1 and X2. (Hint: Observe that the exponent in the joint p.d.f. of X1 and X2 may be written as follows:
1
2 x 2 x 1 1 x 2 2 x 2 2 1 1 + 2 1 1 2 2
2 1 2
(x =
)
2 1
1 2
(x
2 2
2 2 1 2
where b = 2 +
2 x 1 1 . 1
This facilitates greatly the integration in calculating E(X1X2). 5.5.12 If the r.v.s X1 and X2 have jointly the Bivariate Normal distribution 2 with parameters 1, 2, 12 , 2 and , calculate E(c1X1 + c2X2) and 2(c1X1 + c2X2) in terms of the parameters involved, where c1 and c2 are real constants. 5.5.13 For any two r.v.s X and Y, set U = X + Y and V = X Y. Then
iii) Show that P(UV < 0) = P(|X| < |Y|); iii) If EX2 = EY2 < , then show that E(UV) = 0; iii) If EX2, EY2 < and 2(X) = 2(Y), then U and V are uncorrelated. 5.5.14 If the r.v.s Xi, i = 1, . . . , m and Yj, j = 1, . . . , n have nite second moments, show that
n m m n Cov X i , Yj = Cov X i , Yj . i =1 i =1 j =1 j =1
5.6* Justication of Relation (2) in Chapter 2

As a nal application of the results of this chapter, we give a general proof of Theorem 9, Chapter 2. To do this we remind the reader of the denition of the concept of the indicator function of a set A.
5.6* Justication 5.1 Moments of Relation of Random (2) in Chapter Variables 2
135
Let A be an event in the sample space S. Then the indicator function of A, denoted by IA, is a function on S dened as follows:
1 if s A IA s = c 0 if s A .
()
The following are simple consequences of the indicator function: I I Aj = I A

n j=1
j =1
(8)
I and, in particular,
n j=1
Aj = I A ,
j =1
j
(9)
IA = 1 IA.
c
(10)
Clearly,
E IA = P A
( )
r
( )
1
(11)
and for any X1, . . . , Xr, we have
(1 X )(1 X ) (1 X ) = 1 H
1 2
+ H 2 + 1 H r ,
1 j
( )
(12)
where Hj stands for the sum of the products Xi Xi , where the summation extends over all subsets {i1, i2, . . . , ij} of the set {1, 2, . . . , r}, j = 1, . . . , r. Let , be such that: 0 < , and + r. Then the following is true:
Xi
j
+ X i H J = H + ,
( )
(13)
where J = {i1, . . . , i} is the typical member of all subsets of size of the set {1, 2, . . . , r}, H(J) is the sum of the products Xj Xj , where the summation extends over all subsets of size of the set {1, . . . , r} J, and J is meant to extend over all subsets J of size of the set {1, 2, . . . , r}. The justication of (13) is as follows: In forming H+, we select ( + ) Xs r from the available r Xs in all possible ways, which is ( + ). On the other hand, r for each choice of J, there are ( ) ways of choosing Xs from the remaining r r (r ) Xs. Since there are ( ) choices of J, we get ( )( r ) groups (products) of ( + ) Xs out of r Xs. The number of different groups of ( + ) Xs out
1
136

r r of r Xs is ( + ). Thus among the ( )( r ) groups of ( + ) Xs out of r Xs, the number of distinct ones is given by
r ! r! r r ! r ! ! r ! = r! r r ! + ! +
( ) ( )(
=
This justies (13). Now clearly,
( + )! = + .
! !

Bm = Ai Ai Aic Aic ,
1 m m +1 M
Jm
where the summation extends over all choices of subsets Jm = {i1, . . . , im} of the set {1, 2, . . . , M} and Bm is the one used in Theorem 9, Chapter 2. Hence
IB = IA
m
Jm
i1
Aim Aic AicM m+1
= IA IA 1 IA
Jm
i1 im i1 im
im + 1
) (1 I ) (by (8), (9), (10))

AiM
= IA IA 1 H1 J m + H 2 J m + 1 J
m
( )
( )
( )
M m
H M m J m
( )
(by (12)).
Since
IA
Jm
i1
m + k I A H k Jm = H m+ k m
im
( )
(by (13)),
( )
M m
we have
m + 1 m + 2 I B = Hm H m+1 + H m+ 2 + 1 m m
m
M HM . m
Taking expectations of both sides, we get (from (11) and the denition of Sr in Theorem 9, Chapter 2)
m + 1 m + 2 P Bm = S m S m+1 + S m+ 2 + 1 m m
( )
( )
M m
M SM , m
as was to be proved.
5.6* Justication 5.1 Moments of Relation of Random (2) in Chapter Variables 2
137
(For the proof just completed, also see pp. 8085 in E. Parzens book Modern Probability Theory and Its Applications published by Wiley, 1960.)
REMARK 10 In measure theory the quantity IA is sometimes called the characteristic function of the set A and is usually denoted by A. In probability theory the term characteristic function is reserved for a different concept and will be a major topic of the next chapter.
138
Characteristic Functions, Moment Generating Functions and Related Theorems
Chapter 6
6.1 Preliminaries
The main subject matter of this chapter is the introduction of the concept of the characteristic function of an r.v. and the discussion of its main properties. The characteristic function is a powerful mathematical tool, which is used protably for probabilistic purposes, such as producing the moments of an r.v., recovering its distribution, establishing limit theorems, etc. To this end, recall that for z , eiz = cos z + i sin z, i = 1 , and in what follows, i may be treated formally as a real number, subject to its usual properties: i2 = 1, i3 = i, i 4 = 1, i 5 = i, etc. The sequence of lemmas below will be used to justify the theorems which follow, as well as in other cases in subsequent chapters. A brief justication for some of them is also presented, and relevant references are given at the end of this section.
LEMMA A
Let g1, g2 : {x1, x2, . . .} [0, ) be such that

g1 x j g 2 x j ,
( )
( )
j = 1, 2, ,
and that xj g2(xj) < . Then xj g1(xj) < .

PROOF LEMMA A
If the summations are nite, the result is immediate; if not, it follows by taking the limits of partial sums, which satisfy the inequality.
b
Let g1, g2 : [ 0, ) be such that g1(x) g2(x), x , and that a g1 (x)dx exists for every a, b, with a < b, and that g 2 (x)dx < . Then g1(x)dx < .
PROOF
Same as above replacing sums by integrals.
138
6.5
The Moment Generating 6.1 Preliminaries Function
139
LEMMA B
Let g : {x1, x2, . . .} and xj|g(xj)| < . Then xj g(xj) also converges. The result is immediate for nite sums, and it follows by taking the limits of partial sums, which satisfy the inequality.
PROOF
LEMMA B
Let g : be such that a g(x)dx exists for every a, b, with a < b, and that |g( x ) |dx < . Then g(x)dx also converges.
b
PROOF
Same as above replacing sums by integrals.
The following lemma provides conditions under which the operations of taking limits and expectations can be interchanged. In more advanced probability courses this result is known as the Dominated Convergence Theorem.
LEMMA C
Let {Xn}, n = 1, 2, . . . , be a sequence of r.v.s, and let Y, X be r.v.s such that |Xn(s)| Y(s), s S, n = 1, 2, . . . and Xn(s) X(s) (on a set of ss of E(X ), or probability 1) and E(Y ) < . Then E(X ) exists and E(Xn) n equivalently,
lim E X n = E lim X n .
n n
( )
REMARK 1
The index n can be replaced by a continuous variable.
The next lemma gives conditions under which the operations of differentiation and taking expectations commute.
LEMMA D
For each t T (where T is or an appropriate subset of it, such as the interval [a, b]), let X(; t) be an r.v. such that (t)X(s; t) exists for each s S and t T. Furthermore, suppose there exists an r.v. Y with E(Y ) < and such that
X s; t Y s , t
( )
()
s S , t T .
Then
d E X ; t = E X ; t , for all t T . dt t
[ ( )]
( )
The proofs of the above lemmas can be found in any book on real variables theory, although the last two will be stated in terms of weighting functions rather than expectations; for example, see Advanced Calculus, Theorem 2, p. 285, Theorem 7, p. 292, by D. V. Widder, Prentice-Hall, 1947; Real Analysis, Theorem 7.1, p. 146, by E. J. McShane and T. A. Botts, Van Nostrand, 1959; The Theory of Lebesgue Measure and Integration, pp. 6667, by S. Hartman and J. Mikusin ski, Pergamon Press, 1961. Also Mathematical Methods of Statistics, pp. 4546 and pp. 6668, by H. Cramr, Princeton University Press, 1961.
140
6.2 Denitions and Basic TheoremsThe One-Dimensional Case

Let X be an r.v. with p.d.f. f. Then the characteristic function of X (ch.f. of X ), denoted by X (or just when no confusion is possible) is a function dened on , taking complex values, in general, and dened as follows:
X t = E e itX
()
[ ]
e itx f x = cos tx f x + i sin tx f x x = x itx e f x dx = cos tx f x + i sin tx f x dx cos tx f x + i sin tx f x x = x cos tx f x dx + i sin tx f x dx.
[ ( ) ( ) ( ) ( )] () [ ( ) ( ) ( ) ( )] [ ( ) ( )] [ ( ) ( )]
() ( )() ( )()
By Lemmas A, A, B, B, X(t) exists for all t . The ch.f. X is also called the Fourier transform of f. The following theorem summarizes the basic properties of a ch.f.
THEOREM 1
(Some properties of ch.fs) ii) iii) iv) v) vi) vii) i) X(0) = 1. |X(t)| 1. X is continuous, and, in fact, uniformly continuous. X+d(t) = eitdX(t), where d is a constant. cX(t) = X(ct), where c is a constant. cX+d(t) = eitdX(ct). dn X t dt n
()
= inE(Xn), n = 1, 2, . . . , if E|Xn| < .

t =0
PROOF
i) X(t) = EeitX. Thus X(0) = Eei0X = E(1) = 1. ii) |X(t)| = |EeitX| E|eitX| = E(1) = 1, because |eitX| = 1. (For the proof of the inequality, see Exercise 6.2.1.) iii) X t + h X t = E e
()
i t+ h X
( )
= E e itX e ihX 1 E e itX e ihX 1 = E e ihX 1.

Then
[ (
e itX
)]
6.2 Denitions and Basic TheoremsThe 6.5 The Moment One-Dimensional Generating Function Case
141
lim X t + h X t lim E e ihX 1 = E lim e ihX 1 = 0,

h0 h0 h0
()
provided we can interchange the order of lim and E, which here can be done by Lemma C. We observe that uniformity holds since the last expression on the right is independent of t. iv) X+d(t) = Eeit(X+d) = E(eitXeitd) = eitd EeitX = eitd X(t). v) cX(t) = Eeit(cX) = Eei(ct)X = X(ct). vi) Follows trivially from (iv) and (v). vii) n dn dn t = n Ee itX = E n e itX = E i n X n e itX , n X dt dt t
()
provided we can interchange the order of differentiation and E. This can be done here, by Lemma D (applied successively n times to X and its n 1 rst derivatives), since E|X n| < implies E|X k| < , k = 1, . . . , n (see Exercise 6.2.2). Thus dn X t dt n
REMARK 2 n
n d
dt n
()
= inE X n .
t =0
( )
(i)
From part (vii) of the theorem we have that E(Xn) = X(t)|t = 0, so that the ch.f. produces the nth moment of the r.v.
If X is an r.v. whose values are of the form x = a + kh, where a, h are constants, h > 0, and k runs through the integral values 0, 1, . . . , n or 0, 1, . . . , or 0, 1, . . . , n or 0, 1, . . . , then the distribution of X is called a lattice distribution. For example, if X is distributed as B(n, p), then its values are of the form x = a + kh with a = 0, h = 1, and k = 0, 1, . . . , n. If X is distributed as P(), or it has the Negative Binomial distribution, then again its values are of the same form with a = 0, h = 1, and k = 0, 1, . . . . If now is the ch.f. of X, it can be shown that the distribution of X is a lattice distribution if and only if |(t)| = 1 for some t 0. It can be readily seen that this is indeed the case in the cases mentioned above (for example, (t) = 1 for t = 2). It can also be shown that the distribution of X is a lattice distribution, if and only if the ch.f. is periodic with period 2 (that is, (t + 2) = (t), t ).
REMARK 3
In the following result, the ch.f. serves the purpose of recovering the distribution of an r.v. by way of its ch.f.
THEOREM 2
(Inversion formula) Let X be an r.v. with p.d.f. f and ch.f. . Then if X is of the discrete type, taking on the (distinct) values xj, j 1, one has i) f x j = lim
( )
1 2T
itx j
t dt , j 1.
()
If X is of the continuous type, then
142
ii) f x = lim lim
()
1 h0 T 2
1 e ith itx e t dt T ith

T
()
and, in particular, if | (t )|dt < , then ( f is bounded and continuous and) ii) f(x) = 1 itx e (t)dt. 2
j
PROOF (outline) i) The ch.f. is continuous, by Theorem 1(iii), and since itx T so is eitxj, it follows that the integral T e (t)dt exists for every T(> 0). We have then
1 2T
itx j
t dt =
()
itx e itx f x k dt e k T it x x 1 ( ) f x dt = e k 2T T k 1 T it( x x ) e dt = f xk 2T T k 1 2T
( )
( )
j
( )
(the interchange of the integral and summations is valid here). That is,
1 2T
But
T e
itx j
t dt = f x k
k
()
( ) 21 T
(
it x k x j
) dt .
(1)
it x k x j
) dt =
it x k x j
( = cos t ( x ) dt = cos t x (
T T T T T T
[cos t(x
k
x j + i sin t x k x j dt
T T
= cos t x k x j dt + i sin t x k x j dt
j
) ( ) x )dt , since sin z is an odd function. That is, x )dt . (2)

j
)]
If xk = xj, the above integral is equal to 2T, whereas, for xk xj,
cos t x k x j dt = = =
1 xk x j
d sin t x k x j
) )]
sin T x k x j sin T x k x j 2 sin T x k x j xk x j
xk x j
[ (
).
6.2 Denitions and Basic TheoremsThe 6.5 The Moment One-Dimensional Generating Function Case
143
Therefore,
1 2T
k j
k j
( e
it x k x j
) dt = sin T ( x k x j ) T xk x j
1,
if , if
xk = x j xk x j.
(3)
sin T ( x x ) x1 But x , a constant independent of T, and therefore, for x x sin T ( x x ) xk xj, lim T ( x x ) = 0 , so that T
k j j
1 T 2T lim
it x k x j
1, ) dt =
0 ,
if if
xk = x j xk x j.
(4)
By means of (4), relation (1) yields
lim
1 2T
T e
itx j
t dt = lim f xk
T k
()
( ) 21 T
1 T 2T
T T
it xk x j
) )
dt dt
= f xk lim
k
( )
(
T e
it xk x j
(the interchange of the limit and summation is legitimate here)

= f x j + lim
k j
( )
1 2T
T e
it x k x j
) dt = f x , ( j)
as was to be seen ii) (ii) Strictly speaking, (ii) follows from (ii). We are going to omit (ii) entirely and attempt to give a rough justication of (ii). The assumption that itx | (t )|dt < implies that e (t)dt exists, and is taken as follows for every arbitrary but xed x :
But
e itx t dt = lim e itx t dt . (0 < )T T
()
()
(5)
T e itx t dt = e itx e ity f y dy dt T T T T it ( y x ) it ( y x ) = e f y dy dt = f y e dt dy, T T T
()
()
()
()
(6)
where the interchange of the order of integration is legitimate here. Since the integral (with respect to y) is zero over a single point, we may assume in the sequel that y x. Then
it y x
dt =
2 sin T y x yx
),
(7)
as was seen in part (i). By means of (7), relation (6) yields
144
itx
t dt = 2 lim f y
T
()
()
sin T y x
yx
) dy.
(8)
Setting T( y x) = z, expression (8) becomes

z sin z e itx t dt = 2 lim f x + dz T T z
()
= 2 f x = 2f x ,
by taking the limit under the integral sign, and by using continuity of f and the z dz = . Solving for f(x), we have fact that sin z
()
()
f x =
as asserted.
EXAMPLE 1
()
1 2
e itx t dt ,
()
Let X be B(n, p). In the next section, it will be seen that X(t) = ( peit + q)n. Let us apply (i) to this expression. First of all, we have 1 2T
e itx t dt = = = =
()
1 2T 1 2T 1 2T 1 2T +
( pe
it
+ q e itx dt
it
( pe r
T T
r = 0
)q
r
n r
e itx dt dt
T i r x t
p q r
r n r r= 0 n
n n
i r x t
p q r
r r= 0 r x
n r
i( r x )
i r x dt
1 n x n x T p q T dt 2T x
i ( r x )T i ( r x )T n n e e 1 n x n x = p r qn r + p q 2T T x 2 2Ti r x r= 0 r r x
n sin r x T n x n x n + p q . = p r qn r x rx T r= 0 r r x
Taking the limit as T , we get the desired result, namely

n f x = p x q n x . x
()
6.5
The Moment GeneratingExercises Function
145
(One could also use (i ) for calculating f (x), since is, clearly, periodic with period 2.)
EXAMPLE 2
For an example of the continuous type, let X be N(0, 1). In the next section, we 2 2 will see that X(t) = et /2. Since |(t)| = et /2, we know that | (t )|dt < , so that (ii) applies. Thus we have f x = =
( )
1 2
e itx t dt =
2
()
1 2
e itx e t
dt
2 2 2
t + 2 t ix + ix ( ) ( ) 1 ( 1 2 )( t + 2 itx ) 1 ( 1 2 ) ( 1 2 )( ix ) e dt = e e dt 2 2 ( 1 2 )x ( 1 2 )x e 1 e 1 ( 1 2 )( t + ix ) ( 1 2 )u dt = e du = e 2 2 2 2
2 2 2 2
1 2 x2
( )
2
1 =
1 2
e x
as was to be shown.
THEOREM 3
(Uniqueness Theorem) There is a one-to-one correspondence between the characteristic function and the p.d.f. of a random variable.
PROOF The p.d.f. of an r.v. determines its ch.f. through the denition of the ch.f. The converse, which is the involved part of the theorem, follows from Theorem 2.
Exercises
6.2.1 Show that for any r.v. X and every t , one has |EeitX| E|eitX|(= 1). (Hint: If z = a + ib, a, b , recall that z = a 2 + b 2 . Also use Exercise 5.4.7 in Chapter 5 in order to conclude that (EY )2 EY2 for any r.v. Y.) 6.2.2 Write out detailed proofs for parts (iii) and (vii) of Theorem 1 and justify the use of Lemmas C, D. X(t), t , where the bar 6.2.3 For any r.v. X with ch.f. X, show that X(t) = over X denotes conjugate, that is, if z = a + ib, a, b , then z = a ib. 6.2.4 Show that the ch.f. X of an r.v. X is real if and only if the p.d.f. fX of X is symmetric about 0 (that is, fX(x) = fX(x), x ). (Hint: If X is real, then the conclusion is reached by means of the previous exercise and Theorem 2. If fX is symmetric, show that fX(x) = fX(x), x .)
146
6.2.5 Let X be an r.v. with p.d.f. f and ch.f. given by: (t) = 1 |t| if |t| 1 and (t) = 0 if |t| > 1. Use the appropriate inversion formula to nd f. 6.2.6 Consider the r.v. X with ch.f. (t) = e|t|, t , and utilize Theorem 2(ii) in order to determine the p.d.f. of X.
6.3 The Characteristic Functions of Some Random Variables

In this section, the ch.f.s of some distributions commonly occurring will be derived, both for illustrative purposes and for later use.
6.3.1
Discrete Case
n n x n n n X t = e itx p x q n x = pe it q n x = pe it + q , x x= 0 x = 0 x
1. Let X be B(n, p). Then X(t) = ( peit + q)n. In fact,
()
( )
Hence
d X t dt
so that E(X ) = np. Also, d2 X t dt 2
()
= n pe it + q
t=0
n 1
ipe it
t=0
= inp,
()
= inp
t=0
d it pe + q dt
n 1
e it t= 0
n 2
= inp n 1 pe it + q
)(
ipe it e it + pe it + q
n 1
= i 2 np n 1 p + 1 = np n 1 p + 1 = E X 2 , so that
E X 2 = np n 1 p + 1 and 2 X = E X 2 EX = n 2 p 2 np 2 + np n 2 p 2 = np 1 p = npq;
[( ) ]
]
[( ) ]
( )
( )
2
ie it t= 0
( )
[( )
( )
( ) ( )
that is, 2(X ) = npq. it 2. Let X be P(). Then X(t) = ee . In fact,
X t = e itx e
x= 0
()
it e x =e x! x! x= 0
( )
= e e e = e e
it
it
6.3 The Characteristic 6.5 Functions The Moment of Some Generating Random Variables Function
147
Hence
d X t dt
so that E(X ) = . Also,
d2 X t dt 2
()
t=0
= e e
it
ie it
t= 0
= i ,
()
=
t=0
d ie e e dt d e e dt e
it
+it
t=0
= ie = ie = ie
2
it
+it
eit +it
e it i + i
( ) = i ( + 1) = ( + 1) = E ( X ),
e i + i
2
t= 0
t= 0
so that
2 X = E X 2 EX
that is, 2(X ) = .
( )
( ) ( )
= + 1 2 = ;
6.3.2 Continuous Case

1. Let X be N(, 2). Then X(t) = eit( t /2), and, in particular, if X is 2 N(0, 1), then X(t) = et /2. If X is N(, 2), then (X )/, is N(0, 1). Thus
22
( X ) t = (1 ) X ( ) t = e it X t , and X t = e it ( X ) t .
So it sufces to nd the ch.f. of an N(0, 1) r.v. Y, say. Now
()
()
( )
( )
()
Y t =
=
()
1 2 1 2
2
e
e t
2
ity
e y
dy =
1 2
e
2
y 2 2 ity
) 2 dy
y it
dy = e t
Hence X(t /) = eit/ et /2 and replacing t/ by t, we get, nally: 2t 2 X t = exp it . 2
()
148
Hence
d X t dt
()
2t 2 2 = exp it i t 2 t =0
= i , so that E X = .
t =0
( )
d2 X t dt 2
()
2t 2 2 = exp it i t 2 t =0
= i2 2 2 = i2 2 + 2 .
2t 2 2 exp it 2 t =0
Then E(X 2) = 2 + 2 and 2(X ) = 2 + 2 2 = 2. 2. Let X be Gamma distributed with parameters and . Then X(t) = (1 it). In fact,
X t =
()
( ) 0
x=
e itx x 1 e x dx =
( ) 0
x 1 e
x 1 it
dx.
Setting x(1 it) = y, we get

y dy , dx = , 1 it 1 it y 0, .
Hence the above expression becomes

1 y ( ) 0 (1 it ) 1 = 1 it
1 y
dy 1 it
( ) 0
=
t =0
y 1e y dy = 1 it
Therefore
d X t dt
so that E(X ) = , and
d2 X dt 2
2
()
(1 it )
+1
t =0
= i ,
=i
t =0
2
+1 2
+2
t =0
) (1 it )
2
= i 2 + 1 2 ,
so that E(X ) = ( + 1) . Thus (X) = ( + 1)2 22 = 2. For = r/2, = 2, we get the corresponding quantities for 2 r , and for = 1, = 1/, we get the corresponding quantities for the Negative Exponential distribution. So
6.5

1
149
X t = 1 2it
() (
r 2
it , X t = 1
()
, it
respectively. 3. Let X be Cauchy distributed with = 0 and = 1. Then X(t) = e|t|. In fact,
X t = e itx
()
1 1 1 cos tx dx = dx 2 1+ x 1 + x 2 i sin tx 2 cos tx dx = dx + 2 0 1 + x2 1+ x
( )
( )
( )
because 1 + x2 since sin(tx) is an odd function, and cos(tx) is an even function. Further, it can be shown by complex variables theory that
sin tx
( ) dx = 0,
Hence
cos tx
1 + x2
( ) dx = e
2
X t = e
Now
()
d d t X t = e dt dt does not exist for t = 0. This is consistent with the fact of nonexistence of E(X ), as has been seen in Chapter 5.
()
Exercises
6.3.1 Let X be an r.v. with p.d.f. f given in Exercise 3.2.13 of Chapter 3. Derive its ch.f. , and calculate EX, E[X(X 1)], 2(X ), provided they are nite. 6.3.2 Let X be an r.v. with p.d.f. f given in Exercise 3.2.14 of Chapter 3. Derive its ch.f. , and calculate EX, E[X(X 1)], 2(X ), provided they are nite. 6.3.3 Let X be an r.v. with p.d.f. f given by f(x) = e(x) I(,)(x). Find its ch.f. , and calculate EX, 2(X ), provided they are nite.
150
6.3.4 Let X be an r.v. distributed as Negative Binomial with parameters r and p. i) Show that its ch.f., , is given by
t =
()
pr
1 qe it
ii) By differentiating , show that EX = rq/p and 2(X ) = rq/p2; iii) Find the quantities mentioned in (i) and (ii) for the Geometric distribution. 6.3.5 Let X be an r.v. distributed as U(, ). ii) Show that its ch.f., , is given by
t =
()
e it e it ; it
+ ii) By differentiating , show that EX = 2 and 2 ( X ) =
( )2
12
6.3.6 Consider the r.v. X with p.d.f. f given in Exercise 3.3.14(ii) of Chapter 3, and by using the ch.f. of X, calculate EX n, n = 1, 2, . . . , provided they are nite.
6.4 Denitions and Basic TheoremsThe Multidimensional Case

In this section, versions of Theorems 1, 2 and 3 are presented for the case that the r.v. X is replaced by a k-dimensional r. vector X. Their interpretation, usefulness and usage is analogous to the ones given in the one-dimensional case. To this end, let now X = (X1, . . . , Xk) be a random vector. Then the ch.f. of the r. vector X, or the joint ch.f. of the r.v.s X1, . . . , Xk, denoted by X or X1, . . . , Xk, is dened as follows:
X , ,
1
Xk
(t , , t ) = E[e
1 k
it 1 X 1 +it2 X 2 + + itk X k
],
t j ,
j = 1, 2, . . . , k. The ch.f. X1, . . . , Xk always exists by an obvious generalization of Lemmas A, A and B, B. The joint ch.f. X1, . . . , Xk satises properties analogous to properties (i)(vii). That is, one has
THEOREM 1
(Some properties of ch.f.s) i) X1, . . . , Xk(0, . . . , 0) = 1. ii) |X1, . . . , Xk(t1, . . . , tk)| 1. iii) X1, . . . , Xk is uniformly continuous.
6.4
Denitions and Basic TheoremsThe 6.5 The Moment Multidimensional Generating Function Case
151
iv) X1+d1, . . . , Xk+dk(t1, . . . , tk) = eit1d1+ +itkdkX1, . . . , v) c1X1, . . . , ckXk(t1, . . . , tk) = X1, . . . , vi) c1X1+ d1, . . . , ckXk + dk(t1, . . . , tk) = e
Xk it1d1 + + itkdk
Xk
(t1, . . . , tk).
(c1t1, . . . , cktk).
X1, . . . , Xk(c1t1, . . . , cktk).
vii) If the absolute (n1, . . . , nk)-joint moment, as well as all lower order joint moments of X1, . . . , Xk are nite, then
n + +n X , , t tn t tn
1 k 1 k 1 1 k
Xk
(t , , t )
1 k t 1 = =tk = 0
= i
k j=1 n j
n n Xk , E X1
1 k
and, in particular,
n X , , t n j
1
Xk
(t , , t )
1 k t 1 = =tk = 0
= inE X n j ,
( )
j = 1, 2, , k.
viii) If in the X1, . . . , Xk(t1, . . . , tk) we set tj1 = = tjn = 0, then the resulting expression is the joint ch.f. of the r.v.s Xi1, . . . , Xim, where the js and the is are different and m + n = k. Multidimensional versions of Theorem 2 and Theorem 3 also hold true. We give their formulations below.
THEOREM 2
(Inversion formula) Let X = (X1, . . . , Xk) be an r. vector with p.d.f. f and ch.f. . Then ii) f X , ,
1
Xk
1 x1 , , xk = lim T 2T
e it x it x
1 1
k k
X , ,
1
Xk
(t , , t )dt
k
dt k ,
if X is of the discrete type, and ii) f X , ,

1
Xk
(x , , x )
1 k
1 = lim lim h 0 T 2

Xk
e it1x1 itk xk X 1 , ,
(t , , t )dt
k
1 e it j h it j h j =1
k 1
dt k ,
if X is of the continuous type, with the analog of (ii) holding if the integral of |X1, . . . , Xk(t1, . . . , tk)| is nite.
THEOREM 3
(Uniqueness Theorem) There is a one-to-one correspondence between the ch.f. and the p.d.f. of an r. vector. The justication of Theorem 1 is entirely analogous to that given for Theorem 1, and so is the proof of Theorem 2. As for Theorem 3, the fact that the p.d.f. of X determines its ch.f. follows from the denition of the ch.f. That the ch.f. of X determines its p.d.f. follows from Theorem 2.
PROOFS
152
6.4.1
The Ch.f. of the Multinomial Distribution
Let X = (X1, . . . , Xk) be Multinomially distributed; that is,

P X 1 = x1 , , X k = xk =
n! x x pk p1 . x1! xk !
1 k
Then
X , ,
1
Xk
(t , , t ) = ( p e
1 k 1
1 1
it 1
+ + pk e it
).
n
1 k
In fact,
X , ,
1
Xk
(t , , t ) =
1 k
e it x + +it x
k k
x 1 , , xk
n! x x p1 pk x1! xk !
1
x 1 , , xk
n! p1e it x1! xk !
k
x1
pk e it
xk
= p1e it + + pk e it
1
).
n
Hence
k X , , t1 t k
1
Xk
(t , , t )
1 k
= n n 1 n k + 1 i p1 pk p1e it1 +
k
) (
t 1 = = tk = 0
+ pk e itk
n k t 1 = = tk = 0
= i k n n 1 n k + 1 p1 p2 pk .
) (
Hence
E X1 X k = n n 1 n k + 1 p1 p2 pk .
) (
Finally, the ch.f. of a (measurable) function g(X) of the r. vector X = (X1, . . . , Xk) is dened by:
e itg ( x ) f x , x = x , 1 , xk itg ( X ) = x g(X) t = E e e itg ( x , , x ) f x , 1 , xk dx1 , , dxk .
()
()
Exercise
6.4.1 (CramrWold) Consider the r.v.s Xj, j = 1, . . . , k and for cj , j = 1, . . . , k, set
6.5
The Moment Generating Function
153
Yc = c j X j .
j =1
Then ii) Show that Yc(t) = X1, . . . , Xk(c1t, . . . , ckt), t , and X1, . . . , Xk(c1, . . . , ck) = Yc(1); ii) Conclude that the distribution of the Xs determines the distribution of Yc for every cj , j = 1, . . . , k. Conversely, the distribution of the Xs is determined by the distribution of Yc for every cj , j = 1, . . . , k.
6.5 The Moment Generating Function and Factorial Moment Generating Function of a Random Variable
The ch.f. of an r.v. or an r. vector is a function dened on the entire real line and taking values in the complex plane. Those readers who are not well versed in matters related to complex-valued functions may feel uncomfortable in dealing with ch.f.s. There is a partial remedy to this potential problem, and that is to replace a ch.f. by an entity which is called moment generating function. However, there is a price to be paid for this: namely, a moment generating function may exist (in the sense of being nite) only for t = 0. There are cases where it exists for ts lying in a proper subset of ( containing 0), and yet other cases, where the moment generating function exists for all real t. All three cases will be illustrated by examples below. First, consider the case of an r.v. X. Then the moment generating function (m.g.f.) MX (or just M when no confusion is possible) of a random variable X, which is also called the Laplace transform of f, is dened by MX(t) = E(etX), t , if this expectation exists. For t = 0, MX(0) always exists and equals 1. However, it may fail to exist for t 0. If MX(t) exists, then formally X(t) = MX(it) and therefore the m.g.f. satises most of the properties analogous to properties (i)(vii) cited above in connection with the ch.f., under suitable conditions. In particular, property (vii) in Theorem 1 yields d M X (t ) t = 0 = E ( X n ) , provided Lemma D applies. In fact, dt
n n
dn MX t dt n
()
=
t =0
dn Ee tX dt n
= E X n e tX
dn = E n e tX dt t =0 t =0 = E Xn .
t =0
( )
This is the property from which the m.g.f. derives its name.
154
Here are some examples of m.g.f.s. It is instructive to derive them in order to see how conditions are imposed on t in order for the m.g.f. to be nite. It so happens that part (vii) of Theorem 1, as it would be formulated for an m.g.f., is applicable in all these examples, although no justication will be supplied.
6.5.1
The M.G.F.s of Some R.V.s
1. If X B(n, p), then MX(t) = ( pet + q)n, t . Indeed,

n n x n n n M X t = e tx p x q n x = pe t q n x = pe t + q , x x= 0 x = 0 x
()
( ) )
which, clearly, is nite for all t . Then
d MX t dt
and
()
=
t =0
d pe t + q dt
n t =0
= n pe t + q
n 1
pe t
t =0
= np = E X ,
( )
d2 MX t dt 2
()
=
t =0
d np pe t + q dt
n 1
et t =0 pe t e t + pe t + q
= np n 1 pe t + q
)(
n 2
n 1
= n n 1 p 2 + np = n 2 p 2 np 2 + np = E X 2 , so that 2(X ) = n2p2 np2 + np n2p2 = np(1 p) = npq. 2. If X P(), then MX(t) = ee , t . In fact,
t
( )
et t =0
M X t = e tx e
x= 0
()
t e x =e x! x! x= 0
( )
t
= e e e = e e .
t t
Then
d MX t dt
and
d2 MX t dt 2
()
=
t =0
d e = e t e e ==E X , e t =0 dt t =0
t
( )
()
=
t =0
t d e t e e dt
= e t e e + e t e e e t
t t
= 1 + = E X 2 , so that 2 X = + 2 2 = .
( )
t =0
t =0
( )
6.5
155
1), then MX(t) = et /2, t . By the property for m.g.f. analogous to property (vi) in Theorem 1,
2
3. If X N(, 2), then M X (t ) = e
t +
2t 2 2
, t , and, in particular, if X N(0,
t t M X t = e t M X , so that M X = e t M X t
()
()
for all t . Therefore

t t MX = e et
2
=e
t +
t t 2 + 2
Replacing t by t, we get, nally, M X (t ) = e d MX t dt and
2t 2 2
. Then
2t 2 2
t= 0
()
=
t= 0
d t + e dt
2t 2 2
t=0
= + 2t e
t +
==E X ,
( )
d2 MX t dt 2
()
t + d = + 2t e dt t=0
2t 2 2
t= 0
t t 2 t + t + 2 2 = 2 e + + 2t e
2 2
2 2
= E X 2 , so that 2 X = 2 + 2 2 = 2 .
4. If X is distributed as Gamma with parameters and , then MX(t) = (1 t), t < 1/. Indeed,
( )
( )
= 2 + 2 t=0
MX t =
()
( )
1
e tx x 1 e x dx =
y 1 t
( )
dy 1 t
x 1 e
x 1 t
dx.
Then by setting x(1 t) = y, so that x = expression is equal to
, dx =
, and y [0, ), the above

1
(1 t )
( ) 0
=
y 1 e y dy =
(1 t )
provided 1 t > 0, or equivalently, t < 1/. Then
d MX t dt
()
t =0
d 1 t dt
t =0
= = E X ,
( )
156
and
d2 MX t dt 2
()
=
t =0
d 1 t dt
1 t =0 2
= + 1 2 1 t
) (
2
2 t =0 2
= + 1 = EX , so that X = .
2
( )
r In particular, for = 2 and = 2, we get the m.g.f. of the 2 r, and its mean and variance; namely,
1 , E X = r , 2 X = 2r . 2 1 For = 1 and = , we obtain the m.g.f. of the Negative Exponential distribution, and its mean and variance; namely MX t = 1 2t
r 2
() (
, t<
( )
( )
1 1 , t < , EX = , 2 X = 2 . t 5. Let X have the Cauchy distribution with parameters and , and without loss of generality, let = 0, = 1. Then the MX(t) exists only for t = 0. In fact. 1 1 M X t = E e tX = e tx dx 1 + x2 1 1 1 1 > e tx dx > tx dx 2 0 0 1+ x 1 + x2
MX t =
()
( )
()
( )
( )
if t > 0, since ez > z, for z > 0, and this equals 2 x dx t du t lim log u . = = 2 1 2 u 2 x 1+ x Thus for t > 0, MX(t) obviously is equal to . If t < 0, by using the limits , 0 in the integral, we again reach the conclusion that MX(t) = (see Exercise 6.5.9). t 2
The examples just discussed exhibit all three cases regarding the existence or nonexistence of an m.g.f. In Examples 1 and 3, the m.g.f.s exist for all t ;in Examples 2 and 4, the m.g.f.s exist for proper subsets of ;and in Example 5, the m.g.f. exists only for t = 0.
REMARK 4
For an r.v. X, we also dene what is known as its factorial moment generating function. More precisely, the factorial m.g.f. X (or just when no confusion is possible) of an r.v. X is dened by:
X t = E t X , t , if E t X exists.
This function is sometimes referred to as the Mellin or MellinStieltjes transform of f. Clearly, X(t) = MX(log t) for t > 0. Formally, the nth factorial moment of an r.v. X is taken from its factorial m.g.f. by differentiation as follows:
()
( )
( )
6.5
157
dn X t dt n In fact,
()
= E X X 1 X n+1 .
t =1
[ (
) (
)]
n X dn dn X X n E t E t = = , X n t = E X X 1 X n+1 t dt n dt n t
()
( )
[ (
provided Lemma D applies, so that the interchange of the order of differentiation and expectation is valid. Hence dn X t dt n
REMARK 5
()
= E X X 1 X n+1 .
t =1
[ (
) (
)]
(9)
The factorial m.g.f. derives its name from the property just established. As has already been seen in the rst two examples in Section 2 of Chapter 5, factorial moments are especially valuable in calculating the variance of discrete r.v.s. Indeed, since
2 X = E X 2 EX , and E X 2 = E X X 1 + E X ,
we get
( )
( ) ( )
( )
( ) [ (
)] ( )
2 X = E X X 1 + E X EX ;
that is, an expression of the variance of X in terms of derivatives of its factorial m.g.f. up to order two. Below we derive some factorial m.g.f.s. Property (9) (for n = 2) is valid in all these examples, although no specic justication will be provided.
[ (
)] ( ) ( )
6.5.2 The Factorial M.G.F.s of some R.V.s

1. If X B(n, p), then X(t) = (pt + q)n, t . In fact,
n n x n n n X t = t x p x q n x = pt q n x = pt + q . x x x= 0 x= 0
()
( )
Then d2 X t dt 2
()
= n n 1 p 2 pt + q
t =1
) (
n 2
= n n 1 p2 ,
so that 2(X ) = n(n 1)p2 + np n2p2 = npq. 2. If X P(), then X(t) = et , t . In fact,
X t = t e
x =0
()
t x = e = e e t = e t , t . x! x = 0 x!
( )
158
Hence d2 X t dt 2
()
= 2 e t
t =1
t =1
= 2 , so that 2 X = 2 + 2 = .
( )
The m.g.f. of an r. vector X or the joint m.g.f. of the r.v.s X1, . . . , Xk, denoted by MX or MX1, . . . , Xk, is dened by:
M X , , X t1 , , t k = E e t X + t X , t j , j = 1, 2, , k, for those tjs in for which this expectation exists. If MX1, . . . , Xk(t1, . . . , tk) exists, then formally X1, . . . , Xk(t1, . . . , tk) = MX1, . . . , Xk(it1, . . . , itk) and properties analogous to (i)(vii), (viii) in Theorem 1 hold true under suitable conditions. In particular,
1 1 k k 1 k
n + +n MX , , n1 nk t1 t k
1 k 1
Xk
(t , , t )
1 k
nk = E X 1n 1 X k , t 1 = = tk = 0
(10)
where n1, . . . , nk are non-negative integers. Below, we present two examples of m.g.f.s of r. vectors.
6.5.3
The M.G.F.s of Some R. Vectors
1. If the r.v.s X1, . . . , Xk have jointly the Multinomial distribution with parameters n and p1, . . . , pk, then
MX , ,
1
Xk
(t , , t ) = ( p e
1 k 1
t1
+ + pk e t
),
n
t j ,
j = 1, , k.
In fact,
MX1 , ,
Xk
(t , , t ) = Ee
1 k
t 1 X 1 + +tk X k
= e 1
x1
t X 1 + +tk X k
n! xk p1x1 pk x1! xk !
n! p1e t1 x1! xk !
( )
pk e tk
n
= p1e t1 + + pk e tk
( ) ),
xk
where the summation is over all integers x1, . . . , xk 0 with x1 + + xk = n. Clearly, the above derivations hold true for all tj , j = 1, . . . , k. 2. If the r.v.s X1 and X2 have the Bivariate Normal distribution with 2 parameters 1, 2, 2 1, 2 and , then their joint m.g.f. is
MX
1 ,X 2
(t , t ) = exp t
1 2
1 1
+ 2t 2 +
1 2 2 2 2 1 t1 + 2 1 2 t1t 2 + 2 t2 2
) , t , t
1
. (11)
An analytical derivation of this formula is possible, but we prefer to use the matrix approach, which is more elegant and compact. Recall that the joint p.d.f. of X1 and X2 is given by
6.5
159
f x1 , x 2 =
)
1
2 2 x1 1 x1 1 x 2 2 x 2 2 1 exp 2 + . 1 1 2 2 1 2 2
2 1 2
Set x = (x1 x2), = (1 2), and 12 = 12 2 . 1 2 2

1 2 2 Then the determinant of , ||, is || = 2 1 2(1 ), and the inverse, , is
1 =
Therefore
2 1 2 1 2 . 1 2 12
x 1 x = =
2 2 1 2 x1 1 1 x1 1 x 2 2 12 x 2 2 1 2
1
2 1 2 2
1
2
2 x 1 2 1
2 2 1 2 x1 1 x 2 2 + 12 x 2 2
)(
1 1 2
2 x 2 x1 1 x 2 2 x 2 2 1 1 + 2 . 1 1 2 2
Therefore the p.d.f. is written as follows in matrix notation: f x =
()
1 2
1 2
1 exp x 1 x 2
) .
In this form, is the mean vector of X = (X1 X2), and is the covariance matrix of X. Next, for t = (t1 t2), we have
M X t = Ee t X = 2 exp t x f x dx
()
( )()
1
1 2
1 2
t x ( x ) ( x )dx. exp 2 1
2
(11)
The exponent may be written as follows:
160
1 1 1 t + t t 2 t + t t 2 t x + x x . 2 2
)]
(13)
Focus on the quantity in the bracket, carry out the multiplication, and observe 1x, to obtain that = , ( 1) = 1, xt = tx, t = t, and x 1 = 2 t + t t 2t x + x 1 x = x + t 1 x + t . By means of (13) and (14), the m.g.f. in (12) becomes
( (
))]
(14)
MX t
()
1 1 = exp t + t t 2 2 1 2
1 exp x + t 1 x + t dx. 2
( (
))
( (
))
However, the second factor above is equal to 1, since it is the integral of a Bivariate Normal distribution with mean vector + t and covariance matrix . Thus
1 M X t = exp t + t t . 2
()
(15)
Observing that 12 1 2 t1 2 2 2 2 t t = t1 t 2 = 1 t1 + 2 1 2 t1t 2 + 2 t 2 , 2 1 2 2 t 2
( )
it follows that the m.g.f. is, indeed, given by (11).
Exercises
6.5.1 Derive the m.g.f. of the r.v. X which denotes the number of spots that turn up when a balanced die is rolled. 6.5.2 Let X be an r.v. with p.d.f. f given in Exercise 3.2.13 of Chapter 3. Derive its m.g.f. and factorial m.g.f., M(t) and (t), respectively, for those ts for which they exist. Then calculate EX, E[X(X 1)] and 2(X ), provided they are nite. 6.5.3 Let X be an r.v. with p.d.f. f given in Exercise 3.2.14 of Chapter 3. Derive its m.g.f. and factorial m.g.f., M(t) and (t), respectively, for those ts for which they exist. Then calculate EX, E[X(X 1)] and 2(X ), provided they are nite.
6.5
161
6.5.4 Let X be an r.v. with p.d.f. f given by f(x) = e(x )I(,)(x). Find its m.g.f. M(t) for those ts for which it exists. Then calculate EX and 2(X), provided they are nite. 6.5.5 Let X be an r.v. distributed as B(n, p). Use its factorial m.g.f. in order to calculate its kth factorial moment. Compare with Exercise 5.2.1 in Chapter 5. 6.5.6 Let X be an r.v. distributed as P(). Use its factorial m.g.f. in order to calculate its kth factorial moment. Compare with Exercise 5.2.4 in Chapter 5. 6.5.7 Let X be an r.v. distributed as Negative Binomial with parameters r and p. i) Show that its m.g.f and factorial m.g.f., M(t) and (t), respectively, are given by
MX t =
()
pr
(1 qe )
t
, t < log q, X t =
()
pr
(1 qt )
t <
1 ; q
ii) By differentiation, show that EX = rq/p and 2(X ) = rq/p2; iii) Find the quantities mentioned in parts (i) and (ii) for the Geometric distribution. 6.5.8 Let X be an r.v. distributed as U(, ). ii) Show that its m.g.f., M, is given by Mt =
()
e t e t ; t
ii) By differentiation, show that EX = + and 2(X ) = ( 2

12
) .
2
6.5.9 Refer to Example 3 in the Continuous case and show that MX(t) = for t < 0 as asserted there. 6.5.10 Let X be an r.v. with m.g.f. M given by M(t) = e t + t , t ( , > 0). Find the ch.f. of X and identify its p.d.f. Also use the ch.f. of X in order to calculate EX4.
2
6.5.11 For an r.v. X, dene the function by (t) = E(1 + t)X for those ts for which E(1 + t)X is nite. Then, if the nth factorial moment of X is nite, show that
(d
dt n t
) ()
t =0
= E X X 1 X n+1 .
[ (
)]
6.5.12 Refer to the previous exercise and let X be P(). Derive (t) and use it in order to show that the nth factorial moment of X is n.
162
6.5.13 Let X be an r.v. with m.g.f. M and set K(t) = log M(t) for those ts for which M(t) exists. Furthermore, suppose that EX = and 2(X ) = 2 are both nite. Then show that d Kt dt
()
= and
t =0
d2 Kt dt 2
()
= 2.
t =0
(The function K just dened is called the cumulant generating function of X.) 6.5.14 Let X be an r.v. such that EX n is nite for all n = 1, 2, . . . . Use the expansion
ex = xn n = 0 n!
in order to show that, under appropriate conditions, one has that the m.g.f. of X is given by
M t = EX n
n =0
()
) tn! .
n
6.5.15 If X is an r.v. such that EX n = n!, then use the previous exercise in order to nd the m.g.f. M(t) of X for those ts for which it exists. Also nd the ch.f. of X and from this, deduce the distribution of X. 6.5.16 Let X be an r.v. such that
EX 2k = 2 k k!
(2k)! ,
EX 2k +1 = 0,
k = 0, 1, . . . . Find the m.g.f. of X and also its ch.f. Then deduce the distribution of X. (Use Exercise 6.5.14) 6.5.17 Let X1, X2 be two r.v.s with m.f.g. given by
1 1 M t1 , t 2 = e t1 + t2 + 1 + e t1 + e t2 , t1 , t 2 . 6 3
) (
Calculate EX1, 2(X1) and Cov(X1, X2), provided they are nite. 6.5.18 Refer to Exercise 4.2.5. in Chapter 4 and nd the joint m.g.f. M(t1, t2, t3) of the r.v.s X1, X2, X3 for those t1, t2, t3 for which it exists. Also nd their joint ch.f. and use it in order to calculate E(X1X2X3), provided the assumptions of Theorem 1 (vii) are met. 6.5.19 Refer to the previous exercise and derive the m.g.f. M(t) of the r.v. g(X1, X2, X3) = X1 + X2 + X3 for those ts for which it exists. From this, deduce the distribution of g.
6.5
163
6.5.20 Let X1, X2 be two r.v.s with m.g.f. M and set K(t1, t2) = log M(t1, t2) for those t1, t2 for which M(t1, t2) exists. Furthermore, suppose that expectations, variances, and covariances of these r.v.s are all nite. Then show that for j = 1, 2,
K t1 , t 2 t j
= EX j ,
t 1 =t2 = 0
2 K t1 , t 2 t j2
)
t 1 =t2 = 0
= 2 Xj ,
( )
2 K t1 , t 2 t1t 2
= Cov X 1 , X 2 .
t 1 =t2 = 0
6.5.21 Suppose the r.v.s X1, . . . , Xk have the Multinomial distribution with parameters n and p1, . . . , pk, and let i, j, be arbitrary but xed, 1 i < j k. Consider the r.v.s Xi, Xj, and set X = n Xi Xj, so that these r.v.s have the Multinomial distribution with parameters n and pi, pj, p, where p = 1 pi pj. ii) Write out the joint m.g.f. of Xi, Xj, X, and by differentiation, determine the E(XiXj); ii) Calculate the covariance of Xi, Xj, Cov(Xi, Xj), and show that it is negative. 6.5.22 If the r.v.s X1 and X2 have the Bivariate Normal distribution with 2 parameters 1, 2, 2 1, 2 and , show that Cov(X1, X2) 0 if 0, and Cov(X1, X2) < 0 if < 0. Note: Two r.v.s X1, X2 for which Fx ,x (X1, X2) Fx (X1)Fx (X2) 0, for all X1, X2 in , or Fx , x (X1, X2) Fx (X1)Fx (X2) 0, for all X1, X2 in , are said to be positively quadrant dependent or negatively quadrant dependent, respectively. In particular, if X1 and X2 have the Bivariate Normal distribution, it can be seen that they are positively quadrant dependent or negatively quadrant dependent according to whether 0 or < 0.
1 2 1 2 1 2 1 2
6.5.23 6.5.24
Verify the validity of relation (13).
ii) If the r.v.s X1 and X2 have the Bivariate Normal distribution with param2 eters 1, 2, 2 1, 2 and , use their joint m.g.f. given by (11) and property (10) in order to determine E(X1X2); ii) Show that is, indeed, the correlation coefcient of X1 and X2. 6.5.25 Both parts of Exercise 6.4.1 hold true if the ch.f.s involved are replaced by m.g.f.s, provided, of course, that these m.g.f.s exist. ii) Use Exercise 6.4.1 for k = 2 and formulated in terms of m.g.f.s in order to show that the r.v.s X1 and X2 have a Bivariate Normal distribution if and only if for every c1, c2 , Yc = c1X1 + c2X2 is normally distributed; ii) In either case, show that c1X1 + c2X2 + c3 is also normally distributed for any c3 .
164
Stochastic Independence with Some Applications
Chapter 7
7.1 Stochastic Independence: Criteria of Independence

Let S be a sample space, consider a class of events associated with this space, and let P be a probability function dened on the class of events. In Chapter 2 (Section 2.3), the concept of independence of events was dened and was heavily used there, as well as in subsequent chapters. Independence carries over to r.v.s also, and is the most basic assumption made in this book. Independence of r.v.s, in essence, reduces to that of events, as will be seen below. In this section, the not-so-rigorous denition of independence of r.v.s is presented, and two criteria of independence are also discussed. A third criterion of independence, and several applications, based primarily on independence, are discussed in subsequent sections. A rigorous treatment of some results is presented in Section 7.4.
DEFINITION 1
The r.v.s Xj, j = 1, . . . , k are said to be independent if, for sets Bj , j = 1, . . . , k, it holds P X j Bj , j = 1, , k = P X j Bj .
j =1
The r.v.s Xj, j = 1, 2, . . . are said to be independent if every nite subcollection of them is a collection of independent r.v.s. Non-independent r.v.s are said to be dependent. (See also Denition 3 in Section 7.4, and the comment following it.)
REMARK 1
(i) The sets Bj, j = 1, . . . , k may not be chosen entirely arbitrarily, but there is plenty of leeway in their choice. For example, taking Bj = (, xj], xj , j = 1, . . . , k would be sufcient. (See Lemma 3 in Section 7.4.) (ii) Denition 1 (as well as Denition 3 in Section 7.4) also applies to mdimensional r. vectors when ( and B in Denition 3) is replaced by m (Bm).
164
165
THEOREM 1
(Factorization Theorem) The r.v.s Xj, j = 1, . . . , k are independent if and only if any one of the following two (equivalent) conditions holds:
i) FX , , X x1 , , xk = FX x j , for all
1 k
j =1 k
( )
x j , j = 1, , k. x j , j = 1, , k.
ii) f X , , X x1 , , xk = f X x j , for all

1 k
j =1
( )
(
PROOF
ii) If Xj, j = 1, , k are independent, then P X j Bj , j = 1, , k = P X j Bj , Bj , j = 1, , k.

j =1
In particular, this is true for Bj = (, xj], xj , j = 1, . . . , k which gives FX , , X x1 , , xk = FX x j .

1 k
j =1
( )
The proof of the converse is a deep probability result, and will, of course, be omitted. Some relevant comments will be made in Section 7.4, Lemma 3. ii) For the discrete case, we set Bj = {xj}, where xj is in the range of Xj, j = 1, . . . , k. Then if Xj, j = 1, . . . , k are independent, we get P X 1 = x1 , , X k = xk = P X j = x j ,
j =1
or f X , , X x1 , , xk = f X x j .
1 k
( (
) )
j =1
( ) ( )
Let now f X , , X x1 , , xk = f X x j .
1 k
j =1
Then for any sets Bj = (, yj], yj , j = 1, . . . , k, we get

B1
f X , , X x1 , , xk =
1 k
B1
f X x1 f X xk
1 k
( )
( )
or
1 k
k = f X x j , j =1 B
j
( )
j
FX , , X y1 , , yk = FX y j .
j =1
( )
Therefore Xj, j = 1, . . . , k are independent by (i). For the continuous case, we have: Let f X , , X x1 , , xk = f X x j
1 k
j =1
( )
and let
166
C j = , y j , y j . j = 1, , k.
Then integrating both sides of this last relationship over the set C1 Ck, we get FX , , X y1 , , yk = FX y j ,
1 k
j =1
( )
so that Xj, j = 1, . . . , k are independent by (i). Next, assume that FX , , X x1 , , xk = FX x j

1 k
j =1
( )
(that is, the Xjs are independent). Then differentiating both sides, we get f X , , X x1 , , xk = f X x j .
1 k
j =1
( )
It is noted that this step also is justiable (by means of calculus) for the continuity points of the p.d.f. only.
REMARK 2
Consider independent r.v.s and suppose that gj is a function of the jth r.v. alone. Then it seems intuitively clear that the r.v.s gj(Xj), j = 1, . . . , k ought to be independent. This is, actually, true and is the content of the following
LEMMA 1
For j = 1, . . . , k, let the r.v.s Xj be independent and consider (measurable) functions gj : , so that gj(Xj), j = 1, . . . , k are r.v.s. Then the r.v.s gj(Xj), j = 1, . . . , k are also independent. The same conclusion holds if the r.v.s are replaced by m-dimensional r. vectors, and the functions gj, j = 1, . . . , k are dened on m into . (That is, functions of independent r.v.s (r. vectors) are independent r.v.s.)
PROOF
See Section 7.4.
Independence of r.v.s also has the following consequence stated as a lemma. Both this lemma, as well as Lemma 1, are needed in the proof of Theorem 1 below.
LEMMA 2
Consider the r.v.s Xj, j = 1, . . . , k and let gj : be (measurable) functions, so that gj(Xj), j = 1, . . . , k are r.v.s. Then, if the r.v.s Xj, j = 1, . . . , k are independent, we have k k E g j X j = E g j X j , j =1 j =1 provided the expectations considered exist. The same conclusion holds if the gjs are complex-valued.
( )
[ ( )]
PROOF
See Section 7.2.
The converse of the above statement need not be true as will be seen later by examples.
REMARK 3 THEOREM 1
(Factorization Theorem) The r.v.s Xj, j = 1, . . . , k are independent if and only if:
X , , X t1 , , t k = X t j , for all t j , j = 1, , k.
1 k
j =1
( )
167
PROOF
If X1, j = 1, . . . , k are independent, then by Theorem 1(ii), f X , , X x1 , , xk = f X x j .

1 k
j =1
( )
Hence
k k k it X it X X , , X x1 , , xk = E exp i t j X j = E e = Ee j =1 j =1 j =1
1 k
by Lemmas 1 and 2, and this is k j=1X (tj). Let us assume now that
j
X , , X t1 , , t k = X t j .
1 k
j =1
( )
For the discrete case, we have (see Theorem 2(i) in Chapter 6) 1 T it x f X x j = lim e X t j dt j , j = 1, , k, T 2T T and for the multidimensional case, we have (see Theorem 2(i) in Chapter 6)
j
( )
j j
( )
1 f X 1 , , X k ( x1 , , x k ) = lim T 2T 1 = lim T 2T
X 1 , , X k (t1 , , t k )dt1 dt k
k T exp i t j x j T j =1
k k T exp i t j x j X j t j ( dt1 dt k ) T T j =1 j =1
T
( )
k 1 T it j x j k e X j t j dt j = f X x . = lim T 2T T j =1 j ( j ) j =1
( )
That is, Xj, j = 1, . . . , k are independent by Theorem 1(ii). For the continuous case, we have
1 T 1 e it h e X t j dt j , j = 1, , k, h 0 T 2 T it j h and for the multidimensional case, we have (see Theorem 2(ii) in Chapter 6) f X x j = lim lim
j
( )
it j h
( )
T
f X 1 , , X k x1 , , xk
1 = lim lim h 0 T 2
T
j =1
1 e it j h it j h
it j x j
X 1 , , X k t1 , , t k dt1 dt k 1 = lim lim h 0 T 2 dt1 dt k

k 1 = lim lim h 0 T 2 j =1 it h 1 e j it j x j T it j h e X j t j dt j T k
1 e it j h it j x j e Xj t j T j =1 it j h
T k
( )
( )
= fX j ( xj ) ,
j =1
168
which again establishes independence of Xj, j = 1, . . . , k by Theorem 1(ii). A version of this theorem involving m.g.f.s can be formulated, if the m.g.f.s exist.
REMARK 4 COROLLARY
Let X1, X2 have the Bivariate Normal distribution. Then X1, X2 are independent if and only if they are uncorrelated.
PROOF
We have seen that (see Bivariate Normal in Section 3.3 of Chapter 3) fX

1,
X2
(x , x ) =
1 2
1 2 1 2 1 2
e q 2 ,
where
q= 1 1 2
2 x 2 x1 2 x2 2 x2 2 1 1 2 , 1 1 2 2
and
x 2 x 1 1 1 2 , f x = 2 fX 1 x1 = exp exp X2 2 2 2 2 2 2 1 2 2 1 2 Thus, if X1, X2 are uncorrelated, so that = 0, then
( )
( )
fX 1 , X 2 x1 , x 2 = fX 1 x1 fX 2 x 2 ,
( )
( )
that is, X1, X2 are independent. The converse is always true by Corollary 1 in Section 7.2.
Exercises
7.1.1 Let Xj, j = 1, . . . , n be i.i.d. r.v.s with p.d.f. f and d.f. F. Set X (1) = min X 1 , , X n , that is,
X (1) s = min X 1 s , , X n s ,
X n = max X 1 , , X n ;
X ( n ) s = max X 1 s , , X n s .
()
[ ()
( )]
()
[ ()
( )]
Then express the d.f. and p.d.f. of X(1), X(n) in terms of f and F. 7.1.2 Let the r.v.s X1, X2 have p.d.f. f given by f(x1, x2) = I(0,1) (0,1)(x1, x2).
ii) Show that X1, X2 are independent and identify their common distribution; 2 ii) Find the following probabilities: P(X1 + X2 < 1 ), P( X12 + X 2 < 1 ), 3 4 1 P(X1X2 > 2 ). 7.1.3 Let X1, X2 be two r.v.s with p.d.f. f given by f(x1, x2) = g(x1)h(x2).
Exercises 7.1 Stochastic Independence: Criteria of Independence
169
ii) Derive the p.d.f. of X1 and X2 and show that X1, X2 are independent; ii) Calculate the probability P(X1 > X2) if g = h and h is of the continuous type. 7.1.4 Let X1, X2, X3 be r.v.s with p.d.f. f given by f(x1, x2, x3) = 8x1x2x3 IA(x1, x2, x3), where A = (0, 1) (0, 1) (0, 1). ii) Show that these r.v.s are independent; ii) Calculate the probability P(X1 < X2 < X3). 7.1.5 Let X1, X2 be two r.v.s with p.d.f f given by f(x1, x2) = cIA(x1, x2), where 2 A = {(x1, x2) 2; x12 + x 2 9}. ii) Determine the constant c; ii) Show that X1, X2 are dependent. 7.1.6 Let the r.v.s X1, X2, X3 be jointly distributed with p.d.f. f given by 1 f x1 , x 2 , x3 = I A x1 , x 2 , x3 , 4 where
A = 1, 0, 0 , 0, 1, 0 , 0, 0, 1 , 1, 1, 1 .
Then show that ii) Xi, Xj, i j, are independent; ii) X1, X2, X3 are dependent. 7.1.7 Refer to Exercise 4.2.5 in Chapter 4 and show that the r.v.s X1, X2, X3 are independent. Utilize this result in order to nd the p.d.f. of X1 + X2 and X1 + X2 + X3 . 7.1.8 Let Xj, j = 1, . . . , n be i.i.d. r.v.s with p.d.f. f and let B be a (Borel) set in . iii) In terms of f, express the probability that at least k of the Xs lie in B for some xed k with 1 k n; iii) Simplify this expression if f is the Negative Exponential p.d.f. with parameter and B = (1/, ); iii) Find a numerical answer for n = 10, k = 5, = 1 . 2 7.1.9 Let X1, X2 be two independent r.v.s and let g: be measurable. Let also Eg(X2) be nite. Then show that E[g(X2) | X1 = x1] = Eg(X2). 7.1.10 If Xj, j = 1, . . . , n are i.i.d. r.v.s with ch.f. and sample mean X , express the ch.f. of X in terms of . 7.1.11 For two i.i.d. r.v.s X1, X2, show that X X (t) = |X (t)|2, t . (Hint: Use Exercise 6.2.3 in Chapter 6.)
1 2 1
{(
)(
)(
)(
)}
170
7.1.12 Let X1, X2 be two r.v.s with joint and marginal ch.f.s X ,X , X and X . Then X1, X2 are independent if and only if
1 1 1 2
1 ,X2
(t , t ) = (t ) (t ),
1 2 X1 1 X2 2
1 ,X2
t1 , t 2 .
By an example, show that
(t, t ) = (t ) (t ),
X1 X2
t ,
does not imply independence of X1, X2.
7.2 Proof of Lemma 2 and Related Results

We now proceed with the proof of Lemma 2. Suppose that the r.v.s involved are continuous, so that we use integrals. Replace integrals by sums in the discrete case. Thus,
PROOF OF LEMMA 2
k E g j X j = g1 x1 gk xk j =1 f X , , X x1 , , xk dx1 dxk
( )
( )
k
( )
k
) = g ( x ) g ( x ) f ( x ) f ( x )dx dx (by independence) g x f x dx = ( ) ( ) g ( x ) f ( x )dx = E[ g ( X )] E[ g ( X )].

1
X1
Xk
X1
Xk
Now suppose that the gjs are complex-valued, and for simplicity, set gj(Xj) = Yj = Yj 1 + Yj 2, j = 1, . . . , k. For k = 2, E Y1Y2 = E Y11 + iY12 Y21 + iY22
( ) ( ) = [ E(Y Y ) E(Y Y )] + i[ E(Y Y ) + E(Y Y )] = [( EY )( EY ) ( EY )( EY )] + i[( EY )( EY ) ( EY )( EY )] = ( EY + iEY )( EY + iEY ) = ( EY )( EY ).

= E Y11Y21 Y12Y22 + iE Y11Y22 + Y12Y21
11 21 12 22 11 22 12 21 11 21 12 22 11 22 12 21 11 12 21 22 1 2
[(
)(
)]
Next, assume the result to be true for k = m and establish it for k = m + 1. Indeed,
7.2 Independence: Proof of Lemma 2 andof Related Results 7.1 Stochastic Criteria Independence
171
E Y1 Ym+1 = E Y1 Ym Ym+1
1 m
) ] = E(Y Y )( EY ) (by the part just established) = ( EY ) ( EY )( EY ) (by the induction hypothesis).
m+1 1 m m+1
[(
COROLLARY 1
The covariance of an r.v. X and of any other r.v. which is equal to a constant c (with probability 1) is equal to 0; that is, Cov(X, c) = 0.
PROOF
Cov(X, c) = E(cX) (Ec)(EX) = cEX cEX = 0.
COROLLARY 2
If the r.v.s X1 and X2 are independent, then they have covariance equal to 0, provided their second moments are nite. In particular, if their variances are also positive, then they are uncorrelated.
PROOF
In fact, Cov X1 , X 2 = E X1 X 2 EX1 EX 2

1 2 1
) ( )( ) = ( EX )( EX ) ( EX )( EX ) = 0,
2
by independence and Lemma 2. The second assertion follows since (X, Y) = Cov(X, Y)/(X)(Y). The converse of the above corollary need not be true. Thus uncorrelated r.v.s in general are not independent. (See, however, the corollary to Theorem 1 after the proof of part (iii).)
REMARK 5 COROLLARY 3
i) For any k r.v.s Xj, j = 1, . . . , k with nite second moments and variances 2 2 j = (Xj), and any constants cj, j = 1, . . . , k, it holds: k k 2 c j X j = c j2 j2 + ci c j Cov X i , X j j =1 j =1 1i j k
) )
2 = c2 j j + 2 j =1
1i < j k
ci c j Cov X i , X j .
ii) If also j > 0, j = 1, . . . , k, and ij = (Xi, Xj), i j, then: k k 2 2 cj X j = c2 j j + ci c j i j ij j =1 j =1 1i j k

2 = c2 j j + 2 j =1 k 1i < j k
ci c j i j ij .
In particular, if the r.v.s are independent or have pairwise covariances 0 (are pairwise uncorrelated), then:
k 2 2 iii) 2(k j = 1cjXj) = j = 1c j j, and k 2 iii) 2(k j = 1Xj) = j = 1 j
(Bienaym equality).
172
PROOF
iii) Indeed, 2 k k k 2 c j X j = E c j X j E c j X j j =1 j =1 j =1 k = E c j X j EX j j =1 k = E c 2 j X j EX j j =1
) + c c (X
i j i j
EX i X j EX j
)(
2 = c2 j j + j =1 k
1i j k
ci c j Cov X i , X j
) )
i
2 = c2 j j + 2 j =1
This establishes part (i). Part (ii) follows by the fact that Cov(Xi, Xj) = ijij = jiji. iii) Here Cov (Xi, Xj) = 0, i j, either because of independence and Corollary 2, or ij = 0, in case j > 0, j = 1, . . . , k. Then the assertion follows from either part (i) or part (ii), respectively. iii) Follows from part (iii) for c1 = = ck = 1.
(since Cov( X , X ) = Cov( X , X )).

i j j
1i < j k
ci c j Cov X i , X j
Exercises
7.2.1 For any k r.v.s Xj, j = 1, . . . , k for which E(Xj) = (nite) j = 1, . . . , k, show that
(X
j =1
) = (X
2 j =1
+k X
= kS 2 + k X ,
2
where 1 k 1 k 2 X and S = j Xj X . k j =1 k j =1 7.2.2 Refer to Exercise 4.2.5 in Chapter 4 and nd the E(X1 X2), E(X1 X2 X3), 2(X1 + X2), 2(X1 + X2 + X3) without integration. X=
7.2.3 Let Xj, j = 1, . . . , n be independent r.v.s with nite moments of third order. Then show that
n n 3 E X j EX j = E X j EX j . j =1 j =1 Let Xj, j = 1, . . . , n be i.i.d. r.v.s with mean and variance 2, both nite.
7.2.4
7.3 Independence: Some Consequences 7.1 Stochastic Criteria of Independence
173
ii) In terms of , c and , nd the smallest value of n for which the probability that X (the sample mean of the Xs) and differ in absolute value at most by c is at least ; ii) Give a numerical answer if = 0.90, c = 0.1 and = 2. 7.2.5 Let X1, X2 be two r.v.s taking on the values 1, 0, 1 with the following respective probabilities:
f ( 1, 0) = , f ( 1, 1) = ( ) f (0, 1) = , f (0, 0) = 0, f (0, 1) = ; f (1, 1) = , f (1, 0) = , f (1, 1) = . f 1, 1 = ,
, > 0, + =
1 . 4
Then show that: ii) Cov(X1, X2) = 0, so that = 0; ii) X1, X2 are dependent.
7.3 Some Consequences of Independence

The basic assumption throughout this section is that the r.v.s involved are independent. Then ch.f.s are used very effectively in deriving certain classic theorems, as will be seen below. The m.g.f.s, when they exist, can be used in the same way as the ch.f.s. However, we will restrict ourselves to the case of ch.f.s alone. In all cases, the conclusions of the theorems will be reached by way of Theorem 3 in Chapter 6, without explicitly mentioning it.
THEOREM 2
Let Xj be B(nj, p), j = 1, . . . , k and independent. Then X = Xj is B n, p , where n = n j .

j =1 j =1 k
(That is, the sum of independent Binomially distributed r.v.s with the same parameter p and possibly distinct njs is also Binomially distributed.)
PROOF It sufces to prove that the ch.f. of X is that of a B(n, p) r.v., where n is as above. For simplicity, writing j Xj instead of k j=1Xj, when this last expression appears as a subscript here and thereafter, we have
X t = X t = X t = pe it + q
j j
()
()
j =1
()
j =1
) = ( pe
nj
it
+q
which is the ch.f. of a B(n, p) r.v., as we desired to prove.

THEOREM 3
Let Xj be P(j), j = 1, . . . , k and independent. Then X = X j is P , where = j .

j =1 j =1 k
()
174
(That is, the sum of independent Poisson distributed r.v.s is also Poisson distributed.)
PROOF
We have
X t = X t = X t = exp j e it j
j j
()
()
j =1
()
j =1
k k = exp e it j j = exp e it j =1 j =1
which is the ch.f. of a P() r.v.

THEOREM 4
Let Xj, be N(j, 2 j), j = 1, . . . , k and independent. Then

2 k 2 k 2 ii) X = k j = 1Xj is N(, ), where = j = 1j, = j = 1 j, and, more generally, 2 k 2 k 2 2 ii) X = k j = 1cjXj is N(, ), where = j = 1cjj, = j = 1c j j.
(That is, the sum of independent Normally distributed r.v.s is Normally distributed.)
PROOF
(ii) We have
k k 2 c 2t 2 X t = c X t = X cj t = exp icj t j j j 2 j =1 j =1 2 2 t = exp it 2
()
j j
()
( )
with and 2 as in (ii) above. Hence X is N(, 2). (i) Follows from (ii) by setting c1 = c2 = = ck = 1. Now let Xj, j = 1, . . . , k be any k independent r.v.s with
E X j = ,
Set
( )
2 X j = 2,
( )
j = 1, , k.
X=
1 k Xj. k j =1
By assuming that the Xs are normal, we get

COROLLARY
Let Xj be N(, 2), j = 1, . . . , k and independent. Then X is N(, 2/k), or equivalently, [ k ( X )]/ is N(0, 1).
PROOF
In (ii) of Theorem 4, we set

c1 = = c k =
1 2 , 1 = = k = , and 12 = = k =2 k and get the rst conclusion. The second follows from the rst by the use of Theorem 4, Chapter 4, since
7.3 Independence: Some Consequences 7.1 Stochastic Criteria of Independence
175
k X
) = (X ) .
2 k
THEOREM 5
Let Xj be 2 r , j = 1, . . . , k and independent. Then

j
X = X j is r2 , where r = rj .
j =1 j =1
PROOF
We have
X t = X t = X t = 1 2it
j j
()
()
j =1
()
j =1
rj 2
= 1 2it
r 2
which is the ch.f. of a r.v.

2 r
COROLLARY 1
Let Xj be N(j, 2 j), j = 1, . . . , k and independent. Then

k X j j X = j =1 j 2 2 is k .
PROOF
By Lemma 1,
X j j , j
2
j = 1, , k
are independent, and by Theorem 3, Chapter 4, X j j j

2
are 12 ,
j = 1, , k.
Thus Theorem 3 applies and gives the result. Now let Xj, j = 1, . . . , k be any k r.v.s such that E(Xj) = , j = 1, . . . , k. Then the following useful identity is easily established:
(X
j =1
) = ( X
2 j =1
+k X
= kS 2 + k X ,
where S2 =
2 1 k Xj X . k j =1
If, in particular, Xj, j = 1, . . . , k are N(, 2) and independent, then it will be shown that X and S2 are independent. (For this, see Theorem 6, Chapter 9.)
COROLLARY 2
Let Xj, be N(, 2), j = 1, . . . , k and independent. Then kS2/ 2 is 2 k1.

PROOF
We have
2 k X Xj = j =1 k
kS 2 . 2
176
Now Xj j =1
k 2 2 is k
by Corollary 1 above, and k X is 12 , by Theorem 3, Chapter 4. Then taking ch.f.s of both sides of the last identity above, we get (1 2it)k/2 = (1 2it)1/2 kS / (t). Hence kS / (t) = (1 2it)(k1)/2 which is the ch.f. of a 2 k1 r.v.
2 2 2 2
REMARK 6
It thus follows that, kS 2 kS 2 E 2 = k 1, and 2 2 = 2 k 1 ,
or ES 2 =
2 k1 4 k1 2 , and 2 S 2 = . k k2 The following result demonstrates that the sum of independent r.v.s having a certain distribution need not have a distribution of the same kind, as was the case in Theorems 25 above.
THEOREM 6
( ) (
Let Xj, j = 1, . . . , k be independent r.v.s having the Cauchy distribution with parameters = 0 and = 1. Then X = k j = 1Xj is kY, where Y is Cauchy with = 0, = 1, and hence, X/k = X is Cauchy with = 0, = 1. We have X(t) = Xj(t) = [X (t)]k = (e|t|)k = ek|t|, which is the ch.f. of kY, where Y is Cauchy with = 0, = 1. The second statement is immediate.
PROOF
j
1
Exercises
7.3.1 For j = 1, . . . , n, let Xj be independent r.v.s distributed as P(j), and set T = Xj,
j =1 n
= j .
j =1
Then show that ii) The conditional p.d.f. of Xj, given T = t, is B(t, 1 j /), j = 1, . . . , n; ii) The conditional joint p.d.f. of Xj, j = 1, . . . , n, given T = t, is the Multinomial p.d.f. with parameters t and pj = j/, j = 1, . . . , n. 7.3.2 If the independent r.v.s Xj, j = 1, . . . , r have the Geometric distribution with parameter p, show that the r.v. X = X1 + + Xr has the Negative Binomial distribution with parameters r and p.
7.4*
Independence of Classes of Events andof Related Results 7.1 Stochastic Independence: Criteria Independence
177
7.3.3 The life of a certain part in a new automobile is an r.v. X whose p.d.f. is Negative Exponential with parameter = 0.005 day. iii) Find the expected life of the part in question; iii) If the automobile comes supplied with a spare part, whose life is an r.v. Y distributed as X and independent of it, nd the p.d.f. of the combined life of the part and its spare; iii) What is the probability that X + Y 500 days? 7.3.4 Let X1, X2 be independent r.v.s distributed as B(n1, p1) and B(n2, p2), respectively. Determine the distribution of the r.v.s X1 + X2, X1 X2 and X1 X2 + n2.
2 7.3.5 Let X1, X2 be independent r.v.s distributed as N(1, 2 1), and N(2, 2), respectively. Calculate the probability P(X1 X2 > 0) as a function of 1, 2 and 1, 2. (For example, X1 may represent the tensile strength (measured in p.s.i.) of a steel cable and X2 may represent the strains applied on this cable. Then P(X1 X2 > 0) is the probability that the cable does not break.)
7.3.6 Let Xi, i = 1, . . . , m and Yj, j = 1, . . . , n be independent r.v.s such that 2 the Xs are distributed as N(1, 2 1) and the Ys are distributed as N(2, 2). Then ii) Calculate the probability P( X > Y ) as a function of m, n, 1, 2 and 1, 2; ii) Give the numerical value of this probability for m = 10, n = 15, 1 = 2 and 2 2 1 = 2 = 6.
2 7.3.7 Let X1 and X2 be independent r.v.s distributed as 2 r and r , respectively, and for any two constants c1 and c2, set X = c1X1 + c2X2. Under what conditions on c1 and c2 is the r.v. X distributed as 2 r ? Also, specify r.
1 2
7.3.8 Let Xj, j = 1, . . . , n be independent r.v.s distributed as N(, 2) and set X = j X j ,

j =1 n
Y = j X j ,
j =1
where the s and s are constants. Then ii) Find the p.d.f.s of the r.v.s X, Y; ii) Under what conditions on the s and s are the r.v.s X and Y independent?
7.4* Independence of Classes of Events and Related Results

In this section, we give an alternative denition of independence of r.v.s, which allows us to present a proof of Lemma 1. An additional result, Lemma 3, is also stated, which provides a parsimonious way of checking independence of r.v.s.
178
To start with, consider the probability space (S, A, P) and recall that k events A1, . . . , Ak are said to be independent if for all 2 m k and all 1 i1 < < im k, it holds that P(Ai Ai ) = P(Ai ) P(Ai ). This denition is extended to any subclasses of Cj, j = 1, . . . , k, as follows:
1 m 1 m
DEFINITION 2
We say that Cj, j = 1, . . . , k are (stochastically) independent (or independent in the probability sense, or statistically independent) if for every Aj Cj, j = 1, . . . , k, the events A1, . . . , Ak are independent. It is an immediate consequence of this denition that subclasses of independent classes are independent. The next step is to carry over the denition of independence to r.v.s. To this end, let X be a random variable. Then we have seen (Theorem 1, Chapter 3) that X1(B) is a -eld, sub--eld of A, the -eld induced by X. Thus, if we consider the r.v.s Xj, j = 1, . . . , k, we will have the -elds induced by them which we denote by Aj = X j1(B), j = 1, . . . , k.
DEFINITION 3
We say that the r.v.s Xj, j = 1, . . . , k are independent (in any one of the modes mentioned in the previous denition) if the -elds induced by them are independent. From the very denition of X j1(B), for every Aj X j1(B) there exists Bj B such that Aj = X j1(Bj), j = 1, . . . , k. The converse is also obviously true; that is, X j1(Bj) X j1(B), for every Bj B, j = 1, . . . , k. On the basis of these observations, the previous denition is equivalent to Denition 1. Actually, Denition 3 can be weakened considerably, as explained in Lemma 3 below. According to the following statement, in order to establish independence of the r.v.s Xj, j = 1, . . . , k, it sufces to establish independence of the (much smaller) classes Cj, j = 1, . . . , k, where Cj = X j1({(, x], x )}. More precisely,
LEMMA 3
Let A j = X j1 B
( )
and C j = X j1
({(, x]; x )}, j = 1, , k.
Then if Cj are independent, so are Aj, j = 1, . . . , k. By Denition 3, independence of the r.v.s Xj, j = 1, . . . , k means independence of the -elds. That independence of those -elds is implied by independence of the classes Cj, j = 1, . . . , k, is an involved result in probability theory and it cannot be discussed here.
PROOF
We may now proceed with the proof of Lemma 1. In the rst place, if X is an r.v. and AX = X1(B), and if g(X) is a measurable function of X and Ag(X) = [g(X)]1(B), then Ag(X) AX. In fact, let A Ag(X). Then there exists B B such that A = [g(X)]1 (B). But
PROOF OF LEMMA 1
A= g X
[ ( )] (B) = X [g (B)] = X (B),

1 1 1 1
Exercise 7.1 Stochastic Independence: Criteria of Independence
179
where B = g1 (B) and by the measurability of g, B B. It follows that X1 (B) AX and thus, A AX. Let now Aj = Xj1(B) and
A j* = g X j
[ ( )] (B ),
1
j = 1, , k.
Then A j* A j , j = 1, , k,
and since Aj, j = 1, , k, are independent, so are A* j , j = 1, . . . , k.
Exercise
7.4.1 Consider the probability space (S, A, P) and let A1, A2 be events. Set X1 = IA , X2 = IA and show that X1, X2 are independent if and only if A1, A2 are independent. Generalize it for the case of n events Aj, j = 1, . . . , n.
1 2
180
Basic Limit Theorems
Chapter 8
8.1 Some Modes of Convergence

Let {Xn}, n = 1, 2, . . . be a sequence of random variables and let X be a random variable dened on the sample space S supplied with a class of events A and a probability function P (that is, the sequence of the r.v.s and the r.v. X are dened on the probability space (S, A, P)). For such a sequence of r.v.s four kinds of convergence are dened, and some comments are provided as to their nature. An illustrative example is also discussed.
DEFINITION 1
i) We say that {Xn} converges almost surely (a.s.), or with probability one, to a.s. X as n , and we write Xn X, or Xn X with probability 1, n n or P[Xn X ] = 1, if X ( s ) X ( s ) for all s S except possibly for n n n a subset N of S such that P(N) = 0. c a.s. Thus Xn X means that for every > 0 and for every s N there n exists N(, s) > 0 such that
Xn s X s <
for all n N(, s). This type of convergence is also known as strong convergence. ii) We say that {Xn} converges in probability to X as n , and we write P Xn 0. X, if for every > 0, P[|Xn X| > ] n n
P Thus Xn X means that: For every , > 0 there exists N(, ) > 0 n such that P[|Xn X| > ] < for all n N(, ). P REMARK 1 Since P[|Xn X| > ] + P[|Xn X| ] = 1, then Xn X is n equivalent to: P[|Xn X| ] 1. Also if P[|Xn X| > ] 0 for every n n > 0, then clearly P[|Xn X| ] 0. n
()
()
180
8.1
Some Modes of Convergence
181
Let now Fn = FX , F = FX. Then

n
iii) We say that {Xn} converges in distribution to X as n , and we write d Xn X, if Fn(x) F(x) for all x for which F is continuous. n n d Thus Xn X means that: For every > 0 and every x for which n F is continuous there exists N(, x) such that |Fn(x) F(x)| < for all n N(, x). This type of convergence is also known as weak convergence.
d REMARK 2 If Fn have p.d.f.s fn, then Xn X does not necessarily imply n the convergence of fn(x) to a p.d.f., as the following example illustrates.
For n = 1, 2, . . . , consider the p.d.f.s dened by

1 , fn x = 2 0,
()
if
x = 1 1 n
( )
or
x = 1+ 1 n
( )
EXAMPLE 1
otherwise.
Then, clearly, fn(x) f(x) = 0 for all x and f(x) is not a p.d.f. n Next, the d.f. Fn corresponding to fn is given by
0, 1 , Fn x = 2 1,
()
if if if
( ) 1 (1 n) x < 1 + (1 n) x 1 + (1 n).
x < 1 1 n
1
1 2
Fn
Figure 8.1
0 1
1 n
1 n
One sees that Fn(x) F(x) for all x 1, where F(x) is dened by n
0 , F x = 1,
()
if if
x<1 x 1,
which is a d.f. Under further conditions on fn, f, it may be the case, however, that fn converges to a p.d.f. f. We now assume that E|Xn|2 < , n = 1, 2, . . . , Then: iv) We say that {Xn} converges to X in quadratic mean (q.m.) as n , and we 2 q.m. write Xn 0. X, if E|Xn X| n n q.m. Thus Xn X means that: For every > 0, there exists N() > 0 such n that E|Xn X|2 < for all n N().
182
REMARK 3 Almost sure convergence is the familiar pointwise convergence of the sequence of numbers {Xn(s)} for every s outside of an event N of probability zero (a null event). Convergence in distribution is also a pointwise convergence of the sequence of numbers {Fn(x)} for every x for which F is continuous. Convergence in probability, however, is of a different nature. By setting An = {s S; |Xn(s) X(s)| > } for an arbitrary but xed > 0, we have P that Xn 0. So the sequence of numbers {P(An)} tends X, if P(An) n n to 0, as n , but the events An themselves keep wandering around the sample space S. Finally, convergence in quadratic mean simply signies that the averages E|Xn X|2 converge to 0 as n .
Exercises
8.1.1 For n = 1, 2, . . . , n, let Xn be independent r.v.s such that
P X n = 1 = pn ,
P X n = 0 = 1 pn.
P n
0? Under what conditions on the pns does Xn 8.1.2 For n = 1, 2, . . . , let Xn be an r.v. with d.f. Fn given by Fn(x) = 0 if x < n and Fn(x) = 1 if x n. Then show that Fn(x) 0 for every x . n Thus a convergent sequence of d.f.s need not converge to a d.f. 8.1.3 Let Xj, j = 1, . . . , n, be i.i.d. r.v.s such that EXj = , 2(Xj) = 2, both n )2 nite. Show that E(X 0. n 8.1.4 For n = 1, 2, . . . , let Xn, Yn be r.v.s such that E(Xn Yn)2 0 and n q.m. suppose that E(Xn X)2 0 for some r.v. X . Then show that Y n n n X. 8.1.5 Let Xj , j = 1, . . . , n be independent r.v.s distributed as U(0, 1), and set Yn = min(X1, . . . , Xn), Zn = max(X1, . . . , Xn), Un = nYn, Vn = n(1 Zn). Then show that, as n , one has
P i) Yn 0; P ii) Zn 1; d iii) Un U; d iv) Vn V, where U and V have the negative exponential distribution with parameter = 1.
8.2 Relationships Among the Various Modes of Convergence

The following theorem states the relationships which exist among the various modes of convergence.
183
THEOREM 1
a.s. P i) Xn X implies Xn X. n n q.m. P ii) Xn X implies X X. n n n P d iii) Xn X implies Xn X. The converse is also true if X is degenern n ate; that is, P[X = c] = 1 for some constant c. In terms of a diagram this is
a.s. conv. conv. in prob. conv. in dist. conv. in q.m.
PROOF i) Let A be the subset of S on which Xn X. Then it is not hard to see n (see Exercise 8.2.4) that
1 A = I U I X n+ r X < , k k=1 n=1 r =1
so that the set Ac for which Xn X is given by n

1 A c = U I U X n+ r X . k k=1 n=1 r =1
The sets A, Ac as well as those appearing in the remaining of this discussion are all events, and hence we can take their probabilities. By setting
1 Bk = I U X n+ r X , k n=1 r =1
we have BkAc, as k , so that P(Bk) P(Ac), by Theorem 2, Chapter a.s. 2. Thus if Xn X, then P(Ac) = 0, and therefore P(Bk) = 0, k 1. Next, n it is clear that for every xed k, and as n , CnBk, where
1 C n = U X n+ r X . k r =1
Hence P(Cn)P(Bk) = 0 by Theorem 2, Chapter 2, again. To summarize, if a.s. Xn X, which is equivalent to saying that P(Ac) = 0, one has that n P(Cn) 0. But for any xed positive integer m, n
1 1 X X n+ m U X n+ r X , k r =1 k
so that 1 1 P X n+ m X P U X n+ r X = P C n 0 n k k r =1 P for every k 1. However, this is equalivalent to saying that Xn X, as n was to be seen. ii) By special case 1 (applied with r = 2) of Theorem 1, we have
( )
P Xn X >
E Xn X
184

q.m. Thus, if Xn X, then E|Xn X|2 0 implies P[|Xn X| > ] n n n P 0 for every > 0, or equivalently, Xn X . n
iii) Let x be a continuity point of F and let > 0 be given. Then we have
[X x ] = [X [X [X [X
n
n n n
x, X x + X n > x, X x
since
] [ x] [ X ] [ [X
n
n
] [
x + X n > x, X x
n
X ,
> x, X x = X n > x, X x +
X Xn X .
So
] [
[X x ] [X
implies
x Xn X
] [
]
]
P X x P Xn x + P Xn X ,
] [
)
] [
or
F x Fn x + P X n X .
Thus, if Xn X, then we have by taking limits
P n
() [
F x lim inf Fn x . n In a similar manner one can show that lim sup Fn x F x + . n
()
(1)
() (
(2)
But (1) and (2) imply F(x ) lim inf Fn(x) lim sup Fn(x) F(x + ). n n Letting 0, we get (by the fact that x is a continuity point of F ) that F x lim inf Fn x lim sup Fn x F x . n n Hence lim Fn(x) exists and equals F(x). Assume now that P[X = c] = 1. Then
n
()
()
() ()
0 , F x = 1,
()
x<c xc
and our assumption is that Fn(x) F(x), x c. We must show that n P Xn c . We have n
P X n c = P X n c
] [
[ ] = P[ X c + ] P[ X P[ X c + ] P[ X = F (c + ) F (c ).
= P c Xn c +
n n n n
] c ]
< c
185
Since c , c + are continuity points of F, we get
lim P X n c F c + F c = 1 0 = 1.
n
] ( ) ( ) ]
n
Thus
P Xn c 1.
REMARK 4 not true.

EXAMPLE 2
It is shown by the following example that the converse in (i) is
Let S = (0, 1], and let P be the probability function which assigns to subintervals of (0, 1] as measures of their length. (This is known as the Lebesgue measure over (0, 1].) Dene the sequence X1, X2, . . . of r.v.s as follows: For each k = 1, 2, . . . , divide (0, 1] into 2k1 subintervals of equal length. These intervals are then given by
j 1 j k 1 , k 1 , 2 2
j = 1, 2, , 2 k 1.
For each k = 1, 2, . . . , we dene a group of 2k1 r.v.s, whose subscripts range from 2k1 to 2k 1, in the following way: There are (2k 1) (2k1 1) = 2k1 r.v.s within this group. We dene the jth r.v. in this group to be equal to 1 for
j 1 j s k1 , k1 and 0, otherwise. 2 2
We assert that the so constructed sequence X1, X2, . . . of r.v.s converges to 0 in probability, while it converges nowhere pointwise, not even for a single q.m. s (0, 1]. In fact, by Theorem 1(ii), it sufces to show that Xn 0; n 2 that is, EX n 0. For any n 1, we have that X is the indicator of an n n interval
j 1 j k1 , k1 2 2
k1 for some k and j as above. Hence EX 2 . It is also clear that for m > n, n = 1/2 2 k1 k1 EX m 1/2 . Since for every > 0, 1/2 < for all sufciently large k, the proof that EX 2 0 is complete. n n P X need not imply that The example just discussed shows that Xn n a.s. q.m. a.s. Xn X , and also that X X need not imply Xn X. That n n n n a.s. q.m. Xn X need not imply that X X is seen by the following example. n n n
EXAMPLE 3
Let S and P be as in Example 2, and for n 1, let Xn be dened by Xn = q.m. 0 but EX 2 0. nI(0,1/n]. Then, clearly, Xn n n = n(1/n) = 1, so that Xn n
q.m. REMARK 5 In (ii), if P[X = c] = 1, then: Xn X if and only if n
E Xn c, 2 X n 0. n n
In fact,
( )
( )
186
E Xn c
Hence E(Xn c)2 0 if and only if 2(Xn) 0 and EXn c. n n n
) ( = E( X EX ) + ( EX = ( X ) + ( EX c ) .
2 n n 2 2 n n
= E X n EX n + EX n c
n
[(
)] c)
REMARK 6 The following example shows that the converse of (iii) is not true.
EXAMPLE 4
Let S = {1, 2, 3, 4}, and on the subsets of S, let P be the discrete uniform function. Dene the following r.v.s:
X n 1 = X n 2 = 1, X n 3 = X n 4 = 0, n = 1, 2, ,
()
()
()
()
and
X 1 = X 2 = 0,
()
()
X 3 = X 4 = 1.
()
()
Then
X n s X s = 1 for all s S .
Hence Xn does not converge in probability to X, as n . Now,
()
()
FX n
()
0, 1 , x = 2 1,
x<0 0 x < 1, x1
FX
()
0, 1 , x = 2 1,
n
x<0 0 x < 1, x1
so that FX (x) = FX(x) for all x . Thus, trivially, FX (x) FX(x) for all n d continuity points of FX; that is, Xn X , but X does not converge in n n probability to X. Very often one is confronted with the problem of proving convergence in distribution. The following theorem replaces this problem with that of proving convergence of ch.f.s, which is much easier to deal with.
n
THEOREM 2
(P. Lvys Continuity Theorem) Let {Fn} be a sequence of d.f.s, and let F be a d.f. Let n be the ch.f. corresponding to Fn and be the ch.f. corresponding to F. Then, F(x) for all continuity points x of F, then n(t) (t), for i) If Fn (x) n n every t . ii) If n(t) converges, as n , and t , to a function g(t) which is continuous at t = 0, then g is a ch.f., and if F is the corresponding d.f., then Fn (x) n F(x), for all continuity points x of F.
PROOF Omitted. REMARK 7 The assumption made in the second part of the theorem above according to which the function g is continuous at t = 0 is essential. In fact, let Xn be an r.v. distributed as N(0, n), so that its ch.f. is given by n(t) = et n/2. Then
2
8.3
The Central Limit Theorem
187
n(t) g(t), where g(t) = 0, if t 0, and g(0) = 1, so that g is not continuous n at 0. The conclusion in (ii) does not hold here because
X x x 1 FX x = P X n x = P n = n 2 n n n 1 for every x and F(x) = , x , is not a d.f. of an r.v. 2
n
()
Exercises
8.2.1 (Rnyi) Let S = [0, 1) and let P be the probability function on subsets of S, which assigns probability to intervals equal to their lengths. For n = 1, 2, . . . , dene the r.v.s Xn as follows:
j j +1 N , if s< s = 2N + 1 2N + 1 +j 0, otherwise, j = 0, 1, . . . , 2N, N = 1, 2, . . . . Then show that P 0; i) Xn n ii) Xn(s) 0 for any s [0, 1); n 0, s (0, 1); iii) Xn (s) n iv) EXn 0. n XN
2
()
8.2.2 For n = 1, 2, . . . , let Xn be r.v.s distributed as B(n, pn), where npn = d n (>0). Then, by using ch.f.s, show that Xn X, where X is an r.v. n n distributed as P(). 8.2.3 For n = 1, 2, . . . , let Xn be r.v.s having the negative binomial distribution with pn and rn such that pn , so that rn(1 pn) = n 1, rn n n n d (>0). Show that Xn X , where X is an r.v. distributed as P ( ). (Use n ch.f.s.) 8.2.4 If the i.i.d. r.v.s Xj, j = 1, . . . , n have a Cauchy distribution, show that P n there is no nite constant c for which X c. (Use ch.f.s.) n 8.2.5 In reference to the proof of Theorem 1, show that the set A of conver1 gence of {Xn} to X is, indeed, expressed by A = Ik ). =1 Un =1 I r =1(|Xn+r X| < k
8.3 The Central Limit Theorem

We are now ready to formulate and prove the celebrated Central Limit Theorem (CLT) in its simplest form.
THEOREM 3
(Central Limit Theorem) Let X1, . . . , Xn be i.i.d. r.v.s with mean (nite) and (nite and positive) variance 2. Let
188
n X 1 n n , and x = X , G x = P x j n n j =1 Then Gn(x) (x) for every x in . n Xn =
()
()
1 2
e t 2 dt .
2
REMARK 8 i) We often express (loosely) the CLT by writing n Xn Sn E Sn N 0, 1 , or N 0, 1 , Sn for large n, where
( )
( ) ( )
n
( )
Sn = X j , since
j =1
n Xn
)=S
( ). (S )
E Sn
n
ii) In part (i), the notation Sn was used to denote the sum of the r.v.s X1, . . . , Xn. This is a generally accepted notation, and we are going to adhere to it here. It should be pointed out, however, that the same or similar symbols have been employed elsewhere to denote different quantities (see, for example, Corollaries 1 and 2 in Chapter 7, or Theorem 9 and Corollary to Theorem 8 in this chapter). This point should be kept in mind throughout. iii) In the proof of Theorem 3 and elsewhere, the little o notation will be employed as a convenient notation for the remainder in Taylor series expansions. A relevant comment would then be in order. To this end, let {an}, {bn}, n = 1, 2, . . . be two sequences of numbers. We say that {an} is o(bn) (little o of bn) and we write an = o(bn), if an/bn 0. For example, if an n = n and bn = n2, then an = o(bn), since n/n2 = 1/n 0. Clearly, if an = n o(bn), then an = bno(1). Therefore o(bn) = bno(1). iv) We recall the following fact which was also employed in the proof of Theorem 3, Chapter 3. Namely, if an a, then n
an e a. 1 + n n
n
PROOF OF THEOREM 3 We may now begin the proof. Let gn be the ch.f. of Gn and be the ch.f. of ; that is, (t) = et /2, t . Then, by Theorem 2, it sufces to prove that gn(t) (t), t . This will imply that Gn(x) (x), n x . We have
2
n Xn
) = nX
= 1 n
n
n
1 n
Xj
j =1
Zj ,
j =1
8.3
189
where Zj = (Xj )/, j = 1, . . . , n are i.i.d. with E(Zj) = 0, 2(Zj) = E(Z2j) = 1. Hence, for simplicity, writing j Zj instead of n j=1 Zj, when this last expression appears as a subscript, we have
gn t = g t
()
n jZ j
()
t 1 t = g jZ j = g Z1 . n n
1
Now consider the Taylor expansion of gz around zero up to the second order term. Then t t2 t 1 t gZ gZ gZ 0 + o . 0 + = gZ 0 + 2! n n n n
1 1
()
()
()
Since
2 g Z1 0 = 1, g Z = 1, 1 0 = iE Z1 = 0, g Z 1 0 = i 2 E Z 1
()
()
( )
()
( )
we get t t2 t2 t2 t2 t2 gZ 1 o 1 o 1 = 1 1 o 1 . = + = + n 2n 2n n 2n n
1
()
n
( )]
Thus t2 1o 1 . g n t = 1 2n
()
[ ( )]
Taking limits as n we have, gn(t) et /2, which is the ch.f. of n . The theorem just established has the following corollary, which along with the theorem itself provides the justication for many approximations.
2
COROLLARY
(x) is uniform in x . The convergence Gn(x) n (That is, for every x and every > 0 there exists N() > 0 independent of x, such that |Gn(x) (x)| < for all n N() and all x simultaneously.)
PROOF It is an immediate consequence of Lemma 1 in Section 8.6*.

The following examples are presented for the purpose of illustrating the theorem and its corollary.
8.3.1 Applications
1. If Xj, j = 1, . . . , n are i.i.d. with E(Xj) = , 2(Xj) = 2, the CLT is used to give an approximation to P[a < Sn b], < a < b < +. We have:
190
a E Sn Sn E Sn b E Sn P a < Sn b = P < Sn Sn Sn a n S n E S n b n = P < S n n n Sn E Sn Sn E Sn b n a n P = P Sn n n Sn b* a * ,
( ) ( )
( ) ( ) ( ) ( )
a* =
( ) ( ) ( ) ( )
( ) ( )
( ) ( )
where . n n (Here is where the corollary is utilized. The points a* and b* do depend on n, and therefore move along as n . The above approximation would not be valid if the convergence was not uniform in x .) That is, P(a < Sn b) (b*) (a*). 2. Normal approximation to the Binomial. This is the same problem as above, where now Xj, j = 1, . . . , n, are independently distributed as B(1, p). We have = p, = pq . Thus:
P a < Sn b b * a * ,
a n
, b* =
b n
( ) ( )
b np npq ,
where
a* = a np npq , b* =
REMARK 9 It is seen that the approximation is fairly good provided n and 1 p are such that npq 20. For a given n, the approximation is best for p = and 2 1 deteriorates as p moves away from . Some numerical examples will shed some 2 light on these points. Also, the Normal approximation to the Binomial distribution presented above can be improved, if in the expressions of a* and b* we replace a and b by a + 0.5 and b + 0.5, respectively. This is called the continuity correction. In the following we give an explanation of the continuity correction. To start with, let
n fn r = p r q n r , and let n x = r
()
()
1 2npq
ex
where
. npq Then it can be shown that fn(r)/n(x) 1 and this convergence is uniform n for all xs in a nite interval [a, b]. (This is the De Moivre theorem.) Thus for x= r np
8.3
191
large n, we have, in particular, that fn(r) is close to n(x). That is, the probability r nr (n is approximately equal to the value r )p q
r np 2 exp 2 npq 2npq of the normal density with mean np and variance npq for sufciently large n. Note that this asymptotic relationship of the p.d.f.s is not implied, in general, by the convergence of the distribution functions in the CLT. 1
1 To give an idea of how the correction term comes in, we refer to Fig. 8.2 2 drawn for n = 10, p = 0.2.
0.3 N (2, 1.6) 0.2 0.1 0

Figure 8.2
Now P 1 < S n 3 = P 2 S n 3 = fn 2 + fn 3 = shaded area, while the approximation without correction is the area bounded by the normal curve, the horizontal axis, and the abscissas 1 and 3. Clearly, the correction, given by the area bounded by the normal curve, the horizontal axis and the abscissas 1.5 and 3.5, is closer to the exact area. To summarize, under the conditions of the CLT, and for discrete r.v.s, b n a n P a < S n b n n and
()
()
without continuity correction,
b + 0.5 n a + 0.5 n P a < S n b n n
with continuity correction.

In particular, for integer-valued r.v.s and probabilities of the form P(a Sn bn), we rst rewrite the expression as follows:
192
P a S n bn = P a 1 < S n bn ,
and then apply the above approximations in order to obtain:
P a Sn b b * a *
((
(3)
( ) ( )
a 1 n
where a* = and
, b* =
b n
(4)
P a S n b b a
( ) ( )
with continuity correction,
where (5) . n n These expressions of a*, b* and a, b in (4) and (5) will be used in calculating probabilities of the form (3) in the numerical examples below.
EXAMPLE 5
1 5 , p2 = 16 , nd P(45 Sn 55). (Numerical) For n = 100 and p1 = 2 1 i) For p1 = : Exact value: 0.7288 2
a =
a 0.5 n
, b =
b + 0.5 n
Normal approximation without correction: 1 44 100 2 = 6 = 1.2, a* = 1 1 5 100 2 2 1 55 100 5 2 = = 1. b* = 1 1 5 100 2 2 Thus
b * a * = 1 1.2 = 1 + 1.2 1
= 0.841345 + 0.884930 1 = 0.7263.
Normal approximation with correction: 1 45 0.5 100 2 = 5.5 = 1.1 a = 5 1 1 100 2 2 1 55 + 0.5 100 2 = 5.5 = 1.1. b = 5 1 1 100 2 2
( ) ( )
() (
() ( )
8.3
193
Thus
b a = 1.1 1.1 = 2 1.1 1 = 2 0.864334 1 = 0.7286.
( ) ( )
( ) (
( )
Error without correction: 0.7288 0.7263 = 0.0025. Error with correction: 0.7288 0.7286 = 0.0002.
5 ii) For p2 = 16 , working as above, we get:
Exact value: 0.0000.
a* = 2.75, b* = 4.15, a = 2.86, b = 5.23,

Then:
so that b * a * = 0.0030.
( ) ( ) so that (b) (a) = 0.0021.
Error without correction: 0.0030. Error with correction: 0.0021. 3. Normal approximation to Poisson. This is the same problem as in (1), where now Xj, j = 1, . . . , n are independent P(). We have = , = . Thus b n a n P a < S n b n n and
a + 0.5 n b + 0.5 n P a < S n b n n
with continuity correction.
Probabilities of the form P(a Sn b) are approximated as follows:

P a Sn b b * a *
( ) ( )
n
where a* = and
P a S n b b a
a 1 n
, b* =
b n n
( ) ( )
n
with continuity correction,
where a =
EXAMPLE 6
a 0.5 n
, b =
b + 0.5 n n
(Numerical) For n = 16, nd P(12 Sn 21). We have: Exact value: 0.7838.
194
Normal approximation without correction: 5 21 16 5 = 1.25, b* = = = 1.25, 4 4 16 16 so that (b*) (a*) = (1.25) (1.25) = 2(1.25) 1 = 2 0.894350 1 = 0.7887. a* = = Normal approximation with correction:
a = 1.125, b = 1.375, so that b a = 0.7851.
11 16
( ) ( )
Error without correction: 0.0049. Error with correction: 0.0013.
Exercises
8.3.1 Refer to Exercise 4.1.12 of Chapter 4 and suppose that another manufacturing process produces light bulbs whose mean life is claimed to be 10% higher than the mean life of the bulbs produced by the process described in the exercise cited above. How many bulbs manufactured by the new process must be examined, so as to establish the claim of their superiority with probability 0.95? 8.3.2 A fair die is tossed independently 1,200 times. Find the approximate probability that the number of ones X is such that 180 X 220. (Use the CLT.) 8.3.3 Fifty balanced dice are tossed once and let X be the sum of the upturned spots. Find the approximate probability that 150 X 200. (Use the CLT.) 8.3.4 Let Xj, j = 1, . . . , 100 be independent r.v.s distributed as B(1, p). Find the exact and approximate value for the probability P( j100 = 50). (For the =1 Xj latter, use the CLT.) 8.3.5 One thousand cards are drawn with replacement from a standard deck of 52 playing cards, and let X be the total number of aces drawn. Find the approximate probability that 65 X 90. (Use the CLT.) 8.3.6 A Binomial experiment with probability p of a success is repeated 1 1 1,000 times and let X be the number of successes. For p = and p = , nd 2 4 the exact and approximate values of probability P(1,000p 50 X 1,000p + 50). (For the latter, use the CLT.) 8.3.7 From a large collection of bolts which is known to contain 3% defective bolts, 1,000 are chosen at random. If X is the number of the defective bolts among those chosen, what is probability that this number does not exceed 5% of 1,000? (Use the CLT.)
Exercises
195
8.3.8 Suppose that 53% of the voters favor a certain legislative proposal. How many voters must be sampled, so that the observed relative frequency of those favoring the proposal will not differ from the assumed frequency by more than 2% with probability 0.99? (Use the CLT.)
1 8.3.9 In playing a game, you win or lose $1 with probability . If you play the 2 game independently 1,000 times, what is the probability that your fortune (that is, the total amount you won or lost) is at least $10? (Use the CLT.)
8.3.10 A certain manufacturing process produces vacuum tubes whose lifetimes in hours are independently distributed r.v.s with Negative Exponential distribution with mean 1,500 hours. What is the probability that the total life of 50 tubes will exceed 75,000 hours? (Use the CLT.) 8.3.11 Let Xj, j = 1, . . . , n be i.i.d. r.v.s such that EXj = nite and 2(Xj) = n | c) = 0.90. (Use 2 = 4. If n = 100, determine the constant c so that P(|X the CLT.) 8.3.12 Let Xj, j = 1, . . . , n be i.i.d. r.v.s with EXj = nite and 2(Xj) = 2 (0, ). n | k) i) Show that the smallest value of the sample size n for which P(|X 2 1 p p is given by n = [ k if this number is an integer, and n is 1 ( 1+ ) 2 ] the integer part of this number increased by 1, otherwise. (Use the CLT.); ii) By using Tchebichevs inequality, show that the above value of n is given 1 by n = k (1 if this number is an integer, and n is the integer part of this p) number increased by 1, otherwise; iii) For p = 0.95 and k = 0.05, 0.1, 0.25, compare the respective values of n in parts (i) and (ii).
2
8.3.13 Refer to Exercise 4.1.13 in Chapter 4 and let Xj, j = 1, . . . , n be the diameters of n ball bearings. If EXj = 0.5 inch and = 0.0005 inch, what is the n | 0.0001) = 0.099? (Use Exercise minimum value of n for which P(|X 8.3.12.) 8.3.14 Let Xj, j = 1, . . . , n, Yj = 1, . . . , n be independent r.v.s such that the Xs are identically distributed with EXj = 1, 2(Xj) = 2, both nite, and the Ys are identically distributed with EYj = 2 nite and 2(Yj) = 2. Show that: i) E ( X n Yn ) = 1 2 , 2 ( X n Yn ) = 2 ; n n [( X Y )( )] ii) is asymptotically distributed as N(0, 1). 2
2
8.3.15 Let Xj, j = 1, . . . , n, Yj, j = 1, . . . , n be i.i.d. r.v.s from the same distribution with EXj = EYj = and 2(Xj) = 2(Yj) = 2, both nite. Determine | 0.25) = 0.95. (Use Exercise 8.3.12.) n Y the sample size n so that P(|X n 8.3.16 An academic department in a university wishes to admit c rst-year graduate students. From past experience it follows that, on the average, 100p% of the students admitted will, actually, accept an admission offer (0 < p
196
< 1). It may be assumed that acceptance and rejection of admission offers by the various students are independent events. i) How many students n must be admitted, so that the probability P(|X c| d) is maximum, where X is the number of students actually accepting an admission, and d is a prescribed number? ii) What is the value of n for c = 20, d = 2, and p = 0.6? iii) What is the maximum value of the probability P(|X 20| 2) for p = 0.6? Hint: For part (i), use the CLT (with continuity correction) in order to nd the approximate value to P(|X c| d). Then draw the picture of the normal curve, and conclude that the probability is maximized when n is close to c/p. For part (iii), there will be two successive values of n suggesting themselves as optimal values of n. Calculate the respective probabilities, and choose that value of n which gives the larger probability.)
8.4 Laws of Large Numbers

This section concerns itself with certain limit theorems which are known as laws of large numbers (LLN). We distinguish two categories of LLN: the strong LLN (SLLN) in which the convergence involved is strong (a.s.), and the weak LLN (WLLN), where the convergence involved is convergence in probability.
THEOREM 4
(SLLN) If Xj, j = 1, . . . , n are i.i.d. r..s with (nite) mean , then

X1 + + X n a.s. . n n a.s. n The converse is also true, that is, if X to some nite constant , n then E(Xj) is nite and equal to . Xn =
PROOF Omitted; it is presented in a higher level probability course. a.s. P n n Of course, X implies X . The latter are the weak LLN; that is, n n
THEOREM 5
(WLLN) If Xj, j = 1, . . . , n, are i.i.d. r..s with (nite) mean , then

Xn = X1 + + X n P . n n
PROOF
i) The proof is a straightforward application of Tchebichevs inequality under the unnecessary assumption that the r.v.s also have a nite variance 2. n = , 2(X n) = 2/n, so that, for every > 0, Then EX
P Xn
1 2 0 as n . 2 n
8.4 Laws of Large Numbers
197
ii) This proof is based on ch.f.s (m.g.f.s could also be used if they exist). By Theorems 1(iii) (the converse case) and 2(ii) of this chapter, in order to P n prove that X , it sufces to prove that n
X t t = e it , for t .
n
()
()
For simplicity, writing Xj instead of n j=1 Xj, when this last expression appears as a subscript, we have n t t X t = 1 nx t = x = X n n
n
()
()
t t = 1 + i + o n n
t t = 1 + i + o 1 n n
()
t = 1 + i + o 1 e it . n n REMARK 10 An alternative proof of the WLLN, without the use of ch.f.s, is presented in Lemma 1 in Section 8.6*. The underlying idea there is that of truncation, as will be seen.
( )]
Both laws of LLN hold in all concrete cases which we have studied except for the Cauchy case, where E(Xj) does not exist. For example, in the Binomial case, we have: If Xj, j = 1, . . . , n are independent and distributed as B(1, p), then
Xn = X1 + + X n p n n a.s.
and also in probability. For the Poisson case we have: If Xj, j = 1, . . . , n are independent and distributed as P(), then:
Xn =
and also in probability.
X1 + + X n n n
a.s.
8.4.1 An Application of SLLN and WLLN

Let Xj, j = 1, . . . , n be i.i.d. with d.f. F. The sample or empirical d.f. is denoted by Fn and is dened as follows:
For x ,
Fn x =
()
1 the number of X 1 , , X n x . n
198
Fn is a step function which is a d.f. for a xed set of values of X1, . . . , Xn. It is also an r.v. as a function of the r.v.s X1,, . . . , Xn, for each x. Let 1, Yj x = Yj = 0,
()
Xj x X j > x,
j = 1, , n.
Then, clearly, Fn x =
()
)
1 n Yj . n j =1
On the other hand, Yj, j = 1, . . . , n are independent since the Xs are, and Yj is B(1, p), where
p = P Yj = 1 = P X j x = F x .
()
Hence n n E Yj = np = nF x , 2 Yj = npq = nF x 1 F x . j =1 j =1
()
( )[
( )]
It follows that
1 nF x = F x . n So for each x , we get by the LLN E Fn x =

a.s. Fn x F x , n
[ ( )]
()
()
()
()
P Fn x F x. n
()
()
Actually, more is true. Namely,

THEOREM 6
(GlivenkoCantelli Lemma) With the above notation, we have P sup Fn x F x ; x 0 = 1 n a.s. (that is, Fn(x) F ( x ) uniformly in x ). n
() ()
PROOF Omitted.
Exercises
8.4.1 Let Xj, j = 1, . . . , n be i.i.d. r.v.s and suppose that EX k j is nite for a given positive integer k. Set
n (k ) 1 Xn = Xk j n j =1
for the kth sample moment of the distribution of the X s and show that P (k) n X EX k 1. n 8.4.2 Let Xj, j = 1, . . . , n be i.i.d. r.v.s with p.d.f. given in Exercise 3.2.14 of Chapter 3 and show that the WLLN holds. (Calculate the expectation by means of the ch.f.)
8.5 Further Limit Theorems
199
8.4.3 Let Xj, j = 1, . . . , n be r.v.s which need be neither independent nor identically distributed. Suppose that EXj = j, 2(Xj) = 2 j, all nite, and set
n =
1 n j. n j =1
Then a generalized version of the WLLN states that

P X n n 0. n
Show that if the Xs are pairwise uncorrelated and 2 j M(<), j 1, then the generalized version of the WLLN holds. 8.4.4 Let Xj, j = 1, . . . , n be pairwise uncorrelated r.v.s such that
P X j = j = P X j = j =
) (
1 . 2
Show that for all s such that 0 < 1, the generalized WLLN holds. 8.4.5 Decide whether the generalized WLLN holds for independent r.v.s such that the jth r.v. has the Negative Exponential distribution with parameter j = 2j/2. 8.4.6 For j = 1, 2, . . . , let Xj be independent r.v.s such that Xj is distributed as j2/ j . Show that the generalized WLLN holds. 8.4.7 For j = 1, 2, . . . , let Xj be independent r.v.s such that Xj is distributed as P( j). If {1/nn j=1j} remains bounded, show that the generalized WLLN holds.

In this section, we present some further limit theorems which will be used occasionally in the following chapters.
THEOREM 7
i) Let Xn, n 1, and X be r.v.s, and let g: be continuous, so that g(Xn), a.s. a.s. g(X). n 1, and g(X) are r.v.s. Then Xn X implies g(Xn) n n
( j) , n 1, and Xj are r.v.s, and g: ii) More generally, if for j = 1, . . . , k, X n k (1) (k) is continuous, so that g(X n , . . . , X n ) and g(X1, . . . , Xk) are r.v.s, then
( j ) a.s. X j , Xn n (1 ) (k ) a.s. g X1 , , X k . j = 1, , k imply g X n , , X n n
200
PROOF Follows immediately from the denition of the a.s. convergence and the continuity of g.
A similar result holds true when a.s. convergence is replaced by convergence in probability, but a justication is needed.
THEOREM 7
P i) Let Xn, n 1, X and g be as in Theorem 7(i), and suppose that Xn X. n P Then g(Xn) g ( X ). n j) ii) More generally, let again X ( n , Xj and g be as in Theorem 7(ii), and suppose P P ( j) (k) that X n Xj, j = 1, . . . , k. Then g(X (1) g(X1, . . . , Xk). n , . . . , Xn ) n n
PROOF
i) We have P(X = )1, and if Mn (Mn > 0), then P(X [Mn, Mn]) 1. Thus there exist n0 sufciently large such that n
P X , M n
0
Dene M = Mn ; we then have
([
)] + [ X (M
n0 ,
)]) = P( X > M ) < 2 (M

n0
n0
>1 .
P X > M < 2.
g being continuous in , is uniformly continuous in [2M, 2M]. Thus for every > 0, there exists (, M) = () (<1) such that |g(x) g(x)| < for P all x, x [2M, 2M] with |x x| < (). From Xn X we have that n there exists N() > 0 such that
P Xn X < 2 , n N .
Set
( )]
()
A1 = X M , A2 n = X n X < ,
and A3 n = g X n g X <
() [
( )]
()
Then it is easily seen that on A1 A2(n), we have 2M < X < 2M, 2M < Xn < 2M, and hence
A1 A2 n A3 n ,
( ) ( )
] (for n N ( )).
()
()
which implies that

c c A3 n A1 Ac 2 n .
()
()
Hence
c c P A3 n P A1 + P Ac 2 n 2 + 2 =
[ ( )] ( ) [ ( )] (for n N ( )).
That is, for n N(),
P g X n g X < .
( ) ( )
201
The proof is completed. (See also Exercise 8.6.1.) ii) It is carried out along the same lines as the proof of part (i). (See also Exercises 8.5.3 and 8.6.2.) The following corollary to Theorem 7 is of wide applicability.
COROLLARY
P P X, Yn Y, then If Xn n n P i) Xn + Yn X + Y. n P ii) aXn + bYn aX + bY (a, b constants). n P iii) XnYn XY. n P X/Y, provided P(Yn 0) = P(Y 0) = 1. iv) Xn/Yn n
PROOF In sufces to take g as follows and apply the second part of the theorem:
i) g(x, y) = x + y, ii) g(x, y) = ax + by, iii) g(x, y) = xy, iv) g(x, y) = x/y, y 0. The following is in itself a very useful theorem.
THEOREM 8
d P If Xn X and Yn c, constant, then n n d i) Xn +Yn X + c, n d ii) XnYn cX, n d iii) Xn/Yn X/c, provided P(Yn 0) = 1, n
c 0.
Equivalently,
i) P X n + Yn z = FX n +Yn z FX + c z n ii) P X nYn z = FX Y z FcX z n

n n
= P X + c z = P X z c = FX z c ;
()
()
( ()
()
X iii) P n z = FX n Yn
z z c>0 P X = FX , c c = P cX z = P X z = 1 F z , c < 0; X c c
Yn
F (z) (z)
n X c
c>0 X P X cz = FX cz , = P z = c < 0, c P X cz = 1 FX cz , provided P(Yn 0) = 1.
( (
) )
( ) ( )
202
REMARK 11 Of course, FX(z/c) = FX(z/c) and FX(cz) = FX(cz), if F is continuous. PROOF As an illustration of how the proof of this theorem is carried out, we proceed to establish (iii) under the (unnecessary) additional assumption that FX is continuous and for the case that c > 0. The case where c < 0 is treated similarly. P We rst notice that Yn 1. In fact, c (>0) implies that P(Yn > 0) n n P Yn c is equivalent to P (| Y c | ) 1 for every > 0, or n n n P(c Yn c + ) 1. Thus, if we choose < c , we obtain the result. Next, n since P(Yn 0) = 1, we may divide by Yn except perhaps on a null set. Outside this null set, we have then
X X X P n z = P n z I Yn > 0 + P n z I Yn < 0 Yn Yn Yn X P n z I Yn > 0 + P Yn < 0 . Yn In the following, we will be interested in the limit of the above probabilities as n . Since P(Yn < 0) 0, we assume that Yn > 0. We have then
Xn X X z = n z I Yn c + n z I Yn c < Yn Yn Yn
Yn c
)U ( X
zYn
)I ( Y
c < .
But |Yn c| < is equivalent to c < Yn < c + . Therefore
(X (X
zYn Yn c < X n z c + , if z 0, zYn Yn c < X n z c , if z < 0.
) ( ) (
) [ ) [
( (
)]
and
n
That is, for every z ,
)]
(
(X
zYn Yn c < X n z c
) (
) [
n
)]
and hence
Xn z Yn c Yn
)U [X
z c , z .
)]
Thus
X P n z P Yn c + P X n z c , z . Yn
) [
)]
Letting n and taking into consideration the fact that P(|Yn c| ) 0 and P[Xn z(c )] FX[z(c )], we obtain
X lim sup P n z FX z c , z . n Yn
[ ( )]
203
Since, as 0, FX[z(c )] FX(zc), we have
X lim sup P n z FX zc , z . n Yn
( )
(6)
Next,
By choosing < c, we have that |Yn c| < is equivalent to 0 < c < Yn < c + and hence
[X z(c )] = [X z(c )] ( Y c ) + [X z(c )] (Y c < ) (Y c ) [ X z( c )] ( Y c < ).

n n n n n n n n
[X z(c )]I ( Y
n
X c < n z , if Yn
z 0,
and
[X z(c + )]I ( Y
n
X c < n z , if Yn
z < 0.
That is, for every z ,
[X z(c )]I ( Y
n
X c < n z Yn
and hence
[X z(c )] ( Y
n
)U X Y )
z , z .
Thus
X P X n z c P Yn c + P n z . Yn
)] (
Letting n and taking into consideration the fact that P(|Yn c| ) 0 and P[Xn z(c )] Fx[z(c )], we obtain
X FX z c lim inf P n z , z . n Yn
[ ( )]
( )
Since, as 0, FX[z(c )] FX(zc), we have

X FX zc lim inf P n z , z . Y n n
(7)
Relations (6) and (7) imply that lim P (Xn/Yn z) exists and is equal to
n
X FX zc = P X zc = P z = FX c
( )
(z).
Thus
204
X P n z = FX Yn
as was to be seen.
Yn
F (z), (z)
n X c
z ,
REMARK 12 Theorem 8 is known as Slutskys theorem.

Now, if Xj, j = 1, . . . , n, are i.i.d. r.v.s, we have seen that the sample variance
2 Sn =
1 n X j Xn n j =1
1 n X 2j X n2 . n j =1
Next, the r.v.s X j2, j = 1, . . . , n are i.i.d., since the Xs are, and E X 2j = 2 X j + EX j
( )
( ) (
= 2 + 2 , if
= E Xj , 2 =2 Xj
( )
( )
(which are assumed to exist). Therefore the SLLN and WLLN give the result that 1 n 2 + 2 X 2j n n j =1 a.s.
2 and also in probability. On the other hand, X 2 a.s. and also in n n 2 2 probability, and hence X n a.s. and also in probability (by Theorems n 7(i) and 7(i)). Thus 1 n X 2j X n2 2 + 2 2 = 2 n j =1 a.s.
and also in probability (by the same theorems just referred to). So we have proved the following theorem.
THEOREM 9
Let Xj, j = 1, . . . , n, be i.i.d. r.v.s with E(Xj) = , 2(Xj) = 2, j = 1, . . . , n. Then S2 2 a.s. and also in probability. n n
REMARK 13 Of course,
P S2 2 n n
implies
2 n Sn P 1, n 1 2 n
since n/(n 1) 1. n
COROLLARY TO THEOREM 8
If X1, . . . , Xn are i.i.d. r.v.s with mean and (positive) variance 2, then
n 1 Xn Sn
) N ( 0, 1)
d n
and also
n Xn Sn
) N ( 0, 1).
d n
PROOF In fact,
n Xn
) N ( 0, 1),
d n
205
by Theorem 3, and
Sn P 1, n n1 by Remark 13. Hence the quotient of these r.v.s which is
n 1 Xn Sn
converges in distribution to N(0, 1) as n , by Theorem 9. The following result is based on theorems established above and it is of signicant importance.
THEOREM 10
For n = 1, 2, . . . , let Xn and X be r.v.s, let g: be differentiable, and let its derivative g(x) be continuous at a point d. Finally, let cn be constants such d that 0 cn , and let cn(Xn d) X as n . Then cn[g(Xn) g(d)] d g(d)X as n .
PROOF In this proof, all limits are taken as n . By assumption, 1 d d 0. Then, by Theorem 8(ii), Xn d cn(Xn d) X and cn 0, or P equivalently, Xn d 0, and hence, by Theorem 7(i),
P Xn d 0.
(8)
Next, expand g(Xn) around d according to Taylors formula in order to obtain
g X n = g d + X n d g X * n ,
where X n * is an r.v. lying between d and Xn. Hence
cn g X n g d = cn X n d g X * n .
( ) () (
) ( )
) (
P P However, |X n * d| |Xn d| * d, and therefore, 0 by (8), so that Xn by Theorem 7(i) again,
[ ( ) ( )]
(9)
P g X* g d. n
By assumption, convergence (10) and Theorem 8(ii), we have cn(Xn d) d g(X n *) g(d)X. This result and relation (9) complete the proof of the theorem.
COROLLARY
( )
()
(10)
Let the r.v.s X1, . . . , Xn be i.i.d. with mean and variance 2 (0, ), and let g: be differentiable with derivative continuous at . Then, as n , d n g Xn g N 0, g
[ ( ) ( )]
[ ( )] .
2
PROOF By the CLT, applies and gives
d n ) n(X X N(0, 2), so that the theorem
206
d n g Xn g g X ~ N 0, g
[ ( ) ( )]
()
[ ( )] .
2
APPLICATION If the r.v.s Xj, j = 1, . . . , n in the corollary are distributed as B(1, p), then, as n , 2 d n X n 1 X n pq N 0, pq 1 2 p . Here = p, 2 = pq, and g(x) = x(1 x), so that g(x) = 1 2x. The result follows.
[ (
Exercises
8.5.1 Use Theorem 8(ii) in order to show that if the CLT holds, then so does the WLLN. 8.5.2 Refer to the proof of Theorem 7(i) and show that on the set A1 A2(n), we actually have 2M < X < 2M. 8.5.3 Carry out the proof of Theorem 7(ii). (Use the usual Euclidean distance in k.)
8.6* Plyas Lemma and Alternative Proof of the WLLN

The following lemma is an analytical result of interest in its own right. It was used in the corollary to Theorem 3 to conclude uniform convergence.
LEMMA 1
(Plya). Let F and {Fn} be d.f.s such that Fn(x) F(x), x , and let F be n continuous. Then the convergence is uniform in x . That is, for every > 0 there exists N() > 0 such that n N() implies that |Fn(x) F(x)| < for every x .
PROOF Since F(x) 0 as x , and F(x) 1, as x , there exists an interval [, ] such that
F < 2, F > 1 2 .
( )
()
(11)
The continuity of F implies its uniform continuity in [, ]. Then there is a nite partition = x1 < x2 < < xr = of [, ] such that
F x j +1 F x j < 2,
( ) ( )
j = 1, , r 1.
(12)
F(xj) implies that there exists Nj() > 0 such that for all Next, Fn(xj) n n Nj(),
Fn x j F x j < 2,
( ) ( )
j = 1, , r .
By taking
8.6*
Plyas Lemma and Alternative Proof of the WLLN
207
n N = max N1 , , N r ,
we then have that
()
( ()
( ))
Fn x j F x j < 2,
( ) ( )
j = 1, , r.
(13)
Let x0 = , xr+1 = . Then by the fact that F() = 0 and F() = 1, relation (11) implies that
F x1 F x0 < 2, F x r +1 F x r < 2.
( ) ( )
( ) ( )
(14)
Thus, by means of (12) and (14), we have that
F x j +1 F x j < 2, Fn x j F x j < 2,
( ) ( )
j = 0, 1, , r . j = 0, 1, , r + 1.
(15)
Also (13) trivially holds for j = 0 and j = r + 1; that is, we have
( ) ( )
(16)
Next, let x be any real number. Then xj x < xj+1 for some j = 0, 1, . . . , r. By (15) and (16) and for n N(), we have the following string of inequalities:
F x j 2 < Fn x j Fn x Fn x j+1 < F x j1 + 2

j j+1
( )
( ) () ( ) ( ) < F (x ) + F (x) + F (x ) + .
() ( ) ( )
Hence
0 F x + Fn x F x j+1 + F x j + 2 < 2
()
and therefore |Fn(x) F(x)| < . Thus for n N(), we have
Fn x F x <
Relation (17) concludes the proof of the lemma. Below, a proof of the WLLN (Theorem 5) is presented without using ch.f.s. The basic idea is that of suitably truncating the r.v.s involved, and is due to Khintchine; it was also used by Markov.
() ()
for every x .
(17)
ALTERNATIVE PROOF OF THEOREM 5 We proceed as follows: For any > 0, we dene

X j , if Yj n = Yj = 0, if
()
Xj n Xj > n
and if 0, Zj n = Zj = X , if j
()
Xj n X j > n, j = 1, , n.
Then, clearly, Xj = Yj + Zj, j = 1, . . . , n. Let us restrict ourselves to the continuous case and let f be the (common) p.d.f. of the Xs. Then,
208
2 Y j = 2 Y1
( )
= E Y 12 EY1
2 = E X1 I
= x2I
( ) ( )
[X
1
( )
E Y 12
] ( X1 )
[ x n] ( x ) f ( x )dx
( )
=
that is,
x 2 f x dx n
()
x f x dx n
()
x f x dx
()
= nE X1 ;
2 Yj n E X 1 .
Next,
( )
(18)
E Yj = E Y1 = E X 1 I = xI

( )
( )
[X
] ( X1 )
[ x n ] ( x) f ( x)dx.
Now,
xI
and
xf ( x ), n [ x n] ( x ) f ( x ) < x f ( x ), xI [ x n] ( x ) f ( x )
Therefore
x f x dx < .
()
xI
xf ( x )dx = n [ x n] ( x ) f ( x )dx E Yj . n
by Lemma C of Chapter 6; that is,
( )
(19)
n 1 n n P Yj EYj = P Yj E Yj n j =1 n j =1 j =1 = = n 1 2 Yj 2 n j =1
2
n 2 Y1
2
n 2 n n E X 1
( )
E X1 2
n 2 2
8.6*
Plyas Lemma and Alternative Proof of the WLLN
209
by (18); that is,

1 n P Yj EY1 2 E X 1 . n j =1
(20)
Thus,
1 n 1 n P Y j 2 = P Y1 E Y j + E Y1 2 n n j=1 j=1
( ) ( ( ) )
1 n P Y j EY1 + EY1 2 n j=1 1 n P Y j EY1 + P EY1 n j=1 2 E X1
for n sufciently large, by (19) and (20); that is,
1 n P Y j 2 2 E X1 n j=1 for n large enough. Next,

P Zj 0 = P Zj > n
j
(21)
) (
= = = < =
) = P ( X > n)
n
f x dx +
( x > n
( x > in >1
f ( x)dx () f x dx ) ( ) f x dx ) ( )
( x > n ) n
f x dx
()
1 x f x dx n ( x > n ) 1 2 < n x f x dx < 2 = , since ( x > n ) n
()
()
for n sufciently large. So P(Zj 0) /n and hence n P Z j 0 nP Z j 0 j =1
(22)
210
for n sufciently large. Thus,

1 n 1 n 1 n P X j 4 = P Y j + Z j 4 n n n j =1 j =1 j =1 1 n 1 n P Y j + Z j 4 n n j =1 j =1 1 n 1 n P Y j 2 + P Z j 2 n n j =1 j =1 n n 1 P Y j 2 + P Z j 0 n j =1 j =1 2 E X1 +
for n sufciently large, by (21), (22). Replacing by 3, for example, we get

1 n P X j 4 E X 1 + 3 n j =1 for n sufciently large. Since this is true for every > 0, the result follows.
This section is concluded with a result relating convergence in probability P and a.s. convergence. More precisely, in Remark 3, it was stated that Xn n a.s. X does not necessarily imply that Xn X . However, the following is n always true.
THEOREM 11
P If Xn X, then there is a subsequence {nk} of {n} (that is, nk , k ) n a.s. such that Xnk X. n
PROOF Omitted.
As an application of Theorem 11, refer to Example 2 and consider the subsequence of r.v.s {X2 1}, where
k
X2
= I 2
k1 1 k 1 1 2
Then for > 0 and large enough k, so that 1/2k1 < , we have 1 P X 2 1 > = P X 2 1 = 1 = k1 < . 2 Hence the subsequence {X2 1} of {Xn} converges to 0 in probability.
) (
Exercises
211
Exercises
8.6.1 Use Theorem 11 in order to prove Theorem 7(i). 8.6.2 Do likewise in order to establish part (ii) of Theorem 7.
212
Transformations of Random Variables and Random Vectors
Chapter 9
9.1 The Univariate Case

The problem we are concerned with in this section in its simplest form is the following: Let X be an r.v. and let h be a (measurable) function on into , so that Y = h(X) is an r.v. Given the distribution of X, we want to determine the distribution of Y. Let PX, PY be the distributions of X and Y, respectively. That is, PX(B) = P(X B), PY(B) = P(Y B), B (Borel) subset of . Now (Y B) = [h(X) B] = (X A), where A = h1(B) = {x ;h(x) B}. Therefore PY(B) = P(Y B) = P(X A) = PX(A). Thus we have the following theorem.
THEOREM 1
Let X be an r.v. and let h: be a (measurable) function, so that Y = h(X) is an r.v. Then the distribution PY of the r.v. Y is determined by the distribution PX of the r.v. X as follows: for any (Borel) subset B of , PY(B) = PX(A), where A = h1(B).
9.1.1
Application 1: Transformations of Discrete Random Variables
Let X be a discrete r.v. taking the values xj, j = 1, 2, . . . , and let Y = h(X). Then Y is also a discrete r.v. taking the values yj, j = 1, 2, . . . . We wish to determine fY(yj) = P(Y = yj), j = 1, 2, . . . . By taking B = {yj}, we have
A = xi; h xi = y j ,
{ ( ) }
X
and hence
fY y j = P Y = y j = PY y j
( )
({ }) = P ( A) = f (x ),
X i x i A
212
9.1
The Univariate Case
213
where
EXAMPLE 1
fX x i = P X = x i .
( )
Let X take on the values n, . . . , 1, 1, . . . , n each with probability 1/2n, and let Y = X2. Then Y takes on the values 1, 4, . . . , n2 with probability found as follows: If B = {r2}, r = 1, . . . , n, then A = h 1 B = x 2 = r 2 = x = r or
( ) (
) (
) = ( x = r ) + ( x = r ) = { r} + {r}.
x=r
Thus
PY B = PX A = PX r + PX r
That is,
( )
( )
({ })
. ({ }) = 21n + 21n = 1 n
P Y = r 2 = 1 n, r = 1, , n.
EXAMPLE 2
Let X be P() and let Y = h(X) = X2 + 2X 3. Then Y takes on the values
{y = x
+ 2 x 3; x = 0, 1, = 3, 0, 5, 12, .
x 2 + 2 x 3 = y,
} {
From
we get
x 2 + 2 x y + 3 = 0, so that
x = 1 y + 4 .
Hence x = 1 + y + 4 , the root 1 y + 4 being rejected, since it is negative. Thus, if B = {y}, then
A = h 1 B = 1 + y + 4 ,
and PY B = P Y = y = PX A =
( ) {
)
( )
( )
e 1+ y + 4 . 1 + y + 4 !
For example, for y = 12, we have P(Y = 12) = e3/3!. It is a fact, proved in advanced probability courses, that the distribution PX of an r.v. X is uniquely determined by its d.f. X. The same is true for r. vectors. (A rst indication that such a result is feasible is provided by Lemma 3 in Chapter 7.) Thus, in determining the distribution PY of the r.v. Y above, it sufces to determine its d.f., FY. This is easily done if the transformation h is one-to-one from S onto T and monotone (increasing or decreasing), where S is the set of values of X for which fX is positive and T is the image of S, under h: that is, the set to which S is transformed by h. By one-to-one it is meant that for each y T, there is only one x S such that h(x) = y. Then the inverse
214
transformation, h1, exists and, of course, h1[h(x)] = x. For such a transformation, we have
FY y = P Y y = P h X y
1 1
()
) [( ) ] = P{h [ h( X )] h ( y)} = P( X x ) = F ( x ), (
X
where x = h (y) and h is increasing. In the case where h is decreasing, we have
FY y = P h X y = P h 1 h X h 1 y
1
( ) [ ( ) ] { [ ( )] = P[ X h ( y)] = P( X x ) = 1 P( X < x ) = 1 F ( x ),
X
( )}
where FX(x) is the limit from the left of FX at x; FX(x) = lim FX(y), y x. Figure 9.1 points out why the direction of the inequality is reversed when h1 is applied if h in monotone decreasing.
REMARK 1
y y h (x) (y y0) corresponds, under h, to (x x0) y0
0
Figure 9.1
x0 h1 ( y0 )
Thus we have the following corollary to Theorem 1.

COROLLARY
Let h: S T be one-to-one and monotone. Then FY(y) = FX(x) if h is increasing, and FY(y) = 1 FX(x) if h is decreasing, where x = h1(y) in either case.
REMARK 2 Of course, it is possible that the d.f. FY of Y can be expressed in terms of the d.f. FX of X even though h does not satisfy the requirements of the corollary above. Here is an example of such a case.
EXAMPLE 3
Let Y = h(X) = X2. Then for y 0,
FY y = P Y y = P h X y = P X 2 y = P y X y = P X y P X < y = FX
() (
that is,
) [( ) ] (
) (
()
) ( y ) F ( y );
X
X
) (
FY y = FX
( y ) F ( y )
for y 0 and, of course, it is zero for y < 0.
9.1
The Univariate Case
215
We will now focus attention on the case that X has a p.d.f. and we will determine the p.d.f. of Y = h(X), under appropriate conditions. One way of going about this problem would be to nd the d.f. FY of the r.v. Y by Theorem 1 (take B = (, y], y ) , and then determine the p.d.f. fY of Y, provided it exists, by differentiating (for the continuous case) FY at continuity points of fY. The following example illustrates the procedure.
EXAMPLE 4
In Example 3, assume that X is N(0, 1), so that 1 x 2 fX x = e . 2 Then, if Y = X2, we know that
()
FY y = FX
()
X
( y ) F ( y ),
X
y 0.
Next,
d FX dy
d ( y ) = f ( y ) dy
y=
1 2 y
fX
( y) = 2
1 1 2
1 2 y
e y 2 ,
and
so that
d 1 1 FX y = fX y = e y 2 , dy 2 y 2 2 y
( )
()
( )
d 1 FY y = fY y = dy y
()
1 2
ey 2 =
y 0 and zero otherwise. We recognize it as being the p.d.f. of a 2 1 distributed r.v. which agrees with Theorem 3, Chapter 4. Another approach to the same problem is the following. Let X be an r.v. whose p.d.f. fX is continuous on the set S of positivity of fX. Let y = h(x) be a (measurable) transformation dened on into which is one-to-one on the set S onto the set T (the image of S under h). Then the inverse transformation x = h1(y) exists for y T. It is further assumed that h1 is differentiable and its derivative is continuous and different from zero on T. Set Y = h(X), so that Y is an r.v. Under the above assumptions, the p.d.f. fY of Y is given by the following expression: d 1 h y , y T f h 1 y fY y = X dy 0, otherwise. For a sketch of the proof, let B = [c, d] be any interval in T and set A = h1(B). Then A is an interval in S and
( )Z
1 2
1 2
ey
( = ( )),
1 2
()
[ ( )]
()
P Y B = P h X B = P X A = fX x dx.
A
) [( ) ] (
()
Under the assumptions made, the theory of changing the variable in the integral on the right-hand side above applies (see for example, T. M. Apostol,
216
Mathematical Analysis, Addison-Wesley, 1957, pp. 216 and 270271) and gives
1 1 A fX (x )dx = B fX [h ( y)] dy h ( y) dy.
That is, for any interval B in T,
P Y B = fX h 1 y
B
d h ( y) dy. [ ( )] dy
1
Since for (measurable) subsets B of T c, P(Y B) = P[X h1(B)] P(X Sc) = 0, it follows from the denition of the p.d.f. of an r.v. that fY has the expression given above. Thus we have the following theorem.
THEOREM 2
Let the r.v. X have a continuous p.d.f. fX on the set S on which it is positive, and let y = h(x) be a (measurable) transformation dened on into , so that Y = h(X) is an r.v. Suppose that h is one-to-one on S onto T (the image of S under h), so that the inverse transformation x = h1(y) exists for y T. It is further assumed that h1 is differentiable and its derivative is continuous and 0 on T. Then the p.d.f. fY of Y is given by d 1 h y , f h 1 y fY y = X dy 0,
()
[ ( )]
()
y T otherwise.
EXAMPLE 5
Let X be N(, ) and let y = h(x) = ax + b, where a, b , a 0, are constants, so that Y = aX + b. We wish to determine the p.d.f. of the r.v. Y. Here the transformation h: , clearly, satises the conditions of Theorem 2. We have
2
h 1 y =
()
1 yb a
and
d 1 1 h y = . dy a
()
Therefore, fY y =
()
exp 2 1 1
y b a
y a + b exp 2 a 2 2 2 a
[ (
1 2 2 a
)]
which is the p.d.f. of a normally distributed r.v. with mean a + b and variance a22. Thus, if X is N(, 2), then aX + b is N(a + b, a22). Now it may happen that the transformation h satises all the requirements of Theorem 2 except that it is not one-to-one from S onto T. Instead, the following might happen: There is a (nite) partition of S, which we denote by
9.1
The Univariate Case
217
{Sj, j = 1, . . . , r}, and there are r subsets of T, which we denote by Tj, j = 1, . . . , r, (note that r j=1Tj = T, but the Tjs need not be disjoint) such that h: Sj Tj, j = 1, . . . , r is one-to-one. Then by an argument similar to the one used in proving Theorem 2, we can establish the following theorem.
THEOREM 3
Let the r.v. X have a continuous p.d.f. fX on the set S on which it is positive, and let y = h(x) be a (measurable) transformation dened on into , so that Y = h(X) is an r.v. Suppose that there is a partition {Sj, j = 1, . . . , r} of S and subsets Tj, j = 1, . . . , r of T (the image of S under h), which need not be distinct or disjoint, such that r j=1Tj = T and that h dened on each one of Sj onto Tj , j = 1, . . . , r, is one-to-one. Let hj be the restriction of the transformation h to 1 1 Sj and let h j be its inverse, j = 1, . . . , r. Assume that h j is differentiable and its derivative is continuous and 0 on Tj, j = 1, . . . , r. Then the p.d.f. fY of Y is given by r j y fY y , fY y = j =1 0,
()
() ()
j
y T otherwise,
where for j = 1, . . . , r,
1 fY y = fX h y j
j
()
d h ( y) , [ ( )] dy
1 j
y T j ,
and j(y) = 1 if y Tj and j(y) = 0 otherwise. This result simply says that for each one of the r pairs of regions (Sj, Tj), j = 1, . . . , r, we work as we did in Theorem 2 in order to nd
1 fY y = fX h y j
j
()
d h ( y) ; [ ( )] dy
1 j
then if a y in T belongs to k of the regions Tj, j = 1, . . . , r (0 k r), we nd fY(y) by summing up the corresponding fY (y)s. The following example will serve to illustrate the point.
j
EXAMPLE 6
Consider the r.v. X and let Y = h(X) = X2. We want to determine the p.d.f. fY of the r.v. Y. Here the conditions of Theorem 3 are clearly satised with
S1 = , 0 ,
S 2 = 0, ,
T1 = 0, ,
T2 = 0,
by assuming that fX(x) > 0 for every x . Next,

1 h1 y = y,
()
1 h 2 y =
()
y,
so that
d 1 1 , h1 y = dy 2 y
Therefore,
()
1 d 1 , y > 0. h2 y = dy 2 y
()
218
fY y = fX y
1
()
( ) 2 1y ,
1 f X 2 y
fY y = fX
2
()
( y) 2 1y ,
and for y > 0, we then get
fY y =
()
( y ) + f ( y ),
X
provided y are continuity points of fX. In particular, if X is N(0, 1), we arrive at the conclusion that fY(y) is the p.d.f. of a 2 1 r.v., as we also saw in Example 4 in a different way.
Exercises
9.1.1 Let X be an r.v. with p.d.f. f given in Exercise 3.2.14 of Chapter 3 and determine the p.d.f. of the r.v. Y = X 3. 9.1.2 Let X be an r.v. with p.d.f. of the continuous type and set Y = n j = 1cjIB (X), where Bj, j = 1, . . . , n, are pairwise disjoint (Borel) sets and cj, j = 1, . . . , n, are constants. i) Express the p.d.f. of Y in terms of that of X, and notice that Y is a discrete r.v. whereas X is an r.v. of the continuous type; ii) If n = 3, X is N(99, 5) and B1 = (95, 105), B2 = (92, 95) + (105, 107), B3 = (, 92] + [107, ), determine the distribution of the r.v. Y dened above; iii) If X is interpreted as a specied measurement taken on each item of a product made by a certain manufacturing process and cj, j = 1, 2, 3 are the prot (in dollars) realized by selling one item under the condition that X Bj, j = 1, 2, 3, respectively, nd the expected prot from the sale of one item.
j
9.1.3 Let X, Y be r.v.s representing the temperature of a certain object 9 in degrees Celsius and Fahrenheit, respectively. Then it is known that Y = 5X 2 + 32. If X is distributed as N(, ), determine the p.d.f. of Y, rst by determining its d.f., and secondly directly. 9.1.4 If the r.v. X is distributed as Negative Exponential with parameter , nd the p.d.f. of each one of the r.v.s Y, Z, where Y = eX, Z = log X, rst by determining their d.f.s, and secondly directly. 9.1.5 If the r.v. X is distributed as U(, ): i) Derive the p.d.f.s of the following r.v.s: aX + b (a > 0), 1/(X + 1), X2 +1, eX, log X (for > 0), rst by determining their d.f.s, and secondly directly; ii) What do the p.d.f.s in part (i) become for = 0 and = 1? iii) For = 0 and = 1, let Y = log X and suppose that the r.v.s Yj, j = 1, . . . , n, are independent and distributed as the r.v. Y. Use the ch.f. approach to determine the p.d.f. of n j = 1Yj.
9.2 9.1 The The Multivariate Univariate Case
219
1 1 9.1.6 If the r.v. X is distributed as U( 2 , 2 ), show that the r.v. Y = tan X is distributed as Cauchy. Also nd the distribution of the r.v. Z = sin X.
9.1.7 If the r.v. X has the Gamma distribution with parameters , , and Y = 2X/, show that Y 2 2, provided 2 is an integer. 9.1.8 If X is an r.v. distributed as 2 r , set Y = X/(1 + X) and determine the p.d.f. of Y. 9.1.9 If the r.v. X is distributed as Cauchy with = 0 and = 1, show that the 1 1 r.v. Y = tan1 X is distributed as U( 2 , 2 ). 9.1.10 Let X be an r.v. with p.d.f. f given by f x =
()
1 2
x 2 e
1 2 x 2
( ),
and show that the r.v. Y = 1/X is distributed as N(0, 1). 9.1.11 Suppose that the velocity X of a molecule of mass m is an r.v. with p.d.f. f given in Exercise 3.3.13(ii) of Chapter 3. Derive the distribution of the 1 2 r.v. Y = 2 mX (which is the kinetic energy of the molecule). 9.1.12 If the r.v. X is distributed as N(, 2), show, by means of a transformation, that the r.v. Y = [(X )/]2 is distributed as 2 1.
9.2 The Multivariate Case

What has been discussed in the previous section carries over to the multidimensional case with the appropriate modications.
THEOREM 1
Let X = (X1, . . . , Xk) be a k-dimensional r. vector and let h: k m be a (measurable) function, so that Y = h(X) is an r. vector. Then the distribution PY of the r. vector Y is determined by the distribution PX of the r. vector X as follows: For any (Borel) subset B of m, PY(B) = PX(A), where A = h1(B). The proof of this theorem is carried out in exactly the same way as that of Theorem 1. As in the univariate case, the distribution PY of the r. vector Y is uniquely determined by its d.f. FY.
EXAMPLE 7
Let X1, X2 be independent r.v.s distributed as U(, ). We wish to determine the d.f. of the r.v. Y = X1 + X2. We have
FY y = P X1 + X 2 y = {x +x
1
()
fX
1 ,X 2
(x , x )dx dx .
1 2 1 2
2
From Fig. 9.2, we see that for y 2, FY(y) = 0. For

2 < y 2 , FY y =
()
( )
A,
220
where A is the area of that part of the square lying to the left of the line x1 + x2 = y. Since for y + , A = (y 2)2/2, we get
( y 2 ) F ( y) = 2( )
Y
2 2
for
2 < y + .
For + < y 2, we have

FY y =
()
( )
(2 y)
2
= 1 2 y 2
) )
2 2
Thus we have:
0 , 2 y 2 , 2 2 FY y = 2 y 1 2 1,
()
) )
y 2 2 < y +
2 2
) )
+ < y 2
y > 2 .
x2 2 x1 x2 y x1
x1 x2 y
0 2
Figure 9.2
The d.f. of X1 + X2 for any two independent r.v.s (not necessarily U(, ) distributed) is called the convolution of the d.f.s of X1, X2 and is denoted by FX +X = FX * FX . We also write fX +X = fX * fX for the corresponding p.d.f.s. These concepts generalize to any (nite) number of r.v.s.
REMARK 3
1 2 1 2 1 2 1 2
221
EXAMPLE 8
Let X1 be B(n1, p), X2 be B(n2, p) and independent. Let Y1 = X1 + X2 and Y2 = X2. We want to nd the joint p.d.f. of Y1, Y2 and also the marginal p.d.f. of Y1, and the conditional p.d.f. of Y2, given Y1 = y1.
fY ,Y y1 , y2 = P Y1 = y1 , Y2 = y2 = P X1 = y1 y2 , X 2 = y2 ,
1 2
since X1 = Y1 Y2 and X2 = Y2. Furthermore, by independence, this is equal to
P X1 = y1 y2 P X 2 = y2
1 2 1 1
) (
)
2 2 2
n1 y y n ( y y ) n2 y n = p q q p y1 y2 y2 n1 n2 y ( n + n ) y ; = p q y1 y2 y2
1 1 2 1
y2
that is
n1 n2 y ( n + n ) y fY ,Y y1 , y2 = , p q y1 y2 y2
1 2
Thus
1
0 y1 n1 + n2 u = max 0, y1 n1 y2 min y1 , n2 = .
(
1
fY y1 = P Y1 = y1 =
( )
) f (y , y ) = p
y2 =u Y1 ,Y2 1 2
2
y1
( n + n ) y
2
y2 =u
n1 n2 . 1 y2 y2
Next, for the four possible values of the pair, (u, ), we have
y2 = 0
y1
y n1 n2 n2 n n1 n2 = = y =0 y1 y2 y2 y = y n y1 y2 y2 1 y2 y2
n1
y2 = y1 n 1
n2
n1 n2 n1 + n2 = ; y1 y2 y2 y1
that is, Y1 = X1 + X2 is B(n1 + n2, p). (Observe that this agrees with Theorem 2, Chapter 7.) Finally, with y1 and y2 as above, it follows that n1 n2 y y2 y2 P Y2 = y2 Y1 = y1 = 1 , n1 + n2 y1
the hypergeometric p.d.f., independent, of p!. We next have two theorems analogous to Theorems 2 and 3 in Section 1. That is,
222
THEOREM 2
Let the k-dimensional r. vector X have continuous p.d.f. fX on the set S on which it is positive, and let y = h x = h1 x , , hk x
() ( ()
( ))
be a (measurable) transformation dened on k into k, so that Y = h(X) is a k-dimensional r. vector. Suppose that h is one-to-one on S onto T (the image of S under h), so that the inverse transformation x = h 1 y = g1 y , , gk y
() ( ()
( ))
exists for y T .
It is further assumed that the partial derivatives
g ji y =
()
g j y1 , , yk , yi
i, j = 1, , k
exist and are continuous on T. Then the p.d.f. fY of Y is given by

f h 1 y J = fX g1 y , , gk y J , fY y = X 0,
()
[ ( )]
[ ()
g12 g 22 M gk2
( )]
y T otherwise,
where the Jacobian J is a function of y and is dened as follows
J=
g11 g 21 M g k1
g1k g2 k M M g kk
and is assumed to be 0 on T. In Theorem 2, the transformation h transforms the k-dimensional r. vector X to the k-dimensional r. vector Y. In many applications, however, the dimensionality m of Y is less than k. Then in order to determine the p.d.f. of Y, we work as follows. Let y = (h1(x), . . . , hm(x)) and choose another k m transformations dened on k into , hm+j, j = 1, . . . , k m, say, so that they are of the simplest possible form and such that the transformation
REMARK 4
h = h1 , , hm , hm + 1 , , hk
satises the assumptions of Theorem 2. Set Z = (Y1, . . . , Ym, Ym + 1, . . . , Yk), where Y = (Y1, . . . , Ym) and Ym + j = hm + j(X), j = 1, . . . , k m. Then by applying Theorem 2, we obtain the p.d.f. fZ of Z and then integrating out the last k m arguments ym+j, j = 1, . . . , k m, we have the p.d.f. of Y. A number of examples will be presented to illustrate the application of Theorem 2 as well as of the preceding remark.
9.1 The The Univariate Case 9.2 Multivariate
223
EXAMPLE 9
Let X1, X2 be i.i.d. r.v.s distributed as U(, ). Set Y1 = X1 + X2 and nd the p.d.f. of Y1. We have
fX
1 ,X 2
(x , x ) (
1 2
1 = 0 ,
< x1 , x 2 <
otherwise.
Consider the transformation
Y = X1 + X 2 y = x1 + x 2 , < x1 , x 2 < ; then 1 h: 1 Y2 = X 2 . y2 = x 2

From h, we get x1 = y1 y2 x 2 = y2 . Then J= 1 1 =1 0 1
and also < y2 < . Since y1 y2 = x1, < x1 < , we have < y1 y2 < . Thus the limits of y1, y2 are specied by < y2 < , < y1 y2 < . (See Figs. 9.3 and 9.4.)
x2 S 0
h
(Fig. 9.4)
T
Figure 9.3 S = {(x1, x2); fX1,X2 (x1, x2) > 0}
x1
y2
y1 y2
y1 y2 c
0 2
y1
y1 y2
Figure 9.4 T = image of S under the transformation h.
224
Thus we get
fY ,Y y1 , y2
1 2
) (
1 = 0 ,
2 < y1 < 2 , < y2 < , < y1 y2 < otherwise.
Therefore
1 y1 = 1 0,
fY
( )
( (
) )
y1
dy2 =
y1 2
y dy2 =
1
( )
2 y1
, ,
for 2 < y1 + for + < y1 < 2
otherwise.
The graph of fY is given in Fig. 9.5.

1
fY1( y1)
1 ( )
Figure 9.5
y1
REMARK 5 EXAMPLE 10
This density is known as the triangular p.d.f.
Let X1, X2 be i.i.d. r..s from U(1, ). Set Y1 = X1X2 and nd the p.d.f. of Y1. Consider the transformation
y = x1 x 2 Y = X1 X 2 ; then 1 h: 1 y2 = x 2 Y2 = X 2 .
From h, we get y x1 = 1 y2 x = y 2 2 1 y1 2 1 and J = y2 y2 = . y2 0 1
Now
S = x1 , x2 ; f X is transformed by h onto
1 ,X 2
( x , x ) > 0
1 2
y T = y1 , y2 ; 1 < 1 < , 1 < y2 < . y2
225
(See Fig. 9.6.) Thus, since
y2 y1
y2
y1
1 0
Figure 9.6
y1
fY ,Y
1
1 y1 , y2 = 1 0,
) (
1 , 2
(y , y )
1 2
otherwise,
we have
fY
( ) ( (
1 1 y1 = 1 1
) )
y1
dy2 1 = y2 1
log y1 , 1 < y1 <
y1
dy2 1 = y2 1
(2 log log y ),
1
y1 < 2 ;
that is
1 log y1 , 2 1 1 2 log log y1 , y1 = 2 1 0 ,
fY1
( )
( (
) )
1 < y1 <
y1 < 2
otherwise.
EXAMPLE 11
Let X1, X2 be i.i.d. r..s from N(0, 1). Show that the p.d.f. of the r.v. Y1 = X1/X2 is Cauchy with = 0, = 1; that is,
fY y1 =
1
( )
1 1 , y1 . 1 + y2 1
We have Y1 = X1/X2. Let Y2 = X2 and consider the transformation
226
y = x1 x2 , x2 0 h: 1 y2 = x2 ;
and
J= y2 0 y1 1
x = y1 y2 then 1 x2 = y2
J = y2 .
= y2 , so that
Since < x1, x2 < implies < y1, y2 < , we have
fY1 ,Y2 y1 , y2 = fX 1 ,X 2 y1 y2 , y2 y2 =
and therefore
1 fY ( y ) = 2
1 1
2 2 2 y1 y2 + y2 1 exp y2 2 2
y2 + 1 y2 2 2 y2 1 2 1 1 y2 + y2 y dy . y2 dy2 = 0 exp exp 2 2 2 2
Set
(y
and
2 1
+1 2
)y
2 2
= t , so that
2 = y2
2t y +1
2 1
2y2 dy2 =
2dt , or y2 1 +1
y2 dy2 =
dt , t 0, . y +1
2 1
[ )
Thus we continue as follows:
1
since
0 e
dt 1 1 1 1 e t dt = 2 , = 2 0 y +1 y1 + 1 y1 + 1 2 1
0 e
that is,
1
dt = 1;
1 1 2 . y1 +1
fY y1 =
EXAMPLE 12
( )
Let X1, X2 be independent r..s distributed as Gamma with parameters (, 2) and (, 2), respectively. Set Y1 = X1/(X1 + X2) and prove that Y1 is distributed as Beta with parameters , . We set Y2 = X1 + X2 and consider the transformation:
x1 x = y1 y2 y = h: 1 x1 + x2 , x1 , x2 > 0; then 1 x2 = y2 y1 y2 . y = x + x 1 2 2
227
Hence
J= y2 y2 y1 = y2 y1 y2 + y1 y2 = y2 1 y1 and J = y2 .
Next,
fX
1 ,X 2
x + x2 1 1 x 1 x2 exp 1 , x1 , x2 > 0, 1 x1 , x2 = 2 2 2 otherwise, , > 0. 0,
( )()
y1 =
From the transformation, it follows that for x1 = 0, y1 = 0 and for x1 ,
x1 1 = 1. x1 + x 2 1 + x 2 x1
Thus 0 < y1 < 1 and, clearly, 0 < y2 < . Therefore, for 0 < y1 < 1, 0 < y2 < , we get
fY1 ,Y2 y1 , y2 = =
1 1 1 1 y 1 y1 1 y2 y2 2 +
( )() ( )()
1
y exp 2 y2 2
1 y1 1 y1
+ 1 y 2 2 y2 e .
Hence
fY1 y1 =
( )
1 1 y1 1 y1 2 +
( )()
0
+ 1 y2 2 e dy2 . y2
But
0
Therefore
+ 1 y y e 2
dy2 = 2 + t + 1e t dt = 2 + + .
0
fY
( )
+ y 1 1 y1 y1 = a 1 0,
( ) ()()
0 < y1 < 1 otherwise.
EXAMPLE 13
Let X1, X2, X3 be i.i.d. r..s with density
e x , x > 0 f x = x 0. 0 ,
()
Set
Y1 =
X1 X1 + X 2 , Y2 = , Y3 = X1 + X 2 + X 3 X1 + X 2 X1 + X 2 + X 3
228
and prove that Y1 is U(0, 1), Y3 is distributed as Gamma with = 3, = 1, and Y1, Y2, Y3 are independent. Consider the transformation x1 y1 = x1 + x 2 x1 = y1 y2 y3 x1 + x 2 h: y2 = , x1 , x 2 , x3 > 0; then x 2 = y1 y2 y3 + y2 y3 x1 + x 2 + x3 x = y y + y 2 3 3 3 y3 = x1 + x 2 + x3 and
y2 y3 J = y2 y3 0 y1 y3 y1 y3 + y3 y3 y1 y2
2 y1 y2 + y2 = y2 y3 . y2 + 1
Now from the transformation, it follows that x1, x2, x3 (0, ) implies that
y1 0, 1 , y2 0, 1 , y3 0, .
( )
2
( )
Thus
fY ,Y
1 2 ,Y 3
y y e (y , y , y ) = 0,
1 2 3
2 y3 3
, 0 < y1 < 1, 0 < y2 < 1, 0 < y3 < otherwise.
Hence fY y1 =
1
fY and
( ) y y e (y ) = y y e
1 0 1 0 0 2 2 0 2
2 y3 3
dy2 dy3 = 1,
0
0 < y1 < 1,
3
2 y3 3
2 y dy1dy3 = y2 y3 e dy3
= 2 y2 , 0 < y2 < 1
2 y 2 y fY y3 = y2 y3 e dy1dy2 = y3 e
3 3
( )
1 1
0 0
y dy
0 2
=
Since
1 2 y y3 e , 0 < y3 < . 2
3
fY1 ,Y2 ,Y3 y1 , y2 , y3 = fY1 y1 fY2 y2 fY3 y3 ,
( ) ( ) ( )
the independence of Y1, Y2, Y3 is established. The functional forms of fY , fY verify the rest.
1
229
9.2.1 Application 2: The t and F Distributions

The density of the t distribution with r degrees of freedom (tr). Let the independent r..s X and Y be distributed as N(0, 1) and 2 r , respectively, and set T = X/Y/r. The r.v. T is said to have the (Students) t-distribution with r degrees of freedom (d.f.) and is often denoted by tr. We want to nd its p.d.f. We have: fX x =
()
1 2
1 2 x2
( )
x ,
y>0 y 0.
1 ( r 2 )1 y 2 , y e 1 1 2 )r ( fY y = r 2 2 0,
()
( )
Set U = Y and consider the transformation

x 1 t u x = t = h: y r ; then r y = u u = y
and
u J= r 0 t 2 u r = 1 u r .
Then for t , u > 0, we get
fT ,U t , u = =
Hence fT t = We set
( )
1 2
t2 u 2 r
( )
1 ( r 2 )1 u 2 u u e . r 2 r 22 r
( )
2r r 2 2 r
( )
(1 2 )( r +1)1
u t2 exp 1 + . r 2
()
2r r 2 2 r
( )
(1 2 )( r +1)1
u t2 exp 1 + du. r 2
u t2 t2 t2 1 z u 2 z 1 du 2 1 dz, + = , so that = + , = + 2 r r r and z [0, ). Therefore we continue as follows:
230
(1 2 )( r +1)1 1 2 2z e z dz fT t = 2 0 r 2 1+ t r 1 + t2 r 2r r 2 2 (1 2 )( r +1) (1 2 )( r +1)1 1 2 z = e z dz 1 2 )( r +1) ( 0 r 2 2 2r r 2 2 1+ t r
()
( )
( )
( )
( )
[ ( )]
1
1 2 r +1 r r 2 1 + t 2 r ( )( )
( ) [ ( )]
1 2
[ (r + 1)];
1 2
that is
fT t =
(r + 1)] () [ r r 2
( ) [1 + (t r )](
2
1 2 r +1
)( )
t .
The probabilities P(T t) for selected values of t and r are given in tables (the t-tables). (For the graph of fT, see Fig. 9.7.)
f T ( t)
t (N (0, 1))
t5
0
Figure 9.7
The density of the F distribution with r1, r2 d.f. (Fr ,r ). Let the independent r..s 2 X and Y be distributed as 2 r and r , respectively, and set F = (X/r1)/(Y/r2). The r.v. F is said to have the F distribution with r1, r2 degrees of freedom (d.f.) and is often denoted by Fr ,r . We want to nd its p.d.f. We have:
1 2
1 2
fX
()
1 1 x = 2 r1 2 r1 0,
( )
( r 2 )1 x 2 e , x>0
1
x 0,
231
1 1 fY y = 2 r2 2 r 0,
()
( )
( r 2 )1 y 2 e , y>0
2
y 0.
We set Z = Y, and consider the transformation

x r1 r f = x = 1 fz h: y r2 ; then r2 z = y y = z
and
r1 z J = r2 0 r1 f r1 r2 = z, so that r2 1 J = r1 z. r2
For f, z > 0, we get: f F ,Z f , z =
( )
( r )( r )2
1 2 1 1 2 2
(1 2 )( r + r
1
r1 ) r2
( r 2 )1
1
( r 2 )1 ( r 2 )1 ( r 2 )1 z z
1 1 2
r r exp 1 fz e z 2 1 z r2 2r2 r 2 ( r 2 )1 r1 r2 f zr (1 2 )( r + r )1 = z exp 1 f + 1 . 1 2 r + r ( )( ) 1 r 1 r 2 2 r2 2 2 2 1
) ( )( )
1
Therefore fF f = fF ,Z f , z dz
0 r1 2 1 2
()
( ) (r r ) f ( = ( ( r ) ( r )2
1 2 1 1 2 2
r1 2 1 1 2 r1 + r2
)(
(1 2 )( r + r )1
1 2
zr exp 1 f + 1 dz. 2 r2
Set
r1 z r1 f + 1 = t , so that z = 2t f + 1 , 2 r2 r 2 r dz = 2 1 f + 1 dt , t 0, . r2
1 1
Thus continuing, we have
232
fF
(r r ) f ( f = () ( ( r ) ( r )2
r1 2 1 2 1 2 1 1 2 2
r1 2 1 1 2 r1 + r2
)(
t
(1 2 )( r + r )1 r1 f + 1 ) r2 2
1 2 1 2
1 2 r1 + r2 +1
( )(
r 2 1 f + 1 r2 = Therefore
1 2 1 2
(1 2 )( r + r )1
r1 2
e t dt f
1
[ (r + r )](r r )
( r )( r )
1 2 1 1 2 2
( r 2 )1
1
[1 + (r r ) f ]
2
(1 2 )( r + r )
1 2
fF
()
1 r + r r r 2 1 2 1 2 f = 1 r 1 r 2 1 2 2 0,
[(
)]( ) ( )( )
r1 2
f
1
( r 2 )1
1
[1 + (r r ) f ]
2
(1 2 ) ( r + r )
1 2
, for for
f >0 f 0.
The probabilities P(F f ) for selected values of f and r1, r2 are given by tables (the F-tables). (For the graph of fF, see Fig. 9.8.)
fF ( f ) F10, 10 F10, 4
0
Figure 9.8
10
20
30
REMARK 6
i) If F is distributed as Fr ,r , then, clearly, 1/F is distributed as Fr ,r . ii) If X is N(0, 1), Y is 2 r and X, Y are independent, so that T = X/Y/r is distributed as tr, the n T 2 is distributed as F1,r, since X 2 is 2 1.
1 2 2 1
We consider the multidimensional version of Theorem 3.

THEOREM 3
Let the k-dimensional r. vector X have continuous p.d.f. fX on the set S on which it is positive, and let y = h(x) = (h1(x), . . . , hk(x)) be a (measurable) transformation dened on k into k, so that Y = h(X) is a k-dimensional r. vector. Suppose that there is a partition {Sj, j = 1, . . . , r} of S and subsets Tj, j = 1, . . . , r of T (the image of S under h), which need not be distinct or disjoint, such that jr= 1 Tj = T and that h dened on each one of Sj onto Tj,
9.1
The Univariate Exercises Case
233
j = 1, . . . , r is one-to-one. Let hj be the restriction of the transformation h to 1 Sj and let h j (y) = (gj1(y), . . . , gjk(y)) be its inverse, j = 1, . . . , r. Assume that the partial derivatives gjil(y) = (/yl)gji(y1, , yk), i, l = 1, . . . , k, j = 1, . . . , r exist and for each j, gjil, i, l = 1, . . . , k are continuous, j = 1, . . . , r. Then the p.d.f. fY of Y is given by r j y fY y , f Y y = j =1 0,
()
j
() ()
j
y T otherwise,
where for j = 1, . . . , r, fY (y) = fX[h (y)]|Jj|, y Tj, j(y) = 1 if y T and j(y) = 0 otherwise, and the Jacobians Jj which are functions of y are dened by g j11 g j21 M g jk1 g j12 g j22 M g jk 2 g j1k g j2 k M M g jkk
1 j
Jj =
and are assumed to be 0 on Tj, j = 1, . . . , r. In the next chapter (Chapter 10) on order statistics we will have the opportunity of applying Theorem 3.
Exercises
9.2.1 Let X1, X2 be independent r.v.s taking on the values 1, . . . , 6 with 1 probability f(x) = 6 , x = 1, . . . , 6. Derive the distribution of the r.v. X1 + X2. 9.2.2 Let X1, X2 be r.v.s with joint p.d.f. f given by
f x1 , x 2 =
1 I A x1 , x 2 ,
where
2 A = x1 , x2 2 ; x 2 1 + x 2 1.
2 2 Set Z2 = X 2 1 + X 2 and derive the p.d.f. of the r.v. Z . (Hint: Use polar coordinates.)
9.2.3 Let X1, X2 be independent r.v.s distributed as N(0, 1). Then: i) Find the p.d.f. of the r.v.s X1 + X2 and X1 X2; ii) Calculate the probability P(X1 X2 < 0, X1 + X2 > 0). 9.2.4 Let X1, X2 be independent r.v.s distributed as Negative Exponential with parameter = 1. Then:
234
ii) Derive the p.d.f.s of the following r.v.s:
X1 + X 2 , X1 X 2 , and X1 X 2 ;
ii) Show that X1 + X2 and X1/X2 are independent. 9.2.5 Let X1, X2 be independent r.v.s distributed as U(, + 1). Then: i) Derive the p.d.f.s of the r.v.s X1 + X2 and X1 X2; ii) Determine whether these r.v.s are independent or not. 9.2.6 Let the independent r.v.s X1, X2 have p.d.f. f given by f x =
1 I 1, x . x2 ( ) Determine the distribution of the r.v. X = X1/X2. 9.2.7 Let X be an r.v. distributed as tr.
()
()
ii) For r = 1, show that the p.d.f. of X becomes a Cauchy p.d.f.; 1 ii) Also show that the r.v. Y = is distributed as Beta. 1+ X2 r
9.2.8
If the r.v. X is distributed as Fr ,r , then:

1 2
i) Find its expectation and variance; ii) If r1 = r2, show that its median is equal to 1; 1 iii) The p.d.f. of Y = is Beta; 1 + r1 r2 X iv) The p.d.f. of r1 X converges to that of 2 r as r2 .
(Hint: For part (iv), use Stirlings formula (see, for example, W. Fellers book An Introduction to Probability Theory, Vol. I, 3rd ed., 1968, page 50) which states that, as n , (n)/(2)1/2n(2n1)/2en tends to 1.)
2 9.2.9 Let X1, X2 be independent r.v.s distributed as 2 r and r , respectively, and set X = X1 + X2, Y = X1/X2. Then show that:
1 2
i) The r.v. X is distributed as 2 r +r (as anticipated);

1 2
ii) The r.v. Y is distributed as Z, where Z has the Fr ,r distribution; r iii) The r.v.s X and Y are independent.
2 1 2
r1
9.2.10 that:
Let X1, X2 be independent r.v.s distributed as N(0, 2). Then show
2 i) The r.v. X 2 1 + X 2 has the Negative Exponential distribution with parameter 2 = 1/2 ; ii) The r.v. X1/X2 has the Cauchy distribution with = 0 and = 1; 2 iii) The r.v.s X 2 1 + X 2 and X1/X2 are independent.
9.3 Linear Transformations 9.1 The of Random Univariate Vectors Case
235
9.2.11
Let Xr be an r.v. distributed as tr. Then show that:
EX r = 0, r 2; 2 X r =
9.2.12
1 2 1 2
( )
r , r 3. r 2
Let Xr ,r be an r.v. distributed as Fr ,r . Then show that:

EX r1 ,r2 = 2r 2 r2 2 r 1 + r2 2 , r2 3; 2 X r1 ,r2 = , r2 5. 2 r2 2 r1 r2 2 r2 4
)(
9.2.13
Let Xr be an r.v. distributed as tr, and let fr be its p.d.f. Then show that: fr x r
()
2
x2 exp , x . 2 2 1
(Hint: Use Stirlings formula given as a hint in Exercise 9.2.8(iv).) 9.2.14 Let Xr and Xr ,r be r.v.s distributed as 2 r and Fr ,r , respectively, and, 2 for (0, 1), let 2 and F be dened by: P ( X r ; r ,r ; r r ;) = , P(Xr ,r Fr ,r ;) = . Then show that:
1 1 1 1 2 1 1 2 1 1 1 2 1 2
Fr ,r
1
1 2 r ; r1
1
as r2 .
9.3 Linear Transformations of Random Vectors

In this section we will restrict ourselves to a special and important class of transformations, the linear transformations. We rst introduce some needed notation and terminology.
9.3.1 Preliminaries
A transformation h: k k which transforms the variables x1, . . . , xk to the variables y1, . . . , yk in the following manner: yi = cij xj , cij
j =1 k
real constants, i, j = 1, 2, , k
(1)
is called a linear transformation. Let C be the k k matrix whose elements are cij. That is, C = (cij), and let = |C| be the determinant of C. If 0, we can uniquely solve for the xs in (1) and get xi = dij y j , dij
j =1 k
real constants, i, j = 1, , k.
(2)
Let D = (dij) and * = |D|. Then, as is known from linear algebra (see also Appendix 1), * = 1/. If, furthermore, the linear transformation above is such that the column vectors (c1j, c2j, . . . , ckj), j = 1, . . . , k are orthogonal, that is
236
j j i =1 and (3) k 2 c 1 , j 1 , , k , = = ij i =1 then the linear transformation is called orthogonal. The orthogonality relations (3) are equivalent to orthogonality of the row vectors (ci1, . . . , cik) i = 1, . . . , k. That is,
cij ci j = 0
for
and
for i i j =1 k cij2 = 1, i = 1, , k. j =1
cij ci j = 0
(4)
It is known from linear algebra that || = 1 for an orthogonal transformation. Also in the case of an orthogonal transformation, we have dij = cji, i, j = 1, . . . , k, so that xi = c ji y j , i = 1, , k.
j =1 k
This is seen as follows:
c
j =1
ji
k k k k k k y j = c ji c jl xl = c ji c jl xl = xl c ji c jl = xi l =1 j =1 l =1 j =1 j =1 l =1
by means of (3). Thus, for an orthogonal transformation, if yi = cij x j , then

j =1 k
xi = c ji y j , i = 1, , k.
j =1
According to what has been seen so far, the Jacobian of the transformation (1) is J = * = 1/, and for the case that the transformation is orthogonal, we have J = 1, so that |J| = 1. These results are now applied as follows: Consider the r. vector X = (X1, . . . , Xk) with p.d.f. fX and let S be the subset of k over which fX > 0. Set Yi = cij X j , i = 1, , k,
j =1 k
where we assume = |(cij)| 0. Then the p.d.f. of the r. vector Y = (Y1, . . . , Yk) is given by
fY y1 , , yk
k k 1 fX d1 j y j , , dkj y j , = j =1 j =1 otherwise, 0,
(y , , y )
1 k
where T is the image of S under the transformation in question. In particular, if the transformation is orthogonal,
237
fY y1 , , yk
k k fX c j 1 y j , , c jk y j , = j =1 j =1 0 , otherwise.
(y , , y )
1 k
Another consequence of orthogonality of the transformation is that
Y i2 = X 2i .
i =1 i =1
In fact,
k k k k cij X j = cij X j cil X l Y = l =1 i =1 i =1 j =1 i =1 j =1 k k 2 i k k k k k k = cij cil X j X l = X j X l cij cil i =1 i =1 j =1 l =1 j =1 l =1 2
= X2 i
i =1
because
cij cil = 1
i =1
for
j = l and 0 for
j l.
We formulate these results as a theorem.

THEOREM 4
Consider the r. vector X = (X1, . . . , Xk) with p.d.f. fX which is > 0 on S k. Set Yi = cij X j ,
j =1 k
i = 1, , k,
where |(cij)| = 0. Then X i = dij Yj ,

j =1 k
i = 1, , k,
and the p.d.f. of the r. vector Y = (Y1, . . . , Yk) is
fY y1 , , yk
k k 1 fX d1 j y j , , ckj y j , = j =1 j =1 otherwise. 0,
(y , , y )
1 k
where T is the image of S under the given transformation. If, in particular, the transformation is orthogonal, then
k k fX c j 1 y j , , c jk y j , y1 , , yk T fY y1 , , yk = j =1 j =1 otherwise. 0, Furthermore, in the case of orthogonality, we also have
238
X
j =1
2 j
= Y 2 j.
j =1
The following theorem is an application of Theorem 4 to the normal case.

THEOREM 5
Let the r.v.s Xi be N(i, 2), i = 1, . . . , k, and independent. Consider the orthogonal transformation Yi = cij X j , i = 1, , k.
j =1 k
Then the r.v.s Y1, . . . , Yk are also independent, normally distributed with common variance 2 and means given by E Yi = cij j , i = 1, , k.
j =1
( ) )
PROOF
With X = (X1, . . . , Xk) and Y = (Y1, . . . , Yk), we have fX x1 , , xk
1 1 = exp 2 2 2
(x
i =1
2 i ,
and hence
fY y1 , , yk
k 1 1 exp = 2 2 2
k c ji y j i i =1 j =1
k
Now
2 2 k k k k 2 c y = c y + 2 c y ji j i ji j i i ji j i =1 j =1 i =1 j =1 j =1 k k k k = c ji cli y j yl + 2 i 2 i c ji y j i =1 j =1 l =1 j =1 k
= y j yl c ji cli + 2 i 2 i c ji y j
j =1 l =1 k i =1 i =1 j =1 i =1 2 = y2 j 2 c ji i y j + i j =1 j =1 i =1 i =1 k k k

k y j c ji i , j =1 i =1 k 2
since expanding this last expression we get:
239
k 2 k k y + c c 2 c ji i y j j ji jl i l i =1 l =1 j =1 i =1 k
= y2 j 2 i c ji y j + i l c ji c jl
j =1 k j =1 i =1 k k i =1 l =1 k j =1 2 = y2 j 2 i c ji y j + i , j =1 j = 1 i =1 i =1
as was to be seen. As a further application of Theorems 4 and 5, we consider the following result. Let Z1, . . . , Zk be independent N(0, 1), and set
Y1 = Y2 = Y = 3 M Y = k We thus have 1 k 1 Z1 + 1 k Z2 + + 1 2 1 1 3 2 Z2 Z2 2 3 2 1 k k 1 Z3 k 1 1 k Zk
2 1 1 3 2 1
Z1 Z1 +
k k 1
Z1 + +
Zk 1
k k 1
Zk .
c1 j = c ij = c ii = Hence
1 k
, j = 1, , k, and for i = 2, , k 1 , for j = 1, , i 1, and
i i1
( )
i1
i i1
2 1j
( )
=
c
j =1 k
k = 1, and for i = 2, , k, k
i 2 ij
i 1 1 c = c = i 1 i i 1 + i i 1 j =1 j =1
2 ij
( ) ( ) ( ) ( )
2
1 i 1 + = 1, i i while for i = 2, . . . , k, we get =
c1 j cij =
j =1
1 k
cij =
j =1
1 k
cij =
j =1
i 1 1 i 1 k i i 1 i i 1
( )
( )
= 0,
240
and for i, l = 2, . . . , k(i l), we have
c c
and
j =1
ij lj
= cij clj
j =1
if i < l ,
c c
For i < l, this is
1 i i1 l l 1
j =1
ij lj
if i > l .
)(
[(i 1) (i 1)] = 0, [(l 1) (l 1)] = 0.

by Theorem 4.
and for i > l, this is

1 i i1 l l 1
)(
Thus the transformation is orthogonal. It follows, by Theorem 5, that Y1, . . . , Yk are independent, N(0, 1), and that
Y i2 = Z 2i
i =1 i =1
Thus
Y i2 = Y i2 Y 12 = Z 2i
i=2 i =1 k i =1 k 2 i 2 i =1 i =1
( kZ )
)
2
= Z kZ = Zi Z .
2 Since Y1 is independent of k i=2Y i, we conclude that Z is independent of k 2 ) . Thus we have the following theorem. i = 1 (Zi Z
THEOREM 6
and S 2 are Let X1, . . . , Xk be independent r..s distributed as N(, 2). Then X independent.
PROOF
Set Zj = (Xj )/, j = 1, . . . , k. Then the Zs are as above, and hence Z= 1 X
and
2
(Z
j =1
1 2
(X
j =1
are independent. Hence X and S are independent.
Exercises
9.3.1 set: For i = 1, 2, 3, let Xi be independent r.v.s distributed as N(i, 2), and Y1 = 1 2 X1 + 1 2 X 2 , Y2 = 1 6 X1 + 1 6 1 3 X1 2 6 1 3 X3 . X2 + 1 3 X3 ,
Y3 =
X2 +
9.1
The Univariate Exercises Case
241
Then: i) Show that the r.v.s Y1, Y2, Y3 are also independent normally distributed with variance 2, and specify their respective means. (Hint: Verify that the transformation is orthogonal, and then use Theorem 5); ii) If 1 = 2 = 3 = 0, use a conclusion in Theorem 4 in order to show that 2 2 2 2 Y2 1 + Y 2 + Y 3 3. 9.3.2 If the pair of r.v.s (X, Y) has the Bivariate Normal distribution with 2 2 2 parameters 1, 2, 2 1, 2, , that is, (X, Y) N(1, 2, 1, 2, ), then show that X Y N(0, 0, 1, 1, ), and vice versa. , 9.3.3 If (X, Y) N(0, 0, 1, 1, ), and c, d are constants with cd 0, then show that (cX, dY) N(0, 0, c2, d2, 0), where 0 = if cd > 0, and 0 = if cd < 0. 9.3.4 If (X, Y) N(0, 0, 1, 1, ), show that X + Y N(0, 2(1 )), X Y N(0, 2(1 )), and X + Y, X Y are independent.
2 9.3.5 If (X, Y) N(1, 2, 2 1, 2, ), and U =
X 1 1
,V=
Y 2 2
, then:
i) Determine the distribution of the r.v.s U + V, U V, and show that these r.v.s are independent;
2 2 ii) In particular, for 2 1 = 2 = , say, specify the distributions of the r.v.s X + Y, X Y, and show that r..s are independent. 2 9.3.6 Let (X, Y) N(0, 0, 2 1, 2, ). Then: 2 iii) (X + Y, X Y) N(0, 0, 2 1, 2, 0), where
2 2 2 2 2 2 2 1 = 1 +2 1 2 ; 2 + 2 1 2 , 2 = 1 + 2 2 1 2 , and 0 = 1 2
2 iii) X + Y N(0, 2 1) and X Y N(0, 2);
iii) The r.v.s X + Y and X Y are independent if and only if 1 = 2. (Compare with the latter part of Exercise 9.3.5.)
2 9.3.7 Let (X, Y) N(1, 2, 2 1, 2, ), and let c, d be constants with cd 0. Then: 2 2 i) (cX, dY) N(c1, d2, c2 2 1, d 2, ), with + if cd > 0, and if cd < 0; 2 ii) (cX + dY, cX dY) N(c1 + d2, c1 d2, 2 1, 2, 0), where
2 2 2 2 2 2 2 1 = c 2 1 + d 2 2 2 + 2 cd 1 2 , 2 = c 1 + d 2 2 cd 1 2 ,
and 0 =
2 c 2 1 d 2 2 2
1 2
;
c d
iii) The r.v.s cX + dY and cX dY are independent if and only if
= ;
2 1
242
iv) The r.v.s in part (iii) are distributed as N(c1 + d2, 2 1), and N(c1 d2, 2 2), respectively. 9.3.8 Refer to Exercise 9.3.7 and:
i) Provide an expression for the probability P(cX + dY > ); ii) Give the numerical value of the probability in part (i) for c = 2, d = 3, = 15, 1 = 3.5, 2 = 1.5, 1 = 1, 2 = 0.9, and = 0.5. 9.3.9 For j = 1, . . . , n, let (Xj, Yj) be independent r. vectors with distribution 2 N(1, 2, 2 1, 2, ). Then: Y ; i) Determine the distribution of the r.v. X
2 2 ii) What does this distribution become for 1 = 2 and 2 1 = 2 = , say?
9.4 The Probability Integral Transform

In this short section, we derive two main results. According to the rst result, if X is any r.v. with continuous d.f. F, and if Y = F(X), then surprisingly enough Y U(0, 1). The name of this section is derived from the transformation Y = F(X), since F is represented by the integral of a p.d.f. (in the absolutely continuous case). Next, in several instances a statement has been made to the effect that X is an r.v. with d.f. F. The question then arises as to whether such an r.v. can actually be constructed. The second result resolves this question as follows: Let F be any d.f. and let Y U(0, 1). Set X = F1(Y). Then X F. The proof presented is an adaptation of the discussion in the Note The Probability Integral Transformation: A Simple Proof by E. F. Schuster, published in Mathematics Magazine, Vol. 49 (1976) No. 5, pages 242243.
THEOREM 7
Let X be an r.v. with continuous d.f. F, and dene the r.v. Y by Y = F(X). Then the distribution of Y is U(0, 1). Let G be the d.f. of Y. We will show that G(y) = y, 0 < y < 1; G(0) = 0; G(1) = 1. Indeed, let y (0, 1). Since F(x) 0 as x , there exists a such that (0 )F(a) < y; and since F(x) 1 as x , there exists > 0 such that y + < 1 and F(y) < F(y + )( 1). Set F(a) = c, y + = b, and F(b) = d. Then the function F is continuous in the closed interval [a, b] and all y of the form y + n (n 2 integer) lie in (c, d). Therefore, by the Intermediate Value Theorem (see, for example, Theorem 3(ii) on page 95 in Calculus and Analytic Geometry, 3rd edition (1966), by George B. Thomas, Addison-Wesley Publishing Company, Inc., Reading, Massachusetts) . there exist x0 and xn (n 2) in (a, b) such that F(x0) = y and F(xn) = y + n Then
PROOF
9.4 The Probability 9.1 The Integral Univariate Transform Case
243
(X x ) [F (X ) F (x )] (since F is nondecreasing) = [ F ( X ) y] (since F (x ) = y)

0 0 0
F X < y + n
( )
= F X < F xn X < xn
[ ( ) ( )]
( )
(by the fact that F is nondecreasing and by contradiction).
since F x n = y +
( )
That is (X x0) [F(X) y] (X xn). Hence
Letting n , we obtain G(y) = y. Next, G is right-continuous, being a d.f. Thus, as y 0, G(0) = lim G(y) = lim y = 0. Finally, as y 1, G(1) = lim G(y) = lim y = 1, so that G(1) = 1. The proof is completed. For the formulation and proof of the second result, we need some notation and a preliminary result. To this end, let X be an r.v. with d.f. F. Set y = F(x) and dene F1 as follows: (5) F 1 ( y) = inf {x ; F ( x) y}. From this denition it is then clear that when F is strictly increasing, for each x , there is exactly one y (0, 1) such that F(x) = y. It is also clear that, if F is continuous, then the above denition becomes as follows: (6) F 1 ( y) = inf {x ; F ( x) = y}. (See also Figs. 9.9, 9.10 and 9.11.)
) [ ( ) ] ( ) or y = F ( x ) G( y) F ( x ) = y + . n (
0 n
P X x0 P F X y P X x n ,
1 F
F y y
0
Figure 9.9
0 A x
Figure 9.10
Figure 9.11
244
We now establish the result to be employed.

LEMMA 1
Let F 1 be dened by (5). Then F1(y) t if and only if y F(t). We have F1(y) = inf {x ;F(x) y}. Therefore there exists xn {x ;F(xn) y} such that xn F1(y). Hence F(xn) F [F 1(y)], by the right continuity of F, and
PROOF
F F 1 y y.
1 1
Now assume that F (y) t. Then F[F (y)] F(t), since F is nondecreasing. Combining this result with (7), we obtain y F(t). Next assume, that y F(t). This means that t belongs to the set {x , F(x) y} and hence F1(y) t. The proof of the lemma is completed. By means of the above lemma, we may now establish the following result.
THEOREM 8
[ ( )]
(7)
Let Y be an r.v. distributed as U(0, 1), and let F be a d.f. Dene the r.v. X by X = F 1(Y), where F1 is dened by (5). Then the d.f. of X is F.
PROOF
We have
P X x = P F 1 Y x = P Y F x = F x ,
) [ ( ) ] [
( )]
()
where the last step follows from the fact that Y is distributed as U(0, 1) and the one before it by Lemma 1. As has already been stated, the theorem just proved provides a specic way in which one can construct an r.v. X whose d.f. is a given d.f. F.
REMARK 7
Exercise
9.4.1 Let Xj, j = 1, . . . , n be independent r.v.s such that Xj has continuous and strictly increasing d.f. Fj. Set Yj = Fj(Xj) and show that the r.v. X = 2 log 1 Yj
j =1 n
is distributed as 2 2n.
Chapter 10
Order Statistics and Related Theorems
In this chapter we introduce the concept of order statistics and also derive various distributions. The results obtained here will be used in the second part of this book for statistical inference purposes.
10.1 Order Statistics and Related Distributions

Let X1, X2, . . . , Xn be i.i.d. r.v.s with d.f. F. The jth order statistic of X1, X2, . . . , Xn is denoted by X( j), or Yj, for easier writing, and is dened as follows:
Yj = jth smallest of the X 1 , X 2 , , X n , j = 1, , n;
(that is, for each s S, look at X1(s), X2(s), . . . , Xn(s), and then Yj(s) is dened to be the jth smallest among the numbers X1(s), X2(s), . . . , Xn(s), j = 1, 2, . . . , n). It follows that Y1 Y2 Yn, and, in general, the Y s are not independent. We assume now that the Xs are of the continuous type with p.d.f. f such that f(x) > 0, ( )a < x < b( ) and zero otherwise. One of the problems we are concerned with is that of nding the joint p.d.f. of the Ys. By means of Theorem 3, Chapter 9, it will be established that:
THEOREM 1
If X1, . . . , Xn are i.i.d. r.v.s with p.d.f. f which is positive for a < x < b and 0 otherwise, then the joint p.d.f. of the order statistics Y1, . . . , Yn is given by:
n! f y1 f yn , g y1 , , yn = 0,
( )
( )
a < y1 < y2 < < yn < b otherwise.
PROOF The proof is carried out explicitly for n = 3, but it is easily seen, with the proper change in notation, to be valid in the general case as well. In the rst place, since for i j,
245
246
10
P X i = X j = ( xi = x j ) f xi f x j dxi dx j = a
( )( )
x x f ( xi ) f ( x j )dxi dx j = 0,
j j
and therefore P(Xi = Xj = Xk) = 0 for i j k, we may assume that the joint p.d.f., f(, , ), of X1, X2, X3 is zero if at least two of the arguments x1, x2, x3 are equal. Thus we have
f x1 f x 2 f x3 , a < x1 x 2 x3 < b f x1 , x 2 , x3 = otherwise. 0,
( )( )( )
Thus f(x1, x2, x3) is positive on the set S, where
S = x1 , x 2 , x3 3 ; a < x i < b, i = 1, 2, 3, x1 , x 2 , x3 all different .
Let Sijk S be dened by

S ijk = x1 , x 2 , x3 ; a < x i < x j < x k < b, i, j , k = 1, 2, 3, i j k.
Then we have
S = S123 + S132 + S 213 + S 231 + S312 + S321 .

Now on each one of the Sijks there exists a one-to-one transformation from the xs to the ys dened as follows:
S123 : S132 : y1 = x1 , y1 = x1 , y2 = x 2 , y3 = x3 y2 = x3 , y3 = x 2 y3 = x3 y3 = x 2
S 213 : y1 = x 2 , y2 = x1 , S312 : y1 = x3 , y2 = x1 , S321 :
S 231 : y1 = x 2 , y2 = x3 , y3 = x1 y1 = x3 , y2 = x 2 , y3 = x1 .
Solving for the xs, we have then:

S123 : x1 = y1 , x 2 = y2 , x3 = y3 S132 : x1 = y1 , x 2 = y3 , x3 = y2 S 213 : x1 = y2 , x 2 = y1 , x3 = y3 S 231 : x1 = y3 , x 2 = y1 , x3 = y2 S312 : x1 = y2 , x 2 = y3 , x3 = y1 S321 : x1 = y3 , x 2 = y2 , x3 = y1 .
The Jacobians are thus given by:
10.1
Order Statistics and Related Distributions
247
1 0 0 S123 : J 123 = 0 1 0 = 1 0 0 1 1 0 0 S132 : J 132 = 0 0 1 = 1; 0 1 0 0 1 0 S213 : J 213 = 1 0 0 = 1 0 0 1
0 0 1 S231 : J 231 = 1 0 0 = 1 0 1 0 0 1 0 S312 : J 312 = 0 0 1 = 1 1 0 0 0 0 1 S321 : J 321 = 0 1 0 = 1. 1 0 0
Hence |J123| = = |J321| = 1, and Theorem 3, Chapter 9, gives f y1 f y2 f y3 + f y1 f y3 f y2 + f y2 f y1 f y3 + f y3 f y1 f y2 + f y2 f y3 f y1 + f y3 f y2 f y1 , g y1 , y2 , y3 = a < y1 < y2 < y3 < b 0, otherwise.
( )( )( ) ( )( )( ) ( )( )( ) ( )( )( ) ( )( )( ) ( )( )( )
This is,
3! f y1 f y2 f y3 , a < y1 < y2 < y3 < b g y1 , y2 , y3 = 0, otherwise.
( )( )( )
Notice that the proof in the general case is exactly the same. One has n! regions forming S, one for each permutation of the integers 1 through n. From the denition of a determinant and the fact that each row and column contains exactly one 1 and the rest all 0, it follows that the n! Jacobians are either 1 or 1 and the remaining part of the proof is identical to the one just given except one adds up n! like terms instead of 3!.
EXAMPLE 1
Let X1, . . . , Xn be i.i.d. r..s distributed as N(, 2 ). Then the joint p.d.f. of the order statistics Y1, . . . , Yn is given by 1 1 g y1 , , yn = n! exp 2 2 2
(y
j =1
2 ,
if < y1 < < yn < and zero otherwise.

EXAMPLE 2
Let X1, . . . , Xn be i.i.d. r..s distributed as U(, ). Then the joint p.d.f. of the order statistics Y1, . . . , Yn is given by
g y1 , , yn =
n!
( )
248
10
if < y1 < < yn < and zero otherwise. Another interesting problem is that of nding the marginal p.d.f. of each Yj, j = 1, . . . , n, as well as the joint p.d.f. of any number of the Yjs. As a partial answer to this problem, we have the following theorem.
THEOREM 2
Let X1, . . . , Xn be i.i.d. r.v.s with d.f. F and p.d.f. f which is positive and continuous for ( ) a < x < b( ) and zero otherwise, and let Y1, . . . , Yn be the order statistics. Then the p.d.f. gj of Yj, j = 1, 2, . . . , n, is given by:
n! F yj i) g j y j = j 1 ! n j ! 0, otherwise.
In particular, n 1 F y1 i) g1 y1 = 0,
( ) 1 F ( y )] f ( y ), ( ) ( )( )[ ] [
j 1 n j j j
a < yj < b
( )
( )] f ( y ),
n1 1 n1
a < y1 < b otherwise
and i) g n yn
( )
n F yn = 0,
[ ( )] f ( y ),
n
a < yn < b otherwise.
The joint p.d.f. gij of any Yi, Yj with 1 i < j n, is given by:
i 1 n! F yi F y j F yi i1! j i1! n j ! ii) g ij yi , y j = n j f yi f y j , a < yi < y j < b 1 F y j otherwise. 0,
( )(
( )]
( ) ( ) ( )] )( )[ ] [ ( )( )
j i 1
In particular, n n 1 F yn F y1 ii) g1n y1 , yn = 0,
)[ ( ) ( )]
n 2
f y1 f yn ,
( )( )
a < y1 < yn < b otherwise.
From Theorem 1, we have that g( y1, . . . , yn) = n!f( y1) f( yn) for a < y1 < < yn < b and equals 0 otherwise. Since f is positive in (a, b), it follows that F is strictly increasing in (a, b) and therefore F 1 exists in this interval. Hence if u = F(y), y (a, b), then y = F 1 (u), u (0, 1) and
PROOF
dy 1 = , du f F 1 u
[ ( )]
u 0, 1 .
( )
10.1
249
Therefore by setting Uj = F(Yj), j = 1, . . . , n, one has that the joint p.d.f. h of the Us is given by
h u1 , , un = n! f F 1 u1 f F 1 un
[ ( )]
u2
[ ( )] f [F (u )] 1 f [ F (u )]
1 1 1 n
for 0 < u1 < < un < 1 and equals 0 otherwise; that is, h(u1, . . . , un) = n! for 0 < u1 < < un < 1 and equals 0 otherwise. Hence for uj (0, 1),
h u j = n!
0
( )
uj
uj
u n 1
dun du j +1 du1 du j1 .
The rst n j integrations with respect to the variables un, . . . , uj+1 yield [1/(n j)!] (1 uj)nj and the last j 1 integrations with respect to the variables u1, . . . , uj1 yield [1/( j 1)!] ujj1. Thus
h uj =
( )
n! u jj1 1 u j j 1! n j !
)(
n j
for uj (0, 1) and equals 0 otherwise. Finally, using once again the transformation Uj = F(Yj), we obtain
g yj =
( )
( ) 1 F ( y )] f ( y ) ( )( )[ ] [
n! F yj j 1! n j !
j 1 n j j j
for yj (a, b) and 0 otherwise. This completes the proof of (i). Of course, (i) and (i) follow from (i) by setting j = 1 and j = n, respectively. An alternative and easier way of establishing (i) and (i) is the following:
Gn yn = P Yn yn = P all X j s yn = F n yn .
( )
( )
Thus gn(yn) = n[F(yn)]n1 f(yn). Similarly,

1 G1 y1 = P Y1 > y1 = P all X j s > y1 = 1 F y1
( )
) [
( )] .
n
Then
g1 y1 = n 1 F y1
( ) [
( )] [ f ( y )],
n1 1
or
g1 y1 = n 1 F y1
( ) [
( )] f ( y ).
n 1
The proof of (ii) is similar to that of (i), and in fact the same method can be used to nd the joint p.d.f. of any number of Yjs (see also Exercise 10.1.19).
EXAMPLE 3
Refer to Example 2. Then

0 , x , F x = 1, x a<x< x ,
()
250
10
and therefore
n! = j 1! n j 0, n! = j 1! n j 0, y j !
j 1
gj yj
( ) (
(
)( )(
yj
j 1
nj
1 ,
nj
a<yj < otherwise
)!( )
(y
) ( y )
j
a<yj < otherwise.
Thus
y n1 1 n1 n 1 y1 , = n n g1 y1 = 0 , y n1 1 n1 n n = yn , n n g n yn = 0 ,
( )
< y1 <
otherwise,
( )
< yn <
otherwise,
n
g1n y1 , yn
y y1 n n 1 n = 0,
n 2
n n1
(y
y1
n 2
a < y1 < yn < otherwise.
In particular, for = 0, = 1, these formulas simplify as follows:
n! y jj 1 1 y j j n j 1 ! ! g j yj = 0,
( ) (
)(
n j
0 < yj < 1 otherwise.
Since (m) = (m 1)!, this becomes

n+1 y jj1 1 y j g j yj = j n j + 1 0 ,
( )
( () (
n j
0 < yj < 1 otherwise,
which is the density of a Beta distribution with parameters = j, = n j + 1. Likewise
10.1
251
n 1 y1 g1 y1 = 0, nyn 1 , gn yn = n 0,
( )
n 1
0 < y1 < 1 otherwise,
( )
0 < yn < 1 otherwise
and
g1n y1 , yn
n n 1 yn y1 = 0,
)(
n 2
0 < y1 < yn < 1 otherwise.
The r.v. Y = Yn Y1 is called the (sample) range and is of some interest in statistical applications. The distribution of Y is found as follows. Consider the transformation
y = yn y1 z = y1 .
Therefore
y = z Then 1 yn = y + z
and hence
J = 1.
fY , Z y, z = g1n z, y + z
( )
) ) ( )]
n 2
= n n1 F y+ z F z
)[ (
0 < y < b a f z f y + z , a < z < b y
()(
and zero otherwise. Integrating with respect to z, one obtains
fY y = n n 1 0,
()
) [F ( y + z) F (z)] f (z) f ( y + z)dz,

b y n 2 a
0 < y< ba otherwise.
In particular, if X is an r.v. distributed as U(0, 1), then
fY y = n n 1
that is
() (
1 y
y n 2 dz = n n 1 y n 2 1 y ,
) (
)
0 < y < 1;
n 2 1 y , n n 1 y fY y = 0,
()
0< y<1 otherwise.
Let now U be and independent of the sample range Y. Set

2 r
Z=
Y U r
We are interested in deriving the distribution of the r.v. Z. To this end, we consider the transformation
252
10
y z = u r w = u r .
Then
u = rw y = z w
and hence
J = r w.
Therefore
fZ , W z, w = fY z w fU rw r w ,
( )
( )
if 0 < z, w < and zero otherwise. Integrating out w, we get fZ z = fY z w fU rw r w dw,

0
()
if 0 < z < and zero otherwise. Now if the r.v.s X1, . . . , Xn are i.i.d. N(0, 1) and Y is as above, then the r.v. Z is called the Studentized range. Its density is given by fZ(z) above and the values of the points z for which P(Z > z) = are given by tables for selected values of . (See, for example, Donald B. Owens Handbook of Statistical Tables, pp. 144149, published by Addison-Wesley.)
( )
( )
Exercises
Throughout these exercises, Xj, j = 1, . . . , n, are i.i.d. r.v.s and Yj = X( j) is the jth order statistic of the Xs. The r.v.s Xj, j = 1, . . . , n may represent various physical quantities such as the breaking strength of certain steel bars, the crushing strength of bricks, the weight of certain objects, the life of certain items such as light bulbs, vacuum tubes, etc. From these examples, it is then clear that the distribution of the Y s and, in particular, of Y1, Yn as well as Yn Y1, are quantities of great interest. 10.1.1 Let Xj, j = 1, . . . , n be i.i.d. r.v.s with d.f. and p.d.f. F and f, respectively, and let m be the median of F. Use Theorem 2(i) in order to calculate the probability that all Xjs exceed m; also calculate the probability P(Yn m). 10.1.2 Let X1, X2, X3 be independent r.v.s with p.d.f. f given by: ( x ) f x =e I ( , ) x1 .
()
( )
Use Theorem 2(i) in order to determine the constant c = c( ) for which P( < Y3 < c) = 0.90. 10.1.3 If the independent r.v.s X1, . . . , Xn are distributed as U(, ), then: i) Calculate the probability that all Xs are greater than ( + )/2; ii) In particular, for = 0, = 1, and n = 2, derive the p.d.f. of the r.v. Y2/Y1. 10.1.4 Let Xj, j = 1, . . . , n be independent r.v.s distributed as U(, ). Then: i) Use the p.d.f. derived in Example 3 in order to show that
Exercises
253
EY j
( ) j + =
n+1
and
( ) j(n j + 1) ; (Y ) = (n + 1) (n + 2)
2 j 2
ii) Derive EY1, 2(Y1), and EYn, 2(Yn) from part (i); iii) What do the quantities in parts (i) and (ii) become for = 0 and = 1? (Hint: In part (i), use the appropriate Beta p.d.f.s to facilitate the integrations.) 10.1.5 i) Refer to the p.d.f. gij derived in Theorem 2(ii), and show that, if X1, . . . , Xn are independent with distribution U(, ), then:
g1n y1 , yn =
n n1
( ) )
n
)
n
(y
y1
n 2
, < y1 < yn < ;
ii) Set Y = Yn Y1, and show that the p.d.f. of Y is given by:
fY y =
()
n n1
( )
n
n
( y) y
n1
n 2
, 0 < y < ;
iii) For a and b with 0 < a < b , show that: P a <Y < b =
( )
[( b)b
a a n1 +
) ]
( )
bn a n
n
iv) What do the quantities in parts (i)(iii) become for = 0 and = 1? 10.1.6 Let X1, . . . , Xn be independent r.v.s distributed as U(0, 1), and let 1 i < j n. i) Refer to the p.d.f. gij derived in Theorem 2(ii), and show that, in the present case:
g ij yi , y j =
( )(
(
n! yii1 y j yi i1! j i1! n j !
)(
) (1 y )
j i1 j
n j
0 < yi < y j < 1;

ii) Integrating by parts repeatedly, show that:
i 0 y ( z y) z j i 1
dy =
i! j i 1 ! j z, j!
j +1 0 z (1 z) 1
n j
dz =
( j + 1)!(n j )! ; (n + 2)!
iii) Use parts (i) and (ii) to show that
E YY i j =
(n + 1)(n + 2)
i j +1
254
10
iv) By means of part (iii) and Exercise 1.4(i), show that:
Cov Yi , Yj =
i n j +1
n+1
)(
2
n+ 2
and Yi , Yj =
i n j +1
[(
i ni +1 j n j +1
)(
)]
1 2
v) From part (iv), derive Cov(Y1, Yn) and (Y1, Yn). 10.1.7 Let the independent r.v.s X1, . . . , Xn be distributed as U(0, 1), and let 1 < j < n. Use the relevant results in Example 3, and Exercise 1.6(i) in order to derive: i) The conditional p.d.f. of Yj, given Y1; ii) The conditional p.d.f. of Yj, given Yn; iii) The conditional p.d.f. of Yn, given Y1; and the conditional p.d.f. of Y1, given Yn. 10.1.8 Let the independent r.v.s X1, . . . , Xn be distributed as U(0, 1), and dene the r.v.s Zj, j = 1, . . . , n as follows: Z1 = Y1, Zj = Yj Yj1, j = 2, . . . , n. Then use the result in Theorem 1 in order to show that the r.v.s Zj, j = 1, . . . , n are uniformly distributed over the set n z1 , , zn ; zj 0, j = 1, , n and
z
j =1
1.
(For n = 2, this set is a triangle in .)

2
10.1.9 i) Let the independent r.v.s X1, . . . , Xn have the Negative Exponential distribution with parameter . Then show that Y1 has the same distribution with parameter n; ii) Let F be the (common) d.f. of the independent r.v.s X1, . . . , Xn, and suppose that their rst order statistic Y1 has the Negative Exponential distribution with parameter n. Then F is the Negative Exponential d.f. with parameter . 10.1.10 Let the independent r.v.s X1, . . . , Xn have the Negative Exponential distribution with parameter . Then: i) Use Theorem 2(i) in order to show that the p.d.f. of Yn is given by:
g n yn = ne y 1 e y
n
( )
n1
, yn > 0 ;
ii) Let Y be the (sample) range; that is, Y = Yn Y1, and then use Theorem 2 (ii ) in order to show that the p.d.f. of Y is given by:
fY y = n 1 e y 1 e y
() (
n 2
, y > 0;
Exercises
255
iii) Calculate the probability P(a < Y < b) for 0 < a < b; iv) For a = 1/, b = 2/, and n = 10, nd a numerical value for the probability in part (iii). 10.1.11 Let the independent r.v.s X1, . . . , Xn have the Negative Exponential distribution with parameter , and let 1 < j < n. Use Theorem 2(ii) and Exercises 1.9(i) and 1.10(i) in order to determine: i) The conditional p.d.f. of Yj, given Y1; ii) The conditional p.d.f. of Yj, given Yn; iii) The conditional p.d.f. of Yn, given Y1; and the conditional p.d.f. of Y1, given Yn. 10.1.12 Let the independent r.v.s X1, . . . , Xn have the Negative Exponential distribution with parameter , and set: Z1 = Y1, Zj = Yj Yj1, j = 2, . . . , n. Then: i) For j = 1, . . . , n, show that Zj has the Negative Exponential distribution with parameter (n j + 1), and that these r.v.s are independent; ii) From the denition of the Zjs, it follows that Yj = Z1 + + Zj, j = 1, . . . , n. Use this expression and part (i) in order to conclude that:
EY j =
11 1 1 ++ + ; n j + 1 n n1
iii) Use part (i) in order to show that, for c > 0: P min X i X j c = exp n n 1 c 2 . i j 10.1.13 Refer to Exercise 10.1.12 and show that:
2 i) 2(Yj) = ji = 1 i2 , where 2 i = [(n i + 1)] ,
[ ( ) ]
i = 1, . . . , n;
2 i ii) For 1 i j < n, Cov(Yi, Yj) = k = 1 k ;
iii) From parts (i) and (ii), conclude that: n n n c j Yj = j2 ci , ci constants; j =1 j =1 i = j

2 2
iv) Also utilize parts (i) and (ii) in order to show that:
n n n n Cov ci Yi , d j Yj = i2 c j d j + 2 ck dl , i =1 i =1 j = i 1k < l n j =1
where cj , dj constants. Let Xj, j = 1, . . . , n be i.i.d. r.v.s. Then the sample median SM is dened as follows:
256
10
SM
Y = 1 Y +Y 2
n+ 1 2 n 2 n +2 2
if n is odd if n is even.
(*)
10.1.14 If Xj, j = 1, . . . , n are i.i.d. r.v.s, and n is odd, determine the p.d.f. of SM when the underlying distribution is: i) U(, ); ii) Negative Exponential with parameter . 10.1.15 If the r.v.s Xj, j = 1, . . . , n are independently distributed as N(, 2), show that the p.d.f. of SM is symmetric about , where SM is dened by (*). Without integration, conclude that ESM = . 10.1.16 For n odd, let the independent r.v.s Xj, j = 1, . . . , n have p.d.f. f with median m. Then determine the p.d.f. of SM, and also calculate the probability P(SM > m) in each one of the following cases: i) ii) iii) iv) f(x) = 2xI(0,1)(x); f(x) = 2(2 x)I(1,2)(x); f(x) = 2(1 x)I(0,1)(x); What do parts (i)(iii) become for n = 3?
10.1.17 Refer to Exercise 10.1.2 and derive the p.d.f. of SM, where SM is dened by (*).
1 10.1.18 Let Xj, j = 1, . . . , 6 be i.i.d. r.v.s with p.d.f. f given by f(x) = , 6 x = 1, . . . , 6. Find the p.d.f.s of Y1 and Y6. Also, observe that P(Y1 = y) = P(Y6 = 7 y), y = 1, . . . , 6.
10.1.19
Carry out the proof of part (ii) of Theorem 2.
10.2 Further Distribution Theory: Probability of Coverage of a Population Quantile

It has been shown in Theorem 7, Chapter 9, that if X is an r.v. with continuous d.f. F, then the r.v. Y = F(X) is U(0, 1). This result in conjunction with Theorem 1 of the present chapter gives the following theorem.
THEOREM 3
Let X1, . . . , Xn be i.i.d. r..s with continuous d.f. F and let Zj = F(Yj), where Yj, j = 1, 2, . . . , n are the order statistics. Then Z1, . . . , Zn are order statistics from U(0, 1), and hence their joint p.d.f., h is given by:
n!, 0 < z1 < < zn < 1 h z1 , , zn = 0, otherwise.
10.2 Further Distribution Theory: Probability of Coverage of a Population Quantile
257
Set Wj = F(Xj), j = 1, 2, . . . , n. Then the Wjs are independent, since the Xjs are, and also distributed as U(0, 1), by Theorem 7, Chapter 9. Because F is nondecreasing, to each ordering of the Xjs, X(1) X(2) X(n) there corresponds the ordering F(X(1)) F(X(2)) F(X(n)) of the F(Xj)s, and conversely. Therefore W( j) = F(Yj), j = 1, 2, . . . , n. That the joint p.d.f. of the Zjs is the one given above follows from Theorem 1 of this chapter.
PROOF
The distributions of Zj, Z1, Zn and (Z1, Zn) are given in Example 3 of this chapter. Let now X be an r.v. with d.f. F. Consider a number p, 0 < p < 1. Then in Chapter 4, a pth quantile, xp, of F was dened to be a number with the following properties: i) P(X xp) p and ii) P(X xp) 1 p. Now we would like to establish a certain theorem to be used in a subsequent chapter.
THEOREM 4
Let X1, . . . , Xn be i.i.d. r.v.s with continuous d.f. F and let Y1, . . . , Yn be the order statistics. For p, 0 < p < 1, let xp be the (unique by assumption) pth quantile. Then we have
P Yi x p Yj =
k =i
j 1
( )p q
n k k
n k
, where q = 1 p.
PROOF
Dene the r.v.s Wj, j = 1, 2, . . . , n as follows:

1, X j x p Wj = 0, X j > x p ,
j = 1, 2, , n.
Then W1, . . . , Wn are i.i.d. r..s distributed as B(1, p), since

P W1 = 1 = P X1 x p = F x p = p.
( )
n
Therefore
P at least i of X 1 , , X n x p =
k =i
( )p q
n k k k n k
n k
or equivalently,
P Yi < x p = P Yi x p =
k= i
( )pq
n k
Next, for 1 i < j n, we get

P Yi x p = P Yi x p , Y j x p + P Yi x p , Y j < x p
i p j i p
( = P(Y x
) ( Y ) + P(Y < x ),
258
10
since
(Y
Therefore
< x p Yi x p .
) (
(
P Yi x p Y j = P Yi x p P Y j < x p .
) (
n
By means of (1), this gives P Yi x p Yj =

k =i
( )p q
n k k
n k
k= j
( )p q
n k k
n k
=
k =i
j 1
( )p q
n k k
n k
Exercise
10.2.1 Let Xj, j = 1, . . . , n be i.i.d. r.v.s with continuous d.f. F. Use Theorem 3 and the relevant part of Example 3 in order to determine the distribution of the r.v. F(Y1) and nd its expectation.
11.1
Sufciency: Denition and Some Basic Results
259
Chapter 11
Sufficiency and Related Theorems
Let X be an r.v. with p.d.f. f(; ) of known functional form but depending upon an unknown r-dimensional constant vector = (1, . . . , r) which is called a parameter. We let stand for the set of all possible values of and call it the parameter space. So r, r 1. By F we denote the family of all p.d.f.s we get by letting vary over ; that is, F = { f(; ); }. Let X1, . . . , Xn be a random sample of size n from f(; ), that is, n independent r.v.s distributed as X above. One of the basic problems of statistics is that of making inferences about the parameter (such as estimating , testing hypotheses about , etc.) on the basis of the observed values x1, . . . , xn, the data, of the r.v.s X1, . . . , Xn. In doing so, the concept of sufciency plays a fundamental role in allowing us to often substantially condense the data without ever losing any information carried by them about the parameter . In most of the textbooks, the concept of sufciency is treated exclusively in conjunction with estimation and testing hypotheses problems. We propose, however, to treat it in a separate chapter and gather together here all relevant results which will be needed in the sequel. In the same chapter, we also introduce and discuss other concepts such as: completeness, unbiasedness and minimum variance unbiasedness. For j = 1, . . . , m, let Tj be (measurable) functions dened on n into and not depending on or any other unknown quantities, and set T = (T1, . . . , Tm). Then T X 1 , , X n = T1 X 1 , , X n , , Tm X 1 , , X n
) ( (
))
is called an m-dimensional statistic. We shall write T(X1, . . . , Xn) rather than T(X1, . . . , Xn) if m = 1. Likewise, we shall write rather than when r = 1. Also, we shall often write T instead of T(X1, . . . , Xn), by slightly abusing the notation.
259
260
11
Sufciency and Related Theorems
The basic notation and terminology introduced so far is enough to allow us to proceed with the main part of the present chapter.
11.1 Sufciency: Definition and Some Basic Results

Let us consider rst some illustrative examples of families of p.d.f.s.
EXAMPLE 1
Let X = (X1, . . . , Xr) have the Multinomial distribution. Then by setting j = pj, j = 1, . . . , r, we have = 1 , , r , = 1 , , r r ; j > 0, j = 1, , r r and j = 1 j =1
and
f x; =
( )
n! 1x1 rxr I A x = x1! xr !
()
r 1 j =1
x j ! n x1 xr 1 ! IA x ,
n!
r1 1x1 rx 1 1 1 r 1
1 n r j = 1x j
()
r A = x = x1 , , xr r ; x j 0, j = 1, , r , x j = n. j =1 For example, for r = 3, is that part of the plane through the points (1, 0, 0), (0, 1, 0) and (0, 0, 1) which lies in the rst quadrant, whereas for r = 2, the distribution of X = (X1, X2) is completely determined by that of X1 = X which is distributed as B(n, 1) = B(n, ).
EXAMPLE 2
Let X be U(, ). By setting 1 = , 2 = , we have = (1, 2), = {(1, 2) 2; 1, 2 , 1 < 2} (that is, the part of the plane above the main diagonal) and 1 f x; = IA x , A = 1 , 2 . 2 1
()
If is known and we put = , then = (, ) and 1 f x; = IA x , A = , . Similarly, if is known and = .
()
EXAMPLE 3
Let X be N(, 2). Then by setting 1 = , 2 = 2, we have = (1, 2),

= 1 , 2 2 ; 1 , 2 > 0 (that is, the part of the plane above the horizontal axis) and
11.1
261
x 1 f x; = exp 2 2 2 2 If is known and we set = , then = and
. .
x f x; = exp 2 2 2 Similarly if is known and 2 = .
EXAMPLE 4
Let X = (X1, X2) have the Bivariate Normal distribution. Setting 1 = 1, 2 = 2, 2 3 = 2 1, 4 = 2, 5 = , we have then = (1, . . . , 5) and
= 1 , , 5 5 ; 1 , 2 , 3 , 4 0, , 5 1, 1
and f x; = where
( )
1 2 1 2 1 2
e q 2 ,
q=
2 x 2 x1 1 x2 2 x2 2 1 1 + 2 , 1 1 2 2 x = x1 , x2 .
1 1 2
Before the formal denition of sufciency is given, an example will be presented to illustrate the underlying motivation.
EXAMPLE 5
Let X1, . . . , Xn be i.i.d. r.v.s from B(1, ); that is,
fX x j ; =
j
xj
(1 )
1 x j
I A xj ,
( )
)
j = 1, , n,
where A = {0, 1}, = (0, 1). Set T = n j = 1 Xj. Then T is B(n, ), so that
n fT t ; = t 1 t
( )
n t
IB t ,
()
where B = {0, 1, . . . , n}. We suppose that the Binomial experiment in question is performed and that the observed values of Xj are xj, j = 1, . . . , n. Then the problem is to make some kind of inference about on the basis of xj, j = 1, . . . , n. As usual, we label as a success the outcome 1. Then the following question arises: Can we say more about if we know how many successes occurred and where rather than merely how many successes occurred? The answer to this question will be provided by the following argument. Given that the number of successes is t, that is, given that T = t, t = 0, 1, . . . , n, nd the probability of
262
11
each one of the (n t ) different ways in which the t successes can occur. Then, if there are values of for which particular occurrences of the t successes can happen with higher probability than others, we will say that knowledge of the positions where the t successes occurred is more informative about than simply knowledge of the total number of successes t. If, on the other hand, all possible outcomes, given the total number of successes t, have the same probability of occurrence, then clearly the positions where the t successes occurred are entirely irrelevant and the total number of successes t provides all possible information about . In the present case, we have
P X 1 = x1 , , X n = xn | T = t = =
P X 1 = x1 , , X n = xn , T = t P X 1 = x1 , , X n = xn P T = t
P T = t
if x1 + + xn = t
and zero otherwise, and this is equal to
x 1
1
n t 1 t
1 x 1
x 1
n
1 x n
n t
t 1
n t 1 t
n t
n t
1 n t
if x1 + + xn = t and zero otherwise. Thus, we found that for all x1, . . . , xn such that xj = 0 or 1, j = 1, . . . , n and
x j = t , P ( X 1 = x1 , , X n = xn | T = t ) = 1
j =1
n t
independent of , and therefore the total number of successes t alone provides all possible information about . This example motivates the following denition of a sufcient statistic.
DEFINITION 1
Let Xj, j = 1, . . . , n be i.i.d. r.v.s with p.d.f. f (; ), = (1, . . . , r) r, and let T = (T1, . . . , Tm), where
Tj = Tj X 1 , , X n ,
j = 1, , m
are statistics. We say that T is an m-dimensional sufcient statistic for the family F = { f(; ); }, or for the parameter , if the conditional distribution of (X1, . . . , Xn), given T = t, is independent of for all values of t (actually, for almost all (a.a.)t, that is, except perhaps for a set N in m of values of t such that P (T N) = 0 for all , where P denotes the probability function associated with the p.d.f. f(; )).
REMARK 1 Thus, T being a sufcient statistic for implies that every (measurable) set A in n, P[(X1, . . . , Xn) A|T = t] is independent of for a.a.
11.1
263
t. Actually, more is true. Namely, if T* = (T* 1, . . . , T* k) is any k-dimensional statistic, then the conditional distribution of T*, given T = t, is independent of for a.a. t. To see this, let B be any (measurable) set in k and let A = T*1 (B). Then
P T* B T = t = P X 1 , , X n A T = t and this is independent of for a.a. t. We nally remark that X = (X1, . . . , Xn) is always a sufcient statistic for .
Clearly, Denition 1 above does not seem appropriate for identifying a sufcient statistic. This can be done quite easily by means of the following theorem.
THEOREM 1
(FisherNeyman factorization theorem) Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), = (1, . . . , r) r. An m-dimensional statistic T = T X 1 , , X n = T1 X 1 , , X n , , Tm X 1 , , X n
) ( (
))
is sufcient for if and only if the joint p.d.f. of X1, . . . , Xn factors as follows,
f x1 , , xn ; = g T x1 , , xn ; h x1 , , xn ,
) [ (
) ](
where g depends on x1, . . . , xn only through T and h is (entirely) independent of . The proof is given separately for the discrete and the continuous case. Discrete case: In the course of this proof, we are going to use the notation T(x1, . . . , xn) = t. In connection with this, it should be pointed out at the outset that by doing so we restrict attention only to those x1, , xn for which T(x1, . . . , xn) = t. Assume that the factorization holds, that is,
PROOF
f x1 , , xn ; = g T x1 , , xn ; h x1 , , xn ,
) [ (
) ](
with g and h as described in the theorem. Clearly, it sufces to restrict attention to those ts for which P (T = t) > 0. Next,
P T = t = P T X 1 , , X n = t = P X 1 = x1 , , X n = xn ,
where the summation extends over all (x1 , . . . , xn ) for which T(x1 , . . . , xn ) = t. Thus
P T = t = f x1 ; f xn ; = g t; h x1 , , xn
1 n
[(
) ]
) ( ) = g(t; ) h( x , , x ).
( )(
Hence
264
11
P X 1 = x1 , , X n = xn T = t = =
P X 1 = x1 , , X n = xn , T = t P T = t
( )( ) = h( x , , x ) g(t; ) h( x , , x ) h( x , , x )
g t; h x1 , , xn
1 1 n n 1 n
) = P (X
= x1 , , X n = xn P T = t
and this is independent of . Now, let T be sufcient for . Then P (X1 = x1, . . . , Xn = xn|T = t) is independent of ; call it k[x1, . . . , xn, T(x1, . . . , xn )]. Then
P X 1 = x1 , , X n = xn T = t =
P X 1 = x1 , , X n = xn
= k x1 , , xn , T x1 , , xn
P T = t
) )]
if and only if f x1 ; f xn ; = P X 1 = x1 , , X n = xn
1 n
( ) = P (T = t)k[ x , , x , T( x , , x )].
1 n
Setting
g T x1 , , xn ; = P T = t
[(
) ]
= k x1 , , xn , T x1 , , xn ,
and h x1 , , xn
)]
)
)
we get
f x1 ; f xn ; = g T x1 , , xn ; h x1 , , xn ,
) [ (
) ](
as was to be seen. Continuous case: The proof in this case is carried out under some further regularity conditions (and is not as rigorous as that of the discrete case). It should be made clear, however, that the theorem is true as stated. A proof without the regularity conditions mentioned above involves deeper concepts of measure theory the knowledge of which is not assumed here. From Remark 1, it follows that m n. Then set Tj = Tj(X1, . . . , Xn), j = 1, . . . , m, and assume that there exist other n m statistics Tj = Tj(X1, . . . , Xn), j = m + 1, . . . , n, such that the transformation
t j = Tj x1 , , xn ,
j = 1, , n,
is invertible, so that
x j = x j t, t m +1 , , t n ,
j = 1, , n, t = t1 , , t m .
11.1
265
It is also assumed that the partial derivatives of xj with respect to ti, i, j = 1, . . . , n, exist and are continuous, and that the respective Jacobian J (which is independent of ) is different from 0. Let rst
f x1 ; f xn ; = g T x1 , , xn ; h x1 , , xn .
) [ (
) ](
Then fT , T , , T t, t m +1 , , t n ;
( )[ ( = g(t; )h * (t , t
m+1
= g t; h x1 t, t m +1 , , t n
m +1
, , tn ,
) ), , x (t, t
n
m +1
, , tn
)] J
where we set
h * t, t m +1 , , t n = h x1 t, t m +1 , , t n , , xn t, t m +1 , , t n
Hence
) [ (
)] J .
()
fT t; = g t; h * t, t m +1 , , t n dt m +1 dt n = g t; h ** t ,

( )
( ) (

( )
where
h * * t = h * t, t m +1 , , t n dt m +1 dt n .
()
That is, fT(t; ) = g(t; )h**(t) and hence

f t m +1 , , t n t; =
g t; h * t , t , ,t h * t, t , ,t ) ( )g(t; ()h * *(t) ) = ( h * *(t ) )

m +1 n m +1 n
which is independent of . That is, the conditional distribution of Tm+1, . . . , Tn, given T = t, is independent of . It follows that the conditional distribution of T, Tm+1, , Tn, given T = t, is independent of . Since, by assumption, there is a one-to-one correspondence between T, Tm+1, . . . , Tn, and X1, . . . , Xn, it follows that the conditional distribution of X1, . . . , Xn, given T = t, is independent of . Let now T be sufcient for . Then, by using the inverse transformation of the one used in the rst part of this proof, one has
f x1 , , xn ; = fT , T , , T t, t m +1 , , t n ; J 1 = f t m +1 , , t n t; fT t; J 1 .
But f(tm+1, . . . , tn|t; ) is independent of by Remark 1. So we may set
f t m +1 , , t n t; J 1 = h * t m +1 , , t n ; t = h x1 , , xn .
m+1
) ( )
) (
If we also set
fT t; = g T x1 , , xn ; ,
( ) [ (
) ]
266
11
we get
f x1 , , xn ; = g T x1 , , xn ; h x1 , , xn ,
as was to be seen.
COROLLARY
) [ (
) ](
Let : m m ((measurable and independent) of ) be one-to-one, so that = (T) is also the inverse 1 exists. Then, if T is sufcient for , we have that T = (), where : r r is one-to-one sufcient for and T is sufcient for (and measurable). ). Thus PROOF We have T =1[ (T)] = 1( T
f x1 , , xn ; = g T x1 , , xn ; h x1 , , xn
=g
) [ (
) ]( ) (x , , x )]; }h( x , , x ) [T
1 n 1 n
is sufcient for . Next, which shows that T
. = 1 = 1
[ ( )]
()
Hence
f x1 , , xn ; = g T x1 , , xn ; h x1 , , xn
becomes
) [ (
) ](
) )
x, f 1 , xn ; = g T x1 , , xn ; h x1 , , xn ,
where we set
1 x, f 1 , xn ; = f x1 , , xn ;
) [(
) ](
) [
( )] ( )]
and
1 =g T x , T x1 , , xn ; g . 1 , xn ;
. Thus, T is sufcient for the new parameter
[(
) ]
[(
We now give a number of examples of determining sufcient statistics by way of Theorem 1 in some interesting cases.
EXAMPLE 6
Refer to Example 1, where
f x; =
( )
n! 1x rx I A x . x1! xr !
1 r
()
Then, by Theorem 1, it follows that the statistic (X1, . . . , Xr) is sufcient for = (1, . . . , r). Actually, by the fact that rj = 1j = 1 and rj = 1 xj = n, we also have f x; =
( )
r 1 j =1
1
x j ! n x1 xr 1 !
r1
n!
1x rx1 1 1 r 1
1 n r j = 1x j
IA x
()
11.1
267
from which it follows that the statistic (X1, . . . , Xr1) is sufcient for (1, . . . , r1). In particular, for r = 2, X1= X is sufcient for 1 = .
EXAMPLE 7
Let X1, . . . , Xn be i.i.d. r.v.s from U(1, 2). Then by setting x = (x1, . . . , xn) and = (1, 2), we get
f x; = =
( )
( (
1 1 1
) )
I [
1,
) x(1) I ( , ] x( n )
2
( )
( )
g1 x(1) , g 2 x( n ) , ,
2
][
where g1[x(1), ] = I[ , )(x(1)), g2[x(n), ] = I(, ](x(n)). It follows that (X(1), X(n)) is sufcient for . In particular, if 1 = is known and 2 = , it follows that X(n) is sufcient for . Similarly, if 2 = is known and 1 = , X(1) is sufcient for .
1
EXAMPLE 8
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2). By setting x = (x1, . . . , xn), = 1, 2 = 2 and = (1, 2), we have
1 1 f x; = exp 2 2 2 2
( )
2 n
(x
j =1
n
2 1 .
But
(x
j =1
) = [( x
j =1
x + x 1
) (
)] = ( x
2 j =1
+ n x 1 ,
so that
1 1 f x; = exp 2 2 2 2
( )
(x
j =1
2 n x 1 . 2 2
2 It follows that ( X , n j = 1(Xj X ) ) is sufcient for . Since also
1 n 2 f x; = exp 1 exp 1 2 2 2 2 2
( )
x
j =1
1 2 2
x
j =1
2 j
it follows that, if 2 = 2 is known and 1 = , then n j = 1Xj is sufcient for , whereas if 1 = is known and 2 = , then n ( X )2 is sufcient for , as j=1 j follows from the form of f(x; ) at the beginning of this example. By the corollary to Theorem 1, it also follows that ( X , S2) is sufcient for , where S2 =
2 1 n X j X , and n j =1
1 n Xj n j =1
is sufcient for 2 = if 1 = is known. In the examples just discussed it so happens that the dimensionality of the sufcient statistic is the same as the dimensionality of the
REMARK 2
268
11
parameter. Or to put it differently, the number of the real-valued statistics which are jointly sufcient for the parameter coincides with the number of independent coordinates of . However, this need not always be the case. For example, if X1, . . . , Xn are i.i.d. r.v.s from the Cauchy distribution with parameter = (, 2), it can be shown that no sufcient statistic of smaller dimensionality other than the (sufcient) statistic (X1, . . . , Xn) exists. If m is the smallest number for which T = (T1, . . . , Tm), Tj = Tj(X1, . . . , Xn), j = 1, . . . , m, is a sufcient statistic for = (1, . . . , r), then T is called a minimal sufcient statistic for . In Denition 1, suppose that m = r and that the conditional distribution of (X1, . . . , Xn), given Tj = tj, is independent of j. In a situation like this, one may be tempted to declare that Tj is sufcient forj. This outlook, however, is not in conformity with the denition of a sufcient statistic. The }, notion of sufciency is connected with a family of p.d.f.s F = { f(; ); and we may talk about Tj being sufcient for j, if all other i, i j, are known; otherwise Tj is to be either sufcient for the above family F or not sufcient at all. As an example, suppose that X1, . . . , Xn are i.i.d. r.v.s from N(1, 2). Then ( X , S2) is sufcient for (1, 2), where
REMARK 3
S2 =
2 1 n Xj X . n j =1
Now consider the conditional p.d.f. of (X1, . . . , Xn1), given n j = 1Xj = yn. By using the transformation y j = x j , j = 1, , n 1, yn = x j ,
j =1 n
one sees that the above mentioned conditional p.d.f. is given by the quotient of the following p.d.f.s: 1 1 exp y1 1 2 2 2 2
n
+ + yn 1 1
and
2 + yn y1 yn 1 1
2 1 exp yn n1 . 2n 2 2 n 2
This quotient is equal to
2n 2 2 2
1 exp yn n1 2 n 2
n y1 1
n yn 1 1
2 n yn y1 yn 1 1
11.1
Exercises Sufciency: Denition and Some Basic Results
269
and
(y
n1
n y1 1
n yn 1 1
n yn y1 yn 1 1
2 2 2 2 = yn n + + yn y1 1 + yn y1 yn 1 independent of 1. Thus the conditional p.d.f. under consideration is independent of 1 but it does depend on 2. Thus n j = 1 Xj, or equivalently, X is not sufcient for (1, 2). The concept of X being sufcient for 1 is not valid unless 2 is known.
( , )
Exercises
11.1.1 In each one of the following cases write out the p.d.f. of the r.v. X and specify the parameter space of the parameter involved. i) ii) iii) iv) X X X X is distributed as Poisson; is distributed as Negative Binomial; is distributed as Gamma; is distributed as Beta.
11.1.2 Let X1, . . . , Xn be i.i.d. r.v.s distributed as stated below. Then use Theorem 1 and its corollary in order to show that: i) n j = 1 Xj or X is a sufcient statistic for , if the Xs are distributed as Poisson; ii) n j = 1 Xj or X is a sufcient statistic for , if the Xs are distributed as Negative Binomial; n n iii) ( n j = 1 Xj, j = 1 Xj) or ( j = 1 Xj, X ) is a sufcient statistic for (1, 2) = (, ) if the Xs are distributed as Gamma. In particular, n j = 1 Xj is a sufcient statistic for = if is known, and n j = 1 Xj or X is a sufcient statistic for = if is known. In the latter case, take = 1 and conclude that n j = 1 Xj = 1/ of the Negative or X is a sufcient statistic for the parameter Exponential distribution; n iv) ( n j = 1 Xj, j = 1 (1 Xj)) is a sufcient statistic for (1, 2) = (, ) if the Xs n are distributed as Beta. In particular, n j = 1 Xj or j = 1 log Xj is a sufcient n statistic for = if is known, and j = 1 (1 Xj) is a sufcient statistic for = if is known. 11.1.3 (Truncated Poisson r.v.s) Let X1, X2 be i.i.d. r.v.s with p.d.f. f(; ) given by:
f 0 ; = e ,
( ) f ( x; ) = 0,
f 1; = e ,
f 2; = 1 e e , x 0, 1, 2,
where > 0. Then show that X1 + X2 is not a sufcient statistic for .
270
11
11.1.4 Let X1, . . . , Xn be i.i.d. r.v.s with the Double Exponential p.d.f. f(; ) given in Exercise 3.3.13(iii) of Chapter 3. Then show that n j = 1|Xj| is a sufcient statistic for . 11.1.5 If Xj = (X1j, X2j), j = 1, . . . , n, is a random sample of size n from the Bivariate Normal distribution with parameter as described in Example 4, then, by using Theorem 1, show that: n n n 2 2 X1 , X 2 , X1 j , X 2 j , X1 j X 2 j j =1 j =1 j =1 is a sufcient statistic for . 11.1.6 If X1, . . . , Xn is a random sample of size n from U(, ), (0, ), show that (X(1), X(n)) is a sufcient statistic for . Furthermore, show that this statistic is not minimal by establishing that T = max(|X1|, . . . , |Xn|) is also a sufcient statistic for . 11.1.7 that If X1, . . . , Xn is a random sample of size n from N(, 2), , show
n n 2 X j, X j j =1 j =1
or X ,
X j2 j =1
n
is a sufcient statistic for . 11.1.8 If X1, . . . , Xn is a random sample of size n with p.d.f. f x; = e
I ( , ) x , ,
()
show that X(1) is a sufcient statistic for . 11.1.9 Let X1, . . . , Xn be a random sample of size n from the Bernoulli distribution, and set T1 for the number of Xs which are equal to 0 and T2 for the number of Xs which are equal to 1. Then show that T = (T1, T2) is a sufcient statistic for . 11.1.10 If X1, . . . , Xn are i.i.d. r.v.s with p.d.f. f(; ) given below, nd a sufcient statistic for .
( ) () ( ) 2 ii) f ( x; ) = ( x)I ( ) ( x), (0, );

i) f x; = x 1 I ( 0 , 1) x , 0, ;
2 0,
iii) f x; =
1 3 x x e I ( 0 , ) x , 0, ; 6 4
+1
()
c iv) f x; = c x
I ( c , ) x , 0, .
()
11.1
Sufciency: Denition and 11.2 Some Completeness Basic Results
271
11.2 Completeness
In this section, we introduce the (technical) concept of completeness which we also illustrate by a number of examples. Its usefulness will become apparent in the subsequent sections. To this end, let X be a k-dimensional random vector Rr, and let g: k be a (measurable) function, with p.d.f. f(; ), so that g(X) is an r.v. We assume that E g(X) exists for all and set F = {f(.; ); }.
DEFINITION 2
With the above notation, we say that the family F (or the random vector X) is complete if for every g as above, E g(X) = 0 for all implies that g(x) = 0 . except possibly on a set N of xs such that P(X N) = 0 for all The examples which follow illustrate the concept of completeness. Meannj while let us recall that if n = 0 for more than n values of x, then j = 0 cnj x cj = 0, j = 0, . . . , n. Also, if n = 0 cnxn = 0 for all values of x in an interval for which the series converges, then cn = 0, n = 0, 1, . . . .
EXAMPLE 9
Let n F = f ; ; f x; = x 1 x
( ) (
n x
I A x , 0, 1 ,
()
n n
( )

where A = {0, 1, . . . , n}. Then F is complete. In fact,

n n E g X = g x x 1 x x= 0
( )
()
n x
= 1
n ) g( x) x
x =0
where = /(1 ). Thus E g(X) = 0 for all (0, 1) is equivalent to

x g( x ) = 0 x x=0 n
for every (0, ), hence for more than n values of , and therefore
n g x = 0, x = 0, 1, , n x
()
which is equivalent to g(x) = 0, x = 0, 1, . . . , n.

EXAMPLE 10
Let x F = f ; ; f x; = e I A x , 0, , x ! where A = {0, 1, . . .}. Then F is complete. In fact,
( ) (
()
E g X = g x e
x= 0
( )
()
g x x x = 0 = e x! x = 0 x!
()
for (0, ) implies g(x)/x! = 0 for x = 0, 1, . . . and this is equivalent to g(x) = 0 for x = 0, 1, . . . .
272
11
EXAMPLE 11
Let
1 F = f ; ; f x; = I [ , ] x , , . Then F is complete. In fact,
( ) (
()
E g X =
( )
1 g x dx. a
()
Thus, if E g(X) = 0 for all (, ), then g(x)dx = 0 for all > which intuitively implies (and that can be rigorously justied) that g(x) = 0 except possibly on a set N of xs such that P (X N) = 0 for all , where X is an r.v. with p.d.f. f(; ). The same is seen to be true if f(; ) is U(, ).
EXAMPLE 12
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2). If is known and = , it can be shown that x 1 exp F = f ; ; f x; = 2 2 2 is complete. If is known and 2 = , then
( ) (
x 2 1 F = f ; ; f x; = exp , 0, 2 2 is not complete. In fact, let g(x) = x . Then E g(X ) = E(X ) = 0 for all (0, ), while g(x) = 0 only for x = . Finally, if both and 2 are unknown, it can be shown that ( X , S2) is complete.
( ) (
In the following, we establish two theorems which are useful in certain situations.
THEOREM 2
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), r and let T = (T1, . . . , Tm) be a sufcient statistic for , where Tj = Tj(X1, , Xn), j = 1, , m. Let g(; ) be the p.d.f. of T and assume that the set S of positivity of g(; ) is the same for all . Let V = (V1, . . . , Vk), Vj = Vj(X1, . . . , Xn), j = 1, . . . , k, be any other statistic which is assumed to be (stochastically) independent of T. Then the distribution of V does not depend on . We have that for t S, g(t; ) > 0 for all and so f(v|t) is well dened and is also independent of , by sufciency. Then
PROOF
fV , T v, t; = f v t g t;
for all v and t S, while by independence
) ( )( )
fV , T v, t; = fV v; g t;
for all v and t. Therefore
( )( )
11.1
273
fV v; g t; = f v t g t;
( )( ) ( )( )
for all v and t S. Hence fV(v; ) = f(v/t) for all v and t S; that is, fV(v; ) = fV(v) is independent of .
REMARK 4
The theorem need not be true if S depends on .
Under certain regularity conditions, the converse of Theorem 2 is true and also more interesting. It relates sufciency, completeness, and stochastic independence.
THEOREM 3
r and let (Basu) Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), T = (T1, . . . , Tm) be a sufcient statistic of , where Tj = Tj(X1, . . . , Xn), } j = 1, . . . , m. Let g(; ) be the p.d.f. of T and assume that C = {g(; ); is complete. Let V = (V1, . . . , Vk), Vj = Vj(X1, . . . , Xn), j = 1, . . . , k be any other statistic. Then, if the distribution of V does not depend on , it follows that V and T are independent. It sufces to show that for every t m for which f(v|t) is dened, one has fV(v) = f(v|t), v k. To this end, for an arbitrary but xed v, consider the statistic (T; v) = fV(v) f(v|T) which is dened for all ts except perhaps for a set N of ts such that P (T N) = 0 for all . Then we have for the continuous case (the discrete case is treated similarly)
PROOF
E T ; v = E f V v f v T = f V v E f v T

= fV v f v t1 , , t m g t1 , , t m ; dt1 dt m = fV = fV
V 1 m 1
() ( )( (v) f (v, t , , t ; )dt ( v ) f ( v ) = 0;
( ) ( )]
()
( )
dt m
that is, E(T; v) = 0 for all and hence (t; v) = 0 for all t Nc by completeness (N is independent of v by the denition of completeness). So fV(v) = f(v/t), t Nc, as was to be seen.
Exercises
11.2.1 If F is the family of all Negative Binomial p.d.f.s, then show that F is complete. 11.2.2 If F is the family of all U(, ) p.d.f.s, (0, ), then show that F is not complete. 11.2.3 (Basu) Consider an urn containing 10 identical balls numbered + 1, + 2, . . . , + 10, where = {0, 10, 20, . . . }. Two balls are drawn one by one with replacement, and let Xj be the number on the jth ball, j = 1, 2. Use this
274
11
example to show that Theorem 2 need not be true if the set S in that theorem does depend on .
11.3 UnbiasednessUniqueness
In this section, we shall restrict ourselves to the case that the parameter is realvalued. We shall then introduce the concept of unbiasedness and we shall establish the existence and uniqueness of uniformly minimum variance unbiased statistics.
DEFINITION 3
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), and let U = U(X1, . . . , Xn) be a statistic. Then we say that U is an unbiased statistic for if EU = for every , where by EU we mean that the expectation of U is calculated by using the p.d.f. f(; ). We can now formulate the following important theorem. (RaoBlackwell) Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), , and let T = (T1, . . . , Tm), Tj = Tj(X1, . . . , Xn), j = 1, . . . , m, be a sufcient statistic for . Let U = U(X1, . . . , Xn) be an unbiased statistic for which is not a function of T alone (with probability 1). Set (t) = E(U|T = t). Then we have that: i) The r.v. (T) is a function of the sufcient statistic T alone. ii) (T) is an unbiased statistic for . 2 2 iii) [(T)] < (U ), , provided EU2 < .
PROOF
THEOREM 4
i) That (T) is a function of the sufcient statistic T alone and does not depend on is a consequence of the sufciency of T. ii) That (T) is unbiased for , that is, E(T) = for every , follows from (CE1), Chapter 5, page 123. iii) This follows from (CV), Chapter 5, page 123. The interpretation of the theorem is the following: If for some reason one is interested in nding a statistic with the smallest possible variance within the class of unbiased statistics of , then one may restrict oneself to the subclass of the unbiased statistics which depend on T alone (with probability 1). This is so because, if an unbiased statistic U is not already a function of T alone (with probability 1), then it becomes so by conditioning it with respect to T. The variance of the resulting statistic will be smaller than the variance of the statistic we started out with by (iii) of the theorem. It is further clear that the variance does not decrease any further by conditioning again with respect to T, since the resulting statistic will be the same (with probability 1) by (CE2), Chapter 5, page 123. The process of forming the conditional expectation of an unbiased statistic of , given T, is known as RaoBlackwellization.
11.1
11.3 UnbiasednessUniqueness Sufciency: Denition and Some Basic Results
275
The concept of completeness in conjunction with the RaoBlackwell theorem will now be used in the following theorem.
THEOREM 5
(Uniqueness theorem: LehmannScheff) Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), , and let F = {f(; ); }. Let T = (T1, . . . , Tm), Tj = Tj(X1, . . . , Xn), j = 1, . . . , m, be a sufcient statistic for and let g(; ) be its p.d.f. Set C = {g(; ); } and assume that C is complete. Let U = U(T) be an unbiased statistic for and suppose that EU2 < for all . Then U is the unique unbiased statistic for with the smallest variance in the class of all unbiased statistics for in the sense that, if V = V(T) is another unbiased statistic for , then U(t) = V(t) (except perhaps on a set N of ts such that P(T N) = 0 for all ). By the RaoBlackwell theorem, it sufces to restrict ourselves in the class of unbiased statistics of which are functions of T alone. By the unbiasedness of U and V, we have then EU(T) = EV(T) = , ; equivalently,
PROOF
E U T V T = 0, ,
where (T) = U(T) V(T). Then by completeness of C, we have (t) = 0 for all t Rm except possibly on a set N of ts such that P(T N) = 0 for all .
DEFINITION 4
[ ( ) ( )]
or
E T = 0, ,
( )
An unbiased statistic for which is of minimum variance in the class of all unbiased statistics of is called a uniformly minimum variance (UMV) unbiased statistic of (the term uniformly referring to the fact that the variance is minimum for all ). Some illustrative examples follow. Let X1, . . . , Xn be i.i.d. r.v.s from B(1, ), (0, 1). Then T = n j = 1 Xj is a sufcient statistic for , by Example 5, and also complete, by Example 9. Now X = (1/n)T is an unbiased statistic for and hence, by Theorem 5, UMV unbiased for . Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2). Then if is known and = , we have that T = n j = 1 Xj is a sufcient statistic for , by Example 8. It is also complete, by Example 12. Then, by Theorem 5, X = (1/n)T is UMV unbiased for , since it is unbiased for . Let be known and without loss of generality 2 set = 0 and 2 = . Then T = n j = 1 X j is a sufcient statistic for , by Example 8. Since T is also complete (by Theorem 8 below) and S2 = (1/n)T is unbiased for , it follows, by Theorem 5, that it is UMV unbiased for . Here is another example which serves as an application to both Rao Blackwell and LehmannScheff theorems.
EXAMPLE 13
EXAMPLE 14
EXAMPLE 15
Let X1, X2, X3 be i.i.d. r.v.s from the Negative Exponential p.d.f. with parameter . Setting = 1/, the p.d.f. of the Xs becomes f(x; ) = 1/ex/, x > 0. We 2 (Xj) = 2, j = 1, 2, 3. Thus X1, for example, is an have then that E(Xj) = and unbiased statistic for with variance 2. It is further easily seen (by Theorem
276
11
8 below) that T = X1 + X2 + X3 is a sufcient statistic for and it can be shown that it is also complete. Since X1 is not a function of T, one then knows that X1 is not the UMV unbiased statistic for . To actually nd the UMV unbiased statistic for , it sufces to RaoBlackwellize X1. To this end, it is clear that, by symmetry, one has E(X1|T) = E(X2|T) = E(X3|T). Since also their sum is equal to E(T|T) = T, one has that their common value is T/3. Thus E(X1|T) = T/3 which is what we were after. (One, of course, arrives at the same result by using transformations.) Just for the sake of verifying the RaoBlackwell theorem, one sees that
T E = 3 and T 2 2 = < 2 , 0, . 3 3
( )
Exercises
11.3.1 If X1, . . . , Xn is a random sample of size n from P(), then use Exercise 11.1.2(i) and Example 10 to show that X is the (essentially) unique UMV unbiased statistic for . 11.3.2 Refer to Example 15 and, by utilizing the appropriate transformation, show that X is the (essentially) unique UMV unbiased statistic for .
11.4 The Exponential Family of p.d.f.s: One-Dimensional Parameter Case

A large class of p.d.f.s depending on a real-valued parameter is of the following form: Q ( )T ( x ) f x; = C e hx, x , , (1)
()
()
where C() > 0, and also h(x) > 0 for x S, the set of positivity of f(x; ), which is independent of . It follows that
C 1 =
for the discrete case, and
( ) e
x S
S
Q T x
() ( )
hx
()
C 1 = e
()
Q T x
() ( )
h x dx
()
for the continuous case. If X1, . . . , Xn are i.i.d. r.v.s with p.d.f. f(; ) as above, then the joint p.d.f. of the Xs is given by
n f x1 , , xn ; = C n exp Q T x j h x1 h xn , j =1 x j , j = 1, , n, . Some illustrative examples follow.
()
()
( ) ( )
( )
(2)
11.4 The Exponential Family of p.d.f.s: One-Dimensional Parameter Case 11.1 Sufciency: Denition and Some Basic Results
277
EXAMPLE 16
Let
n f x; = x 1 x
n x
IA x ,
()
where A = {0, 1, . . . , n}. This p.d.f. can also be written as follows, f x; = 1
) (
n exp log x I A x , 0 , 1 , 1 x
()
and hence is of the exponential form with
C = 1 , Q = log
EXAMPLE 17
() (
)
()
n , T x = x, h x = I A x . 1 x
()
()
()
Let now the p.d.f. be N(, 2). Then if is known and = , we have f x; =
2 1 2 exp exp 2 x exp x , , 2 2 2 2 2 1
and hence is of the exponential form with C =
()
2 exp , 2 2 2 1
Q =
()
, 2
1 2 T x = x, h x = exp x . 2 2 2 If now is known and = , then we have
()
()
f x; =
2 1 exp x , 0, , 2 2
and hence it is again of the exponential form with C =
()
1 2
, Q =
()
1 , T x = x 2
() (
and h x = 1.
()
If the parameter space of a one-parameter exponential family of p.d.f.s contains a non-degenerate interval, it can be shown that the family is complete. More precisely, the following result can be proved.
THEOREM 6
Let X be an r.v. with p.d.f. f(; ), given by (1) and set C = {g(; ); }, where g(; ) is the p.d.f. of T(X). Then C is complete, provided contains a non-degenerate interval. Then the completeness of the families established in Examples 9 and 10 and the completeness of the families asserted in the rst part of Example 12 and the last part of Example 14 follow from the above theorem. In connection with families of p.d.f.s of the one-parameter exponential form, the following theorem holds true.
278
11
THEOREM 7
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. of the one-parameter exponential form. Then i) T* = n j = 1 T(Xj) is a sufcient statistic for . ii) The p.d.f. of T* is of the form
g t; = C n e
( )
()
Q t
()
h* t ,
()
where the set of positivity of h*(t) is independent of .

PROOF
i) This is immediate from (2) and Theorem 1. ii) First, suppose that the Xs are discrete, and then so is T*. Then we have g(t; ) = P (T* = t) = f(x1, . . . , xn; ), where the summation extends over all (x1, . . . , xn) for which n j = 1T(xj) = t. Thus
n n g t ; = C n exp Q T x j h x j j =1 j =1 n Q ( ) t Q ( ) t = Cn e h xj = C n e h* t , j =1
( )
()
()
( )
( )
()
( )
()
()
where n h * t = h x j . j = 1
()
( )
Next, let the Xs be of the continuous type. Then the proof is carried out under certain regularity conditions to be spelled out. We set Y1 = n j = 1 T(Xj) and let Yj = Xj, j = 2, . . . , n. Then consider the transformation
n n y1 = T x j T x1 = y1 T y j j =1 j =2 hence y = x , j = 2, x = y , j = 2, . . . , n, j j , n; j j
( )
( )
( )
and thus
n 1 x1 = T y1 T y j j =2 x = y , j = 2, , n, j j
( )
where we assume that y = T(x) is one-to-one and hence the inverse T 1 exists. Next,
11.4 The Exponential Family of p.d.f.s: One-Dimensional Parameter Case 11.1 Sufciency: Denition and Some Basic Results
279
x1 1 = , y1 T T 1 z
[ ( )]
where
z = y1 T y j ,
j =2
( )
provided we assume that the derivative T of T exists and T [T 1(z)] 0. Since for j = 2, . . . , n, we have
T yj x1 1 z = , = y j T T 1 z y j T T 1 z
[ ( )]
1
1
( ) [ ( )]
and
x j =1 y j
for j = 2, . . . , n and xj/yi = 0 for 1 < i, j, i j, we have that J= T T
[ (z)]
)
T T
{ [ y T ( y ) T ( y )]}
1 1 2 n
Therefore, the joint p.d.f. of Y1, . . . , Yn is given by g y1 , , yn ; = C n exp Q y1 T y2 T yn

2 n
( ) { ( )[ ( ) + T ( y ) + + T ( y )]}
( )
j
h T 1 y1 T y2 T yn = Cn e
n
{ [
( )
()
Q y1
()
h T 1 y1 T y2 T yn
{ [
( )]} h( y ) J
n j =2
( )
( )]}
h yj J .
j =2
( )
So if we integrate with respect to y2, . . . yn, set
h * y1 = h T 1 y1 T y2 T yn

( )
{ [
( )
( )]}
h y j J dy2 dyn ,
j =2
( )
and replace y1, by t, we arrive at the desired result. The above proof goes through if y = T(x) is one-to-one on each set of a nite partition of .
REMARK 5
We next set C = {g(; }, where g(; ) is the p.d.f. of the sufcient statistic T*. Then the following result concerning the completeness of C follows from Theorem 6.
THEOREM 8
The family C = {g(; } is complete, provided contains a non-degenerate interval. Now as a consequence of Theorems 2, 3, 7 and 8, we obtain the following result.
280
11
THEOREM 9
Let the r.v. X1, . . . , Xn be i.i.d. from a p.d.f. of the one-parameter exponential form and let T* be dened by (i) in Theorem 7. Then, if V is any other statistic, it follows that V and T* are independent if and only if the distribution of V does not depend on .
PROOF In the rst place, T* is sufcient for , by Theorem 7(i), and the set of positivity of its p.d.f. is independent of , by Theorem 7(ii). Thus the assumptions of Theorem 2 are satised and therefore, if V is any statistic which is independent of T*, it follows that the distribution of V is independent of . For the converse, we have that the family C of the p.d.f.s of T* is complete, by Theorem 8. Thus, if the distribution of a statistic V does not depend on , it follows, by Theorem 3, that V and T* are independent. The proof is completed.
APPLICATION
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2). Then X= are independent.
PROOF
1 n Xj n j =1
and
S2 =
1 n Xj X n j =1
We treat as the unknown parameter and let 2 be arbitrary (>0) but xed. Then the p.d.f. of the Xs is of the one-parameter exponential form and T = X is both sufcient for and complete. Let V = V X1 , , X n = X j X .
2 j =1
Then V and T will be independent, by Theorem 9, if and only if the distribution of V does not depend on . Now Xj being N(, 2) implies that Yj = Xj is N(0, 2). Since Y = X , we have
(X
j =1
) = (Y Y ) .
2 2 j j =1
2 n But the distribution of n j = 1 (Yj Y ) does not depend on , because P[ j = 1 (Yj 2 Y ) B] is equal to the integral of the joint p.d.f. of the Ys over B and this p.d.f. does not depend on .
Exercises
11.4.1 In each one of the following cases, show that the distribution of the r.v. X is of the one-parameter exponential form and identify the various quantities appearing in a one-parameter exponential family. i) X is distributed as Poisson; ii) X is distributed as Negative Binomial; iii) X is distributed as Gamma with known;
11.1
11.5 Some Multiparameter Generalizations Sufciency: Denition and Some Basic Results
281
iii) X is distributed as Gamma with known; iv) X is distributed as Beta with known; iv) X is distributed as Beta with known. 11.4.2 Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ) given by f x; = x 1 x exp I (0 , ) x , > 0 , > 0
()
(known).
i) Show that f(; ) is indeed a p.d.f.; ii) Show that n j = 1 X j is a sufcient statistic for ; iii) Is f(; ) a member of a one-parameter exponential family of p.d.f.s? 11.4.3 Use Theorems 6 and 7 to discuss: ii) The completeness established or asserted in Examples 9, 10, 12 (for = and known), 15; ii) Completeness in the Beta and Gamma distributions when one of the parameters is unknown and the other is known.
11.5 Some Multiparameter Generalizations

Let X1, . . . , Xk be i.i.d. r.v.s and set X = (X1, . . . , Xk). We say that the joint p.d.f. of the Xs, or that the p.d.f. of X, belongs to the r-parameter exponential family if it is of the following form: r f x; = C exp Q j Tj x h x , j =1
( )
()
() () ()
where x = (x1, . . . , xk), xj , j = 1, . . . , k, k 1, = (1, . . . , r) Rr, C() > 0, and h(x) > 0 for x S, the set of positivity of f(; ), which is independent of . The following are examples of multiparameter exponential families.
EXAMPLE 18
Let X = (X1, . . . , Xr) have the multinomial p.d.f. Then
f x1 , , xr ; 1 , , r 1 = 1 1 r 1
) (
r j n! exp x j log x ! x ! I A x1 , , xr , 1 j =1 1 r 1 1 r
where A = {(x1, , xr) r; xj 0, j = 1, . . . , r and r j = 1 xj = n}. Thus this p.d.f. is of exponential form with
282
11
C = 1 1 r 1 ,
Q j = log and
() (
()
j , Tj x1 , , xr = x j , j = 1, , r 1, 1 1 r 1
h x1 , , xr =
EXAMPLE 19
n! I A x1 , , xr . x1! xr !
Let X be N(1, 2). Then, f x; 1 , 2 =
2 1 2 exp 1 exp 1 x x , 2 2 2 2 2 2 2 1
and hence this p.d.f. is of exponential form with

C =
()
2 1 exp 1 , Q1 = 1 , Q2 = , T1 x = x, 2 2 2 2 2 2 2 1
()
()
T2 x = x 2
()
and h x = 1.
()
For multiparameter exponential families, appropriate versions of Theorems 6, 7 and 8 are also true. This point will not be pursued here, however. Finally, if X1, . . . , Xn are i.i.d. r.v.s with p.d.f. f(; ), = (1, . . . , r) r, not necessarily of an exponential form, the r-dimensional statistic U = (U1, . . . , Ur), Uj = Uj(X1, . . . , Xn), j = 1, . . . , r, is said to be unbiased if EUj = j, j = 1, . . . , r for all . Again, multiparameter versions of Theorems 49 may be formulated but this matter will not be dealt with here.
Exercises
11.5.1 In each one of the following cases, show that the distribution of the r.v. X and the random vector X is of the multiparameter exponential form and identify the various quantities appearing in a multiparameter exponential family. i) X is distributed as Gamma; ii) X is distributed as Beta; iii) X = (X1, X2) is distributed as Bivariate Normal with parameters as described in Example 4. 11.5.2 If the r.v. X is distributed as U(, ), show that the p.d.f. of X is not of an exponential form regardless of whether one or both of , are unknown. 11.5.3 Use the not explicitly stated multiparameter versions of Theorems 6 and 7 to discuss:
11.1
283
ii) The completeness asserted in Example 15 when both parameters are unknown; ii) Completeness in the Beta and Gamma distributions when both parameters are unknown. 11.5.4 (A bio-assay problem) Suppose that the probability of death p(x) is related to the dose x of a certain drug in the following manner
px =
()
1+e
1 , ( + x )
where > 0, are unknown parameters. In an experiment, k different doses of the drug are considered, each dose is applied to a number of animals and the number of deaths among them is recorded. The resulting data can be presented in a table as follows.
Dose Number of animals used (n) Number of deaths (Y )
x1
x2
...
xk
n1
n2
...
nk
Y1
Y2
...
Yk
x1, x2, . . . , xk and n1, n2, . . . , nk are known constants, Y1, Y2, . . . , Yk are independent r.v.s; Yj is distributed as B(nj, p(xj)). Then show that: ii) The joint distribution of Y1, Y2, . . . , Yk constitutes an exponential family; ii) The statistic k k Y , x Y j j j j =1 j =1 is sufcient for = (, ). (REMARK In connection with the probability p(x) given above, see also Exercise 4.1.8 in Chapter 4.)
284
12
Point Estimation
Chapter 12
Point Estimation
12.1 Introduction
Let X be an r.v. with p.d.f. f(; ), where r. If is known, we can calculate, in principle, all probabilities we might be interested in. In practice, however, is generally unknown. Then the problem of estimating arises; or more generally, we might be interested in estimating some function of , g( ), say, where g is (measurable and) usually a real-valued function. We now proceed to dene what we mean by an estimator and an estimate of g( ). Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ). Then
DEFINITION 1
Any statistic U = U(X1, . . . , Xn) which is used for estimating the unknown quantity g( ) is called an estimator of g( ). The value U(x1, . . . , xn) of U for the observed values of the Xs is called an estimate of g( ). For simplicity and by slightly abusing the notation, the terms estimator and estimate are often used interchangeably.
Exercise
12.1.1 Let X1, . . . , Xn be i.i.d. r.v.s having the Cauchy distribution with = 1 and unknown. Suppose you were to estimate ; which one of the estimators would you choose? Justify your answer. X1 , X as a criterion of selection.) (Hint: Use the distributions of X1 and X
284
12.2
Criteria for Selecting an Unbiasedness, Minimum Statistics Variance 12.3 The Case ofEstimator: Availability of Complete Sufcient
285
12.2 Criteria for Selecting an Estimator: Unbiasedness, Minimum Variance

From Denition 1, it is obvious that in order to obtain a meaningful estimator of g( ), one would have to choose that estimator from a specied class of estimators having some optimal properties. Thus the question arises as to how a class of estimators is to be selected. In this chapter, we will devote ourselves to discussing those criteria which are often used in selecting a class of estimators.
DEFINITION 2
Let g be as above and suppose that it is real-valued. Then the estimator U = U(X1, . . . , Xn) is called an unbiased estimator of g( ) if E U(X1, . . . , Xn) = g( ) for all . Let g be as above and suppose it is real-valued. g( ) is said to be estimable if it has an unbiased estimator. According to Denition 2, one could restrict oneself to the class of unbiased estimators. The interest in the members of this class stems from the interpretation of the expectation as an average value. Thus if U = U(X1, . . . , Xn) is an unbiased estimator of g( ), then, no matter what is, the average value (expectation under ) of U is equal to g( ). Although the criterion of unbiasedness does specify a class of estimators with a certain property, this class is, as a rule, too large. This suggests that a second desirable criterion (that of variance) would have to be superimposed on that of unbiasedness. According to this criterion, among two estimators of g( ) which are both unbiased, one would choose the one with smaller variance. (See Fig. 12.1.) The reason for doing so rests on the interpretation of variance as a measure of concentration about the mean. Thus, if U = U(X1, . . . , Xn) is an unbiased estimator of g( ), then by Tchebichevs inequality,
DEFINITION 3
P U g 1
()
2 U . 2
2 Therefore the smaller U is, the larger the lower bound of the probability of concentration of U about g( ) becomes. A similar interpretation can be given by means of the CLT when applicable.
h1( u; )
h2( u; )
g( )
g( ) (b)
(a)
Figure 12.1 (a) p.d.f. of U1 (for a fixed ). (b) p.d.f. of U2 (for a fixed ).
286
12
Point Estimation
Following this line of reasoning, one would restrict oneself rst to the class of all unbiased estimators of g( ) and next to the subclass of unbiased estimators which have nite variance under all . Then, within this restricted class, one would search for an estimator with the smallest variance. Formalizing this, we have the following denition.
DEFINITION 4
Let g be estimable. An estimator U = U(X1, . . . , Xn) is said to be a uniformly minimum variance unbiased (UMVU) estimator of g( ) if it is unbiased and has the smallest variance within the class of all unbiased estimators of g( ) under all . That is, if U1 = U1(X1, . . . , Xn) is any other unbiased estimator 2 2 U1 U for all . of g( ), then In many cases of interest a UMVU estimator does exist. Once one decides to restrict oneself to the class of all unbiased estimators with nite variance, the problem arises as to how one would go about searching for a UMVU estimator (if such an estimator exists). There are two approaches which may be used. The rst is appropriate when complete sufcient statistics are available and provides us with a UMVU estimator. Using the second approach, one would rst determine a lower bound for the variances of all estimators in the class under consideration, and then would try to determine an estimator whose variance is equal to this lower bound. In the second method just described, the CramrRao inequality, to be established below, is instrumental. The second approach is appropriate when a complete sufcient statistic is not readily available. (Regarding sufciency see, however, the corollary to Theorem 2.) It is more effective, in that it does provide a lower bound for the variances of all unbiased estimators regardless of the existence or not of a complete sufcient statistic. Lest we give the impression that UMVU estimators are all-important, we refer the reader to Exercises 12.3.11 and 12.3.12, where the UMVU estimators involved behave in a rather ridiculous fashion.
Exercises
12.2.1 Let X be an r.v. distributed as B(n, ). Show that there is no unbiased estimator of g( ) = 1/ based on X. In discussing Exercises 12.2.212.2.4 below, refer to Example 3 in Chapter 10 and Example 7 in Chapter 11. 12.2.2 Let X1, . . . , Xn be independent r.v.s distributed as U(0, ), = (0, ). Find unbiased estimators of the mean and variance of the Xs depending only on a sufcient statistic for . 12.2.3 Let X1, . . . , Xn be i.i.d. r.v.s from U(1, 2), 1 < 2 and nd unbiased estimators for the mean (1 + 2)/2 and the range 2 1 depending only on a sufcient statistic for (1, 2).
12.3
The Case of Availability of Complete Sufcient Statistics
287
12.2.4 Let X1, . . . , Xn be i.i.d. r.v.s from the U(, 2 ), = (0, ) distribution and set
U1 = n+1 X 2 n + 1 (n ) and U 2 = n+1 2 X ( n ) + X (1 ) . 5n + 4
Then show that both U1 and U2 are unbiased estimators of and that U2 is uniformly better than U1 (in the sense of variance). 12.2.5 Let X1, . . . , Xn be i.i.d. r.v.s from the Double Exponential distribu1 |x| tion f(x; ) = 2 e , = . Then show that (X(1) + X(n))/2 is an unbiased estimator of . 12.2.6 Let X1, . . . , Xm and Y1, . . . , Yn be two independent random samples 2 with the same mean and known variances 2 1 and 2, respectively. Then show is an unbiased estimator of . Also + (1 c)Y that for every c [0, 1], U = cX nd the value of c for which the variance of U is minimum. 12.2.7 Let X1, . . . , Xn be i.i.d. r.v.s with mean and variance 2, both is the minimum variance unbiased linear estimaunknown. Then show that X tor of .
12.3 The Case of Availability of Complete Sufcient Statistics

The rst approach described above will now be looked into in some detail. To this end, let T = (T1, . . . , Tm), Tj = Tj(X1, . . . , Xn), j = 1, . . . , m, be a statistic which is sufcient for and let U = U(X1, . . . , Xn) be an unbiased estimator of g(), where g is assumed to be real-valued. Set (T ) = E(U|T). Then by the RaoBlackwell theorem (Theorem 4, Chapter 11) (or more precisely, an obvious modication of it), (T ) is also an unbiased estimator of g() and 2 2 with equality holding only if U is a furthermore () U for all function of T (with P-probability 1). Thus in the presence of a sufcient statistic, the RaoBlackwell theorem tells us that, in searching for a UMVU estimator of g(), it sufces to restrict ourselves to the class of those unbiased estimators which depend on T alone. Next, assume that T is also complete. Then, by the LehmannScheff theorem (Theorem 5, Chapter 11) (or rather, an obvious modication of it), the unbiased estimator (T) is the one with uniformly minimum variance in the class of all unbiased estimators. Notice that the method just described not only secures the existence of a UMVU estimator, provided an unbiased estimator with nite variance exists, but also produces it. Namely, one starts out with any unbiased estimator of g() with nite variance, U say, assuming that such an estimator exists. Then Rao Blackwellize it and obtain (T). This is the required estimator. It is essentially unique in the sense that any other UMVU estimators will differ from (T) only on a set of P -probability zero for all . Thus we have the following result.
288
12
Point Estimation
THEOREM 1
Let g be as in Denition 2 and assume that there exists an unbiased estimator U = U(X1, . . . , Xn) of g() with nite variance. Furthermore, let T = (T1, . . . , Tm), Tj = Tj(X1, . . . , Xn), j = 1, . . . , m be a sufcient statistic for and suppose that it is also complete. Set (T) = E (U|T). Then (T) is a UMVU estimator of g() and is essentially unique. This theorem will be illustrated by a number of concrete examples. Let X1, . . . , Xn be i.i.d. r.v.s from B(1, p) and suppose we wish to nd a UMVU estimator of the variance of the X s. The variance of the X s is equal to pq. Therefore, if we set p = , = (0, 1) and g() = (1 ), the problem is that of nding a UMVU estimator for g(). We know that, if U=
2 1 n Xj X , n 1 j =1
EXAMPLE 1
then E U = g(). Thus U is an unbiased estimator of g(). Furthermore,

n n 1 n = X j2 nX 2 = X j n X j n j =1 j =1 j =1 j =1 because Xj takes on the values 0 and 1 only and hence X 2 j = Xj. By setting T = n X , we have then j=1 j n
Xj X
(X
j =1
=T
T2 T2 1 T , so that U = . n n1 n
But T is a complete, sufcient statistic for by Examples 6 and 9 in Chapter 11. Therefore U is a UMVU estimator of the variance of the Xs according to Theorem 1.
EXAMPLE 2
Let X be an r.v. distributed as B(n, ) and set

2 n g = P X 2 = x 1 x = 0 x
()
n x
= 1
+ n 1
n 1
n + 2 1 2
n 2
On the basis of r independent r.v.s X1, . . . , Xr distributed as X, we would like to nd a UMVU estimator of g( ), if it exists. For example, may represent the probability of an item being defective, when chosen at random from a lot of such items. Then g( ) represents the probability of accepting the entire lot, if the rule for rejection is this: Choose at random n (2) items from the lot and then accept the entire lot if the number of observed defective items is 2. The problem is that of nding a UMVU estimator of g( ), if it exists, if the experiment just described is repeated independently r times. Now the r.v.s Xj, j = 1, . . . , r are independent B(n, ), so that T = jr= 1 Xj is B(nr, ). T is a complete, sufcient statistic for . Set
12.3
289
1 if U= 0 if
X1 2 X 1 > 2.
Then E U = g( ) but it is not a function of T. Then one obtains the required estimator by RaoBlackwellization of U. To this end, we have
E U T = t = P U = 1T = t
( = P (X
=
) )
2T = t =
P X 1 2, X 1 + + X r = t P T = t
( +P ( X
1 P X 1 = 0, X 2 + + X r = t P T = t
)[ )[
+ P X 1 = 1, X 2 + + X r = t 1
1
= 2, X 2 + + X r
) = t 2)]
( +P ( X
1 P X 1 = 0 P X 2 + + X r = t P T = t
) (
+ P X 1 = 1 P X 2 + + X r = t 1
1
) ( = 2)P ( X
nr = t 1 t
nr t
+ n 1
n 1
n r 1 t 1 n ( r 1)t +1 1 t 1
) + + X = t 2)] n(r 1) ( (1 ) (1 )
r n t
n r 1 t
n + 2 1 2
n 2
n r 1 t 2 n ( r 1)t + 2 1 t2
nr = t 1 t
nr t
t 1
nr t
n r 1 n n r 1 + n + . t 1 2 t 2
n r 1 t
Therefore
1 n r 1 n n r 1 nr n r 1 T = + n + T T T 1 2 T 2
( )
290
12
Point Estimation
is a UMVU estimator of g() by Theorem 1.

EXAMPLE 3
Consider certain events which occur according to the distribution P(). Then the probability that no event occurs is equal to e. Let now X1, . . . , Xn (n 2) be i.i.d. r.v.s from P(). Then the problem is that of nding a UMVU estimator of e. Set T = X j , = , g = e
j =1 n
()
and dene U by
1 if U= 0 if
Then
X1 = 0 X 1 1.
E U = P U = 1 = P X1 = 0 = g ;
that is, U is an unbiased estimator of g( ). However, it does not depend on T which is a complete, sufcient statistic for , according to Exercise 11.1.2(i) and Example 10 in Chapter 11. It remains then for us to RaoBlackwellize U. For this purpose we use the fact that the conditional distribution of X1, given T = t, is B(t, 1/n). (See Exercise 12.3.1.) Then
1 E U T = t = P X1 = 0 T = t = 1 , n
) ()
so that
1 T = 1 n
( )
is a UMVU estimator of e.
EXAMPLE 4
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2) with 2 unknown and known. We are interested in nding a UMVU estimator of . Set 2 = and let g() = . By Corollary 5, Chapter 7, we have that 2 2 1/ n j=1(Xj ) is n. So, if we set S2 =
2 1 n Xj , n j =1
then nS2/ is 2 is distributed as n. Then the expectation n, so that nS/ E(nS/ ) can be calculated and is independent of ; call it c n (see Exercise 12.3.2). That is,
nS nS E , so that E = cn = , cn
Setting nally cn = cn /n, we obtain
12.3
291
S E = ; cn
that is, S/cn is an unbiased estimator of g( ). Since this estimator depends on the complete, sufcient statistic (see Example 8 and Exercise 11.5.3(ii), Chapter 11) S2 alone, it follows that S/cn is a UMVU estimator of .
EXAMPLE 5
Let again X1, . . . , Xn be i.i.d. r.v.s from N(, 2) with both and 2 unknown. We are interested in nding UMVU estimators for each one of and 2. Here = (, 2) and let g1() = , g2() = 2. By setting S2 =
2 1 n Xj X , n j =1
, S2) is a sufcient statistic for . (See Example 8, Chapter 11.) we have that (X and U2 Furthermore, it is complete. (See Example 12, Chapter 11.) Let U1 = X 2 = nS /(n 1). Clearly, E U1 = . By Remark 5 in Chapter 7, nS 2 E 2 = n 1. Therefore nS 2 2 E = . n 1 So U1 and U2 are unbiased estimators of and 2, respectively. Since they , S 2), it follows that they depend only on the complete, sufcient statistic (X are UMVU estimators.
EXAMPLE 6
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2) with both and 2 unknown, and set p for the upper pth quantile of the distribution (0 < p < 1). The problem is that of nding a UMVU estimator of p. Set = (, 2 ). From the denition of p, one has P (X1 p) = p. But X p p P X 1 p = P 1 = 1 ,
so that p = 1 p. Hence
p = 1 1 p and p = + 1 1 p . Of course, since p is given, 1(1 p) is a uniquely determined number. Then by setting g() = + 1(1 p), our problem is that of nding a UMVU estimator of g(). Let
292
12
Point Estimation
U=X+
S 1 1 p , cn
= and E (S/cn) where cn is dened in Example 4. Then by the fact that E X = (see Example 4), we have that E U = g(). Since U depends only on the , S2), it follows that U is a UMVU estimator complete, sufcient statistic (X of p.
Exercises
12.3.1 Let X1, . . . , Xn be i.i.d. r.v.s from P() and set T = n j = 1 Xj. Then show that the conditional p.d.f. of X1, given T = t, is that of B(t, 1/n). Furthermore, observe that the same is true if X1 is replaced by any one of the remaining Xs. 12.3.2 Refer to Example 4 and evaluate the quantity cn mentioned there. 12.3.3 If X1, . . . , Xn are i.i.d. r.v.s from B(1, ), = (0, 1), by using is the UMVU estimator of . Theorem 1, show that X 12.3.4 If X1, . . . , Xn are i.i.d. r.v.s from P( ), = (0, ), use Theorem 1 in order to determine the UMVU estimator of . 12.3.5 Let X1, . . . , Xn be i.i.d. r.v.s from the Negative Exponential distribution with parameter = (0, ). Use Theorem 1 in order to determine the UMVU estimator of . 12.3.6 Let X be an r.v. having the Negative Binomial distribution with parameter = (0, 1). Find the UMVU estimator of g( ) = 1/ and determine its variance. 12.3.7 Let X1, . . . , Xn be independent r.v.s distributed as N(, 1). Show that 2 (1/n) is the UMVU estimator of g( ) = 2. X 12.3.8 Let X1, . . . , Xn be independent r.v.s distributed as N(, 2 ), where both and 2 are unknown. Find the UMVU estimator of /. 12.3.9 Let (Xj, Yj), j = 1, . . . , n be independent random vectors having the Bivariate Normal distribution with parameter = (1, 2, 1, 2, ). Find the UMVU estimators of the following quantities: 12, 12, 2/1. 12.3.10 Let X be an r.v. denoting the life span of a piece of equipment. Then the reliability of the equipment at time x, R(x), is dened as the probability that X > x. If X has the Negative Exponential distribution with parameter = (0, ), nd the UMVU estimator of the reliability R(x; ) on the basis of n observations on X. 12.3.11 Let X be an r.v. having the Geometric distribution; that is,
f x; = 1 , x = 0, 1, . . . , = 0, 1 ,
) (
( )
12.4 The Case Where Complete Sufcient Are Available or May Statistics Not Exist 12.3 The Case ofStatistics Availability ofNot Complete Sufcient
293
and let U(X) be dened as follows: U(X ) = 1 if X = 0 and U(X ) = 0 if X 0. By using Theorem 1, show that U(X) is a UMVU estimator of and conclude that it is an unreasonable one. 12.3.12 Let X be an r.v. denoting the number of telephone calls which arrive at a given telephone exchange, and suppose that X is distributed as P( ), where = (0, ) is the number of calls arriving at the telephone exchange under consideration within a 15 minute period. Then the number of calls which arrive at the given telephone exchange within 30 minutes is an r.v. Y distributed as P(2), as can be shown. Thus P (Y = 0) = e2 = g( ). Dene U(X ) by U(X) = (1)X. Then show that U(X) is the UMVU estimator of g( ) and conclude that it is an entirely unreasonable estimator. (Hint: Use Theorem 1.) 12.3.13 Use Example 11, Chapter 11, in order to show that the unbiased estimator constructed in Exercise 12.2.2 is actually UMVU. 12.3.14 Use Exercise 11.1.4, Chapter 11, in order to conclude that the unbiased estimator constructed in Exercise 12.2.5 is not UMVU.
12.4 The Case Where Complete Sufcient Statistics Are Not Available or May Not Exist: CramrRao Inequality
When complete, sufcient statistics are available, the problem of nding a UMVU estimator is settled as in Section 3. When such statistics do not exist, or it is not easy to identify them, one may use the approach described here in searching for a UMVU estimator. According to this method, we rst establish a lower bound for the variances of all unbiased estimators and then we attempt to identify an unbiased estimator with variance equal to the lower bound found. If that is possible, the problem is solved again. At any rate, we do have a lower bound of the variances of a class of estimators, which may be useful for comparison purposes. The following regularity conditions will be employed in proving the main result in this section. We assume that and that g is real-valued and differentiable for all .
12.4.1 Regularity Conditions

Let X be an r.v. with p.d.f. f(; ), . Then it is assumed that iii) f(x; ) is positive on a set S independent of . iii) is an open interval in ( nite or not). iii) (/ ) f(x; ) exists for all and all x S except possibly on a set N S which is independent of and such that P (X N ) = 0 for all . iv)
S f ( x1 ; ) f ( xn ; )dx1 dxn
294
12
Point Estimation
or
f ( x1 ; ) f ( xn ; )
S
may be differentiated under the integral or summation sign, respectively. iv) E [(/ )log f (X; )]2, to be denoted by I( ), is >0 for all . vi) or
S U ( x1 , . . . , xn )f ( x1 ; ) f ( xn ; ) dx1 dxn U ( x1 , . . . , xn ) f ( x1 ; ) f ( xn ; )
S S
THEOREM 2
may be differentiated under the integral or summation si gn, respectively, where U(X1, . . . , Xn) is any unbiased estimator of g( ). Then we have the following theorem. (CramrRao inequality.) Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ) and assume that the regularity conditions (i)(vi) are fullled. Then for any unbiased estimator U = U(X1, . . . , Xn) of g( ), one has
[g ( )] U
nI
()
, , where g =
()
dg d
()
PROOF If 2 U = or I( ) = for some , the inequality is trivially true for those s. Hence we need only consider the case where 2 U < and I( ) < for all . Also it sufces to discuss the continuous case only, since the discrete case is treated entirely similarly with integrals replaced by summation signs. We have
E U X 1 , . . . , X n
S S
= U x1 , . . . , xn f x1 ; f xn ; dx1 dxn = g .
Now restricting ourselves to S, we have
)(
()
(1)
f x1 ; f xn ; f x1 ; f x j ; + f = j 1 f x j ; + + f xn ; j 2
[(
)]
( x ; )
2
) f ( x ; )
j n
n = f xj ; j =1 n 1 = f xj ; j =1 n = log f j =1
) f ( x ; )
i ij
) (
n f x j ; f xi ; i =1 n x j ; f xi ; . i =1
)
(2)
295
Differentiating with respect to both sides of (1) on account of (vi) and utilizing (2), we obtain
g =
()
n n U x , . . . , x log f x ; f xi ; dx1 dxn n j S 1 S j = 1 i =1 n (3) = E U X 1 , . . . , X n log f X j ; = E UV , = 1 j
where we set V = V X 1 , . . . , X n = Next,
log f X j ; . j = 1
n
f x1 ; f xn ; dx1 dxn = 1.
S
Therefore differentiating both sides with respect to by virtue of (iv), and employing (2), n n 0 = log f x j ; f xi ; dx1 dxn = E V . S S i =1 j = 1 From (3) and (4), it follows that
(4)
Co U , V = E UV EU E V = E UV = g .
) (
)(
()
(5)
From (4) and the denition of V, it further follows that
n n 0 = E V = E log f X j ; = E log f X j ; j =1 j =1 = nE log f X 1 ; ,
so that
E log f X 1 ; = 0.
Therefore
n n 2V = 2 log f X j ; = 2 log f X j ; j = 1 j = 1 2 = n log f X 1 ;
= nE log f X 1 ; = nE log f X ; .
(6)
296
12
Point Estimation
But
U , V =
2
( ) ( U )( V )
Co U , V

and (U, V) 1, which is equivalent to

2 2 C o U , V U V . 2
) (
)(
(7)
Taking now into consideration (5) and (6), relation (7) becomes
[g ( )] ( )
2 2
U nE log f X ; ,
or by means of (v),
2U
nE log f X ;
[(
[g ( )]
)
)]
[g ( )] =
nI
()
(8)
The proof of the theorem is completed.

DEFINITION 5
The expression E[(/ )log f(X; )]2, denoted by I( ), is called Fishers information (about ) number; nE[(/ )log f(X; )]2 is the information (about ) contained in the sample X1, . . . , Xn. (For an alternative way of calculating I( ), see Exercises 12.4.6 and 12.4.7.) Returning to the proof of Theorem 2, we have that equality holds in (8) if 2 2 2 and only if C o(U, V) = ( U)( V) because of (7). By Schwarz inequality (Theorem 2, Chapter 5), this is equivalent to
V = E V + k U EU with P probability 1,
where
k =
( )(
(9)
()
V . U
Furthermore, because of (i), the exceptional set for which (9) does not hold is independent of and has P-probability 0 for all . Taking into consideration (4), the fact that EU = g() and the denition of V, equation (9) becomes as follows:
n log f X j ; = k U X 1 , . . . , X n g k j =1
) () (
) ()()
(10)
outside a set N in n such that P[(X1, . . . , Xn) N] = 0 for all . Integrating (10) (with respect to ) and assuming that the indenite integrals k( )d and g( )k( )d exist, we obtain log f X j ; = U X 1 , . . . , X n
j =1 n
( X , . . . , X ), ) k( )d g( )k( )d + h
1 n
297
(X , . . . , X ) is the constant of the integration, or where h 1 n log f x j ; = U x1 , . . . , xn

j =1 n
( x , . . . , x ). ) k( )d g( )k( )d + h
1 n
(11)
Exponentiating both sides of (11), we obtain
f ( x ; ) = C ( ) exp[Q( )U ( x , . . . , x )]h( x , . . . , x ),
n j 1 n 1 n j =1
(12)
where
C = exp g k d , Q = k d and
x ,..., x . h x1 , . . . , xn = exp h 1 n
()
[ ()() ] ()
)
()
Thus, if equality occurs in the CramrRao inequality for some unbiased estimator, then the joint p.d.f. of the Xs is of the one-parameter exponential form, provided certain conditions are met. More precisely, we have the following result.
COROLLARY
[(
)]
If in Theorem 2 equality occurs for some unbiased estimator U = U (X1, . . . , Xn) of g( ) and if the indenite integrals k( )d, g( )k( )d exist, where
k =
then
()
V , U
f ( x ; ) = C ( ) exp[Q( )U ( x , . . . , x )]h( x , . . . , x )
n j 1 n 1 n j =1
outside a set N in n such that P[(X1, . . . , Xn) N] = 0 for all ; here C() = exp[g( )k( )d] and Q( ) = k( )d. That is, the joint p.d.f. of the Xs is of the one-parameter exponential family (and hence U is sufcient for ).
REMARK 1 Theorem 2 has a certain generalization for the multiparameter case, but this will not be discussed here.
In connection with the CramrRao bound, we also have the following important result.
THEOREM 3
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ) and let g be an estimable realvalued function of . For an unbiased estimator U = U(X1, , Xn) of g( ), we 2 assume that regularity conditions (i)(vi) are satised. Then U is equal to the CramrRao bound if and only if there exists a real-valued function of , d( ), such that U = g( ) + d( )V except perhaps on a set of P-probability zero for all .
PROOF Under the regularity conditions (i)(vi), we have that
298
12
Point Estimation
[g ( )] U
2
nI
()
2
, or
[g ( )] U
2
2 V
2 2 since nI( ) = V by (6). Then U is equal to the CramrRao bound if and only if
[g ( )] = ( U )( V ).
2 2
But
2 2 2 Thus U is equal to the CramrRao bound if and only if C (U, V) = ( U) 2 ( V), or equivalently, if and only if U = a( ) + d( )V with P-probability 1 for some functions of , a( ) and d( ). Furthermore, because of (i), the exceptional set for which this relationship does not hold is independent of and has P-probability 0 for all . Taking expectations and utilizing the unbiasedness of U and relation (4), we get that U = g( ) + d( )V except perhaps on a set of P-probability 0 for all . The proof of the theorem is completed.
[g ( )]
= C o U , V
by
(5).
The following three examples serve to illustrate Theorem 2. The checking of the regularity conditions is left as an exercise.
EXAMPLE 7
Let X1, . . . , Xn be i.i.d. r.v.s from B(1, p), p (0, 1). By setting p = , we have
f x; = x 1
)
(
1 x
, x = 0, 1
so that Then
log f x; = x log + 1 x log 1 .
) (
x 1 x log f x; = 1
and 1 2 1 log f x; = 2 x + 1
(1 x)
2 x 1 x . 1
Since
E X 2 = , E 1 X (see Chapter 5), we have
= 1
and E X 1 X = 0
2
[ (
)
)]
1 E log f X ; = , 1 so that the CramrRao bound is equal to (1 )/n.
299
2 is an unbiased extimator of and its variance is Now X (X ) = (1 )/n, that is, equal to the CramrRao bound. Therefore X is a UMVU estimator of .
EXAMPLE 8
Let X1, . . . , Xn be i.i.d. r.v.s from P(), > 0. Again by setting = , we have f x; = e Then
x , x = 0, 1, . . . so that log f x; = + x log log x!. x!
x log f x; = 1 +
and
1 2 2 log f x; = 1 + 2 x x. 2 Since E X = and E X = (1 + ) (see Chapter 5), we obtain
1 E log f X ; = , is an unbiased so that the CramrRao bound is equal to /n. Since again X is a UMVU estimator of . estimator of with variance /n, we have that X
EXAMPLE 9
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2). Assume rst that 2 is known and set = . Then
f x; =
x exp 2 2 2 1
)
(
, x
and hence
1 x log f x; = log 2 2 2
Next,
1 x log f x; = ,
so that
1 x log f x; = 2 .
Then
1 E log f X ; = 2 ,
2
300
12
Point Estimation
since (X )/ is N(0, 1) and hence

X E = = 1.
2
(See Chapter 5.)
is an unbiased estiThus the CramrRao bound is 2/n. Once again, X 2 mate of and its variance is equal to /n, that is, the CramrRao bound. is a UMVU estimator. This was also shown in Example 5. Therefore, X Suppose now that is known and set 2 = . Then
f x; =
x exp 2 2 1
so that
x 1 1 log f x; = log 2 log 2 2 2
( )
and x 1 log f x; = + 2 2 2
Then 1 1 x 1 x + 2 log f x; = 2 2 4 2 4 and since (X )/ is N(0, 1), we obtain
X X E = 1, E = 3. Therefore
2
(See Chapter 5.)
1 E log f X ; = 2 2 2 and the CramrRao bound is 2 /n. Next,
Xj 2 is n j =1
n
(see rst corollary to Theorem 5, Chapter 7), so that
n X 2 n X 2 j j 2 E = n and = 2n j =1 j =1
12.3
The Case of Availability of Complete Sufcient Exercises Statistics
301
2 (see Remark 5 in Chapter 7). Therefore (1/n)n j=1(Xj ) is an unbiased 2 estimator of and its variance is 2 /n, equal to the CramrRao bound. Thus 2 (1/n)n j=1(Xj ) is a UMVU estimator of . Finally, we assume that both and 2 are unknown and set = 1, 2 = 2. Suppose that we are interested in nding a UMVU estimator of 2. By using the generalization we spoke of in Remark 1, it can be seen that the Cramr Rao bound is again equal to 2 2 2/n. As a matter of fact, we arrive at the same conclusion by treating 1 as a constant and 2 as the (unknown) parameter and calculating the CramrRao bound, provided by Theorem 2. Now it has been seen in Example 5 that
1 n Xj X n 1 j =1
is a UMVU estimator of 2. Since

X X j j =1 2
n 2 2 is n 1
(see second corollary to Theorem 5, Chapter 7), it follows that

2 1 n 2 2 2 2 2 2 > 2, Xj X = n n 1 j =1 n1 the CramrRao bound. This then is an example of a case where a UMVU estimator does exist but its variance is larger than the CramrRao bound.
A UMVU estimator of g( ) is also called an efcient estimator of g( ) (in the sense of variance). Thus if U is a UMVU estimator of g( ) and U* is any 2 2 other unbiased estimator of g( ), then the quantity U/( U*) may serve as a measure of expressing the efciency of U* relative to that of U. It is known as relative efciency (r.eff.) of U* and, clearly, takes values in (0, 1].
REMARK 2 Corollary D in Chapter 6 indicates the sort of conditions which would guarantee the fulllment of the regularity conditions (iv) and (vi).
Exercises
12.4.1 Let X1, . . . , Xn be i.i.d. r.v.s from the Gamma distribution with known and = (0, ) unknown. Then show that the UMVU estimator of is U X1 , . . . , X n =
1 n
X
j =1
302
12
Point Estimation
and its variance attains the CramrRao bound. 12.4.2 Refer to Exercise 12.3.5 and investigate whether the CramrRao bound is attained. 12.4.3 Refer to Exercise 12.3.6 and investigate whether the CramrRao bound is attained. 12.4.4 Refer to Exercise 12.3.7 and show that the CramrRao bound is not attained for the UMVU estimator of g( ) = 2. 12.4.5 Refer to Exercise 12.3.11 and investigate whether the CramrRao bound is attained. 12.4.6 Assume conditions (i) and (ii) listed just before Theorem 2, and also suppose that the f(x; ) exists for all and all x S except, perhaps, on a set N S with P(X N) = 0 for all . Furthermore, suppose that, respectively,
2 2
S 2 f ( x; )dx = 0
or
2 f ( x; ) = 0.
S
2 Then show that I = E 2 log f X ; . 12.4.7 In Exercises 12.4.112.4.4, recalculate I( ) and the CramrRao bound by utilizing Exercise 12.4.6 where appropriate.
()
12.4.8 Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), . For an estimator V = V(X1, . . . , Xn) of for which EV is nite, write EV = + b( ). Then b( ) is called the bias of V. Show that, under the regularity conditions (i)(vi) preceding Theorem 2where (vi) is assumed to hold true for all estimators for which the integral (sum) is niteone has
2V
nE log f X ;
[(
[1 + b( )]
)
)]
, .
Here X is an r.v. with p.d.f. f(; ) and b( ) = db( )/d. (This inequality is established along the same lines as those used in proving Theorem 2.)
12.5 Criteria for Selecting an Estimator: The Maximum Likelihood Principle

So far we have concerned ourselves with the problem of nding an estimator on the basis of the criteria of unbiasedness and minimum variance. Another principle which is very often used is that of the maximum likelihood. r and consider the Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ),
12.5
Criteria12.3 for Selecting anof Estimator: The Principle The Case Availability of Maximum Complete Likelihood Sufcient Statistics
303
joint p.d.f. of the Xs f(x1; ) f(xn; ). Treating the xs as if they were constants and looking at this joint p.d.f. as a function of , we denote it by L( |x1, . . . , xn) and call it the likelihood function.
DEFINITION 6
= (x1, . . . , xn) is called a maximum likelihood estimate (MLE) The estimate of if x , . . . , x = max L x , . . . , x ; ; L 1 n 1 n (X1, . . . , Xn) is called an ML estimator (MLE for short) of .
[(
REMARK 3 Since the function y = log x, x > 0 is strictly increasing, in order to maximize (with respect to ) L( |x1, . . . , xn) in the case that , it sufces to maximize log L( |x1, . . . , xn). This is much more convenient to work with, as will become apparent from examples to be discussed below.
In order to give an intuitive interpretation of a MLE, suppose rst that the X s are discrete. Then
L x1 , . . . , xn = P X 1 = x1 , . . . , X n = xn ;
that is, L( |x1, . . . , xn) is the probability of observing the xs which were acutally observed. Then it is intuitively clear that one should select as an estimate of that which maximizes the probability of observing the xs which were actually observed, if such a exists. A similar interpretation holds true for the case that the Xs are continuous by replacing L( |x1, . . . , xn) with the probability element L( |x1, . . . , xn)dx1 dxn which represents the probability (under P ) that Xj lies between xj and xj + dxj, j = 1, . . . , n. In many important cases there is a unique MLE, which we then call the MLE and which is often obtained by differentiation. Although the principle of maximum likelihood does not seem to be justiable by a purely mathematical reasoning, it does provide a method for producing estimates in many cases of practical importance. In addition, an MLE is often shown to have several desirable properties. We will elaborate on this point later. The method of maximum likelihood estimation will now be applied to a number of concrete examples.
EXAMPLE 10
Let X1, . . . , Xn be i.i.d. r.v.s from P( ). Then

L x1 , . . . , xn = e n
j =1 x j !
n
n j=1 xj
and hence n n log L x1 , . . . , xn = log x j ! n + x j log . j =1 j =1
Therefore the likelihood equation
304
12
Point Estimation
1 log L x1 , . . . , xn = 0 becomes n + nx = 0 . Next, which gives = x
2 1 L x1 , . . . , xn = nx 2 < 0 for all > 0 2 . Thus = and hence, in particular, for = x is the MLE of .
EXAMPLE 11
Let X1, . . . , Xr be multinomially distributed r.v.s with parameter = (p1, , pr) , where is the (r 1)-dimensional hyperplane in r dened by = = p1 , . . . , pr r ; p j > 0, j = 1, . . . , r and
p
j =1
= 1.
Then L x1 , . . . , xr = = where n = jr= 1 xj. Then
n!
j =1 x j !
r
x p1 prx
1
n!
j =1 x j !
r
p1x prx1 1 p1 pr 1
1 r1
xr
log L x1 , . . . , xr = log
n!
x! j =1 j
+ x1 log p1 +
+ xr 1 log pr 1 + xr log 1 p1 pr 1 .
Differentiating with respect to pj, j = 1, . . . , r 1 and equating the resulting expressions to zero, we get xj This is equivalent to
xj pj = xr , pr j = 1, . . . , r 1;
1 1 xr = 0, pj pr
j = 1, . . . , r 1.
that is,
x1 x x = = r 1 = r , p1 pr 1 pr
and this common value is equal to
x1 + + xr 1 + xr n = . p1 + + pr 1 + pr 1
12.5
305
Hence xj /pj = n and pj = xj /n, j = 1, . . . , r. It can be seen that these values of the j = xj /n, j = 1, . . . , ps actually maximize the likelihood function, and therefore p r are the MLEs of the ps. (See Exercise 12.5.4.)
EXAMPLE 12
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2) with parameter = (, 2). Then
L x1 , . . . , xn
1 1 = exp 2 2 2 2
(x
j =1
2 ,
so that log L x1 , . . . , xn = n log 2 n log 2
1 2 2
(x
j =1
Differentiating with respect to and 2 and equating the resulting expressions to zero, we obtain
n log L x1 , . . . , xn = 2 x = 0 n 1 n = + log L x , . . . , x xj 1 n 2 2 2 2 4 j =1
= 0.
Then
2 1 n xj x n j =1 are the roots of these equations. It is further shown that and 2 actually maximize the likelihood function (see Exercise 12.5.5) and therefore
= x and 2 =
( (
) )
1 n = x and 2 = xj x n j =1
are the MLEs of and 2, respectively. Now, if we assume that 2 is known and set = , then we have again that = x is the root of the equation
log L x1 , . . . , xn = 0. In this case it is readily seen that

n 2 log L x1 , . . . , xn = 2 < 0 2 and hence = x is the MLE of . On the other hand, if is known and we set 2 = , then the root of
log L x1 , . . . , xn = 0
is equal to
2 1 n xj . n j =1
306
12
Point Estimation
Next,
2 1 n 1 log L x1 , . . . , xn = 4 2 2 2 2 which, for equal to
(x
j =1
2 1 n xj , n j =1
becomes
1 4 n n < 0. n = 2 2 4
So 1 n 2 = xj n j =1
is the MLE of 2 in this case.

EXAMPLE 13
Let X1, . . . , Xn be i.i.d. r.v.s from U(, ). Here = (, ) which is the part of the plane above the main diagonal. Then
L x1 , , xn =
( )
I [ , ) x(1) I ( , ] x( n ) .
( )
( )
Here the likelihood function is not differentiable with respect to and , but it is, clearly, maximized when is minimum, subject to the conditions that = x(n). Thus x(1) and x(n). This happens when = x(1) and = x(1) and = x(n) are the MLEs of and , respectively. In particular, if = c, = + c, where c is a given positive constant, then
L x1 , . . . , xn =
( 2c)
I [ c , ) x(1) I ( , +c ] x( n ) .
( )
( )
The likelihood function is maximized, and its maximum is 1/(2c)n, for any such that c x(1) and + c x(n); equivalently, x(1) + c and x(n) c. This shows that any statistic that lies between X(1) + c and X(n) c is an MLE of . 1 For example, [X(1) + X(n)] is such a statistic and hence an MLE of . 2 If is known and = , or if is known and = , then, clearly, x(1) and x(n) are the MLEs of and , respectively.
REMARK 4
iii) The MLE may be a UMVU estimator. This, for instance, happens in Example 10, for in Example 12, and also for 2 in the same example when is known.
12.5
307
2 iii) The MLE need not be UMVU. This happens, e.g., in Example 12 for when is unknown. iii) The MLE is not always obtainable by differentiation. This is the case in Example 13. iv) There may be more than one MLE. This case occurs in Example 13 when = c, = + c, c > 0 In the following, we present two of the general properties that an MLE enjoys.
THEOREM 4
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), r, and let T = (T1, . . . , Tr), Tj = Tj(X1, . . . , Xn), j = 1, . . . , r be a sufcient statistic for = (1, . . . , r). = ( 1, . . . , r) is the unique MLE , it follows that is a function Then, if of T.
PROOF Since T is sufcient, Theorem 1 in Chapter 11 implies the following factorization:

f x1 ; f xn ; = g T x1 , . . . , xn ; h x1 , . . . , xn ,
where h is independent of . Therefore
) [ (
(
) ](
max f x1 ; f xn ; ;
[(
(
= h x1 , . . . , xn max g T x1 , . . . , xn ; ; .
Thus, if a unique MLE exists, it will have to be a function of T, as it follows from the right-hand side of the equation above.
{[
) ]
REMARK 5 Notice that the conclusion of the theorem holds true in all Examples 1013. See also Exercise 12.3.10.
Another optimal property of an MLE is invariance, as is proved in the following theorem.
THEOREM 5
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(x; ), r, and let be dened is an MLE of . Then on onto * m and let it be one-to-one. Suppose ( ) is an MLE of ( ). That is, an MLE is invariant under one-to-one transformations.
PROOF Set * = ( ), so that = 1( *). Then

call it L*( *|x1, . . . , xn). It follows that
L x1 , . . . , xn = L 1 * x1 , . . . , xn ,
max L x1 , . . . , xn ; = max L * * x1 , . . . , xn ; * * . By assuming the existence of an MLE, we have that the maximum at the . Then, clearly, the right-hand left-hand side above is attained at an MLE *, where * = ( ). Thus ( ) is an MLE of (). side attains its maximum at For instance, since
) [ ( )
[(
[ (
308
12
Point Estimation
1 n xj x n j =1
is the MLE of 2 in the normal case (see Example 12), it follows that
1 n xj x n j =1
is the MLE of .
Exercises
12.5.1 If X1, . . . , Xn are i.i.d. r.v.s from B(m, ), = (0, ), show that /m is the MLE of . X 12.5.2 If X1, . . . , Xn are i.i.d. r.v.s from the Negative Binomial distribution ) is the MLE of . with parameter = (0, 1), show that r/(r + X 12.5.3 If X1, . . . , Xn are i.i.d. r.v.s from the Negative Exponential distribu ) is the MLE of . tion with parameter = (0, ), show that 1/X 12.5.4 Refer to Example 11 and show that the quantities p j = xj/n, j = 1, . . . , r indeed maximize the likelihood function. 12.5.5 Refer to Example 12 and consider the case that both and 2 are unknown. Then show that the quantities = x and 2 = 1 n xj x n j =1
indeed maximize the likelihood function. 12.5.6 Suppose that certain particles are emitted by a radioactive source (whose strength remains the same over a long period of time) according to a Poisson distribution with parameter during a unit of time. The source in question is observed for n time units, and let X be the r.v. denoting the number of times that no particles were emitted. Find the MLE of in terms of X. 12.5.7 Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; 1, 2) given by
f x; 1 , 2 =
x 1 1 exp , x 1 , = 1 , 2 = 0, . 2 2
Find the MLEs of 1, 2. 12.5.8 12.5.9 Refer to Exercise 11.4.2, Chapter 11, and nd the MLE of . Refer to Exercise 12.3.10 and nd the MLE of the reliability (x; ).
1 2
12.5.10 Let X1, . . . , Xn be i.i.d. r.v.s from the U ( distribution, and let
,+
1 2
),
12.6 Criteria for Selecting The Decision-Theoretic 12.3 The Casean of Estimator: Availability of Complete Sufcient Approach Statistics
309
= X , . . . , X = X 1 + cos 2 X X X + 1 . 1 n 1 (n ) (1 ) (n ) 2 is an MLE of but it is not a function only of the sufcient Then show that statistic (X(1), X(n)). (Thus Theorem 4 need not be correct if there exists more than one MLE of the parameters involved. For this, see also the paper Maximum Likelihood and Sufcient Statistics by D. S. Moore in the American Mathematical Monthly, Vol. 78, No. 1, January 1971, pp. 4245.)
)(
12.6 Criteria for Selecting an Estimator: The Decision-Theoretic Approach

We will rst develop the general theory underlying the decision-theoretic method of estimation and then we will illustrate the theory by means of concrete examples. In this section, we will restrict ourselves to a real-valued parameter. So let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), . Our problem is that of estimating .
DEFINITION 7 DEFINITION 8
A decision function (or rule) is a (measurable) function dened on n into . The value (x1, . . . , xn) of at (x1, . . . , xn) is called a decision. For estimating on the basis of X1, . . . , Xn and by using the decision function , a loss function is a nonnegative function in the arguments and (x1, . . . , xn) which expresses the (nancial) loss incurred when is estimated by (x1, . . . , xn). The loss functions which are usually used are of the following form:
L ; x1 , . . . , xn = x1 , . . . , xn ,
or more generally,
[ (
)]
L ; x1 , . . . , xn = x1 , . . . , xn
[ (
)] ( )
, k > 0;
or L[; (x1, . . . , xn)] is taken to be a convex function of . The most convenient form of a loss function is the squared loss function; that is,
L ; x1 , . . . , xn = x1 , . . . , xn
DEFINITION 9
[ (
)] [
)] .
2
The risk function corresponding to the loss function L(; ) is denoted by R (; ) and is dened by R ; = E L ; X 1 , . . . , X n
L ; x , . . . , x f x ; f x ; dx dx 1 n 1 n 1 n = L ; x1 , . . . , xn f x1 ; f xn ; . x x
1 n
[ (
[ (
[ (
)]
)] ( )] (
310
12
Point Estimation
That is, the risk corresponding to a given decision function is simply the average loss incurred if that decision function is used. Two decision functions and * such that
R ; = E L ; X 1 , . . . , X n = E L ; * X 1 , . . . , X n = R ; *
for all are said to be equivalent. In the present context of (point) estimation, the decision = (x1, . . . , xn) will be called an estimate of , and its goodness will be judged on the basis of its risk R(; ). It is, of course, assumed that a certain loss function is chosen and then kept xed throughout. To start with, we rst rule out those estimates which are not admissible (inadmissible), where
DEFINITION 10
[ (
)]
)]
The estimator of is said to be admissible if there is no other estimator * of such that R(; *) R(; ) for all with strict inequality for at least one . Since for any two equivalent estimators and * we have R( ; ) = R(; *) for all , it sufces to restrict ourselves to an essentially complete class of estimators, where
DEFINITION 11
A class D of estimators of is said to be essentially complete if for any estimator * of not in D one can nd an estimator in D such that R(; *) = R(; ) for all . Thus, searching for an estimator with some optimal properties, we conne our attention to an essentially complete class of admissible estimators. Once this has been done the question arises as to which member of this class is to be chosen as an estimator of . An apparently obvious answer to this question would be to choose an estimator such that R(; ) R(; *) for any other estimator * within the class and for all . Unfortunately, such estimators do not exist except in trivial cases. However, if we restrict ourselves only to the class of unbiased estimators with nite variance and take the loss function to be the squared loss function (see paragraph following Denition 8), then, clearly, R(; ) becomes simply the variance of (X1, . . . , Xn). The criterion proposed above for selecting then coincides with that of nding a UMVU estimator. This problem has already been discussed in Section 3 and Section 4. Actually, some authors discuss UMVU estimators as a special case within the decision-theoretic approach as just mentioned. However, we believe that the approach adopted here is more pedagogic and easier for the reader to follow. Setting aside the fruitless search for an estimator which would uniformly (in ) minimize the risk within the entire class of admissible estimators, there are two principles on which our search may be based. The rst is to look for an estimator which minimizes the worst which could happen to us, that is, to minimize the maximum (over ) risk. Such an estimator, if it exists, is called a minimax (from minimizing the maximum) estimator. However, in this case, while we may still conne ourselves to the essentially complete class of estimators, we may not rule out inadmissible estimators, for it might so happen that
12.6 Criteria for Selecting The Decision-Theoretic 12.3 The Casean of Estimator: Availability of Complete Sufcient Approach Statistics
311
R R( ; ), minimax
R( ; *) R( ; ) R(0; )
0
Figure 12.2
0
Figure 12.3
a minimax estimator is inadmissible. (See Fig. 12.2.) Instead, we restrict our attention to the class D1 of all estimators for which R(; ) is nite for all . Then we have the following denition:
DEFINITION 12
Within the class D1, the estimator is said to be minimax if for any other estimator *, one has
sup R ; ; sup R ; * ; .
Figure 12.2 illustrates the fact that a minimax estimator may be inadmissible. Now one may very well object to the minimax principle on the grounds that it gives too much weight to the maximum risk and entirely neglects its other values. For example, in Fig. 12.3, whereas the minimax estimate is slightly better at its maximum R(0; ), it is much worse than * at almost all other points. Legitimate objections to minimax principles like the one just cited prompted the advancement of the concept of a Bayes estimate. To see what this is, some further notation is required. Recall that , and suppose now that is an r.v. itself with p.d.f. , to be called a prior p.d.f. Then set R ; d R = E R ; = R ; . Assuming that the quantity just dened is nite, it is clear that R( ) is simply the average (with respect to ) risk over the entire parameter space when the estimator is employed. Then it makes sense to choose that for which R() R(*) for any other *. Such a is called a Bayes estimator of , provided it exists. Let D2 be the class of all estimators for which R( ) is nite for a given prior p.d.f. on . Then
[( )
[(
()
( )() ( )()
DEFINITION 13
Within the class D2, the estimator is said to be a Bayes estimator (in the decision-theoretic sense and with respect to the prior p.d.f. on ) if R( ) R(*) for any other estimator *. It should be pointed out at the outset that the Bayes approach to estimation poses several issues that we have to reckon with. First, the assumption of being an r.v. might be entirely unreasonable. For example, may denote the (unknown but xed) distance between Chicago and New York City, which is
312
12
Point Estimation
to be determined by repeated measurements. This difculty may be circumvented by pretending that this assumption is only a mathematical device, by means of which we expect to construct estimates with some tangible and mathematically optimal properties. This granted, there still is a problem in choosing the prior on . Of course, in principle, there are innitely many such choices. However, in concrete cases, choices do suggest themselves. In addition, when choosing we have the exibility to weigh the parameters the way we feel appropriate, and also incorporate in it any prior knowledge we might have in connection with the true value of the parameter. For instance, prior experience might suggest that it is more likely that the true parameter lies in a given subset of rather than in its complement. Then, in choosing , it is sensible to assign more weight in the subset under question than to its complement. Thus we have the possibility of incorporating prior information about or expressing our prior opinion about . Another decisive factor in choosing is that of mathematical convenience; we are forced to select so that the resulting formulas can be handled. We should like to mention once and for all that the results in the following two sections are derived by employing squared loss functions. It should be emphasized, however, that the same results may be discussed by using other loss functions.
12.7 Finding Bayes Estimators

Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), , and consider the squared loss function. That is, for an estimate
= x1 , . . . , xn , L ; = L ; x1 , . . . , xn = x1 , . . . , xn
Let be an r.v. with prior p.d.f. . Then we are interested in determining so that it will be a Bayes estimate (of in the decision-theoretic sense). We consider the continuous case, since the discrete case is handled similarly with the integrals replaced by summation signs. We have
) [
)] [
)] .
2
R ; = E X 1 , . . . , X n =
Therefore

[ (
[ ( x , . . . , x )] f ( x ; ) f ( x ; )dx
2 1 n 1 n
)]
dxn .
R = R ; d
=
()
)()
f x1 ; f xn ; dx1 dxn d
x1 , . . . , xn
)]
}()
12.3
12.7 Finding Bayes Estimators The Case of Availability of Complete Sufcient Statistics

313
f x1 ; f xn ; d dx1 dxn .
()(
[ ( x , . . . , x )]
1 n
) }
(13)
(As can be shown, the interchange of the order of integration is valid here because the integrand is nonnegative. The theorem used is known as the Fubini theorem.) From (13), it follows that if is chosen so that
is minimized for each (x1, . . . , xn), then R ( ) is also minimized. But
[ ( x1 , . . . , xn )] ( ) f ( x1 ; ) f ( xn ; )d
2
2
[ ( x1 , . . . , xn )] ( ) f ( x1 ; ) f ( xn ; )d = 2 ( x1 , . . . , xn ) f ( x1 ; ) f ( xn ; ) ( )d 2 ( x1 , . . . , xn ) f ( x1 ; ) f ( xn ; ) ( )d + 2 f ( x1 ; ) f ( xn ; ) ( )d ,
and the right-hand side of (14) is of the form
g t = at 2 2bt + c
(14)
which is minimized for t = b/a. (In fact, g(t) = 2at 2b = 0 implies t = b/a and g(t) = 2a > 0.) Thus the required estimate is given by
()
(a > 0 )
x1 , . . . , xn =
f ( x ; ) f ( x ; ) ( )d ) f x ; f x ; d . ( )() ( )
1 n 1 n
Formalizing this result, we have the following theorem:

THEOREM 6
A Bayes estimate (x1, . . . , xn) (of ) corresponding to a prior p.d.f. on for which
f ( x1 ; ) f ( x n ; ) ( )d < , 0 < f ( x1 ; ) f ( x n ; ) ( )d < ,

and for each (x1, . . . , xn), is given by
f (x ; ) f (x
2 1
1
; d < ,
)()
x1 , . . . , xn =
f ( x ; ) f ( x ; ) ( )d ) f x ; f x ; d , ( )() ( )
n 1 n
(15)
provided is of the continuous type. Integrals in (15) are to be replaced by summation signs if is of the discrete type.
314
12
Point Estimation
Now, if the observed value of Xj is xj, j = 1, . . . , n, we determine the conditional p.d.f. of , given X1 = x1, . . . , Xn = xn. This is called the posterior p.d.f. of and represents our revised opinion about after new evidence (the observed Xs) has come in. Setting x = (x1, . . . , xn) and denoting by h(|x) the posterior p.d.f. of , we have then
hx =
where
f , x f x; f x ; f x ; ( ) (h(x) ) = ( h(x)) ( ) = ( ) h(x() ) ( ) ,

1 n
(16)
for the case that is of the continuous type. By means of (15) and (16), it follows then that the Bayes estimate of (in the decision-theoretic sense) (x1, . . . , xn) is the expectation of with respect to its posterior p.d.f., that is, Another Bayesian estimate of could be provided by the median of h(|x), or the mode of h(|x), if it exists.
h x = f x; d = f x1 ; f xn ; d

()
)()
)()
x1 , . . . , xn = h x d .
( )
REMARK 6 At this point, let us make the following observation regarding the maximum likelihood and the Bayesian approach to estimation problems. As will be seen, this observation establishes a link between maximum likelihood and Bayes estimates and provides insight into each other. To this end, let h(|x) be the posterior p.d.f. of given by (16) and corresponding to the prior p.d.f. . Since f(x; ) = L( |x), h(|x) may be written as follows:
hx = L x) ( ) . ( ) ( h(x )
(17)
Now let us suppose that is bounded and let be constant on , ( ) = c, say, . Then it follows from (17) that the MLE of , if it exists, is simply that value of which maximizes h(|x). Thus when no prior knowledge about is available (which is expressed by taking ( ) = c, ), the likelihood function is maximized if and only if the posterior p.d.f. is. Some examples follow.
EXAMPLE 14
Let X1, . . . , Xn be i.i.d. r.v.s from B(1, ), = (0, 1). We choose to be the Beta density with parameters and ; that is,
+ 1 1 1 , if 0, 1 = otherwise. 0, Now, from the denition of the p.d.f. of a Beta distribution with parameters and , we have
()
( ) ( )()
( )
12.3
12.7 Finding Bayes Estimators The Case of Availability of Complete Sufcient Statistics
315
1 0 x (1 x)
1
dx =
( ) ( ), ( + )
(18)
and, of course () = ( 1)( 1). Then, for simplicity, writing n j xj rather than n j=1xj when this last expression appears as an exponent, we have
I 1 = f x1 ; f xn ; d
( ) 1 1 d ( ) ( ) ( ) ( ) ( + ) ( ) ( ) = d , 1 ) ( ( ) ( )
= +
1 j xj n j x j
)()
+ j x j 1
+n j x j 1
which by means of (18) becomes as follows:

( ) + x + n = ( ) ( ) ( + + n) +
n j =1 j n j =1
I1
xj
(19)
Next,
I 1 = f x1 ; f xn ; d
( ) 1 1 d ( ) ( ) ( ) ( ) ( + ) ( ) ( ) = d . 1 ) ( ( ) ( )
= +
1 j xj n j x j
)()
+ j x j +1 1
+n j x j 1
Once more relation (18) gives

( ) + x + 1 + n = ( ) ( ) ( + + n + 1) +
n j =1 j n j =1
I2
xj
(20)
Relations (19) and (20) imply, by virtue of (15),
x1 , . . . , xn
that is,
n n + + n + j =1 x j + 1 + j =1 x j = ; = n ++n + + + n + 1 x j j =1
( (
x1 , . . . , xn
n j =1
xj +
n+ +
(21)
316
12
Point Estimation
REMARK 7 We know (see Remark 4 in Chapter 3) that if = = 1, then the Beta distribution becomes U(0, 1). In this case the corresponding Bayes estimate is
x1 , . . . , xn
as follows from (21).
EXAMPLE 15
n j =1
xj + 1
n+ 2
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 1). Take to be N(, 1), where is known. Then I 1 = f x1 ; f xn ; d
)() (
( )
2
n +1
1 n xj exp 2 j =1
exp 2
( )
(
1 n 2 2 exp x + j n +1 2 j =1 2 1
1 n + 1 2 2 nx + d . exp 2
[( )
) ) )
)]
But
(n + 1)
nx + 2 nx + = n + 1 2 2 n+1
) ( ( (
Therefore
2 2 nx + nx + nx + = n + 1 2 2 + n+1 n+1 n+1 2 2 nx + nx + = n + 1 . n+1 n+1
I1 =
1 n+1
( 2 ) (
1
nx + 1 n 2 exp x j + 2 n+1 2 j =1
2 nx + 1 d exp 2 n+1 2 1 n+1 2 1 n + 1 2 nx + 1 1 1 n 2 2 . = exp x + n j n + 1 n + 1 2 2 j =1
( )
(22)
12.3
The Case of Availability of Complete Sufcient Exercises Statistics
317
Next,
I 2 = f x1 ; f xn ; d
)() (
( )
2 1 n+1
n +1
1 n exp x j 2 j =1
exp 2
( 2 ) (
1
nx + 1 n 2 exp x 2 j + n+1 2 j =1
2 1 nx + d exp 2 n+1 2 1 n+1 2 1 n + 1 2 n nx + nx + 1 1 1 2 2 = + . exp x j n n + 1 n + 1 n + 1 2 2 j =1
( )
(23)
By means of (22) and (23), one has, on account of (15),
x1 , . . . , xn =
nx + . n+1
(24)
Exercises
12.7.1 Refer to Example 14 and: iii) Determine the posterior p.d.f. h(|x); iii) Construct a 100(1 )% Bayes condence interval for ; that is, determine a set { (0, 1); h( |x) c(x)}, where c(x) is determined by the requirement that the P-probability of this set is equal to 1 ; iii) Derive the Bayes estimate in (21) as the mean of the posterior p.d.f. h(|x). (Hint: For simplicity, assign equal probabilities to the two tails.) 12.7.2 Refer to Example 15 and: iii) Determine the posterior p.d.f. h( |x); iii) Construct the equal-tail 100(1 )% Bayes condence interval for ; iii) Derive the Bayes estimate in (24) as the mean of the posterior p.d.f. h( |x).
318
12
Point Estimation
12.7.3 Let X be an r.v. distributed as P( ), and let the prior p.d.f. of be Negative Exponential with parameter . Then, on the basis of X: iii) Determine the posterior p.d.f. h( |x); iii) Construct the equal-tail 100(1 )% Bayes condence interval for ; iii) Derive the Bayes estimates (x) for the loss functions L(; ) = [ (x)]2 as well as L( ; ) = [ (x)]2/; iv) Do parts (i)(iii) for any sample size n. 12.7.4 Let X be an r.v. having the Beta p.d.f. with parameters = and = 1, and let the prior p.d.f. of be the Negative Exponential with parameter . Then, on the basis of X: iii) Determine the posterior p.d.f. h(|x); iii) Construct the equal-tail 100(1 )% Bayes condence interval for ; iii) Derive the Bayes estimates (x) for the loss functions L(; ) = [ (x)]2 as well as L(; ) = [ (x)]2/ ; iv) Do parts (i)(iii) for any sample size n; iv) Do parts (i)(iv) for any sample size n when is Gamma with parameters k (positive integer) and .
(Hint: If Y is distributed as Gamma with parameters k and , then it is easily seen that 2Y 2 2k.)
12.8 Finding Minimax Estimators

Although there is no general method for deriving minimax estimates, this can be achieved in many instances by means of the Bayes method described in the previous section. Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), ( )and let be a prior p.d.f. on . Then the posterior p.d.f. of , given X = (X1, . . . , Xn) = (x1, . . . , xn) = x, h(|x), is given by (16), and as has been already observed, the Bayes estimate of (in the decision-theoretic sense) is given by
( x1 , . . . , xn ) = h( x)d ,
provided is of the continuous type. Then we have the following result.

THEOREM 7
Suppose there is a prior p.d.f. on such that for the Bayes estimate dened by (15) the risk R( ; ) is independent of . Then is minimax.
PROOF one has
By the fact that is the Bayes estimate corresponding to the prior ,
12.3
12.8 Finding Minimax Estimators The Case of Availability of Complete Sufcient Statistics
319
R( ; ) ( )d R( ; *) ( )d
for any estimate *. But R(; ) = c by assumption. Hence
sup R ; ; = c R ; * d sup R ; * ;
for any estimate *. Therefore is minimax. The case that is of the discrete type is treated similarly. The theorem just proved is illustrated by the following example.
EXAMPLE 16
[( )
)()
[(
Let X1, . . . , Xn and be as in Example 14. Then the corresponding Bayes estimate is given by (21). Now by setting X = n j = 1Xj and taking into consideration that E X = n and E X2 = n(1 + n), we obtain X + R ; = E n+ +
(n + + )
n 2 2 2 + 2 n + 2 .
By taking = =
1 n and denoting by * the resulting estimate, we have 2
( + )
) (
n = 0, 2 2 + 2 n = 0,
so that
R ; * =
4 n+ n 4 1+ n Since R(; *) is independent of , Theorem 6 implies that
2
n+ +
) (
2
* x1 , . . . , xn =
is minimax.
EXAMPLE 17
j =1
1 n 2 nx + 1 2 = n+ n 2 1+ n xj +
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2), where 2 is known and = . of was UMVU. It can It was shown (see Example 9) that the estimator X be shown that it is also minimax and admissible. The proof of these latter two facts, however, will not be presented here. Now a UMVU estimator has uniformly (in ) smallest risk when its competitors lie in the class of unbiased estimators with nite variance. However, outside this class there might be estimators which are better than a UMVU estimator. In other words, a UMVU estimator need not be admissible. Here is an example.
320
12
Point Estimation
EXAMPLE 18
Let X1, . . . , Xn be i.i.d. r.v.s from N(0, 2). Set 2 = . Then the UMVU estimator of is given by U= 1 n X j2 . n j =1
(See Example 9.) Its variance (risk) was seen to be equal to 2 2/n; that is, R(; U) = 2 2/n. Consider the estimator = U. Then its risk is R ; = E U
= E U + 1
[(
) (
)]
2 n + 2 2 2 n + n . n
[(
The value = n/(n + 2) minimizes this risk and the minimum risk is equal to 2 2/(n + 2) < 2 2/n for all . Thus U is not admissible.
Exercise
12.8.1 Let X1, . . . , Xn be independent r.v.s from the P( ) distribution, and consider the loss function L(; ) = [ (x)]2/. Then for the estimate (x) = , calculate the risk R(; ) = 1/E [ (X)]2, and conclude that (x) is x minimax.
12.9 Other Methods of Estimation

Minimum chi-square method. This method of estimation is applicable in situations which can be described by a Multinomial distribution. Namely, consider n independent repetitions of an experiment whose possible outcomes are the k pairwise disjoint events Aj, j = 1, . . . , k. Let Xj be the number of trials which result in Aj and let pj be the probability that any one of the trials results in Aj. The probabilities pj may be functions of r parameters; that is, p j = p j , = 1 , . . . , r , j = 1, . . . , k.
()
Then the present method of estimating consists in minimizing some measure of discrepancy between the observed Xs and the expected values of them. One such measure is the following:
[X =
k j =1
( )] . np ()
np j
j 2
Often the ps are differentiable with respect to the s, and then the minimization can be achieved, in principle, by differentiation. However, the actual solution of the resulting system of r equations is often tedious. The solution may be easier by minimizing the following modied 2 expression:
12.3
12.9 Other Methods of Estimation The Case of Availability of Complete Sufcient Statistics
321
2 mod
[X =
k j =1
np j Xj
( )] ,
2
provided, of course, all Xj > 0, j = 1, . . . , k. Under suitable regularity conditions, the resulting estimators can be shown to have some asymptotic optimal properties. (See Section 12.10.) The method of moments. Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ) and for a positive integer r, assume that EX r = mr is nite. The problem is that of estimating mr. According to the present method, mr will be estimated by the corresponding sample moment 1 n X jr , n j =1 The resulting moment estimates are always unbiased and, under suitable regularity conditions, they enjoy some asymptotic optimal properties as well. On the other hand the theoretical moments are also functions of = (1, . . . , r). Then we consider the following system 1 n k X j = mk 1 , . . . , r , k = 1, . . . , r, n j =1
the solution of which (if possible) will provide estimators for j, j = 1, . . . , r.

EXAMPLE 19
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2), where both and 2 are unknown. By the method of moments, we have
X = n 2 1 n 1 2 2 2 2 = + = = , hence , X X Xj X . j n n j =1 j =1
EXAMPLE 20
Let X1, . . . , Xn be i.i.d. r.v.s from U(, ), where both and are unknown. Since
+ EX 1 = 2
(see Chapter 5), we have
+ X = 2 n 1 X2 = j n 12 j =1
and X 1
2
( )
( ) =
12
) + ( + )
2
+ = 2 X , or = S 12 ,
where
322
12
Point Estimation
S=
1 n Xj X n j =1
= X + S 3. = X S 3, Hence
of , , , REMARK 8 In Example 20, we see that the moment estimators respectively, are not functions of the sufcient statistic (X(1), X(n)) of (, ). This is a drawback of the method of moment estimation. Another obvious disadvantage of this method is that it fails when no moments exist (as in the case of the Cauchy distribution), or when not enough moments exist. Least square method. This method is applicable when the underlying distribution is of a certain special form and it will be discussed in detail in Chapter 16.
Exercises
12.9.1 Let X1, . . . , Xn be independent r.v.s distributed as U( a, + b), where a, b > 0 are known and = . Find the moment estimator of and calculate its variance. 12.9.2 If X1, . . . , Xn are independent r.v.s distributed as U(, ), = (0, ), does the method of moments provide an estimator for ? 12.9.3 If X1, . . . , Xn are i.i.d. r.v.s from the Gamma distribution with param = S2/X 2/S2 and are the moment estimators of eters and , show that =X and , respectively, where S2 = 12.9.4
2 1 n Xj X . n j =1
Let X1, X2 be independent r.v.s with p.d.f. f(; ) given by f x; =
2 x I ( 0 , ) x , = 0, . 2 Find the moment estimator of . 12.9.5 Let X1, . . . , Xn be i.i.d. r.v.s from the Beta distribution with parameters , and nd the moment estimators of and . 12.9.6 Refer to Exercise 12.5.7 and nd the moment estimators of 1 and 2.
()
12.10 Asymptotically Optimal Properties of Estimators

So far we have occupied ourselves with the problem of constructing an estimator on the basis of a sample of xed size n, and having one or more of the
12.3
12.10 Asymptotically Properties of Estimators The Case of Availability Optimal of Complete Sufcient Statistics
323
following properties: Unbiasedness, (uniformly) minimum variance, minimax, minimum average risk (Bayes), the (intuitively optimal) property associated with an MLE. If however, the sample size n may increase indenitely, then some additional, asymptotic properties can be associated with an estimator. To this effect, we have the following denitions. Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), .
DEFINITION 14
The sequence of estimators of , {Vn} = {V(X1, . . . , Xn)}, is said to be consistent P in probability (or weakly consistent) if Vn as n , for all . a.s. It is said to be a.s. consistent (or strongly consistent) if Vn as n , P for all . (See Chapter 8.) From now on, the term consistent will be used in the sense of weakly consistent. The following theorem provides a criterion for a sequence of estimates to be consistent.
THEOREM 8
. If, as n , EVn and 2 Vn 0, then Vn
PROOF For the proof of the theorem the reader is referred to Remark 5, Chapter 8.
DEFINITION 15
The sequence of estimators of , {Vn} = {V(X1, . . . , Xn)}, properly normalized, is said to be asymptotically normal N(0, 2()), if, as n , n(Vn ) d X for all , where X is distributed (under P) as N(0, 2()). (See ( P ) Chapter 8.) This is often expressed (loosely) by writing Vn N(, 2()/n). If
d n Vn N 0, 2 , as n , ( P )
it follows that Vn (see Exercise 12.10.1). n
( ))
DEFINITION 16
The sequence of estimators of , {Vn} = {V(X1, . . . , Xn)}, is said to be best asymptotically normal (BAN) if: ii) iIt is asymptotically normal and ii) The variance 2() of its limiting normal distribution is smallest for all in the class of all sequences of estimators which satisfy (i). A BAN sequence of estimators is also called asymptotically efcient (with respect to the variance). The relative asymptotic efciency of any other sequence of estimators which satises (i) only is expressed by the quotient of the smallest variance mentioned in (ii) to the variance of the asymptotic normal distribution of the sequence of estimators under consideration. In connection with the concepts introduced above, we have the following result.
324
12
Point Estimation
THEOREM 9
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), . Then, if certain suitable regularity conditions are satised, the likelihood equation
log L X 1 , . . . , X n = 0
has a root * n = *(X1, . . . , Xn), for each n, such that the sequence {* n} of estimators is BAN and the variance of its limiting normal distribution is equal to the inverse of Fishers information number
I = E log f X ; ,
()
where X is an r.v. distributed as the Xs above. In smooth cases, * n will be an MLE or the MLE. Examples have been constructed, however, for which { n} does not satisfy (ii) of Denition 16 for some exceptional s. Appropriate regularity conditions ensure that these exceptional s are only a few (in the sense of their set having Lebesgue measure zero). The fact that there can be exceptional s, along with other considerations, has prompted the introduction of other criteria of asymptotic efciency. However, this topic will not be touched upon here. Also, the proof of Theorem 9 is beyond the scope of this book, and therefore it will be omitted.
EXAMPLE 21
iii) Let X1, . . . , Xn be i.i.d. r.v.s from B(1, ). Then, by Exercise 12.5.1, the , which we denote by X n here. The weak and strong MLE of is X n follows by the WLLN and SLLN, respectively (see consistency of X n ) is asymptotically normal N(0, I1()), where Chapter 8). That n(X I() = 1/[(1 )] (see Example 7), follows from the fact that n ( X n ) (1 ) is asymptotically N(0, 1) by the CLT (see Chapter 8). =X n of (see iii) If X1, . . . , Xn are i.i.d. r.v.s from P( ), then the MLE X Example 10) is both (strongly) consistent and asymptotically normal by the same reasoning as above, with the variance of limiting normal distribution being equal to I1() = (see Example 8). 2 2 =X n of and (1/n)n iii) The same is true of the MLE X j=1(Xj ) of if 2 X1, . . . , Xn are i.i.d. r.v.s from N(, ) with one parameter known and the other unknown (see Example 12). The variance of the (normal) distribution of n(Xn ) is I1() = 2, and the variance of the limiting normal distribution of 1 n 2 n X j 2 is I 1 2 = 2 4 see Example 9 . n j =1 It can further be shown that in all cases (i)(iii) just considered the regularity conditions not explicitly mentioned in Theorem 9 are satised, and therefore the above sequences of estimators are actually BAN.
( )
12.3
12.11Sufcient Closing Statistics Remarks The Case of Availability of Complete
325
Exercise
12.10.1 Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ); and let {Vn} d = {Vn(X1, . . . , Xn)} be a sequence of estimators of such that n(Vn ) ( P ) 2 Y as n , where Y is an r.v. distributed as N(0, ( )). Then show that P Vn . (That is, asymptotic normality of {Vn} implies its consistency in n probability.)
12.11 Closing Remarks

The following denition serves the purpose of asymptotically comparing two estimators.
DEFINITION 17
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), and let
{U } = {U ( X , . . . , X )}
n n 1 n
and
{V } = {V ( X , . . . , X )}
n n 1 n
be two sequences of estimators of . Then we say that {Un} and {Vn} are asymptotically equivalent if for every ,
n U n Vn 0.
) n
P
For an example, suppose that the Xs are from B(1, ). It has been shown n (= X ) and this (see Exercise 12.3.3) that the UMVU estimator of is Un = X coincides with the MLE of (Exercise 12.5.1). However, the Bayes estimator of , corresponding to a Beta p.d.f. , is given by
Vn
and the minimax estimator is Wn
=
n
n j =1
Xj +
n+ +
(25)
j =1
Xj + n 2
n+ n
(26)
That is, four different methods of estimation of the same parameter provided three different estimators. This is not surprising, since the criteria of optimality employed in the four approaches were different. Next, by the d Z, as n , where Z is an r.v. distributed as CLT, n(Un ) ( P ) N(0, (1 )), and it can also be shown (see Exercise 11.1), that n(Vn ) d Z, as n , for any arbitrary but xed (that is, not functions of n) ( P ) values of and . It can also be shown (see Exercise 12.11.2) that n(Un Vn) P 0. Thus {Un} and {Vn} are asymptotically equivalent according to Den nition 17. As for Wn, it can be established (see Exercise 12.11.3) that n(Wn d W, as n , where W is an r.v. distributed as N( 1 , (1 )). ) 2 (P )
326
12
Point Estimation
Thus {Un} and {Wn} or {Vn} and {Wn} are not even comparable on the basis of Denition 17. Finally, regarding the question as to which estimator is to be selected in a given case, the answer would be that this would depend on which kind of optimality is judged to be most appropriate for the case in question. Although the preceding comments were made in reference to the Binomial case, they are of a general nature, and were used for the sake of deniteness only.
Exercises
12.11.1 In reference to Example 14, the estimator Vn given by (25) is the Bayes estimator of , corresponding to a prior Beta p.d.f. Then show that d Z as n , where Z is an r.v. distributed as N(0, (1 )). n(Vn ) (P ) n is the UMVU (and also the ML) 12.11.2 In reference to Example 14, Un = X estimator of , whereas the estimator Vn is given by (25). Then show that n(Un P Vn) 0. n 12.11.3 In reference to Example 14, Wn, given by (26), is the minimax d W as n , where W is an estimator of . Then show that n(Wn ) ( P ) 1 r.v. distributed as (N 2 , (1 ).)
13.3 UMP Tests for Testing Certain Composite Hypotheses
327
Chapter 13
Testing Hypotheses
Throughout this chapter, X1, . . . , Xn will be i.i.d. r.v.s dened on a probability space (S, class of events, P), r and having p.d.f. f(; ).
13.1 General Concepts of the NeymanPearson Testing Hypotheses Theory

In this section, we introduce the basic concepts of testing hypotheses theory.
DEFINITION 1
A statement regarding the parameter , such as , is called a (statistical) hypothesis (about ) and is usually denoted by H (or H0). The statement that c (the complement of with respect to ) is also a (statistical) hypothesis about , which is called the alternative to H (or H0) and is usually denoted by A. Thus
H H 0 : A : c .
Often hypotheses come up in the form of a claim that a new product, a new technique, etc., is more efcient than existing ones. In this context, H (or H0) is a statement which nullies this claim and is called a null hypothesis. If contains only one point, that is, = {0}, then H is called a simple hypothesis, otherwise it is called a composite hypothesis. Similarly for alternatives. Once a hypothesis H is formulated, the problem is that of testing H on the basis of the observed values of the Xs.
DEFINITION 2
( )
A randomized (statistical) test (or test function) for testing H against the alternative A is a (measurable) function dened on n, taking values in [0, 1] and having the following interpretation: If (x1, . . . , xn) is the observed value of (X1, . . . , Xn) and (x1, . . . , xn) = y, then a coin, whose probability of falling
327
328
13
Testing Hypotheses
heads is y, is tossed and H is rejected or accepted when heads or tails appear, respectively. In the particular case where y can be either 0 or 1 for all (x1, . . . , xn), then the test is called a nonrandomized test. Thus a nonrandomized test has the following form: 1 if = 0 if
x1 , . . . , xn
(x (x
, . . . , xn
) B , . . . , x ) B .
c n
In this case, the (Borel) set B in n is called the rejection or critical region and Bc is called the acceptance region. In testing a hypothesis H, one may commit either one of the following two kinds of errors: to reject H when actually H is true, that is, the (unknown) parameter does lie in the subset specied by H; or to accept H when H is actually false.
DEFINITION 3
Let () = P (rejecting H ), so that 1 () = P (accepting H), . Then () with is the probability of rejecting H, calculated under the assumption that H is true. Thus for , () is the probability of an error, namely, the probability of type-I error. 1 () with c is the probability of accepting H, calculated under the assumption that H is false. Thus for c, 1 () represents the probability of an error, namely, the probability of typeII error. The function restricted to c is called the power function of the test c. The sup [(); ] is denoted and () is called the power of the test at by and is called the level of signicance or size of the test. Clearly, is the smallest upper bound of the type-I error probabilities. It is also plain that one would desire to make as small as possible (preferably 0) and at the same time to make the power as large as possible (preferably 1). Of course, maximizing the power is equivalent to minimizing the type-II error probability. Unfortunately, with a xed sample size, this cannot be done, in general. What the classical theory of testing hypotheses does is to x the size at a desirable level (which is usually taken to be 0.005, 0.01, 0.05, 0.10) and then derive tests which maximize the power. This will be done explicitly in this chapter for a number of interesting cases. The reason for this course of action is that the roles played by H and A are not at all symmetric. From the consideration of potential losses due to wrong decisions (which may or may not be quantiable in monetary terms), the decision maker is somewhat conservative for holding the null hypothesis as true unless there is overwhelming evidence from the data that it is false. He/she believes that the consequence of wrongly rejecting the null hypothesis is much more severe to him/ her than that of wrongly accepting it. For example, suppose a pharmaceutical company is considering the marketing of a newly developed drug for treatment of a disease for which the best available drug in the market has a cure rate of 60%. On the basis of limited experimentation, the research division claims that the new drug is more effective. If, in fact, it fails to be more
13.213.3 Testing UMPaTests Simple for Hypothesis Testing Certain Against Composite a SimpleHypotheses Alternative
329
effective or if it has harmful side effects, the loss sustained by the company due to an immediate obsolescence of the product, decline of the companys image, etc., will be quite severe. On the other hand, failure to market a truly better drug is an opportunity loss, but that may not be considered to be as serious as the other loss. If a decision is to be made on the basis of a number of clinical trials, the null hypothesis H should be that the cure rate of the new drug is no more than 60% and A should be that this cure rate exceeds 60%. We notice that for a nonrandomized test with critical region B, we have
= P X 1 , . . . , X n B = 1 P X 1 , . . . , X n B + 0 P X 1 , . . . , X n Bc = E X 1 , . . . , X n ,
()
and the same can be shown to be true for randomized tests (by an appropriate application of property (CE1) in Section 3 of Chapter 5). Thus
= = E X 1 , . . . , X n ,
DEFINITION 4
() ()
(1)
A level- test which maximizes the power among all tests of level is said to be uniformly most powerful (UMP). Thus is a UMP, level- test if (i) sup [(); ] = and (ii) ( ) *(), c for any other test * which satises (i). If c consists of a single point only, a UMP test is simply called most powerful (MP). In many important cases a UMP test does exist.
Exercise
13.1.1 In the following examples indicate which statements constitute a simple and which a composite hypothesis: i) X is an r.v. whose p.d.f. f is given by f(x) = 2e2xI(0,)(x); ii) When tossing a coin, let X be the r.v. taking the value 1 if head appears and 0 if tail appears. Then the statement is: The coin is biased; iii) X is an r.v. whose expectation is equal to 5.
13.2 Testing a Simple Hypothesis Against a Simple Alternative

In the present case, we take to consist of two points only, which can be labeled as 0 and 1; that is, = {0, 1}. In actuality, may consist of more than two points but we focus attention only on two of its points. Let f and f be two given p.d.f.s. We set f0 = f(; 0), f1 = f(; 1) and let X1, . . . , Xn be i.i.d. . The problem is that of testing the hypothesis H : r.v.s with p.d.f., f(; ), = {0} against the alternative A : c = {1} at level . In other words, we want to test the hypothesis that the underlying p.d.f. of the Xs is f0 against the alternative that it is f1. In such a formulation, the p.d.f.s f0 and f1 need not
0 1
330
13
Testing Hypotheses
even be members of a parametric family of p.d.f.s; they may be any p.d.f.s which are of interest to us. In connection with this testing problem, we are going to prove the following result.
THEOREM 1
(NeymanPearson Fundamental Lemma) Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), = {0, 1}.We are interested in testing the hypothesis H : = 0 against the alternative A : = 1 at level (0 < < 1). Let be the test dened as follows:
x1 , . . . , xn
1, if f x1 ; 1 f xn ; 1 > Cf x1 ; 0 f xn ; 0 = , if f x1 ; 1 f xn ; 1 = Cf x1 ; 0 f xn ; 0 (2) 0, otherwise,

E0 X 1 , . . . , X n = .
( (
) )
( (
) )
( (
) )
( (
) )
where the constants (0 1) and C(>0) are determined so that
(3)
Then, for testing H against A at level , the test dened by (2) and (3) is MP within the class of all tests whose level is . The proof is presented for the case that the Xs are of the continuous type, since the discrete case is dealt with similarly by replacing integrals by summation signs.
PROOF
For convenient writing, we set dz = dx1 dxn , z = x1 , . . . , xn ,
Z = X1 , . . . , X n
and f(z; ), f(Z; ) for f(x1; ) f(xn; ), f(X1; ) f(Xn; ), respectively. Next, let T be the set of points z in n such that f0(z) > 0 and let Dc = Z1(T c). Then
P Dc = P Z T c = f0 z dz = 0,
0 0
( )
Tc
()
and therefore in calculating P -probabilities we may redene and modify r.v.s on the set Dc. Thus we have, in particular,
0
E Z = P f1 Z > Cf0 Z + P f1 Z = Cf0 Z

0 0 0
( )
[ ( ) ( )] [ ( ) ( )] = P {[ f (Z) > Cf (Z)]I D} + P {[ f (Z) = Cf (Z)]I D}

0 1 0 0 1 0
f Z 1 = P > C I D + P f Z 0
0
= P = P
f ( Z) ( ) = C D I Z f ( ) ( ) [(Y > C )I D] + P [(Y = C )I D] (Y > C ) + P (Y = C ),

1 0
0
(4)
UMPaTests for Testing Certain Composite 13.213.3 Testing Simple Hypothesis Against a SimpleHypotheses Alternative
331
a (C ) 1
Figure 13.1
a (C) a (C ) 0 C
where Y = f1(Z)/f0(Z) on D and let Y be arbitrary (but measurable) on Dc. Now let a(C) = P (Y > C), so that G(C) = 1 a(C) = P (Y C) is the d.f. of the r.v. Y. Since G is a d.f., we have G() = 0, G() = 1, G is nondecreasing and continuous from the right. These properties of G imply that the function a is such that a() = 1, a() = 0, a is nonincreasing and continuous from the right. Futhermore,
0 0
P Y = C = G C G C = 1 a C 1 a C = a C a C ,
0
( ) ( ) [
0
( )] [
( )] ( ) ( )
and a(C) = 1 for C < 0, since P (Y 0) = 1 Figure 13.1 represents the graph of a typical function a. Now for any (0 < < 1) there exists C0 (0) such that a(C0) a(C0 ). (See Fig. 13.1.) At this point, there are two cases to consider. First, a(C0) = a(C0 ); that is, C0 is a continuity point of the function a. Then, = a(C0) and if in (2) C is replaced by C0 and = 0, the resulting test is of level . In fact, in this case (4) becomes
E Z = P Y > C0 = a C0 = ,
0 0
( )
) ( )
as was to be seen. Next, we assume that C0 is a discontinuity point of a. In this case, take again C = C0 in (2) and also set
( ) a(C ) a(C )
a C0
0 0
(so that 0 1). Again we assert that the resulting test is of level . In the present case, (4) becomes as follows:
E Z = P Y > C0 + P Y = C0
0 0 0
( )
= a C0 +
( )
( ) a C a C = . [ ( ) ( )] a(C ) a(C )
a C0
0 0 0 0
332
13
Testing Hypotheses
Summarizing what we have done so far, we have that with C = C0, as dened above, and
( ) a(C ) a(C )
a C0
0 0
(which it is to be interpreted as 0 whenever is of the form 0/0), the test dened by (2) is of level . That is, (3) is satised. Now it remains for us to show that the test so dened is MP, as described in the theorem. To see this, let * be any test of level and set
B + = z n ; z * z > 0 = * > 0 , B
n
() () } ( ) { = {z ; (z ) * (z ) < 0} = ( * < 0).

( ( ) ( ) ( ) ( ) ( ) ( ) ( ) )
(5)
Then B+ B = and, clearly, B+ = > * = 1 = = f1 Cf0 B = < * = 0 = = f1 Cf0 . Therefore
[ (z) * (z)][ f1 (z) Cf0 (z)]dz = [ (z ) * (z )][ f1 (z ) Cf0 (z )]dz B + [ (z ) * (z )][ f1 (z ) Cf0 (z )]dz B
n +
and this is 0 on account of (5). That is,
[ (z) * (z)][ f (z) Cf (z)]dz 0,

n
which is equivalent to
[ (z) * (z)]f (z)dz C [ (z) * (z)] f (z)dz.

n
(6)
But
[ (z) * (z)] f (z)dz = (z) f (z)dz * (z) f (z)dz

n
= E Z E * Z = E * Z 0,
0 0 0
( )
( )
( )
(7)
and similarly,
[ (z) * (z)] f (z)dz = E (Z) E

n
* Z = 1 * 1 .
( )
( )
( )
(8)
Relations (6), (7) and (8) yield (1) *(1) 0, or (1) *(1). This completes the proof of the theorem. The theorem also guarantees that the power (1) is at least . That is,
333
COROLLARY
Let be dened by (2) and (3). Then (1) . The test *(z) = is of level , and since is most powerful, we have (1) *(1) = .
PROOF REMARK 1
i) The determination of C and is essentially unique. In fact, if C = C0 is a discontinuity point of a, then both C and are uniquely dened the way it was done in the proof of the theorem. Next, if the (straight) line through the point (0, ) and parallel to the C-axis has only one point in common with the graph of a, then = 0 and C is the unique point for which a(C) = . Finally, if the above (straight) line coincides with part of the graph of a corresponding to an interval (b1, b2], say, then = 0 again and any C in (b1, b2] can be chosen without affecting the level of the test. This is so because
P Y b1 , b2 G b2 G b1
0
[ (
]] ( ) ( ) = [1 a(b )] [1 a(b )] = a(b ) a(b ) = 0.

2 1 2 1
ii) The theorem shows that there is always a test of the structure (2) and (3) which is MP. The converse is also true, namely, if is an MP level test, then necessarily has the form (2) unless there is a test of size < with power 1. This point will not be pursued further here. The examples to be discussed below will illustrate how the theorem is actually used in concrete cases. In the examples to follow, = {0, 1} and the problem will be that of testing a simple hypothesis against a simple alternative at level of signicance . It will then prove convenient to set
R z; 0 , 1 =
( ) ( ) f (x ; ) f (x ; )
f x1 ; 1 f xn ; 1
1 0 n 0
whenever the denominator is greater than 0. Also it is often more convenient to work with log R(z; 0; 1) rather than R(z; 0, 1) itself, provided, of course, R(z; 0, 1) > 0.
EXAMPLE 1
Let X1, . . . , Xn be i.i.d. r.v.s from B(1, ) and suppose 0 < 1. Then
log z; 0 , 1 = x log
1 1 1 + n x log , 1 0 0
where x = n j = 1 xj and therefore, by the fact that 0 < 1, R(z; 0, 1) > C is equivalent to
1 1 0 1 1 . x > C0 , where C0 = log C n log log 1 0 0 1 1
( (
) )
334
13
Testing Hypotheses
Thus the MP test is given by

1, z = , 0, if if
()
j =1 x j > C0 n j =1 x j = C0
n
(9)
otherwise,
where C0 and are determined by
E Z = P X > C0 + P X = C0 = ,
0 0 0
( )
(10)
and X = n j = 1 Xj is B(n, i), i = 0, 1. If 0 > 1, the inequality signs in (9) and (10) are reversed. For the sake of deniteness, let us take 0 = 0.50, 1= 0.75, = 0.05 and n = 25. Then
0.05 = P0.5 X > C0 + P0.5 X = C0 = 1 P0.5 X C0 + P0.5 X = C0
is equivalent to
P0.5 X C0 P0.5 X = C0 = 0.95.
For C0 = 17, we have, by means of the Binomial tables, P0.5(X 17) = 0.9784 and P0.5(X = 17) = 0.0323. Thus is dened by 0.9784 0.0323 = 0.95, whence = 0.8792. Therefore the MP test in this case is given by (2) with C0 = 17 and = 0.882. The power of the test is P0.75(X > 17) + 0.882 P0.75(X = 17) = 0.8356.
EXAMPLE 2
Let X1, . . . , Xn be i.i.d. r.v.s from P() and suppose 0 < 1. Then
logR z; 0 , 1 = x log
1 n 1 0 , 0
where x = xj
j =1 n
and hence, by using the assumption that 0 < 1, one has that R(z; 0, 1) > C is equivalent to x > C0 , where
n( log Ce C0 = log 1 0
1 0
) .
Thus the MP test is dened by
1, z = , 0,
if if
()
n j =1 n j =1
x j > C0 x j = C0
(11)
otherwise,
335
where C0 and are determined by

E0 Z = P0 X > C0 + P0 X = C0 = ,
( )
(12)
and X = n j=1 Xj is P(ni), i = 0, 1. If 0 > 1, the inequality signs in (11) and (12) are reversed. As an application, let us take 0 = 0.3, 1 = 0.4, = 0.05 and n = 20. Then (12) becomes
P0.3 X C0 P0.3 X = C0 = 0.95.
By means of the Poisson tables, one has that for C0 = 10, P0.3(X 10) = 0.9574 and P0.3(X = 10) = 0.0413. Therefore is dened by 0.9574 0.0413 = 0.95, whence = 0.1791. Thus the test is given by (11) with C0 = 10 and = 0.1791. The power of the test is
P0.4 X > 10 + 0.1791 P0.4 X = 10 = 0.2013.

EXAMPLE 3
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 1) and suppose 0 < 1. Then logR z; 0 , 1 =
1 n x j 0 2 j =1
) (x
2
2 1
> C0, where and therefore R(z; 0, 1) > C is equivalent to x
C0 =
n 0 + 1 1 log C + n 1 0 2
by using the fact that 0 < 1. Thus the MP test is given by
1, z = 0,
()
0
if
x > C0
otherwise,
(13)
where C0 is determined by
E Z = P X > C0 = ,
0
( )
(14)
is N( , 1/n), i = 0, 1. If > , the inequality signs in (13) and (14) are and X i 0 1 reversed. Let, for example, 0 = 1, 1, = 1, = 0.001 and n = 9. Then (14) gives
P1 X > C0 = P1 3 X + 1 > 3 C0 + 1 = P N 0, 1 > 3 C0 + 1 = 0.001,
[(
) ( )
)] [ (
) (
)]
whence C0 = 0.03. Therefore the MP test in this case is given by (13) with C0 = 0.03. The power of the test is
P 1 X > 0.03 = P 1 3 X 1 > 2.91 = P N 0 , 1 > 2.91 = 0.9982.
[(
] [ ( )
336
13
Testing Hypotheses
EXAMPLE 4
Let X1, . . . , Xn be i.i.d. r.v.s from N(0, ) and suppose 0 < 1. Here
logR z; 0 , 1 =
1 1 0 x + log 0 , 2 01 2 1
2 where x = n j=1 x j, so that, by means of 0 < 1, one has that R(z; 0, 1) > C is equivalent to x > C0, where
C0 =
201 log C 1 . 1 0 0
Thus the MP test in the present case is given by
1, z = 0,
()
if
n j =1
x2 j > C0
(15)
otherwise,
where C0 is determined by n E P = E X j2 > C0 = , j =1

0
()
(16)
n 2 and is distributed as 2 n, i = 0, 1, where X = j = 1 X j. If 0 > 1, the inequali ity signs in (15) and (16) are reversed. For an example, let 0 = 4, 1 = 16, = 0.01 and n = 20. Then (16) becomes
X C 2 C0 P4 X > C0 = P4 > 0 = P 20 > = 0.01, 4 4 4
whence C0 = 150.264. Thus the test is given by (15) with C0 = 150.264. The power of the test is
X 150.264 2 P > 16 X > 150.264 = P 16 = P 20 > 9.3915 = 0.977. 16 16
Exercises
13.2.1 If X1, . . . , X16 are independent r.v.s, construct the MP test of the hypothesis H that the common distribution of the Xs is N(0, 9) against the alternative A that it is N(1, 9) at level of signicance = 0.05. Also nd the power of the test. 13.2.2 Let X1, . . . , Xn be independent r.v.s distributed as N(, 2), where is unknown and is known. Show that the sample size n can be determined so that when testing the hypothesis H : = 0 against the alternative A : = 1, one has predetermined values for and . What is the numerical value of n if = 0.05, = 0.9 and = 1?
337
13.2.3 Let X1, . . . , Xn be independent r.v.s distributed as N(, 2), where is unknown and is known. For testing the hypothesis H : = 1 against the alternative A : = 2, show that can get arbitrarily small and arbitrarily large for sufciently large n. 13.2.4 Let X1, . . . , X100 be independent r.v.s distributed as N(, 2). If = 3.2, construct the MP test of the hypothesis H : = 3, 2 = 4 against the x alternative A : = 3.5, 2 = 4 at level of signicance = 0.01. 13.2.5 Let X1, . . . , X30 be independent r.v.s distributed as Gamma with = 10 and unknown. Construct the MP test of the hypothesis H : = 2 against the alternative A : = 3 at level of signicance 0.05. 13.2.6 Let X be an r.v. whose p.d.f. is either the U(0, 1) p.d.f. denoted by f0, or the Triangular p.d.f. over the [0, 1] interval, denoted by f1 (that is, f1(x) = 4x for 0 x < 1 , f1(x) = 4 4x for 1 x 1 and 0 otherwise). On the basis of one 2 2 observation on X, construct the MP test of the hypothesis H : f = f0 against the alternative A : f = f1 at level of signicance = 0.05. 13.2.7 Let X be an r.v. with p.d.f. f which can be either f0 or else f1, where . For testing the hypothesis f0 is P(1) and f1 is the Geometric p.d.f. with p = 1 2 H : f = f0 against the alternative A : f = f1: i) Show that the rejection region is dened by: {x 0 integer; 1.36 some positive number C; ii) Determine the level of the test when C = 3.
x! 2x
C} for
(Hint: Observe that the function x!/2x is nondecreasing for x integer 1.)

In the previous section an MP test was constructed for the problem of testing a simple hypothesis against a simple alternative. However, in most problems of practical interest, at least one of the hypotheses H or A is composite. In cases like this it so happens that for certain families of distributions and certain H and A, UMP tests do exist. This will be shown in the present section. Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), . It will prove convenient to set
g z; = f x1 ; f x1 ; ,
) (
z = x1 , . . . , xn .
(17)
Also Z = (X1, . . . , Xn). In the following, we give the denition of a family of p.d.f.s having the monotone likelihood ratio property. This denition is somewhat more restrictive than the one found in more advanced textbooks but it is sufcient for our purposes.
338
13
Testing Hypotheses
DEFINITION 5
The family {g(; ); } is said to have the monotone likelihood ratio (MLR) property in V if the set of zs for which g(z; ) > 0 is independent of and there exists a (measurable) function V dened in n into such that whenever , with < then: (i) g(; ) and g(; ) are distinct and (ii) g(z; )/g(z; ) is a monotone function of V(z). Note that the likelihood ratio (LR) in (ii) is well dened except perhaps on a set N of zs such that P(Z N) = 0 for all . In what follows, we will always work outside such a set. An important family of p.d.f.s having the MLR property is a oneparameter exponential family.
PROPOSITION 1
Consider the exponential family

f x: =C e
()
Q T x
() ( )
hx,
()
where C() > 0 for all and the set of positivity of h is independent of . Suppose that Q is increasing. Then the family {g( ;); } has the MLR property in V, where V(z) = n j=1 T(xj) and g( ; ) is given by (17). If Q is decreasing, the family has the MLR property in V = V.
PROOF
We have
g z : = C0 e
n n j=1
()
Q V z
() ()
h* z ,
()
where C0() = C (), V(z) = T(xj) and h*(z) = h(x1) h(xn). Therefore on the set of zs for which h*(z) > 0 (which set has P-probability 1 for all ), one has g z;
( ) = C ( )e ( ) ( ) = C ( ) e[ () () g ( z; ) C ( ) C ( )e
Q V z 0 0 Q V z 0 0
Q Q V z
( ) ( )] ( ) .
Now for < , the assumption that Q is increasing implies that g(z; )/g(z; ) is an increasing function of V(z). This completes the proof of the rst assertion. The proof of the second assertion follows from the fact that
[Q( ) Q( )]V (z) = [Q( ) Q( )]V (z).
From examples and exercises in Chapter 11, it follows that all of the following families have the MLR property: Binomial, Poisson, Negative Binomial, N(, 2) with 2 known and N(, ) with known, Gamma with = and known, or = and known. Below we present an example of a family which has the MLR property, but it is not of a one-parameter exponential type.
EXAMPLE 5
Consider the Logistic p.d.f. (see also Exercise 4.1.8(i), Chapter 4) with parameter ; that is,
f x; =
e x
(1 + e )
x
x , = .
(18)
339
Then
f x;
( )=e f ( x; )
e
1 + e x x 1+ e
and
f x;
( ) < f ( x ; ) f ( x; ) f ( x ; )
2
if and only if

x 1 + e x 1 + e < e . x x 1+e 1+e 2
However, this is equivalent to ex(e e ) < ex(e e ). Therefore if < , the last inequality is equivalent to ex < ex or x < x. This shows that the family {f(; ); }has the MLR property in x. For families of p.d.f.s having the MLR property, we have the following important theorem.
THEOREM 2
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(x; ), and let the family {g(; ); } have the MLR property in V, where g(; ) is dened in (17). Let 0 and set = { ; 0}. Then for testing the (composite) hypothesis H : against the (composite) alternative A : c at level of signicance , there exists a test which is UMP within the class of all tests of level . In the case that the LR is increasing in V(z), the test is given by 1, z = , 0, if V z > C if
()
() V ( z) = C
(19)
otherwise,
where C and are determined by
E 0 Z = P 0 V Z > C + P 0 V Z = C = .
( )
[() ]
[() ]
(19)
If the LR is decreasing in V(z), the test is taken from (19) and (19) with the inequality signs reversed. The proof of the theorem is a consequence of the following two lemmas.
LEMMA 1
Under the assumptions made in Theorem 2, the test dened by (19) and (19) is MP (at level ) for testing the (simple) hypothesis H0 : = 0 against the (composite) alternative A : c among all tests of level . Let be an arbitrary but xed point in c and consider the problem of testing the above hypothesis H0 against the (simple) alternative A : = at level . Then, by Theorem 1, the MP test is given by
PROOF
1, z = , 0,
if if
g z; > C g z; 0
()
( ) ( ) g( z; ) = C g( z; )
0
otherwise,
340
13
Testing Hypotheses
where C and are dened by

E 0 Z = .
( )
Let g(z; )/g(z; 0) = [V(z)]. Then in the case under consideration is dened on into itself and is increasing. Therefore
[ ( )] [V ( z)] = C
V z > C
In addition,
if and only if if and only if
V z > 1 C = C0 V z = C0 .
() ()
( )
(20)
E 0 Z = P 0 V Z > C + P 0 V Z = C = P 0 V Z > C0 + P 0 V Z = C0 .
( )
[()
{ [ ( )] }
]
[()
{ [ ( )] }
]
Therefore the test dened above becomes as follows: 1, z = , 0, if V z > C0 if

0
()
() V ( z) = C
(21)
otherwise,
and
E0 Z = P0 V Z > C0 + P0 V Z = C 0 = ,
( )
[()
[()
(21)
so that C0 = C and = by means of (19) and (19). It follows from (21) and (21) that the test is independent of c. In other words, we have that C = C0 and = and the test given by (19) and (19) is UMP for testing H0 : = 0 against A : c (at level ).
LEMMA 2
Under the assumptions made in Theorem 2, and for the test function dened by (19) and (19), we have E(Z) for all . Let be an arbitrary but xed point in and consider the problem of testing the (simple) hypothesis H : = against the (simple) alternative A0(= H0) : = 0 at level () = E(Z). Once again, by Theorem 1, the MP test is given by
PROOF
1, z = , 0,
if if
g z; 0 > C g z;
0
()
( ) ( ) g( z; ) = C g( z; )
otherwise,
where C and are determined by E Z = P V Z > C + P V Z = C = .
( )
{ [ ( )] }
{ [ ( )] }
( )
341
On account of (20), the test above also becomes as follows: 1, z = , 0, if V z > C0 if
()
() V ( z) = C
0
(22)
otherwise,
E Z = P V Z > C0 + P V Z = C0 = ,
( )
[()
[()
] ( )
(22)
where C0 = 1(C ). Replacing 0 by in the expression on the left-hand side of (19) and comparing the resulting expression with (22), one has that C0 = C and = . Therefore the tests and are identical. Furthermore, by the corollary to Theorem 1, one has that () , since is the power of the test .
PROOF OF THEOREM 2
Dene the classes of test C and C0 as follows:
C = all level tests for testing H : 0 , C0

0 0
{ } = {all level tests for testing H : = }.
Then, clearly, C C0. Next, the test , dened by (19) and (19), belongs in C by Lemma 2, and is MP among all tests in C0, by Lemma 1. Hence it is MP among tests in C. The desired result follows.
REMARK 2
For the symmetric case where = { ; 0}, under the assumptions of Theorem 2, a UMP test also exists for testing H : against A : c. The test is given by (19) and (19) if the LR is decreasing in V(z) and by those relationships with the inequality signs reversed if the LR is increasing in V (z). The relevant proof is entirely analogous to that of Theorem 2. Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ) given by Q ( )T ( x ) f x; = C e hx,
COROLLARY
()
()
where Q is strictly monotone. Then for testing H : = { ; 0} against A : c at level of signicance , there is a test which is UMP within the class of all tests of level . This test is given by (19) and (19) if Q is increasing and by (19) and (19) with reversed inequality signs if Q is decreasing. Also for testing H : = { ; 0} against A : c at level , there is a test which is UMP within the class of all tests of level . This test is given by (19) and (19) if Q is decreasing and by those relationships with reversed inequality signs if Q is increasing. In all tests, V(z) = n j = 1 T(xj).
PROOF
It is immediate on account of Proposition 1 and Remark 2.
It can further be shown that the function () = E(Z), , for the problem discussed in Theorem 2 and also the symmetric situation mentioned
342
13
Testing Hypotheses
( ) 1
( ) 1
0 0
Figure 13.2 H : 0, A : > 0
Figure 13.3 H : 0, A : < 0
in Remark 2, is increasing for those s for which it is less than 1 (see Figs. 13.2 and 13.3, respectively). Another problem of practical importance is that of testing
H : = ; 1 or 2
against A : c, where 1, 2 and 1 < 2. For instance, may represent a dose of a certain medicine and 1, 2 are the limits within which is allowed to vary. If 1 the dose is rendered harmless but also useless, whereas if 2 the dose becomes harmful. One may then hypothesize that the dose in question is either useless or harmful and go about testing the hypothesis. If the underlying distribution of the relevant measurements is assumed to be of a certain exponential form, then a UMP test for the testing problem above does exist. This result is stated as a theorem below but its proof is not given, since this would rather exceed the scope of this book.
THEOREM 3
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), given by

f x; = C e
()
Q T x
() ( )
hx,
()
(23)
where Q is assumed to be strictly monotone and = . Set = { ; 1 or 2}, where 1, 2 and 1 < 2. Then for testing the (composite) hypothesis H : against the (composite) alternative A : c at level of signicance , there exists a UMP test . In the case that Q is increasing, is given by 1, z = i 0, if C1 < V z < C 2 if V z = C i otherwise,
()
()
()
(i = 1, 2) (C
< C2
(24)
where C1, C2 and 1, 2 are determined by E Z = P C1 < V Z < C 2 + 1P V Z = C1

i i i
( )
+ 2
( ) ] [() P [V (Z) = C ] = , i = 1, 2,
i
2
]
()
n j =1
and V z = T x j .
( )
(25)
343
( ) 1
0 1 0
Figure 13.4 H : 1 or 2, A : 1 < < 2.
If Q is decreasing, the test is given again by (24) and (25) with C1 < V (z) < C2 replaced by V(z) < C1 or V(z) > C2. It can also be shown that (in nondegenerate cases) the function () = E(Z), for the problem discussed in Theorem 3, increases for 0 and decreases for 0 for some 1 < 0 < 2 (see also Fig. 13.4). Theorems 2 and 3 are illustrated by a number of examples below. In order to avoid trivial repetitions, we mention once and for all that the hypotheses to be tested are H : = { ; 0} against A : c and H : = { ; 1 or 2} against A : c; 0, 1, 2 and 1 < 2. The level of signicance is (0 < < 1).
EXAMPLE 6
Let X1, . . . , Xn be i.i.d. r.v.s from B(1, ), = (0, 1). Here V z = xj

j =1
()
and Q = log
()
is increasing since /(1 ) is so. Therefore, on account of the corollary to Theorem 2, the UMP test for testing H is given by
1, z = , 0, if if
()
j = 1 x j > C n j = 1 x j = C
n
(26)
otherwise,
where C and are determined by
E Z = P X > C + P X = C = ,
0 0 0
( )
(27)
and X = Xj
j =1 n
is
B n, .
For a numerical application, let 0 = 0.5, = 0.01 and n = 25. Then one has
344
13
Testing Hypotheses
P0.5 X > C + P0.5 X = C = 0.01.

The Binomial tables provided the values C = 18 and = test at = 0.75 is
27 143
. The power of the
0.75 = P0.75 X > 18 +
27 P0.75 X = 18 = 0.5923. 143
By virtue of Theorem 3, for testing H the UMP test is given by 1 z = i 0, if C1 < j=1 x j < C 2
n
()
if
n j=1
x j = Ci
(i = 1, 2)
( )
otherwise,
with C1, C2 and 1, 2 dened by

E i Z = P i C1 < X < C 2 + 1 P i X = C1 + 2 P i X = C 2 = , i = 1, 2.
( )
Again for a numerical application, take 1 = 0.25, 2 = 0.75, = 0.05 and n = 25. One has then
P0.25 C1 < X < C 2 + 1 P0.25 X = C1 + 2 P0.25 X = C 2 = 0.05 P0.75

1 2 1 0.75 1 2 0.75
( (C
) ( ) < X < C ) + P (X = C ) +
( ) (X = C ) = 0.05.
2
For C1 = 10 and C2 = 15, one has after some simplications 416 1 + 2 2 = 205 2 1 + 416 2 = 205, from which we obtain
1 = 2 =
The power of the test at = 0.5 is
205 0.4904. 418
0.5 = P0.5 10 < X < 15 +

EXAMPLE 7
( )
205 P0.5 X = 10 + P0.5 X = 15 = 0.6711. 418
[ (
)]
Let X1, . . . , Xn be i.i.d. r.v.s from P(), = (0, ). Here V(z) = n j = 1 xj and Q() = log is increasing. Therefore the UMP test for testing H is again given by (26) and (27), where now X is P(n). For a numerical example, take 0 = 0.5, = 0.05 and n = 10. Then, by means of the Poisson tables, we nd C = 9 and
182 0.5014. 363
345
The power of the test at = 1 is (1) = 0.6048.

EXAMPLE 8
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2) with 2 known. Here V z = xj

j =1
()
and
Q =
()
1 2
is increasing. Therefore for testing H the UMP test is given by (dividing by n)
1, z = 0 ,
()
if x > C otherwise,
where C is determined by
E 0 Z = P 0 X > C = ,
( )
is N(, 2/n). (See also Figs. 13.5 and 13.6.) and X The power of the test, as is easily seen, is given by
n C . = 1 For instance, for = 2 and 0 = 20, = 0.05 and n = 25, one has C = 20.66. For = 21, the power of the test is
()
21 = 0.8023.
On the other hand, for testing H the UMP test is given by
1, z = 0,
( )
()
if C1 < x < C 2 otherwise,
where C1, C2 are determined by
E Z = P C1 < X < C 2 = ,
i i
( )
i = 1, 2.
(See also Fig. 13.7.) The power of the test is given by
n C 2 =
()
nC ) (
.
1
N (0 ,
2 n
)
0 C 0
N (0,
2 n
Figure 13.5 H : 0, A : > 0.
Figure 13.6 H : 0, A : < 0.
346
13
Testing Hypotheses
N (0,
2 n
C1 0 C2
Figure 13.7 H : 1 or 2, A : 1 < < 2.
For instance, for = 2 and 1 = 1, 2 = 1, = 0.05 and n = 25, one has C1 = 0.344, C2 = 0.344, and for = 0, the power of the test is (0) = 0.610.
EXAMPLE 9
Let X1, . . . , Xn be i.i.d. r.v.s from N(, ) with known. Then V(z) = 2 n j = 1 (xj ) and Q() = 1/(2) is increasing. Therefore for testing H, the UMP test is given by 1, z = 0,
()
if
j = 1( x j )
n
>C
otherwise, > C = .
where C is determined by n E Z = P X j j =1
0
( )
The power of the test, as is easily seen, is given by

2 = 1 P n <C
()
) (independent of !).
2 (See also Figs. 13.8 and 13.9; 2 n stands for an r.v. distribution as n.) For a numerical example, take 0 = 4, = 0.05 and n = 25. Then one has C = 150.608, and for = 12, the power of the test is (12) = 0.980. On the other hand, for testing H the UMP test is given by
1, z = 0,
()
if C1 < j = 1 x j
n
< C2
otherwise,
2 n
2 n
0 C/ 0
Figure 13.8 H : 0, A : > 0.
C/ 0
Figure 13.9 H : 0, A : < 0.
13.3 UMP Tests for Testing Certain Composite Hypotheses Exercises

n E Z = P C1 < X j j =1
i
347
( )
< C2 = ,
i = 1, 2.
The power of the test, as is easily seen, is given by
2 C2 2 C1 = P n < P n <
()
(independent of !).
For instance, for 1 = 1, 2 = 3, = 0.01 and n = 25, we have

2 2 P 25 < C 2 P 25 < C1 = 0.01,
) (
2 C2 2 C1 P 25 < P 25 < = 0.01 3 3
and C1, C2 are determined from the Chi-square tables (by trial and error).
Exercises
13.3.1 Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f given below. In each case, show that the joint p.d.f. of the Xs has the MLR property in V = V(x1, . . . , xn) and identity V. i) f x; =
1 x x e I ( 0 , ) x , = 0, , = known
( )
()
(> 0);
( )
x r + x 1 ii) f x; = r 1 I A x , A = 0, 1, . . . , = 0, 1 . x
) ()
13.3.2 Refer to Example 8 and show that, for testing the hypotheses H and H mentioned there, the power of the respective tests is given by
n C = 1
()
)

1
and
n C 2 =
()
nC ) (
as asserted. 13.3.3 The length of life X of a 50-watt light bulb of a certain brand may be assumed to be a normally distributed r.v. with unknown mean and known s.d. = 150 hours. Let X1, . . . , X25 be independent r.v.s distributed as X and = 1,730 hours. Test the hypothesis H : = 1,800 against the suppose that x alternative A : < 1,800 at level of signicance = 0.01.
348
13
Testing Hypotheses
13.3.4 The rainfall X at a certain station during a year may be assumed to be a normally distributed r.v. with s.d. = 3 inches and unknown mean . For the past 10 years, the record provides the following rainfalls: x1 = 30.5, x2 = 34.1, x3 = 27.9, x4 = 29.4, x5 = 35.0, x6 = 26.9, x7 = 30.2, x8 = 28.3, x9 = 31.7, x10 = 25.8. Test the hypothesis H : = 30 against the alternative A : < 30 at level of signicance = 0.05. 13.3.5 Refer to Example 9 and show that, for testing the hypotheses H and H mentioned there, the power of the respective tests is given by
2 C 2 C2 2 C1 = 1 P n < and = P n 2 at level of signicance = 2 0.05. What does the relevant test become for 25 j = 1xj = 120, where xj is the observed value of Xj, j = 1, . . . , 25. 13.3.7 In a certain university 400 students were chosen at random and it was found that 95 of them were women. On the basis of this, test the hypothesis H that the proportion of women is 25% against the alternative A that is less than 25% at level of signicance = 0.05. Use the CLT in order to determine the cut-off point. 13.3.8 Let X1, . . . , Xn be independent r.v.s distributed as B(1, p). For testing the hypothesis H : p 1 against the alternative A : p > 1 , suppose that = 0.05 2 2 7 and ( 8 ) = 0.95. Use the CLT in order to determine the required sample size n. 13.3.9 Let X be an r.v. distributed as B(n, ), = (0, 1). i) Derive the UMP test for testing the hypothesis H : 0 against the alternative A : > 0 at level of signicance . ii) What does the test in (i) become for n = 10, 0 = 0.25 and = 0.05? iii) Compute the power at 1 = 0.375, 0.500, 0.625, 0.750, 0.875. Now let 0 = 0.125 and = 0.1 and suppose that we are interested in securing power at least 0.9 against the alternative 1 = 0.25. iv) Determine the minimum sample size n required by using the Binomial tables (if possible) and also by using the CLT. 13.3.10 The number X of fatal trafc accidents in a certain city during a year may be assumed to be an r.v. distributed as P(). For the latest year x = 4, whereas for the past several years the average was 10. Test whether it has been an improvement, at level of signicance = 0.01. First, write out the expression for the exact determination of the cut-off point, and secondly, use the CLT for its numerical determination.
13.4 13.3 UMPU UMP Tests for Testing Certain Composite Hypotheses
349
13.3.11 Let X be the number of times that an electric light switch can be turned on and off until failure occurs. Then X may be considered to be an r.v. distributed as Negative Binomial with r = 1 and unknown p. Let X1, . . . , X15 be = 15,150. Test the independent r.v.s distributed as X and suppose that x hypothesis H : p = 104 against the alternative A : p > 104 at level of signicance = 0.05. 13.3.12 Let X1, . . . , Xn be independent r.v.s with p.d.f. f given by
f x; =
1 x e I (0 , ) x ,
()
= 0, .
i) Derive the UMP test for testing the hypothesis H : 0 against the alternative A : < 0 at level of signicance ; ii) Determine the minimum sample size n required to obtain power at least 0.95 against the alternative 1 = 500 when 0 = 1,000 and = 0.05.
13.4 UMPU Tests for Testing Certain Composite Hypotheses

In Section 13.3, it was stated that under the assumptions of Theorem 3, for testing H : = { ; 1 or 2} against A : c, a UMP test exists. It is then somewhat surprising that, if the roles of H and A are interchanged, a UMP test does not exist any longer. Also under the assumptions of Theorem 2, for testing H0 : = 0 against A : 0 a UMP does not exist. This is so because the test given by (19) and (19) is UMP for > 0 but is worse than the trivial test (z) = for < 0. Thus there is no unique test which is UMP for all 0. The above observations suggest that in order to nd a test with some optimal property, one would have to restrict oneself to a smaller class of tests. This leads us to introducing the concept of an unbiased test.
DEFINITION 6
and let r. Then Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), against the alternative A : c at level of for testing the hypothesis H : signicance , a test based on X1, . . . , Xn is said to be unbiased if E(X1, . . . , c. Xn) for all and E(X1, . . . , Xn) for all That is, the dening property of an unbiased test is that the type-I error probability is at most and the power of the test is at least .
DEFINITION 7
In the notation of Denition 6, a test is said to be uniformly most powerful unbiased (UMPU) if it is UMP within the class of all unbiased tests. A UMP test is always UMPU. In fact, in the rst place it is unbiased because it is at least as powerful as the test which is identically equal to . Next, it is UMPU because it is UMP within a class including the class of unbiased tests.
REMARK 3
350
13
Testing Hypotheses
For certain important classes of distributions and certain hypotheses, UMPU tests do exist. The following theorem covers cases of this sort, but it will be presented without a proof.
THEOREM 4
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ) given by

f x; = C e
()
T x
( )
hx,
()
(28)
Let = { ; 1 2} and 0 = {0}, where 0, 1, 2 and 1 < 2. Then for testing the hypothesis H : against A : c and the hypothesis H0 : 0 against A0 : c at level of signicance , there exist UMPU tests which are given by 1, z = i , 0, if V z < C1 if
()
or V (z ) > C () V (z ) = C , (i = 1, 2) (C
2 i
< C2
otherwise,
where the constants Ci, i, i = 1, 2 are given by

Ei Z = ,
( )
0
i = 1, 2 for H ,
and
E Z = , E V Z Z = E V Z
0 0
( )
[ ( ) ( )]
( )
for H 0 .
(Recall that z = (x1, . . . , xn), Z = (X1, . . . , Xn) and V(z) = n j = 1 T(xj).) Furthermore, it can be shown that the function () = E(Z), (except for degenerate cases) is decreasing for 0 and increasing for 0 for some 1 < 0 < 2 (see also Fig. 13.10). We would expect that cases like Binomial, Poisson and Normal would fall under Theorem 4, while they seemingly do not. However, a simple reparametrization of the families brings them under the form (28). In fact, by Examples and Exercises of Chapter 11 it can be seen that all these families are of the exponential form
REMARK 4
( ) 1
0 1 0 2
Figure 13.10 H : 1 2, A : < 1 or > 2.
13.4 13.3 UMPU UMP Tests for Testing Certain Composite Hypotheses
351
f x; = C e
()
Q T x
() ( )
hx.
()
i) For the Binomial case, Q() = log[/(1 )]. Then by setting log[/(1 )] = , the family is brought under the form (28). From this transformation, we get = e/(1 + e ) and the hypotheses 1 2, = 0 become equivalently, 1 2, = 0, where
i = log
i , 1 i
i = 0, 1, 2.
ii) For the Poisson case, Q() = log and the transformation log = brings the family under the form (28). The transformation implies = e and the hypotheses 1 2, = 0 become, equivalently, 1 2, = 0 with i = log i, i = 0, 1, 2. iii) For the Normal case with known and = , Q() = (1/2) and the factor 1/2 may be absorbed into T(x). iv) For the Normal case with known and 2 = , Q() = 1/(2) and the transformation 1/(2) = brings the family under the form (28) again. Since = 1/(2), the hypotheses 1 2 and = 0 become, equivalently, 1 2 and = 0, where i = 1/(2i), i = 0, 1, 2. As an application to Theorem 4 and for later reference, we consider the following example. The level of signicance will be .
EXAMPLE 10
Suppose X1, . . . , Xn are i.i.d. r.v.s from N(, 2). Let be known and set = . Suppose that we are interested in testing the hypothesis H : = 0 against the alternative A : 0. In the present case, T x = so that V z = T x j =
j =1
()
1 x, 2
()
( )
1 2
x
j =1
n x. 2
Therefore, by Theorem 4, the UMPU test is as follows:

1, z = 0 ,
()
if
n x < C1 2 otherwise,
or
n x > C2 2
E Z = , E V Z Z = E V Z .
0 0 0
( )
[ ( ) ( )]
( )
Now can be expressed equivalently as follows:
352
13
Testing Hypotheses
z = 1, 0,
()
if
n x 0
otherwise,
) < C
1
or
n x 0
) > C
where
C1 =
C1
n
n0 n0 C 2 , C2 . = n
On the other hand, under H, n(X 0)/ is N(0, 1). Therefore, because of symmetry C1 = C2 = C, say (C > 0). Also
n x 0
) < C
or
n x 0
) >C
is equivalent to n x 0
>C
and, of course, [n(X 0)/]2 is 2 1, under H. By summarizing then, we have 1, z = 0, n x 0 if otherwise,
()
>C
P 12 > C = .
In many situations of practical importance, the underlying p.d.f. involves a real-valued parameter in which we are exclusively interested, and in addition some other real-valued parameters 1, . . . , k in which we have no interest. These latter parameters are known as nuisance parameters. More explicitly, the p.d.f. is of the following exponential form:
f x; , 1 , . . . , k = C , 1 , . . . , k exp T x
1 1 k k k
[ () + T ( x) + + T ( x )]h( x),
( )
(29)
where , 1, . . . , k are real-valued and h(x) > 0 on a set independent of all parameters involved. Let 0, 1, 2 with 1 < 2. Then the (composite) hypotheses of interest are the following ones, where 1, . . . , k are left unspecied.
13.3 UMP 13.5 Tests Testing forthe Testing Parameters Certainof Composite a Normal Hypotheses Distribution
353
H1 : = H1 : = H 2 : = H 3 : = H : = 4
{ ; } { ; } A ( A) : { ; or } { ; } { }
0 0 1 2 i i 1 2 0
, i = 1, . . . , 4.
(30)
We may now formulate the following theorem, whose proof is omitted.

THEOREM 5
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. given by (29). Then, under some additional regularity conditions, there exist UMPU tests with level of signicance for testing any one of the hypotheses Hi(H1 ) against the alternatives Ai(A 1), i = 1, . . . , 4, respectively. Because of the special role that normal populations play in practice, the following two sections are devoted to presenting simple tests for the hypotheses specied in (30). Some of the tests will be arrived at again on the basis of the principle of likelihood ratio to be discussed in Section 7. However, the optimal character of the tests will not become apparent by that process.
Exercises
13.4.1 A coin, with probability p of falling heads, is tossed independently 100 times and 60 heads are observed. Use the UMPU test for testing the hypothesis H : p = 1 against the alternative A : p 1 at level of signicance = 0.1. 2 2 13.4.2 Let X1, X2, X3 be independent r.v.s distributed as B(1, p). Derive the UMPU test for testing H : p = 0.25 against A : p 0.25 at level of signicance . Determine the test for = 0.05.
13.5 Testing the Parameters of a Normal Distribution

In the present section, X1, . . . , Xn are assumed to be i.i.d. r.v.s from N(, 2), where both and 2 are unknown. One of the parameters at a time will be the parameter of interest, the other serving as a nuisance parameter. Under appropriate reparametrization, as indicated in Remark 5, the family is brought under the form (29). Also the remaining (unspecied) regularity conditions in Theorem 5 can be shown to be satised here, and therefore the conclusion of the theorem holds. All tests to be presented below are UMPU, except for the rst one which is UMP. This is a consequence of Theorem 5 (except again for the UMP test).
354
13
Testing Hypotheses
Whenever convenient, we will also use the notation z and Z instead of (x1, . . . , xn) and (X1, . . . , Xn), respectively. Finally, all tests will be of level .
13.5.1 Tests about the Variance

PROPOSITION 2
For testing H1 : 0 against A1 : > 0, the test given by 1, z = 0,
()
if
(x
n j =1
>C
(31)
otherwise,
2 2 P n 1 > C 0 = ,
(32)
is UMP. The test given by (31) and (32) with reversed inequalities is UMPU for testing H : < 0. 1 : 0 against A1 The power of the tests is easily determined by the fact that (1/2) n j=1 )2 is 2 (X j X n1 when obtains (that is, is the true s.d.). For example, for n = 25, 0 = 3 and = 0.05, we have for H1, C/9 = 36.415, so that C = 327.735. The power of the test at = 5 is equal to P(2 24 > 13.1094) = 0.962. For H1 , C/9 = 13.848, so that C = 124.632, and the power at = 2 is P 2 24 (< 31.158) = 0.8384.
PROPOSITION 3
For testing H2 : 1 or 2, against A2 : 1 < < 2, the test given by 1, z = 0,
()
if C1 < j =1 x j x
n
< C2
(33)
otherwise,
2 2 P C1 i2 < n = , 1 < C 2 i
i = 1, 2,
(34)
is UMPU. The test given by (33) and (34), where the inequalities C1 < n j=1 )2 < C2 are replaced by (x j x
(
j =1
xj x
< C1
or
(x
j =1
> C2 ,
and similarly for (34), is UMPU for testing H3 : 1 2 against A3 : < 1 or > 2. Again, the power of the tests is determined by the fact that 2 2 (1/2) n j = 1 (Xj X ) is n1 when obtains. For example, for H2 and for n = 25, 1 = 2, 2 = 3 and = 0.05, C1, C2 are determined by
2 C1 2 C2 P 24 > P 24 > = 0.05 4 4 P 2 > C1 P 2 > C 2 = 0.05 24 24 9 9
13.3 UMP 13.5 Tests Testing forthe Testing Parameters Certainof Composite a Normal Hypotheses Distribution
355
from the Chi-square tables (by trial and error).

PROPOSITION 4
For testing H4 : = 0 against A4 : 0, the test given by 1, z = 0,
()
if
(x
n j =1
< C1
or
(x
n j =1
> C2
otherwise,
2 c2 0
2 c1 0
g t dt =
()
1 c n 1 c
2 0 2 0
tg t dt = 1 ,
()
g being the p.d.f. of a 2 n1 distribution, is UMPU. The power of the test is determined as in the previous cases. The popular equal tail test is not UMPU; it is a close approximation to the UMPU test when n is large.
REMARK 5
13.5.2 Tests about the Mean

In connection with the problem of testing the mean, UMPU tests exist in a simple form and are explicitly given for the following three cases: 0, 0 and = 0. To facilitate the writing, we set
t z =
()
n x 0
n
) )
2
1 xj x n 1 j =1
(35)
PROPOSITION 5
For testing H1 : 0 against A1 : > 0, the test given by

1, z = 0,
()
if t z > C otherwise,
()
(36)
P t n1 > C = ,
(37)
is UMPU. The test given by (36) and (37) with reversed inequalities is UMPU for testing H1 : 0 against A1 : < 0; t(z) is given by (35). (See also Figs. 13.11 and 13.12; tn1 stands for an r.v. distributed as tn1.) For n = 25 and = 0.05, we have P(t24 > C) = 0.05; hence C = 1.7109 for H1, and C = 1.7109 for H1 .
PROPOSITION 6
For testing H4 : = 0 against A4 : 0, the test given by
1, z = 0,
()
if t z < C otherwise,
()
or t z > C
()
(C > 0)
356
13
Testing Hypotheses
tn 1 0 C C
Figure 13.11 H1 : 0, A1 : > 0.
tn 1 0
Figure 13.12 H 1 : 0, A 1 : < 0 .
P t n1 > C = 2,
is UMPU; t(z) is given by (35). (See also Fig. 13.13.)
tn 1
2 2
Figure 13.13 H4 : = 0, A4 : 0.
For example, for n = 25 and = 0.05, we have C = 2.0639. In both these last two propositions, the determination of the power involves what is known as non-central t-distribution, which is dened in Appendix II.
Exercises
13.5.1 The diameters of bolts produced by a certain machine are r.v.s distributed as N(, 2). In order for the bolts to be usable for the intended purpose, the s.d. must not exceed 0.04 inch. A sample of size 16 is taken and is found that s = 0.05 inch. Formulate the appropriate testing hypothesis problem and carry out the test if = 0.05. 13.5.2 Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2), where both and are unknown. i) Derive the UMPU test for testing the hypothesis H : = 0 against the alternative A : 0 at level of signicance ; )2 = 24.8, and = 0.05. ii) Carry out the test if n = 25, 0 = 2, 25 j = 1 (xj x 13.5.3 Discuss the testing hypothesis problem in Exercise 13.3.4 if both and are unknown.
13.6 13.3 Comparing UMP Tests the forParameters Testing Certain of Two Composite Normal Distributions Hypotheses
357
13.5.4 A manufacturer claims that packages of certain goods contain 18 ounces. In order to check his claim, 100 packages are chosen at random from a large lot and it is found that
x
j =1
100
= 1,752
and
x
j =1
100
2 j
= 31, 157.
Make the appropriate assumptions and test the hypothesis H that the manufacturers claim is correct against the appropriate alternative A at level of signicance = 0.01. 13.5.5 The diameters of certain cylindrical items produced by a machine are r.v.s distributed as N(, 0.01). A sample of size 16 is taken and is found that = 2.48 inches. If the desired value for is 2.5 inches, formulate the approprix ate testing hypothesis problem and carry out the test if = 0.05.
13.6 Comparing the Parameters of Two Normal Distributions

Let X1, . . . , Xm be i.i.d. r.v.s from N(1, 2 1) and let Y1, . . . , Yn be i.i.d. r.v.s from N(2, 2 2). It is assumed that the two random samples are independent and that all four parameters involved are unknown. Set = 1 2 and = 2 2/ 2 1. The problem to be discussed in this section is that of testing certain hypotheses about and . Each time either or will be the parameter of interest, the remaining parameters serving as nuisance parameters. Writing down the joint p.d.f. of the Xs and Ys and reparametrizing the family along the lines suggested in Remark 4 reveals that this joint p.d.f. has the form (29), in either one of the parameters or . Furthermore, it can be shown that the additional (but unspecied) regularity conditions of Theorem 5 are satised and therefore there exist UMPU tests for the hypotheses specied in (30). For some of these hypotheses, the tests have a simple form to be explicitly mentioned below. For convenient writing, we shall employ the notation
Z = X1 , . . . , X m ,
W = Y1 , . . . , Yn
for the Xs and Ys, respectively, and
z = x1 , . . . , xm ,
w = y1 , . . . , yn
for their observed values.
13.6.1 Comparing the Variances of Two Normal Densities

PROPOSITION 7
For testing H1 : 0 against A1 : > 0, the test given by
358
13
Testing Hypotheses
Fn 1, m 1
Fn 1, m 1
C0
0 C0
Figure 13.15 H 1 : 0, A1 : < 0.
Figure 13.14 H1 : 0, A1 : > 0.
1, z, w = 0,
if
j =1 ( y j y ) 2 m i =1 ( xi x )
n
>C
(38)
otherwise,
P Fn1,m1 > C0 = ,
C0 =
(m 1)C , (n 1)
0
(39)
is UMPU. The test given by (38) and (39) with reversed inequalities is UMPU for testing H : 0 against A 1 : < 0. (See also Figs. 13.14 and 13.15; Fn1,m1 stands for an r.v. distributed as Fn1,m1.) The power of the test is easily determined by the fact that
1 n Yj Y 2 2 j =1 1 m Xj X 12 i = 1
n1 = m1
1 m1 n1
(Yj Y )
j =1 m i =1
(Xi X )
is Fn1,m1 distributed when obtains. Thus the power of the test depends only on . For m = 25, n = 21, 0 = 2 and = 0.05, one has P(F20,24 > 5C/12) = 0.05, , hence 5C/12 = 2.0267 and C = 4.8640 for H1; for H1
5C 12 P F20 ,24 < = P F24 ,20 > = 0.05 12 5C
implies 12/5C = 2.0825 and hence C = 1.1525. Now set

1 0
m i =1
V z, w =
( yj y)
j =1 2
( xi x )
1 + 0
( yj y)
j =1
.
2
(40)
Then we have the following result.
13.6 13.3 Comparing UMP Tests the forParameters Testing Certain of Two Composite Normal Distributions Hypotheses
359
PROPOSITION 8

1, z, w = 0,
if V z, w < C1 otherwise,
or V z, w > C 2
where C1, C2 are determined by P C1 < B1 < C 2 = P C1 < B1 < C2 = 1 , 1 1 n1) , ( m1) n+1) , ( m1) ( ( 2 2 2 2 is UMPU; V(z, w) is dened by (40). (Br ,r stands for an r.v. distributed as Beta with r1, r2 degrees of freedom.) For the actual determination of C1, C2, we use the incomplete Beta tables. (See, for example, New Tables of the Incomplete Gamma Function Ratio and of Percentage Points of the Chi-Square and Beta Distributions by H. Leon Harter, Aerospace Research Laboratories, Ofce of Aerospace Research; also, Tables of the Incomplete Beta-Function by Karl Pearson, Cambridge University Press.)
1 2
13.6.2 Comparing the Means of Two Normal Densities

In the present context, it will be convenient to set t z, w = yx
(
m i =1
xi x
+ j =1 y j y
n
(41)
2 2 We shall also assume that 2 1 = 2 = (unspecied).
PROPOSITION 9
For testing H1 : 0 against A1 : > 0, where = 2 1, the test given by
1, z, w = 0,
if t z, w > C otherwise,
(42)
P t m+ n 2 > C0 = , C0 = C
m+n2 , 1 m + 1 n
) ( )
(43)
is UMPU. The test given by (42) and (43) with reversed inequalities is UMPU for testing H : < 0; t(z, w) is given by (41). The determination 1 : 0 against A1 of the power of the test involves a non-central t-distribution, as was also the case in Propositions 5 and 6. For example, for m = 15, n = 10 and = 0.05, one has for H1 : P(t23 > C 23 6 ) = 0.05; hence C 23 6 = 1.7139 and C = 0.1459. For H1 , C = 0.1459.
PROPOSITION 10
360
13
Testing Hypotheses
1, z, w = 0,
if t z, w < C otherwise,
or t z, w > C
P t m+ n 2 > C0 = 2 ,
C0 as above, is UMPU. Again with m = 15, n = 10 and = 0.05, one has P(t23 > C 23 6 ) = 0.025 and hence C 23 6 = 2.0687 and C = 0.1762. Once again the determination of the power of the test involves the noncentral t-distribution. In Propositions 9 and 10, if the variances are not equal, the tests presented above are not UMPU. The problem of comparing the means of two normal densities when the variances are unequal is known as the Behrens Fisher problem. For this case, various tests have been proposed but we will not discuss them here.
REMARK 6
Exercises
13.6.1 Let Xi, i = 1, . . . , 9 and Yj, j = 1, . . . , 10 be independent random 2 samples from the distributions N(1, 2 1) and N(2, 2), respectively. Suppose that the observed values of the sample s.d.s are sX = 2, sY = 3. At level of signicance = 0.05, test the hypothesis: H : 1 = 2 against the alternative A : 1 2 and nd the power of the test at 1 = 2, 2 = 3. (Compute the value of the test statistic, and set up the formulas for determining the cut-off points and the power of the test.) 13.6.2 Let Xj, j = 1, . . . , 4 and Yj, j = 1, . . . , 4 be two independent random 2 samples from the distributions N(1, 2 1) and N(2, 2), respectively. Suppose that the observed values of the X s and Y s are as follows: x1 = 10.1, y1 = 9.0, x 2 = 8.4, y2 = 8.2, x3 = 14.3, y3 = 12.1, x 4 = 11.7, y4 = 10.3.
Test the hypothesis H : 1 = 2 against the alternative A : 1 2 at level of signicance = 0.05. (Compute the value of the test statistic, and set up the formulas for determining the cut-off points and the power of the test.) 13.6.3 Five resistance measurements are taken on two test pieces and the observed values (in ohms) are as follows: x1 = 0.118, y1 = 0.114, x 2 = 0.125, y2 = 0.115, x3 = 0.121, y3 = 0.119, x 4 = 0.117, y4 = 0.120, x5 = 0.120 y5 = 0.110.
Make the appropriate assumptions and test the hypothesis H : 1 = 2 against the alternative A : 1 2 at level of signicance = 0.05. (Compute the value
13.3 UMP Tests for Testing Certain 13.7 Composite Likelihood Hypotheses Ratio Tests
361
of the test statistic, and set up the formulas for determining the cut-off points and the power of the test.) 13.6.4 Refer to Exercise 13.6.2 and suppose it is known that 1 = 4 and 2 = 3. Test the hypothesis H that the two means do not differ by more than 1 at level of signicance = 0.05. 13.6.5 The breaking powers of certain steel bars produced by processes A and B are r.v.s distributed as normal with possibly different means but the same variance. A random sample of size 25 is taken from bars produced by = 65, = 60, sX = 6, y each one of the processes, and it is found that x sY = 7. Test whether there is a difference between the two processes at the level of signicance = 0.05. 13.6.6 Refer to Exercise 13.6.3, make the appropriate assumptions, and test the hypothesis H : 1 = 2 against the alternative A : 1 2 at level of signicance = 0.05. 13.6.7 Let Xi, i = 1, . . . , n and Yi, i = 1, . . . , n be independent random 2 samples from the distributions N(1, 2 1) and N(2, 2), respectively, and suppose that all four parameters are unknown. By setting Zi = Xi Yi, we have that the paired r.v.s Zi, i = 1, . . . , n, are independent and distributed as N(, 2 2) with = 1 2 and 2 = 2 1 + 2. Then one may use Propositions 5 and 6 to test hypotheses about . Test the hypotheses H1 : 0 against A1 : > 0 and H2 : = 0 against A2 : 0 at level of signicance = 0.05 for the data given in (i) Exercise 13.6.2; (ii) Exercise 13.6.3.
13.7 Likelihood Ratio Tests

Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), r and let . Set L() = f(x1; ) f(xn; ) whenever , and L(c) = f(x1; ) f(xn; ) when is varying over c. Now, when both and c consist of a single point, then L() and L(c) are completely determined and for testing H : against A : c, the MP test rejects when the likelihood ratio (LR) L(c)/L() is too large (greater than or equal to a constant C determined by the size of the test.) However, if and c contain more than one point each, then neither L() nor L(c) is determined by H and A and the above method of testing does not apply. The problem can be reduced to it though by the following device. L() ) = max[L(); ] and L(c) is to be replaced by is to be replaced by L( c ) = max[L(); c]. Then for setting up a test, one would compare the L( ) and L( c). In practice, however, the statistic L( c)/L() is quantities L( c ), where, of course, L() = max[L(); ]. )/L( used rather than L( (When we talk about a statistic, it will be understood that the observed values have been replaced by the corresponding r.v.s although the same notation will ) is too small, )/L( be employed.) In terms of this statistic, one rejects H if L( that is, C, where C is specied by the desired size of the test. For obvious reasons, the test is called a likelihood ratio (LR) test. Of course, the test
362
13
Testing Hypotheses
specied by the NeymanPearson fundamental lemma is also a likelihood ratio test. ) is too Now the likelihood ratio test which rejects H whenever L( )/L( small has an intuitive interpretation, as follows: The quantity L( ) and the )dx1 dxn for the discrete and continuous case, reprobability element L( spectively, is the maximum probability of observing x1, . . . , xn if lies in . ) and L( )dx1 dxn represent the maximum probability for Similarly, L( the discrete and continuous case, respectively, of observing x1, . . . , xn without ) , as specied by H, the quantities L( restrictions on . Thus, if ) and L( will tend to be close together (by an assumed continuity (in ) of the likelihood function L( | x1, . . . , xn)), and therefore will be close to 1. Should be too far away from 1, the data would tend to discredit H, and therefore H is to be rejected. ) has been in wide use. (Notice that 0 < 1.) The notation = L( )/L( Also the statistic 2 log rather than itself is employed, the reason being that, under certain regularity conditions, the asymptotic distribution of 2 log , under H, is known. Then in terms of this statistic, one rejects H whenever 2 log > C, where C is determined by the desired level of the test. Of course, this test is equivalent to the LR test. In carrying out the likelihood ratio test in actuality, one is apt to encounter two sorts of difculties. First is the problem of determining the cut-off point C and second is the problem of ). The rst difculty is removed at the actually determining L( ) and L( asymptotic level, in the sense that we may use as an approximation (for sufciently large n) the limiting distribution of 2 log for specifying C. The ) is essentially that of nding the MLE of . Calculating problem of nding L( L( ) is a much harder problem. In many cases, however, H is simple and then no problem exists. In spite of the apparent difculties that a likelihood ratio test may present, it does provide a unied method for producing tests. Also in addition to its intuitive interpretation, in many cases of practical interest and for a xed sample size, the likelihood ratio test happens to coincide with or to be close to other tests which are known to have some well dened optimal properties such as being UMP or being UMPU. Furthermore, under suitable regularity conditions, it enjoys some asymptotic optimal properties as well. In the following, a theorem referring to the asymptotic distribution of 2 log is stated (but not proved) and then a number of illustrative examples are discussed.
THEOREM 6
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), , where is an r-dimensional subset of r and let be an m-dimensional subset of . Suppose also that the set of positivity of the p.d.f. does not depend on . Then under some additional regularity conditions, the asymptotic distribution of 2 log is 2 rm, ; that is, as n , provided
P 2 log x G x ,
()
x 0 for all ,
363
where G is the d.f. of a 2 rm distribution. Since in using the LR test, or some other test equivalent to it, the alternative A species that c , this will not have to be mentioned explicitly in the sequel. Also the level of signicance will always be .
EXAMPLE 11
(Testing the mean of a normal distribution) Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2), and consider the following testing hypotheses problems. i) Let be known and suppose we are interested in testing the hypothesis H : = { 0}. = x (see Example 12, Chapter 12), we have Since the MLE of is = L and = L
( )
1 2
)
n
1 exp 2 2
(x
j =1
2 x
( )
1 2
1 exp 2 2
(x
j =1
2 0 .
In this example, it is much easier to determine the distribution of 2 log rather than that of . In fact, 2 log = and the LR test is equivalent to 1, z = 0, n x 0 if otherwise, n x 0 2
()
>C
P 12 > C = .
(Recall that z = (x1, . . . , xn).) Notice that this is consistent with Theorem 6. It should also be pointed out that this test is the same as the test found in Example 10 and therefore the present test is also UMPU. ii) Consider the same problem as in (i) but suppose now that is also unknown. We are still interested in testing the hypothesis H : = 0 which now is composite, since is unspecied.
364
13
Testing Hypotheses
Now the MLEs of 2, under = { = (, ); , > 0} and = { = (, ); = 0, > 0} are, respectively, 1 n 2 = xj x n j =1
2 and =
1 n x j 0 n j =1
(see Example 12, Chapter 12). Therefore = L
( )
1 2
)
n
1 exp 2 2
(x
j =1
2 x =
( (
0
1 2
) )
e n
and = L
( )
1 2
1 exp 2 2
(x
j =1
2 0 =
1 2
e n 2 .
Then 2 = 2 But
n 2
or
2 n
(x x ) = (x )
n j=1 j n j=1 j
2 2
(x
j =1
) = (x
2 j =1
+ n x 0
and therefore
2 n
2 n x 0 1 = 1+ n1 1 n xj x n 1 j =1
t2 = 1 + , n 1
where t =t z =
()
n x 0
) )
2
1 n xj x n 1 j =1
Then < 0 is equivalent to t2 > C for a certain constant C. That is, the LR test is equivalent to the test
1, z = 0,
()
if t < C otherwise,
or t > C
365
P t n1 > C = 2.
Notice that, by Proposition 6, the test just derived is UMPU.
EXAMPLE 12
(Comparing the parameters of two normal distributions) Let X1, . . . , Xm be 2 i.i.d. r.v.s from N(1, 2 1) and Y1, . . . , Yn be i.i.d. r.v.s from N(2, 2). Suppose that the Xs and Ys are independent and consider the following testing hypotheses problems. In the present case, the joint p.d.f. of the Xs and Ys is given by
( )
2
m +n
1 1 exp 2 m n 1 2 2 1
(x )
i 1 i =1
1 2 2 2
(y
j =1
2 2 .
i) Assume that 1 = 2 = unknown and we are interested in testing the hypothesis H : 1 = 2 (= unspecied). Under = { = (1, 2, ); 1, 2 , > 0}, the MLEs of the parameters involved are given by
2 1, = x , 2 , = y , =
1 m xi x m+ n i =1
) + (y
2 j =1
2 y ,
as is easily seen. Therefore
= L
( )
1 2
m +n
m +n
Under = { = (1, 2, ); 1 = 2 , > 0}, we have =

n mx + ny 1 m , + x yj = i m + n i =1 m+ n j =1
and by setting k = xk, k = 1, . . . , m and m+k = yk, k = 1, . . . , n, one has
=
and
2 =
n 1 m +n 1 m k = + x yj = i m + n k =1 m + n i =1 j =1
1 m +n vk v m + n k =1
1 m xi m+ n i =1
) + (y
2 j =1
2 .
Therefore
= L
It follows that
( )
1 2
m +n
m +n
366
13
Testing Hypotheses
m +n
and
2 m +n
2 . 2
Next
) = [( xi x ) + ( x )] = ( xi x ) ( xi
m 2 m
i =1
i =1 m
i =1
+m x
= xi x
i =1
mn 2
(m + n)
j
(x y) ,
2
and in a similar manner
(y
j =1
) = (y
2 j =1
m2 n
(m + n)
m
(x y) ,
2 2 n
so that (m + n) = (m + n)
2 2
mn xy m+ n
) = (x x) + (y
2 i i =1 j =1
+ It follows then that
2 mn xy . m+ n
where t= mn xy m+ n
2 m+ n
t2 = 1 + , m + n 2
m 1 xi x m+ n 2 i =1
) + (y
2 j =1
2 y .
Therefore the LR test which rejects H whenever < 0 is equivalent to the following test:
1, z, w = 0,
if t < C otherwise,
or t > C
(C > 0)
P t m+ n 2 > C = 2,
and z = (x1, . . . , xm), w = (y1, . . . , yn), because, under H, t is distributed as tm+n2. We notice that the test above is the same as the UMPU test found in Proposition 10.
367
ii) Now we are interested in testing the hypothesis H : 1 = 2 (= unspecied). Under = { = (1, 2, 1, 2); 1, 2 , 1, 2 > 0}, we have
1 m 1, = x , 2 , = y , 12, = xi x m i =1
and v 2 1 n 2 2 = yj y , , n j =1
while under = { = (1, 2, 1, 2); 1, 2 , 1 = 2 > 0}, 1, = 1, , 2 , = 2 , and

2 =
1 m xi x m+ n i =1
) + (y
2 j =1
2 y .
Therefore
= L
( )
( 2 ) ( ) ( )
m +n 2 1 , m 2 2 2 ,
n 2
m +n
and
= L
so that
( )
( 2 ) ( )
m +n 2
1 ( m +n ) 2 e , ( m +n ) 2
( ) ( ) = ( )( )
2 1 , m 2 2 2 , 2 m +n 2
n 2
(m + n)(
m +n
) 2 m xi x i =1
) (y
2 n j =1
2 y n
m 2
m mm 2 nn 2 xi x i =1
2 n + j = 1 y j y
) (
j =1
2 yj y
( m +n )
( m + n) ( =
m +n 2
mm 2 nn
2 m m 1 i = 1 xi x m 1 2 n n1 j = 1 y j y n 1
( (
) )
m 2
2 m 1 + m 1 i = 1 xi x m 1 2 n n1 j = 1 y j y n 1
( (
) )
( m +n )
368
13
Testing Hypotheses
(m + n)
( n+ m)
m m 2 nn 2
m1 n1
m 2
m1 f 1 + n1
( m+ n)
2 )2/(m 1)]/[n where f = [m i = 1(xi x j = 1(yj y) /(n 1)]. Therefore the LR test, which rejects H whenever < 0, is equivalent to the test based on f and rejecting H if
m1 n1
m 2
m1 f 1 + n1
( m+ n)
<C
for a certain constant C.
Setting g( f ) for the left hand side of this last inequality, we have that g(0) = 0 and g(f ) 0 as f . Furthermore, it can be seen (see Exercise 13.7.4) that g(f ) has a maximum at the point
fmax =
( ); n( m 1)
m n1
f < C1 or f > C2
it is increasing between 0 and fmax and decreasing in (fmax, ). Therefore

g f < C if and only if
()
for certain specied constants C1 and C2. Now, if in the expression of f the xs and ys are replaced by Xs and Ys, respectively, and denote by F the resulting statistic, it follows that, under H, F is distributed as Fm1,n1. Therefore the constants C1 and C2 are uniquely determined by the following requirements:
P Fm1,n1 < C1 or
Fm1,n1 > C 2 =
and g C1 = g C 2 .
( ) ( )
However, in practice the C1 and C2 are determined so as to assign probability /2 to each one of the two tails of the Fm1,n1 distribution; that is, such that
P Fm1,n1 < C1 = P Fm1,n1 > C 2 = 2.
(See also Fig. 13.16.)

Fm 1, n 1
2 2
Figure 13.16
0 C1
C2
369
Exercises
13.7.1 Refer to Exercise 13.4.2 and use the LR test to test the hypothesis H : p = 0.25 against the alternative A : p 0.25. Specically, set (t) for the likelihood function, where t = x1 + x2 + x3, and: i) Calculate the values (t) for t = 0, 1, 2, 3 as well as the corresponding probabilities under H; ii) Set up the LR test, in terms of both (t) and t; iii) Specify the (randomized) test of level of signicance = 0.05; iv) Compare the test in part (iii) with the UMPU test constructed in Exercise 13.4.2. 13.7.2 A coin, with probability p of falling heads, is tossed 100 times and 60 heads are observed. At level of signicance = 0.1: i) Test the hypothesis H : p = 1 against the alternative A : p 1 by using the 2 2 LR test and employ the appropriate approximation to determine the cutoff point; ii) Compare the cut-off point in part (i) with that found in Exercise 13.4.1. 13.7.3 If X1, . . . , Xn are i.i.d. r.v.s from N(, 2), derive the LR test and the test based on 2 log for testing the hypothesis H : = 0 rst in the case that is known and secondly in the case that is unknown. In the rst case, compare the test based on 2 log with that derived in Example 11. 13.7.4 Consider the function
m1 t n1 m1 t 1 + n1
m 2
gt =
()
( m+ n)
t 0, m, n 2, integers, and show that g(t) 0 as t ,

max g t ; t 0 =
[ ()
[1 + (m n)](
mm 2
m+ n 2
and that g is increasing in
m n1 0, n m1
( (
) )
m n 1 and decreasing in , . n m 1
( (
) )
370
13
Testing Hypotheses
13.8 Applications of LR Tests: Contingency Tables, Goodness-of-Fit Tests

Now we turn to a slightly different testing hypotheses problem, where the LR is also appropriate. We consider an r. experiment which may result in k possibly different outcomes denoted by Oj, j = 1, . . . , k. In n independent repetitions of the experiment, let pj be the (constant) probability that each one of the trials will result in the outcome Oj and denote by Xj the number of trials which result in Oj, j = 1, . . . , k. Then the joint distribution of the Xs is the Multinomial distribution, that is,
P X1 = x1 , . . . , X k = x k =
where xj 0, j = 1, . . . , k, k j = 1xj = n and
n! x p1x pk , x1! x k !
1 k
= = p1 , . . . , pk ; p j > 0, j = 1, . . . , k,
p
j =1
= 1.
We may suspect that the ps have certain specied values; for example, in the case of a die, the die may be balanced. We then formulate this as a hypothesis and proceed to test it on the basis of the data. More generally, we may want to test the hypothesis that lies in a subset of . Consider the case that H : = {0} = {(p10, . . . , pk0)}. Then, under ,
= L
( )
n! x x pk p10 0, x1! x k !
1 k
while, under ,
= L
( )
n! x 1x p k , p x1! x k !
1 k
j = xj/n are the MLEs of pj, j = 1, . . . , k (see Example 11, Chapter 12). where p Therefore p = n j 0 j =1 x j
k n xj
and H is rejected if 2 log > C. The constant C is determined by the fact that 2 log is asymptotically 2 k1 distributed under H, as it can be shown on the basis of Theorem 6, and the desired level of signicance . Now consider r events Ai, i = 1, . . . , r which form a partition of the sample space S and let {Bj, j = 1, . . . , s} be another partition of S. Let pij = P(Ai Bj) and let pi . = pij , p. j = pij .
j =1 i =1 s r
13.8 Applications 13.3of UMP LR Tests: TestsContingency for Testing Certain Tables,Composite Goodness-of-Fit Hypotheses Tests
371
Then, clearly, pi. = P(Ai), p.j = P(Bj) and
p = p
i. i =1 j =1
.j
= pij = 1.
i =1 j =1
Furthermore, the events {A1, . . . , Ar} and {B1, . . . , Bs} are independent if and only if pij = pi. p.j, i = 1, . . . , r, j = 1, . . . , s. A situation where this set-up is appropriate is the following: Certain experimental units are classied according to two characteristics denoted by A and B and let A1, . . . , Ar be the r levels of A and B1, . . . , Br be the J levels of B. For instance, A may stand for gender and A1, A2 for male and female, and B may denote educational status comprising the levels B1 (elementary school graduate), B2 (high school graduate), B3 (college graduate), B4 (beyond). We may think of the rs events Ai Bj being arranged in an r s rectangular array which is known as a contingency table; the event Ai Bj is called the (i, j)th cell. Again consider n experimental units classied according to the characteristics A and B and let Xij be the number of those falling into the (i, j)th cell. We set Xi . = X ij
j =1 s
and X . j = X ij .
i =1
It is then clear that
X
i =1
i.
= X . j = n.
j =1
Let = (pij, i = 1, . . . , r, j = 1, . . . , s). Then the set of all possible values of is an (rs 1)-dimensional hyperplane in rs. Namely, = { = (pij, i = 1, . . . , r, j = 1, . . . , s) rs; pij > 0, i = 1, . . . , r, j = 1, . . . , s, ir= 1 s j = 1 pij = 1}. Under the above set-up, the problem of interest is that of testing whether the characteristics A and B are independent. That is, we want to test the existence of probabilities pi, qj, i = 1, . . . , r, j = 1, . . . , s such that H : pij = piqj, i = 1, . . . , r, j = 1, . . . , s. Since for i = 1, . . . , r 1 and j = 1, . . . , s 1 we have the r + s 2 independent linear relationships
p
j =1
ij
= pi ,
p
i =1
ij
= qj ,
it follows that the set , specied by H, is an (r + s 2)-dimensional subset of . Next, if xij is the observed value of Xij and if we set xi . = xij , x. j = xij ,
j =1 i =1 s r
372
13
Testing Hypotheses
the likelihood function takes the following forms under and , respectively. Writing i,j instead of ir= 1 js= 1, we have L = L = since
( ) n!x ! p
i ,j ij i ,j
ij ij
xij ij
, n! x pi x ! i , j ij i x qj j
.j
( ) n!x ! ( p q )
i j i ,j ij i ,j
xij
n! x x pi q j = x ! i , j ij i , j
i.
pi ,
i j
xij
x q j = pi q j = pix q!x q s xij xij xij

i i1
is
x x x = pix q1 qs = pi i i i
i i1 is
x qj j
Now the MLEs of pij, pi and qi are, under and , respectively, ij ,W = p xij n i , = , p x xi . j , = . j , , q n n
x n! xi . n i , j xij ! i
as is easily seen (see also Exercise 13.8.1). Therefore

= L
( )
xij n! = , L n i , j xij ! i , j
xij
( )
i.
x x . j j n
.j
and hence
x xi . x x. j i . . j i n j n xij i ,j n
xij
x j xi xi . x j j i nn xij ij
x i ,j
It can be shown that the (unspecied) assumptions of Theorem 6 are fullled in the present case and therefore 2 log is asymptotically 2 f, under , where f = (rs 1) (r + s 2) = (r 1)(s 1) according to Theorem 6. Hence the test for H can be carried out explicitly. Now in a multinomial situation, as described at the beginning of this section and in connection with the estimation problem, it was seen (see Section 12.9, Chapter 12) that certain chi-square statistics were appropriate, in a sense. Recall that
=
2
(X
np j np j
j =1
373
This 2 r.v. can be used for testing the hypothesis
H : = 0 = p10 , . . . , pk 0 , where = (p1, . . . , pk). That is, we consider
{ } (
k
=
2 j =1
(x
npj 0 npj 0
and reject H if 2 is too large, in the sense of being greater than a certain constant C which is specied by the desired level of the test. It can further be 2 shown that, under , 2 is asymptotically distributed as k1. In fact, the present test is asymptotically equivalent to the test based on 2 log . For the case of contingency tables and the problem of testing independence there, we have
=
2 i ,j
(x
ij
npi q j npi q j
where is as in the previous case in connection with the contingency tables. However, 2 is not a statistic since it involves the parameters pi, qj. By replacing them by their MLEs, we obtain the statistic
=
2 i ,j
(x
ij
i , p j , np i , q j , np
2 2 By means of , one can test H by rejecting it whenever > C. The constant C is to be determined by the signicance level and the fact that the asymptotic 2 2 distribution of , under , is f with f = (r 1)(s 1), as can be shown. Once more this test is asymptotically equivalent to the corresponding test based on 2 log . Tests based on chi-square statistics are known as chi-square tests or goodness-of-t tests for obvious reasons.
Exercises
ij , = 13.8.1 Show that p this section.
xij n
i , = , p
xi . n
j , = , q
x j n
as claimed in the discussion in
In Exercises 13.8.213.8.9 below, the test to be used will be the appropriate 2 test. 13.8.2 Refer to Exercise 13.7.2 and test the hypothesis formulated there at the specied level of signicance by using a 2-goodness-of-t test. Also, compare the cut-off point with that found in Exercise 13.7.2(i).
374
13
Testing Hypotheses
13.8.3 A die is cast 600 times and the numbers 1 through 6 appear with the frequencies recorded below.
1 100
2 94
3 103
4 89
5 110
6 104
At the level of signicance = 0.1, test the fairness of the die. 13.8.4 In a certain genetic experiment, two different varieties of a certain species are crossed and a specic characteristic of the offspring can only occur at three levels A, B and C, say. According to a proposed model, the probabili1 3 8 , 12 and 12 , respectively. Out of 60 offsprings, 6, 18, ties for A, B and C are 12 and 36 fall into levels A, B and C, respectively. Test the validity of the proposed model at the level of signicance = 0.05. 13.8.5 Course work grades are often assumed to be normally distributed. In a certain class, suppose that letter grades are given in the following manner: A for grades in [90, 100], B for grades in [75, 89], C for grades in [60, 74], D for grades in [50, 59] and F for grades in [0, 49]. Use the data given below to check the assumption that the data is coming from an N(75, 92) distribution. For this purpose, employ the appropriate 2 test and take = 0.05.
A 3
B 12
C 10
D 4
F 1
13.8.6 It is often assumed that I.Q. scores of human beings are normally distributed. Test this claim for the data given below by choosing appropriately the Normal distribution and taking = 0.05. x 90 90 < x 100 100 < x 110 110 < x 120 120 < x 130 x > 130 10 18 23 22 18 9
(Hint: Estimate and 2 from the grouped data; take the midpoints for the nite intervals and the points 65 and 160 for the leftmost and rightmost intervals, respectively.) 13.8.7 Consider a group of 100 people living and working under very similar conditions. Half of them are given a preventive shot against a certain disease and the other half serve as control. Of those who received the treatment, 40 did not contract the disease whereas the remaining 10 did so. Of those not treated, 30 did contract the disease and the remaining 20 did not. Test effectiveness of the vaccine at the level of signicance = 0.05.
13.3 13.9 UMP Decision-Theoretic Tests for Testing Viewpoint Certain Composite of Testing Hypotheses
375
13.8.8 On the basis of the following scores, appropriately taken, test whether there are gender-associated differences in mathematical ability (as is often claimed!). Take = 0.05. Boys: 80 96 98 87 75 83 70 92 97 82 Girls: 82 90 84 70 80 97 76 90 88 86 (Hint: Group the grades into the following six intervals: [70, 75), [75, 80), [80, 85), [85, 90), [90, 100).) 13.8.9 From each of four political wards of a city with approximately the same number of voters, 100 voters were chosen at random and their opinions were asked regarding a certain legislative proposal. On the basis of the data given below, test whether the fractions of voters favoring the legislative proposal under consideration differ in the four wards. Take = 0.05.
WARD 1 Favor Proposal Do not favor proposal Totals 37 63 100 2 29 71 100 3 32 68 100 4 21 79 100
Totals
119 281 400
13.8.10 Let X1, . . . , Xn be independent r.v.s with p.d.f. f(; ), r. For testing a hypothesis H against an alternative A at level of signicance , a test is said to be consistent if its power , evaluated at any xed , converges to 1 as n . Refer to the previous exercises and nd at least one test which enjoys the property of consistency. Specically, check whether the consistency property is satised with regards to Exercises 13.2.3 and 13.3.2.
13.9 Decision-Theoretic Viewpoint of Testing Hypotheses

For the denition of a decision, loss and risk function, the reader is referred to Section 6, Chapter 12. Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), r, and let be a (measurable) subset of . Then the hypothesis to be tested is H : against c. Let B be a critical region. Then by setting z = (x1, . . . , the alternative A : xn), in the present context a non-randomized decision function = (z) is dened as follows:
1, (z ) = 0, if z B otherwise.
376
13
Testing Hypotheses
We shall conne ourselves to non-randomized decision functions only. Also an appropriate loss function, corresponding to , is of the following form:
0, L ; = L1 , L2 ,
if and = 0, or c and = 1. if and = 1 if c and = 0,
where L1, L2 > 0. Clearly, a decision function in the present framework is simply a test function. The notation instead of could be used if one wished. By setting Z = (X1, . . . , Xn), the corresponding risk function is
R ; = L ; 1 P Z B + L ; 0 P Bc ,
or
) ( ) (
)
) (
)
) (
L1P Z B , if R ; = (44) c L2 P Z B , if c . c In particular, if = {0}, = {1} and P (Z B) = , P (Z B) = , we have
if = 0 L1 , (45) R ; = L 1 , if = 1 . 2 As in the point estimation case, we would like to determine a decision function for which the corresponding risk would be uniformly (in ) smaller than the risk corresponding to any other decision function *. Since this is not feasible, except for trivial cases, we are led to minimax decision and Bayes decision functions corresponding to a given prior p.d.f. on . Thus in the case that = {0} and c = {1}, is minimax if
max R 0 ; , R 1 ; max R 0 ; * , R 1 ; *
[(
) (
)]
[(
) (
)]
for any other decision function *. Regarding the existence of minimax decision functions, we have the result below. The r.v.s X1, . . . , Xn is a sample whose p.d.f. is either f(; 0) or else f(; 1). By setting f0 = f(; 0) and f1 = f(; 1), we have
THEOREM 7
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), = {0, 1}. We are interested in testing the hypothesis H : = 0 against the alternative A : = 1 at level . Dene the subset B of n as follows: B = {z n; f(z; 1) > Cf(z; 0)} and assume that there is a determination of the constant C such that
L1P0 Z B = L2 P1 Z Bc
) (equivalently, R( ; ) = R( ; )).
0 1
(46)
Then the decision function dened by
377
1, z = 0,
()
if
z B
otherwise,
(47)
is minimax.
PROOF
For simplicity, set P0 and P1 for P and P , respectively, and similarly R(0; ), R(1; ) for R(0; ) and R(1; ). Also set P0(Z B) = and P1(Z Bc) = 1 . The relation (45) implies that
0 1
R 0; = L1
and R 1; = L2 1 .
n
( )
(
Let A be any other (measurable) subset of and let * be the corresponding decision function. Then
R 0; * = L1P0 Z A
)
(
and R 1; * = L2 P1 Z Ac .
Consider R(0; ) and R(0; *) and suppose that R(0; *) R(0; ). This is equivalent to L1P0(Z A) L1P0(Z B), or
P0 Z A .
Then Theorem 1 implies that P1(Z A) P1(Z B) because the test dened by (47) is MP in the class of all tests of level . Hence
P1 Z Ac P1 Z Bc , or L2 P1 Z Ac L2 P1 Z Bc ,
) (
)
or equivalently, R(1; *) R(1; ). That is, if

R 0; * R 0; , then R 1; R 1; * .
( )
(48)
Since by assumption (0; ) = (1; ), we have
max R 0; * , R 1; * = R 1; * R 1; = max R 0; , R 1; ,
(49) whereas if R(0; ) < R(0; *), then
[(
) (
)]
( )
[ ( ) ( )]
max R 0; * , R 1; * R 0; * > R 0; = max R 0; , R 1; .

(50) Relations (49) and (50) show that is minimax, as was to be seen. It follows that the minimax decision function dened by (46) is an LR test and, in fact, is the MP test of level P0 (Z B) constructed in Theorem 1.
REMARK 7
[(
) (
)] (
[ ( ) ( )]
We close this section with a consideration of the Bayesian approach. In connection with this it is shown that, corresponding to a given p.d.f. on = {0, 1}, there is always a Bayes decision function which is actually an LR test. More precisely, we have
378
13
Testing Hypotheses
THEOREM 8
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ), = {0, 1} and let 0 = {p0, p1} (0 < p0 < 1) be a probability distribution on . Then for testing the hypothesis H : = 0 against the alternative A : = 1, there exists a Bayes decision function corresponding to 0 = {p0, p1}, that is, a decision rule which minimizes the average risk R(0; )p0 + R(1; )p1, and is given by
0
1, z = 0,
0
()
if z B otherwise,
where B = {z Rn; f(z; 1) > Cf(z; 0)} and C = p0L1/p1L2.

PROOF
Let R () be the average risk corresponding to 0. Then by virtue of (44), and by employing the simplied notation used in the proof of Theorem 7, we have
0
R = L1P0 Z B p0 + L2 P1 Z Bc p1
0
()
= p0 L1P0 Z B + p1L2 1 P1 Z B
= p1L2 + p0 L1P0 Z B p1L2 P1 Z B

p1L2 + p0 L1 f z; 0 p1L2 f z; 1 dz
B
)]
)]
(51)
)]
for the continuous case and equal to

p1L2 + p0 L1 f z; 0 p1L2 f z; 1
zB
)]
0
for the discrete case. In either case, it follows that the which minimizes R () is given by
1, z = 0,
0
()
if
p0 L1 f z; 0 p1L2 f z; 1 < 0
otherwise;
equivalently,
1, z = 0,
0
()
if
z B otherwise,
where
pL B = z n ; f z; 1 > 0 1 f z; 0 , p1L2
as was to be seen. It follows that the Bayesian decision function is an LR test and is, in fact, the MP test for testing H against A at the level P0(Z B), as follows by Theorem 1.
REMARK 8
379
The following examples are meant as illustrations of Theorems 7 and 8.

EXAMPLE 13
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 1). We are interested in determining the minimax decision function for testing the hypothesis H : = 0 against the alternative A : = 1. We have
( ) = exp[n( )x ] , 1 f ( z; ) exp n( )
f z; 1
0 1 0
2 1
2 0
so that f(z; 1) > Cf(z; 0) is equivalent to
1 exp n 1 0 x > C exp n 12 02 or 2
[(
)]
(
x > C0 ,
where
C0 = 1 log C 1 + 0 + 2 n 1 0
(for > ).
1 2
Then condition (46) becomes
L1P X > C0 = L2 P X C0 .
0 1
As a numerical example, take 0 = 0, 1 = 1, n = 25 and L1 = 5, L2 = 2.5. Then

L1 P 0 X > C0 = L2 P 1 X < C0
becomes
P 1 X < C0 = 2P0 X > C0 ,
or
P
1
n X 1 < 5 C0 1 = 2 P
) (
)]
n X 0 > 5C0 ,
or
5C0 5 = 2 1 5C0 , or 2 5C0 5 5C0 = 1

Hence C0 = 0.53, as is found by the Normal tables. Therefore the minimax decision function is given by
) [
( )]
( ) (
1, z = 0,
()
if x > 0.53 otherwise.
The type-I error probability of this test is
P X > 0.53 = P N 0, 1 > 0.53 5 = 1 2.65 = 1 0.996 = 0.004

0
) [ (
380
13
Testing Hypotheses
and the power of the test is

P 1 X > 0.53 = P N 0, 1 > 5 0.53 1 = 2.35 = 0.9906.
) [ (
) (
)]
Therefore relation (44) gives

R 0 ; = 5 0.004 = 0.02 and R 1 ; = 2.5 0.009 = 0.0235.
Thus
max R 0 ; , R 1 ; = 0.0235,
corresponding to the minimax given above.
EXAMPLE 14
[(
) (
)]
Refer to Example 13 and determine the Bayes decision function corresponding to 0 = {p0, p1 }. From the discussion in the previous example it follows that the Bayes decision function is given by
1, z = 0,
0
()
if
x > C0
otherwise,
where
C0 =
1 log C 1 + 0 + 2 n 1 0
and C
p0 L1 . p1L2
2 Suppose p0 = 3 , p1 = 1 . Then C = 4 and C0 = 0.555451 (0.55). Therefore the 3 2 1 Bayes decision function corresponding to 0 = { 3 , 3 } is given by
1, z = 0,
0
()
if x > 0.55 otherwise.

0
> 0.55) = P[N(0, 1) > 2.75] = The type-I error probability of this test is P (X > 0.55) = P[N(1, 1) > 1 (2.75) = 0.003 and the power of the test is P (X 2.25] = (2.25) = 0.9878. Therefore relation (51) gives that the Bayes risk 2 corresponding to { 3 , 1 } is equal to 0.0202. 3
1
EXAMPLE 15
Let X1, . . . , Xn be i.i.d. r.v.s from B(1, ). We are interested in determining the minimax decision function for testing H : = 0 against A : = 1. We have
( ) = f ( z; )
f z; 1
0
1 1 0 1 0
1
n x
, where x = x j ,
j =1
so that f(z; 1) > Cf(z; 0) is equivalent to

x log
(1 ) > C , (1 )
0 1 0 0 1
381
where
C 0 = log C n log
1 1 . 1 0
Let now 0 = 0.5, 1 = 0.75, n = 20 and L1 = 1071/577 1.856, L2 = 0.5. Then
(1 ) = 3 (1 )
0 1 0 1
( > 1)
( ). (1 )
1 1 0
0 1
and therefore f(z; 1) > Cf(z; 0) is equivalent to x > C0, where

1 1 C0 = log C n log 1 0
n j=1
log
Next, X = Xj is B(n, ) and for C0 = 13, we have P0.5(X > 13) = 0.0577 and P0.75(X > 13) = 0.7858, so that P0.75(X 13) = 0.2142. With the chosen values of L1 and L2, it follows then that relation (46) is satised. Therefore the minimax decision function is determined by
1, (z ) = 0,
if x > 13 otherwise.
Furthermore, the minimax risk is equal to 0.5 0.2142 = 0.1071.
382
14
Sequential Procedures
Chapter 14
14.1 Some Basic Theorems of Sequential Sampling

In all of the discussions so far, the random sample Z1, . . . , Zn, say, that we have dealt with was assumed to be of xed size n. Thus, for example, in the point estimation and testing hypotheses problems the sample size n was xed beforehand, then the relevant random experiment was supposed to have been independently repeated n times and nally, on the basis of the outcomes, a point estimate or a test was constructed with certain optimal properties. Now, whereas in some situations the random experiment under consideration cannot be repeated at will, in many other cases this is, indeed, the case. In the latter case, as a rule, it is advantageous not to x the sample size in advance, but to keep sampling and terminate the experiment according to a (random) stopping time.
DEFINITION 1
Let {Zn} be a sequence of r.v.s. A stopping time (dened on this sequence) is a positive integer-valued r.v. N such that, for each n, the event (N = n) depends on the r.v.s Z1, . . . , Zn alone. In certain circumstances, a stopping time N is also allowed to take the value but with probability equal to zero. In such a case and when forming EN, the term 0 appears, but that is interpreted as 0 and no problem arises.
REMARK 1
Next, suppose we observe the r.v.s Z1, Z2, . . . one after another, a single one at a time (sequentially), and we stop observing them after a specied event occurs. In connection with such a sampling scheme, we have the following denition.
DEFINITION 2
A sampling procedure which terminates according to a stopping time is called a sequential procedure.
382
14.1
Some Basic Theorems of Sequential Sampling
383
Thus a sequential procedure terminates with the r.v. ZN, where ZN is dened as follows: the value of Z N at s S is equal to Z N ( s ) s . Quite often the partial sums SN = Z1 + + ZN dened by S N s = Z1 s + + Z N ( s ) s ,
()
(1)
()
()
()
s S
(2)
are of interest and one of the problems associated with them is that of nding the expectation ESN of the r.v. SN. Under suitable regularity conditions, this expectation is provided by a formula due to Wald.
THEOREM 1
(Walds lemma for sequential analysis) For j 1, let Zj be independent r.v.s (not necessarily identically distributed) with identical rst moments such that E|Zj| = M < , so that EZj = is also nite. Let N be a stopping time, dened on the sequence {Zj}, j 1, and assume that EN is nite. Then E|SN| < and ESN = EN, where SN is dened by (2) and ZN is dened by (1). The proof of the theorem is simplied by rst formulating and proving a lemma. For this purpose, set Yj = Zj , j 1. Then the r.v.s Y1, Y2, . . . are independent, EYj = 0 and have (common) nite absolute moment of rst order to be denoted by m; that is, E|Yj| = m < . Also set TN = Y1 + + YN, where YN and TN are dened in a way similar to the way ZN and SN are dened by (1) and (2), respectively. Then we will show that
ETN < and ETN = 0.
(3)
In all that follows, it is assumed that all conditional expectations, given N = n, are nite for all n for which P(N = n) > 0. We set E(Yj|N = n) = 0 (accordingly, E(|Yj||N = n) = 0 for those ns for which P(N = n) = 0).
LEMMA 1
In the notation introduced above:

i) j = 1 n = jE(|Yj||N = n)P(N = n) = m E N(<); n ii) n = 1j = 1E(|Yj||N = n)P(N = n) = j = 1 n = jE(|Yj||N = n)P(N = n).
PROOF
i) For j 2,
( >)m = E Y
j 1 n =1
= E E Yj N = E Yj N = n P N = n
n =1
[(
)]
)(
) )
(4)
= E Yj N = n P N = n + E Y j N = n P N = n .
n= j
)(
)
)(
)
The event (N = n) depends only on Y1, . . . , Yn and hence, for j > n, E(|Yj||N = n) = E|Yj| = m. Therefore (4) becomes
m = m P N = n + E Y j N = n P N = n
n =1 n =j
j 1
)(
384
14
or mP N j = E Yj N = n P N = n .
n =j
)(
(5)
Equality (5) is also true for j = 1, as
mP N 1 = m = E Y1 = E Y1 N = n P N = n .
n =1
)(
Therefore
E( Y j N = n)P( N = n) = mP( N j ),
n= j
j 1,
and hence
E( Y
j =1n = j
N = n P N = n = m P N j = m jP N = j = mEN ,
j =1 j =1
)(
(6)
where the equality j =1P(N j) = j =1 jP(N = j) is shown in Exercise 14.1.1. Relation (6) establishes part (i). ii) By setting pjn = E(|Yj||N = n)P(N = n), this part asserts that
n =1 j =1
jn
= p11 + p12 + p22 + + p1n + p2n + + pnn + ,
and
p
j =1 n = j
jn
= p11 + p12 + + p22 + p23 + + + pnn + pn ,n +1 + +
) (
are equal. That this is, indeed, the case follows from part (i) and calculus results (see, for example, T.M. Apostol, Theorem 1242, page 373, in Mathematical Analysis, Addison-Wesley, 1957).
PROOF OF THEOREM 1
Since TN = SN N, it sufces to show (3). To this
end, we have
ETN = E E TN N = E TN N = n P N = n
n=1 n = E Y j N = n P N = n n=1 j=1
[(
)]
)(
)( )
) )
n n E Y j N = n P N = n = E Y j N = n P N = n j=1 n=1 n=1 j=1
)(
) (by Lemma 1(ii)) = mEN (< ) (by Lemma 1(i)).

= E Yj N = n P N = n
j=1 n= j
)(
14.1
385
ii) Here
ETN = E E TN N = E TN N = n P N = n
n =1
[(
)]
)(
n n = E Yj N = n P N = n = E Yj N = n P N = n n =1 j =1 n =1 j =1
)(
)
(7)
= E Yj N = n P N = n .
j =1 n = j
)(
This last equality holds by Lemma 1(ii), since
E(Y
j =1 n = j
N = n P N = n E Yj N = n P N = n <
j =1 n = j
)(
)(
by Lemma 1(i). Next, for j 1,
0 = EYj = E E Yj N = E Yj N = n P N = n ,
n =1
[ ( )]
)( )(
)(
(8)
whereas, for j 2, relation (8) becomes as follows:

0 = E Yj N = n P N = n + E Yj N = n P N = n
n =1 n= j j 1
( (
)(
)
(9)
= E Yj N = n P N = n .
n= j
This is so because the event (N = n) depends only on Y1, . . . , Yn, so that, for j > n, E(Yj|N = n) = EYj = 0. Therefore (9) yields
E(Y j N = n)P( N = n) = 0,
n= j
j 2.
(10)
By (8), this is also true for j = 1. Therefore
E(Y j N = n)P( N = n) = 0,
n= j
j 1.
(11)
Summing up over j 1 in (11), we have then
E(Y
j =1n = j
N = n P N = n = 0.
)(
(12)
Relations (7) and (12) complete the proof of the theorem. Now consider any r.v.s Z1, Z2, . . . and let C1, C2 be two constants such that C1 < C2. Set Sn = Z1 + + Zn and dene the random quantity N as follows: N is the smallest value of n for which Sn C1 or Sn C2. If C1 < Sn < C2 for all n, then set N = . In other words, for each s S, the value of N at s, N(s), is assigned as follows: Look at Sn(s) for n 1, and nd the rst n, N = N(s), say, for which SN(s) C1 or SN(s) C2. If C1 < Sn(s) < C2 for all n, then set N(s) = . Then we have the following result.
386
14
THEOREM 2
Let Z1, Z2, . . . be i.i.d. r.v.s such that P(Zj = 0) 1. Set Sn = Z1 + + Zn and for two constants C1, C2 with C1 < C2, dene the r. quantity N as the smallest n for which Sn C1 or Sn C2; set N = if C1 < Sn < C2 for all n. Then there exist c > 0 and 0 < r < 1 such that
P N n cr n
PROOF
for all n.
(13)
The assumption P(Zj = 0) 1 implies that P(Zj > 0) > 0, or P(Zj < 0) > 0. Let us suppose rst that P(Zj > 0) > 0. Then there exists > 0 such that P(Zj > ) = > 0. In fact, if P(Zj > ) = 0 for every > 0, then, in particular, P(Zj > 1/n) = 0 for all n. But (Zj > 1/n) (Zj > 0) and hence 0 = P(Zj > 1/n) P(Zj > 0) > 0, a contradiction. Thus for the case that P(Zj > 0) > 0, we have that
There exists > 0 such that P Z j > = > 0.
With C1, C2 as in the theorem and as in (14), there exists a positive integer m such that
(14)
m > C 2 C1.
For such an m, we shall show that k +m P Z j > C 2 C1 > m j = k +1 We have
k +m
(15)
for k 0.
(16)
j =k +1
I (Z
k +m k +m > Z j > m Z j > C 2 C1 , j =k +1 j =k +1
(17)
the rst inclusion being obvious because there are m Zs, each one of which is greater than , and the second inclusion being true because of (15). Thus k +m k +m k +m P Z j > C 2 C1 P I Z j > = P Z j > = m , j = k +1 j = k +1 j = k +1 the inequality following from (17) and the equalities being true because of the independence of the Zs and (14). Clearly
Skm = Z jm +1 + + Z( j + 1)m .
j =0
k 1
Now we assert that

C1 < Si < C 2 , i = 1, . . . , km
implies
Z jm +1 + + Z( j +1)m C 2 C1 ,
j = 0, 1, . . . , k 1.
(18)
This is so because, if for some j = 0, 1, . . . , k 1, we suppose that Zjm+1 + + Z( j+1)m > C2 C1, this inequality together with Sjm > C1 would imply that S( j+1)m > C2, which is in contradiction to C1 < Si < C2, i = 1, . . . , km. Next,
14.1
387
(N km + 1) (C
< S j < C 2 , j = 1, . . . , km
I Z jm +1 + + Z( j +1)m C 2 C1 ,
j= 0
k 1
the rst inclusion being obvious from the denition of N and the second one following from (18). Therefore
k 1 P N km + 1 P I Z jm +1 + + Z( j +1)m C 2 C1 j = 0
[ = P[ Z
k 1 j =0 k 1 j =0
jm +1
+ + Z( j +1)m
] C C ]
2 1
1m = 1m
) (
),
k
the last inequality holding true because of (16) and the equality before it by the independence of the Zs. Thus
P N km + 1 1 m .
m m 1/m
) (
(19)
Now set c = 1/(1 ), r = (1 ) , and for a given n, choose k so that km < n (k + 1)m. We have then
P N n P N km + 1 1 m =
) (
m
(1 )
m
(1
) ) = c (1 )
k k+ 1 m
1 m
(k + 1 )m
= cr
(k + 1 )m
cr n ;
these inequalities and equalities are true because of the choice of k, relation (19) and the denition of c and r. Thus for the case that P(Zj > 0) > 0, relation (13) is established. The case P(Zj < 0) > 0 is treated entirely symmetrically, and also leads to (13). (See also Exercise 14.1.2.) The proof of the theorem is then completed. The theorem just proved has the following important corollary.
COROLLARY
Under the assumptions of Theorem 2, we have (i) P(N < ) = 1 and (ii) EN < .
PROOF
i) Set A = (N = ) and An = (N n). Then, clearly, A = n=1An. Since also A1 A2 , we have A = lim An and hence
n
P A = P lim An = lim P An
n n
( )
( )
388
14
by Theorem 2 in Chapter 2. But P(An) cr n by the theorem. Thus lim P(An) = 0, so that P(A) = 0, as was to be shown. ii) We have
EN = nP N = n = P N n cr n = c r n
n=1 n=1 n=1 n=1
=c
r < , 1r
as was to be seen. The r.v. N is positive integer-valued and it might also take on the value but with probability 0 by the rst part of the corollary. On the other hand, from the denition of N it follows that for each n, the event (N = n) depends only on the r.v.s Z1, . . . , Zn. Accordingly, N is a stopping time by Denition 1 and Remark 1.
REMARK 2
Exercises
14.1.1 14.1.2 For a positive integer-valued r.v. N show that EN = n=1P(N n). In Theorem 2, assume that P(Zj < 0) > 0 and arrive at relation (13).
14.2 Sequential Probability Ratio Test

Although in the point estimation and testing hypotheses problems discussed in Chapter 12 and 13, respectively (as well as in the interval estimation problems to be dealt with in Chapter 15), sampling according to a stopping time is, in general, protable, the mathematical machinery involved is well beyond the level of this book. We are going to consider only the problem of sequentially testing a simple hypothesis against a simple alternative as a way of illustrating the application of sequential procedures in a concrete problem. To this end, let X1, X2, . . . be i.i.d. r.v.s with p.d.f. either f0 or else f1, and suppose that we are interested in testing the (simple) hypothesis H: the true density is f0 against the (simple) alternative A: the true density is f1, at level of signicance (0 < < 1) without xing in advance the sample size n. In order to simplify matters, we also assume that {x ;f0(x) > 0} = {x ;f1(x) > 0}. Let a, b, be two numbers (to be determined later) such that 0 < a < b, and for each n, consider the ratio
n = n X1 , . . . , X n ; 0, 1 =
( ) ( ). f (X ) f (X )
f1 X1 f1 X n
0 1 0 n
14.1
Some Basic 14.2 Theorems Sequential ofProbability SequentialRatio Sampling Test
389
We shall use the same notation n for n (x1, . . . , xn; 0, 1), where x1, . . . , xn are the observed values of X1, . . . , Xn. For testing H against A, consider the following sequential procedure: As long as a < n < b, take another observation, and as soon as n a, stop sampling and accept H and as soon as n b, stop sampling and reject H. By letting N stand for the smallest n for which n a or n b, we have that N takes on the values 1, 2, . . . and possibly , and, clearly, for each n, the event (N = n) depends only on X1, . . . , Xn. Under suitable additional assumptions, we shall show that the value is taken on only with probability 0, so that N will be a stopping time. Then the sequential procedure just described is called a sequential probability ratio test (SPRT) for obvious reasons. In what follows, we restrict ourselves to the common set of positivity of f0 and f1, and for j = 1, . . . , n, set
Z j = Z j X j ; 0, 1 = log
( ), f (X )
f1 X j
0 j
so that log n = Z j .
j =1
Clearly, the Zjs are i.i.d. since the Xs are so, and if Sn = n j = 1Zj, then N is redened as the smallest n for which Sn log a or Sn log b. At this point, we also make the assumption that Pi[ f0(X1) f1(X1)] > 0 for i = 0, 1; equivalently, if C is the set over which f0 and f1 differ, then it is assumed that C f0(x)dx > 0 and C f1(x)dx > 0 for the continuous case. This assumption is equivalent to Pi(Z1 0) > 0 under which the corollary to Theorem 2 applies. Summarizing, we have the following result.
PROPOSITION 1
Let X1, X2, . . . be i.i.d. r.v.s with p.d.f. either f0 or else f1, and suppose that
{x ;f (x) > 0} = {x ;f (x) > 0}

0 1
and that Pi [ f0(X1) f1(X1)] > 0, i = 0, 1. For each n, set
n =
and
( ) ( ), f (X ) f (X )
f1 X1 f1 X n
0 1 0 n
Z j = log
( ), f (X )
f1 X j
0 j
j = 1, . . . , n
Sn = Z j = log n .
j =1
For two numbers a and b with 0 < a < b, dene the random quantity N as the smallest n for which n a or n b; equivalently, the smallest n for which Sn log a or Sn log b for all n. Then
Pi N < = 1 and Ei N < ,
i = 0, 1.
Thus, the proposition assures us that N is actually a stopping time with nite expectation, regardless of whether the true density is f0 or f1. The implication of Pi(N < ) = 1, i = 0, 1 is, of course, that the SPRT described above will
390
14
terminate with probability one and acceptance or rejection of H, regardless of the true underlying density. In the formulation of the proposition above, the determination of a and b was postponed until later. At this point, we shall see what is the exact determination of a and b, at least from theoretical point of view. However, the actual identication presents difculties, as will be seen, and the use of approximate values is often necessary. To start with, let and 1 be prescribed rst and second type of errors, respectively, in testing H against A, and let < < 1. From their own denition, we have
= P rejecting H when H is true
= P0 1 b + a < 1 < b, 2 b +
( = P ( b) + P ( a < < b, + P ( a < < b, . . . , a <

0 1 0 1 0 1
[(
) (
+ a < 1 < b, . . . , a < n1 < b, n b +

2
b + < b, n b +
]
(20)
n1
and
1 = P accepting H when H is false =P 1 1 a + a < 1 < b, 2
( = P ( a ) + P ( a < < b, + P ( a < < b, . . . , a <

1 1 1 1 1 1
[(
) (
) a) + )
+ a < 1 < b, . . . , a < n1 < b, n a +

2
]
(21)
a + < b, n a + .
n1
Relations (20) and (21) allow us to determine theoretically the cut-off points a and b when and are given. In order to nd workable values of a and b, we proceed as follows. For each n, set fin = f x1 , . . . , x n ; i , i = 0, 1
and in terms of them, dene T n and T n as below; namely
f11 x1 f b T1 = x1 ; 11 a , T1= x1 ; f01 f01 x1

and for n 2, f Tn = x1 , . . . , x n n ; a < 1 j < b, j = 1, . . . , n 1 and f0 j f Tn = x1 , . . . , x n n ; a < 1 j < b, j = 1, . . . , n 1 and f0 j
( ) ( )
(22)
( (
) )
f1n a , (23) f0 n f1n b. (24) f0 n
14.1
Some Basic 14.2 Theorems Sequential ofProbability SequentialRatio Sampling Test
391
In other words, T n is the set of points in n for which the SPRT terminates n with n observations and accepts H, while T n is the set of points in for which the SPRT terminates with n observations and rejects H. In the remainder of this section, the arguments will be carried out for the case that the Xjs are continuous, the discrete case being treated in the same way by replacing integrals by summation signs. Also, for simplicity, the differentials in the integrals will not be indicated. From (20), (22) and (23), one has
= f0n .
n =1 Tn
But on T n, f1n/fon b, so that f0n (1/b)f1n. Therefore
= f0 n
n=1 T n
1 n f1n. b n=1 T
(25)
On the other hand, we clearly have Pi N = n = fin + fin , i = 0, 1,

T n T n
and by Proposition 1,
1 = Pi N = n = fin + fin , i = 0, 1.
n=1 n=1 T n n=1 T n
(26)
From (21), (22), (24) and (26) (with i = 1), we have
1 = f1n = 1 f1n , so that

n=1 T n n=1 T n
T f1n = .
n=1
n
Relation (25) becomes then
b,
and in a very similar way (see also Exercise 14.2.1), we also obtain
(27)
1 1
From (27) and (28) it follows then that
a.
(28)
1 (29) , b . 1 Relation (29) provides us with a lower bound and an upper bound for the actual cut-off points a and b, respectively. Now set
1 , and b = 1 so that 0 < a < b by the assumption < < 1 , a =
(30)
and suppose that the SPRT is carried out by employing the cut-off points a and b given by (30) rather than the original ones a and b. Furthermore, let
392
14
and 1 be the two types of errors associated with a and b. Then replacing , , a and b by , , a and b, respectively, in (29) and also taking into consideration (30), we obtain
1 1 a = 1 1
and hence
1
and
= b
.
(31)
1 1 1 1 1
and
That is,

From (31) we also have
and 1
1 . 1
(32)
(1 )(1 ) (1 )(1 )
or
and , and ,
(1 ) + (1 ) + ( ) (
and by adding them up,
+ 1 + 1 .
PROPOSITION 2
(33)
Summarizing the main points of our derivations, we have the following result. For testing H against A by means of the SPRT with prescribed error probabilities and 1 such that < < 1, the cut-off points a and b are determined by (20) and (21). Relation (30) provides approximate cut-off points a and b with corresponding error probabilities and 1 , say. Then relation (32) provides upper bounds for and 1 and inequality (33) shows that their sum + (1 ) is always bounded above by + (1 ). From (33) it follows that > and 1 > 1 cannot happen simultaneously. Furthermore, the typical values of and 1 are such as 0.01, 0.05 and 0.1, and then it follows from (32) that and 1 lie close to and 1 , respectively. For example, for = 0.01 and 1 = 0.05, we have < 0.0106 and 1 < 0.0506. So there is no serious problem as far as and 1 are concerned. The only problem which may arise is that, because a and b are used instead of a and b, the resulting and 1 are too small compared to and 1 , respectively. As a consequence, we would be led to taking a much larger number of observations than would actually be needed to obtain and . It can be argued that this does not happen.
REMARK 3
Exercise
14.2.1 Derive inequality (28) by using arguments similar to the ones employed in establishing relation (27).
14.1 14.3 Some Optimality Basicof Theorems the SPRT-Expected of Sequential Sample Sampling Size
393
14.3 Optimality of the SPRT-Expected Sample Size

An optimal property of the SPRT is stated in the following theorem, whose proof is omitted as being well beyond the scope of this book.
THEOREM 3
For testing H against A, the SPRT with error probabilities and 1 minimizes the expected sample size under both H and A (that is, it minimizes E0N and E1N) among all tests (sequential or not) with error probabilities bounded above by and 1 and for which the expected sample size is nite under both H and A. The remaining part of this section is devoted to calculating the expected sample size of the SPRT with given error probabilities, and also nding approximations to the expected sample size. So consider the SPRT with error probabilities and 1 , and let N be the associated stopping time. Then we clearly have
Ei N = nPi N = n = 1Pi N = 1 + nPi N = n

n=1 n= 2
) )
(34)
= Pi 1 a or 1 b + nPi a < j < b, j = 1, . . . , n 1,

n= 2
n a or n b , i = 0, 1.
Thus formula (34) provides the expected sample size of the SPRT under both H and A, but the actual calculations are tedious. This suggests that we should try to nd an approximate value to Ei N, as follows. By setting A = log a and B = log b, we have the relationships below:
(a <
and
< b, j = 1, . . . , n 1, n a or b
j n
)
Z
i =1 n i
= A < Zi < B, j = 1, . . . , n 1, i =1
Zi A or
i =1
B , n 2
(35)
From the right-hand side of (35), all partial sums Zi, j = 1, . . . , n 1 lie between A and B and it is only the n i=1Zi which is either A or B, and this is due to the nth observation Zn. We would then expect that n i = 1Zi would not be too far away from either A or B. Accordingly, by letting SN = N i = 1Zi, we are led to assume as an approximation that SN takes on the values A and B with respective probabilities
j i=1
a or 1 b = Z1 A or Z1 B .
) (
(36)
Pi S N A
and Pi S N B ,
i = 0, 1.
But and
P0 S N A = 1 , P0 S N B = P P 1 SN A = 1 , 1 S N B = .
394
14
Therefore we obtain
E0 S N 1 A + B and E1 S N 1 A + B.
(37)
On the other hand, by assuming that Ei |Z1| < , i = 0, 1, Theorem 1 gives EiSN = (EiN)(EiZ1). Hence, if also Ei Z1 0, then EiN = (EiSN)/(EiZ1). By virtue of (37), this becomes
E0 N
(1 )A + B ,
E0 Z1
E1 N
(1 )A + B .
E1Z1
(38)
Thus we have the following result.

PROPOSITION 3
In the SPRT with error probabilities and 1 , the expected sample size EiN, i = 0, 1 is given by (34). If furthermore Ei|Z1| < and EiZ1 0, i = 0, 1, relation (38) provides approximations to EiN, i = 0, 1. Actually, in order to be able to calculate the approximations given by (38), it is necessary to replace A and B by their approximate values taken from (30), that is,
REMARK 4
A log a = log
1 1
and B log b =
(39)
In utilizing (39), we also assume that < < 1, since (30) was derived under this additional (but entirely reasonable) condition.
Exercises
14.3.1 Let X1, X2, . . . be independent r.v.s distributed as P(), = (0, ). Use the SPRT for testing the hypothesis H : = 0.03 against the alternative A : = 0.05 with = 0.1, 1 = 0.05. Find the expected sample sizes under both H and A and compare them with the xed sample size of the MP test for testing H against A with the same and 1 as above. 14.3.2 Discuss the same questions as in the previous exercise if the Xjs are independently distributed as Negative Exponential with parameter = (0, ).
14.4 Some Examples

This chapter is closed with two examples. In both, the r.v.s X1, X2, . . . are i.i.d. with p.d.f. f(; ), , and for 0, 1 with 0 < 1, the problem is that of testing H : = 0 against A : = 1 by means of the SPRT with error probabilities and 1 . Thus in the present case f0 = f(; 0) and f1 = f(; 1).
14.1
Some Basic Theorems of 14.4 Sequential Some Examples Sampling
395
What we explicitly do, is to set up the formal SPRT and for selected numerical values of and 1 , calculate a, b, upper bounds for and 1 , estimate EiN, i = 0, 1, and nally compare the estimated EiN, i = 0, 1 with the size of the xed sample size test with the same error probabilities.
EXAMPLE 1
Let X1, X2, . . . be i.i.d. r.v.s with p.d.f.

f x; = x 1
1 x
, x = 0, 1, = 0, 1 .
Then the test statistic n is given by

n = 1 2
j X j
1 1 1 0
n j X j
and we continue sampling as long as

1 1 A n log 1 0 log
( ) (1 )
1 1 0
0 1
n 1 1 < X j < B n log 0 1 j =1
log
( ). (1 )
1 1 0
0 1
1 0
(40)
Next,
Z1 = log
( ) = X log (1 ) + log 1 1 f (X ) (1 )
f1 X1
0 1 0 1 1 0 1
so that
EiZ1 = i log
1 1 0
0
( ) + log 1 1 (1 )
1
1 0
, i = 0, 1.
(41)
For a numerical application, take = 0.01 and 1 = 0.05. Then the cut-off points a and b are approximately equal to a and b, respectively, where a and b are given by (30). In the present case,
a = 0.05 0.05 0.95 = 0.0505 and b = = 95. 1 0.01 0.99 0.01
For the cut-off points a and b, the corresponding error probabilities and 1 are bounded as follows according to (32):
a 0.01 0.05 0.0105 and 1 0.0505. 0.95 0.99
Next, relation (39) gives
5 = 1.29667 and B log 95 = 1.97772. 99 3 4 At this point, let us suppose that 0 = 8 and 1 = 8 . Then A log
(42)
396
14
log
1 1 0
0
( ) = log 5 = 0.22185 3 (1 )
1
and log
1 1 4 = log = 0.09691, 1 0 5
so that by means of (41), we have

E0 Z1 = 0.13716 and E1Z1 = 0.014015.
(43)
Finally, by means of (42) and (43), relation (38) gives

E0 N 92.5 and E1 N 129.4
On the other hand, the MP test for testing H against A based on a xed sample size n is given by (9) in Chapter 13. Using the normal approximation, we nd that for the given = 0.01 and = 0.95, n has to be equal to 244.05. Thus both E0N and E1N compare very favorably with it.
EXAMPLE 2
Let X1, X2, . . . be i.i.d. r.v.s with p.d.f. that of N(, 1). Then
n 1 2 n = exp 1 0 X j n 1 2 0 2 j =1 and we continue sampling as long as
n 2 2 A + 2 1 0
) (
n n 2 0 < X j < B + 2 1 0 2 j =1
) (
0 .
(44)
Next,
Z1 = log
so that
( )= ( f (X )
f1 X1
0 1
0 X1
1 2 2 1 0 , 2
1 2 2 1 0 , i = 0 , 1. (45) 2 By using the same values of and 1 as in the previous example, we have the same A and B as before. Taking 0 = 0 and 1 = 1, we have EiZ1 = i 1 0
E0 Z1 = 0.5 and E1Z1 = 0.5.

Thus relation (38) gives
E0 N 2.53 and E1 N 3.63.
Now the xed sample size MP test is given by (13) in Chapter 13. From this we nd that n 15.84. Again both E0N and E1N compare very favorably with the xed value of n which provides the same protection.
15.2
Some Examples
397
Chapter 15
Condence RegionsTolerance Intervals
15.1 Condence Intervals

Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(; ) r. In Chapter 12, we considered the problem of point estimation of a real-valued function of , g(). That is, we considered the problem of estimating g() by a statistic (based on the Xs) having certain optimality properties. In the present chapter, we return to the estimation problem, but in a different context. First, we consider the case that is a real-valued parameter and proceed to dene what is meant by a random interval and a condence interval.
DEFINITION 1 DEFINITION 2
A random interval is a nite or innite interval, where at least one of the end points is an r.v. Let L(X1, . . . , Xn) and U(X1, . . . , Xn) be two statistics such that L(X1, . . . , Xn) U(X1, . . . , Xn). We say that the r. interval [L(X1, . . . , Xn), U(X1, . . . , Xn)] is a condence interval for with condence coefcient 1 (0 < < 1) if
P L X1 , . . . , X n U X1 , . . . , X n 1
[(
)]
for all .
(1)
Also we say that U(X1, . . . , Xn) and L(X1, . . . , Xn) is an upper and a lower condence limit for , respectively, with condence coefcient 1 , if for all ,
P < U X1 , . . . , X n 1
and
P L X1 , . . . , X n < 1 .
)]
[(
(2)
Thus the r. interval [L(X1, . . . , Xn), U(X1, . . . , Xn)] is a condence interval for with condence coefcient 1 , if the probability is at least 1 that the
397
398
15
r. interval [L(X1, . . . , Xn), U(X1, . . . , Xn)] covers the parameter no matter what is. The interpretation of this statement is as follows: Suppose that the r. experiment under consideration is carried out independently n times, and if xj is the observed value of Xj, j = 1, . . . , n, construct the interval [L(x1, . . . , xn), U(x1, . . . , xn)]. Suppose now that this process is repeated independently N times, so that we obtain N intervals. Then, as N gets larger and larger, at least (1 )N of the N intervals will cover the true parameter . A similar interpretation holds true for an upper and a lower condence limit of .
REMARK 1
By relations (1) and (2) and the fact that

P L X1 , . . . , X n + P U X1 , . . . , X n
= P L X1 , . . . , X n U X1 , . . . , X n + 1,
[(
)]
)]
)]
it follows that, if L(X1, . . . , Xn) and U(X1, . . . , Xn) is a lower and an upper 1 condence limit for , respectively, each with condence coefcient 1 , 2 then [L(X1, . . . , Xn), U(X1, . . . , Xn)] is a condence interval for with condence coefcient 1 . The length l(X1, . . . , Xn) of this condence interval is l = l(X1, . . . , Xn) = U(X1, . . . , Xn) L(X1, . . . , Xn) and the expected length is E l, if it exists. Now it is quite possible that there exist more than one condence interval for with the same condence coefcient 1 . In such a case, it is obvious that we would be interested in nding the shortest condence interval within a certain class of condence intervals. This will be done explicitly in a number of interesting examples. At this point, it should be pointed out that a general procedure for constructing a condence interval is as follows: We start out with an r.v. Tn() = T(X1, . . . , Xn; ) which depends on and on the Xs only through a sufcient statistic of , and whose distribution, under P , is completely determined. Then Ln = L(X1, . . . , Xn) and Un = U(X1, . . . , Xn) are some rather simple functions of Tn() which are chosen in an obvious manner. The examples which follow illustrate the point.
Exercise
15.1.1 Establish the relation claimed in Remark 1 above.
15.2 Some Examples

We now proceed with the discussion of certain concrete cases. In all of the examples in the present section, the problem is that of constructing a con-
15.2
Some Examples
399
dence interval (and also the shortest condence interval within a certain class) for with condence coefcient 1 .
EXAMPLE 1
Let X1, . . . , Xn be i.i.d. r.v.s from N(, 2). First, suppose that is known, so )/. Then Tn() that is the parameter, and consider the r.v. Tn() = n(X depends on the Xs only through the sufcient statistic X of and its distribution is N(0, 1) for all . Next, determine two numbers a and b (a < b) such that
P a N 0, 1 b = 1 .
( ) ]
(3)
From (3), we have
P a
n X
) b = 1

P X b X a = 1 . n n Therefore , X a (4) X b n n is a condence interval for with condence coefcient 1 . Its length is equal to (b a) /n. From this it follows that, among all condence intervals with condence coefcient 1 which are of the form (4), the shortest one is that for which b a is smallest, where a and b satisfy (3). It can be seen (see also Exercise 15.2.1) that this happens if b = c (> 0) and a = c, where c is the upper /2 quantile of the N(0, 1) distribution which we denote by z /2. Therefore the shortest condence interval for with condence coefcient 1 (and which is of the form (4)) is given by (5) , X + z 2 X z 2 . n n Next, assume that is known, so that 2 is the parameter, and consider the r.v.
Tn 2 =
( )
2 2 1 n nSn 2 , where S = Xj . n 2 n j =1
2 n( 2) depends on the Xs only through the sufcient statistic S 2 Then T n of 2 2 and its distribution is n for all . Now determine two numbers a and b (0 < a < b) such that
2 P a n b = 1 .
(6)
From (6), we obtain
400
15
nS 2 P a 2n b = 1
2
which is equivalent to nS 2 nS 2 P n 2 n = 1 . a b
2
Therefore
2 nSn , b 2 nSn a
(7)
is a condence interval for 2 with condence coefcient 1 and its length 2 is equal to (1/a 1/b)nS 2 n. The expected length is equal to (1/a 1/b)n . Now, although there are innite pairs of numbers a and b satisfying (6), in practice they are often chosen by assigning mass /2 to each one of the tails of the 2 n distribution. However, this is not the best choice because then the corresponding interval (7) is not the shortest one. For the determination of the shortest condence interval, we work as follows. From (6), it is obvious that a and b are not independent of each other but the one is a function of the other. So let b = b(a). Since the length of the condence interval in (7) is l = (1/a 1/b)nS 2 n, it clearly follows that that a for which l is shortest is given by dl/da = 0 which is equivalent to
db b 2 = . da a 2
(8)
Now, letting Gn and gn be the d.f. and the p.d.f. of the 2 n, relation (6) becomes Gn(b) Gn(a) = 1 . Differentiating it with respect to a, one obtains
gn b
g (a) = 0, ( ) db da
n
or
db gn a = . da gn b
() ()
Thus (8) becomes a2gn(a) = b2gn(b). By means of this result and (6), it follows that a and b are determined by
a 2 gn a = b2 gn b
()
()
and
a g n (t )dt = 1 .
b
(9)
For the numerical solution of (9), tables are required. Such tables are available (see Table 678 in R. F. Tate and G. W. Klett, Optimum condence intervals for the variance of a normal distribution, Journal of the American Statistical Association, 1959, Vol. 54, pp. 674682) for n = 2(1)29 and 1 = 0.90, 0.95, 0.99, 0.995, 0.999). To summarize then, the shortest (both in actual and expected length) condence interval for 2 with condence coefcient 1 (and which is of the form (7)) is given by
15.2
2 nSn , b 2 nSn , a
Some Examples
401
where a and b are determined by (9). As a numerical application, let n = 25, = 1, and 1 = 0.95. Then 0.392, X + 0.392]. Next, for the equal-tails z /2 = 1.96, so that (5) gives [X condence interval given by (7), we have a = 13.120 and b = 40.646, so that the equal-tails condence interval itself is given by
2 25S25 , 40.646 2 25S25 . 13.120
On the other hand, the shortest condence interval is equal to

2 2 25S25 25S25 , 45.7051 14.2636
and the ratio of their lengths is approximately 1.07.

EXAMPLE 2
Let X1, . . . , Xn be i.i.d. r.v.s from the Gamma distribution with parameter and a known positive integer, call it r. Then n j = 1Xj is a sufcient statistic for (see Exercise 11.1.2(iii), Chapter 11). Furthermore, for each j = 1, . . . , n, the r.v. 2Xj / is 2 2r, since
2 X
Therefore
(t ) =
Xj
2t 1 = 1 2it
2r 2
(see Chapter 6).
Tn =
()
2 n Xj j =1
is 2 2rn for all > 0. Now determine a and b (0 < a < b) such that
2 P a 2 rn b = 1 .
(10)
From (10), we obtain 2 n P a X j b = 1 j =1 which is equivalent to

n n P 2 X j b 2 X j a = 1 . j =1 j =1
Therefore a condence interval with condence coefcient 1 is given by
402
15

n 2 n X 2 j =1 X j j =1 j , . b a Its length and expected length are, respectively,
(11)
1 1 n l = 2 X j , a b j =1
1 1 E l = 2 rn . a b
As in the second part of Example 1, it follows that the equal-tails condence interval, which is customarily employed, is not the shortest among those of the form (11). In order to determine the shortest condence interval, one has to minimize l subject to (10). But this is the same problem as the one we solved in the second part of Example 1. It follows then that the shortest (both in actual and expected length) condence interval with condence coefcient 1 (which is of the form (11)) is given by (11) with a and b determined by
a 2 g 2 rn a = b 2 g 2 rn b
()
()
and
a g 2 rn (t )dt = 1 .
b
For instance, for n = 7, r = 2 and 1 = 0.95, we have, by means of the tables cited in Example 1, a = 16.5128 and b = 49.3675. Thus the corresponding shortest condence interval is then
2 7 X j =1 j , 49.3675
The equal-tails condence interval is
2 j =1 X j . 16.5128
7
2 7 X j =1 j , 44.461
2 j =1 X j , 15.308
7
so that the ratio of their length is approximately equal to 1.075.

EXAMPLE 3
Let X1, . . . , Xn be i.i.d. r.v.s from the Beta distribution with = 1 and = unknown. n Then n j = 1Xj, or j = 1 log Xj is a sufcient statistic for . (See Exercise 11.1.2(iv) in Chapter 11.) Consider the r.v. Yj = 2 log Xj. It is easily seen that 1 its p.d.f. is exp(yj /2), yj > 0, which is the p.d.f. of a 2 2. This shows that 2 Tn = 2 log X j = Yj
j =1 j =1
()
is distributed as 2 2n. Now determine a and b (0 < a < b) such that

2 P a 2 n b = 1 .
(12)
15.2
Some Examples
403
From (12), we obtain

n P a 2 log X j b = 1 j =1
n n P a 2 log X j b 2 log X j = 1 . j =1 j =1
Therefore a condence interval for with condence coefcient 1 is given by
a b . , n 2 n log X 2 j =1 log X j j j =1
Its length is equal to
l= ab 2 j =1 log X j
n
(13)
Considering dl/da = 0 in conjunction with (12) in the same way as it was done in Example 2, we have that the shortest (both in actual and expected length) condence interval (which is of the form (13)) is found by numerically solving the equations
g 2n a = g 2n b
()
()
and
a g 2n (t )dt = 1 .
b
However, no tables which would facilitate this solution are available. For example, for n = 25 and 1 = 0.95, the equal-tails condence interval for is given by (13) with a = 32.357 and b = 71.420.
EXAMPLE 4
Let X1, . . . , Xn be i.i.d. r.v.s from U(0, ). Then Yn = X(n) is a sufcient statistic for (see Example 7, Chapter 11) and its p.d.f. gn is given by gn yn =
( )
n n 1 yn , 0 yn n
(by Example 3, Chapter 10).

0 t 1.
Consider the r.v. Tn() = Yn/. Its p.d.f. is easily seen to be given by
hn t = nt n 1 ,
()
Then dene a and b with 0 a < b 1 and such that
P a Tn b = nt n 1dt = bn an = 1 .
a
() ]
(14)
404
15
From (14), we get P(a Yn/ b) = 1 which is equivalent to P[X(n)/b X(n)/a] = 1 . Therefore a condence interval for with condence coefcient 1 is given by
X (n ) X (n ) , a b and its length is l = (1/a 1/b)X(n). From this, we have
(15)
1 da 1 dl = X (n ) 2 + , db a db b 2
while by way of (14), da/db = bn1/an1, so that
dl an +1 bn +1 = X (n ) . db b 2 an +1
Since this is less than 0 for all b, l is decreasing as a function of b and its minimum is obtained for b = 1, in which case a = 1/n, by means of (14). Therefore the shortest (both in actual and expected length) condence interval with condence coefcient 1 (which is the form (15)) is given by
X (n ) X n , . ( ) 1 n For example, for n = 32 and 1 = 0.95, we have approximately [X(32), 1.098X(32)].

Exercises 15.2.515.2.7 at the end of this section are treated along the same lines with the examples already discussed and provide additional interesting cases, where shortest condence intervals exist. The inclusion of the discussions in relation to shortest condence intervals in the previous examples, and the exercises just mentioned, has been motivated by a paper by W. C. Guenther on Shortest condence intervals in The American Statistican, 1969, Vol. 23, Number 1.
Exercises
15.2.1 Let be the d.f. of the N(0, 1) distribution and let a and b with a 0) and a = c. (See also the discussion of the second part of Example 1.) 15.2.2 Let X1, . . . , Xn be independent r.v.s having the Negative Exponential distribution with parameter = (0, ), and set U = n i = 1Xi. ii) Show that the r.v. U is distributed as Gamma with parameters (n, ) and that the r.v. 2U/ is distributed as 2 2n;
15.2
Some Exercises Examples
405
ii) Use part (i) to construct a condence interval for with condence coefcient 1 . (Hint: Use the parametrization f (x; ) = 1/ ex/, x > 0). 15.2.3 ii) If the r.v. X has the Negative Exponential distribution with parameter = (0, ), show that the reliability R(x; ) = P(X > x) (x > 0) is equal to ex/; ii) If X1, . . . , Xn is a random sample from the distribution in part (i) and U = in= 1Xi, then (by Exercise 15.2.2(i)) 2U/ is distributed as 2 2n. Use this fact and part (i) of this exercise to construct a condence interval for R(x; ) with condence coefcient 1 . (Hint: Use the parametrization f (x; ) = 1/ ex/, x > 0). 15.2.4 Refer to Example 4 and set R = X(n) X(1). Then: iii) Find the distribution of R; 1) = 1 .) (Hint: Take c(0, 1) such that P (c R
iii) Show that a condence interval for , based on R, with condence coefcient 1 is of the form [R, R/c], where c is a root of the equation
c n 1 n n 1 c =
iii) Show that the expected length of the shortest condence interval in Example 4 is shorter than that of the condence interval in (ii) above. (Hint: Use the parametrization f (x; ) = 1/ ex/, x > 0). 15.2.5 Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. given by ( x ) f x; = e I ( , ) x , =
[ ( )]
()
and set Y1 = X(1). Then show that: iii) The p.d.f. g of Y1 is given by g(y) = nen( y )I(,)( y) iii) The r.v. Tn() = 2n(Y1 ) is distributed as 2 2; iii) A condence interval for , based on Tn(), with condence coefcient 1 is of the form [Y1 (b/2n), Y1 (a/2n)]; iv) The shortest condence interval of the form given in (iii) is provided by
2 2 ; , Y1 , Y1 2n
2 where 2 2; is the upper th quantile of the 2 distribution.
15.2.6 Let X1, . . . , Xn be independent r.v.s having the Weibull p.d.f. given in Exercise 11.4.2, Chapter 11. Then show that:
n iii) The r.v. Tn() = 2Y/ is distributed as 2 2n, where Y = j = 1X j ; iii) A condence interval for , based on Tn(), with condence coefcient 1 is of the form [2Y/b, 2Y/a];
406
15
iii) The shortest condence interval of the form given in (ii) is taken for a and b satisfying the equations
a g 2n (t )dt = 1
b
and
a 2 g 2n a = b 2 g 2n b ,
()
()
where g2n is the p.d.f. of the 2 2n distribution. 15.2.7 Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. given by
f x; =
1 x e , 2
= 0, .
Then show that: ii) The r.v. Tn() =

2Y n is distributed as 2 2n, where Y = j = 1|Xj|; ii) and (iii) as in Exercise 15.2.6.
15.2.8 Consider the independent random samples X1, . . . , Xm from N(1, 2 1) and Y1, . . . , Yn from N(2, 2 ), where , are known and , are unknown, 2 1 2 1 2 and let the r.v. Tm,n( 1 2) be dened by
Tm, n 1 2 =
Then show that:
(X
Yn 1 2
2 1
) (
m +
) (
2 2
).
ii) A condence interval for 1 2, based on Tm,n(1 2), with condence coefcient 1 is given by
2 2 2 2 X m Yn b 1 + 2 , X m Yn a 1 + 2 , m n m n where a and b are such that (b) (a) = 1 ;
ii) The shortest condence interval of the aforementioned form is provided by the last expression above with a = b = z .
2
15.2.9 Refer to Exercise 15.2.8, but now suppose that 1, 2 are known and 1, 2 are unknown. Consider the r.v.
2 S2 Tm, n 1 = 12 n 2 2 2 Sm
2 and show that a condence interval for 2 1/ 2, based on T m,n(1/2), with condence coefcient 1 is given by
2 2 Sm Sm a 2 , b 2 , Sn Sn
15.3 Condence Intervals in the Presence of15.2 Nuisance Some Parameters Examples
407
where 0 < a < b are such that P(a Fn,m b) = 1 . In particular, the equaltails condence interval is provided by the last expression above with a = Fn,m ; /2 and b = Fn,m; /2, where F n,m ; /2 and Fn,m; /2 are the lower and the upper /2 quantiles, respectively, of Fn,m. 15.2.10 Let X1, . . . , Xm and Y1, . . . , Yn be independent random samples from the Negative Exponential distributions with parameters 1 and 2, respecn tively, and set U = m i = 1Xi, V = i = 1Yj. Then (by Exercise 15.2.2(i)) the inde2 pendent r.v.s 2U/1 and 2V/2 are distributed as 2 2m and 2n, respectively, so 2 V 2U that the r.v. 2 1 is distributed as F2n,2m. Use this result in order to construct a condence interval for 1/2 with condence coefcient 1 . (Hint: Employ the parametrization used in Exercise 15.2.2.)
15.3 Condence Intervals in the Presence of Nuisance Parameters

So far we have been concerned with the problem of constructing a condence interval for a real-valued parameter when no other parameters are present. However, in many interesting examples, in addition to the real-valued parameter of main interest, some other (nuisance) parameters do appear in the p.d.f. under consideration. In such cases, we replace the nuisance parameters by appropriate estimators and then proceed as before. The examples below illustrate the relevant procedure.
EXAMPLE 5
Refer to Example 1 and suppose that both and are unknown. First, we suppose that we are interested in constructing a condence interval for . For this purpose, consider the r.v. Tn() of Example 1 and replace 2 by its usual estimator
2 Sn 1 = 2 1 n X j Xn . n 1 j =1
n )/Sn1 which depends on the Xs Thus we obtain the new r.v. Tn () = n(X 2 only through the sufcient statistic (X n, S 2 n1) of (, ). Basing the condence interval in question on Tn(), which is tn1 distributed, and working as in Example 1, we obtain a condence interval of the form Sn 1 S , X n a n 1 . Xn b n n (16)
Furthermore, an argument similar to the one employed in Example 1 implies that the shortest (both in actual and expected length) condence interval of the form (16) is given by Sn 1 S , X n + t n 1; 2 n 1 , X n t n 1; 2 n n (17)
408
15
where tn1; /2 is the upper /2 quantile of the tn1 distribution. For instance, for n = 25 and 1 = 0.95, the corresponding condence interval for is taken n 0.41278S24, from (17) with t 24;0.025 = 2.0639. Thus we have approximately [X X n + 0.41278S24]. Suppose now that we wish to construct a condence interval for 2. To this n( 2) of Example 1 as follows: end, modify the r.v. T T n 2 = n1 S ( ) ( )
2 n 1
n so that T ( 2) is 2 n1 distributed. Proceeding as in the corresponding case of Example 1, one has the following condence interval for 2:
2 2 n 1 Sn n 1 Sn 1 1 , (18) , b a and the shortest condence interval of this form is taken when a and b are numerical solutions of the equations
a 2 gn 1 a = b 2 gn 1 b
()
()
and
a gn 1 (t )dt = 1 .
b
Thus with n and 1 as above, one has, by means of the tables cited in Example 1, a = 13.5227 and b = 44.4802, so that the corresponding interval 2 approximately is equal to [0.539S 2 24, 1.775S 24].
EXAMPLE 6
Consider the independent r. samples X1, . . . , Xm from N( 1, 2 1) and Y1, . . . , Yn from N( 2, 2 2), where all 1, 2, 1 and 2 are unknown. First, suppose that a condence interval for 1 2 is desired. For this purpose, we have to assume that 1 = 2 = , say (unspecied). Consider the r.v.
Tm, n 1 2 =
(X (m 1)S
Yn 1 2
2 + n 1 Sn 1 1 1 + m+n2 m n 2 m1
) (
Then Tm, n( 1 2) is distributed as tm+n2. Thus, as in the rst case of Example 1 (and also Example 5), the shortest (both in actual and expected length) condence interval based on Tm, n( 1 2) is given by
X Y t n m+n 2; a m
(m 1)S (m 1)S
2 + n 1 Sn 1 1 1 + , m+ n2 m n 2 m1
(X
Yn + t m + n 2 ; a
2 + n 1 Sn 1 1 1 + . m+ n2 m n 2 m1
15.3 Condence Intervals in the Presence of15.2 Nuisance Some Parameters Examples
409
For instance, for m = 13, n = 14 and 1 = 0.95, we have t25;0.025 = 2.0595, so that the corresponding interval approximately is equal to
X Y 0.1586 12S 2 + 13S 2 , 14 12 13 13
(X
13
2 2 Y14 + 0.1586 12S12 + 13S13 .
2 If our interest lies in constructing a condence interval for 2 1/ 2, we consider the r.v.
2 2 Sn 1 Tm, n 1 = 12 2 2 2 S m1
which is distributed as Fn1,m1. Now determine two numbers a and b with 0 < a < b and such that
P a Fn 1,m 1 b = 1 .
Then P or P
2
2 2 Sm Sm 12 1 1 a b = 1 . 2 2 2 Sn 1 Sn 1 2
2 12 Sn 1 a 2 2 b = 1 , 2 Sm 1
2 Therefore a condence interval for 2 1/ 2 is given by
2 2 Sm Sm 1 1 a 2 , b 2 . Sn 1 Sn 1
In particular, the equal-tails condence interval is provided by

2 Sm 1 2 Fn1,m 1; 2 , S n 1 2 Sm 1 Fn 1,m 1; 2 Sn 1 2
where Fn 1,m1; /2 and Fn1,m1; /2 are the lower and the upper /2-quantiles of Fn1,m1. The point Fn1,m1; /2 is read off the F-tables and the point F n 1,m1; /2 is given by Fn1,m 1; 2 = 1 . Fm 1,n 1; 2
Thus, for the previous values of m, n and 1 , we have F13,12;/0.025 = 3.2388 and F12,13;0.025 = 3.1532, so that the corresponding interval approximately is equal to
2 2 S12 S12 0.3171 2 , 3.2388 2 . S13 S13
410
15
Exercise
15.3.1 Let X1, . . . , Xn be independent r.v.s distributed as N(, 2). Derive a condence interval for with condence coefcient 1 when is unknown.
15.4 Condence RegionsApproximate Condence Intervals

The concept of a condence interval can be generalized to that of a condence region in the case that is a multi-dimensional parameter. This will be illustrated by means of the following example.
EXAMPLE 7
(Refer to Example 5.) Here the problem is that of constructing a condence region in 2 for (, 2). To this end, consider the r.v.s
n Xn
and
(n 1)S
2
2 n 1
which are independently distributed as N(0, 1) and 2 n1, respectively. Next, dene the constants c (> 0), a and b (0 < a < b) by
P c N 0, 1 c = 1
( ) ]
and
2 P a n 1 b = 1 .
From these relationships, we obtain

2 n Xn n 1 Sn 1 P , c c, a b 2 2 n Xn n 1 Sn 1 = 1 . = P , c c P , a b 2 Equivalently,
P , X n
c 2 2 , n
(n 1)S
b
2 n 1
(n 1)S
a
2 n 1
= 1 .
(19)
For the observed values of the Xs, we have the condence region for (, 2) indicated in Fig. 15.1. The quantities a, b and c may be determined so that the resulting intervals are the shortest ones, both in actual and expected lengths. Now suppose again that is real-valued. In all of the examples considered so far the r.v.s employed for the construction of condence intervals had an exact and known distribution. There are important examples, however, where this is not the case. That is, no suitable r.v. with known distribution is available which can be used for setting up condence intervals. In cases like this, under
15.4 Condence RegionsApproximate 15.2 Condence Some Examples Intervals
411
2 2 confidence region for ( , 2 )' with confidence coefficient 1

1 n (xj a j 1
xn ) 2
( xn ) 2 2
1 b
n j1
c 2 2 n
(xj xn) 2
0
Figure 15.1
appropriate conditions, condence intervals can be constructed by way of the CLT. So let X1, . . . , Xn be i.i.d. r.v.s with nite mean and variance and 2, n )/ is approxirespectively. Then the CLT applies and gives that n(X mately N(0, 1) for large n. Thus, if we assume that is known, then a condence interval for with approximate condence coefcient 1 is given by (5), provided n is sufciently large. Suppose now that is also unknown. Then since
2 Sn =
1 n X j Xn n j =1
n 2
n )/Sn is again approximately N(0, 1) for in probability, we have that n(X large n and therefore a condence interval for with approximate condence coefcient 1 is given by (20) below, provided n is sufciently large. X n z Sn
2
, X n + z
Sn . n
(20)
As an application, consider the Binomial and Poisson distributions.

EXAMPLE 8
Let X1, . . . , Xn be i.i.d. r.v.s from B(1, p). The problem is that of constructing a condence interval for p with approximate condence coefcient 1 . Here S2 n = X n(1 X n), so that (20) becomes X z n Xn 1 Xn
2
),
X n + z
Xn 1 Xn . n
EXAMPLE 9
Let X1, . . . , Xn be i.i.d. r.v.s from P(). Then a condence interval for with approximate condence coefcient 1 is provided by
X n z
Xn . n
The two-sample problem also ts into this scheme, provided both means and variances (known or not) are nite.
412
15
We close this section with a result which shows that there is an intimate relationship between constructing condence regions and testing hypotheses. Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(x; ), r. For each * let us consider the problem of testing the hypothesis H( *): = * at level of signicance , and let A( *) stand for the acceptance region in n. Set Z = (X1, . . . , Xn), z = (x1, . . . , xn), and dene the region T(z) in as follows:
T z = : z A .
() {
( )}
(21)
In other words. T(z) is that subset of with the following property: On the basis of z, every H() is accepted for T(z). From (21), it is obvious that
z A
()
if and only if T z .
()
Therefore
P T Z = P Z A 1 ,
so that T(Z) is a condence region for with condence coefcient 1 . Thus we have the following theorem.
THEOREM 1
( )]
( )]
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f(x; ), r. For each * , consider the problem of testing H( *) : = * at level and let A( *) be the acceptance region. Set Z = (X1, . . . , Xn), z = (x1, . . . , xn), and dene T(z) by (21). Then T(Z) is a condence region for with condence coefcient 1 .
Exercises
15.4.1 Let X1, . . . , Xn be i.i.d. r.v.s with (nite) unknown mean and (nite) known variance 2, and suppose that n is large. iii) Use the CLT to construct a condence interval for with approximate condence coefcient 1 ; iii) What does this interval become if n = 100, = 1 and = 0.05? iii) Refer to part (i) and determine n so that the length of the condence interval is 0.1, provided = 1 and = 0.05. 15.4.2 Refer to the previous problem and suppose that both and 2 are unknown. Then a condence interval for with approximate condence coefcient 1 is given be relation (20). iii) What does this interval become for n = 100 and = 0.05? iii) Show that the length of this condence interval tends to 0 in probability (and also a.s.) as n ; iii) Discuss part (i) for the case that the underlying distribution is B(1, ), = (0, 1) or P(), = (0, ).
15.5 15.2 Tolerance Some Examples Intervals
413
15.4.3 Let X1, . . . , Xn be independent r.v.s having the Negative Exponential distribution with parameter = (0, ) and suppose that n is large. Use the CLT to construct a condence interval for with approximate condence coefcient 1 . Compare this interval with that constructed in Exercise 15.2.2. 15.4.4 Construct condence intervals as in Example 1 by utilizing Theorem 1. 15.4.5 Let X1, . . . , Xn be i.i.d. r.v.s with continuous d.f. F. Use Theorem 4 in Chapter 10 to construct a condence interval for the pth quantile of F, where p = 0.25, 0.50, 0.75. Also identify the condence coefcient 1 if n = 10 for various values of the pair (i, j). 15.4.6 Refer to Example 14, Chapter 12, and show that the posterior p.d.f. of n , given x1, . . . , xn, is Beta with parameters + n j = 1xj and + n j = 1xj. Thus if xp and xp are the lower and the upper pth quantiles, respectively, of the Beta p.d.f. mentioned above, it follows that [xp , xp] is a prediction interval for with condence coefcient 1 2p. (The term prediction interval rather than condence interval is more appropriate here, since is considered to be an r.v. rather than a parameter. Thus the Bayes method of estimation considered in Section 7 of Chapter 12 also leads to the construction of prediction intervals for .) 15.4.7 Refer to Example 15, Chapter 12, and show that the posterior p.d.f. of , given x1, . . . , xn, is N((nx + )/(n + 1), 1/(n + 1)). Then work as in Exercise 15.4.6 to nd a prediction interval for with condence coefcient 1 p. What does this interval become for p = 0.05, n = 9, = 1 and x = 1.5?
15.5 Tolerance Intervals

In the sections discussed so far, we assumed that X1, . . . , Xn were an r. sample with a p.d.f. of known functional form and depending on a parameter . Then for the case that were real-valued, the problem was that of constructing a condence interval for with a preassigned condence coefcient. This problem was solved for certain cases. Now we suppose that the p.d.f. f of the X s is not of known functional form; that is, we assume a nonparametric model. Then the concept of a condence interval, as given in Denition 2, becomes meaningless in the present context. Instead, it is replaced by what is known as a tolerance interval. More precisely, we have the following denition.
DEFINITION 3
Let X1, . . . , Xn be i.i.d. r.v.s with a (nonparametric) d.f. F and let T1 = T1(X1, . . . , Xn) and T2 = T2(X1, . . . , Xn ) be two statistics of the Xs such that T1 T2. For p and with 0 < p, < 1, we say that the interval (T1, T2] is a 100 percent tolerance interval of 100p percent of F if P[F(T2) F(T1) p] .
414
15
If we notice that for the observed values t1 and t 2 of T1 and T2, respectively, F(t 2) F(t1) is the portion of the distribution mass of F which lies in the interval (t1, t 2], the concept of a tolerance interval has an interpretation analogous to that of a condence interval. Namely, suppose the r. experiment under consideration is carried out independently n times and let (t1, t 2] be the resulting interval for the observed values of the Xs. Suppose now that this is repeated independently N times, so that we obtain N intervals (t1, t2]. Then as N gets larger and larger, at least 100 of the N intervals will cover at least 100p percent of the distribution mass of F. Now regarding the actual construction of tolerance intervals, we have the following result.
THEOREM 2
Let X1, . . . , Xn be i.i.d. r.v.s with p.d.f. f of the continuous type and let Yj = X( j), j = 1, . . . , n be the order statistics. Then for any p (0, 1) and 1 i < j n, the r. interval (Yi, Yj] is a 100 percent tolerance interval of 100p percent of F, where is determined as follows:
= g j i d ,
p
()
gji being the p.d.f. of a Beta distribution with parameters = j i and = n j + i + 1. (For selected values of p, and , 1 is read off the Incomplete Beta tables.)
PROOF We wish to show that P[F(Yj) F(Yi) p] = . If we set Zk = F(Yk), k = 1, . . . , n, this becomes
P Z j Zi p = .
This suggests that we shall have to nd the p.d.f. of Zj Zi. Set
W1 = Z1 and Wk = Zk Zk 1 , k = 2, . . . , n.
(22)
Then the determinant of the transformation is easily seen to be 1 and therefore Theorem 3 in Chapter 10 gives
n!, g w1 , . . . , wn = 0,
0 < wk , k = 1, . . . , n, w1 + + wn < 1 otherwise.
From the transformation above, we also have

Z j Zi = W1 + + Wj W1 + + Wi = Wi +1 + + Wj .
) (
Thus it sufces to nd the p.d.f. of Wi+1 + + Wj. Actually, if we set j i = r, then it is clear that the p.d.f. of the sum of any consecutive r Ws is the same. Accordingly, it sufces to determine the p.d.f. of W1 + + Wr. For this purpose, use the transformation Vk = W1 + Wk, k = 1, . . . , n. Then we see that formally we go back to the Zs and therefore
15.5 15.2 Tolerance Some Examples Intervals
415
n!, g 1 , . . . , k = 0,
0 < v1 < < vk < 1 otherwise.
It follows then from Theorem 2(i) in Chapter 10, that the marginal p.d.f. gr is given by
n! v r 1 1 v gr v = r 1 ! n r 0,
() (
)(
n r
0<v<1 otherwise.
By taking into consideration that (m) = (m 1)!, this can be rewritten as follows:
n+1 v r 1 1 v gr v = r n r + 1 0,
()
( () (
n r
0<v<1 otherwise.
But this is the p.d.f. of a Beta distribution with parameters = r and = n r + 1. Since this is also the p.d.f. of Zj Zi, it follows that (22) is true, provided is determined by
g (v)dv = .
1 p r
This completes the proof of the theorem. Let now f be positive in (a, b) with a < b , so that F is strictly increasing. Then, if X is an r.v. with d.f. F, it follows that for any p (0, 1), the r. interval (, X] covers at most 100p percent of the distribution mass of F, and the r. interval (X, ) covers at least 100(1 p) percent of the distribution mass of F, each with probability equal to p. In fact,
P F X p = P X F 1 p = F F 1 p = p,
so that (, X] does cover at most p of the distribution mass of F with probability p, and
P F X > 1 p = 1 P F X 1 p = 1 F F 1 1 p = 1 1 p = p,
[( ) ] [
] [( )
( )] [ ( )]
[( )
[ ( )]
so that (X, ) does cover at least 1 p of the distribution mass of F with probability p, as was to be seen.
416
16
The General Linear Hypothesis
Chapter 16
16.1 Introduction of the Model

In the present chapter, the reader is assumed to be familiar with the basics of linear algebra. However, for the sake of completeness, a brief exposition of the results employed herein is given in Appendix I. For the introduction of the model, consider a certain chemical or physical experiment which is carried out at each one of the (without appreciable error) selected temperatures xj, j = 1, . . . , n which need not be all distinct but they are not all identical either. Assume that a certain aspect of the experiment depends on the temperature and let yj be some measurements taken at the temperatures xj, j = 1, . . . , n. Then one has the n pairs (xj, yj), j = 1, . . . , n which can be represented as points in the xy-plane. One question which naturally arises is how we draw a line in the xy-plane which would t the data best in a certain sense; that is, which would pass through the pairs (xj, yj), j = 1, . . . , n as closely as possible. The reason that this line-tting problem is important is twofold. First, it reveals the pattern according to which the ys depend on the xs, and secondly, it can be used for prediction purposes. Quite often, as is seen by inspection, the pairs (xj, yj), j = 1, . . . , n are approximately linearly related; that is, they lie approximately on a straight line. In other cases, a polynomial of higher degree would seem to t the data better, and still in others, the data is periodic and it is t best by a trigonometric polynomial. The underlying idea in all these cases is that, due to random errors in taking measurements, yj is actually an observed value of a r.v. Yj, j = 1, . . . , n. If it were not for the r. errors, the pairs (xj, yj), j = 1, . . . , n would be (exactly) related as follows for the three cases considered above.
y j = 1 + 2 x j ,
j = 1, . . . , n
(n 2),
(1)
for some values of the parameters 1, 2, or
416
16.1 Introduction of the Model
417
y j = 1 + 2 x j + + k +1 x k j ,
j = 1, . . . , n
(2 k n 1),
(n 2k + 1), ( )
(2)
for some values of the parameters 1, . . . , k+1, or, nally,
y j = 1 + 2 cos t j + 3 sin t j + + 2 k cos kt j + 2 k+1 sin kt j , j = 1, . . . , n
( )
(3)
for some values of the parameters 1, . . . , 2k+1. In the presence of r. errors ej, j = 1, . . . , n, the ys appearing in (1)(3) are observed values of the following r.v.s, respectively:
Yj = 1 + 2 x j + e j ,
j = 1, . . . , n n 2 , j = 1, . . . , n 2 k n 1 ,
j 2 k+1
(1)
Yj = 1 + 2 x j + + k +1 x k j + ej ,
and
Y j = 1 + 2 cos t j + 3 sin t j + + 2 k
( cos( kt ) +
sin kt j , + e j ,
j = 1, . . . , n
(n 2k + 1).
( )
(2)
(3)
At this point, one observes that the models appearing in relations (1)(3) are special cases of the following general model:
Y1 = x11 1 + x 21 2 + + x p1 p + e1 Y2 = x12 1 + x 22 2 + + x p 2 p + e 2 Yn = x1n 1 + x 2 n 2 + + x pn p + e n ,
or in a more compact form

Yj = xij i + e j ,
i =1 p
j = 1, . . . , n with
p n and most often p < n.
(4)
By setting
Y = Y1 , . . . , Yn , = 1 , . . . , p , e = e1 , . . . , en
and
x11 x21 x p1 x11 x12 x1n x x12 x22 x p 2 x22 x2n 21 X= , so that X = x x p1 x p 2 x pn 1n x2n x pn
relation (4) is written as follows in matrix notation:
Y = X + e.
(5)
The model given by (5) is called the general linear model (linear because the parameters 1, . . . , p enter the model in their rst powers only). At this point, it should be noted that what one actually observes is the r. vector Y, whereas the r. vector e is unobservable.
418
16
DEFINITION 1
Let C = (Zij) be an n k matrix whose elements Zij are r.v.s. Then by assuming the EZij are nite, the EC is dened as follows. EC = (EZij). In particular, for Z = (Z1, . . . , Zn), we have EZ = (EZ1, . . . , EZn), and for C = (Z EZ)(Z EZ), we have EC = E[(Z EZ) (Z EZ)]. This last expression is denoted by / z and is called the variancecovariance matrix of Z, or just the covariance matrix of Z. Clearly the (i, j)th element of the n n matrix / z is Co(Zi, Zj), the covariance of Zi and Zj, so that the diagonal elements are simply the variances of the Zs. Since the r.v.s ej, j = 1, . . . , n are r. errors, it is reasonable to assume that Eej = 0 and that 2(ej) = 2, j = 1, . . . , n. Another assumption about the es which is often made is that they are uncorrelated, that is, Co(ei, ej) = 0, for 2 i j. These assumptions are summarized by writing E(e) = 0 and / e = In , where In is the n n unit matrix. By then taking into consideration Denition 1 and the assumptions just made, our model in (5) becomes as follows: / Y = 2 In , Y = X + e, EY = X = , (6) where e is an n 1 r. vector, X is an n p ( p n) matrix of known constants, and is a p 1 vector of parameters, so that Y is an n 1 r. vector. This is the model we are going to concern ourselves with from now on. It should also be mentioned in passing that the expectations j of the r.v.s Yj, j = 1, . . . , n are linearly related to the s and are called linear regression functions. This motivates the title of the present chapter. In the model represented by (6), there are p + 1 parameters 1, . . . , p, 2 and the problem is that of estimating these parameters and also testing certain hypotheses about the s. This is done in the following sections.
16.2 Least Square EstimatorsNormal Equations

According to the model assumed in (6), we would expect to have = X , + e = + e for some . Then the whereas what we actually observe is Y = X principle of least squares (LS) calls for determining , so that the difference between what we expect and what we actually observe is minimum. More precisely, is to be determined so that the sum of squares of errors, Y = e = e j2 ,
2 2 j =1 n
is minimum.
DEFINITION 2
, is Any value of which minimizes the squared norm Y 2, where = X . called a least square estimator (LSE) of and is denoted by The norm of an m-dimensional vector v = (v1, . . . , vm), denoted by v, is the usual Euclidean norm, namely
16.2
Least Square EstimatorsNormal Equations
419
m v = j2 j =1
1 2
For the pictorial illustration of the principle of LS, let p = 2, x1j = 1 and x2j = xj, j = 1, . . . , n, so that j = 1 + 2xj, j = 1, . . . , n. Thus (xj, j), j = 1, . . . , n are n points on the straight line = 1 + 2x and the LS principle species that 1 and 2 be chosen so that jn= 1(Yj j)2 be minimum; Yj is the (observable) r.v. corresponding to xj, j = 1, . . . , n. (See also Fig. 16.1.) (The values of 1 and 2 are chosen in order to minimize the quantity (Y1 1)2 + + (Y5 5)2.) , we have that From (1, . . . , n) = = X
j = xij i ,
i =1
j = 1, . . . , n
and
Y = Yj j
2 j =1
p n = Yj xij i , j =1 i =1
which we denote by S(Y, ). Then any LSE is a root of the equations
Y5 5
1 2 x
Y5 5
Y4 4 3 Y3
Y4 4 Y3 3
Y2 2
x1 x2
2 Y2 0 1 Y1 x3 x4 x5 x
Y1 1
Figure 16.1
420
16
S Y, = 0, = 1, . . . , p v
which are known as the normal equations. Now

p p n n n S Y, = 2 Yj xij j 1 xvj = 2 xvj Yj + 2 xvj xij i , v j =1 i =1 j =1 j =1 i =1
so that the normal equations become
xvj xij i = xvjYj , v = 1, , p.

j =1 i =1 j =1
(7)
The equations in (7) are written as follows in matrix notation

XX = XY, or S = XY, where S = XX .
(7)
Actually, the set of LSEs of coincides with the set of solutions of the normal equations, as the following theorem shows. The normal equations provide a method for the actual calculation of LSEs.
THEOREM 1
of is a solution of the normal equations and any solution of the Any LSE normal equations is an LSE.
PROOF
We have
x11 x 21 x p1 1 x12 x 22 x p 2 2 = X = M x 1n x 2 n x pn p = x11 1 + x 21 2 + + x p1 p , x12 1 + x 22 2 + + x p 2 p , . . . , x1n 1 + x 2 n 2 + + x pn p = 1 x11 , x12 , . . . , x1n
+ 2 x 21 , x 22 , . . . , x 2 n
+ p x p1 , x p 2 , . . . , x pn
= 11 + 2 2 + + p p ,
where j is the jth column of X, j = 1, . . . , n. Thus

= j j
j=1 p
with j , j = 1, . . . , p as above.
(8)
Let Vn be the n-dimensional vector space n and let r ( p) be the rank of X (= rank X). Then the vector space Vr generated by 1, . . . , p is of dimension r
16.2
421
Vn Y X' Y
0 Vr
Figure 16.2 (n = 3, r = 2).
( p), and Vr Vn. Of course, Y Vn and from (8), it follows that Vr. Let be the projection of Y into Vr. Then = p j = 1j j, where j, j = 1, . . . , p may is, however) but may be chosen to be functions not be uniquely determined ( is a function of Y. Now, as is well known, Y X 2 = Y 2 of Y since = . Thus is an LSE of if and only if X , and becomes minimum if = Vr. Clearly, an equivalent condition this is equivalent to saying that Y X j, j = 1, . . . , p, or j(Y X ) = 0, j = 1, . . . , p. From to it is that Y X ) the denition of j, j = 1, . . . , p, this last condition is equivalent to X(Y X = XY, which is the matrix notation for the normal = 0, or equivalently, XX equations. This completes the proof of the theorem. (For a pictorial illustration of some of the arguments used in the proof of the theorem, see Fig. 16.2.) In the course of the proof of the last theorem, it was seen that there exists or and by the theorem itself the totality of LSEs coincides at least one LSE with the set of the solutions of the normal equations. Now a special but important case is that where X is of full rank, that is, rank X = p. Then S = XX is a p p symmetric matrix of rank p, so that S1 exists. Therefore the normal = S1XY. This is part of equations in (7) provide a unique solution, namely the following result.
THEOREM 2
of given by the expression If rank X = p, then there exists a unique LSE = S 1 XY, where S = XX . (9) Furthermore, this LSE is linear in Y, unbiased and has covariance matrix given 2 1 by / = S .
PROOF
and the fact that it is The existence and uniqueness of the LSE given by (9) have already been established. That it is linear in Y follows immediately from (9). Next, its unbiasedness is checked thus: = E S 1 XY = S 1 X E Y = S 1 XX = S 1S = I = . E
422
16
, we need the following Finally, for the calculation of the covariance of auxiliary result:
/ AV = A / V A ,
(10)
where V is an n 1 r. vector with nite covariances and A is an m n matrix of constants. Relation (10) is established as follows:
/ AV = E AV E AV AV E AV = E A V EV V EV A / V A . = A E V EV V EV A = A
( )][ )(
( )]
)(
2 In the present case, A = S1X and V = Y with / Y = In, so that
2 1 1 / = 2S 1XX S 1 = 2S 1S S 1 = S X S X
( )
( )
= 2 I p S 1 = 2S 1 because S and hence S1 is symmetric, so that (S1) = S1. This completes the proof of the theorem. The following denition will prove useful in the sequel.
DEFINITION 3
. Then is called a parametric function. For a known p 1 vector c, set = c A parametric function is called estimable if it has an unbiased, linear (in Y) estimator; that is, if there exists a nonrandom n 1 vector a such that E(aY) = identically in . In connection with estimable functions, the following result holds. Let = c be an estimable function, so that there exists a Vn such that E(aY) = identically in . Furthermore, let d be the projection of a into Vr. Then: i) E(dY) = . ii) 2(aY) 2 (d Y). for any LSE of . iii) dY = c iv) If is any other nonrandom vector in Vr such that E( Y) = , then = d.
PROOF
LEMMA 1
i) The vector a can be written uniquely as follows: a = d + b, where b Vr, Hence a Y = d + b Y = d Y + b Y
and therefore
= E a Y = E d Y + b EY = E d Y + b X .
( )
16.2
423
But bX = 0 since b Vr and thus b j, j = 1, . . . , p, the column vectors of X. Hence E(dY) = . ii) From the decomposition a = d + b mentioned in (i), it follows that a2 = d2 + b2. Next, by means of (10),
/ Ya = 2 a 2 aY = a
Since also
2
( )
=2 d
+2 b .
2 d
by (10) again, we have
= 2 d Y
( ) )
2
2 aY = 2 dY + 2 b
from which we conclude that
( )
2 aY 2 dY .
identically in . But iii) By (i), E(dY) = = c
( )
E d Y = d EY = d X ,
, the = X identically in . Hence dX = c. Next, with so that dX = c ) = 0, since d Vr. Therefore projection of Y into Vr, one has d(Y = c . = d X dY = d iv) Finally, let Vr be such that E(Y) = . Then we have
0 = E Y E d Y = E d Y = d X .
That is, ( d)X = 0 identically in and hence ( d)X = 0, or ( d)X = 0 which is equivalent to saying that d Vr. So, both d Vr and d Vr and hence d = 0. Thus = d, as was to be seen. Part (iii) of Lemma 1 justies the following denition.
DEFINITION 4
) (
[(
) ] (
be an estimable function. Thus there exists a Vn such that E(aY) Let = c (= dY), = c = identically in , and let d be the projection of a into Vr. Set is any LSE of . Then the unbiased, linear (in Y) estimator of is where called the LSE of . We are now able to formulate and prove the following basic result. (GaussMarkov) Assume the model described in (6) and let be an estimable has the smallest variance in the class of all linear in function. Then its LSE Y and unbiased estimators of . Since is estimable there exists a Vn such that E(aY) = identically in , and let d be the projection of a into Vr. Then if bY is any other linear in Y and unbiased estimator of , it follows, by Lemma 1, that 2(bY) , the proof is complete. 2(dY). Since dY =
PROOF
THEOREM 3
424
16
COROLLARY
is estimable, Suppose that rank X = p. Then for any c Vp, the function = c has the smallest variance in the class of all linear in = c and hence its LSE j, Y and unbiased estimators of . In particular, the same is true for each j = 1, . . . , p, where = (1, . . . , p).
PROOF
= S1XY. The rst part follows immediately by the fact that The particular case follows from the rst part by taking c to have all its components equal to zero except for the jth one which is equal to one, for j = 1, . . . , n.
16.3 Canonical Reduction of the Linear ModelEstimation of 2

Assuming the model described in (6), in the previous section we solved the problem of estimating by means of the LS principle. In the present section, we obtain a certain reduction of the linear model under consideration, and as a by-product of it, we also obtain an estimator of the variance 2. For this, it will have to be assumed that r < n as will become apparent in the sequel. Recall that Vr is the r-dimensional vector space generated by the column vectors of X, where r = rank X, so that Vr Vn, Let {1, . . . , r} be an orthonormal basis for Vr (that is, a basis for which ij = 0, i j and j 2 = 1, j = 1, . . . , r). Then this basis can be extended to an orthonormal basis {1, . . . , r, r+1, . . . , n} for Vn. Now since Y Vn, one has that Y = jn= 1Zjj for certain r.v.s Zj, j = 1, . . . , n to be specied below. It follows that i Y = jn= 1Zj ij, so that Zi = iY, i = 1, . . . , n. By letting P be the matrix with rows the vectors i, i = 1, . . . , n, the last n equations are summarized as follows: Z = PY, where Z = (Z1, . . . , Zn). From the denition of P, it is clear that PP = In, so that relation (10) gives / Z = P 2 I n P = 2 I n . Thus
2 Z j = 2 , j = 1, . . . , n.
( )
(11)
Next, let EZ = = (1, . . . , n). Then = E(PY) = P, where Vr. It follows then that
j = 0, j = r + 1, . . . , n.
is the projection of Y into Vr, we have By recalling that
(12)
= Z j j , Y = Z j j and
j=1 j=1
so that
425
= Y
j = r +1
Z
j
2 j
n n = Zj j Zj j = j = r +1 j = r +1
j = r +1
2 j
(13)
2 From (11) and (12), we get that EZ 2 j = , j = r + 1, . . . , n, so that (13) gives 2 2 2 = (n r) . Hence Y /(n r) is an unbiased estimator of 2. EY (Here is where we use the assumption that r < n in order to ensure that n r > 0.) Thus we have shown the following result.
THEOREM 4
In the model described in (6) with the assumption that r < n, an unbiased 2/(n r), where is the projection estimator for 2, 2, is provided by Y 2 as the LSE of Y into Vr and r ( p) is the rank of X. We may refer to 2 of . = S1XY by Theorem 2. Next, the Now suppose that rank X = p, so that rows of X are j, where j, j = 1, . . . , p are the column vectors of X, and j Vp, j = 1, . . . , p. Therefore j i = 0 for all j = 1, . . . , p and i = p + 1, . . . , n. Since j, j = 1, . . . , n are the columns of P, it follows that the last n p elements in all p rows of the p n matrix XP are all equal to zero. Now from the transformation Z = PY one has Y = P1Z. But P 1 = P as follows from the fact = S1XPZ. Because of the special that PP = In. Thus Y = PZ and therefore is a function of Zj, form of the matrix XP menitoned above, it follows that j = 1, . . . , p only (see also Exercise 16.3.1), whereas 2 =
n 1 Z j2 n p j = p +1
by 13 .
( )
By summarizing these results, we have then

COROLLARY
and Let rank X = p (< n). Then the LSEs 2 are functions only of the transformed r.v.s Zj, j = 1, . . , , p and Zj, j = p + 1, . . . , n, respectively. From the last theorem above, it follows that in order for us to be able to actually calculate the LSE 2 of 2, we would have to rewrite 2 in a form appropriate for calculation. To this end, we have Y
REMARK 1
2 = Y X = Y X Y 2
X Y X = Y Y Y X XY + XX = Y + XX XY . = Y Y Y X
)(
) ( Y X )
is (1 n) (n p) ( p 1) = 1 1, that is, a number. Hence But YX = (YX ) = XY. On the other hand, XX XY = 0 since XX = XY YX by the normal equations (7). Therefore
2 XY = Y 2 = Y Y Y j XY. j =1 n
(14)
426
16
Finally, denoting by rv the vth element of the p 1 vector XY, one has rv = xvj Yj , v = 1, . . . , p
j =1 n
(15)
and therefore (14) becomes as follows:

2 r. = Yj2 Y v v j =1 v =1 n p
(16)
As an application of some of the results obtained so far, consider the following example.
EXAMPLE 1
Let Yj = 1 + 2xj + ej, where Eej = 0 and E(eiej) = 2ij, i, j = 1, . . . , n (ij = 1, if i = j and ij = 0 if i j). Clearly, this example ts the model described in (6) by taking
1 x1 1 x 2 X = 1 xn
Next,
and = 1 , 2 .
1 XX = x1
1 1 1 1 x2 xn 1
x1 x2 n = n xj j = 1 xn
= S, x j =1
j =1 n 2 j
x
j
so that the normal equations are given by (7) with S as above and n 1 1 1 n XY = Y1 , Y2 , . . . , Yn = Yj , x j Yj . x1 x2 xn j =1 j =1
(17)
Now
n n n 2 S = n x j2 x j = n x j x , j =1 j =1 j =1 2
so that
(x
j =1
0,
427
provided that not all xs are equal. Then S1 exists and is given by
n 2 xj 1 j =n x j j =1
n x j j =1 . n
S 1 =
1 n x j x
j =1 n
(18)
It follows that
1 = 1 = S 1XY = n 2 n x j x
j =1
n 2 n n n x j Yj x j x j Yj j =1 j =1 j =1 j =1 , n n n x j Yj + n x j Yj j =1 j =1 j =1
so that
n 2 n n n x Y x x Y j j j j j j =1 j =1 j =1 j =1 , 1 = n 2 n x j x j =1 n n n n x j Yj x j Yj 1 1 1 = = = j j j = and 2 n 2 n x j x j =1 2 n n n 2 n x j x = n x 2 x . j j j =1 j =1 j =1
(19)
But
n n n n n x j Yj x j Yj = n x j x Yj Y , j =1 j =1 j =1 j =1
)(
as is easily seen, so that = 2
( x x )(Y Y ) . (x x)
n j =1 i j n 2 j =1 j
(19)
428
16
It is also veried (see also Exercise 16.3.2) that =Y x.

1 2
(19)
1 and 2 given by (19) and (19), respectively, are more The expressions of compact, but their expressions given by (19) are more appropriate for actual calculations. In the present case, (15) gives in conjunction with (17) r1 = Yj
j =1 n
and r2 = x j Yj ,
j =1
so that (16) becomes

n n n 2 Y x Y . = Yj2 Y 1 j 2 j j j =1 j =1 j =1
(20)
Since also r = p = 2, the LSE of 2 is given by

=
2
Y n2
(21)
For a numerical example, take n = 12 and the xs and Ys as follows:

x1 = 30 x 2 = 30 x3 = 30 x 4 = 50 x5 = 50 x 6 = 50 x 7 = 70 x8 = 70 x 9 = 70 x10 = 90 x11 = 90 Y1 = 37 Y7 = 20 Y2 = 43 Y8 = 26 Y3 = 30 Y9 = 22 Y4 = 32 Y10 = 15 Y5 = 27 Y11 = 19 x12 = 90 Y6 = 34 Y12 = 20.
1 = 46.3833 and 2 = 0.3216, Then relation (19) provides us with the estimates 2 and (20) and (21) give the estimate = 14.8939.
Exercises
16.3.1 Referring to the proof of the corollary to Theorem 4, elaborate on the is a function of the r.v.s Zj, j = 1, . . . , r alone. assertion that 16.3.2 16.3.3 Verify relation (19). Show directly, by means of (19) and (19), that
= , E = , 2 = E 1 1 2 2 2
( )
(x
n j =1
2
j
16.4 Testing Hypotheses About E(Y)
429
2 and 1 are normally distributed if the Ys are normally distributed. and that 16.3.4 i) Use relation (18) to show that = 1
2
( )
2 j = 1 x j2
n
nj = 1 x j x
n
= , 2 2
( )
(x
n j =1
2
j
1 and 2 are uncorrelated; and that, if x = 0, then Again refer to Example 1 and suppose that x = 0. Then ii) Conclude that 1 is normally distributed if the Ys are normally distributed; iii) Show that = , 2 = 2 1 2 n
2
( )
( )
n j =1
x j2
and, by assuming that n is even and xj[x, x], j = 1, . . . , n for some x > 0, 2) becomes a minimum if half of the xs are chosen equal conclude that 2( to x and the other half equal to x (if that is feasible). (It should be pointed out, however, that such a choice of the xswhen feasibleneed not be optimal. This is the case, for example, when there is doubt about the linearity of the model.) 16.3.5 Consider the linear model Yj = 1 + 2xj + 3x 2 j + ej, j = 1, . . . , n under the usual assumptions and bring it under the form (6). Then for n = 5 and the data given in the table below nd: i) The LSEs of and 2; (the LSE of ); ii) The covariance of iii) An estimate of the covariance found in (ii).
x y 1 1.0 2 1.5 3 1.3 4 2.5 5 1.7

The assumptions made in (6) were adequate for the derivation of the results obtained so far. Those assumptions did not specify any particular kind of distribution for the r. vector e and hence the r. vector Y. However, in order to be able to carry out tests about , such an assumption will have to be made now. Since the r.v.s ej, j = 1, . . . , n represent errors in taking measurements, it
430
16
is reasonable to assume that they are normally distributed. Denoting by (C) the set of conditions assumed so far, we have then
(C ): Y = X + e,
e: N 0, 2 I n , rank X = r p < n .
The assumption that e: N(0, 2In) simply states that the r.v.s ej, j = 1, . . . , n are uncorrelated normal (equivalently, independent normal) with mean zero and variance 2. and it was seen in (8) that Now from (22), we have that = EY = X Vr, the r-dimensional vector space generated by the column vectors of X. This means that the coordinates of are not allowed to vary freely but they satisfy n r independent linear relationships. However, there might be some evidence that the components of satisfy 0 < q r additional independent linear relationships. This is expressed by saying that actually belongs in Vrq, that is, an (r q)-dimensional vector subspace of Vr. Thus we hypothesize that
(22)
H : Vr q Vr
(q < r )
(23)
and denote by c = C H, that is, the conditions that our model satises if in addition to (C), we also assume H. For testing the hypothesis H, we are going to use the Likelihood Ratio (LR) test. For this purpose, denote by fY(y; , 2), or fY Y (y1, . . . , yn; , 2) the joint p.d.f. of the Ys and let SC and Sc stand for the minimum of
1, . . . , n
S y, = y X = y j EYj
2 j =1
under C and c, respectively. We have
fY y : ,
1 1 = exp 2 2 2 2
n
( y j EYj )
j =1
1 1 S y , . exp = 2 2 2 2
(24)
From (24), it is obvious that for a xed 2, the maximum of fY(Y; , 2) with respect to , under C, is obtained when S(y, ) is replaced by Sc. Thus in order to maximize fY(y; , 2) with respect to both and 2, under C, it sufces to maximize with respect to 2 the quantity
1 1 SC , exp 2 2 2 2
n
or its logarithm n n S 1 log 2 log 2 C 2 . 2 2 2
( )
431
Differentiating with respect to 2 this last expression and equating the derivative to zero, we obtain S n 1 SC 1 + = 0, so that 2 = C . 2 4 2 2 n
The second derivative with respect to 2 is equal to n/(2 4) (SC/ 6) which for 2 2 = 2 becomes n3/(2SC ) < 0. Therefore
n max fY y ; , 2 = C 2SC
n 2
n exp . 2
(25)
In an entirely analogous way, one also has

n max fY y ; , 2 = c 2Sc
n 2
n exp , 2
(26)
so that the LR statistic is given by
S = c SC
where
n 2
(27)
C SC = min S Y, = Y
C
, = Y X C
(28)
= LSE of under C , C
and
c S c = min S Y, = Y
c
, = Y X c
(29)
= LSE of under c . c
is The actual calculation of SC and Sc is done by means of (16), where C and c, respectively. replaced by The LR test rejects H whenever < 0, where 0 is dened, so that the level of the test is . Now the problem which arises is that of determining the distribution of (at least) under H. We will show in the following that the LR test is equivalent to a certain F-test based on a statistic whose distribution is the F-distribution, under H, with specied degrees of freedom. To this end, set
g = 2 n 1.
Then
()
(30)
dg d
( )=2 (
n
n+ 2
< 0,
432
16
so that g() is decreasing. Thus < 0 if and only if g() > g( 0). Taking into consideration relations (27) and (30), the last inequality becomes
n r S c SC > F0 , q SC
where F0 is determined by
n r S c SC PH > F0 = . q S C
Therefore the LR test is equivalent to the test which rejects H whenever
F > F0 , where F = n r Sc SC q SC and F0 = Fq , n r .
jx
(31)
The statistics SC and Sc are given by (28) and (29), respectively, and the distribution of F, under H, is Fq,nr, as is shown in the next section. Now although the F-test in (31) is justied on the basis that it is equivalent to the LR test, its geometric interpretation illustrated by Fig. 16.3 below C is the best estimator of under illuminates it even further. We have that c is the best estimator of under c. Then the F-test rejects H C and C and c differ by too much; equivalently, whenever Sc SC is too whenever large (when measured in terms of SC). be the unique (and unbiased) Suppose now that rank X = p (< n), and let )( ) = 0 because Y , one has LSE of . By the facet that (Y that the joint p.d.f. of the Ys is given by the following expression, where y has been replaced by Y:
2 1 1 2 X . exp n p + X 2 2 2 2 n
Vn SC squared norm of Y Sc squared norm of Vr q 0
C c
Vr
Sc S C squared norm of
Figure 16.3 (n = 3, r = 2, r q = 1).
16.5
Derivation of the Distribution of the F Statistic
433
, This shows that ( 2) is a sufcient statistic for (, 2). It can be shown that it is also complete (this follows from the multiparameter version of Theorem 6 in Chapter 11). By sufciency and completeness, we have then the following result.
THEOREM 5
Under conditions (C) described in (22) and the assumption that rank X = p (< j of j, j = 1, . . . , p have the smallest variance in n), it follows that the LSEs the class of all unbiased estimators of j, j = 1, . . . , n (that is, regardless of whether they are linear in Y or not).
PROOF
j is an unbiased (and linear in Y) estimate of j. It For j = 1, . . . , p, is also of minimum variance (by the LehmannScheff theorem) as it depends only on a sufcient and complete statistic.
Exercises
16.4.1 Show that the MLE and the LSE of 2, 2, and 2, respectively, are related as follows:
nr 2 2 = n 2 =2 and that
where 2 is given in Section 16.4. 16.4.2 Let Yj, j = 1, . . . , n be independent r.v.s where Yj is distributed as
N + xj x , 2 ; xj ,
are known constants, x= and , , 2 are parameters. Then: 1 n xj n j =1
j = 1, . . . , n
ii) Derive the LR test for testing the hypothesis H : = 0 against the alternative A : 0 at level of signicance ; ii) Set up a condence interval for with condence coefcient 1 .
16.5 Derivation of the Distribution of the F Statistic

Consider the three vector spaces Vrq, Vr and Vn(r < n) which are related as follows: Vrq Vr Vn. Following similar arguments to those in Section 16.3, let {q+r, . . . , r} be an orthonormal basis for Vrq and extend it to an orthonormal basis {1, . . . , q, q+1, . . . , r} for Vr and then to an orthonormal basis {1, . . . , q, q+1, . . . , r, r+1, . . . , n} for Vn. Let P be the n n orthogonal
434
16
matrix with rows the vectors J , j = 1, . . . , n, so that PP = In. As in Section 16.3, consider the transformation Z = PY and set EZ = = (1, . . . , n). Then = P, where Vr. Thus j = 0, j = r + 1, . . . , n. Now if H is true, we will further have that Vrq, so that j = 0, j = 1, . . . , q, as follows from the transformation = P. The converse is also, clearly, true. Thus the hypothesis H is equivalent to the hypothesis H : j = 0, By (13) and (28), C SC = Y On the other hand, Y = jZj
j =1 n 2
j = 1, . . . , q.
j = r +1
Z
r
2 j
c = and
j = q +1
Z ,
j j
c is the projection of into Vrq, Therefore (29) gives since

c Sc = Y
2
= Z j2 +
j =1
j = r +1
Z j2 .
Hence
Sc SC = Z j2 ,
j =1
so that
nr F = q
j = 1Z j2 = j = 1Z j2 q . n n j = r +1Z j2 j = r +1Z j2 n r
q q
Now since the Ys are independent and the transformation P is orthogonal, it follows that Zs are also independent. (See Theorem 5, Chapter 9.) Since also 2(Zj) = 2, j = 1, . . . , n by (11), it follows that, under H (or equivalently, H).
Z j2 is 2 q2
j =1
and
j = r +1
Z j2 is 2 n2r .
It follows that, under H (H), the statistic F is distributed as Fq, nr. The distribution of F, under the alternatives, is non-central Fq, nr which is dened in 2 2 terms of a n r and a non-central q distribution. For these denitions, the reader is referred to Appendix II. From the derivations in this section and previous results, one has the following theorem.
16.5
Derivation of the Distribution of the F Statistic
435
THEOREM 6
Assume the model described in (22) and let rank X = p (< n). Then the LSEs and 2 of and 2, respectively, are independent. It is an immediate consequence of the corollary to Theorem 4 and Theorem 5 in Chapter 9.
PROOF
Finally, we should like to emphasize that the transformation of the r.v.s Yj, j = 1, . . . , n to the r.v.s Zj, j = 1, . . . , n is only a technical device for deriving the distribution of F and also for proving unbiasedness of the LSE of 2. For actually carrying out the test and also for calculating the LSE of 2, the Ys rather than the Zs are used. This section is closed with two examples.
EXAMPLE 2
Refer to Example 1 and suppose that the xs are not all equal, and that the Ys are normally distributed. It follows that rank X = r = 2, and the regression line is y = 1 + 2x in the xy-plane. Without loss of generality, we may assume that x1 x2. Then i = 1 + 2 xi, i = 1, 2 are linearly independent, and all j, j = 3, . . . , n are linear combinations of 1 and 2. Therefore V2. Now, suppose we are interested in testing the following hypothesis about the slope of the regression line; namely H1: 2 = 20, where 20 is a given number. Hypothesis H1 is equivalent to the hypothesis H1 : i = 1 + 20 xi, i = 1, 2, from which it follows that, under H1 (or H1), V1. Thus, r q = 1, or q = 1C = Y 2Cx 2C = jn= 1(xj x )/ 1. The LSE of 1 and 2 are , )2(Yj Y n 2 1c = Y 2c = 20. 20x j = 1(xj x ) , whereas under H1 (or H1, the LSE become , n C and SC = Y 2 )2 C = X C 2 = jn= 1(Yj Y Then )2. Likewise, 2C j = 1(xj x 2 n 2 2C) jn= 1(xj x c and Sc = Y ) + 20 (20 2 c = X c = j = 1(Yj Y )2. It 2 n 2 2C 20) j = 1(xj x follows that Sc SC = ( ) , and the test statistic is 2 Sc SC and the cut-off point is F = F1,n2; . F = n ~ F , 0 1, n 2 1 SC Next, suppose we are interested in testing the hypothesis H2: 1 = 10, 2 = 20, where 10 and 20 are given numbers. Hypothesis H2 is equivalent to the hypothesis H2 : i = 10 + 20 xi, i = 1, 2, from which it follows that, under H2 1c = 10, 2c = 20, so that (or H2), V0. Thus, r q = 0, or q = 2. Clearly, c and Sc = jn= 1(Yj 10 20xj)2. It follows that the test statistic c = X 2 Sc SC ~ F2 , n2 , where SC was given above. The cut-off point is here is F = n2 SC F0 = F2,n2;. As mentioned earlier, the linear model adopted in this chapter can also be used for prediction purposes. The following example provides an instance of a prediction problem and its solution.
EXAMPLE 3
Refer to Example 2. Let x0 xj, j = 1, . . . , n and suppose that the independent r.v.s Y0i = 1 + 2x0 + ei, i = 1, . . . , m are to be observed at the point x0. Let Y0 be their sample mean. The problem is that of predicting Y0 and also constructing a prediction interval for Y0. Of course, it is also assumed that if the Y0is were actually observed, they would be independent of the Ys. 0, where Y 0 = 1 + 2x0. Then it follows The r.v. Y0 is to be predicted by Y that EY0 = 1 + 2x0. Thus, if we set Z = Y0 Y0, then EZ = 0. Furthermore, by means of Exercise 16.5.4(i) and (18), we nd (see also Exercise 16.5.3) that
436
16
2 x0 x 1 1 2 . Z =2 + + n m n 2 xj x j =1
(32)
It follows by Theorem 6 that

Z Z 2 2 = Y0 Y 0 2 x0 x 1 1 + + n 2 n 2 m n xj x j =1
2
is tn2 distributed, so that a prediction interval for Y0 with condence coefcient 1 is provided by
[Y st
0
n 2 ; 2
+ st ,Y n 2 ; 0
],
2 x0 x 1 1 + + n 2 n 2 m n xj x j =1
2
where s =
For a numerical example, refer to the data used in Example 1 and let x0 = 60, 0 = 27.0873, s = 1.2703 and t10;0.025 = 2.2281, so that the m = 1 and = 0.05. Then Y prediction interval for Y0 is given by [24.2570, 29.9176].
Exercises
16.5.1 From the discussion in Section 16.5, it follows that the distribution of [(n r) 2]/2 is 2 2 can be used for testing hypotheses nr. Thus the statistic 2 about and also for constructing condence intervals for 2. ii) Set up a condence interval for 2 with condence coefcient 1 ; ii) What is this condence interval in the case of Example 2 when n = 27 and = 0.05? 16.5.2 Refer to Example 2 and: i) Use Exercises 16.3.3 and 16.3.4 to show that
n 1
and
j = 1 x j2 ( 2 2)
n
Exercises
437
are distributed as N(0, 1), provided x = 0; ii) Use Theorem 6 and Exercise 16.5.1 to show that
n 1
2 2 are distributed as tn2. Thus the r.v.s guring in (ii) may be used for testing hypotheses about 1 and 2 and also for constructing condence intervals for 1 and 2; iii) Set up the test for testing the hypothesis H : 1 = 0 (the regression line passes through the origin) against A : 1 0 at level and also construct a 1 condence interval for 1; iv) Set up the test for testing the hypothesis H : 2 = 0 (the Ys are independent of the xs) against A : 2 0 at level and also construct a 1 condence interval for 2; v) What do the results in (iii) and (iv) become for n = 27 and = 0.05?
16.5.3 Verify relation (32). 16.5.4 Refer to Example 3 and suppose that the r.v.s Y0i = 1 + 2x0 + ei, i = 1, . . . , m corresponding to an unknown point x0 are observed. It is assumed that the r.v.s Yj, j = 1, . . . , n and Y0i, i = 1, . . . , m are all independent. ii) Derive the MLE x 0 of x0; 2x0, where Y0 is the sample mean of the Y0is and show ii) Set V = Y0 1 that the r.v.
and
j =1 ( x j x )
n
(m + n) (m + n 3)
2
V V
,
2
where
2 x0 x 1 1 = + + n m n j = 1 x j x 2 V 2
and 2 = 1 n Yj 1 2 x j m+ n j =1
m 2 + Y0i Y0 , i =1
is distributed as tm+n3. 16.5.5 Refer to the model considered in Example 1 and suppose that the xs and the observed values of the Ys are given by the following table:
438
16
x y
5 0.10
10 0.21
15 0.30
20 0.35
25 0.44
30 0.62
i) Find the LSEs of 1, 2 and 2 by utilizing the formulas (19), (19) and (21), respectively; ii) Construct condence intervals for 1, 2 and 2 with condence coefcient 1 = 0.95 (see Exercises 16.5.1 and 16.5.2(ii)); iii) On the basis of the assumed model, predict Y0 at x0 = 17 and construct a prediction interval for Y0 with condence coefcient 1 = 0.95 (see Example 3). 16.5.6 The following table gives the reciprocal temperatures (x) and the corresponding observed solubilities of a certain chemical substance.
3.80 1.27 1.32 1.50
3.72 1.20 1.26
3.67 1.10 1.07
3.60 0.82 0.84 0.80
3.54 0.65 0.57 0.62
Assume the model considered in Example 1 and discuss questions (i) and (ii) of the previous exercise. Also discuss question (iii) of the same exercise for x0 = 3.77. 16.5.7 Let Zj, j = 1, . . . , n be independent r.v.s, where Zj is distributed as N(j, 2). Suppose that j = 0 for j = r + 1, . . . , n whereas 1, . . . , r, 2 are parameters. Then derive the LR test for testing the hypothesis H : 1 = 1 against the alternative A : 1 1 at level of signicance . 16.5.8 Consider the r.v.s of Exercise 16.4.2 and transform the Ys to Zs by means of an orthogonal transformation P whose rst two rows are
n 2 x1 x x x 1 1 2 ,..., n ,..., , sx = xj x . , sx n sx j =1 n
Then: ii) Show that the Zs are as in Exercise 16.5.7 with r = 2, 1 = sx, 2 = ; ii) Set up the test mentioned in Exercise 16.5.7 and then transform the Zs back to Ys. Also compare the resulting test with the test mentioned in Exercise 16.4.2.
Exercises
439
16.5.9 Let Yi = 1 + 2xi + ei, i = 1, . . . , m, Y * j = * 1 + * 2 x* j + e* j, j = 1, . . . , n, where the es and e*s are independent r.v.s distributed as N(0, 2). Use Exercises 16.3.3, 16.3.4 and 16.5.1 to test the hypotheses H1 : 1 = * 1, H2 : 2 = * 2 against the corresponding alternatives A1 : 1 * 1, A2 : 2 * 2 at level of signicance .
440
17
Chapter 17
The Analysis of Variance techniques discussed in this chapter can be used to study a great variety of problems of practical interest. Below we mention a few such problems. Crop yields corresponding to different soil treatment. Crop yields corresponding to different soils and fertilizers. Comparison of a certain brand of gasoline with and without an additive by using it in several cars. Comparison of different brands of gasoline by using them in several cars. Comparison of the wearing of different materials. Comparison of the effect of different types of oil on the wear of several piston rings, etc. Comparison of the yields of a chemical substance by using different catalytic methods. Comparison of the strengths of certain objects made of different batches of some material. Identication of the melting point of a metal by using different thermometers. Comparison of test scores from different schools and different teachers, etc. Below, we discuss some statistical models which make the comparisons mentioned above possible.
17.1 One-way Layout (or One-way Classication) with the Same Number of Observations Per Cell
The models to be discussed in the present chapter are special cases of the general model which was studied in the previous chapter. In this section, we consider what is known as a one-way layout, or one-way classication, which we introduce by means of a couple of examples.
440
17.1
One-way Layout (or One-way Classication)
441
EXAMPLE 1
Consider I machines, each one of which is manufactured by I different companies but all intended for the same purpose. A purchaser who is interested in acquiring a number of these machines is then faced with the question as to which brand he should choose. Of course his decision is to be based on the productivity of each one of the I different machines. To this end, let a worker run each one of the I machines for J days each and always under the same conditions, and denote by Yij his output the jth day he is running the ith machine. Let i be the average output of the worker when running the ith machine and let eij be his error (variation) the jth day when he is running the ith machine. Then it is reasonable to assume that the r.v.s eij are normally distributed with mean 0 and variance 2. It is further assumed that they are independent. Therefore the Yijs are r.v.s themselves and one has the following model. Yij = i + eij where eij are independent N 0, 2
for i = 1, . . . , I 2 ; (1)
( ) j = 1, . . . , J ( 2).
EXAMPLE 2
For an agricultural example, consider I J identical plots arranged in an I J orthogonal array. Suppose that the same agricultural commodity (some sort of a grain, tomatoes, etc.) is planted in all I J plots and that the plants in the ith row are treated by the ith kind of I available fertilizers. All other conditions assumed to be the same, the problem is that of comparing the I different kinds of fertilizers with a view to using the most appropriate one on a large scale. Once again, we denote by i the average yield of each one of the J plots in the ith row, and let eij stand for the variation of the yield from plot to plot in the ith row, i = 1, . . . , I. Then it is again reasonable to assume that the r.v.s eij, i = 1, . . . , I; j = 1, . . . , J are independent N(0, 2), so that the yield Yij of the jth plot treated by the ith kind of fertilizer is given by (1). One may envision the I objects (machines, fertilizers, etc.) as being represented by the I spaces between I + 1 horizontal (straight) lines and the J objects (days, plots, etc.) as being represented by the J spaces between J + 1 vertical (straight) lines. In such a case there are formed IJ rectangles in the resulting rectangular array which are also referred to as cells (see also Fig. 17.1). The same interpretation and terminology is used in similar situations throughout this chapter. In connection with model (1), there are three basic problems we are interested in: Estimation of i, i = 1, . . . , I; testing the hypothesis: H : 1 = = I (=, unspecied) (that is, there is no difference between the I machines, or the I kind of fertilizers) and estimation of 2. Set
Y = Y11 , . . . , Y1 J ; Y21 , . . . , Y2 J ; . . . ; YI , . . . , YI
11 1 1J I 21
( e = (e , . . . , e ; e = ( , . . . , )
, . . . , e2 J ; . . . ; eI , . . . , eI
442
17
1 1 2
J1
(i, j th) cell
I1 I
Figure 17.1
I 444 6444 7 8 1 0 0 0 J 1 0 0 0 0 1 0 0 0 J X = 0 1 0 0 0 0 0 1 J 0 0 0 1
+ e. Thus we have the model described in (6) Then it is clear that Y = X of Chapter 16 with n = IJ and p = I. Next, the I vectors (1, 0, , 0), (0, 1, 0, . . . , 0), . . . , (0, 0, . . . , 0, 1) are, clearly, independent and any other row vector in X is a linear combination of them. Thus rank X = I (= p), that is, X
17.1
443
is of full rank. Then by Theorem 2, Chapter 16, i = 1, . . . , I have uniquely determined LSEs which have all the properties mentioned in Theorem 5 of the same chapter. In order to determine the explicit expression of them, we observe that
J 0 0 J S = XX = 0 0 0 0 0 0 = JIp 0 J
and
J J J XY = Y1 j , Y2 j , . . . , YIJ , j =1 j =1 j =1
so that, by (9), Chapter 16,

J J J = S 1 XY = 1 Y , 1 Y , . . . , 1 Y . IJ J 1j J 2 j J j =1 j =1 j =1
Therefore the LSEs of the s are given by 1 J i = Yi ., where Yi . = Yij , J j =1 Next, one has
647 J 48 647 J 48 J4 64 7 8 = EY = 1 , . . . , 1 ; 2 , . . . , 2 ; . . . ; I , . . . , I , so that, under the hypothesis H : 1 = = I (= , unspecied), V1. That is, r q = 1 and hence q = r 1 = p 1 = I 1. Therefore, according to (31) in Chapter 16, the F statistic for testing H is given by
F = n r Sc SC I J 1 Sc SC = . q I 1 SC SC
i = 1, . . . , I .
(2)
(3)
Now, under H, the model becomes Yij = + eij and the LSE of is obtained by differentiating with respect to the expression Y c
2
= Yij .
2 i =1 j =1
One has then the (unique) solution = Y. . , where Y. . = 1 IJ
Y .
ij i =1 j =1
(4)
Therefore relations (28) and (29) in Chapter 16 give
444
17
C SC = Y and c Sc = Y But for each xed i,
ij ,C = Yij
i =1 j =1
) = (Y
2 i =1 j =1 2 I J ij
ij
Yi .
ij ,c = Yij
i =1 j =1
) = (Y
i =1 j =1 2 ij
Y. . .
(Y
so that
j =1
ij
Yi .
I
) = Y
2 j =1 J
JY i2. ,
SC = SSe , where SSe = Yij Yi .

i =1 j =1
) = Y
2 i =1 j =1 2 I J
2 ij
J Y i2. .
i =1
(5)
Likewise, Sc = SST , where SST = Yij Y. .

i =1 j =1 I J
) = Y
i =1 j =1
2 ij
IJY .2 . ,
(6)
so that, by means of (5) and (6), one has

I I I 2 Sc SC = J Y i2. IJY .2 . = J Yi2. IY .2 . = J Yi . Y. . , i =1 i =1 i =1
since Y. . = That is, Sc SC = SSH, where

SSH = J Yi . Y. .
i =1 I
1 I 1 I 1 J Y = Yi . . J ij I i =1 I i =1 j =1 (7)
= J Y i2. IJY .2 . .
i =1
Therefore the F statistic given in (3) becomes as follows:
F =
where
I J 1 SS H MS H = , I 1 SS e MS e
(8)
SS H SS e , MS e = I 1 I ( J 1) and SSH and SSe are given by (7) and (5), respectively. These expressions are also appropriate for actual calculations. Finally, according to Theorem 4 of Chapter 16, the LSE of 2 is given by MS H = 2 = SS e . I ( J 1) (9)
17.1
445
Table 1 Analysis of Variance for One-Way Layout source of variance degrees of freedom
2
sums of squares
SS H = J (Y i . Y. . )
i =1 I
mean squares
between groups
I1
MS H =
SS H I 1
within groups
SS e = Y ij Y i .
i =1 j =1 I J
I( J 1)
MS e =
SS e I( J 1)
total
SS T = Y ij Y. .
i =1 j =1
IJ 1
From (5), (6) and (7) it follows that SST = SSH + SSe. Also from (6) it follows that SST stands for the sum of squares of the deviations of the Yijs from the grand (sample) mean Y. .. Next, from (5) we have that, for each i, Jj = 1(Yij Yi .)2 is the sum of squares of the deviations of Yij, j = 1, . . . , J within the ith group. For this reason, SSe is called the sum of squares within groups. On the other hand, from (7) we have that SSH represents the sum of squares of the deviations of the group means Yi. from the grand mean Y. . (up to the factor J). For this reason, SSH is called the sum of squares between groups. Finally, SST is called the total sum of squares for obvious reasons, and as mentioned above, it splits into SSH and SSe. Actually, the analysis of variance itself derives its name because of such a split of SST. Now, as follows from the discussion in Section 5 of Chapter 16, the 2 quantities SSH and SSe are independently distributed, under H, as 2 I 1 and 2 2 2 2 I(J1), respectively. Then SST is IJ1 distributed, under H. We may summarize all relevant information in a table (Table 1) which is known as an Analysis of Variance Table.
REMARK 1 EXAMPLE 3
For a numerical example, take I = 3, J = 5 and let Y11 = Y12 = Y13 = Y14 = Y15 = We have then 82 83 75 79 78 Y21 = Y22 = Y23 = Y24 = Y25 = 61 62 67 65 64 Y31 = 78 Y31 = 72 Y33 = 74 Y34 = 75 Y35 = 72
1 = 79.4,
2 = 63.8,
3 = 74.2
and MSH = 315.5392, MSe = 7.4, so that F = 42.6404. Thus for = 0.05, F2,12;0.05, 2 = MSe = 7.4. = 3.8853 and the hypothesis H : 1 = 2 = 3 is rejected. Of course,
446
17
Exercise
17.1.1 Apply the one-way layout analysis of variance to the data given in the table below.
A 10.0 11.5 11.7 B 9.1 10.3 9.4 C 9.2 8.4 9.4
17.2 Two-way Layout (Classication) with One Observation Per Cell

The model to be employed in this paragraph will be introduced by an appropriate modication of Examples 1 and 2.
EXAMPLE 4
Referring to Example 1, consider the I machines mentioned there and also J workers from a pool of available workers. Each one of the J workers is assigned to each one of the I machines which he runs for one day. Let ij be the daily output of the jth worker when running the ith machine and let eij be his error. His actual daily output is then an r.v. Yij such that Yij = ij + eij. At this point it is assumed that each ij is equal to a certain quantity , the grand mean, plus a contribution i due to the ith row (ith machine), and called the ith row effect, plus a contribution j due to the jth worker, and called the jth column effect. It is further assumed that the I row effects and also the J column effects cancel out each other in the sense that
i = j = 0.
i =1 j =1
Finally, it is assumed, as is usually the case, that the r. errors eij, i = 1, . . . , I; j = 1, . . . , J are independent N(0, 2). Thus the assumed model is then Yij = + i + j + eij , where
i = j = 0
i =1 j =1
(10)
and eij, i = 1, . . . , I ( 2); j = 1, . . . , J ( 2) are independent N(0, 2).

EXAMPLE 5
Consider the identical I J plots described in Example 2, and suppose that J different varieties of a certain agricultural commodity are planted in each one of the I rows, one variety in each plot. Then all J plots in the ith row are treated by the ith of I different kinds of fertilizers. Then the yield of the jth variety of the commodity in question treated by the ith fertilizer is an r.v. Yij which is assumed again to have the structure described in (10). Here the ith row effect
17.2
Two-way Layout (Classication) with One Observation Per Cell
447
is the contribution of the ith fertilized and the jth column effect is the contribution of the jth variety of the commodity in question. From the preceding two examples it follows that the outcome Yij is affected by two factors, machines and workers in Example 4 and fertilizers and varieties of agricultural commodity in Example 5. The I objects (machines or fertilizers) and the J objects (workers or varieties of an agricultural commodity) associated with these factors are also referred to as levels of the factors. The same interpretation and terminology is used in similar situations throughout this chapter. In connection with model (10), there are the following three problems to be solved: Estimation of ; i, i = 1, . . . , I; j, j = 1, . . . , J; testing the hypothesis HA : 1 = = I = 0 (that is, there is no row effect), HB : 1 = = J = 0 (that is, there is no column effect) and estimation of 2. We rst show that model (10) is a special case of the model described in (6) of Chapter 16. For this purpose, we set
Y = Y11 , . . . , Y1 J ; Y21 , . . . , Y2 J ; . . . ; YI 1 , . . . , J IJ
11 1J 21 2J I1
( e = (e , . . . , e ; e , . . . , e ; . . . ; e = ( ; , . . . , ; , . . . , )
1 I 1 J
, . . . , e IJ
and
1 1 1 1 1 X = 1 1 1 1
I 4448 64447 1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0
J 444 6444 4 7 4 8 1 0 0 0 0 1 0 0 J 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 0 0 J 1
0 0 1 0 0 1 0 0 1
1 0 0 0 1 0 0 0
0 0 J 0 0 1
448
17
and then we have

Y = X + e with n = IJ and p = I + J + 1.
It can be shown (see also Exercise 17.2.1) that X is not of full rank but rank X = r = I + J 1. However, because of the two independent restrictions
=
i i =1 j =1
= 0,
imposed on the parameters, the normal equations still have a unique solution, as is found by differentiation. In fact, S Y, = Yij. i j
i =1 j =1
( )
and
S Y, = 0
( )
= Y. ., where Y. . is again given by (4); implies
S Y, = 0 a i implies i = Yi . Y. ., where Yi. is given by (2) and (/j)S (Y, ) = 0 implies j = Y.j Y. ., where
1 I Yij . I i =1 Summarizing these results, we have then that the LSEs of , i and j are, respectively, Y. j =
= Y Y , j = 1, . . . , J . = Y. . , i = Yi. Y. . , i = 1, . . . , I , j .j ..
(11)
where Yi ., i = 1, . . . , I are given by (2), Y. . is given by (4) and
Y. j =
1 I Yij , j = 1, . . . , J . I i =1
(12)
Now we turn to the testing hypotheses problems. We have
EY = = X : 1 , . . . , I ; 1 , . . . , J
Consider the hypothesis
Vr , where r = I + J 1.
HA : 1 = = I = 0. Then, under HA, Vrq, where r qA = J, so that qA = I 1. Next, under HA again, S(Y, ) becomes
(Y
i =1 j =1
ij
from where by differentiation, we determine the LSEs of and j, to be j,A, respectively. That is, one has A and denoted by
17.2
Two-way Layout (Classication) with One Observation Per Cell
449
= Y Y = , j = 1, . . . , J . A = Y. . = , j, A .j .. j
(13)
Therefore relations (28) and (29) in Chapter 16 give by means of (11) and (12) C SC = Y and c Sc = Y
A
ij ,C = Yij
i =1 j =1
(
I
) = (Y
2 i =1 j =1 2 I
ij
Yi . Y. j + Y. .
2
A
ij ,c = Yij
i =1 j =1
) = (Y
J i =1 j =1
ij
Y. j .
Now SC can be rewritten as follows:

SC = SSe = Yij Y. j Yi . Y. .
i =1 j =1 I J I J
[(
(
) (
2
)]
= Yij Y. j
i =1 j =1
J Yi . Y. .
i =1
(14)
because
(Yij Y. j )(Yi . Y. . ) = (Yi . Y. . ) (Yij Y. j )

i =1 j =1 i =1 j =1
= J Yi . Y. . .
2 i =1
Therefore
2 Sc SC = SS A , where SS A = J i = J Yi . Y. .
A
i =1 I
i =1
2 = J Yi 2 . IJY . . . i =1
(15)
It follows that for testing HA, the F statistic, to be denoted here by FA, is given by
FA =
(I 1)( J 1) SS
I 1
SSe
MS A , MSe
(16)
where
MS A =
SS A , I 1
MS e =
SS e I 1 J 1
)(
and SSA, SSe are given by (15) and (14), respectively. (However, for an expression of SSe to be used in actual calculations, see (20) below.)
450
17
Next, for testing the hypothesis HB : 1 = = J = 0, we nd in an entirely symmetric way that the F statistic, to be denoted here by FB, is given by
FB =
(I 1)( J 1) SS
J 1
J J
SSe
MSB , MSe
(17)
where MSB = SSB /(J 1) and 2 = I SSB = Sc SC = I Y. j Y. . j

B
j =1
j =1
2 = I Y. 2 j IJY . . . j =1
(18)
The quantities SSA and SSB are known as sums of squares of row effects and column effects, respectively. Finally, if we set SST = Yij Y. .
i =1 j =1 I J
) = Y
2 i =1 j =1
2 ij
IJY.2. ,
(19)
we show below that SST = SSe + SSA + SSB from where we get SSe = SST SSA SSB. (20)
Relation (20) provides a way of calculating SSe by way of (15), (18) and (19). Clearly,
SSe = Yij Y. . Yi . Y. . Y. j Y. .
i =1 j =1 I J
[(
(
) (
2 2
) (
)]
= Yij Y. .
i =1 j =1 J
+ J Yi . Y. .
i =1 I J
+ I Y. j Y. .
j =1 I J
2 Yij Y. . Yi . Y. .
i =1 j =1
)(
2 Yij Y. . Y. j Y. .
i =1 j =1 I J
)(
) )
+ 2 Yi . Y. . Y. j Y. . = SSTT SS A SSB
i =1 j =1
)(
because
(Yij Y. . )(Yi . Y. . ) = (Yi . Y. . ) (Yij Y. . )

i =1 j =1 i =1 j =1
= J Yi . Y. .
i =1
= SS A ,
Exercises
451
Table 2 Analysis of Variance for Two-way Layout with One Observation Per Cell source of variance degrees of freedom
2
sums of squares
2 SS A = J i = J (Y i . Y. . )
i =1 i =1 I I
mean squares
rows
I1
MS A =
SS A I 1 SS B J 1
columns
2=I SS B = I Y. j Y. . j
j =1 j =1 I J
J1
MS B =
residual
SS e = Y ij Y i . Y. j + Y. .
i =1 j =1 I J
( I 1) ( J 1)
IJ 1
MS e =
( I 1)( J 1)
SS e
total
SS T = Y ij Y. .
i =1 j =1
(Y
i =1 j =1
ij
Y. . Y. j Y. . = Y. j Y. .
j =1 J
)(
) (Y
i =1
ij
Y. .
= I Y. j Y. .
j =1
= SSB
and
(Y
i =1 j =1
i.
Y. . Y. j Y. . = Yi . Y. .
i =1
)(
) (Y
j =1
.j
Y. . = 0.
The pairs SSe, SSA and SSe, SSB are independent 2 2 distributed r.v.s with certain degrees of freedom, as a consequence of the discussion in Section 5 of Chapter 16. Finally, the LSE of 2 is given by 2 = MSe. This section is closed by summarizing the basic results in Table 2 above. (21)
Exercises
17.2.1 Show that rank X = I + J 1, where X is the matrix employed in Section 2. 17.2.2 Apply the two-way layout with one observation per cell analysis of variance to the data given in the following table (take = 0.05).
452
17
3 1 1
7 2 2
5 0 4
4 2 0
17.3 Two-way Layout (Classication) with K ( 2) Observations Per Cell

In order to introduce the model of this section, consider Examples 4 and 5 and suppose that K ( 2) observations are taken in each one of the IJ cells. This amounts to saying that we observe the yields Yijk, k = 1, . . . , K of K identical plots with the (i, j)th plot, that is, the plot where the jth agricultural commodity was planted and it was treated by the ith fertilizer (in connection with Example 5); or we allow the jth worker to run the ith machine for K days instead of one day (Example 4). In the present case, the relevant model will have the form Yijk = ij + eijk. However, the means ij, i = 1, . . . , I; j = 1, . . . , J need not be additive any longer. In other words, except for the grand mean and the row and column effects i and j, respectively, which in the previous section added up to make ij, we may now allow interactions ij among the various factors involved, such as fertilizers and varieties of agricultural commodities, or workers and machines. It is not unreasonable to assume that, on the average, these interactions cancel out each other and we shall do so. Thus our present model is as follows: Yijk = + i + j + ij + eijk, where
I J J I
(22)
= =
i j i =1 j =1 j =1
ij
= ij = 0
i =1
for all i and j and eijk, i = 1, . . . , I ( 2); j = 1, . . . , J ( 2); k = 1, . . . , K ( 2) are independent N(0, 2). Once again the problems of main interest are estimation of , i, j and ij, i = 1, . . . , I; j = 1, . . . , J; testing the hypotheses: HA : 1 = = I = 0, HB : 1 = = J = 0 and HAB : ij = 0, i = 1, . . . , I; j = 1, . . . , J (that is, there are no interactions present); and estimation of 2. By setting
Y = Y111 , . . . , Y11K ; . . . ; Y1 J 1 , . . . , Y1 JK ; . . . ; YIJ 1 . . . , YIJK

111 11
( e = (e = (
, . . . , e11K ; . . . ; e1 J 1 , . . . , e1 JK ; . . . ; e IJ 1 , . . . , e IJK
, . . . , 1 J ; . . . ; I 1 , . . . . IJ
and
453
IJ 444444 644444 4 7 8 1 0 0 0 K 1 0 0 0 0 1 0 0 K 0 1 0 0 J 6447448 0 0 1 0 0 K X = 0 0 1 0 0 I 1 J +1 64444 7 4444 8 0 0 1 0 0 K 0 0 1 0 0 1 0 0 K 0 0 1
,
(22)
it is readily seen that +e Y = X with n = IJK and p = IJ, so that model (22) is a special case of model (6) in Chapter 16. From the form of X it is also clear that rank X = r = p = IJ; that is, X is of full rank (see also Exercise 17.3.1). Therefore the unique LSEs of the parameters involved are obtained by differentiating with respect to ij the expression S Y, = Yijk ij .
2 i =1 j =1k =1
( )
We have then
454
17
ij = Yij. ,
i = 1. . . . , I ;
j = 1, . . . , J .
(23)
Next, from the fact that ij = + i + j + ij and on the basis of the assumptions made in (22), we have
= . ., i = i. . ., j = .j . ., ij = ij i. .j + . .,
(24)
by employing the dot notation already used in the previous two sections. From (24) we have that , i, j and ij are linear combinations of the parameters ij. Therefore, by the corollary to Theorem 3 in Chapter 16, they are , , i, ij, are given by the above-mentioned linear estimable, and their LSEs j combinations, upon replacing ij by their LSEs. It is then readily seen that = Y. . . , i = Yi. . Y. . . , = Y Y , j . j. ... (25) i = 1, . . . , I ; j = 1, . . . , J . ,+ ij = + i + ij. Therefore Now from (23) and (25) it follows that j ij SC = Yijk Next,
i =1 j =1k =1 I J K
ij = Yij. Yi. . Y. j. + Y. . . ,
. i = Yijk j ij
i =1 j =1 k =1
+ i Yijk ij = Yijk j ij
i i j j ij
and hence
) ( + ( ) + ( + ( )
)
2
+ ij
S Y, = Yijk ij
i =1 j =1k =1 I
( )
= SC + IJK
J
i i + JK
i =1
+ IK j j
j =1
+ K ij ij ,
2 i =1 j =1
(26)
because, as is easily seen, all other terms are equal to zero. (See also Exercise 17.3.2.) From identity (26) it follows that, under the hypothesis HA : 1 = = I = 0, the LSEs of the remaining parameters remain the same as those given in (25). It follows then that
i2 , so that Sc SC = JK i2 . Sc A = SC + JK A
i =1 i =1
Thus for testing the hypothesis HA the sum of squares to be employed are SC = SSe = Yijk Yij .
i =1 j =1k =1 I J K I J K
2 = Yijk K Yij2 , i =1 j =1k =1 i =1 j =1
(27)
and
455
i2 = JK Yi . . Y. . . Sc SC = SS A = JK
A
i =1
i =1
= JK Yi2. . IJKY.2. . .
i =1
(28)
For the purpose of determining the dimension r qA of the vector space in which = EY lies under HA, we observe that i . . . = i, so that, under HA, i . . . = 0, i = 1, . . . , I. For i = 1, . . . , I 1, we get I 1 independent linear relationships which the IJ components of satisfy and hence r qA = IJ (I 1). Thus qA = I 1 since r = IJ. Therefore the F statistic in the present case is
FA = IJ K 1 SS A MS A = , I 1 SS e MS e SS A , I 1 SS e IJ K 1
(29)
where
MS A = MS e =
and SSA, SSe are given by (28) and (27), respectively. For testing the hypothesis HB : 1 = = J = 0, we nd in an entirely symmetric way that the F statistic to be employed is given by
FB =
where MSB = SSB J 1
J j =1
IJ K 1 SS B MS B = , J 1 SS e MS e
2
(30)
and
2 = IK SSB = IK Y. j . Y. . . j
j =1 j =1
2 = IK Y. 2 j . IJKY . . . .
(31)
Also for testing the hypothesis HAB : ij = 0, i = 1, . . . , I; j = 1, . . . , J,
arguments similar to the ones used before yield the F statistic, which now is given by
F AB =
SS AB MS AB = , MS e I 1 J 1 SS e
IJ K 1
)(
(32)
where
456
17
MS AB =
SS AB I 1 J 1
)(
J
and
2 SS AB = K ij i =1 j =1
= K Yij . Yi . . Y. j . + Y. . . .
2 i =1 j =1
(33)
(However, for an expression of SSAB suitable for calculations, see (35) below.) Finally, by setting SST = Yijk Y. . .
i =1 j =1k =1 I J K I J K
2 = Yijk IJKY.2. . , i =1 j =1k =1
(34)
we can show (see Exercise 17.3.3) that SST = SSe + SSA + SSB + SSAB, so that SSAB = SST SSe SSA SSB. (35)
Relation (35) is suitable for calculating SSAB in conjunction with (27), (28), (31) and (34). Of course, the LSE of 2 is given by 2 = MSe. (36)
Once again the main results of this section are summarized in a table, Table 3. The number of degrees of freedom of SST is calculated by those of SSA, SSB, SSAB and SSe, which can be shown to be independently distributed as 2 2 r.v.s with certain degrees of freedom.
EXAMPLE 6
For a numerical application, consider two drugs (I = 2) administered in three dosages (J = 3) to three groups each of which consists of four (K = 4) subjects. Certain measurements are taken on the subjects and suppose they are as follows: X111 = X112 = X113 = X114 = X211 = X212 = X213 = X214 = For this data we have = 50.5416; = 16.2084; 3 22 = 1.4166, 1 = 2.5417, 11 = 0.7917, 23 = 2.2084 = 17.0416, = 0.8334, 2 = 2.5416; 1 2 12 = 1.4167, 13 = 2.2083, 21 = 0.7916, 18 20 50 53 34 36 40 17 X121 X122 X123 X124 X221 X222 X223 X224 = 64 = 49 = 35 = 62 = 40 = 63 = 35 = 63 X131 X132 X133 X134 X231 X232 X233 X234 = = = = = = = = 61 73 62 90 56 61 58 73
Exercises
457
Table 3 Analysis of Variance for Two-way Layout with K ( 2) Observations Per Cell source of variance degrees of freedom
2
sums of squares
mean squares
MS A = SS A I 1 SS B J 1
A main effects
i2 = JK (Y i . . + Y. . . ) SS A = JK
i =1 i =1
J J
I1
B main effects
2 = IK SS B = IK Y. j. Y. . . j
j =1 j =1 I J I J
J1
MS B =
AB interactions
SS AB = K 2 ij = K Yij . Yi . . Y. j . + Y. . .
i =1 j =1 i =1 j =1 I J K
( I 1)( J 1)
IJ ( K 1)
MS AB =
( I 1)( J 1)
SS e IJ ( K 1)
SS AB
error
SS e = Y ijk Y ij .
i =1 j =1 k =1 I J K
MS e =
total
SS T = Y ijk Y. . .
i =1 j =1 k =1
IJK 1
and FA = 0.8471, FB = 12.1038, FAB = 0.1641. Thus for = 0.05, we have F1,18;0.05 = 4.4139 and F2,18;0.05 = 3.5546; we accept HA, reject HB and accept HAB. Finally, we have 2 = 183.0230. The models analyzed in the previous three sections describe three experimental designs often used in practice. There are many others as well. Some of them are taken from the ones just described by allowing different numbers of observations per cell, by increasing the number of factors, by allowing the row effects, column effects and interactions to be r.v.s themselves, by randomizing the levels of some of the factors, etc. However, even a brief study of these designs would be well beyond the scope of this book.
Exercises
17.3.1 17.3. 17.3.2 Show that rank X = IJ, where X is the matrix employed in Section Verify identity (26).
458
17
17.3.3 Show that SST = SSe + SSA + SSB + SSAB, where SSe, SSA, SSB, SSAB and SST are given by (27), (28), (31), (33) and (34), respectively. 17.3.4 Apply the two-way layout with two observations per cell analysis of variance to the data given in the table below (take = 0.05).
110 95 214 217 208 119 128 117 183 187 183 195 48 60 115 127 130 164 123 138 114 156 225 194 19 94 129 125 114 109
17.4 A Multicomparison Method

Consider again the one-way layout with J ( 2) observations per cell described in Section 17.1 and suppose that in testing the hypothesis H : 1 = = I (= , unspecied) we decided to reject it on the basis of the available data. In rejecting H, we simply conclude that the s are not all equal. No conclusions are reached as to which specic s may be unequal. The multicomparison method described in this section sheds some light on this problem. For the sake of simplicity, let us suppose that I = 6. After rejecting H, the natural quantities to look into are of the following sort:
1 1 1 + 2 + 3 4 + 5 + 6 , 3 3 1 1 or 1 + 3 + 5 2 + 4 + 6 etc. 3 3 We observe that these quantities are all of the form
i j , i j, or
) (
) (
ci i
i =1
with
ci = 0.
i =1
This observation gives rise to the following denition.

DEFINITION 1
Any linear combination = iI= 1 cii of the s, where ci, i = 1, . . . , I are known constants such that iI= 1ci = 0, is said to be a contrast among the parameters i, i = 1, . . . , I. Let = iI= 1cii be a contrast among the s and let
459
I 1 I = ci Yi ., 2 = ci2 MSe and S 2 = I 1 FI 1,n I ;a , J i =1 i =1 S ( ), + where n = IJ. We will show in the sequel that the interval [ ( )] is a condence interval with condence coefcient 1 for all conS trasts . Next, consider the following denition.
( )
DEFINITION 2
be as above. We say that Let and is signicantly different from zero, S ( ), + S according to the S (for Scheff) criterion, if the interval [ )] does not contain zero; equivalently, if | | > S ( ). ( Now it can be shown that the F test rejects the hypothesis H if and only if is signicantly different from zero. there is at least one contrast such that Thus following the rejection of H one would construct a condence interval for each contrast and then would proceed to nd out which contrasts are responsible for the rejection of H starting with the simplest contrasts rst. The condence intervals in question are provided by the following theorem.
THEOREM 1
Refer to the one-way layout described in Section 17.1 and let
= ci i ,
i =1
c i = 0,
i =1
so that
1 I 2 = ci2 MSe , J i =1 S ( ), + S ( )] is a where MSe is given in Table 1. Then the interval [ condence interval simultaneously for all contrasts with condence coefcients 1 , where S2 = (I 1)FI 1,nI; and n = IJ.
( )
Consider the problem of maximizing (minimizing) (with respect to ci, i = 1, . . . , I) the quantity
PROOF
f c1 , . . . , c I =
1 1 I 2 ci J i =1
I
c (Y
i i =1
i.
subject to the contrast constraint
ci = 0.
Now, clearly, f(c1, . . . , cI) = f(c1, . . . , cI) for any > 0. Therefore the maximum (minimum) of f(c1, . . . , cI), subject to the restraint
i =1
ci = 0,
is the same with the maximum (minimum) of f( c1, . . . , cI) = f(c1 , . . . , cI), c i = ci, i = 1, . . . , I subject to the restraints
i =1
460
17
c = 0
i i =1
and
1 I 2 ci = 1. J i =1
Hence the problem becomes that of maximizing (minimizing) the quantity
q c1 , . . . , c I = ci Yi . i ,
i =1
subject to the constraints
ci = 0
i =1 I
and
ci2 = J .
i =1
Thus the points which maximize (minimize) q(c1, . . . , cI) are to be found on the circumference of the circle which is the intersection of the sphere
ci2 = J
i =1
and the plane
ci = 0
i =1
which passes through the origin. Because of this it is clear that q(c1, . . . , cI) has both a maximum and a minimum. The solution of the problem in question will be obtained by means of the Lagrange multipliers. To this end, one considers the expression
I I I h = h c1 , . . . , c I ; 1 , 2 = ci Yi . i + 1 ci + 2 ci2 J i =1 i =1 i =1
and maximizes (minimizes) it with respect to ci, i = 1, , I and 1, 2. We have

h = Yk . k + 1 + 2 2 ck = 0, k = 1, . . . , I ck I h = ci = 0 1 i =1 I h 2 = c i J = 0. 2 i =1
(37)
Solving for ck in (37), we get
ck =
1 k Yk . 1 2 2
k = 1, . . . , I .
(38)
Then the last two equations in (37) provide us with
461
2 J Replacing these values in (38), we have

ck = J k . Yk . + Y. .
I
1 = . Y. .
and
2 =
(
i =1
. Yi . + Y. . .
) )
2
J i =1 i . Yi . + Y. .
k = 1, . . . , I .
Next,
(Y
k =1
k.
k k . Yk . + Y. . = k Yk .
k =1 I
)(
( (
)[(
2
Yk . . Y. .
I . .. k
) (
)] )
= k Yk .
k =1
) + ( Y ) (
k =1
Yk .
I = k Yk . k =1
2 I . Y. .
= k Yk . . Y. . Therefore
k =1
[(
) (
)]
0.
J i =1 i . Yi . + Y. .
I
I i =1 i
c Yi . i
I
) )
2
1 J i =1 ci2
I
for all ci, i = 1, . . . , I such that

I
J i =1 i . Yi . + Y. .
(39)
ci = 0.
Now we observe that
i =1
J i . Yi . + Y. .
i =1
= J Yi . Y. . i .
i =1
[(
) (
)]
is 2 2 I1 distributed (see also Exercise 17.4.1) and also independent of SSe which is 2 2 nI distributed. (See Section 17.1.) Therefore
J i =1 i . Yi . + Y. .
I
) (I 1)
)
2
MSe
is FI1,nI distributed and thus
P
(I 1)F
I 1 , n I ;
MSe J i =1 i . Yi . + Y. .
I
I = P J i =1 i . Yi . + Y. .
(I 1)F
I 1 , n I ;a
MSe = 1 .
(40)
462
17
From (40) and (39) it follows then that

P
(I 1)F
I 1 , n I ;
1 J i = 1ci2 MSe i = 1ci Yi . i

I I I 1 J i = 1ci2 MSe = 1 ,
(I 1)F
I 1 , n I ;
for all ci, i = 1, . . . , I such that iI= 1ci = 0, or equivalently,

S + S = 1 , P
for all contrasts , as was to be seen. (This proof has been adapted from the paper A simple proof of Scheffs multiple comparison theorem for contrasts in the one-way layout by Jerome Klotz in The American Statistician, 1969, Vol. 23, Number 5.) In closing, we would like to point out that a similar theorem to the one just proved can be shown for the two-way layout with (K 2) observations per cell and as a consequence of it we can construct condence intervals for all contrasts among the s, or the s, or the s.
( )
( )]
Exercises
17.4.1 Show that the quantity J i =1 i . Yi . + Y. . mentioned in SecI
tion 17.4 is distributed as 2 2 I1, under the null hypothesis.
17.4.2 Refer to Exercise 17.1.1 and construct condence intervals for all contrasts of the s (take 1 = 0.95).
18.1 Introduction
463
Chapter 18
The Multivariate Normal Distribution
18.1 Introduction
In this chapter, we introduce the Multivariate Normal distribution and establish some of its fundamental properties. Also, certain estimation and independence testing problems closely connected with it are discussed. Let Yj, j = 1, . . . , m be i.i.d. r.v.s with common distribution N(0, 1). Then we know that for any constants cj, j = 1, . . . , m and the r.v. m j = 1 cjYj + 2 is distributed as N(, m c ). Now instead of considering one (nonj=1 j homogeneous) linear combination of the Ys, consider k such combinations; that is, X i = cij Yj + i ,
j =1 m
i = 1, . . . , k,
(1) (2)
or in matrix notation X = CY + , where
X = X1 , . . . , X k ,
Y = Y1 , . . . , Ym ,
DEFINITION 1
C = c ij k m ,
1
and
( )( ) = ( , . . . , ) .
k
Thus we can give the following denition. Let Yj, j = 1, . . . , m be i.i.d. r.v.s distributed as N(0, 1) and let the r.v.s Xi, i = 1, . . . , k, or the r. vector X, be dened by (1) or (2), respectively. Then the joint distribution of the r.v.s Xi, i = 1, . . . , k or the distribution of the r. vector X, is called Multivariate (or more specically, k-Variate) Normal.
REMARK 1 From Denition 1, it follows that if Xi, i = 1, . . . , k are jointly normally distributed, then any subset of them also is a set of jointly normally distributed r.v.s.
463
464
18
From (2) and relation (10), Chapter 16, it follows that EX = and /x = C / YC = CImC = CC; that is,
EX = , / x or just / = CC .
We now proceed to nding the ch.f. x of the r. vector X. For t = (t1, . . . , tk) k, we have
(3)
X t = E exp it X = E exp it CY + = exp it E exp it CY .

But
k t CY = t j c j 1 , . . . , j =1
()
)]
(4)
(Y1 , . . . , Ym ) t j c jm
j =1
k k = t j c j 1 Y1 + + t j c jm Ym j =1 j =1
and hence
k k E exp it CY = Y t j c j 1 + + Y t j c jm j =1 j =1
because
2 2 1 k 1 k = exp t j c j 1 t j c j m 2 j =1 2 j =1 1 = exp t CCt 2 2 2
(5)
k k t c + + j j1 t j c j m = t CCt. j =1 j =1 Therefore by means of (3)(5), we have the following result.

THEOREM 1
The ch.f. of the r. vector X = (X1, . . . , Xk), which has the k-Variate Normal distribution with mean and covariance matrix / , is given by
1 / t . (6) x t = exp it t 2 From (6) it follows that x, and therefore the distribution of X, is completely determined by means of its mean and covariance matrix / , a fact analogous to that of a Univariate Normal distribution. This fact justies the following notation:
()
/ . X ~ N ,
where and / are the parameters of the distribution. Now we shall establish the following interesting result.
THEOREM 2
Let Yj, j = 1, . . . , k be i.i.d. r.v.s with distribution N(0, 1) and set X = CY + , where C is a k k non-singular matrix. Then the p.d.f. fx of X exists and is given by
18.1 Introduction
465
1 1 / x , x k , exp x 2 where / = CC and | / | denotes the determinant of /. fX x = 2
() ( )
k 2
1 2
(7)
PROOF
From X = CY + we get CY = X , which, since C is non-singular,

Y = C 1 X .
gives
Therefore fX x = fY C 1 x But
()
2 j
[ (
)] C
1
= 2
( )
k 2
1 k exp y 2j C 1 . 2 j =1
y = ( x ) (C
k j =1
C 1 = C Therefore
) (C )(x ) (see also Exercise 18.1.2), / . and (C ) (C ) = (C ) C = (CC ) =

1 1 1 1 1 1 1
(8)
fX x = 2
() ( )
k 2
1 1 / x C 1 exp x 2
) .
1 2
Finally, from / = CC, one has | / | = |C| |C| = |C| , so that ||C|| = | / | . Thus
2
fX x = 2
() ( )
k 2
1 2
1 1 / x exp x 2
) ,
as was to be seen. A k-Variate Normal distribution with p.d.f. given by (7) is called a non-singular k-Variate Normal. The use of the term non-singular corresponds to the fact that | / | 0; that is, the fact that / is of full rank.
REMARK 2 COROLLARY 1
In the theorem, let k = 2. Then X = (X1, X2) and the joint p.d.f. of X1, X2 is the Bivariate Normal p.d.f.
PROOF
By Remark 1, both X1 and X2 are normally distributed and let X1~ N(1, 2 ) and X2 N(2, 2 1 2). Also let be the correlation coefcient of X1 and X2. Then their covariance matrix / is given by
2 1 / = 1 2
1 2 2 2
1 2 . 2 1
2 2 and hence | /| = 2 1 2(1 ), so that
/ 1 =
2 2 1 2 1 2
2 2 1 2
466
18
Therefore
1 2 2 / x 1 2 1 2 x
)(
)
)
1 2 x1 1 2 x2 2 1
2 2 = x1 1 , x 2 2 1 2
( (
x1 1 2 = x1 1 2 2 x 2 2 1 2 , x1 1 1 2 + x 2 2 1 x2 2
((
) )
2 1 . = x1 1 2 2 2 x1 1 x 2 2 1 2 + x 2 2
)(
Hence fX
1 ,X 2
(x , x ) =
1 2
1 2 1 2
1 exp 2 2 1 2 1
x1 1 1
as was to be shown.
COROLLARY 2
2 x 2 2 x1 1 x 2 2 + 2 , 1 2 2
)(
The (normal) r.v.s Xi, i = 1, . . . , k are independent if and only if they are uncorrelated. The r.v.s Xi, i = 1, . . . , k are uncorrelated if and only if / is a diagonal matrix and its diagonal elements are the variances of the Xs. Then 2 | /| = 2 /| / 1 is also a diagonal matrix with the jth 1 n. On the other hand, | 2 diagonal element given by ij i , so that / 1 itself is a diagonal matrix with the 2 jth diagonal element being given by 1/ j. It follows that
PROOF
fX
1 , . . . , Xk
(x , . . . , x ) =
k 1 k i =1
1 exp xi i 2 2 i 2 i 1
)
2
and this establishes the independence of the Xs. The really important part of the corollary is that noncorrelation plus normality implies independence, since independence implies noncorrelation in any case. It is also to be noted that noncorrelation without normality need not imply independence, as it has been seen elsewhere.
REMARK 3
Exercises
of in (9) 18.1.1 Use Denition 1 herein in order to conclude that the LSE of Chapter 16 has the n-Variate Normal distribution with mean and 1, 2), given by (19) and (19) of covariance matrix 2S1. In particular, (
18.2 Some Properties of Multivariate Normal 18.1 Distributions Introduction
467
Chapter 16, have the Bivariate Normal distribution with means and variances 1 = 1, E 2 = 2 and E = 1
2
( )
2 j = 1 x 2j
n
nj = 1 x j x
n
= , 2 2
( )
j n j =1
(x
n j =1
2
j
and correlation coefcient equal to 18.1.2 Verify relation (8).
x n x
n j =1
.
2 j
18.1.3 Let the random vector X = (X1. . . . , Xk) be distributed as N(, / ) and suppose that / is non-singular. Then show that the conditional joint distribution of Xi , . . . , Xi , given Xj , . . . , Xj (1 m < k, m + n = k, all i1, . . . , im from all j1, . . . , jn), is Multivariate Normal and specify its parameters.
1 m 1 n
18.2 Some Properties of Multivariate Normal Distributions

In this section we establish some of the basic properties of a Multivariate Normal distribution.
THEOREM 3
Let X = (X1, . . . , Xk) be N(, / ) (not necessarily non-singular). Then for any m k constant matrix A = (ij), the r. vector Y dened by Y = AX has the m-Variate Normal distribution with mean A and covariance matrix A / A. In particular, if m = 1, the r.v. Y is a linear combination of the Xs, Y = X, and variance say, and Y has the Univariate Normal distribution with mean / .
PROOF
For t m, we have
Y t = E exp t Y = E exp t AX = E exp A t X = X A t , so that by means of (6), we have
()
[ ( )] (
( )
( )
( )
1 1 / A t = expit A t A / A t Y t = expi A t A t 2 2 and this last expression is the ch.f. of the m-Variate Normal with mean A and covariance matrix A / A, as was to be seen. The particular case follows from the general one just established.
()
( ) ( )
( )
THEOREM 4
For j = 1, . . . , n, let Xj be independent N(j, / j) k-dimensional r. vectors and let cj be constants. Then the r. vector n n n / j X = c j X j is N c j j , c 2 j j =1 j =1 j =1
468
18
(a result parallel to a known one for r.v.s).

PROOF
For t k and the independence of the Xjs, we have
X t = c X t = Xj c j t .
j =1
j j
()
()
j =1
( )
But
so that
1 / j c jt X c j t = expi c jt j c jt 2 1 / j t , = expit c j j t c 2j 2
j
( )
( ) (
( ) ( )
n 1 n / j t . X t = exp it c j j t c 2j 2 j =1 j =1
()
COROLLARY
For j = 1, . . . , n, let Xj be independent N(, / ) k-dimensional r. vectors and let X= is N(, (1/n) Then X / ).
PROOF
1 n Xj. n j =1
In the theorem, taken j = , /j = / and cj = 1/n, j = 1, . . . , n.
THEOREM 5
Let X = (X1, . . . , Xk) be non-singular N(, / ) and set Q = (X ) / 1(X ). 2 Then Q is an r.v. distributed as k.
PROOF
For t , we have
1 / x 2 Q t = E exp itQ = expit x 1 1 / x dx exp x 2
()
)( ) )(
k 2
1 2
(2 )
k 2
1 2
1 1 / x 1 2it dx exp x 2
= 1 2it
) ( )
k 2
k 2
/ 1 2it
1 2
since
1 1 / exp x x 2 1 2it
dx, )
k / /. = 1 2it 1 2it Now the integrand in the last integral above can be looked upon as the p.d.f. of a k-Variate Normal with mean and covariance matrix / /(1 2it). Hence
18.3
Estimation of and / and Test 18.1 of Independence Introduction
469
the integral is equal to one and we conclude that Q (t) = (1 2it)k/2 which is the ch.f. of 2 k. Notice that Theorem 5 generalizes a known result for the onedimensional case.
REMARK 4
Exercise
18.2.1 Consider the k-dimensional random vectors Xn = (X1n, . . . , Xkn), n = 1, 2, . . . and X = (X1, . . . , Xk) with d.f.s Fn, F and ch.f.s n, , respectively. Then we say that {Xn} converges in distribution to X as n , and we write d Xn X, if Fn ( x) F ( x) for all x k for which F is continuous (see n n also Denition 1(iii) in Chapter 8). It can be shown that a multidimensional version of Theorem 2 in Chapter 8 holds true. Use this result (and also d X, if and only if Theorem 3 in Chapter 6) in order to prove that X n n k d d X, for every = (, . . . , k) . In particular, X n X n X, n n where X is distributed as N(, / ) if and only if {Xn} converges in distribution and as n , to an r.v. Y which is distributed as Normal with mean variance / for every k.
18.3 Estimation of and / and a Test of Independence

First we formulate a theorem without proof, providing estimators for and / , and then we proceed with a certain testing hypothesis problem.
THEOREM 6
For j = 1, . . . , n, let Xj = (Xj1, . . . , Xjk) be independent, non-singular N(, /) r. vectors and set 1 n X = X 1 , . . . , X k , where X i = X ji , i = 1, . . . , k, n j =1
and
S = Sij , where Sij = X ki X i X kj X j , i, j = 1, . . . , k.
k =1
( )
)(
Then and S are sufcient for (, i) X / ); ii) X and S/(n 1) are unbiased estimators of and / , respectively; and S/n are MLEs of and iii) X / , respectively. Now suppose that the joint distribution of the r.v.s X and Y is the Bivariate Normal distribution. That is,
470
18
fX ,Y x, y =
( )
1 2 1 2 1
2
e q 2 ,
1 q= 1 2
2 x 2 x 1 y 2 y 2 1 . + 2 1 1 2 2
Then by Corollary 2 to Theorem 2, the r.v.s X and Y are independent if and only if they are uncorrelated. Thus the problem of testing independence for X and Y becomes that of testing the hypothesis H : = 0. For this purpose, consider an r. sample of size n(Xj, Yj), j = 1, . . . , n, from the Bivariate Normal under consideration. Then their joint p.d.f., f, is given by 1 2 1 2 1 2 where Q = qj
j =1 n
e Q 2 ,
and
1 qj = 1 2
2 x 2 x j 1 y j 2 y j 2 1 j 2 + , 1 1 2 2 j = 1, . . . , n. (9)
For testing H, we are going to employ the LR test. And although the MLEs of the parameters involved are readily given by Theorem 6, we choose to derive them directly. For this purpose, we set g() for log f() considered as a function of the parameter , where the parameter space is given by
2 2 5 ; 1 , 2 ; 1 = = 1 , 2 , 1 , 2 , 2 2, 2 > 0 ; 1 0 ; = 0 .
We have
2 , 2 g = g = g 1 , 2 , 1 2 , ; x1 , . . . , xn , y1 , . . . , yn
() (
)
(10)
= n log 2
n n n 1 2 log 1 log 1 2 q j , log 2 2 2 2 2 2 j =1
18.3
471
where qj, j = 1, . . . , n are given by (9). Differentiating (10) with respect to 1 and 2 and equating the partial derivatives to zero, we get after some simplications
1 1 y x 2 1 = 2 1 2 1 . 1 1 1 2 = x y. 1 2 1 2
(See also Exercise 18.3.1.)
(11)
Solving system (11) for 1 and 2, we get 1 = x , 2 = y. Now let us set Sx = Sy = 1 yj y n j =1

n 2 1 n xj x , n j =1 1 n and Sxy = x j x y j y . n j =1
(12)
)(
(13)
2 Then, differentiating g with respect to 2 1 and 2, equating the partial derivatives to zero and replacing 1 and 2 by 1 and 2, respectively, we obtain after some simplications
1 Sx Sxy = 1 2 2 1 2 1 . 1 2 Sy Sxy = 1 . 1 2 2 2
(See also Exercise 18.3.2.)
(14)
Next, differentiating g with respect to and equating the partial derivative to zero, we obtain after some simplications (see also Exercise 18.3.3)
1 2 1 1 Sx S xy + 2 S y + S xy = 0. 2 2 1 2 2 1 2 1 1
S xy S x Sy
(15)
2 In (14) and (15), solving for 2 1, 2 and , we obtain (see also Exercise 18.3.4)
2 1 2 = = Sx, 2 = Sy ,
(16)
It can further be shown (see also Exercise 18.3.5) that the values of the parameters given by (12) and (16) actually maximize f (equivalently, g) and the maximum is given by
e 1 = max f ; = L S2 xy S S 2 1 x y S Sy x
[()
] ()
(17)
472
18

2 It follows that the MLEs of 1, 2, 2 1, 2 and , under , are given by (12) and (16), which we may now denote by 1,, 2,, 2 2 . That is, 1,, 2, and
2 1, = x , 2 , = y , 1 2 = , = S x , 2 , = S y ,
Sxy Sx Sy
(18)
Under (that is, for = 0), it is seen (see also Exercise 18.3.6) that the MLEs of the parameters involved are given by
2 1, = x , 2 , = y , 1 2 , = S x , 2 , = S y
(19)
and e 1 = max f ; = L 2 S S x y
[()
] ()
n 2
(20)
Replacing the xs and ys by Xs and Ys, respectively, in (17) and (20), we have that the LR statistic is given by S2 = 1 XY S X SY = 1 R2
n 2
(21)
where R is the sample correlation coefcient, that is,

R = X j X Yj Y
j =1 n
)(
(X
j =1
) (Y Y )
2 j j =1
(22)
From (22), it follows that R 2 1. (See also Exercise 18.3.7.) Therefore by the fact that the LR test rejects H whenever < 0, where 0 is determined, so that PH( < 0) = , we get by means of (21), that this test is equivalent to rejecting H whenever
n R 2 > c0 , equivalently, R < c0 or R > c0 , c0 = 1 2 0 .
(23)
In (23), in order to be able to determine the cut-off point c0, we have to know the distribution of R under H. Now although the p.d.f. of the r.v. R can be derived, this p.d.f. is none of the usual ones. However, if we consider the function W =W R =
( )
n 2R 1 R2
(24)
it is easily seen, by differentiation, that W is an increasing function of R . Therefore, the test in (23) is equivalent to the following test
Reject H
whenever W < c or W > c ,
(25)
where c is determined, so that PH(W < c or W > c) = . It is shown in the sequel that the distribution of W under H is tn2 and hence c is readily determined.
18.3
473
Suppose Xj = xj, j = 1, . . . , n and that n )2 > 0 and set j = 1(xj x
R x = x j x Yj Y
j =1
)(
(x
j =1 n
) (Y Y )
2 j j =1
(26)
Let also
vj = x j x
so that
n
) (x
j =1
n j =1
v
j =1
= 0 and
v
n
2 j
= 1.
(27)
Let also Wx = n 2R x
1 R 2x . It is readily seen that

n
R x = R v = v j Yj
j =1
Y
j =1
2 j
nY 2 ,
so that (see also Exercise 18.3.8)

= vY Wx = W v j j
j =1 n 2 n n Y j2 nY 2 v j Yj j =1 j =1
( n 2) .
(28)
We have that Yj, j = 1, . . . , n are independent N(2, 2 2). Now if we consider the N(0, 1) r.v.s Yj = (Yj 2)/ 2, j = 1, . . . , n and replace Yj by Yj in (28), it is seen (see also Exercise 18.3.9) that Wx = W* v remains unchanged. Therefore we may assume that the Ys are themselves independent N(0, 1). Next consider the transformation 1 1 Y1 + + Yn Z1 = n n Z = v Y + + v Y . 1 1 n n 2 Then because of (1/n)2 + + (1/n)2 = n/n = 1 and also because of (27), this transformation can be completed to an orthogonal transformation (see Theorem 8.I(i) in Appendix I) and let Zj, j = 3, . . . , n be the remaining Zs. Then by Theorem 5, Chapter 9, it follows that the r.v.s Zj, j = 1, . . . , n 2 n 2 are independent N(0, 1). Also n j = 1 Y j = j = 1 Z j by Theorem 4, Chapter 9. By means of the transformation in question, the statistic in (28) becomes Z2 jn= 3 Z j2 ( n 2) . Therefore the distribution of Wx, equivalently the distribution of W, given Xj = xj, j = 1, . . . , n is tn2. Since this distribution is independent of the xs, it follows that the unconditional distribution of W is tn2. Thus we have the following result.
THEOREM 7
For testing H : = 0 against A : 0 at level of signicance , one rejects H whenever W < c or W > c, where W is given by (24), the sample correlation
474
18
coefcient R is given by (22) and the cut-off point c is determined from P(tn2 > c) = /2 by the fact that the distribution of W, under H, is tn2. To this last theorem, one has the following corollary.
COROLLARY
The p.d.f. of the correlation coefcient R is given by 1 n 1 1 2 fR r = 1 n 2 2
()
) )
1 r 2 ( n 2 ) 2 , 1 < r < 1.
PROOF From W = n 2 r/1 R2, it follows that R and W have the same sign, that is, RW 0. Solving for R, one has then R = W/W 2 + n 2. By setting w = n 2 r/1 r2, one has dw/dr = n 2(1 r2)3/2, whereas
fW Therefore
( )
1 n 1 2 w = 1 n 2 n 2 2
w2 1 + n 2
n 1 2
, w .
n 2 r dw fR r = fW 1 r 2 dr
()
1 n 1 2 = 1 n 2 n 2 2
n 2 r2 1 + n 2 1 r2
)(
n 1 2
n 2 1 r2
3 2
1 n 1 2 1 r 2 ( n 2 ) 2 , = 1 n 2 2
as was to be shown. The p.d.f. of R when 0 can also be obtained, but its expression is rather complicated and we choose not to go into it. We close this chapter with the following comment. Let X be a kdimensional random vector distributed as N(, / ). Then its ch.f. is given by (6). Furthermore, if / is non-singular, then the N(, / ) distribution has a p.d.f. which is given by (7). However, this is not the case if / is singular. In this latter case, the distribution is called singular, and it can be shown that it is concentrated in a hyperplane of dimensionality less than k.
18.1 Introduction Exercises
475
Exercises
18.3.1 18.3.2 18.3.3 Verify relation (11). Verify relation (14). Verify relation (15).
18.3.4 Show that 2 2 given by (16) is indeed the solution of the 1, 2, and system of the equations in (14) and (15). 18.3.5 Consider g given by (10) and set
dij =
2 g i j
()
,
=
where
2 = 1 , 2 , 1 , 2 2,
2 = 1, 2 , 1 2 , 2,
and 1, 2, 2 2 are given by (12) and (16). Let D = (dij), i, j = 1, . . . , 5 1, 2 and and denote by D5k the determinant obtained from D by deleting the last k rows and columns, k = 1, . . . , 5, D0 = 1. Then show that the six numbers D0, D1, . . . , D5 are alternately positive and negative. This result together with the fact that dij, i, j = 1, . . . , 5 are continuous functions of implies that the 2 quantities given by (18) are, indeed, the MLEs of the parameters 1, 2, 2 1, 2 and , under . (See for example Mathematical Analysis by T. M. Apostol, Addison-Wesley, 1957, Theorem 7.9, pp. 151152.)
2 18.3.6 Show that the MLEs of 1, 2, 2 1, and 2, under , are indeed given by (19).
18.3.7 Show that 2 1, where is the sample correlation coefcient given by (22). 18.3.8 Verify relation (28). 18.3.9 Show that the statistic Wx (= W* v ) in (28) remains unchanged if the r.v.s Yj are replaced by the r.v.s
, j = 1, . . . , n. 2 and S dened in Theorem 6 and, by using 18.3.10 Refer to the quantities X Basus theorem (Theorem 3, Chapter 11), show that they are independent.
Y j =
Yj 2
476
19
Quadratic Forms
Chapter 19
Quadratic Forms
19.1 Introduction
In this chapter, we introduce the concept of a quadratic form in the variables xj, j = 1, . . . , n and then conne attention to quadratic forms in which the xjs are replaced by independent normally distributed r.v.s Xj, j = 1, . . . , n. In this latter case, we formulate and prove a number of standard theorems referring to the distribution and/or independence of quadratic forms. A quadratic form, Q, in the variables xj, j = 1, . . . , n is a homogeneous quadratic (second degree) function of xj, j = 1, . . . , n. That is, Q = cij xi x j ,
i =1 j =1 n n
where here and in the sequel the coefcients of the xs are always assumed to be real-valued constants. By setting x = (x1, . . . , xn) and C = (cij), we can write Q = xCx. Now Q is a 1 1 matrix and hence Q = Q, or (xCx) = xCx = xCx. 1 1 (xCx + xCx) = xAx, where A = (C + C); that is to say, if Therefore Q = 2 2 1 A = (aij), then aij = (cij + cji), so that aij = aji. Thus A is symmetric. We can then 2 give the following denition.
DEFINITION 1
A (real) quadratic form, Q, in the variables xj, j = 1, . . . , n is a homogeneous quadratic function of xj, j = 1, . . . , n, Q = cij xi x j ,
i =1 j =1 n n
(1)
where cij and cij = cji, i, j = 1, . . . , n. In matrix notation, (1) becomes as follows: Q = x Cx, (2)
476
19.2 Some Theorems on Quadratic Forms
477
where x = (x1, . . . , xn), C = (cij) and C = C (which expresses the symmetry of C).
DEFINITION 2
For an n n matrix C, the polynomial (in ) |C In| is of degree n and is called the characteristic polynomial of C. The n roots of the equation |C In| = 0 are called characteristic or latent roots or eigenvalues of C. The quadratic form Q = xCx is called positive denite if xCx > 0 for every x 0; it is called negative denite if xCx < 0 for every x 0 and positive semidenite if xCx 0 for every x. A symmetric n n matrix C is called positive denite, negative denite or positive semidenite if the quadratic form associated with it, Q = xCx, is positive denite, negative denite or positive semidenite, respectively. If Q = xCx, then the rank of C is also called the rank of Q.
DEFINITION 3
DEFINITION 4

Throughout this section, it is assumed that the r.v.s Xj, j = 1, . . . , n are independently distributed as N(0, 1) and we set X = (X1, . . . , Xn). We then replace x by X in (2) and obtain the following quadratic form in Xj, j = 1, . . . , n, or X: Q = X CX, where C = C.
Some theorems related to such quadratic forms will now be established.

THEOREM 1
(Cochran) Let
X X = Qi ,
i =1
(3)
where for i = 1, . . . , k, Qi are quadratic forms in X with rank Qi = ri. Then the k r.v.s Qi are independent 2 r if and only if i = 1ri = n.
i
2 2 We have that XX = n j = 1X j is n. Therefore if for i = 1, . . . , k, Qi are 2 k independent r , then because of (3), i = 1ri = n. Next, we suppose that k i = 1ri = n and show that for i = 1, . . . , k, Qi are independent 2 . To this end, one has that Qi = XCiX, where Ci is an n n r symmetric matrix with rank Ci = ri. Consider the matrix Ci. By Theorem 11.I(ii) in Appendix I, there exist ri linear forms in the Xs such that
PROOF
(i ) (i ) (i ) (i ) (i ) (i ) Qi = 1 b11 X 1 + + b1n X n + + r b r 1 X 1 + + b r n X n ,
2 2
i i i
i
(4)
(i) , . . . , (ri) are either 1 or 1. Now k where 1 i = 1ri = n and let B be the n n matrix dened by
478
19
Quadratic Forms
b(1) b(1) 1n 11 b(1) b(1) rn r1 B= . k) ( (k ) b11 b1n (k ) (k ) br 1 br n

1 1 k k
Then by (4) and the denition of B, it is clear that
Qi = (BX )D(BX ),
i =1
i
(5)
where D is an n n diagonal matrix with diagonal elements equal to (i) 1 , . . . , (ri) , i = 1, . . . , k. On the other hand,
Qi = X X
i =1
and
(BX)D(BX) = X (BDB)X.
)
identically in X.
Therefore (5) gives

X X = X BDB X
Hence BDB = In. From the denition of D, it follows that ||D|| = 1, so that rank D = n. Let r = rank B. Then, of course, r n. Also n = rank In = rank (BDB) r, so that r = n. It follows that B is nonsingular and therefore the relationship BDB = In implies D = (B)1B1 = (BB)1. On the other hand, for any nonsingular square matrix M, MM is positive denite (by Theorem 10.I(ii) in Appendix I) and so is (MM)1. Thus (BB)1 is positive denite and hence so is D. From the form of D, it follows then that all diagonal elements of D are equal to 1, which implies that D = In and hence BB = In; that is to say, B is orthogonal. Set Y = BX. By Theorem 5, Chapter 9, it follows that, if Y = (Y1, . . . , Yn), then the r.v.s Yj, j = 1, . . . , n are independent N(0, 1). Also the fact that D = In and the transformation Y = BX imply, by means of (4), that Q1 is equal to the sum of the squares of the rst r1, Ys, Q2 is the sum of the squares of the next r2 Ys, . . . , Qk is the sum of the squares of the last rk Ys. It follows that, for i = 1, . . . , k, Qi are independent 2 r . The proof is completed.
i
APPLICATION 1
For j = 1, . . . , n, let Zj be independent r.v.s distributed as N(, 2) and set Xj = (Zj )/, so that the Xs are i.i.d. distributed as N(0, 1). It has been seen elsewhere that
2 2 n Z n Z Z Zj j = + j =1 j =1 n
) ;
2
equivalently,
479
X j2 = X j X
j =1 j =1
+ n X .
1 2
Now 1 n n X = X j = X C 2 X, n j =1
1 2
where C2 has its elements identically equal to 1/n, so that rank C2 = 1. Next it can be shown (see also Exercise 19.2.1) that
(X
j =1
= X C1X,
where C1 is given by
n1 n 1 n C1 = 1 n
(n 1)
1 n
1 n
1 n 1 n n 1 n
and that rank C1 = n 1. Then Theorem 1 applies with k = 2 and gives that 2 2 2 2 n j = 1(Xj X ) and (nX ) are independent distributed as n1 and 1, respec2 n 2 2 ) is distributed as n1 and is tively. Thus it follows that (1/ ) j = 1(Zj Z independent of Z . The following theorem refers to the distribution of a quadratic form in the independent N(0, 1) r.v.s Xj, j = 1, . . . , n. Namely,
THEOREM 2
Consider the quadratic form Q = XCX. Then Q is distributed as 2 r if and only if C is idempotent (that is, C2 = C) and rank C = r. Suppose that C is idempotent and that rank C = r. Then by Theorem 12.I(iii) in Appendix I, we have
PROOF
rank C + rank I n C = n.
(6)
Also
X X = X CX + X I n C X.
(7)
Then Theorem 1 applies with k = 2 and gives that XCX is 2 r (and also X(In C)X is 2 nr). Assume now that Q = XCX is 2 r . Then we rst show that rank C = r. By Theorem 11.I(iii) in Appendix I, there exists an orthogonal matrix P such that if Y = P1X (equivalently, X = PY), then Q = X CX = PY C PY = Y P CP Y = j Y j2 ,
j =1
( ) ( )
(8)
480
19
Quadratic Forms
where (Y1, . . . , Yn) = Y and j, j = 1, . . . , m are the nonzero characteristic roots of C. By the orthogonality of P, the Ys are independent N(0, 1) (Theorem 5, m 2 Chapter 9), so that the Y 2s are independent 2 1. Therefore the ch.f. of j = 1jY j , evaluated at t, is given by
[(1 2i t ) (1 2i t )]
1 m
1 2
(9)
On the other hand, Q is 2 r by assumption, so that its ch.f., evaluated at t, is given by
(1 2it )
1 = = m = 1
r 2
(10)
From (8)(10), one then has that (see also Exercise 19.2.2) and m = r. (11)
It follows then that rank C = r. We now show that C2 = C. From (8), one has that PCP is diagonal and, by (11), its diagonal elements are either 1 or 0. Hence PCP is idempotent. Thus P CP = P CP
) = (PCP)(PCP) = P C(PP )CP = P CI CP = P C P.

2 2 n
That is,
P CP = P C 2P.
1 1
(12)
Multiplying by P and P on the left and right, respectively, both sides of (12), one concludes that C = C2. This completes the proof of the theorem.
APPLICATION 2
Refer to Application 1. It can be shown (see also Exercise 19.2.3) that C1 and 1/2 2 2 C2 are idempotent. Then Theorem 2 implies that n j=1(Xj X ) and (n X ) , or equivalently 1 2
(Z
j =1
and
n Z
2 are distributed as 2 n1 and 1, respectively.
To this theorem there are the following two corollaries which will be employed in the sequel.
COROLLARY 1
If the quadratic form Q = XCX is distributed as 2 r, then it is positive semidenite.

PROOF
From (8) and (10), one has that Q = XCX is equal to jr= 1Y 2 j, so that 1 XCX is equal to jr= 1Y 2 j , where X = (X1, . . . , Xn) and (Y1, . . . , Yn) = Y = P X. Thus XCX 0 for every X, as was to be seen.
481
COROLLARY 2
Let P be an orthogonal matrix and consider the transformation Y = P1X. Then if the quadratic form Q = XCX is 2 r , so is the quadratic form Q* = Y(PCP)Y.
PROOF By the theorem, it sufces to show that PCP is idempotent and that its rank is r. We have
(PCP)
2
= P C PP CP = P CCP = P CP
( )
since C = C. That rank PCP = r follows from Theorem 9.I(iv) in Appendix I. Hence the result.
THEOREM 3
Suppose that XX = Q1 + Q2, where Q1, Q2 are quadratic forms in X, and let Q1 2 be 2 r . Then Q2 is nr and Q1, Q2 are independent.
1 1
Let Q1 = XC1X. Then the assumption that Q1 is 2 r implies (by Theorem 2) that C1 is idempotent and rank C1 = r1. Next
PROOF
1
Q2 = X X Q1 = X X X C1X = X I n C1 X
and (In C1) = In 2C1 + C = In C1, that is, In C1 is idempotent. Also rank C1 + rank (In C1) = n by Theorem 12.I(iii) in Appendix I, so that rank (In C1) = n r1. We have then that rank Q1 + rank Q2 = n, and therefore Theorem 1 applies and gives the result.
2 2 1
APPLICATION 3
is N(0, 1), it follows that (nX )2 is 2 Refer to Application 1. Since nX 1. Then, n 2 2 by Theorem 3, j=1(Xj X ) is distributed as n1 and is independent of 2 )2. Thus once again, (1/ 2)n 2 (nX j = 1(Zj Z ) is distributed as n1 and is independent of Z . The following theorem is also of interest. Suppose that Q = Q1 + Q2, where Q, Q1 and Q2 are quadratic forms in X. 2 Furthermore, let Q be 2 r , let Q1 be r and let Q2 be positive semidenite. Then 2 Q2 is r , where r2 = r r1, and Q1, Q2 are independent.
1 2
THEOREM 4
PROOF Let Q = XCX. Then, by Theorem 2, C is idempotent and rank C = r. By Theorem 11.I(iv) in Appendix I, it follows that there exists an orthogonal matrix P such that if Y = P1X (equivalently, X = PY), then Q is transformed into Y(PCP)Y = jr= 1Y 2 j. For i = 1, 2, let Qi = XCiX and let Q* i be the quadratic form in Y into which Qi is transformed under P; that is,
Qi = Y Bi Y,
where
Bi = P Ci P, i = 1, 2.
The equation Q = Q1 + Q2 implies
(Y , . . . ,Y )(Y , . . . ,Y ) = Y
1 r 1 r j =1
2 j
= Q 1 + Q2 .
(13)
By Corollary 1 to Theorem 2, it follows that C1 is positive semidenite and so is C2 by assumption. Therefore by Theorem 10.I in Appendix I, B1 and B2, or equivalently, Q* 1 and Q* 2 are positive semidenite. From this result and (13), it
482
19
Quadratic Forms
follows that Q* 1 and Q* 2 are functions of Yj, j = 1, . . . , r only. From the orthogonality of P, we have that the r.v.s Yj, j = 1, . . . , r are independent 2 N(0, 1). On the other hand, Q* 1 is r by Corollary 2 to Theorem 2. These facts together with (13) imply that Theorem 3 applies (with n = r) and provides the desired result.
1
This last theorem generalizes as follows.

THEOREM 5
Suppose that Q = k i = 1Qi, where Q and Qi, i = 1, . . . , k ( 2) are quadratic forms 2 in X. Furthermore, let Q be 2 r, let Qi be r , i = 1, . . . , k 1 and let Qk be 2 positive semidenite. Then Qk is r , where
i k
rk = r ri ,
i =1
k 1
and
Qi , i = 1, . . . , k
are independent. The proof is by induction. For k = 2 the conclusion is true by Theorem 4. Let the theorem hold for k = m and show that it also holds for m + 1. We write
PROOF
, Q = Qi + Qm
i =1
m 1
where
= Q +Q . Qm m m +1
By our assumptions and Corollary 1 to Theorem 2, it follows that Q* m is 2 positive semidenite. Hence Q* m is r* ,
m
=r r, rm i
i =1
m 1
and
Q1 , . . . , Qm 1 , Qm
are independent, by the induction hypothesis. Thus Q* m = Qm + Qm+1, where Q* m 2 is 2 , Q is and Q is positive semidenite. Once again Theorem 4 applies m m+1 r* r and gives that Qm+1 is 2 r , where
m m m+1
r =r r, rm +1 = rm i m
i =1
and that Qm and Qm+1 are independent. It follows that Qi, i = 1, . . . , m + 1 are also independent and the proof is concluded. The theorem below gives a necessary and sufcient condition for independence of two quadratic forms. More precisely, we have the following result.
THEOREM 6
Consider the independent r.v.s Yj, j = 1, . . . , n, where Yj is distributed as N(j, 2), and for i = 1, 2, let Qi be quadratic forms in Y = (Y1, . . . , Yn); that is, Qi = YCiY. Then Q1 and Q2 are independent if and only if C1C2 = 0.
PROOF The proof is presented only for the special case that Yj = Xj N(0, 1) and Qi 2 r , i = 1, 2. To this end, suppose that C1C2 = 0. By the fact that
i
19.2 Some Theorems on Quadratic Exercises Forms
483
Qi is distributed as 2 r , it follows (by Theorem 2) that Ci, i = 1, 2 are idempotent; that is, C 2 2C 1 = i = Ci, i = 1, 2. Next by the symmetry of Ci, one has C2C1 = C (C1C2) = 0 = 0. Therefore
i
C 1 I n C 1 C 2 = C 2 I n C 1 C 2 = 0.
Then Theorem 12.I(iii), in Appendix I, implies that
rank C1 + rank C 2 + rank I n C1 C 2 = n.

On the other hand, clearly, we have
X X = X C1X + X C 2 X + X I n C1 C 2 X.
(14)
(15)
Then relations (14), (15) and Theorem 1 imply that XC1X = Q1, XC2X = Q2 (and X(In C1 C2)X) are independent. 2 Let now Q1, Q2 be independent. Since Q1 is 2 r and Q2 is r , it follows that 2 Q1 + Q2 = X(C1 + C2)X is r +r . That is, X(C1 + C2)X is a quadratic form in X distributed as 2 r +r . Thus C1 + C2 is idempotent by Theorem 2. So the matrices C1, C2 and C1 C2 are all idempotent. Then Theorem 12.I(iv), in Appendix I, applies and gives that C1C2 (= C2C1) = 0. This concludes the proof of the theorem.
1 2 1 2 1 2
REMARK 1 Consider the quadratic forms XC1X and XC2X guring in Applications 13. Then, according to the conclusion reached in discussing those 2 applications, XC1X and XC2X are distributed as 2 n1 and 1, respectively. This should imply that C1C2 = 0, by Theorem 6. This is, indeed, the case as is easily seen.
Exercises
19.2.1 Refer to Application 1 and show that
(X
j =1
= X C1X
as asserted there. 19.2.2 Justify the equalities asserted in (11).
19.2.3 Refer to Application 2 and show that the matrices C1 and C2 are both idempotent. + e, where X is of full rank 19.2.4 Consider the usual linear model Y = X = S1XY be the LSE of . Write Y as follows: Y = X + (Y X ) p, and let and show that: ||2; ii) ||Y||2 = YXS1XY + ||Y X ||2 are independent, the rst being distribii) The r.v.s YXS1XY and ||Y X 2 uted as noncentral p and the second as 2 np.
484
19
Quadratic Forms
19.2.5 Let X1, X2, X3 be independent r.v.s distributed as N(0, 1) and let the r.v. Q be dened by
1 2 2 5X 1 + 2X 2 2 + 5X 3 + 4 X1 X 2 2 X1 X 3 + 4 X 2 X 3 . 6 Then nd the distribution of Q and show that Q is independent of the r.v. 2 3 j = 1X j Q. Q=

19.2.6 Refer to Example 1 in Chapter 16 and (by using Theorem 6 herein) , , 2, as well as the r.v.s 2, are independent, where show that the r.v.s 1 2 2 2 is the LSE of . 19.2.7 For j = 1, . . . , n, let Yj be independent r.v.s, Yj being distributed as N(j, 1), and set Y = (Y1, . . . , Yn). Let YY = k i = 1Qi, where for i = 1, . . . , k, Qi are quadratic forms in Y, Qi = YCiY, with rank Qi = ri. Then show that the k r.v.s Qi are independent 2 r ; if and only if i = 1ri = n, where the noncentrality parameter i = Ci, = (1, . . . , n), i = 1, . . . , k. [Hint: The proof is presented along the same lines as that of Theorem 1.]
i i
20.1
Nonparaetric Estimation
485
Chapter 20
Nonparametric Inference
In this chapter, we discuss briey some instances of nonparametric, or more properly, distribution-free inference. That is, inferences which are made without any assumptions regarding the functional form of the underlying distributions. The rst part of the chapter is devoted to nonparametric estimation and the remaining part of it to nonparametric testing of hypotheses.
20.1 Nonparametric Estimation

At the beginning, we should like to mention a few cases of nonparametric estimation which have already been discussed in previous chapters although the term nonparametric was not employed there. To this end, let Xj, j = 1, . . . , n be i.i.d. r.v.s with certain distribution about which no functional form is stipulated. The only assumption made is that the Xs have a nite (unknown) n be the sample mean of the Xs; that is, mean . Let X 1 n Xn = X j . n j =1 Then it has been shown that X n, viewed as an estimator of , is weakly P . This is consistent, that is, consistent in the probability sense. Thus X n n n is strongly consistent, so by the WLLNs. It has also been mentioned that X a.s. namely, X n . This is justied on the basis of the SLLNs. n Let us suppose now that the Xs also have nite (and positive) variance 2 which presently is assumed to be known. Then, according to the CLT,
n Xn
Thus if z/2 is the upper /2 quantile of the N(0, 1) distribution, then

485
) d Z N ( 0, 1). n
486
20
n Xn P z 2 z 2 = P X n z 2 X n + z n
1 , n n
so that [Ln, Un] is a condence interval for with asymptotic condence coefcient 1 ; here Ln = L X 1 , . . . , X n = X n z and U n = U X 1 , . . . , X n = X n + z
Next, suppose that 2 is unknown and set S 2 n for the sample variance of the Xs; namely, S2 n =
2 1 n X j Xn . n j =1
Then the WLLNs and the SLLNs, properly applied, ensured that S 2 n, viewed as an estimator of 2, was both a weakly and strongly consistent estimator of 2. Also by the corollary to Theorem 9 of Chapter 8, it follows that
n Xn Sn
By setting
) d Z N ( 0, 1). n
)
Sn
2
L n = L X 1 , . . . , X n = X n z and
, n we have that [L* *] is a condence interval for with asymptotic condence n, Un coefcient 1 . Clearly, the examples mentioned so far are cases of nonparametric point and interval estimation. A further instance of point nonparametric estimation is provided by the following example. Let F be the (common and unknown) d.f. of the Xis and set Fn for their sample or empirical d.f.; that is,
2
X , . . . ,X = X + z U n =U 1 n n
Sn
20.2 Nonparametric 20.1 Nonparaetric Estimation Estimation of a P.D.F.
487
Fn x; s =
( )
1 the number of X 1 s , . . . , X n s x , x , s S . n
()
() ]
(1)
We often omit the random element s and write Fn(x) rather than Fn(x; s). Then it was stated in Chapter 8 (see Theorem 6) that
Fn x; a.s. F x
n
( )
()
uniformly in
x .
(2)
Thus Fn(x; ) is a strongly consistent estimator of F(x) and for almost all s S and every > 0, we have
Fn x; s F x Fn x; s + ,
( )
()
( )
provided n n(, s) independent of x . We close this section by observing that Section 5 of Chapter 15 is concerned with another nonparametric aspect, namely that of constructing tolerance intervals.
20.2 Nonparametric Estimation of a p.d.f.

At the end of the previous section, an unknown d.f. F was estimated by the sample d.f. Fn based on the i.i.d. r.v.s Xj, j = 1, . . . , n whose (common) d.f. is assumed to be the unknown one F. In the present section, we shall consider the problem of estimation of an unknown p.d.f. To this end, let Xj, j = 1, . . . , n be i.i.d. r.v.s with (the common) p.d.f. f which is assumed to be of the continuous type. A signicant amount of work has been done regarding the estimation of f(x), x , which, of course, is assumed to be unknown. In this section, we report some of these results without proofs. The relevant proofs can be found in the paper On estimation of a probability density function and mode, by E. Parzen, which appeared in The Annals of Mathematical Statistics, Vol. 33 (1962), pp. 10651076. First we shall try to give a motivation to the estimates to be employed in the sequel. To this end, recall that if F is the d.f. corresponding to the p.d.f. f, then
f x = lim
h 0
()
F x+h F xh 2h
) ( (
).
Thus, for (0 <) h sufciently small, the quantity [F(x + h) F(x h)]/2h should be close to f(x). This suggests estimating f(x) by the (known) quantity
x = f n
()
Fn x + h Fn x h 2h
).
However,
488
20
x = f n
()
Fn x + h Fn x h
2h 1 the number of X1 , . . . , X n x + h = 2h n = the number of X1 , . . . , X n x h n
1 the number of X1 , . . . , X n in x h, x + h ; 2h n
that is
the number of X1 , . . . , X n in x h, x + h x = 1 f n n 2h and it can be further easily seen (see Exercise 20.2.1) that
()
]
(3)
n x Xj x = 1 f K , n nh j=1 h
()
where K is the following p.d.f.: 1 , if x 1, 1 K x = 2 0, otherwise. Thus the proposed estimator fn(x) of f(x) is expressed in terms of a known p.d.f. K by means of (3). This expression also suggests an entire class of estimators to be introduced below. For this purpose, let K be any p.d.f. dened on into itself and satisfying the following properties:
()
lim xK x = 0 as x K x = K x , x . Next, let {hn} be a sequence of positive constants such that sup K x ; x <
{ ()
( )
()
(4)
()
hn 0.
n
(5)
For each x and by means of K and {hn}, dene the r.v. fn(x; s), to be shortened to fn(x), as follows: x = 1 f n nhn
()
K
j =1
x Xj . hn
(6)
Then we may formulate the following results.

THEOREM 1
Let Xj, j = 1, . . . , n be i.i.d. r.v.s with (unknown) p.d.f. f and let K be a p.d.f. satisfying conditions (4). Also, let {hn} be a sequence of positive constants
20.2 Nonparametric 20.1 Nonparaetric Estimation Estimation of a P.D.F.
489
satisfying (5) and for each x let fn(x) be dened by (6). Then for any x at which f is continuous, the r.v. fn(x), viewed as an estimator of f(x), is asymptotically unbiased in the sense that
x Ef f x . n
Now let {hn} be as above and also satisfying the following requirement:
nhn .
n
( ) n ( )
(7)
Then the following results hold true.

THEOREM 2
Under the same assumptions as those in Theorem 1 and the additional condition (7), for each x at which f is continuous, the estimator fn(x) of f(x) is consistent in quadratic mean in the sense that
x f x Ef n
() ()
0.
n
The estimator fn(x), when properly normalized, is also asymptotically normal, as the following theorem states.
THEOREM 3
Under the same assumptions as those in Theorem 2, for each x at which f is continuous, x E f x f n n
n
( ) [ ( )] d Z N ( 0, 1). n [ f ( x )]
Finally, if it happens to be known that f belongs to a class of p.d.f.s which are uniformly continuous, then by choosing the sequence {hn} of positive constants to tend to zero and also such that
nh 2 , n
n
(8)
we may show the following result.

THEOREM 4
Under the same assumptions as those in Theorem 1 and also condition (8),
s. x a. f f x n n
()
()
uniformly in x ,
provided f is uniformly continuous. In closing this section, it should be pointed out that there are many p.d.f.s of the type K satisfying conditions (4). For example, if K is taken to be the 1 1 p.d.f. of the N(0, 1), or the U( 2 , 2 ) p.d.f., these conditions are, clearly, satised. As for the sequence {hn}, there is plenty of exibility in choosing it. As an illustration, consider the following example.
EXAMPLE 1
Consider the i.i.d. r.v.s Xj, j = 1, . . . , n with (unknown) p.d.f. f. Take K x =
()
1 2
ex
490
20
Then, clearly, , so that sup K x ; x < . 2 2 Next, for x > 1, one has ex < ex , so that ex /2 < ex/2 and hence K x =
2
()
ex
{ ()
xe x
< xe x 2 = x e x 2 .
Now consider the expansion et = 1 + tet for some 0 < < 1, and replace t by x/2. We get then
1 0 1 x 2 x 1 x + e 2 2 2 0. 0, so that and therefore xe x 2 In a similar way xe x 2 x x lim xK(x) = 0 as x . Since also K(x) = K(x), condition (4) is satised. 2 0, nhn = n n1 2 = n1 2 and Let us now take hn = 1/n1/4. Then 0 < hn n n 3 4 nhn = n . Thus the estimator given by (6) has all properties stated in n Theorems 14. This estimator here becomes as follows: x x = e x 2 1 + x 2 e x
( )
( )
||
x = f n
()
1 2 n3 4
xX j exp 1 2 2n j =1
n
Exercise
20.2.1 Let Xj, j = 1, . . . , n be i.i.d. r.v.s and for some h > 0 and any x , dene fn(x) as follows:
the number of X1 , . . . , X n in x h, x + h x = 1 f . n n 2h Then show that
()
n x Xj x = 1 f K , n nh j = 1 h
()
1 where K(x) is 2 if x [1, 1) and 0 otherwise.
20.3 Some Nonparametric Tests

Let Xj, j = 1, . . . , n be i.i.d. r.v.s with unknown d.f. F. As was seen in Section 20.1, the sample d.f. Fn may be used for the purpose of estimating F. However,
20.3 20.1 Some Nonparaetric Nonparametric Estimation Tests
491
testing hypotheses problems about F also arise and are of practical importance. Thus we may be interested in testing the hypothesis H : F = F0, a given d.f., against all possible alternatives. This hypothesis can be tested by utilizing the chi-square test for goodness of t discussed in Chapter 13, Section 8. The chi-square test is the oldest nonparametric test regarding d.f.s. Alternatively, the sample d.f. Fn may also be used for testing the same hypothesis as above. In order to be able to employ the test proposed below, we have to make the supplementary (but mild) assumption that F is continuous. Thus the hypothesis to be tested here is
H : F = F0 , a given continuous d.f.,
against the alternative
A : F F0
(in the sense that F (x) F (x) for at least one x ) .

0
Let be the level of signicance. Dene the r.v. Dn as follows, Dn = sup Fn x F0 x ; x ,
{
(
()
()
(9)
where Fn is the sample d.f. dened by (1). Then, under H, it follows from (2) 0. Therefore we would reject H if Dn > C and would accept it that Dn a.s. otherwise. The constant C is to be determined through the relationship
n
P Dn > C H = .
(10)
In order for this determination to be possible, we would have to know the distribution of Dn, under H, or of some known multiple of it. It has been shown in the literature that P
nDn x H
n
j =
(1) e
j
2 j 2 x 2
, x 0.
(11)
Thus for large n, the right-hand side of (11) may be used for the purpose of determining C by way of (10). For moderate values of n (n 100) and selected s ( = 0.10, 0.05, 0.025, 0.01, 0.005), there are tables available which facilitate the calculation of C. (See, for example, Handbook of Statistical Tables by D. B. Owen, Addison-Wesley, 1962.) The test employed above is known as the Kolmogorov one-sample test. The testing hypothesis problem just described is of limited practical importance. What arise naturally in practice are problems of the following type: Let Xi, i = 1, . . . , m be i.i.d. r.v.s with continuous but unknown d.f. F and let Yj, j = 1, . . . , n be i.i.d. r.v.s with continuous but unknown d.f. G. The two random samples are assumed to be independent and the hypothesis of interest here is H : F = G. One possible alternative is the following: (12) A: F G (in the sense that F(x) G(x) for at least one x ).
492
20
The hypothesis is to be tested at level . Dene the r.v. Dm,n as follows: Dm,n = sup Fm x Gn x ; x ,
()
()
(13)
where Fm, Gn are the sample d.f.s of the Xs and Ys, respectively. Under H, F = G, so that
Fm x Gn x = Fm x F x Gn x G x
m n
()
( ) [ ( ) ( )] [ ( ) ( )] F ( x ) F ( x ) + G ( x ) G( x ) .
Hence Dm,n sup Fm x F x ; x + sup Gn x G x ; x , whereas sup Fm x F x ; x a.s. 0, sup Gn x G x ; x a.s. 0.

m m
() ()
() ()
() ()
() ()
In other words, we have that Dm,n 0 as m, n , and this suggests rejecting H if Dm,n > C and accepting it otherwise. The constant C is determined by means of the relation
P Dm,n > C H = .
a.s.
(14)
Once again the actual determination of C requires the knowledge of the distribution of Dm,n, under H, or some known multiple of it. In connection with this it has been shown in the literature that P
N Dm ,n x H
j =
(1) e
j
2 j 2x 2
as m, n , x 0,
(15)
where N = mn/(m + n). Thus, for large m and n, the right-hand side of (15) may be used for the purpose of determining C by way of (14). For moderate values of m and n (such as m = n 40), there are tables available which facilitate the calculation of C. (See reference cited above in connection with the one-sample Kolmogorov test.) In addition to the alternative A : F G just considered, the following two alternatives are also of interest; namely, A : F > G, A : F < G, (16) (17) in the sense that F(x) G(x) with strict inequality for at least one x , and in the sense that F(x) G(x) with strict inequality for at least one x . For testing H against A, we employ the statistic D+ m,n dened by
+ Dm ,n = sup Fm x Gn x ; x
{ ()
()
20.4
More About Nonparametric 20.1 Nonparaetric Tests: Rank Estimation Tests
493
+ + and reject H if D+ m,n > C . The cut-off point C is determined through the relation
+ + P Dm ,n > C H =
by utilizing the fact that
+ 2 x N Dm ,n x 1 e
as m, n , x ,
as can be shown. Here N is as before, that is, N = mn/(m + n). Similarly, for testing H against A, we employ the statistic D m,n dened by
Dm ,n = sup Gn x Fm x ; x
{ ()
()
and reject H if D m,n < C . The cut-off point C is determined through the relation
P Dm ,n < C H =
by utilizing the fact that

P
2 x N Dm ,n x 1 e
as m, n , x .
For relevant tables, the reader is referred to the reference cited earlier in this section. The last three tests based on the statistics Dm,n, D+ m,n and Dm,n are known as KolmogorovSmirnov two-sample tests.
20.4 More About Nonparametric Tests: Rank Tests

Consider again the two-sample problem discussed in the latter part of the previous section. Namely, let Xi, i = 1, . . . , m and Yj, j = 1, . . . , n be two independent random samples with continuous d.f.s F and G, respectively. The problem is that of testing the hypothesis H : F = G against various alternatives at level of signicance . Now it seems reasonable that in testing H on the basis of the Xs and Ys, we should reach the same conclusion regarding the rejection or acceptance of H regardless of the scale used in measuring the Xs and Ys. (That is, the conclusion should be the same if the Xs and Ys are multiplied by the same positive constant. This is a special case of what is known as invariance under monotone transformations.) This is done by employing the ranks of the Xs and Ys in the combined sample rather than their actual values. The rank of Xi in the combined sample of Xs and Ys, to be denoted by (Xi), is that integer among the numbers 1, . . . , N (= m + n) which corresponds to the position of Xi after the Xs and Ys have been ordered according to their size. Of course, the rank R(Yj) of Yj in the combined sample of the Xs and Ys is dened in a similar fashion. By the assumption of continuity of F and G, it follows that in
494
20
ordering the Xs and Ys, we have strict inequalities with probability equal to one. For testing the hypothesis H specied above, we are going to use either one of the rank sum statistics RX, RY dened by RX = R X i , RY = R Yj
i =1 j =1 m
( )
( )
(18)
because RX + RY = N(N + 1)/2 (xed), as is easily seen. (See Exercise 20.4.1.) In the present case, and for reasons to become apparent soon, it is customary to take the level of signicance as follows:
( )
N m
N , 1 < k < . m
There are three alternatives of interest to consider, namely, A, A and A, as they are specied by (12), (16) and (17), respectively. As an example, let the r.v.s X, Y be distributed as the Xs and Ys, respectively, and let us consider alternative A. Under A, P(X x) P(Y x), x , so that RX would tend to take on small values; accordingly, we would reject H in favor of A if where C is dened, so that
X < C ,
P X < C H = .
(19) (20)
N Theoretically the determination of C is a simple matter; under H, all (m ) N values of (R(X1), . . . , R(Xm)) are equally likely each having probability 1/(m ). N The rejection region then is dened as follows: Consider all these ( m ) values and for each one of them form the rank sum RX. Then the rejection region consists of the k smallest values of these rank sums. For small values of m and n (n m 10), this procedure is facilitated by tables (see reference cited in previous section), whereas for large values of m and n it becomes unmanageable; for this latter case, the normal approximation to be discussed below may be employed. The remaining two alternatives are treated in a similar fashion. Next, consider the function u dened as follows:
1, if z > 0 uz = 0, if z < 0
()
(21)
and set U = u X i Yj .
i =1 j =1 m n
(22)
Then U is, clearly, the number of times a Y precedes an X and it can be shown (see Exercise 20.4.2) that
U = mn +
n n+1 2
) R
= RX
m m+1 2
).
(23)
20.4
More About Nonparametric 20.1 Nonparaetric Tests: Rank Estimation Tests
495
Therefore the test in (19) can be expressed equivalently in terms of the U statistic. This test is known as the two-sample WilcoxonMannWhitney test. Now it can be shown (see Exercise 20.4.3) that under H,
mn m + n + 1 mn , 2 U = . 2 12 Then the r.v. (U EU)/( (U )) converges in distribution to an r.v. Z distributed as N(0, 1) as m, n and therefore, for large m, n, the limiting distribution (along with the continuity correction for better precision) may be used for determining the cut-off point C by means of (20). A special interesting case, where the rank sum tests of the present section are appropriate, is that where the d.f. G of the Ys is assumed to be of the form EU =
( )
G x = F x , x
()
for some unknown .
As before, F is assumed to be unknown but continuous. In this case, we say that G is a shift of F (to the right if > 0 and to the left if < 0). Then the hypothesis H : F = G is equivalent to testing = 0 and the alternatives A : F G, A : F > G and A : F < G are equivalent to 0, > 0 and < 0, respectively. In closing this section, we should like to mention that there is also the onesample WilcoxonMannWhitney test, as well as other one-sample and twosample rank tests available. However, their discussion here would be beyond the purposes of the present chapter. As an illustration, consider the following numerical example.
EXAMPLE 2
Let m = 5, n = 4 and suppose that X1 = 78, X2 = 65, X3 = 74, X4 = 45, X5 = 82; Y1 = 110, Y2 = 71, Y3 = 53, Y4 = 50. Combining these values and ordering them according to their size, we obtain
( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( )
45 X
50 Y
53 Y
65 X
71 Y
74 X
78 X
82 X
110 Y ,
where an X or Y below a number means that the number is coming from the X or Y sample, respectively. From this, we nd that
R X 1 = 7, R X 2 = 4, R X 3 = 6, R X 4 = 1, R X 5 = 8; R Y1 = 9,
2 3 4
( ) ( ) ( ) ( ) R(Y ) = 5, R(Y ) = 3, R(Y ) = 2, so that
( )
( )
RX = 26, RY = 19.
We also nd that U = 4 + 4 + 3 + 0 = 11. (Incidentally, these results check with (23) and Exercise 20.4.1.) Now
N = 5 + 4 = 9 and
( ) ()
N m 9 5
1 , 126
496
20
and let us take
5 0.04 . 126 Then for testing H against A (given by (16)), we would reject for small values of RX, or equivalently (by means of (23)), for small values of U. For the given m, n, and for the observed value of RX (or U), H is accepted. (See tables on p. 341 of the reference cited in Section 20.3.)
Exercises
20.4.1 Consider the two independent random samples Xi, i = 1, . . . , m and Yj, j = 1, . . . , n and let R(Xi) and (Yj) be the ranks of Xi and Yj, respectively, in the combined sample of the Xs and Ys. Furthermore, let RX and RY be dened by (18). Then show that
RX + RY = N N +1 2
),
where N = m + n.
20.4.2 Let RX and RY be as in the previous exercise and let U be dened by (22). Then establish (23). 20.4.3 Let Xi, i = 1, . . . , m and Yj, j = 1, . . . , n be two independent random samples and let U be dened by (22). Then show that, under H, mn m + n + 1 mn EU = , 2 U = . 2 12
( )
20.5 Sign Test

In this section, we briey mention another nonparametric testthe twosample Sign test, which is easily applicable in many situations of practical importance. In order to avoid distribution related difculties, we assume, as we have also done in previous sections, that the underlying distributions are continuous. More precisely, we suppose that Xj, j = 1, . . . , n are i.i.d. r.v.s with continuous d.f. F and that Yj, j = 1, . . . , n are also i.i.d. r.v.s with continuous d.f. G. The two random samples are assumed to be independent and the hypothesis H to be tested is H : F = G. To this end, consider the n pairs (Xj, Yj), j = 1, . . . , n and set 1, if X j < Y j Zj = 0, if X j > Y j .
20.6
Relative Asymptotic 20.1 Nonparaetric Efficiency Estimation of Tests
497
Also set Z = n j=1Zj and p = P(Xj < Yj). Then, clearly, Z is distributed as B(n, p) 1 and the hypothesis H above is equivalent to testing p = 2 . Depending on the type of the alternatives, one would use the two-sided or the appropriate onesided test. Some cases where the sign test just described is appropriate is when one is interested in comparing the effectiveness of two different drugs used for the treatment of the same disease, the efciency of two manufacturing processes producing the same item, the response of n customers regarding their preferences towards a certain consumer item, etc. Of course, there is also the one-sample Sign test available, but we will not discuss it here. For the sake of an illustration, consider the following numerical example.
EXAMPLE 3
Let n = 10 and suppose that

X1 = 73, X 2 = 68, X 3 = 64, X 4 = 90, X 5 = 83, X 6 = 48, X 7 = 100, X 8 = 75, X 9 = 90, X10 = 85
and
Y1 = 50, Y2 = 100, Y3 = 70, Y4 = 96, Y5 = 74, Y6 = 64, Y7 = 76, Y8 = 83, Y9 = 98, Y10 = 40.
Then Z1 = 0, Z2 = 1, Z3 = 1, Z4 = 1, Z5 = 0, Z6 = 1, Z7 = 0, Z8 = 1, Z9 = 1, Z10 = 0, so that
10
Z
j =1
= 6.
Thus, if = 0.1 and if we are interested in testing H : F = G against A : F G 1 1 (equivalently, p = 2 against p 2 ), we would accept H.
20.6 Relative Asymptotic Efciency of Tests

Consider again the testing hypothesis problem discussed in the previous sections; namely, let Xi, i = 1, . . . , m and Yj, j = 1, . . . , n be i.i.d. r.v.s with continuous d.f.s F and G, respectively. The hypothesis to be tested is H : F = G and the alternative may be either A : F G, or A : F > G, or A : F < G. In employing either the WilcoxonMannWhitney test or the Sign test in the problem just described, we would like to have some measure on the basis of which we could judge the performance of the test in question at least in an asymptotic sense. This is obtained by introducing what is known as the Pitman asymptotic relative efciency of tests. For the precise denition of this concept, suppose that the two sample sizes are the same and let n be the sample size needed in order to obtain a given power , say, against a specied alternative when one of the above-mentioned tests is employed. The level of signi-
498
20
cance is . Formally, we may also employ the t-test (see (36), Chapter 13) for testing the same hypothesis against the same specied alternative at the same level . Let n* be the (common) sample size required in order to achieve a power equal to by employing the t-test. We further assume that the limit of n*/n, as n , exists and is independent of and . Denote this limit by e. Then this quantity e is the Pitman asymptotic relative efciency of the WilcoxonMannWhitney test (or of the Sign test, depending on which one is used) relative to the t-test. Thus, if we use the WilcoxonMannWhitney test 1 and if it so happens that e = 3 , then this means that the WilcoxonMann Whitney test requires approximately three times as many observations as the t-test in order to achieve the same power. However, if e = 5, then the WilcoxonMannWhitney test requires approximately only one-fth as many observations as the t-test in order to achieve the same power. It has been found in the literature that the asymptotic efciency of the WilcoxonMannWhitney test relative to the t-test is 3/ 0.95 when the underlying distribution is Normal, 1 when the underlying distribution is Uniform and when the underlying distribution is Cauchy.
I.3
Basic Denitions About Matrices
499
Appendix I
Topics from Vector and Matrix Algebra
I.1 Basic Denitions in Vector Spaces

For a positive integer n, x is said to be an n-dimensional vector with real components if it is an n-tuple of real numbers. All vectors will be column vectors but for typographical convenience, they will be written in the form of a row with a prime () to indicate transpose. Thus x = (x1, . . . , xn), xj , j = 1, . . . , n. Only vectors with real components will be considered. The set of all n-dimensional vectors is denoted by Vn. Thus Vn = n (= . . . , n factors) in our previous notation, and Vn is called the (real) n-dimensional vector space. The zero vector, to be denoted by O, is the vector all of whose components are equal to 0. Two vectors x = (x1, . . . , xn), y = ( y1, . . . , yn) are said to be equal if xj = yj, j = 1, . . . , n. The sum x + y of two vectors x = (x1, . . . , xn), y = ( y1, . . . , yn) is the vector dened by x + y = (x1 + y1, . . . , xn + yn). This denition is extended in an obvious manner to any nite number of vectors. For any three vectors x, y and z in Vn, the following properties are immediate:
x + y = y + x,
( x + y ) + z = x + ( y + z ) = x + y + z.
The product x of the vector x = (x1, . . . , xn) by the real number (scalar) is the vector dened by x = (x1, . . . , xn). For any two vectors x, y in Vn and any two scalars , , the following properties are immediate:
x + y = x + y,
( + )x = x + x, (x) = (x) = x, (x + y) = x + y , 1x = x.
The inner (or scalar) product xy of any two vectors x = (x1, . . . , xn), y = ( y1, . . . , yn) is a scalar and is dened as follows:
499
500
Appendix I
x y = x j y j .
j =1
For any three vectors x, y and z in Vn and any scalars , , the following properties are immediate:
x y = y x, x y = x y = x y , x y + z = x y + x z,
( ) ( )
( )
x x 0 and x x = 0
if and only if
x = 0;
also if
x y = 0 for every y Vn , then x = 0.
The norm (or length) ||x|| of a vector x in Vn is a non-negative number and is dened by ||x|| = (xx)1/2. For any vector in Vn and any scalar , the following property is immediate:
x = x .
Two vectors x, y in Vn are said to be orthogonal (or perpendicular), and we write x y, if xy = 0. A vector x in Vn is said to be orthogonal (or perpendicular) to a subset U of Vn, and we write x U, if xy = 0 for every y U. A (nonempty) subset V of Vn is a vector space, which is a subspace of Vn, denoted by V Vn, if for any vectors x, y in V and any scalars and , x + y is also in V. Thus, for example, the straight line 1x1 + 2x2 = 0 in the plane, being the set {x = (x1, x2) V2; 1x1 + 2x2 = 0} is a subspace of V2. It is shown easily that for any given set of vectors xj, j = 1, . . . , r in Vn, V dened by
r V = y Vn ; y = j x j , j , j = 1, . . . , j =1
is a subspace of Vn. The vectors xj, j = 1, . . . , r in Vn are said to span (or generate) the subspace V Vn if every vector y in V may be written as follows: y = jr=1jxj for some scalars j, j = 1, . . . , r. For any positive integer m < n, the m-dimensional vector space Vm may be considered as a subspace of Vn by enlarging the m-tuples to n-tuples and identifying the appropriate components with zero in the resulting n-tuples. Thus, for examples, the x-axis in the plane may be identied with the set {x = (x1, x2) V2; x1 , x2 = 0} which is a subspace of V2. Similarly the y-axis in the plane may be identied with the set {y = (y1, y2) V2; y1 = 0, y2 }which is a subspace of V2; the xy-plane in the three-dimensional space may be identied with the set {z = (x1, x2, x3) V3; x1, x2 , x3= 0} which is a subspace of V3, etc. From now on, we shall assume that the above-mentioned identication has been made and we shall write Vm Vn to indicate that Vm is a subspace of Vn.
I.2 I.3 Some Basic Theorems Denitions onAbout Vector Matrices Spaces
501
The vectors xj , j = 1, . . . , k in the subspace V Vn are said to be linearly independent if there are no scalars j, j = 1, . . . , k which are not all zero for which k j = 1j xj = 0; otherwise they are said to be linearly dependent. A basis for the subspace V Vn is any set of linearly independent vectors which span V. The vectors {xj, j = 1, . . . , k} are said to form an orthonormal basis in V if they form a basis in V and also are pairwise orthogonal and of norm one; that is, x ixj = 0 for i j,
x i xi = xi
2
= 1,
i = 1, . . . , k.
For example, by taking
e1 = 1, 0, . . . , 0 , e 2 = 0, 1, 0, . . . , 0 , . . . , e n = 0, . . . , 0, 1 ,
it is clear that the vectors {ej, j = 1, . . . , n} form an orthonormal basis in Vn. It can be shown that the number of vectors in any basis of V is the same and this is the largest number of linearly independent vectors in V. This number is called the dimension of V.
I.2 Some Theorems on Vector Spaces

In this section, we gather together for easy reference those results about vector spaces used in this book.
THEOREM 1.I
For any positive integer n, consider any subspace V Vn. Then V has a basis and any two bases in V have the same number of vectors, say, m (the dimension of V ). In particular, the dimension of Vn is n and m n. Let m, n be any positive integers with m < n and let {xj, j = 1, . . . , m} be an orthonormal basis for Vm. Then this basis can be extended to an orthonormal basis {xj, j = 1, . . . , n} for Vn. Let n be any positive integer, let x be a vector in Vn and let V be a subspace of Vn. Then x V if and only if x is orthogonal to the vectors of a basis for V, or to the vectors of any set of vectors in V spanning V. Let m, n be any positive integers with m < n and let Vm be a subspace of Vn of dimension m. Let U be the set of vectors in Vn each of which is orthogonal to Vm. Then U is an r-dimensional subspace Ur of Vn with r = n m and is called the orthocomplement (or orthogonal complement) of Vm in Vn. Furthermore, any vector x in Vn may be written (decomposed) uniquely as follows: x = v + u with v Vm, u U r. The vectors v, u are called the projections of x into Vm and Ur, respectively, and ||x||2 = ||v||2 + ||u||2. Finally, as z varies in Vm, | x z| has a minimum value obtained for z = v, and as w varies in Ur, ||x w|| has a minimum value obtained for w = u.
THEOREM 2.I
THEOREM 3.I
THEOREM 4.I
502
Appendix I
I.3 Basic Denitions About Matrices

Let m, n be any positive integers. Then a (real) m n matrix Amn is a rectangular array of mn real numbers arranged in m rows and n columns; m and n are called the dimensions of the matrix. Thus
a11 a = 21 am 1 a12 a22 am 2 a1n a2 n amn
A m n
The numbers aij, i = 1, . . . , m; j = 1, . . . , n are called the elements of the matrix. For brevity, we shall write A = (aij), i = 1, . . . , m; j = 1, . . . , n for an m n matrix, and only real matrices will be considered in the sequel. It follows that a vector in Vn is simply an n 1 matrix. A matrix is said to be a square matrix if m = n and then n is called the order of the matrix. The elements aii, i = 1, . . . , n of a square matrix of order n are called the elements of the main diagonal of A, or just the diagonal elements of A. If aij = 0 for all i j (that is, if all of the elements off the main diagonal are 0), then A is called diagonal. A zero matrix is one in which all the elements are equal to zero. A zero matrix will be denoted by 0 regardless of its dimensions. A unit (or identity) matrix is a square matrix in which all diagonal elements are equal to 1 and all other elements are equal to 0. The proper notation for a unit matrix of order n is In. However, we shall often write simply I and the order is to be understood from the context. Thus I = (ij), where ij = 1 if i = j and equals 0 if i j. Two m n matrices are said to be equal if they have identical elements. The sum A + B of two m n matrices A = (aij), B = (bij) is the m = n matrix dened by A + B = (aij + bij). This denition is extended in an obvious manner to any nite number of m n matrices. For any m n matrices A, B and C, the following properties are immediate:
A + B = B + A,
(A + B) + C = A + (B + C) = A + B + C.
The product A of the matrix A = (aij) by the scalar is the matrix dened by A = (aij). The transpose A of the m n matrix A = (aij) is the n m matrix dened by A = (aij). Thus the rows and columns of A are equal to the columns and rows of A, respectively. If A is a square matrix and A = A, then A is called symmetric. Clearly, for a symmetric matrix the elements symmetric with respect to the main diagonal of A are equal; that is, aij = aji for all i and j. For any m n matrices A, B and any scalars , , the following properties are immediate: A = A, A = A , A + B = A + B.
( )
( )
The product AB of the m n matrix A = (aij) by the n = r matrix B = (bij) is the m r matrix dened as follows: AB = (cij), where cij = n k = 1aikbkj. The product
I.3
Basic Denitions About Matrices
503
BA is not dened unless r = m and even then, it is not true, in general, that AB = BA. For example, take
0 0 1 1 A= , B = . 0 1 0 0
Then
0 0 0 1 AB = , BA = , 0 0 0 0
so that AB BA. The products AB, BA are always dened for all square matrices of the same order. Let A be an m n matrix, let B, C be two n r matrices and let D be an r k matrix. Then for any scalars , and , the following properties are immediate:
( ) ( B + C)D = BD + CD, (A)B = A(B) = (AB) = AB, (AB) = BA , (AB)D = A(BD).

IA = AI = A, 0A = A0 = 0, A B + C = AB + AC, By means of the last property, we may omit the parentheses and set ABD for (AB)D = A(BD). Let A be an m n matrix and let ri, i = 1, . . . , m, cj, j = 1, . . . , n stand for the row and column vectors of A, respectively. Then it can be shown that the largest number of independent r-vectors is the same as the largest number of independent c-vectors and this common number is called the rank of the matrix A. Thus the rank of A, to be denoted by rank A, is the common dimension of the two vector spaces spanned by the r-vectors and the c-vectors. Always rank A min(m, n) and if equality occurs, we say that A is non-singular or of full rank; otherwise A is called singular. Let now |A| stand for the determinant of the square matrix A, dened only for square matrices, say m m, by the expression
A = a1i a2j amp ,
where the aij are the elements of A and the summation extends over all permutations (i, j, . . . , p) of (1, 2, . . . , m). The plus sign is chosen if the permutation is even and the minus sign if it is odd. For further elaboration, see any of the references cited at the end of this appendix. It can be shown that A is nonsingular if and only is |A| 0. It can also be shown that if |A| 0, there exists a unique matrix, to be denoted by A1, such that AA1 = A1A = I. The matrix A1 is called the inverse of A. Clearly, (A1)1 = A. Let A be a square matrix of order n such that AA = AA = I. Then A is said to be orthogonal. Let ri and ci, i = 1, . . . , n stand for the row and column
504
Appendix I
vectors of the matrix A of order n. Then the orthogonality of A is equivalent to the following properties:
r iri = ri
= ci
= c ic i = 1 and rirj = c ic j = 0 for i j.
That is, {rj, j = 1, . . . , n} and {cj, j = 1, . . . , n} are orthonormal bases of Vn. For a square matrix A of order n, consider the determinant |A I|, where is a scalar. Then it is immediate that |A I| is a polynomial in of degree n and is called the characteristic polynomial of A. The n roots of the equation |A I| = 0 are called the characteristic (or latent) roots, or eigenvalues of A. The matrix A is said to be positive denite, negative denite, or positive semidenite if its characteristic roots j, j = 1, . . . , n satisfy the following inequalities j > 0, j < 0, j 0, j = 1, . . . , n, respectively.
REMARK 1.I Although all matrices considered here are matrices with real elements, it should be noted that their characteristic roots will, in general, be complex numbers. However, they are always real for symmetric matrices.
Finally, a square matrix A is said to be idempotent if A2 = A.
I.4 Some Theorems About Matrices and Quadratic Forms

Those theorems about matrices used in this book are gathered together here for easy reference.
THEOREM 5.I THEOREM 6.I
Let A, B, C be any m n, n r, r s matrices, respectively. Then (ABC) = CBA and, in particular (by taking C = Ir), (AB) = BA. i) Let A, B be any two matrices of the same order. Then |AB| = |BA| = |A| |B|. ii) For any diagonal matrix A of order n, |A| = n j = 1aj, where aj, j = 1, . . . , n are the diagonal elements of A. iii) For any (square) matrix A, |A| = |A|. iv) For any orthogonal matrix A, |A| is either 1 or 1. v) Let A, B be matrices of the same order and suppose that B is orthogonal, Then |BAB| = |BAB| = |A|. vi) For any matrix A for which |A| 0, |A1| = |A|1. i) A square matrix A is non-singular if and only if |A| 0. ii) Every orthogonal matrix is non-singular. (See (iv) of Theorem 6.I.) iii) Let A be a non-singular square matrix. Then A, A1 are also non-singular. (See (iii), (vi) of Theorem 6.I.) iv) If A is symmetric non-singular, then so is A1. v) Let A, B be non-singular m m matrices. Then the m m matrix AB is non-singular and (AB)1 = B1A1.
THEOREM 7.I
I.4
Some Theorems I.3 About Basic Matrices Denitions and Quadratic About Matrices Forms
505
THEOREM 8.I
i) Let r1, r2 be two vectors in Vn such that r1 r2 = 0 and ||r1|| = ||r2|| = 1. Then there exists an n n orthogonal matrix, the rst two rows of which are equal to r1 , r2 . (For a concrete example, see the application after Theorem 5 in Chapter 9.) ii) Let x be a vector in Vn, let A be an n n orthogonal matrix and set y = Ax. Then xx = yy, so that ||x|| = ||y||. iii) For every symmetric matrix A there is an orthogonal matrix B (of the same order as that of A) such that the matrix BAB is diagonal (and its diagonal elements are the characteristic roots of A).
THEOREM 9.I
i) For any square matrix A,

rank AA = rank A A = rank A = rank A .
ii) Let A, B and C be m n, n r and r k matrices, respectively. Then

rank AB min rank A, rank B
( ) )
) )
and
rank ABC min rank A, rank B, rank C .
iii) Let A, B and C be m n, m m and n n matrices, respectively, and suppose that B, C are non-singular. Then
rank BA = rank AC = rank BAC = rank A.
( )
( )
iv) Let A, B and C be m n, m m and n n matrices, respectively, and suppose that B, C are non-singular. Then rank (BAC) = rank A. In particular, rank (BAB) = rank (BAB) = rank A if m = n and B is orthogonal. v) For any matrix A, rank A = number of nonzero characteristic roots of A.
THEOREM 10.I
i) If A is positive denite, A1 exists and is also positive denite. ii) For any nonsingular square matrix A, AA is positive denite (and symmetric). iii) Let A = (aij), i, j = 1, . . . , n and dene Aj by a a1 j A j = 11 , a j 1 a jj j = 1, . . . , n.
Then A is positive denite if and only if |Aj| > 0, j = 1, . . . , n. In particular, a diagonal matrix is positive denite if and only if its diagonal elements are all positive. iv) A matrix A of order n is positive denite (semidenite, negative denite, respectively,) if and only if xAx > 0 (0, <0, respectively) for every x Vn with x 0.
506
Appendix I
v) If A is a positive semidenite matrix of order n and B is a non-singular matrix of order n, then BAB is positive semidenite. vi) The characteristic roots of a positive denite (semidenite) matrix are positive (nonnegative). The following theorem refers to quadratic forms. For the denition of a quadratic form, the reader is referred to Denition 1, Chapter 19.
THEOREM 11.I
i) Let A be a symmetric matrix of order n. If xAx = xx identically in x Vn, then A = I. ii) Consider the quadratic form Q = xAx, where A is of order n, and suppose that rank A = r. Then there exist r linear forms in the xs
b x ,
ij j j =1
i = 1, . . . , r
such that n Q = i bij x j , j =1 i =1

r 2
where i is either 1 or 1, i = 1, . . . , r. iii) Let Q be as in (ii). There exists an orthogonal matrix B such that if y = B 1 x, then Q = j y 2 j,
j =1 m
where j, j = 1, . . . , m are the nonzero characteristic roots of A. iv) Let Q be as in (ii) and suppose that A is idempotent and rank A = r. There exists an orthogonal matrix B such that if y = B1x, then Q = y2 j.
j =1 r
Finally, we formulate the following results referring to idempotent matrices:

THEOREM 12.I
i) The characteristic roots of an idempotent matrix are either 1 or 0. ii) A diagonal matrix whose (diagonal) elements are either 1 or 0 is idempotent. iii) If Aj, j = 1, . . . , m are symmetric idempotent matrices of order n, such that AiAj = 0 for 1 i < j m, then m j = 1Aj is idempotent and
rank A
j =1
m = rank A j . j =1
In particular,
rank A 1 + rank I A 1 = n
I.4
Some Theorems I.3 About Basic Matrices Denitions and Quadratic About Matrices Forms
507
and
rank A 1 + rank A 2 + rank I A 1 A 2 = n.

iv) If Aj, j = 1, . . . , m are symmetric idempotent matrices of the same order and m j = 1Aj is also idempotent, the AiAj = 0 for 1 i < j m. The proof of the theorems formulated in this appendix may be found in most books of linear algebra. For example, see Birkhoff and MacLane, A Survey of Modern Algebra, 3d ed., MacMillan, 1965; S. Lang, Linear Algebra, Addison-Wesley, 1968; D. C. Murdoch, Linear Algebra for Undergraduates, Wiley, 1957; S. Perlis, Theory of Matrices, Addison-Wesley, 1952. For a brief exposition of most results from linear algebra employed in statistics, see also C. R. Rao, Linear Statistical Inference and Its Applications, Chapter 1, Wiley, 1965; H. Scheff, The Analysis of Variance, Appendices I and II, Wiley, 1959; and F. A. Graybill, An Introduction to Linear Statistical Models, Vol. I, Chapter 1, McGraw-Hill, 1961.
508
Appendix II
Noncentral t, 2 and F Distributions
Appendix II
II.1 Noncentral t-Distribution

It was seen in Chapter 9, Application 2, that if the independent r.v.s X and Y were distributed as N(0, 1) and 2 r, respectively, then the distribution of the r.v. T = X (Y r ) was the (Students) t-distribution with r d.f. Now let X and Y be independent r.v.s distributed as N(, 1) and 2 r, respectively, and set T = X (Y r ) . The r.v. T is said to have the noncentral t-distribution with r d.f. and noncentrality parameter . This distribution, as well as an r.v. having this distribution, if often denoted by tr :. Using the denition of a t r: r.v., it can be found by well known methods that its p.d.f. is given by
ft t ; =
r;
( )
( )
1 r 2
r +1 2
( )
( r 1)
2 1 x exp x + t dx, t . r 2
II.2 Noncentral 2-Distribution

It was seen in Chapter 7 (see corollary to Theorem 5) that if X1, . . . , Xr were independent normally distributed r.v.s with variance 1 and mean 0, then the 2 r.v. X = jr= 1X 2 j was distributed as r. Let now the r.v.s X1, . . . , Xr be independent normally distributed with variance 1 but means 1, . . . , r, respectively. Then the distribution of the r.v. X* = jr= 1X 2 j is said to be the noncentral
508
II.3 Noncentral F-Distribution
509
chi-square distribution with r d.f. and noncentrality parameter , where 2 = jr= 1 2 j. This distribution, and also an r.v. having this distribution, is often 2 denoted by r2 :. Using the denition of a r; r.v., one can nd its p.d.f. but it does not have any simple closed form. It can be seen that this p.d.f. is a mixture of 2-distributions with Poisson weights. More precisely, one has f x; = Pj fr + 2j x , x 0,
2 r;
j =0
() ()
where Pj = e
()
2 2
( 2)
2
j!
and
fr + 2 j
is the p.d.f. of
r2+ 2j ,
j = 0, 1, . . . .
II.3 Noncentral F-Distribution

In Chapter 9, Application 2, the F-distribution with r1 and r2 d.f. was dened as the distribution of the r.v.
F= X r1 , Y r2
1 2
2 where X and Y were independent r.v.s distributed as 2 r and r , respectively. Suppose now that the r.v.s X and Y are independent and distributed as r2: and 2 r , respectively, and set
1 2
F =
X r1 . Y r2
Then the distribution of F is said to be the noncentral F-distribution with r1 and r2 d.f. and noncentrality parameter . This distribution, and also an r.v. having this distribution, is often denoted by F r ,r ;, and its p.d.f., which does not have any simple closed form, is given by the following expression:
1 2
fF
where
r1 , r2 :
(f; ) = e
cj
j =0
( 2)
2
1 r 1+ j 2 1 1 2
j!
(1 + f )
( r + r )+ j
1 2
f 0,
1 r1 + r2 + j 2 , cj = 1 1 r1 + j r2 2 2
j = 0, 1, . . . .
510
Appendix II
REMARKS
(i) By setting = 0 in the noncentral t, 2 and F-distributions, we obtain the t, 2 and F-distributions, respectively. In view of this, the latter distributions may also be called central t, 2 and F-distributions. (ii) Tables for the noncentral t, 2 and F-distributions are given in a reference cited elsewhere, namely, Handbook of Statistical Tables by D. B. Owen. Addison-Wesley, 1962.
Tables
511
Appendix III
Tables
Table 1 The Cumulative Binomial Distribution The tabulated quantity is
p (1 p ) j
j j =0
n j
n 2
k 0 1 2 0 1 2 3 0 1 2 3 4 0 1 2 3 4 5
1/16 0.8789 0.9961 1.0000 0.8240 0.9888 0.9998 1.0000 0.7725 0.9785 0.9991 1.0000 1.0000 0.7242 0.9656 0.9978 0.9999 1.0000 1.0000
2/16 0.7656 0.9844 1.0000 0.6699 0.9570 0.9980 1.0000 0.5862 0.9211 0.9929 0.9998 1.0000 0.5129 0.8793 0.9839 0.9989 1.0000 1.0000
3/16 0.6602 0.9648 1.0000 0.5364 0.9077 0.9934 1.0000 0.4358 0.8381 0.9773 0.9988 1.0000 0.3541 0.7627 0.9512 0.9947 0.9998 1.0000
p 4/16 0.5625 0.9375 1.0000 0.4219 0.8437 0.9844 1.0000 0.3164 0.7383 0.9492 0.9961 1.0000 0.2373 0.6328 0.8965 0.9844 0.9990 1.0000
5/16 0.4727 0.9023 1.0000 0.3250 0.7681 0.9695 1.0000 0.2234 0.6296 0.9065 0.9905 1.0000 0.1536 0.5027 0.8200 0.9642 0.9970 1.0000
6/16 0.3906 0.8594 1.0000 0.2441 0.6836 0.9473 1.0000 0.1526 0.5188 0.8484 0.9802 1.0000 0.0954 0.3815 0.7248 0.9308 0.9926 1.0000
7/16 0.3164 0.8086 1.0000 0.1780 0.5933 0.9163 1.0000 0.1001 0.4116 0.7749 0.9634 1.0000 0.0563 0.2753 0.6160 0.8809 0.9840 1.0000
8/16 0.2500 0.7500 1.0000 0.1250 0.5000 0.8750 1.0000 0.0625 0.3125 0.6875 0.9375 1.0000 0.0312 0.1875 0.5000 0.8125 0.9687 1.0000
511
512
Appendix III Tables
Table 1
(continued )
n 6
k 0 1 2 3 4 5 6 0 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 8 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8
1/16 0.6789 0.9505 0.9958 0.9998 1.0000 1.0000 1.0000 0.6365 0.9335 0.9929 0.9995 1.0000 1.0000 1.0000 1.0000 0.5967 0.9150 0.9892 0.9991 1.0000 1.0000 1.0000 1.0000 1.0000 0.5594 0.8951 0.9846 0.9985 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 0.5245 0.8741 0.9790 0.9976 0.9998 1.0000 1.0000 1.0000 1.0000
2/16 0.4488 0.8335 0.9709 0.9970 0.9998 1.0000 1.0000 0.3927 0.7854 0.9537 0.9938 0.9995 1.0000 1.0000 1.0000 0.3436 0.7363 0.9327 0.9888 0.9988 0.9999 1.0000 1.0000 1.0000 0.3007 0.6872 0.9081 0.9817 0.9975 0.9998 1.0000 1.0000 1.0000 1.0000 0.2631 0.6389 0.8805 0.9725 0.9955 0.9995 1.0000 1.0000 1.0000
3/16 0.2877 0.6861 0.9159 0.9866 0.9988 1.0000 1.0000 0.2338 0.6114 0.8728 0.9733 0.9965 0.9997 1.0000 1.0000 0.1899 0.5406 0.8238 0.9545 0.9922 0.9991 0.9999 1.0000 1.0000 0.1543 0.4748 0.7707 0.9300 0.9851 0.9978 0.9998 1.0000 1.0000 1.0000 0.1254 0.4147 0.7152 0.9001 0.9748 0.9955 0.9994 1.0000 1.0000
p 4/16 0.1780 0.5339 0.8306 0.9624 0.9954 0.9998 1.0000 0.1335 0.4449 0.7564 0.9294 0.9871 0.9987 0.9999 1.0000 0.1001 0.3671 0.6785 0.8862 0.9727 0.9958 0.9996 1.0000 1.0000 0.0751 0.3003 0.6007 0.8343 0.9511 0.9900 0.9987 0.9999 1.0000 1.0000 0.0563 0.2440 0.5256 0.7759 0.9219 0.9803 0.9965 0.9996 1.0000
5/16 0.1056 0.3936 0.7208 0.9192 0.9868 0.9991 1.0000 0.0726 0.3036 0.6186 0.8572 0.9656 0.9952 0.9997 1.0000 0.0499 0.2314 0.5201 0.7826 0.9318 0.9860 0.9983 0.9999 1.0000 0.0343 0.1747 0.4299 0.7006 0.8851 0.9690 0.9945 0.9994 1.0000 1.0000 0.0236 0.1308 0.3501 0.6160 0.8275 0.9428 0.9865 0.9979 0.9998
6/16 0.0596 0.2742 0.5960 0.8535 0.9694 0.9972 1.0000 0.0373 0.1937 0.4753 0.7570 0.9260 0.9868 0.9990 1.0000 0.0233 0.1350 0.3697 0.6514 0.8626 0.9640 0.9944 0.9996 1.0000 0.0146 0.0931 0.2817 0.5458 0.7834 0.9260 0.9830 0.9977 0.9999 1.0000 0.0091 0.0637 0.2110 0.4467 0.6943 0.8725 0.9616 0.9922 0.9990
7/16 0.0317 0.1795 0.4669 0.7650 0.9389 0.9930 1.0000 0.0178 0.1148 0.3412 0.6346 0.8628 0.9693 0.9969 1.0000 0.0100 0.0724 0.2422 0.5062 0.7630 0.9227 0.9849 0.9987 1.0000 0.0056 0.0451 0.1679 0.3907 0.6506 0.8528 0.9577 0.9926 0.9994 1.0000 0.0032 0.0278 0.1142 0.2932 0.5369 0.7644 0.9118 0.9773 0.9964
8/16 0.0156 0.1094 0.3437 0.6562 0.8906 0.9844 1.0000 0.0078 0.0625 0.2266 0.5000 0.7734 0.9375 0.9922 1.0000 0.0039 0.0352 0.1445 0.3633 0.6367 0.8555 0.9648 0.9961 1.0000 0.0020 0.0195 0.0898 0.2539 0.5000 0.7461 0.9102 0.9805 0.9980 1.0000 0.0010 0.0107 0.0547 0.1719 0.3770 0.6230 0.8281 0.9453 0.9893
10
Tables
513
Table 1
(continued )
n 10 11
k 9 10 0 1 2 3 4 5 6 7 8 9 10 11 0 1 2 3 4 5 6 7 8 9 10 11 12 0 1 2 3 4 5 6 7 8 9 10 11 12 13 0 1
1/16 1.0000 1.0000 0.4917 0.8522 0.9724 0.9965 0.9997 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.4610 0.8297 0.9649 0.9950 0.9995 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.4321 0.8067 0.9565 0.9931 0.9992 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.4051 0.7833
2/16 1.0000 1.0000 0.2302 0.5919 0.8503 0.9610 0.9927 0.9990 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 0.2014 0.5467 0.8180 0.9472 0.9887 0.9982 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.1762 0.5035 0.7841 0.9310 0.9835 0.9970 0.9996 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.1542 0.4626
3/16 1.0000 1.0000 0.1019 0.3605 0.6589 0.8654 0.9608 0.9916 0.9987 0.9999 1.0000 1.0000 1.0000 1.0000 0.0828 0.3120 0.6029 0.8267 0.9429 0.9858 0.9973 0.9996 1.0000 1.0000 1.0000 1.0000 1.0000 0.0673 0.2690 0.5484 0.7847 0.9211 0.9778 0.9952 0.9992 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 0.0546 0.2312
p 4/16 1.0000 1.0000 0.0422 0.1971 0.4552 0.7133 0.8854 0.9657 0.9924 0.9988 0.9999 1.0000 1.0000 1.0000 0.0317 0.1584 0.3907 0.6488 0.8424 0.9456 0.9857 0.9972 0.9996 1.0000 1.0000 1.0000 1.0000 0.0238 0.1267 0.3326 0.5843 0.7940 0.9198 0.9757 0.9944 0.9990 0.9999 1.0000 1.0000 1.0000 1.0000 0.0178 0.1010
5/16 1.0000 1.0000 0.0162 0.0973 0.2816 0.5329 0.7614 0.9068 0.9729 0.9943 0.9992 0.9999 1.0000 1.0000 0.0111 0.0720 0.2240 0.4544 0.6900 0.8613 0.9522 0.9876 0.9977 0.9997 1.0000 1.0000 1.0000 0.0077 0.0530 0.1765 0.3824 0.6164 0.8078 0.9238 0.9765 0.9945 0.9991 0.9999 1.0000 1.0000 1.0000 0.0053 0.0388
6/16 0.9999 1.0000 0.0057 0.0432 0.1558 0.3583 0.6014 0.8057 0.9282 0.9807 0.9965 0.9996 1.0000 1.0000 0.0036 0.0291 0.1135 0.2824 0.5103 0.7291 0.8822 0.9610 0.9905 0.9984 0.9998 1.0000 1.0000 0.0022 0.0195 0.0819 0.2191 0.4248 0.6470 0.8248 0.9315 0.9795 0.9955 0.9993 0.9999 1.0000 1.0000 0.0014 0.0130
7/16 0.9997 1.0000 0.0018 0.0170 0.0764 0.2149 0.4303 0.6649 0.8473 0.9487 0.9881 0.9983 0.9999 1.0000 0.0010 0.0104 0.0504 0.1543 0.3361 0.5622 0.7675 0.9043 0.9708 0.9938 0.9992 1.0000 1.0000 0.0006 0.0063 0.0329 0.1089 0.2565 0.4633 0.6777 0.8445 0.9417 0.9838 0.9968 0.9996 1.0000 1.0000 0.0003 0.0038
8/16 0.9990 1.0000 0.0005 0.0059 0.0327 0.1133 0.2744 0.5000 0.7256 0.8867 0.9673 0.9941 0.9995 1.0000 0.0002 0.0032 0.0193 0.0730 0.1938 0.3872 0.6128 0.8062 0.9270 0.9807 0.9968 0.9998 1.0000 0.0001 0.0017 0.0112 0.0461 0.1334 0.2905 0.5000 0.7095 0.8666 0.9539 0.9888 0.9983 0.9999 1.0000 0.0001 0.0009
12
13
14
514
Appendix III Tables
Table 1
(continued )
n 14
k 2 3 4 5 6 7 8 9 10 11 12 13 14 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 1 2 3 4 5 6 7 8 9 10 11 12 13
1/16 0.9471 0.9908 0.9988 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.3798 0.7596 0.9369 0.9881 0.9983 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.3561 0.7359 0.9258 0.9849 0.9977 0.9997 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000
2/16 0.7490 0.9127 0.9970 0.9953 0.9993 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.1349 0.4241 0.7132 0.8922 0.9689 0.9930 0.9988 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.1181 0.3879 0.6771 0.8698 0.9593 0.9900 0.9981 0.9997 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000
3/16 0.4960 0.7404 0.8955 0.9671 0.9919 0.9985 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0444 0.1981 0.4463 0.6946 0.8665 0.9537 0.9873 0.9972 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0361 0.1693 0.3998 0.6480 0.8342 0.9373 0.9810 0.9954 0.9991 0.9999 1.0000 1.0000 1.0000 1.0000
p 4/16 0.2811 0.5213 0.7415 0.8883 0.9167 0.9897 0.9978 0.9997 1.0000 1.0000 1.0000 1.0000 1.0000 0.0134 0.0802 0.2361 0.4613 0.6865 0.8516 0.9434 0.9827 0.9958 0.9992 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 0.0100 0.0635 0.1971 0.4050 0.6302 0.8103 0.9204 0.9729 0.9925 0.9984 0.9997 1.0000 1.0000 1.0000
5/16 0.1379 0.3181 0.5432 0.7480 0.8876 0.9601 0.9889 0.9976 0.9996 1.0000 1.0000 1.0000 1.0000 0.0036 0.0283 0.1069 0.2618 0.4729 0.6840 0.8435 0.9374 0.9799 0.9949 0.9990 0.9999 1.0000 1.0000 1.0000 1.0000 0.0025 0.0206 0.0824 0.2134 0.4069 0.6180 0.7940 0.9082 0.9666 0.9902 0.9977 0.9996 0.9999 1.0000
6/16 0.0585 0.1676 0.3477 0.5637 0.7581 0.8915 0.9615 0.9895 0.9979 0.9997 1.0000 1.0000 1.0000 0.0009 0.0087 0.0415 0.1267 0.2801 0.4827 0.6852 0.8415 0.9352 0.9790 0.9947 0.9990 0.9999 1.0000 1.0000 1.0000 0.0005 0.0057 0.0292 0.0947 0.2226 0.4067 0.6093 0.7829 0.9001 0.9626 0.9888 0.9974 0.9995 0.9999
7/16 0.0213 0.0756 0.1919 0.3728 0.5839 0.7715 0.8992 0.9654 0.9911 0.9984 0.9998 1.0000 1.0000 0.0002 0.0023 0.0136 0.0518 0.1410 0.2937 0.4916 0.6894 0.8433 0.9364 0.9799 0.9952 0.9992 0.9999 1.0000 1.0000 0.0001 0.0014 0.0086 0.0351 0.1020 0.2269 0.4050 0.6029 0.7760 0.8957 0.9609 0.9885 0.9975 0.9996
8/16 0.0065 0.0287 0.0898 0.2120 0.3953 0.6047 0.7880 0.9102 0.9713 0.9935 0.9991 0.9999 1.0000 0.0000 0.0005 0.0037 0.0176 0.0592 0.1509 0.3036 0.5000 0.6964 0.8491 0.9408 0.9824 0.9963 0.9995 1.0000 1.0000 0.0000 0.0003 0.0021 0.0106 0.0384 0.1051 0.2272 0.4018 0.5982 0.7728 0.8949 0.9616 0.9894 0.9979
15
16
Tables
515
Table 1
(continued )
n 16
k 14 15 16 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 0 1 2 3 4
1/16 1.0000 1.0000 1.0000 0.3338 0.7121 0.9139 0.9812 0.9969 0.9996 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.3130 0.6885 0.9013 0.9770 0.9959 0.9994 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.2934 0.6650 0.8880 0.9722 0.9947
2/16 1.0000 1.0000 1.0000 0.1033 0.3542 0.6409 0.8457 0.9482 0.9862 0.9971 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0904 0.3228 0.6051 0.8201 0.9354 0.9814 0.9957 0.9992 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0791 0.2938 0.5698 0.7933 0.9209
3/16 1.0000 1.0000 1.0000 0.0293 0.1443 0.3566 0.6015 0.7993 0.9180 0.9728 0.9927 0.9984 0.9997 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0238 0.1227 0.3168 0.5556 0.7622 0.8958 0.9625 0.9889 0.9973 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0193 0.1042 0.2804 0.5108 0.7235
p 4/16 1.0000 1.0000 1.0000 0.0075 0.0501 0.1637 0.3530 0.5739 0.7653 0.8929 0.9598 0.9876 0.9969 0.9994 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 0.0056 0.0395 0.1353 0.3057 0.5187 0.7175 0.8610 0.9431 0.9807 0.9946 0.9988 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0042 0.0310 0.1113 0.2631 0.4654
5/16 1.0000 1.0000 1.0000 0.0017 0.0149 0.0631 0.1724 0.3464 0.5520 0.7390 0.8725 0.9484 0.9828 0.9954 0.9990 0.9998 1.0000 1.0000 1.0000 1.0000 0.0012 0.0108 0.0480 0.1383 0.2920 0.4878 0.6806 0.8308 0.9247 0.9721 0.9915 0.9979 0.9996 0.9999 1.0000 1.0000 1.0000 1.0000 0.0008 0.0078 0.0364 0.1101 0.2440
6/16 1.0000 1.0000 1.0000 0.0003 0.0038 0.0204 0.0701 0.1747 0.3377 0.5333 0.7178 0.8561 0.9391 0.9790 0.9942 0.9987 0.9998 1.0000 1.0000 1.0000 0.0002 0.0025 0.0142 0.0515 0.1355 0.2765 0.4600 0.6486 0.8042 0.9080 0.9640 0.9885 0.9970 0.9994 0.9999 1.0000 1.0000 1.0000 0.0001 0.0016 0.0098 0.0375 0.1040
7/16 1.0000 1.0000 1.0000 0.0001 0.0008 0.0055 0.0235 0.0727 0.1723 0.3271 0.5163 0.7002 0.8433 0.9323 0.9764 0.9935 0.9987 0.9998 1.0000 1.0000 0.0000 0.0005 0.0034 0.0156 0.0512 0.1287 0.2593 0.4335 0.6198 0.7807 0.8934 0.9571 0.9860 0.9964 0.9993 0.9999 1.0000 1.0000 0.0000 0.0003 0.0021 0.0103 0.0356
8/16 0.9997 1.0000 1.0000 0.0000 0.0001 0.0012 0.0064 0.0245 0.0717 0.1662 0.3145 0.5000 0.6855 0.8338 0.9283 0.9755 0.9936 0.9988 0.9999 1.0000 0.0000 0.0001 0.0007 0.0038 0.0154 0.0481 0.1189 0.2403 0.4073 0.5927 0.7597 0.8811 0.9519 0.9846 0.9962 0.9993 0.9999 1.0000 0.0000 0.0000 0.0004 0.0022 0.0096
17
18
19
516
Appendix III Tables
Table 1
(continued )
n 19
k 5 6 7 8 9 10 11 12 13 14 15 16 17 18 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 0 1 2 3 4 5 6 7 8
1/16 0.9992 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.2751 0.6148 0.8741 0.9670 0.9933 0.9989 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.2579 0.6189 0.8596 0.9612 0.9917 0.9986 0.9998 1.0000 1.0000
2/16 0.9757 0.9939 0.9988 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0692 0.2669 0.5353 0.7653 0.9050 0.9688 0.9916 0.9981 0.9997 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0606 0.2422 0.5018 0.7366 0.8875 0.9609 0.9888 0.9973 0.9995
3/16 0.8707 0.9500 0.9840 0.9957 0.9991 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0157 0.0883 0.2473 0.4676 0.6836 0.8431 0.9351 0.9776 0.9935 0.9984 0.9997 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0128 0.0747 0.2175 0.4263 0.6431 0.8132 0.9179 0.9696 0.9906
p 4/16 0.6678 0.8251 0.9225 0.9713 0.9911 0.9977 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0032 0.0243 0.0913 0.2252 0.4148 0.6172 0.7858 0.8982 0.9591 0.9861 0.9961 0.9991 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0024 0.0190 0.0745 0.1917 0.3674 0.5666 0.7436 0.8701 0.9439
5/16 0.4266 0.6203 0.7838 0.8953 0.9573 0.9854 0.9959 0.9990 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 0.0006 0.0056 0.0275 0.0870 0.2021 0.3695 0.5598 0.7327 0.8605 0.9379 0.9766 0.9926 0.9981 0.9996 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 0.0004 0.0040 0.0206 0.0684 0.1662 0.3172 0.5003 0.6787 0.8206
6/16 0.2236 0.3912 0.5779 0.7459 0.8691 0.9430 0.9793 0.9938 0.9985 0.9997 1.0000 1.0000 1.0000 1.0000 0.0001 0.0011 0.0067 0.0271 0.0790 0.1788 0.3284 0.5079 0.6829 0.8229 0.9153 0.9657 0.9884 0.9968 0.9993 0.9999 1.0000 1.0000 1.0000 1.0000 0.0001 0.0007 0.0046 0.0195 0.0596 0.1414 0.2723 0.4405 0.6172
7/16 0.0948 0.2022 0.3573 0.5383 0.7103 0.8441 0.9292 0.9734 0.9919 0.9980 0.9996 1.0000 1.0000 1.0000 0.0000 0.0002 0.0013 0.0067 0.0245 0.0689 0.1552 0.2894 0.4591 0.6350 0.7856 0.8920 0.9541 0.9838 0.9953 0.9989 0.9998 1.0000 1.0000 1.0000 0.0000 0.0001 0.0008 0.0044 0.0167 0.0495 0.1175 0.2307 0.3849
8/16 0.0318 0.0835 0.1796 0.3238 0.5000 0.0672 0.8204 0.9165 0.9682 0.9904 0.9978 0.9996 1.0000 1.0000 0.0000 0.0000 0.0002 0.0013 0.0059 0.0207 0.0577 0.1316 0.2517 0.4119 0.5881 0.7483 0.8684 0.9423 0.9793 0.9941 0.9987 0.9998 1.0000 1.0000 0.0000 0.0000 0.0001 0.0007 0.0036 0.0133 0.0392 0.0946 0.1917
20
21
Tables
517
Table 1
(continued )
n 21
k 9 10 11 12 13 14 15 16 17 18 19 20 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 0 1 2 3 4 5 6 7 8 9
1/16 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.2418 0.5963 0.8445 0.9548 0.9898 0.9981 0.9997 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.2266 0.5742 0.8290 0.9479 0.9876 0.9976 0.9996 1.0000 1.0000 1.0000
2/16 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0530 0.2195 0.4693 0.7072 0.8687 0.9517 0.9853 0.9963 0.9992 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0464 0.1987 0.4381 0.6775 0.8485 0.9413 0.9811 0.9949 0.9988 0.9998
3/16 0.9975 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0104 0.0631 0.1907 0.3871 0.6024 0.7813 0.8983 0.9599 0.9866 0.9962 0.9991 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0084 0.0532 0.1668 0.3503 0.5621 0.7478 0.8763 0.9484 0.9816 0.9944
p 4/16 0.9794 0.9936 0.9983 0.9996 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0018 0.0149 0.0606 0.1624 0.3235 0.5168 0.6994 0.8385 0.9254 0.9705 0.9900 0.9971 0.9993 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0013 0.0116 0.0492 0.1370 0.2832 0.4685 0.6537 0.8037 0.9037 0.9592
5/16 0.9137 0.9645 0.9876 0.9964 0.9991 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0003 0.0029 0.0154 0.0535 0.1356 0.2700 0.4431 0.6230 0.7762 0.8846 0.9486 0.9804 0.9936 0.9982 0.9996 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 0.0002 0.0021 0.0115 0.0416 0.1100 0.2280 0.3890 0.5668 0.7283 0.8507
6/16 0.7704 0.8806 0.9468 0.9799 0.9936 0.9983 0.9996 0.9999 1.0000 1.0000 1.0000 1.0000 0.0000 0.0005 0.0031 0.0139 0.0445 0.1107 0.2232 0.3774 0.5510 0.7130 0.8393 0.9220 0.9675 0.9885 0.9966 0.9991 0.9998 1.0000 1.0000 1.0000 1.0000 0.0000 0.0003 0.0021 0.0099 0.0330 0.0859 0.1810 0.3196 0.4859 0.6522
7/16 0.5581 0.7197 0.8454 0.9269 0.9708 0.9903 0.9974 0.9994 0.9999 1.0000 1.0000 1.0000 0.0000 0.0001 0.0005 0.0028 0.0133 0.0352 0.0877 0.1812 0.3174 0.4823 0.6490 0.7904 0.8913 0.9516 0.9818 0.9943 0.9985 0.9997 1.0000 1.0000 1.0000 0.0000 0.0000 0.0003 0.0018 0.0076 0.0247 0.0647 0.1403 0.2578 0.4102
8/16 0.3318 0.5000 0.6682 0.8083 0.9054 0.9605 0.9867 0.9964 0.9993 0.9999 1.0000 1.0000 0.0000 0.0000 0.0001 0.0004 0.0022 0.0085 0.0267 0.0669 0.1431 0.2617 0.4159 0.5841 0.7383 0.8569 0.9331 0.9739 0.9915 0.9978 0.9995 0.9999 1.0000 0.0000 0.0000 0.0000 0.0002 0.0013 0.0053 0.0173 0.0466 0.1050 0.2024
22
23
518
Appendix III Tables
Table 1
(continued )
n 23
k 10 11 12 13 14 15 16 17 18 19 20 21 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 0 1 2 3 4 5 6 7
1/16 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.2125 0.5524 0.8131 0.9405 0.9851 0.9970 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.1992 0.5132 0.7968 0.9325 0.9823 0.9962 0.9993 0.9999
2/16 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0406 0.1797 0.4082 0.6476 0.8271 0.9297 0.9761 0.9932 0.9983 0.9997 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0355 0.1623 0.3796 0.6176 0.8047 0.9169 0.9703 0.9910
3/16 0.9986 0.9997 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0069 0.0448 0.1455 0.3159 0.5224 0.7130 0.8522 0.9349 0.9754 0.9920 0.9978 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0056 0.0377 0.1266 0.2840 0.4837 0.6772 0.8261 0.9194
p 4/16 0.9851 0.9954 0.9988 0.9997 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0010 0.0090 0.0398 0.1150 0.2466 0.4222 0.6074 0.7662 0.8787 0.9453 0.9787 0.9928 0.9979 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0008 0.0070 0.0321 0.0962 0.2137 0.3783 0.5611 0.7265
5/16 0.9286 0.9705 0.9895 0.9968 0.9992 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0001 0.0015 0.0086 0.0322 0.0886 0.1911 0.3387 0.5112 0.6778 0.8125 0.9043 0.9574 0.9835 0.9945 0.9984 0.9996 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 0.0001 0.0011 0.0064 0.0248 0.0710 0.1591 0.2926 0.4573
6/16 0.7919 0.8910 0.9504 0.9806 0.9935 0.9982 0.9996 0.9999 1.0000 1.0000 1.0000 1.0000 0.0000 0.0002 0.0014 0.0070 0.0243 0.0661 0.1453 0.2676 0.4235 0.5898 0.7395 0.8538 0.9281 0.9693 0.9887 0.9964 0.9990 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 0.0000 0.0001 0.0010 0.0049 0.0178 0.0504 0.1156 0.2218
7/16 0.5761 0.7285 0.8471 0.9252 0.9686 0.9888 0.9967 0.9992 0.9998 1.0000 1.0000 1.0000 0.0000 0.0000 0.0002 0.0011 0.0051 0.0172 0.0472 0.1072 0.2064 0.3435 0.5035 0.6618 0.7953 0.8911 0.9496 0.9799 0.9932 0.9981 0.9996 0.9999 1.0000 1.0000 1.0000 0.0000 0.0000 0.0001 0.0007 0.0033 0.0119 0.0341 0.0810
8/16 0.3388 0.5000 0.6612 0.7976 0.8950 0.9534 0.9827 0.9947 0.9987 0.9998 1.0000 1.0000 0.0000 0.0000 0.0000 0.0001 0.0008 0.0033 0.0113 0.0320 0.0758 0.1537 0.2706 0.4194 0.5806 0.7294 0.8463 0.9242 0.9680 0.9887 0.9967 0.9992 0.9999 1.0000 1.0000 0.0000 0.0000 0.0000 0.0001 0.0005 0.0028 0.0073 0.0216
24
25
Tables
519
Table 1
(continued )
n 25
k 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
1/16 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000
2/16 0.9977 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000
3/16 0.9678 0.9889 0.9967 0.9992 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000
p 4/16 0.8506 0.9287 0.9703 0.9893 0.9966 0.9991 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000
5/16 0.6258 0.7704 0.8756 0.9408 0.9754 0.9911 0.9972 0.9992 0.9998 1.0000 1.0000 1.0000 1.0000 1.0000 1.0000
6/16 0.3651 0.5275 0.6834 0.8110 0.9003 0.9538 0.9814 0.9935 0.9981 0.9995 0.9999 1.0000 1.0000 1.0000 1.0000
7/16 0.1630 0.2835 0.4335 0.5926 0.7369 0.8491 0.9240 0.9667 0.9874 0.9960 0.9989 0.9998 1.0000 1.0000 1.0000
8/16 0.0539 0.1148 0.2122 0.3450 0.5000 0.6550 0.7878 0.8852 0.9462 0.9784 0.9927 0.9980 0.9995 0.9999 1.0000
520
Appendix III Tables
Table 2 The Cumulative Poisson Distribution The tabulated quantity is
e
j =0
j . j!
k 0 1 2 3 4 k 0 1 2 3 k 0 1 2 3 4 k 0 1 2 3 4 5 6 k 0 1 2
0.001 0.9990 0050 0.9999 9950 1.0000 0000
0.005 0.9950 0.9999 0.9999 1.0000 1248 8754 9998 0000
0.010 0.9900 0.9999 0.9999 1.0000 4983 5033 9983 0000
0.015 0.9851 0.9998 0.9999 1.0000 1194 8862 9945 0000
0.020 0.9801 9867 0.9998 0264 0.9999 9868 0.9999 9999 1.0000 0000 0.050 0.951 0.998 0.999 1.000 229 791 980 000
0.025 0.9753 099 0.9996 927 0.9999 974 1.0000 000 1.0000 000 0.055 0.946 0.998 0.999 1.000 485 542 973 000
0.030 0.970 0.999 0.999 1.000 446 559 996 000 0.035 0.965 0.999 0.999 1.000 605 402 993 000 0.040 0.960 0.999 0.999 1.000 789 221 990 000 0.045 0.955 0.999 0.999 1.000 997 017 985 000
0.060 0.941 0.998 0.999 0.999 1.000 765 270 966 999 000 0.065 0.937 0.997 0.999 0.999 1.000 067 977 956 999 000 0.070 0.932 0.997 0.999 0.999 1.000 394 661 946 999 000 0.075 0.927 0.997 0.999 0.999 1.000 743 324 934 999 000 0.080 0.923 0.996 0.999 0.999 1.000 116 966 920 998 000 0.085 0.918 0.996 0.999 0.999 1.000 512 586 904 998 000
0.090 0.913 0.996 0.999 0.999 1.000 931 185 886 997 000 0.095 0.909 0.995 0.999 0.999 1.000 373 763 867 997 000 0.100 0.904 0.995 0.999 0.999 1.000 837 321 845 996 000 0.200 0.818 731 0.982 477 0.998 852 0.999 943 0.999 998 1.000 000 0.300 0.740 818 0.963 064 0.996 401 0.999 734 0.999 984 0.999 999 1.000 000 0.900 0.406 329 0.772 482 0.937 143 0.400 0.670 320 0.938 448 0.992 074 0.999 224 0.999 939 0.999 996 1.000 000 1.000 0.367 879 0.735 759 0.919 699
0.500 0.606 531 0.909 796 0.985 612 0.600 0.548 812 0.878 099 0.976 885 0.700 0.496 585 0.844 195 0.965 858 0.800 0.449 329 0.808 792 0.952 577
Tables
521
Table 2
(continued )
k 3 4 5 6 7 8 9 k 0 1 2 3 4 5 6 7 8 9 10 11 12 13 k 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 0.500 0.998 0.999 0.999 0.999 1.000 248 828 986 999 000 0.600 0.996 0.999 0.999 0.999 1.000 642 606 961 997 000 0.700 0.994 0.999 0.999 0.999 0.999 1.000 247 214 910 991 999 000 0.800 0.990 0.998 0.999 0.999 0.999 1.000 920 589 816 979 998 000 0.900 0.986 0.997 0.999 0.999 0.999 1.000 541 656 657 957 995 000 1.000 0.981 0.996 0.999 0.999 0.999 0.999 1.000 012 340 406 917 990 999 000
1.20 0.3012 0.6626 0.8795 0.9662 0.9923 0.9985 0.9997 1.0000
1.40 0.2466 0.5918 0.8335 0.9463 0.9857 0.9968 0.9994 0.9999 1.0000
1.60 0.2019 0.5249 0.7834 0.9212 0.9763 0.9940 0.9987 0.9997 1.0000
1.80
0.1653 0.4628 0.7306 0.8913 0.9636 0.9896 0.9974 0.9994 0.9999 1.0000
2.00 0.1353 0.4060 0.6767 0.8571 0.9473 0.9834 0.9955 0.9989 0.9998 1.0000
2.50 0.0821 0.2873 0.5438 0.7576 0.8912 0.9580 0.9858 0.9958 0.9989 0.9997 0.9999 1.0000
3.00 0.0498 0.1991 0.4232 0.6472 0.8153 0.9161 0.9665 0.9881 0.9962 0.9989 0.9997 0.9999 1.0000
3.50 0.0302 0.1359 0.3208 0.5366 0.7254 0.8576 0.9347 0.9733 0.9901 0.9967 0.9990 0.9997 0.9999 1.0000 10.00 0.0000 0.0005 0.0028 0.0103 0.0293 0.0671 0.1301 0.2202 0.3328 0.4579 0.5830 0.6968 0.7916 0.8645 0.9165
4.00 0.0183 0.0916 0.2381 0.4335 0.6288 0.7851 0.8893 0.9489 0.9786 0.9919 0.9972 0.9991 0.9997 0.9999 1.0000
4.50 0.0111 0.0611 0.1736 0.3423 0.5321 0.7029 0.8311 0.9134 0.9597 0.9829 0.9933 0.9976 0.9992 0.9997 0.9999
5.00 0.0067 0.0404 0.1247 0.2650 0.4405 0.6160 0.7622 0.8666 0.9319 0.9682 0.9863 0.9945 0.9980 0.9993 0.9998
6.00
0.0025 0.0174 0.0620 0.1512 0.2851 0.4457 0.6063 0.7440 0.8472 0.9161 0.9574 0.9799 0.9912 0.9964 0.9986
7.00 0.0009 0.0073 0.0296 0.0818 0.1730 0.3007 0.4497 0.5987 0.7291 0.8305 0.9015 0.9467 0.9730 0.9872 0.9943
8.00 0.0003 0.0030 0.0138 0.0424 0.0996 0.1912 0.3134 0.4530 0.5925 0.7166 0.8159 0.8881 0.9362 0.9658 0.9827
9.00 0.0001 0.0012 0.0062 0.0212 0.0550 0.1157 0.2068 0.3239 0.4577 0.5874 0.7060 0.8030 0.8758 0.9261 0.9585
522
Appendix III Tables
Table 2
(continued )
k 15 16 17 18 19 20 21 22 23 24
4.00
4.50 1.0000
5.00 0.9999 1.0000
6.00
0.9995 0.9998 0.9999 1.0000
7.00 0.9976 0.9990 0.9996 0.9999 1.0000
8.00 0.9918 0.9963 0.9984 0.9993 0.9997 0.9999 1.0000
9.00 0.9780 0.9889 0.9947 0.9976 0.9989 0.9996 0.9998 0.9999 1.0000
10.00 0.9513 0.9730 0.9857 0.9928 0.9965 0.9984 0.9993 0.9997 0.9999 1.0000
Tables
523
Table 3 The Normal Distribution The tabulated quantity is
( x ) =
1 2
e t 2 dt.
[
x 0.00 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.10 0.11 0.12 0.13 0.14 0.15 0.16 0.17 0.18 0.19 0.20 0.21 0.22 0.23 0.24 0.25 0.26 0.27 0.28 0.29 0.30 0.31 0.32 0.33 0.34 (x) 0.500000 0.503989 0.507978 0.511966 0.515953 0.519939 0.523922 0.527903 0.531881 0.535856 0.539828 0.543795 0.547758 0.551717 0.555670 0.559618 0.563559 0.567495 0.571424 0.575345 0.579260 0.583166 0.587064 0.590954 0.594835 0.598706 0.602568 0.606420 0.610261 0.614092 0.617911 0.621720 0.625516 0.629300 0.633072 x 0.35 0.36 0.37 0.38 0.39 0.40 0.41 0.42 0.43 0.44 0.45 0.46 0.47 0.48 0.49 0.50 0.51 0.52 0.53 0.54 0.55 0.56 0.57 0.58 0.59 0.60 0.61 0.62 0.63 0.64 0.65 0.66 0.67 0.68 0.69
( x ) = 1 ( x ) .
(x) 0.636831 0.640576 0.644309 0.648027 0.651732 0.655422 0.659097 0.662757 0.666402 0.670031 0.673645 0.677242 0.680822 0.684386 0.687933 0.691462 0.694974 0.698468 0.701944 0.705401 0.708840 0.712260 0.715661 0.719043 0.722405 0.725747 0.279069 0.732371 0.735653 0.738914 0.742154 0.745373 0.748571 0.751748 0.754903
x 0.70 0.71 0.72 0.73 0.74 0.75 0.76 0.77 0.78 0.79 0.80 0.81 0.82 0.83 0.84 0.85 0.86 0.87 0.88 0.89 0.90 0.91 0.92 0.93 0.94 0.95 0.96 0.97 0.98 0.99 1.00 1.01 1.02 1.03 1.04
(x) 0.758036 0.761148 0.764238 0.767305 0.770350 0.773373 0.776373 0.779350 0.782305 0.785236 0.788145 0.791030 0.793892 0.796731 0.799546 0.802337 0.805105 0.807850 0.810570 0.813267 0.815940 0.818589 0.821214 0.823814 0.826391 0.828944 0.831472 0.833977 0.836457 0.838913 0.841345 0.843752 0.846136 0.848495 0.850830
x 1.05 1.06 1.07 1.08 1.09 1.10 1.11 1.12 1.13 1.14 1.15 1.16 1.17 1.18 1.19 1.20 1.21 1.22 1.23 1.24 1.25 1.26 1.27 1.28 1.29 1.30 1.31 1.32 1.33 1.34 1.35 1.36 1.37 1.38 1.39
(x) 0.853141 0.855428 0.857690 0.859929 0.862143 0.864334 0.866500 0.868643 0.870762 0.872857 0.874928 0.876976 0.879000 0.881000 0.882977 0.884930 0.886861 0.888768 0.890651 0.892512 0.894350 0.896165 0.897958 0.899727 0.901475 0.903200 0.904902 0.906582 0.908241 0.909877 0.911492 0.913085 0.914657 0.916207 0.917736
524
Appendix III Tables
Table 3 x 1.40 1.41 1.42 1.43 1.44 1.45 1.46 1.47 1.48 1.49 1.50 1.51 1.52 1.53 1.54 1.55 1.56 1.57 1.58 1.59 1.60 1.61 1.62 1.63 1.64 1.65 1.66 1.67 1.68 1.69 1.70 1.71 1.72 1.73 1.74 1.75 1.76 1.77 1.78 1.79 1.80 1.81 1.82 1.83 1.84
(continued )
(x) 0.919243 0.920730 0.922196 0.923641 0.925066 0.926471 0.927855 0.929219 0.930563 0.931888 0.933193 0.934478 0.935745 0.936992 0.938220 0.939429 0.940620 0.941792 0.942947 0.944083 0.945201 0.946301 0.947384 0.948449 0.949497 0.950529 0.951543 0.952540 0.953521 0.954486 0.955435 0.956367 0.957284 0.958185 0.959070 0.959941 0.960796 0.961636 0.962462 0.963273 0.964070 0.964852 0.965620 0.966375 0.967116
x 1.85 1.86 1.87 1.88 1.89 1.90 1.91 1.92 1.93 1.94 1.95 1.96 1.97 1.98 1.99 2.00 2.01 2.02 2.03 2.04 2.05 2.06 2.07 2.08 2.09 2.10 2.11 2.12 2.13 2.14 2.15 2.16 2.17 2.18 2.19 2.20 2.21 2.22 2.23 2.24 2.25 2.26 2.27 2.28 2.29
(x) 0.967843 0.968557 0.969258 0.969946 0.970621 0.971283 0.971933 0.972571 0.973197 0.973810 0.974412 0.975002 0.975581 0.976148 0.976705 0.977250 0.977784 0.978308 0.978822 0.979325 0.979818 0.980301 0.980774 0.981237 0.981691 0.982136 0.982571 0.982997 0.983414 0.983823 0.984222 0.984614 0.984997 0.985371 0.985738 0.986097 0.986447 0.986791 0.987126 0.987455 0.987776 0.988089 0.988396 0.988696 0.988989
x 2.30 2.31 2.32 2.33 2.34 2.35 2.36 2.37 2.38 2.39 2.40 2.41 2.42 2.43 2.44 2.45 2.46 2.47 2.48 2.49 2.50 2.51 2.52 2.53 2.54 2.55 2.56 2.57 2.58 2.59 2.60 2.61 2.62 2.63 2.64 2.65 2.66 2.67 2.68 2.69 2.70 2.71 2.72 2.73 2.74
(x) 0.989276 0.989556 0.989830 0.990097 0.990358 0.990613 0.990863 0.991106 0.991344 0.991576 0.991802 0.992024 0.992240 0.992451 0.992656 0.992857 0.993053 0.993244 0.993431 0.993613 0.993790 0.993963 0.994132 0.994297 0.994457 0.994614 0.994766 0.994915 0.995060 0.995201 0.995339 0.995473 0.995604 0.995731 0.995855 0.995975 0.996093 0.996207 0.996319 0.996427 0.996533 0.996636 0.996736 0.996833 0.996928
x 2.75 2.76 2.77 2.78 2.79 2.80 2.81 2.82 2.83 2.84 2.85 2.86 2.87 2.88 2.89 2.90 2.91 2.92 2.93 2.54 2.95 2.96 2.97 2.98 2.99 3.00 3.01 3.02 3.03 3.04 3.05 3.06 3.07 3.08 3.09 3.10 3.11 3.12 3.13 3.14 3.15 3.16 3.17 3.18 3.19
(x) 0.997020 0.997110 0.997197 0.997282 0.997365 0.997445 0.997523 0.997599 0.997673 0.997744 0.997814 0.997882 0.997948 0.998012 0.998074 0.998134 0.998193 0.998250 0.998305 0.998359 0.998411 0.998462 0.998511 0.998559 0.998605 0.998650 0.998694 0.998736 0.998777 0.998817 0.998856 0.998893 0.998930 0.998965 0.998999 0.999032 0.999065 0.999096 0.999126 0.999155 0.999184 0.999211 0.999238 0.999264 0.999289
Tables
525
Table 3 x 3.20 3.21 3.22 3.23 3.24 3.25 3.26 3.27 3.28 3.29 3.30 3.31 3.32 3.33 3.34 3.35 3.36 3.37 3.38 3.39
(continued )
(x) 0.999313 0.999336 0.999359 0.999381 0.999402 0.999423 0.999443 0.999462 0.999481 0.999499 0.999517 0.999534 0.999550 0.999566 0.999581 0.999596 0.999610 0.999624 0.999638 0.999651
x 3.40 3.41 3.42 3.43 3.44 3.45 3.46 3.47 3.48 3.49 3.50 3.51 3.52 3.53 3.53 3.55 3.56 3.57 3.58 3.59
(x) 0.999663 0.999675 0.999687 0.999698 0.999709 0.999720 0.999730 0.999740 0.999749 0.999758 0.999767 0.999776 0.999784 0.999792 0.999800 0.999807 0.999815 0.999822 0.999828 0.999835
x 3.60 3.61 3.62 3.63 3.64 3.65 3.66 3.67 3.68 3.69 3.70 3.71 3.72 3.73 3.74 3.75 3.76 3.77 3.78 3.79
(x) 0.999841 0.999847 0.999853 0.999858 0.999864 0.999869 0.999874 0.999879 0.999883 0.999888 0.999892 0.999896 0.999900 0.999904 0.999908 0.999912 0.999915 0.999918 0.999922 0.999925
x 3.80 3.81 3.82 3.83 3.84 3.85 3.86 3.87 3.88 3.89 3.90 3.91 3.92 3.93 3.94 3.95 3.96 3.97 3.98 3.99
(x) 0.999928 0.999931 0.999933 0.999936 0.999938 0.999941 0.999943 0.999946 0.999948 0.999950 0.999952 0.999954 0.999956 0.999958 0.999959 0.999961 0.999963 0.999964 0.999966 0.999967
526
Appendix III Tables
Table 4 Critical Values for Students t-Distribution Let tr be a random variable having the Students t-distribution with r degrees of freedom. Then the tabulated quantities are the numbers x for which
P tr x = .
r 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 0.75 1.0000 0.8165 0.7649 0.7407 0.7267 0.7176 0.7111 0.7064 0.7027 0.6998 0.6974 0.6955 0.6938 0.6924 0.6912 0.6901 0.6892 0.6884 0.6876 0.6870 0.6864 0.6858 0.6853 0.6848 0.6844 0.6840 0.6837 0.6834 0.6830 0.6828 0.6825 0.6822 0.6820 0.6818 0.6816 0.6814 0.6812 0.6810 0.90 3.0777 1.8856 1.6377 1.5332 1.4759 1.4398 1.4149 1.3968 1.3830 1.3722 1.3634 1.3562 1.3502 1.3450 1.3406 1.3368 1.3334 1.3304 1.3277 1.3253 1.3232 1.3212 1.3195 1.3178 1.3163 1.3150 1.3137 1.3125 1.3114 1.3104 1.3095 1.3086 1.3077 1.3070 1.3062 1.3055 1.3049 1.3042 0.95 6.3138 2.9200 2.3534 2.1318 2.0150 1.9432 1.8946 1.8595 1.8331 1.8125 1.7959 1.7823 1.7709 1.7613 1.7531 1.7459 1.7396 1.7341 1.7291 1.7247 1.7207 1.7171 1.7139 1.7109 1.7081 1.7056 1.7033 1.7011 1.6991 1.6973 1.6955 1.6939 1.6924 1.6909 1.6896 1.6883 1.6871 1.6860 0.975 12.7062 4.3027 3.1824 2.7764 2.5706 2.4469 2.3646 3.3060 2.2622 2.2281 2.2010 2.1788 1.1604 2.1448 2.1315 2.1199 2.1098 2.1009 2.0930 2.0860 2.0796 2.0739 2.0687 2.0639 2.0595 2.0555 2.0518 2.0484 2.0452 2.0423 2.0395 2.0369 2.0345 2.0322 2.0301 2.0281 2.0262 2.0244 0.99 31.8207 6.9646 4.5407 3.7649 3.3649 3.1427 2.9980 2.8965 2.8214 2.7638 2.7181 2.6810 2.6503 2.6245 2.6025 2.5835 2.5669 2.5524 2.5395 2.5280 2.5177 2.5083 2.4999 2.4922 2.4851 2.4786 2.4727 2.4671 2.4620 2.4573 2.4528 2.4487 2.4448 2.4411 2.4377 2.4345 2.4314 2.4286 0.995 63.6574 9.9248 5.8409 4.6041 4.0322 3.7074 3.4995 3.3554 3.2498 3.1693 3.1058 3.0545 3.0123 2.9768 2.9467 2.9208 2.8982 2.8784 2.8609 2.8453 2.8314 2.8188 2.8073 2.7969 2.7874 2.7787 2.7707 2.7633 2.7564 2.7500 2.7440 2.7385 2.7333 2.7284 2.7238 2.7195 1.7154 2.7116
Tables
527
Table 4
(continued )
r 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 0.75 0.6808 0.6807 0.6805 0.6804 0.6802 0.6801 0.6800 0.6799 0.6797 0.6796 0.6795 0.6794 0.6793 0.6792 0.6791 0.6791 0.6790 0.6789 0.6788 0.6787 0.6787 0.6786 0.6785 0.6785 0.6784 0.6783 0.6783 0.6782 0.6782 0.6781 0.6781 0.6780 0.6780 0.6779 0.6779 0.6778 0.6778 0.6777 0.6777 0.6776 0.6776 0.6776 0.6775 0.90 1.3036 1.3031 1.3025 1.3020 1.3016 1.3011 1.3006 1.3002 1.2998 1.2994 1.2991 1.2987 1.2984 1.2980 1.2977 1.2974 1.2971 1.2969 1.2966 1.2963 1.2961 1.2958 1.2956 1.2954 1.2951 1.2949 1.2947 1.2945 1.2943 1.2941 1.2939 1.2938 1.2936 1.2934 1.2933 1.2931 1.2929 1.2928 1.2926 1.2925 1.2924 1.2922 1.2921 0.95 1.6849 1.6839 1.6829 1.6820 1.6811 1.6802 1.6794 1.6787 1.6779 1.6772 1.6766 1.6759 1.6753 1.6747 1.6741 1.6736 1.6730 1.6725 1.6720 1.6716 1.6711 1.6706 1.6702 1.6698 1.6694 1.6690 1.6686 1.6683 1.6679 1.6676 1.6672 1.6669 1.6666 1.6663 1.6660 1.6657 1.6654 1.6652 1.6649 1.6646 1.6644 1.6641 1.6639 0.975 2.0227 2.0211 2.0195 2.0181 2.0167 2.0154 2.0141 2.0129 2.0117 2.0106 2.0096 2.0086 2.0076 2.0066 2.0057 2.0049 2.0040 2.0032 2.0025 2.0017 2.0010 2.0003 1.9996 1.9990 1.9983 1.9977 1.9971 1.9966 1.9960 1.9955 1.9949 1.9944 1.9939 1.9935 1.9930 1.9925 1.9921 1.9917 1.9913 1.9908 1.9905 1.9901 1.9897 0.99 2.4258 2.4233 2.4208 2.4185 2.4163 2.4141 2.4121 2.4102 2.4083 2.4066 2.4069 2.4033 2.4017 2.4002 2.3988 2.3974 2.3961 2.3948 2.3936 2.3924 2.3912 2.3901 2.3890 2.3880 2.3870 2.3860 2.3851 2.3842 2.3833 2.3824 2.3816 2.3808 2.3800 2.3793 2.3785 2.3778 2.3771 2.3764 2.3758 2.3751 2.3745 2.3739 2.3733 0.995 2.7079 2.7045 2.7012 2.6981 2.6951 2.6923 2.6896 2.6870 2.6846 2.6822 2.6800 2.6778 2.6757 2.6737 2.6718 2.6700 2.6682 2.6665 2.6649 2.6633 2.6618 2.6603 2.6589 2.6575 2.6561 2.6549 2.6536 2.6524 2.6512 2.6501 2.6490 2.6479 2.6469 2.6459 2.6449 2.6439 2.6430 2.6421 2.6412 2.6403 2.6395 2.6387 2.6379
528
Appendix III Tables
Table 4
(continued )
r 82 83 84 85 86 87 88 89 90 0.75 0.6775 0.6775 0.6774 0.6774 0.6774 0.6773 0.6773 0.6773 0.6772 0.90 1.2920 1.2918 1.2917 1.2916 1.2915 1.2914 1.2912 1.2911 1.2910 0.95 1.6636 1.6634 1.6632 1.6630 1.6628 1.6626 1.6624 1.6622 1.6620 0.975 1.9893 1.9890 1.9886 1.9883 1.9879 1.9876 1.9873 1.9870 1.9867 0.99 2.3727 2.3721 2.3716 2.3710 2.3705 2.3700 2.3695 2.3690 2.3685 0.995 2.6371 2.6364 2.6356 2.6349 2.6342 2.6335 2.6329 2.6322 2.6316
Tables
529
Table 5 Critical Values for the Chi-Square Distribution Let 2 r be a random variable having the chi-square distribution with r degrees of freedom. Then the tabulated quantities are the numbers x for which
P r2 x = .
r 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38
0.005 0.010 0.072 0.207 0.412 0.676 0.989 1.344 1.735 2.156 2.603 3.074 3.565 4.075 4.601 5.142 5.697 6.265 6.844 7.434 8.034 8.643 9.260 9.886 10.520 11.160 11.808 12.461 13.121 13.787 14.458 15.134 15.815 16.501 17.192 17.887 18.586 19.289
0.01 0.020 0.115 0.297 0.554 0.872 1.239 1.646 2.088 2.558 3.053 3.571 4.107 4.660 5.229 5.812 6.408 7.015 7.633 8.260 8.897 9.542 10.196 10.856 11.524 12.198 12.879 13.565 14.257 14.954 15.655 16.362 17.074 17.789 18.509 19.233 19.960 20.691
0.025
0.001 0.051 0.216 0.484 0.831 1.237 1.690 2.180 2.700 3.247 3.816 4.404 5.009 5.629 6.262 6.908 7.564 8.231 8.907 9.591 10.283 10.982 11.689 12.401 13.120 13.844 14.573 15.308 16.047 16.791 17.539 18.291 19.047 19.806 20.569 21.336 22.106 22.878
0.05 0.004 0.103 0.352 0.711 1.145 1.635 2.167 2.733 2.325 3.940 4.575 5.226 5.892 6.571 7.261 7.962 8.672 8.390 10.117 10.851 11.591 12.338 13.091 13.848 14.611 13.379 16.151 16.928 17.708 18.493 19.281 20.072 20.867 21.664 22.465 23.269 24.075 24.884
0.10 0.016 0.211 0.584 1.064 1.610 2.204 2.833 3.490 4.168 4.865 5.578 6.304 7.042 7.790 8.547 9.312 10.085 10.865 11.651 12.443 13.240 14.042 14.848 15.659 16.473 17.292 18.114 18.939 19.768 20.599 21.434 22.271 23.110 23.952 24.797 25.643 26.492 27.343
0.25 0.102 0.575 1.213 1.923 2.675 3.455 4.255 5.071 5.899 6.737 7.584 9.438 9.299 10.165 11.037 11.912 12.792 13.675 14.562 15.452 16.344 17.240 18.137 19.037 19.939 20.843 21.749 22.657 23.567 24.478 25.390 26.304 27.219 28.136 29.054 29.973 30.893 31.815
530
Appendix III Tables
Table 5
(continued )
r 39 40 41 42 43 44 45
0.005 19.996 20.707 21.421 22.138 22.859 23.584 24.311
0.01 21.426 22.164 22.906 23.650 24.398 25.148 25.901
0.025
23.654 24.433 25.215 25.999 26.785 27.575 28.366
0.05 25.695 26.509 27.326 28.144 28.965 29.787 30.612
0.10 28.196 29.051 29.907 30.765 31.625 32.487 33.350
0.25 32.737 33.660 34.585 35.510 36.436 37.363 38.291
r 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 0.75 1.323 2.773 4.108 5.385 6.626 7.841 9.037 10.219 11.389 12.549 13.701 14.845 15.984 17.117 18.245 19.369 20.489 21.605 22.718 23.828 24.935 26.039 27.141 28.241 29.339 30.435 31.528 32.620 33.711 34.800 35.887 36.973 0.90 2.706 4.605 6.251 7.779 9.236 10.645 12.017 13.362 14.684 15.987 17.275 18.549 19.812 21.064 22.307 23.542 24.769 25.989 27.204 28.412 29.615 30.813 32.007 33.196 34.382 35.563 36.741 37.916 39.087 40.256 41.422 42.585 0.95 3.841 5.991 7.815 9.488 11.071 12.592 14.067 15.507 16.919 18.307 19.675 21.026 23.362 23.685 24.996 26.296 27.587 28.869 30.144 31.410 32.671 33.924 35.172 36.415 37.652 38.885 40.113 41.337 42.557 43.773 44.985 46.194 0.975 5.024 7.378 9.348 11.143 12.833 14.449 16.013 17.535 19.023 20.483 21.920 23.337 24.736 26.119 27.488 28.845 30.191 31.526 32.852 34.170 35.479 36.781 38.076 39.364 40.646 41.923 43.194 44.641 45.722 46.979 48.232 49.480 0.99 6.635 9.210 11.345 13.277 15.086 16.812 18.475 20.090 21.666 23.209 24.725 26.217 27.688 29.141 30.578 32.000 33.409 34.805 36.191 37.566 38.932 40.289 41.638 42.980 44.314 45.642 46.963 48.278 49.588 50.892 51.191 53.486 0.995 7.879 10.597 12.838 14.860 16.750 18.548 20.278 21.955 23.589 25.188 26.757 28.299 29.819 31.319 32.801 34.267 35.718 37.156 38.582 39.997 41.401 42.796 44.181 45.559 46.928 48.290 49.645 50.993 52.336 53.672 55.003 56.328
Tables
531
Table 5
(continued )
r 33 34 35 36 37 38 39 40 41 42 43 44 45 0.75 38.058 39.141 40.223 41.304 42.383 43.462 44.539 45.616 46.692 47.766 48.840 49.913 50.985 0.90 43.745 44.903 46.059 47.212 48.363 49.513 50.660 51.805 52.949 54.090 55.230 56.369 57.505 0.95 47.400 48.602 49.802 50.998 52.192 53.384 54.572 55.758 56.942 58.124 59.304 60.481 61.656 0.975 50.725 51.966 53.203 54.437 55.668 56.896 58.120 59.342 60.561 61.777 62.990 64.201 65.410 0.99 54.776 56.061 57.342 58.619 59.892 61.162 62.428 63.691 64.950 66.206 67.459 68.710 69.957 0.995 57.648 58.964 60.275 61.581 62.883 64.181 65.476 66.766 68.053 69.336 70.616 71.893 73.166
532
Appendix III Tables Table 6

1 2
Critical Values for the F-Distribution
Let Fr ,r be a random variable having the F-distribution with r1, r2 degrees of freedom. Then the tabulated quantities are the numbers x for which
P Fr ,r x = .
1 2
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
r1 1 1.0000 5.8285 39.864 161.45 647.79 4052.2 16211 0.66667 2.5714 8.5623 18.513 38.506 98.503 198.50 0.58506 2.0239 5.5383 10.128 17.443 34.116 55.552 0.54863 1.8074 4.5448 7.7086 12.218 21.198 31.333 0.52807 1.6925 4.0604 6.6079 10.007 16.258 22.785 0.51489 1.6214 3.7760 5.9874 8.8131 13.745 18.635 2 1.5000 7.5000 49.500 199.50 799.50 4999.5 20000 1.0000 3.0000 9.0000 19.000 39.000 99.000 199.00 0.88110 2.2798 5.4624 9.5521 16.044 30.817 49.799 0.82843 2.0000 4.3246 6.9443 10.649 18.000 26.284 0.79877 1.8528 3.7797 5.7861 8.4336 13.274 18.314 0.77976 1.7622 3.4633 5.1433 7.2598 10.925 14.544 3 1.7092 8.1999 53.593 215.71 864.16 5403.3 21615 1.1349 3.1534 9.1618 19.164 39.165 99.166 199.17 1.0000 2.3555 5.3908 9.2766 15.439 29.457 47.467 0.94054 2.0467 4.1908 6.5914 9.9792 16.694 24.259 0.90715 1.8843 3.6195 5.4095 7.7636 12.060 16.530 0.88578 1.7844 3.2888 4.7571 6.5988 9.7795 12.917 4 1.8227 8.5810 55.833 224.58 899.58 5624.6 22500 1.2071 3.2320 9.2434 19.247 39.248 99.249 199.25 1.0632 2.3901 5.3427 9.1172 15.101 28.710 46.195 1.0000 2.0642 4.1073 6.3883 9.6045 15.977 23.155 0.96456 1.8927 3.5202 5.1922 7.3879 11.392 15.556 0.94191 1.7872 3.1808 4.5337 6.2272 9.1483 12.028 5 1.8937 8.8198 57.241 230.16 921.85 5763.7 23056 1.2519 3.2799 9.2926 19.296 39.298 99.299 199.30 1.1024 2.4095 5.3092 9.0135 14.885 28.237 45.392 1.0367 2.0723 4.0506 6.2560 9.3645 15.522 22.456 1.0000 1.8947 3.4530 5.0503 7.1464 10.967 14.940 0.97654 1.7852 3.1075 4.3874 5.9876 8.7459 11.464 6 1.9422 8.9833 58.204 233.99 937.11 5859.0 23437 1.2824 3.3121 9.3255 19.330 39.331 99.332 199.33 1.1289 2.4218 5.2847 8.9406 14.735 27.911 44.838 1.0617 2.0766 4.0098 6.1631 9.1973 15.207 21.975 1.0240 1.8945 3.4045 4.9503 6.9777 10.672 14.513 1.0000 1.7821 3.0546 4.2839 5.8197 8.4661 11.073
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
r2
r2
Tables
533
Table 6
(continued )
r1
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
7 1.9774 9.1021 58.906 236.77 948.22 5928.3 23715 1.3045 3.3352 9.3491 19.353 39.355 99.356 199.36 1.1482 2.4302 5.2662 8.8868 14.624 27.672 44.434 1.0797 2.0790 3.9790 6.0942 9.0741 14.976 21.622 1.0414 1.8935 3.3679 4.8759 6.8531 10.456 14.200 1.0169 1.7789 3.0145 4.2066 5.6955 8.2600 10.786
8 2.0041 9.1922 59.439 238.88 956.66 5981.1 23925 1.3213 3.3526 9.3668 19.371 39.373 99.374 199.37 1.1627 2.4364 5.2517 8.8452 14.540 27.489 44.126 1.0933 2.0805 3.9549 6.0410 8.9796 14.799 21.352 1.0545 1.8923 3.3393 4.8183 6.7572 10.289 13.961 1.0298 1.7760 2.9830 4.1468 5.5996 8.1016 10.566
9 2.0250 9.2631 59.858 240.54 963.28 6022.5 24091 1.3344 3.3661 9.3805 19.385 39.387 99.388 199.39 1.1741 2.4410 5.2400 8.8123 14.473 27.345 43.882 1.1040 2.0814 3.9357 5.9988 8.9047 14.659 21.139 1.0648 1.8911 3.3163 4.7725 6.6810 10.158 13.772 1.0398 1.7733 2.9577 4.0990 5.5234 7.9761 10.391
10 2.0419 9.3202 60.195 241.88 968.63 6055.8 24224 1.3450 3.3770 9.3916 19.396 39.398 99.399 199.40 1.1833 2.4447 5.2304 8.7855 14.419 27.229 43.686 1.1126 2.0820 3.9199 5.9644 8.8439 14.546 20.967 1.0730 1.8899 3.2974 4.7351 6.6192 10.051 13.618 1.0478 1.7708 2.9369 4.0600 5.4613 7.8741 10.250
11 2.0558 9.3672 60.473 242.99 973.04 6083.3 24334 1.3537 3.3859 9.4006 19.405 39.407 99.408 199.41 1.1909 2.4476 5.2223 8.7632 14.374 27.132 43.523 1.1196 2.0823 3.9066 5.9357 8.7933 14.452 20.824 1.0798 1.8887 3.2815 4.7038 6.5676 9.9623 13.490 1.0545 1.7686 2.9193 4.0272 5.4094 7.7891 10.132
12 2.0674 9.4064 60.705 243.91 976.71 6106.3 24426 1.3610 3.3934 9.4081 19.413 39.415 99.416 199.42 1.1972 2.4500 5.2156 8.7446 14.337 27.052 43.387 1.1255 2.0826 3.8955 5.9117 8.7512 14.374 20.705 1.0855 1.8877 3.2682 4.6777 6.5246 9.8883 13.384 1.0600 1.7668 2.9047 3.9999 5.3662 7.7183 10.034
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
r2
r2
534
Appendix III Tables
Table 6
(continued )
r1
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
13 2.0773 9.4399 60.903 244.69 979.85 6125.9 24504 1.3672 3.3997 9.4145 19.419 39.421 99.422 199.42 1.2025 2.4520 5.2097 8.7286 14.305 26.983 43.271 1.1305 2.0827 3.8853 5.8910 8.7148 14.306 20.602 1.0903 1.8867 3.2566 4.6550 6.4873 9.8244 13.292 1.0647 1.7650 2.8918 3.9761 5.3287 7.6570 9.9494
14 2.0858 9.4685 61.073 245.37 982.54 6142.7 24572 1.3725 3.4051 9.4200 19.424 39.426 99.427 199.43 1.2071 2.4537 5.2047 8.7148 14.277 26.923 43.171 1.1349 2.0828 3.8765 5.8732 8.6836 14.248 20.514 1.0944 1.8858 3.2466 4.6356 6.4554 9.7697 13.214 1.0687 1.7634 2.8808 3.9558 5.2966 7.6045 9.8769
15 2.0931 9.4934 61.220 245.95 984.87 6157.3 24630 1.3771 3.4098 9.4247 19.429 39.431 99.432 199.43 1.2111 2.4552 5.2003 8.7029 14.253 26.872 43.085 1.1386 2.0829 3.8689 5.8578 8.6565 14.198 20.438 1.0980 1.8851 3.2380 4.6188 6.4277 9.7222 13.146 1.0722 1.7621 2.8712 3.9381 5.2687 7.5590 9.8140
18 2.1104 9.5520 61.567 247.32 990.36 6191.6 24767 1.3879 3.4208 9.4358 19.440 39.442 99.443 199.44 1.2205 2.4585 5.1898 8.6744 14.196 26.751 42.880 1.1473 2.0828 3.8525 5.8209 8.5921 14.079 20.257 1.1064 1.8830 3.2171 4.5783 6.3616 9.6092 12.984 1.0804 1.7586 2.8479 3.8955 5.2018 7.4502 9.6639
20 2.1190 9.5813 61.740 248.01 993.10 6208.7 24836 1.3933 3.4263 9.4413 19.446 39.448 99.449 199.45 1.2252 2.4602 5.1845 8.6602 14.167 26.690 42.778 1.1517 2.0828 3.8443 5.8025 8.5599 14.020 20.167 1.1106 1.8820 3.2067 4.5581 6.3285 9.5527 12.903 1.0845 1.7569 2.8363 3.8742 5.1684 7.3958 9.5888
24 2.1321 9.6255 62.002 249.05 997.25 6234.6 24940 1.4014 3.4345 9.4496 19.454 39.456 99.458 199.46 1.2322 2.4626 5.1764 8.6385 14.124 26.598 42.622 1.1583 2.0827 3.8310 5.7744 8.5109 13.929 20.030 1.1170 1.8802 3.1905 4.5272 6.2780 9.4665 12.780 1.0907 1.7540 2.8183 3.8415 5.1172 7.3127 9.4741
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.940 0.975 0.990 0.955 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
r2
r2
Tables
535
Table 6
(continued )
r1
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
30 2.1452 9.6698 62.265 250.09 1001.4 6260.7 25044 1.4096 3.4428 9.4579 19.462 39.465 99.466 199.47 1.2393 2.4650 5.1681 8.6166 14.081 26.505 42.466 1.1649 2.0825 3.8174 5.7459 8.4613 13.838 19.892 1.1234 1.8784 3.1741 4.4957 6.2269 9.3793 12.656 1.0969 1.7510 2.8000 3.8082 5.0652 7.2285 9.3583
40 2.1584 9.7144 62.529 251.14 1005.6 6286.8 25148 1.4178 3.4511 9.4663 19.471 39.473 99.474 199.47 1.2464 2.4674 5.1597 8.5944 14.037 26.411 42.308 1.1716 2.0821 3.8036 5.7170 8.4111 13.745 19.752 1.1297 1.8763 3.1573 4.4638 6.1751 9.2912 12.530 1.1031 1.7477 2.7812 3.7743 5.0125 7.1432 9.2408
48 2.1650 9.7368 62.662 251.67 1007.7 6299.9 25201 1.4220 3.4553 9.4705 19.475 39.477 99.478 199.47 1.2500 2.4686 5.1555 8.5832 14.015 26.364 42.229 1.1749 2.0819 3.7966 5.7024 8.3858 13.699 19.682 1.1329 1.8753 3.1488 4.4476 6.1488 9.2466 12.466 1.1062 1.7460 2.7716 3.7571 4.9857 7.1000 9.1814
60 2.1716 9.7591 62.794 252.20 1009.8 6313.0 25253 1.4261 3.4594 9.4746 19.479 39.481 99.483 199.48 1.2536 2.4697 5.1512 8.5720 13.992 26.316 42.149 1.1782 2.0817 3.7896 5.6878 8.3604 13.652 19.611 1.1361 1.8742 1.1402 4.4314 6.1225 9.2020 12.402 1.1093 1.7443 2.7620 3.7398 4.9589 7.0568 9.1219
120 2.1848 9.8041 63.061 253.25 1014.0 6339.4 25359 1.4344 3.4677 9.4829 19.487 39.490 99.491 199.49 1.2608 2.4720 5.1425 8.5494 13.947 26.221 41.989 1.1849 2.0812 3.7753 5.6581 8.3092 13.558 19.468 1.1426 1.8719 3.1228 4.3984 6.0693 9.1118 12.274 1.1156 1.7407 2.7423 3.7047 4.9045 6.9690 9.0015
2.1981 9.8492 63.328 254.32 1018.3 6366.0 25465 1.4427 3.4761 9.4913 19.496 39.498 99.499 199.51 1.2680 2.4742 5.1337 8.5265 13.902 26.125 41.829 1.1916 2.0806 3.7607 5.6281 8.2573 13.463 19.325 1.1490 1.8694 3.1050 4.3650 6.0153 0.0204 12.144 1.1219 1.7368 2.7222 3.6688 4.9491 6.8801 8.8793
0.500 0.750 0.990 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
r2
r2
536
Appendix III Tables
Table 6
(continued )
r1
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
1 0.50572 1.5732 3.5894 5.5914 8.0727 12.246 16.236 0.49898 1.5384 3.4579 5.3177 7.5709 11.259 14.688 0.49382 1.5121 3.3603 5.1174 7.2093 10.561 13.614 0.48973 1.4915 3.2850 4.9646 6.9367 10.044 12.826 0.48644 1.4749 3.2252 4.8443 6.7241 9.6460 12.226 0.48369 1.4613 3.1765 4.7472 6.5538 9.3302 11.754
2 0.76655 1.7010 3.2574 4.7374 6.5415 9.5466 12.404 0.75683 1.6569 3.1131 4.4590 6.0595 8.6491 11.042 0.74938 1.6236 3.0065 4.2565 5.7147 8.0215 10.107 0.74349 1.5975 2.9245 4.1028 5.4564 7.5594 9.4270 0.73872 1.5767 2.8595 3.9823 5.2559 7.2057 8.9122 0.73477 1.5595 2.8068 3.8853 5.0959 6.9266 8.5096
3 0.87095 1.7169 3.0741 4.3468 5.8898 8.4513 10.882 0.86004 1.6683 2.9238 4.0662 5.4160 7.5910 9.5965 0.85168 1.6315 2.8129 3.8626 5.0781 6.9919 8.7171 0.84508 1.6028 2.7277 3.7083 4.8256 6.5523 8.0807 0.83973 1.5798 2.6602 3.5874 4.6300 6.2167 7.6004 0.83530 1.5609 2.6055 3.4903 4.4742 5.9526 7.2258
4 0.92619 1.7157 2.9605 4.1203 5.5226 7.8467 10.050 0.91464 1.6642 2.8064 3.8378 5.0526 7.0060 8.8051 0.90580 1.6253 2.6927 3.6331 4.7181 6.4221 7.9559 0.89882 1.5949 2.6053 3.4780 4.4683 5.9943 7.3428 0.89316 1.5704 2.5362 3.3567 4.2751 5.6683 6.8809 0.88848 1.5503 2.4801 3.2592 4.1212 5.4119 6.5211
5 0.96026 1.7111 2.8833 3.9715 5.2852 7.4604 9.5221 0.94831 1.6575 2.7265 3.6875 4.8173 6.6318 8.3018 0.93916 1.6170 2.6106 3.4817 4.4844 6.0569 7.4711 0.93193 1.5853 2.5216 3.3258 4.2361 5.6363 6.8723 0.92608 1.5598 2.4512 3.2039 4.0440 5.3160 6.4217 0.92124 1.5389 2.3940 3.1059 3.8911 5.0643 6.0711
6 0.98334 1.7059 2.8274 3.8660 5.1186 7.1914 9.1554 0.97111 1.6508 2.6683 3.5806 4.6517 6.3707 7.9520 0.96175 1.6091 2.5509 3.3738 4.3197 5.8018 7.1338 0.95436 1.5765 2.4606 3.2172 4.0721 5.3858 6.5446 0.94837 1.5502 2.3891 3.0946 3.8807 5.0692 6.1015 0.94342 1.5286 2.3310 2.9961 3.7283 4.8206 5.7570
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
r2
r2
10
10
11
11
12
12
Tables
537
Table 6
(continued )
r1
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
7 1.0000 1.7011 2.7849 3.7870 4.9949 6.9928 8.8854 0.98757 1.6448 2.6241 3.5005 4.5286 6.1776 7.6942 0.97805 1.6022 2.5053 3.2927 4.1971 5.6129 6.8849 0.97054 1.5688 2.4140 3.1355 3.9498 5.2001 6.3025 0.96445 1.5418 2.3416 3.0123 3.7586 4.8861 5.8648 0.95943 1.5197 2.2828 2.9134 3.6065 4.6395 5.5245
8 1.0216 1.6969 2.7516 3.7257 4.8994 6.8401 8.6781 1.0000 1.6396 2.5893 3.4381 4.4332 6.0289 7.4960 0.99037 1.5961 2.4694 3.2296 4.1020 5.4671 6.6933 0.98276 1.5621 2.3772 3.0717 3.8549 5.0567 6.1159 0.97661 1.5346 2.3040 2.9480 3.6638 4.7445 5.6821 0.97152 1.5120 2.2446 2.8486 3.5118 4.4994 5.3451
9 1.0224 1.6931 2.7247 3.6767 4.8232 6.7188 8.5138 1.0097 1.6350 2.5612 3.3881 4.3572 5.9106 7.3386 1.0000 1.5909 2.4403 3.1789 4.0260 5.3511 6.5411 0.99232 1.5563 2.3473 3.0204 3.7790 4.9424 5.9676 0.98610 1.5284 2.2735 2.8962 3.5879 4.6315 5.5368 0.98097 1.5054 2.2135 2.7964 3.4358 4.3875 5.2021
10 1.0304 1.6898 2.7025 3.6365 4.7611 6.6201 8.3803 1.0175 1.6310 2.5380 3.3472 4.2951 5.8143 7.2107 1.0077 1.5863 2.4163 3.1373 3.9639 5.2565 6.4171 1.0000 1.5513 2.3226 2.9782 3.7168 4.8492 5.8467 0.99373 1.5230 2.2482 2.8536 3.5257 4.5393 5.4182 0.98856 1.4996 2.1878 2.7534 3.3736 4.2961 5.0855
11 1.0369 1.6868 2.6837 3.6028 4.7091 6.5377 8.2691 1.0239 1.6274 2.5184 3.3127 4.2431 5.7338 7.1039 1.0141 1.5822 2.3959 3.1022 3.9117 5.1774 6.3136 1.0063 1.5468 2.3016 2.9426 3.6645 4.7710 5.7456 0.99999 1.5181 2.2267 2.8176 3.4733 4.4619 5.3190 0.99480 1.4945 1.1658 2.7170 3.3211 4.2193 4.9878
12 1.0423 1.6843 2.6681 3.5747 4.6658 6.4691 8.1764 1.0293 1.6244 2.5020 3.2840 4.1997 5.6668 7.0149 1.0194 1.5788 2.3789 3.0729 3.8682 5.1114 6.2274 1.0166 1.5430 2.2841 2.9130 3.6209 4.7059 5.6613 1.0052 1.5140 2.2087 2.7876 3.4296 4.3974 5.2363 1.0000 1.4902 1.1474 2.6866 3.2773 4.1553 4.9063
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
r2
r2
10
10
11
11
12
12
538
Appendix III Tables
Table 6
(continued )
r1
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
13 1.0469 1.6819 2.6543 3.5501 4.6281 6.4096 8.0962 1.0339 1.6216 2.4875 3.2588 4.1618 5.6085 6.9377 1.0239 1.5756 2.3638 3.0472 3.8302 5.0540 6.1524 1.0161 1.5395 2.2685 2.8868 3.5827 4.6491 5.5880 1.0097 1.5102 2.1927 2.7611 3.3913 4.3411 5.1642 1.0044 1.4861 2.1311 2.6598 3.2388 4.0993 4.8352
14 1.0509 1.6799 2.6425 3.5291 4.5958 6.3585 8.0274 1.0378 1.6191 2.4750 3.2371 4.1293 5.5584 6.8716 1.0278 1.5729 2.3508 3.0252 3.7976 5.0048 6.0882 1.0199 1.5364 2.2551 2.8644 3.5500 4.6004 5.5252 1.0135 1.5069 2.1790 2.7383 3.3584 4.2928 5.1024 1.0082 1.4826 2.1170 2.6368 3.2058 4.0512 4.7742
15 1.0543 1.6781 2.6322 3.5108 4.5678 6.3143 7.9678 1.0412 1.6170 2.4642 3.2184 4.1012 5.5151 6.8143 1.0311 1.5705 2.3396 3.0061 3.7694 4.9621 6.0325 1.0232 1.5338 2.2435 2.8450 3.5217 4.5582 5.4707 1.0168 1.5041 2.1671 2.7186 3.3299 4.2509 5.0489 1.0115 1.4796 1.1049 2.6169 3.1772 4.0096 4.7214
18 1.0624 1.6735 2.6072 3.4666 4.5004 6.2084 7.8253 1.0491 1.6115 2.4378 3.1730 4.0334 5.4111 6.6769 1.0390 1.5642 2.3121 2.9597 3.7011 4.8594 5.8987 1.0310 1.5269 2.2150 2.7977 3.4530 4.4563 5.3396 1.0245 1.4967 2.1377 2.6705 3.2607 4.1496 4.9198 1.0192 1.4717 2.0748 2.5680 3.1076 3.9088 4.5937
20 1.0664 1.6712 2.5947 3.4445 4.4667 6.1554 7.7540 1.0531 1.6088 2.4246 3.1503 3.9995 5.3591 6.6082 1.0429 1.5611 2.9893 2.9365 3.6669 4.8080 5.8318 1.0349 1.5235 2.2007 2.7740 3.4186 4.4054 5.2740 1.0284 1.4930 2.1230 2.6464 3.2261 4.0990 4.8552 1.0231 1.4678 2.0597 2.5436 3.0728 3.8584 4.5299
24 1.0724 1.6675 2.5753 3.4105 4.4150 6.0743 7.6450 1.0591 1.6043 2.4041 3.1152 3.9472 5.2793 6.5029 1.0489 1.5560 2.2768 2.9005 3.6142 4.7290 5.7292 1.0408 1.5179 2.1784 2.7372 3.3654 4.3269 5.1732 1.0343 1.4869 2.1000 2.6090 3.1725 4.0209 4.7557 1.0289 1.4613 2.0360 2.5055 3.0187 3.7805 4.4315
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
r2
r2
10
10
11
11
12
12
Tables
539
Table 6
(continued )
r1
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
30 1.0785 1.6635 2.5555 3.3758 4.3624 5.9921 7.5345 1.0651 1.5996 2.3830 3.0794 3.8940 5.1981 6.3961 1.0548 1.5506 2.2547 2.8637 3.5604 4.6486 5.6248 1.0467 1.5119 2.1554 2.6996 3.3110 4.2469 5.0705 1.0401 1.4805 2.0762 2.5705 3.1176 3.9411 4.6543 1.0347 1.4544 2.0115 2.4663 2.9633 3.7008 4.3309
40 1.0846 1.6593 2.5351 3.3404 4.3089 5.9084 7.4225 1.0711 1.5945 2.3614 3.0428 3.8398 5.1156 6.2875 1.0608 1.5450 2.2320 2.8259 3.5055 4.5667 5.5186 1.0526 1.5056 1.1317 2.6609 3.2554 4.1653 4.9659 1.0460 1.4737 2.0516 2.5309 3.0613 3.8596 4.5508 1.0405 1.4471 1.9861 2.4259 2.9063 3.6192 4.2282
48 1.0877 1.6571 2.5427 3.3224 4.2817 5.8660 7.3657 1.0741 1.5919 2.3503 3.0241 3.8121 5.0736 6.2324 1.0638 1.5420 2.2203 2.8066 3.4774 4.5249 5.4645 1.0556 1.5023 2.1195 2.6410 3.2269 4.1236 4.9126 1.0490 1.4701 2.0389 2.5105 3.0324 3.8179 4.4979 1.0435 1.4432 1.9729 2.4051 2.8771 3.5774 4.1756
60 1.0908 1.6548 2.5142 3.3043 4.2544 5.8236 7.3088 1.0771 1.5892 2.3391 3.0053 3.7844 5.0316 6.1772 1.0667 1.5389 2.2085 2.7872 3.4493 4.4831 5.4104 1.0585 1.4990 2.1072 2.6211 3.1984 4.0819 4.8592 1.0519 1.4664 2.0261 2.4901 3.0035 3.7761 4.4450 1.0464 1.4393 1.9597 2.3842 2.8478 3.5355 4.1229
120 1.0969 1.6502 2.4928 3.2674 4.1989 5.7372 7.1933 1.0832 1.5836 2.3162 2.9669 3.7279 4.9460 6.0649 1.0727 1.5325 2.1843 2.7475 3.3918 4.3978 5.3001 1.0645 1.4919 2.0818 2.5801 3.1399 3.9965 4.7501 1.0578 1.4587 1.9997 2.4480 2.9441 3.6904 4.3367 1.0523 1.4310 1.9323 2.3410 2.7874 3.4494 4.0149
1.1031 1.6452 2.4708 3.2298 4.1423 5.6495 7.0760 1.0893 1.5777 2.2926 2.9276 3.6702 4.8588 5.9505 1.0788 1.5257 2.1592 2.7067 3.3329 4.3105 5.1875 1.0705 1.4843 2.0554 2.5379 3.0798 3.9090 4.6385 1.0637 1.4504 1.9721 2.4045 2.8828 3.6025 4.2256 1.0582 1.4221 1.9036 2.2962 2.7249 3.3608 3.9039
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
r2
r2
10
10
11
11
12
12
540
Appendix III Tables
Table 6
(continued )
r1
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
1 0.48141 1.4500 3.1362 4.6672 6.4143 9.0738 11.374 0.47944 1.4403 3.1022 4.6001 6.2979 8.8616 11.060 0.47775 1.4321 3.0732 4.5431 6.1995 8.6831 10.798 0.47628 1.4249 3.0481 4.4940 6.1151 8.5310 10.575 0.47499 1.4186 3.0262 4.4513 6.0420 8.3997 10.384 0.47385 1.4130 3.0070 4.4139 5.9781 8.2854 10.218
2 0.73145 1.5452 2.7632 3.8056 4.9653 6.7010 8.1865 0.72862 1.5331 2.7265 3.7389 4.8567 6.5149 7.9216 0.72619 1.5227 2.6952 3.6823 4.7650 6.3589 7.7008 0.72406 1.5137 2.6682 3.6337 4.6867 6.2262 7.5138 0.72219 1.5057 2.6446 3.5915 4.6189 6.1121 7.3536 0.72053 1.4988 2.6239 3.5546 4.5597 6.0129 7.2148
3 0.83159 1.5451 2.5603 3.4105 4.3472 5.7394 6.9257 0.82842 1.5317 2.5222 3.3439 4.2417 5.5639 6.6803 0.82569 1.5202 2.4898 3.2874 4.1528 5.4170 6.4760 0.82330 1.5103 2.4618 3.2389 4.0768 5.2922 6.3034 0.82121 1.5015 2.4374 3.1968 4.0112 5.1850 6.1556 0.81936 1.4938 2.4160 3.1599 3.9539 5.0919 6.0277
4 0.88454 1.5336 2.4337 3.1791 3.9959 5.2053 6.2335 0.88119 1.5194 2.3947 3.1122 3.8919 5.0354 5.9984 0.87830 1.5071 2.3614 3.0556 3.8043 4.8932 5.8029 0.87578 1.4965 2.3327 3.0069 3.7294 4.7726 5.6378 0.87357 1.4873 2.3077 2.9647 3.6648 4.6690 5.4967 0.87161 1.4790 2.2858 2.9277 3.6083 4.5790 5.3746
5 0.91718 1.5214 2.3467 3.0254 3.7667 4.8616 5.7910 0.91371 1.5066 2.3069 2.9582 3.6634 4.6950 5.5623 0.91073 1.4938 2.2730 2.9013 3.5764 4.5556 5.3721 0.90812 1.4827 2.2438 2.8524 3.5021 4.4374 5.2117 0.90584 1.4730 2.2183 2.8100 3.4379 4.3359 5.0746 0.90381 1.4644 2.1958 2.7729 3.3820 4.2479 4.9560
6 0.93926 1.5105 2.2830 2.9153 3.6043 4.6204 5.4819 0.93573 1.4952 2.2426 2.8477 3.5014 4.4558 5.2574 0.93267 1.4820 2.2081 2.7905 3.4147 4.3183 5.0708 0.93001 1.4705 2.1783 2.7413 3.3406 4.2016 4.9134 0.92767 1.4605 2.1524 2.6987 3.2767 4.1015 5.7789 0.92560 1.4516 1.1296 2.6613 3.2209 4.0146 4.6627
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
13
13
14
14
15
15
r2
r2
16
16
17
17
18
18
Tables
541
Table 6
(continued )
r1 7 0.95520 1.5011 2.2341 2.8321 3.4827 4.4410 5.2529 0.95161 1.4854 2.1931 2.7642 3.3799 4.2779 5.0313 0.94850 1.4718 2.1582 2.7066 3.2934 4.1415 4.8473 0.94580 1.4601 2.1280 2.6572 3.2194 4.0259 4.6920 0.94342 1.4497 2.1017 2.6143 3.1556 3.9267 4.5594 0.94132 1.4406 2.0785 2.5767 3.0999 3.8406 4.4448 8 0.96724 1.4931 2.1953 2.7669 3.3880 4.3021 5.0761 0.96360 1.4770 2.1539 2.6987 2.2853 4.1399 4.8566 0.96046 1.4631 2.1185 2.6408 3.1987 4.0045 4.6743 0.95773 1.4511 2.0880 2.5911 3.1248 3.8896 4.5207 0.95532 1.4405 2.0613 2.5480 3.0610 3.7910 4.3893 0.95319 1.4312 2.0379 2.5102 3.0053 3.7054 4.2759 9 0.97665 1.4861 2.1638 2.7144 3.3120 4.1911 4.9351 0.97298 1.4697 2.1220 2.6548 3.2093 4.0297 4.7173 0.96981 1.4556 2.0862 2.5876 3.1227 3.8948 4.5364 0.96705 1.4433 2.0553 2.5377 3.0488 3.7804 4.3838 0.96462 1.4325 2.0284 2.4943 2.9849 3.6822 4.2535 0.96247 1.4320 2.0047 2.4563 2.9291 3.5971 4.1410 10 0.98421 1.4801 1.1376 2.6710 3.2497 4.1003 4.8199 0.98051 1.4634 2.0954 2.6021 3.1469 3.9394 4.6034 0.97732 1.4491 2.0593 2.5437 3.0602 3.8049 4.4236 0.97454 1.4366 2.0281 2.4935 2.9862 3.6909 4.2719 0.97209 1.4256 2.0009 2.4499 2.9222 3.5931 4.1423 0.96993 1.4159 1.9770 2.4117 2.8664 3.5082 4.0305 11 0.99042 1.4746 1.1152 2.6343 3.1971 4.0239 4.7234 0.98670 1.4577 2.0727 2.5651 3.0941 3.8634 4.5078 0.98349 1.4432 2.0363 2.5064 3.0073 3.7292 4.3288 0.98069 1.4305 2.0048 2.4560 2.9332 3.6155 4.1778 0.97823 1.4194 1.9773 2.4122 2.8691 3.5179 4.0488 0.97606 1.4095 1.9532 2.3737 2.8132 3.4331 3.9374 12 0.99560 1.4701 2.0966 2.6037 3.1532 3.9603 4.6429 0.99186 1.4530 2.0537 2.5342 3.0501 3.8001 4.4281 0.98863 1.4383 2.0171 2.4753 2.9633 3.6662 4.2498 0.98582 1.4255 1.9854 2.4247 2.8890 3.5527 4.0994 0.98334 1.4142 1.9577 2.3807 2.8249 3.4552 3.9709 0.98116 1.4042 1.9333 2.3421 2.7689 3.3706 3.8599
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995 0.500 0.750 0.900 0.950 0.975 0.990 0.995
13
13
14
14
15
15
r2
r2
16
16
17
17
18
18
These tables have been adapted from Donald B. Owens Handbook of Statistical Tables, published by Addison-Wesley, by permission of the publishers.
542
Appendix III Tables
Table 7 Table of Selected Discrete and Continuous Distributions and Some of their Characteristics Distribution Binomial, B(n, p) Probability density function
n f ( x) = p x q n x , x = 0, 1, . . . , n; x 0 0
m n x r x m + n r
Hypergeometric
f (x) =
, where
mr m+n
x = 0, 1, . . . , min(r , m)
(m + n) (m + n 1)
2
mnr(m + n r )
Negative Binomial
r + x 1 x f ( x) = p r q , x = 0, 1, . . . ; x
rq p
rq p2
0 < p < 1, q = 1 p
(Geometric Multinomial
f ( x) = pq x , x = 0, 1, . . .
q p
vector of expectations: (np1, . . . , npk)
q ) p2
vector of variances: (np1q1, . . . , npkqk) qj = 1 pj, j = 1, . . . , k
f ( x1 , . . . , xk ) =
n! x1! x2 ! xk !
x2 xk p1x1 p2 pk , x j 0 integers,
x1 + + xk = n; pj > 0, j = 1, 2, . . . , k, p1 + p2 + + pk = 1
Normal, N(, 2)
(x ) 2 exp 2 2 2 x ; , > 0 f (x) = 1

f ( x) = f (x) = 1
2
1)
(Standard Normal, N(0, 1) Gamma
x2 exp , x 2 2 x 1 x 1 exp , x > 0 ; ( )

r 1 1 x x 2 exp , x > 0; 2 r r2 2 2
, > 0
Chi-square
f ( x) =
r > 0 integer
2r
Tables
543
Table 7
(continued )
Distribution Negative Exponential Uniform, U(, )
Probability density function

f ( x ) = exp( x ), x > 0 ; > 0
f (x) = 1 , x ;
Mean
1
Variance
1 2
+ 2
( )
12
< < <
Beta
f (x) =
( ) ( )
( + )
x 1 ( 1 x )
, 0 < x < 1;
, > 0
( + ) ( + + 1)
2
Cauchy
f ( x) =
, > 0
1 , x ; 2 + ( x )2
Does not exist 1 2 1 2 1 2 q exp , 2 Does not exist
Bivariate Normal
f ( x1 , x 2 ) = q=
2 x 1 1 x1 1 2 1 1 2 1 1 2 x 2 x2 2 , 2 + 2 2 x1, x2, ; 1, 2 , 1, 2 > 0, 1 1
vector of expectations: (1, 2)
vector of variances: 2 ( 2 1, 2).
/) k-Variate Normal, N(,
f ( x ) = (2 )
k 2
1 2
1 / 1 ( x ), exp ( x ) 2
/:kk x k; , non-singular symmetric matrix
mean vector:
covariance / matrix:
Distribution Binomial, B(n, p) (Bernoulli, B(1, p) Poisson, P() Negative Binomial (Geometric
Characteristic function
(t ) = pe it + q , t
n
Moment generating function

M (t ) = pe t + q , t
n
(t ) = pe it + q, t
(t ) = exp e , t
it
M (t ) = exp e t , t
M (t ) = pe t + q, t )
(t ) =
(1 qe )
it
r r
, t
M(t ) =
r t r
(1 qe )
, t < log q
(t ) =
p , t 1 qe it
M(t ) =
p , t < log q) 1 qe t
544 Table 7
Appendix III Tables
(continued )
Distribution Multinomial
Characteristic function
(t 1 , . . . , t k ) = p1e it1 + + pk e it k ,
n
Moment generating function
t1, . . . , tk
M (t 1 , . . . , t k ) = p1e t1 + + pk e t k ,
n
t1, . . . , tk
Normal, N(, 2) (Standard Normal Gamma Chi-square Negative Exponential Uniform, U(, ) Cauchy ( = 0, = 1) Bivariate Normal
2t 2 (t ) = exp it , t 2 t2 (t ) = exp , t 2
2t 2 M (t ) = exp t + , t 2 t2 M (t ) = exp , t ) 2 M(t ) =

M(t ) =
(t ) =
(1 it )
1
, t
(1 t )
1
,t<
,t<
1
1 2
(t ) =
(t ) =
(t ) =
(1 2 it )
r 2
, t
( 1 2t )
r2
, t it
e it e it , t it ( )
M(t ) =
M (t ) =
, t< t
e t e t , t t ( )
(t ) = exp t , t
(t 1 , t 2 ) = exp[i1 t 1 + i 2 t 2
1 2 2 2 1 t 1 + 2 1 2 t 1 t 2 + 2 2 t 2 , 2
( )
Does not exist (for t 0)

M(t 1 , t 2 ) = exp[ 1 t 1 + 2 t 2
1 2 2 2 1 t 1 + 2 1 2 t 1 t 2 + 2 2 t 2 , 2
t1, t2
t1, t2 R 1 / t , M ( t ) = exp t + t 2 t k
k-Variate Normal
1 / t , ( t) = exp it t 2 t k
545
F, A F (C ), (C ) AA (S, A) k, B k , k 1 ( 1, B 1) = ( , B) , P, (S, A, P) IA X1(B) A X or X (-eld) (X B) = [X B] = X1(B) r.v., r. vector, r. experiment, r. sample, r. interval, r. error X (S ) X( j) or Yj B(n, p) P() N(, 2)
1
(usually) a eld and sigma-eld, respectively eld and -eld, respectively, generated by the class C -eld of members of A which are subsets of A measurable space k-dimensional Euclidean space and Borel -eld, respectively Borel real line increasing (non-decreasing) and decreasing (non-increasing), respectively probability measure (function) and probability space, respectively indicator of the set A inverse image of the set B under X -eld induced by X the set of points for which X takes values in B random variable, random vector random experiment random sample, random interval random error range of X jth order statistic Binomial distribution (or r.v.) with parameters n and p Poisson distribution (or r.v.) with parameter Normal distribution (or r.v.) with parameters and 2 distribution function of N(0, 12)
545
546
2 r U(, ) or R(, ) tr Fr ,r 2 r: t r: F r ,r : E(X) or EX or (X) or X or just 2(X) ((X)) or 2 X (X) or just 2() Cov(X, Y), (X, Y) X or X , . . . , X , X or just MX or MX , . . . , X , MX or just M X a.s. P d , , q.m.
1 2 1 2 1 n 1 n
Chi-square distribution (or r.v.) with r degrees of freedom (d.f.) Uniform or Rectangular distribution (or r.v.) with parameters and (Students) t distribution (or r.v.) with r d.f. F distribution (or r.v.) with r1 and r2 d.f. noncentral Chi-square distribution with r d.f. and noncentrality parameter noncentral t distribution with r d.f. and noncentrality parameter noncentral F distribution with r1, r2 d.f. and noncentrality parameter
} }
expectation (mean value, mean) of X
variance (standard deviation) of X Covariance and correlation coefcient, respectively, of X and Y characteristic function (cf. f.) moment generating function (m.g.f.) factorial moment generating function almost sure (a.s.) convergence or convergence with probability one convergence in probability, distribution, quadratic mean, respectively uniformly minimum variance (unbiased) maximum likelihood (estimator or estimate) (uniformly) most powerful (unbiased) (monotone) likelihood ratio sequential probability ratio test least square (estimator or estimate)
UMV (UMVU) ML (MLE) (UMP) MP (UMPU) (MLR) LR SPRT LE (LSE)
Chapter 1
1.1.1. 1.1.2.
(i), (ii) incorrect; (iii), (iv) correct. A1 = {(0, 0), (1, 1), (2, 2), (3, 3), (4, 4), (5, 5)} A2 = {(5, 5), (4, 4), (3, 3), (2, 2), (1, 1), (0, 0)} A5 = {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (2, 0), (1, 0), (1, 1), (2, 0)}. (i) A = U I Aj ; (ii) A = I U Aj ; (iii) (v) follow from (i), (ii).
n =1 j =n n =1 j =n
1.1.9. 1.1.11. 1.2.2.

c 1
An A = (5, 20), BnB = (0, 7].
c c c Let A1, A2 F. Then Ac 1, A 2 F by (F 2). Also A 1 A 2 F by (F 3). c c c But A A2 = (A1 A2) . Thus (A1 A2) F and hence A1 A2 F by (F 2).
1.2.7.
C is not a eld because, for example, {3} C but {3}c = {1, 2, 4} C.
Chapter 2
2.1.1. 2.1.2. 2.1.3. 2.1.4. 2.2.7. 2.2.8. 2.2.9.
c c P(Ac 1 A2) = P(A 2 A3) = 1/6, P(A 1 A3) = 1/3, c c c c P(A1 A2 A3) = 0, P(A1 A 2 Ac 3) = 5/12.
(i) 1/9; (ii) 1/3. (i) 3/190; (ii) 4/190. P(A) = 0.14, P(B) = 0.315, P(C) = 0.095. P(Aj | A) = j(5 j)/20, j = 1, . . . , 5. (i) 2/5; (ii) 5/7. (i) 15/26; (ii) 13/24.
547
548
2.2.11. 2.2.12. 2.2.17. 2.3.1.
(i) 7/9; (ii) 1/6. 19/218. 1 6 [ m j n j /( m j + n j )( m j + n j 1)]. 3 j =1
0 = P() = P(A B). Thus P(A B) = 0 if and only if P(A) = 0 or P(B) = 0 or P(A) = P(B) = 0. 0.54 (0.1) j 1 (0.4)n j 1 .
j =1 n 1
2.3.6. 2.4.1. 2.4.2. 2.4.3. 2.4.4. 2.4.6. 2.4.7. 2.4.8. 2.4.12. 2.4.13. 2.4.14.
720. 2n. 900. (i) 107; (ii) 104. 1/360. (i) 1/(24!); (ii) 1/(13!) (9!). n(n 1). 29/56. (2n)!.
(1 / 2) 2n
2 n . j j =n +1
2n
2.4.15.
n j n j p (1 p) . j =0 j
n
2.4.21.
10 1 4 j=5 j 5 5
10
10 j
2.4.29.
With regard to order: P(A1) = 0.125; P(A2) = 0.25; P(A3) =
4 48 2 3 52 3
0.19663; P(A4) = 0.015625; P[A5] = 0.09375. Without regard to order: P(A1) = P(A3) =
7 53
0.13207; P(A2) = 0.50;
392 507 0.18965; P(A5) = 0.08857. 2067 5724
549
2.4.31.
4 4 48 26 26 13 13 (i) 2 ; (ii) 4 ; (iii) ; (iv) 384; 3 2 1 2 j = 2 j 5 j
13 (v) 4 . 5
2.6.3.
244/495.
Chapter 3
3.2.1. 3.2.2. 3.2.5. 3.2.6. 3.2.10. 3.2.14. 3.2.15. 3.3.5. 3.3.7. 3.3.8. 3.3.9. 3.3.12. 3.3.15. 3.3.16. 3.3.21. 3.4.2. 3.4.3.
(i) {0, 1, 2, 3, 4}; (ii) P(X = x)
= 2 4 , x = 0, 1, . . . , 4. x
(i) 1 (0.875)25 = 0.9645; (ii) 1; (iii) 0.1953.
= 2.3026 and P(X > 5) = 0.032.

e 4.
9 400 1200 1 x =0 x 25 x
1600 . 25
c=1. (i) 2/3; (ii) (1/3)10; (iii) 0.25; (iv) 3/13. a = 3.94, b = 18.3. (i) ej(1 e), j = 0, 1, . . . ; (ii) e t; (iii) e t; (iv) = log /s. (i) e1.3 0.27; (ii) e0.6 0.55; (iii) 50 log 2 34.65. (i) = 2; (ii) = 3.
2 tan 1 c / .
(i) 1.5; (ii) 3. exp(x3). (i) 27/400; (ii) 12/25; (iii) 0; (iv) 2/25. (i) 0.9999; (ii) 0.9996; (iii) 0.9446. 0.0713.
Chapter 4
4.1.10. 4.1.11.
(i) 0; (ii) 0.841345; (iii) 0. (i) 0.01222; (ii) 0.10565; (iii) 0.53281.
550
4.1.13. 4.1.14. 4.2.1. 4.2.3.
(i) 0.584. c = + 1.15.

21 1 5 (i) f j ( x) = x 6 6
x 21 x 4 21 1 5 , j = 1, . . . , 6; (ii) 1 x =0 x 6 6 x 21 x
(i) c = any real > 0; (ii) fX(x) = 2(c x)/c2, x [0, c], fY( y) = 2y/c2, y [0, c]; (iii) f(x|y) = 1/y, x [0, y], y (0, c], f( y|x) = 1/(c x), 0 x y < c; (iv) (2c 1)/c2, by assuming that c > 1/2.
4.2.4.
(i) 1 ex, x > 0; (ii) 1 ey, y > 0; (iii) 1/2; (iv) 1 4e3.
Chapter 5
5.1.6. 5.1.12. 5.2.1. 5.2.2. 5.2.3. 5.2.4. 5.2.10. 5.2.13. 5.2.15. 5.2.16. 5.3.2.
0, c2. (i) 2, 4; (ii) 2. n(n 1) (n k + 1)pk. (i) 0.5, 0.25/n; (ii) 0.75; (iii) 500; (iv) 0.2236. 45(O), 40(A), 10(B), 5(AB).
k.
$0.075. 2 + 2 2 2 exp , (exp 1)exp( 2 + ). 2
(ii) 1 = [np( p 1)(2p 1)]/ 3, 2 = np(1 p), so that 1 < 0 if p < 1/2 and 1 > 0 if p > 1/2; (iii) 1/2, 2. (i) 2 = 1.2; (ii) 9. [n(n + 1) y( y 1)]/2(n y + 1), y = 1, . . . , n, (x + 1)/2, x = 1, . . . ,
n.
5.3.3. 5.3.4. 5.4.5.
7/12, 11/144, 7/12, 11/144, (3y + 2)/(6y + 3), y (0, 1), (6y2 + 6y + 1)/ 2(6y + 3)2, y (0, 1). 1/, 1/2, 1/, 1/2, 1/, 1/2.
1 1 P( X = ) = P I X < = P lim X < n n n n =1 1 = lim P X < = 1. n n

0, 2.5, 2.5, 2.25, 0.
5.5.1.
551
Chapter 6
6.2.10. 6.2.11. 6.5.1. 6.5.2. 6.5.4. 6.5.5. 6.5.12. 6.5.15. 6.5.17. 6.5.24.
(t) = 1/(1 it)2, EX n = (n + 1)!.

(1 cos x)/x2 for x 0, anything (for example, 1/(2)) for x = 0. 6 jt e 6, t . j =1 et/(2 et ), t < log 2, eit/(2 eit ), 2, 4, 2.
e t/( t), t < , ei t/( it), + (1/), 1/2. (t) = [ pt + (1 p)]n, t . (t) = et, t .
M(t) = 1/(1 t), t (1, 1), (t) = 1/(1 it), f(x) = ex, x > 0. EX1 = 1, 2(X1) = 0.5, Co(X1, X2) = 1/6. M(t1, t2) = exp( t + 1 tCt), = ( 1, 2), t = (t1, t2) 2, 2
12 C= 1 2
1 2 tCt), E(X1, X2) = 12 + 12. , (t1, t2) = exp(it 1 2 2 2
Chapter 7
FX (x) = 1 [1 F(x)]n, FX (x) = [F(x)]n. Then for the continuous case and continuity points of f, we have fX (x) = nf(x)[1 F(x)]n1, fX (x) = nf(x)[F(x)]n1.
7.1.1.
(1) (n) (1) (n)
7.1.2. 7.1.6.
i
(i) fX (x1) = I(0,1 )(x1), fX (x2) = I(0,1)(x2); (ii) 1/18, /16, (1 log 2)/2.
1 2 1 j 1 j 1 j 1 j
(i) For j 1, fX ,X (0, 0) = fX ,X (0, 1) = fX ,X (1, 0) = fX ,X (1, 1) = 1/4 and fX (0) = fX (1) = 1/2, i = 1, 2, 3; (ii) Follows from (i).
i
7.1.8.
(i)
p (1 p) j
j j =k
n j
, p = P( X 1 B); (ii) p = 1 / e;
10 10 (iii) e j (1 e 1 )10 j 0.3057 independently of . j=5 j
7.2.2. 7.2.4. 7.3.3.
1/c2, 1/c3, 2/c2, 3/c2. (i) n = integral part of 2/(1 )c2 plus 1; (ii) 4,000. (i) 200; (ii) fX+Y(z) = 2zez, z > 0; (iii) 3.5e2.5.
Chapter 8
8.1.1. 8.1.3.
pn 0 as n .
2 n )2 = 2(X n) = 0 as n . E(X n
552
E(Yn X )2 = E(Xn Yn)2 + E(Xn X )2 2E[(Xn Yn)(Xn X )] and |E[(Xn Yn)(Xn X )]| E|(Xn Yn)(Xn X )| E1/2(Xn Yn)2 E1/2(Xn X)2. n n 1 e it n (1e ) e e = e e = X t , 8.2.2. X (t ) = pn + qn = 1 n n where X ~ P().
8.1.4.
n
it
it
()
8.3.2. 8.3.3. 8.3.5. 8.3.7. 8.3.8. 8.3.11. 8.3.15. 8.3.16. 8.4.3.
P(180 X 200) 0.88. P(150 X 200) 0.96155. P(65 X 90) 0.87686. 0.999928. 4,146. c = 0.329. n = 123. 26. 1 n 1 n 1 E( X n n ) = 2 E ( X j j ) = 2 E( X j j ) 2 = 2 n n j =1 n j =1 M 1 2 nM = 0. n n n
2 2
j =1
2 j
8.4.6.
1 1 2(X j ) = 2 j2 = 2 ( j2 ) = 2 and then Exercise 8.4.3 applies. j j
8.4.7.
2 ( X j ) = j so that E X n n
= =
1 n2
2j =
j=1 n
1 n2
j
j=1
1 1 j n 0. n n j=1
Chapter 9
9.1.2. 9.1.3. 9.1.6.
(ii) P(Y = c1) = 0.9596, P(Y = c2) = 0.0393, P(Y = c3) = 0.0011; (iii) 0.9596c1 + 0.0393c2 + 0.0011c3.
9 2 N( + 32, 81 25 ). 5
fZ ( z) = 1 / 1 z2 , z (1, 1). r f ( y) = 2 r / 2 y( r / 2)1 (1 y) [( r / 2)+1] exp[ y / 2(1 y)], y (0, 1). 2

1
9.1.8.
553
9.2.1. P(X1 + X2 = j) = (j 1)/36, j = 2, . . . , 7, P(X1 + X2 = j) = (13 j )/36, j = 8, . . . , 12, and P(X1 + X2 = j ) = 0 otherwise. 9.2.6. 9.2.8.
fX ( x ) =
1 1 I (0 ,1) ( x ) + 2 I (1, ), and 0 otherwise. 2 2x
1 1 r1 + k r2 k r 2 2 ; ii(i) Use EXk = 2 1 1 r1 r1 r2 2 2

k
i(ii) The transformation y =
1 gives 1 + rr x
1 2
x=
r2 1 y dx r2 1 = . , o < y < 1, and r1 y dy r1 y 2

1 2
Then the p.d.f. of Fr ,r , on page 236 yields:

r2 r r1 + r 1 y r2 1 1 2 = fY ( y) = f X 2 y2 1 y 2 r r 2 y r1 y r1 21 2
2
()()
2 1
( )
r1 2
after cancellations. This last expression is the p.d.f. of the Beta distribution with degrees of freedom r and r . 2 2 (iii) By (ii) and for r1 = (= r), 1/(1 + X ) is B(r/2, r/2) which is symmetric about 1/2.
1 1 1 Hence P( X 1) = P = ; (iv) Set Y = r1 X . Then 1 + X 2 2

1 (r1 + r2 ) r /2 r /2 2 y y ( r / 2 )1 fY ( y) = y 1 + 1 + r2 r2 1 1 r /2 r1 r2 r 2 2 2
2 1 1 1
r
2
1 y( r / 2)1e y / 2 1 ( r / 2)1 r1 2 2
1 1
r +r since 1 2 2
r r /2 2 r2 1 2 ( r / 2)1 r 2
1 2
by the approximation employed in Exercise 2.7(iii).
554
9.2.13
r + 1 2 fr x = r ( r +1) 2 r + 1 2 e 2
()
r 2 2 ( r 1) r 2 r e 2 2
1 2
. 2
2
r 1 + 1 r
1 2
r t2 1 + r
t2 1 + r
1 2
e1 2
As r , the rst two terms on the right-hand side converge to 1 (by Stirlings formula), and the remaining terms converge to: e1 2 e t
2
1 e 1 2 2
1 2
e t 2 .
2
9.3.5.
(i)
0 2 1 + u + v ~ N , 0 0 u v
, 2 1
(ii)
+ x + y 1 2 ~ N , x y 1 2
2 2 1 + 0
. 2 2 1
Chapter 10
10.1.1. 10.1.2. 10.1.4.
1 P(Xj > m, j = 1, . . . , n) = , P(Yn m) = 1/2n. 2

n
c = log [1 (0.9)1/3].
ii(i) + ( )j/(n + 1), ( )2j(n j + 1)/(n + 1)2 (n + 2);

n n + , 2 Y1 = 2 Yn = + ; , EYn = i(ii) EY1 = 2 n+1 n+1 n+1 n+2
( )
( )
(
)(
(iii) EY1 =
n n 1 , 2 Y1 = 2 Yn = , EYn = . 2 n n+1 +1 n+1 n+2
( )
( )
)(
For the converse, ent = P(Y1 > t) = P(Xj > t, j = 1, . . . , n) = [P(X1 > t)]n so that P(X1 > t) = et. Thus the common distribution of the X s is the Negative Exponential distribution with parameter .
10.1.9.
555
10.1.14.
With k =
1 n + 1 (2 k 1)! , ( y )k1 ( y)k1 , y ( , ), 2 2 k1 2 [( k 1)!] ( )
and
( 2k 1)! (1 e y )k 1 (e y )k , y > 0. [(k 1)!]2
k 1 )! [ F ( y)]k 1 [1 F ( y)]k 1 f ( y), y . But For n = 2k 1, fS M ( y) = [(( 2 k 1 )!]2 f( y) = f ( + y) and F( + y) = 1 F( y). Hence the result.
10.1.15.
10.1.17. 10.2.1.
fS (y) = 3!e2( y) [1 e( y)], y > .

M
Set Z = F(Y1). Then fZ(z) = n(1 z)n1, z (0, 1) and EZ = 1/(n + 1).
Chapter 11
11.1.10.
(i) X j ; (ii) ( X 1 , . . . , X n ); (iii) X j ; (iv) X j .

j =1 j =1 j =1
11.2.2.
Take g(x) = x. Then E g(X ) =
1 2
x dx = 0 for every = (0, ).
11.2.3. f(x; ) = P(Xj = x) = 1/10, x = + 1, . . . , + 10, j = 1, 2 and let T(X1, X2) = X1, V(X1, X2) = X2. Then T is sufcient for and T, V are independent. But the distribution of V does depend on . This is so because the set of positivity of the p.d.f. of T depends on (see Theorem 2). 11.3.1.
Set T = n j = 1Xj. Then T is P(n), sufcient for (Exercise 11.1.2(i)) and complete (Example 10). Finally, E(T/n) = for every = (0, ). f X ( x) = parameter(s).
1 x
11.5.2.
I ( , ) ( x) so that the set of positivity of f does depend on the
Chapter 12
12.2.2.
n+1 n+ 2 2 X (n ) , X (n ) . 2n 12 n [ X (1) + X (n ) ] 2 , n+1 [ X X (1) ]. n 1 (n )

1 n . 2
n 1 1 n X
12.2.3.
12.3.2. 12.3.5. 12.3.6. 12.3.8.
1 cn = 2 ( n + 1) 2
if the p.d.f. is in the form f ( x; ) = 1 e x , x > 0, and it is It is X if the p.d.f. is in the form f(x; ) = ex, x > 0.
2 (X + r)/r, 2 [(X + r)/r] = (1 )/r .
n 1 n 2 n 2 2 X / ( X j X ) . 2 2 j =1
556
12.3.9.
( X j X )(Yj Y ) /(n 1), XY n(n 1) ( X j X )(Yj Y ),

j =1 j =1
n 1 n 3 n 2 2 ( X j X )(Yj Y ) /( n 1) (X j X ) . 2 j =1 2 j =1
n
12.5.6. 12.5.7.
log(X/n). X(1). X(1), X n r X j n. j =1 ). exp(x/X
12.5.8.
12.5.9.
12.9.1. 12.9.4. 12.9.6.
ba b a 2 , 2 X = (a + b) / 12 n. 2 2
3(X1 + X2)/2. X S and S, where S 2 = 1 n ( X j X )2 . n j =1
12.11.2.
n n (U n Vn ) = ( + ) X j n n ( + + n) and j =1 E [ n (U n Vn )] = [( + )n n]/ n ( + + n) n 0,
2 [ n (U n Vn )] = n (1 )[( + ) / n ( + + n)]2 n 0.
Chapter 13
13.2.1. 13.2.2. 12.2.4. 13.3.1.
Reject H if x > 1.2338. Power = 0.378. n = 9. Cut-off point = 3.466, H is accepted. V = x j in both cases.
j =1 n
13.3.4. 13.3.7. 13.3.8. 13.3.10.
Cut-off point = 28.44, H is accepted. Cut-off point 86, H is accepted. n = 14. Cut-off point = 10, H : = 20 (there is no improvement) is
accepted.
557
13.3.12. 13.4.1. 13.5.1. 13.5.4. 13.5.5. 13.7.2. 13.8.3. 13.8.4. 13.8.7.
(i) Reject H if H is rejected.
x
j =1
n < C, C : P X j < C = ; (ii) n = 23. j =1

0
H : 0.04, A : > 0.04. H is accepted. Assume normality and independence. H is accepted. H : = 2.5, A : 2.5. H is accepted. H is rejected in both cases. Cut-off point = 2.82, H is accepted. H (hypothesizing the validity of the model) is accepted. H (the vaccine is not effective) is rejected.
Chapter 14
14.3.1.
870.
14.3.2.
E0(N ) = 77.3545, E1(N ) = 97.20, n (xed sample size) = 869.90 E0(N ) = 2.32, E1(N ) = 4.863, n (xed sample size) = 32.18 33.
Chapter 15
(i) fR(r) = n(n 1)r n2( r)/ n, r (0, ); (iii) The expected length of the shortest condence interval in Example 4 is = n(1/n 1)/(n + 1). The expected length of the condence interval in (ii) is = (n 1) (1 c)/c(n + 1) and the required inequality may be seen to be true.
15.2.4. 15.4.1.
ii(i) [ X n z / 2 / n , X n + z / 2 / n ]; 100 0.196, X 100 + 0.196]; i(ii) [X (iii) n = 1537.

15.4.2.
i(i) (ii)
100 0.0196S100, X 100 + 0.0196S100], S 2 [X 100 =
(X
j =1
100
X 100 ) 2 / 100;
Sn n in probability (and also a.s.). n z/2 / n , X n + z /2 / n ]; = known, = known, = unknown: [X 2 2 2 = unknown: [nS n /C2, nS n /C1], C1, C2 : P( 2 n < C1 or n > C2) = .
j 1 10 P(Yi x p Yj ) = pk (1 p)10k = 1 . Let p = 0.25 and (i, j) = k =i k
15.4.4.
15.4.5.
558
(2, 9), (3, 4), (4, 7). Then 1 = 0.756, 0.2503, 0.2206, respectively. For p = 0.50 and (i, j) as above, 1 = 0.9786, 0.1172, 0.6562, respectively.
15.4.7.
[x p/2, xp/2], [0.8302, 2.0698].
Chapter 16
16.3.5.
0.280 2 = 7.9536; ii(i) = 0.572 , 0.268
4.6 3.30 0.50 2.67 0.43 ; i(ii) 3.3 0.5 0.43 0.07
2
36.5865 26.2469 3.9768 (iii) 26.2469 21.2361 3.4200 3.9768 3.4200 0.5567
16.4.2.
i(i)
(i) Reject H if ( 0 )
where = ( xj x )Yj
j =1 n n
(x
j =1
n j =1
x )2
2 / ( n 2) > t n 2 ; / 2 , n
2 ( xj x ) 2 ,
( x x )]2 n , =Y; = [Yj j

j =1
n 2 ( n 2) ( x j x ) 2 , t n 2 ; / 2 n j =1 n 2 ( n 2) ( x j x ) 2 . + t n 2 ; / 2 n j =1
(ii)
16.5.1.
i(i) (ii)
2/b, (n r) 2/a], a, b: P(a 2 [(n r) nr b) = 1 ; 2 2 /40.6, 25 /13.1]. [25
16.5.2.
(iii) Reject H if
n 1
2 > t n 2 ; / 2 ,
559
b a 2 / n, 2 / n , a, b : P(a t n 2 b) = 1 ; 1 1
(iv) Reject H if 2
x
j =1
2 j
2 > t n 2 ; / 2 ,
b 2 2
16.5.5.
a 2 x j2 , 2
j =1
2 x , a, b as in (iii). j j =1
n
1 = 0.00242, 2 = 0.0191, 2 = 0.0019; ii(i) i(ii) 1: [0.04698, 0.05182], 2: [0.0166, 0.0216], 2: [0.0007, 0.0157]; (iii) [0.26172, 0.39248].
16.5.9.
Reject H1 if
m n m 2 n 2 2 2 2 xi m ( xi x ) + x j n ( x j x ) i =1 j =1 j =1 i =1
) ( 1 1
> t m +n 4 ; / 2 , and reject H2 if

) ( 2 2 2 1 1 ( xi x ) 2 + i =1
m
2 ( x j x j ) > t m +n 4 ; / 2 .
j =1
Chapter 17
SSH = 0.9609 (d.f. = 2), MSH = 0.48045, SSe = 8.9044 (d.f. = 6), MSe = 1.48407, SST = 9.8653 (d.f. = 8).
17.1.1. 17.2.2.
SSA = 34.6652 (d.f. = 2), MSA = 17.3326, SSB = 12.2484 (d.f. = 3), MSB = 4.0828, SSe = 12.0016 (d.f. = 6), MSe = 2.0003, SST = 58.9152 (d.f. = 11). Yij N( i, 2), i = 1, . . . , I; j = 1, . . . , J independent implies
17.4.1.
2 Yi i ~ N 0, , i = 1, . . . , I independent. Since J
1 I (Yi i ) = Y , we have that I i =1
[(Yi i ) (Y )]2
i =1
2 / J ~ I21 Hence that result.
560
Chapter 18
18.1.3.
/ as Let X(1) = (Xi , . . . , Xi ), X(2) = (Xj , . . . , Xj ) and partition and follows:

l m l n
(1) / / = 11 = ( 2) , / 21
/ 12 . / 22
Then the conditional distribution of X(1), given X(2) = x(2), is the m-variate Normal with parameters:
( 2) 1 1 / 11 / 12 / / 21 . / 12 + / (1) + ( 2) , 22 x 22
n n 2 n 2 18.3.7. In the inequality j j i j , i, j , i, j = 1, . . . , i =1 j =1 j =1 n, set i = Xi X , j = Yj Y .

5 / 6 1 / 3 1 / 6 19.2.5. Q = XCX, where X = (X1, X2, X3), C = 1 / 3 1 / 3 1 / 3 1 / 6 1 / 3 5 / 6
Chapter 19
and C is idempotent and of full rank. Thus Q is 2 3. Furthermore, 1 2 ( X X + X ) 0, so that X X Q is positive denite. Then, by XX Q = 1 2 3 6 Theorem 4, XX Q and Q are independent.
Chapter 20
20.4.1. 20.4.3.
RX + RY = R( X i ) + R(Yj ) = 1 + 2 + + N = N ( N + 1) / 2.
i =1 j =1
2
Eu(Xi Yj) = Eu (Xi Yj) = P(Xi > Yj) = 1/2, so that 2u(Xi Yj ) = 1/4, and Cov[u(Xi Yj), u(Xk Yl)] = 0, i k, j l, Cov[u(Xi Yj), 1 u(Xk Yl)] = , i = k, j l or i k, j = l. The result follows. 3
Index
561
INDEX
A Absolutely continuous, 54, 55 Acceptance region, 332 Analysis of variance, 440 one-way layout (classication) in, 440 tables for, 445, 451, 457 two-way layout (classication) in, 446, 452 Asymptotic efciency (efcient), 327 Asymptotic relative efciency, 327, 497 Pittman, 498 of the sign test, 498 of the t-test, 498 of the Wilcoxon-Mann-Whitney test, 498 B Basis, 501 orthonormal, 501 Bayes, decision function, 380, 382 estimator (estimate), 315317, 322 formula, 24 Behrens-Fisher problem, 364 Best linear predictor, 134 Beta distribution, 71 expectation of, 120, 543 graphs of, 72 moments of, 120 parameters of, 71 p.d.f. of, 70, 542 variance of, 543 Beta function, 71 Bias, 306 Bienaym equality, 171 Binomial distribution, 56 approximation by Poisson, 58, 79 as an approximation to Hypergeometric, 81
ch.f. of, 144, 146, 543 expectation of, 114, 542 factorial moments of, 119 graphs of, 56, 57 m.g.f. of, 154, 543 parameters of, 56 Point, 56 p.d.f. of, 55 tables of, 511519 variance of, 114, 542 Binomial experiment, 55, 59 Bio-assay, 287 Bivariate Normal distribution, 74, 96, 543 ch.f. of, 544 conditional moments of, 122 conditional p.d.f.s of, 122 conditional variance of, 122 graph of, 75 independence in, 168 marginal p.d.f.s of, 75 m.g.f. of, 158, 544 parameters of, 74 p.d.f. of, 74, 97, 134, 465466, 543 test of independence in, 470 uncorrelation in, 168 vector of expectations of, 543 vector of variances of, 543 Borel, real line, 11 -eld, 12 k-dimensional, 13 C Cauchy distribution, 72, 543 ch.f. of, 149, 544 graph of, 73 m.g.f. of, 156, 544 parameters of, 72
561
562
Index
Cauchy principle value integral, 118 Central Limit Theorem (CLT), 66, 189 applications of, 191196 continuity correction in, 192 Center of gravity, 108 Ch.f.s, 138, 140 application of, 166, 173176 basic properties of, 140 joint, 150 of an r.v., 140 of Binomial distribution, 144, 146, 543 of Bivariate Normal distribution, 544 of Cauchy distribution, 149, 544 of Chi-square distribution, 148, 544 of Gamma distribution, 148, 544 of Geometric distribution, 150, 544 of k-Variate Normal distribution, 464, 544 of Multinomial distribution, 152, 544 of Negative Binomial distribution, 150, 543 of Negative Exponential distribution, 148, 544 of Normal distribution, 145, 147, 544 of Poisson distribution, 146, 544 of Uniform distribution, 150, 544 properties of, 140141, 150151 Characteristic polynomial, 477, 504 roots, 477, 504 Chi-square distribution, 69 critical values of, 529531 degrees of freedom of, 69 expectation of, 118, 542 noncentral, 434, 508 p.d.f. of, 69 variance of, 118, 542 Chi-square statistic, 377 asymptotic distribution of, 377 Chi-square test, 377 Column effect, 446, 450 Combinatorial results, 34 Completeness, 275, 281, 283, 285 lack of, 276 of Beta distribution, 285, 287 of Binomial distribution, 275 of Exponential distibution, 281, 283 of Gamma distribution, 285, 287 of Negative Binomial distribution, 287 of Negative Exponential distribution, 287 of Normal N (, 2) distribution, 276 of Poisson distribution, 275 of Uniform distribution, 276 Conditional expectation, 122 basic properties of, 122 Condence coefcient, 397 approximate, 410 asymptotic, 486 Condence interval(s), 397, 486 expected length of, 398 in Beta distribution, 402403, 409 in Binomial distribution, 411 in Gamma distribution, 401402
in Normal distribution, 398401, 407409, 410411 in Poisson distribution, 411 in the presence of nuisance parameters, 407 in Uniform distribution, 403 length (shortest) of, 398400, 402, 404, 408 Condence limits (lower, upper), 397 Condence region(s), 397, 410 and testing hypotheses, 412 in Normal distribution, 411 Contingency tables, 374375 Continuity correction, 192196 Contrast, 458 Convergence of r.v.s, 180 almost sure, 180, 183 in distribution, 181, 183, 469 in probability, 180, 183 in quadratic mean, 182183 modes of, 180181 strong, 180 weak, 181 with probability one, 180 Convolution of d.f.s, 224 Correlation coefcient, 129, 134 interpretation of, 129133 p.d.f. of sample, 474 sample, 472 Covariance, 129 of a matrix of r.v.s, 418 of LSE in case of full rank, 421 Cramr-Rao bound, 297298 in Binomial distribution, 302 in Normal distribution, 303305 in Poisson distribution, 303 Critical region, 332 Cumulant generating function, 162 Cumulative d.f., 85 basic properties of, 85 D Data, 263 Decision, 313 rule, 313 Decision function(s), 313 Bayes, 380, 382, 384 equivalent, 314 minimax, 380, 383385 nonrandomized, 308 Degrees of freedom of Chi-square distribution, 69 of F-distribution, 233 of noncentral Chi-square distribution, 508 509 of noncentral F-distribution, 509 of noncentral t-distribution, 508 of t-distribution, 233 De Morgans laws, 4, 78 Dependent
Index
563
negatively quadrant, 163 positively quadrant, 163 Dimension of a space, 501 Distinct, balls, 38 cells, 38 Distribution Bernoulli (or Point Binomial), 56, 542543 Beta, 70, 543 Binomial, 5556, 542543 Bivariate Normal, 74, 96, 465466, 543544 Cauchy, 72, 543544 central Chi-square, 511 central F-, 511 central t-, 511 Chi-square, 69, 542, 544 continuous, 54 discrete, 54 discrete Uniform, 60 Double Exponential, 78 F-, 73, 223 -free, 485 function(s), 85 basic properties of, 85 conditional, 91 cumulative, 85 empirical (or sample), 200, 486 graphs of, 87 joint, 91, 93 marginal, 9193 variation of, 92 Gamma, 67, 542, 544 Gauss, 65 Geometric, 60, 542543 Hypergeometric, 59, 542 Multiple, 63 kurtosis of a, 121 k-Variate Normal, 462, 543544 lattice, 141 leptokurtic, 121 Logistic, 90 Lognormal, 73 Maxwell, 78 memoryless, 77 mixed, 79 Multinomial, 6061, 9596, 542, 544 Multivariate Normal, 463 Negative Binomial, 59, 542543 Negative Exponential, 69, 543544 noncentral Chi-square, 434, 508509 noncentral F-, 434, 509 noncentral t-, 360, 508 Normal, 65, 542, 544 of an r.v., 53 of the F statistic, 433 of the sample variance in Normal, 480 Pareto, 78 Pascal, 60 platykurtic, 121 Point Binomial, 56 Poisson, 57, 542543
Raleigh, 78 Rectangular, 70 skewed, 121 skewness, 120 Standard Normal, 65 t-, 223 Triangular, 228 Uniform, 60, 70, 543544 Weibull, 78, 285 E Effects column, 446, 450 main, 457 row, 446, 450 Efciency, relative asymptotic, 327. See also Pittman asymptotic relative efciency Eigenvalues, 477, 504 Error(s), sum of squares of, 418 type-I, 332 type-II, 332 Estimable, function, 422 Estimation by the method of moments, 324 decision-theoretic, 313 least square, 326 maximum likelihood, 307 minimum chi-square, 324 nonparametric, 485 point, 288 Estimator(s) (estimate(s)) admissible, 314 a.s. consistent, 327 asymptotically efcient, 327 asymptotically equivalent, 329 asymptotically normal, 327, 489 asymptotically optimal properties of, 326 asymptotically unbiased, 489 Bayes, 315317, 322 best asymptotically normal, 327 consistent in probability, 327 consistent in quadratic mean (q.m.), 489 criteria for selecting, 289, 306, 313 efcient, 305 essentially complete class of, 314 inadmissible, 315 least square, 418 maximum likelihood, 307 minimax, 314, 322323 strongly consistent, 327, 485487, 489 unbiased, 289 uniformly minimum variance unbiased (UMVU), 292, 297 weakly consistent, 327, 485486 Event(s) certain (or sure), 14 composite, 14 dependent, 33 happens (or occurs), 15
564
Index
Event(s) continued impossible, 14 independent, 28 completely, 28 in the probability sure, 28 mutually, 28 pairwise, 28 statistically, 28 stochastically, 28 null, 15 simple, 14 Expectation, 107108 basic properties of, 110 conditional, 123 mathematical, 107108 of a matrix of r.vs, 418 of Beta distribution, 120, 543 of Binomial distribution, 114, 542 of Chi-square distribution, 118, 542 of Gamma distribution, 117, 542 of Geometric distribution, 119, 542 of Hypergeometric distribution, 119, 542 of Lognormal distribution, 120 of Negative Binomial distribution, 119, 542 of Negative Exponential distribution, 118, 543 of Normal distribution, 117, 542 of Poisson distribution, 115, 542 of Standard Normal distribution, 116 of Uniform distribution, 113, 543 of Weibull distribution, 114 properties of conditional, 123 Experiment(s) binomial, 55, 59 composite (or compound), 32 dependent, 33 deterministic, 14 independent, 32, 46 multinomial, 60 random, 14 Exponential distribution(s), 280 multiparameter, 285286 Negative Exponential, 69 one-dimensional parameter, 280, 282 U(, ) is not an, 286 F F-distribution, 73, 233 critical values of, 532541 expectation of, 238 graph of, 236 noncentral, 434, 509 the p.d.f. of, 234 variance of, 258 F-test, 432 geometric interpretation of, 432 Factorial moment, 110 generating function of a, 153 of Binomial distribution, 157
of Negative Binomial distribution, 161 of Poisson distribution, 115, 119 Failure rate, 91 Field(s), 8 consequences of the denition of a, 8 discrete, 9 examples of, 9 generated by a class of sets, 9 trivial, 9 Finitely additive, 15 Fishers information number, 300 Fourier transform, 140 Function Bayes, 380, 382 Beta, 71 continuous, 103 cumulative distribution, 85 decision, 313, 379 empirical distribution, 200, 486 estimable, 422 Gamma, 67 indicator, 84, 135 loss, 313, 380 measurable, 103 minimax, 380 non-randomized, 379 parametric, 422 projection, 104 risk, 313, 380 sample distribution, 200, 486 squared loss, 313 Fundamental Principle of Counting, 35 G Gamma distribution, 67, 542 ch.f. of, 148, 544 expectation of, 117, 542 function, 67 graph of, 68 m.g.f. of, 155, 544 parameters of, 67 p.d.f. of, 67, 542 variance of, 117, 542 General linear hypothesis, 416 model, 417 Generating function, 121 cumulant, 162 factorial moment, 153 moment, 138, 153, 158 Geometric distribution, 60 ch.f. of, 543 expectation of, 119, 542 m.g.f. of, 543 p.d.f. of, 60, 542 variance of, 119, 542 Grand mean, 446 sample mean, 445
Index
565
H Hazard rate, 91 Hypergeometric distribution, 59, 542 approximation to, 81 expectation of, 119, 542 Multiple, 63 p.d.f. of, 59, 542 variance of, 119, 542 Hypothesis(-es) alternative, 331 composite, 331, 353 linear, 416 null, 331 simple, 331 statistical, 331 testing a simple, 333, 337 testing a composite, 341 I Independence, 27 complete (or mutual), 28 criteria of, 164 in Bivariate Normal distribution, 168 in the sense of probability, 28 of classes, 177178 of events, 28 of random experiments, 32, 46 of r.v.s, 164, 178 of sample mean and sample variance in the Normal distribution, 244, 284, 479, 481 of -elds, 46, 178 pairwise, 28 statistical, 28 stochastic, 28 Independent Binomial r.v.s, 173 Chi-square r.v.s, 175 classes, 178 completely, 28 events, 28 in the sense of probability, 28 mutually, 28 Normal r.v.s, 174175 pairwise, 28 Poisson r.v.s, 173 random experiments, 32, 46 r.v.s, 164, 178 -elds, 46, 178 statistically, 28 stochastically, 28 Indicator, 84 function, 135 Indistinguishable balls, 38 Inequality(-ies) Cauchy-Schwarz, 127 Cramr-Rao, 297-298 Markov, 126 moment, 125
probability, 125 Tchebichevs, 126 Inference(s), 263 Interaction(s), 452, 457 Intersection, 2 Invariance, 307, 493 Inverse image, 82 Inversion formula, 141, 151 J Jacobian, 226, 237, 240 Joint, ch.f., 150 conditional distribution, 95, 467 conditional p.d.f., 95 d.f., 91, 94 moment, 107 m.g.f., 158 probability, 25 p.d.f., 95 p.d.f. of order statistics, 249 K Kolmogorov one sample test, 491 -Smirnov, two-sample test, 493 Kurtosis of a distribution, 121 of Double Exponential distribution, 121 of Uniform distribution, 121 L Laplace transform, 153 Latent roots, 481, 504 Laws of Large Numbers (LINs), 198 Strong (SLLNs), 198, 200 Weak (WLLNs), 198200, 210 Least squares, 418 estimator, 418, 420 estimator in the case of full rank, 421 Lebesgue measure, 186, 328 Leptokurtic distribution, 121 Level, of factor, 447 of signicance, 332 Likelihood, function, 307 ratio, 365 Likelihood ratio test, 365, 430, 432 applications of, 374 in Normal distribution(s), 367372 interpretation of, 366 Likelihood statistic, 365 asymptotic distribution of, 366 Limit inferior, 5 of a monotone sequence of sets, 5 superior, 5 theorems, basic, 180 theorems, further, 202
566
Index
Linear dependence, 129 hypothesis, 416 interpolation, 61 model, 424 canonical reduction of, 424 regression functions, 418 Lognormal distribution, 73 expectation of, 120 graphs of, 74 parameters of, 73 p.d.f. of, 73 variance of, 120 Loss function, 313, 380 squared, 313 Least Square Estimate (LSE), of s, 443 of , i, j, 448449 of ij etc., 454 of 2, 425, 444, 451, 456 M Matching problem, 48 Matrix (-ices), 502 characteristic polynomial of a, 504 characteristic (latent) roots of a, 504505 determinant of a square, 503 diagonal, 502, 504506 diagonal element of a, 502 dimensions of a, 502 eigenvalues of a, 504 elements of a, 502 equal, 502 idempotent, 504, 506507 indentity, 502 inverse, 503 negative denite (semidenite), 504506 nonsingular, 503506 of full rank, 503 order of a, 502, 505507 orthogonal, 503506 positive denite (semidenite), 504506 product by a scalar, 502 product of, 502 rank of a, 503, 505507 singular, 503 some theorems about, 504 square, 502, 504505 sum of, 502 symmetric, 502, 505507 transpose, 502 unit, 502 zero, 502 Maximum likelihood, 306 and Bayes estimation, 318 estimator (estimate) (MIE), 307 in Binomial distribution, 309 in Bivariate Normal distribution, 472, 475 in Multinomial distribution, 308309, 312 in Negative Binomial distribution, 312
in Negative Exponential distribution, 312 in Normal distribution, 309310, 312 in Poisson distribution, 307 in Uniform distribution, 310 interpretation of, 307 invariance of, 307 function, 307 principle of, 306 Mean, 107108. See also, expectation grand, 446 grand sample, 445 interpretation of, 108 Mean value, 107108 Measurable, function, 103 space, 11 Measurable spaces product of, 4546 Median, 99 sample, 259 Mellin (or Mellin-Stieltjes) transform, 156 Method(s) of estimation, other, 324 least square, 326, 418 minimum chi-square, 324 moments, 325 in Beta distribution, 326 in Gamma distribution, 326 in Normal distribution, 325 in Uniform distribution, 325 M.g.f., 138, 153, 158 factorial, 153, 156157 joint, 158 of Binomial distribution, 154, 543 of Bivariate Normal distribution, 158, 544 of Cauchy distribution, 156, 544 of Chi-square distribution, 544 of Gamma distribution, 155, 544 of Geometric distribution, 543 of Multinomial distribution, 158, 544 of Negative Binomial distribution, 161, 543 of Negative Exponential distribution, 156, 544 of Normal distribution, 155, 544 of Poisson distribution, 154, 543 of Uniform distribution, 161, 544 Mode(s), 100 of Binomial distribution, 101 of Poisson distribution, 101 Moment(s) about the mean, 109 absolute, 107 central, 107, 109 central joint, 109 conditional, 122 factorial, 110, 115 of Binomial distribution, 119 of Poisson distribution, 119 generating function (m.g.f.), 153156 inequalities, 125 joint, 107
Index
567
n-th, 106107 of an r.v., 106, 108 of Beta distribution, 120 of inertia, 107 of Standard Normal, 116 r-th absolute, 107 sample, 325 Monotone likelihood ratio (MLR) property, 342 of Exponential distribution, 342 of Logistic distribution, 342343 testing under, 343 Multicomparison method, 458 Multinomial distribution, 6061, 64, 9596, 542 ch.f. of, 152, 544 distribution, 6061, 64, 9596, 542 experiment, 60 m.g.f. of, 158, 544 parameters of, 6061 p.d.f. of, 60 vector of expectations of, 542 vector of variances, 542 Multivariate (or k-Variate) Normal distribution, 463465, 543544 ch.f. of, 544 estimation of and , 469 m.g.f. of, 544 nonsingular, 465 parameters of, 464 p.d.f. of, 465, 543 singular, 474 some properties of, 467 N Negative Binomial distribution, 59 ch.f. of, 150, 543 expectation of, 119, 542 factorial m.g.f., 161 m.g.f., 161, 543 p.d.f. of, 59, 542 variance of, 119, 542 Negative Exponential distribution, 69 ch.f. of, 544 expectation of, 118, 543 m.g.f. of, 156, 544 parameter of, 69 p.d.f. of, 69, 543 variance of, 118, 543 Neyman-Pearson, 331, 366 fundamental lemma, 334 Noncentrality parameter, 508509 Noncomplete distributions, 276277 Nonexponential distribution, 286 Nonnormal Bivariate distribution, 99 Nonparametric, estimation, 485 estimation of a p.d.f., 487 inference, 485 tests, 490 Normal distribution, 65, 542
approximation by, 194196 ch.f. of, 145, 147, 544 expectation of, 116117, 542 graph of, 66 independence of sample mean and sample variance in, 244, 284, 479, 481 m.g.f. of, 155, 544 moments of Standard, 116 parameters of, 65 p.d.f. of, 65, 542 Standard, 65 tabulation of Standard, 523525 variance of, 116117, 542 Normal equations, 418, 420 Notation and abbreviations, 545546 O Occupancy numbers, 39 Order statistic(s), 249 joint p.d.f. of, 249 p.d.f. of j-th, 252 Orthocomplement (or orthogonal complement), 501 P Parameters, 263 noncentrality, 508509 nuisance, 356, 407 space, 263 Partition (nite, denumerably innite), 23 Permutation(s), 35 Pittman asymptotic relative efciency, 498 of the Sign test, 498 of the Wilcoxon-Mann-Whitney, 498 telative to the t-test, 498 Platikurtic distribution, 121 Poisson distribution, 57 approximation to Binomial distribution, 58, 79 ch.f. of, 146, 543 expectation of, 115, 542 factorial moments of, 119 graph of, 58 m.g.f. of, 154, 543 parameter of, 57 p.d.f. of, 57, 542 tabulation of, 520522 variance of, 115, 542 Poisson, truncated r.v.(s), 62, 273 Polyas lemma, 210 urn scheme, 65 Power function, 332 Prediction interval, 413 Predictor, best linear, 134 Probability(-ies) classical denition of, 17 conditional, 2122
568
Index
Probability(-ies) continued consequences of the denition of, 1516 dening properties of, 15 densities, 85 density function, 54 distribution, 53, 84 distribution function, 53, 84 function, 15 uniform, 17 inequalities, 125 integral transform, 246 joint, 25 Kolmogorov denition of, 17 marginal, 25 measure(s), 15 product of, 46 of coverage of a population quantile, 260 of matchings, 47 of type-I error, 332 of type-II error, 332 relative frequency denition of, 17 space, 15 statistical denition of, 17 Probability density function(s) (p.d.f.(s)), 53 54 conditional, 91, 94 convolution of, 224 F-, 233234 joint, 93 joint conditional, 95 marginal, 91, 93, 95 of Bernoulli (or Point Binomial) distribution, 56, 542 of Beta distribution, 70, 543 of Binomial distribution, 55, 542 of Bivariate Normal distribution, 74, 97, 134, 465466, 543 of Cauchy distribution, 72, 543 of Chi-square distribution, 69, 542 of continuous Uniform distribution, 70, 543 of discrete Uniform distribution, 60 of Double Exponential distribution, 78 of Gamma distribution, 67, 542 of Geometric distribution, 60, 542 of Hypergeometric distribution, 59, 542 of Lognormal distribution, 73 of Maxwell distribution, 78 of Multinomial distribution, 60, 542 of Multivariate Normal distribution, 465, 543 of Negative Binomial distribution, 59, 542 of Negative Exponential distribution, 69, 543 of Normal distribution, 65, 542 of Pareto distribution, 78 of Pascal distribution, 60 of Poisson distribution, 57, 542 of Raleigh distribution, 78 of sample range, 255 of Standard Normal distribution, 65
of t-distribution, 233 of Triangular distribution, 228 posterior, 318 prior, 315, 380 Product probability measures, 46 spaces, 4546 Q Quadratic form(s), 476, 504, 506 negative denite (semidenite), 477 positive denite (semidenite), 477 rank of a, 477 some theorems on, 477 Quantile, p-th, 99, 261 R Random variable(s) (r.v.(s)), 53 absolute moments of a, 107 absolutely continuous, 54 as a measurable function, 8283 Bernoulli (or Point Binomial), 56 Beta, 70 Binomial, 55 Cauchy, 72 central moment of a, 107 ch.f. of a, 138, 140 Chi-square, 69 completely correlated, 129 continuous, 5354 criteria of independence of, 164167 cumulative distribution function of a, 85 degenerate, 183 dependent, 164 discrete, 5355 discrete Uniform, 60 distribution function of a, 85 distribution of a, 53 expectation of a, 107108 functions of, 107108 Gamma, 66, 117 Geometric, 119, 542 Hypergeometric, 59, 119 independent, 178 linearly related, 129 Lognormal, 72 mathematical expectation of a, 107108 mean (or mean value) of a, 107108 m.g.f. of a, 138, 153, 158 moments of a, 107108 Negative Binomial, 59 Negative Exponential, 69 negatively correlated, 129 Normal, 65 normalization of a, 89 pairwise uncorrelated, 171 Poisson, 57 Poisson, truncated, 62
Index
569
positively correlated, 129 p.d.f. of a, 54 probability distribution function of a, 53 Standard Normal, 65 transformation of a, 216 uncorrelated, 129 Uniform, 60, 70 variance of a, 107 Random vector(s), 55 absolutely continuous, 55 as a measurable function, 8283 Bivariate Normal, 74 ch.f. of, 150 continuous, 55 discrete, 55 distribution (or probability distribution function) of, 55 distribution function of, 85 k-dimensional, 55 linear transformation of, 239 Multinomial, 60 Multiple Hypergeometric, 63 Multivariate (or k-variate) Normal, 463 orthogonal transformation of, 239240 p.d.f. of a, 55 transformation of, 216, 223 Range sample, 255 studentized, 256 Rao-Blackwell, 278 Rao-Blackwellization, 278 Rectangular distribution, 70 Recursive formula(s) for, 64 Binomial probabilites, 64 Hypergeometric probabilities, 64 Poisson probabilities, 64 Region(s) acceptance, 332 contidence, 397, 410 critical, 332 rejection, 332 Regression function(s) linear, 418 Regularity conditions, 297 Reliability (function), 91, 296, 312, 405 Risk average, 315 function, 313, 380 Row effect(s), 446, 450 S Sample(s) correlation coefcient, 472 mean, 445 median, 259 moment, 325 ordered, 35 point, 14 random, 263
range, 255 size, 35 space, 14 unordered, 35 Sampling sequential, 382 with replacement, 3536, 49, 82 without replacement, 3536, 4849, 59, 63, 82 Scalar, 499, 502 Scheff criterion, 459 Sequential analysis, 383 probability ratio test (SPRT), 388389 expected sample size, 393394 for Binomial distribution, 395 for Normal distribution, 396 optimality of, 393 with prescribed error probabilities, 392 procedures, 382 sampling, 383 Set(s) basic, 1 complement of, 1 decreasing sequence of, 5 difference of, 3 disjoint, 3 element of, 1 empty, 3 equal, 3 increasing sequence of, 5 inferior limit of a sequence of, 5 intersection of, 2 limit of a sequence of, 5 measure of a, 102 member of a, 1 monotone sequence of, 5 mutually disjoint, 3 of convergence of a sequence of r.v.s, 183 open, 102103 operations, 1 pairwise disjoint, 3 properties of operations on, 4 superior limit of a sequence of, 5 symmetric difference of, 3 union of, 2 universal, 1 Shift, 499 -additive, 15 -eld(s) Borel, 12 consequences of the denition of a, 10 dependent, 46 discrete, 10 examples of, 10 generated by, 11 independent, 46 induced by, 178 of events, 15 k-dimensional Borel, 13
570
Index
-eld(s) continued trivial, 10 two-dimensional Borel, 13 Sign test one-sample, 497 two-sample, 496 Signicantly different from zero, 459 Skewed, to the left (to the right), 121 Skewness, 120 of Binomial distribution, 121 of Negative Exponential distribution, 121 of Poisson distribution, 121 Space(s) measurable, 11 probability, 15 product probability, 4546 sample, 14 Standard deviation, 107, 109 Normal distribution, 65 Statistic(s), 263 complete, 292 m-dimensional, 263 minimal sufcient, 272 of uniformly minimum variance (UMV), 279 sufcient, 266, 270, 292 U-, 495 unbiased, 278 Stopping time, 382 Strong Law of Large Numbers (SLLNs), 198, 200 Studentized range, 256 Subadditive, 16 Subset, 1 proper, 1 Sub--elds independent, 46 Sufciency, 263264 denition of, 264 some basic results on, 264 Sufcient statistic(s), 266, 270, 282, 292 complete, 291 for Bernoulli distribution, 274 for Beta distribution, 273 for Bivariate Normal distribution, 274 for Cauchy distribution, 272 for Double Exponential distribution, 274 for Exponential distribution, 282 for Gamma distribution, 273 for Multinomial distribution, 270 for Multivariate Normal distribution, 469 for Negative Binomial distribution, 273 for Negative Exponential distribution, 273 for Normal distribution, 271 for Poisson distribution, 273 for Uniform distribution, 271 for Weibull distribution, 285 m-dimensional, 263 minimal, 272
Sums of squares between groups, 445 total, 440 within groups, 445 T Tables, 511 of critical values for Chi-square distribution, 529531 of critical values for F-distribution, 532541 of critical values for Students t-distribution, 526528 of the cumulative Binomial distribution, 511519 of the cumulative Normal distribution, 523 525 of the cumulative Poisson distribution, 520 522 t (Students)-distribution, 73, 233234 critical values of, 526528 expectation of, 239 graph of, 234 noncentral, 360, 364, 508 noncentrality parameter, 508 p.d.f. of, 234 variance of, 239 Test(s), 311 about mean(s) in Normal distribution(s), 339, 349, 355, 359360, 363364, 383384 about variance(s) in Normal distribution(s), 340, 350, 358359, 361363 Bayes, in Normal distribution, 384 chi-square, 377 consistent, 379 equal-tail, 359, 372 F-, 432 function, 331 goodness-of-t, 374 Kolmogorov one-sample, 491 Kolmogorov-Smirnov two-sample test, 493 level-, 333 level of signicance of a, 332 likelihood ratio (LR), 365, 367372 minimax in Binomial distribution, 385 minimax in Normal distribution, 384 most powerful (MP), 333, 338340 nonparametric, 490493 nonrandomized, 332 of independence in Bivariate Normal distribution, 470 one-sample Wilcoxon-Mann-Whitney, 495 power of a, 332 randomized, 331 rank, 493 rank sum, 495 relative asymptotic efciency of a, 497 sign, 496497 size of a, 332 statistical, 331
Index
571
two-sample Wilcoxon-Mann-Whitney, 495 unbiased, 353 uniformly most powerful (UMP), 333, 343, 345, 346350, 353, 357358 uniformly most powerful unbiased (UMPU), 353354, 357360, 362364 Testing hypothesis(-es), 331 about , 434 composite, 343, 345346, 353 decision-theoretic viewpoint of, 379 general concepts of, 331 in Binomial distribution, 337, 347, 355, 384 385 in Exponential family, 346, 354 in Normal distribution, 339340, 349350, 355, 358364, 383384 in Poisson distribution, 338, 348, 355 theory of, 331 under monotone likelihood ratio (MLR) property, 343, 345346 Testing, composite hypotheses, 343, 345346 simple hypotheses, 333334 Theorem(s) additive probability, 17 basic limit, 180 Basu, 277 Carathodory extension, 46 Central Limit (CLT), 189 Cochran, 477 De Moivre, 192 factorization, 165166 Fisher-Neyman factorization, 267 Fubini, 317 further limit, 202 Gauss-Markov, 423 Glivenko-Cantelli, 201 Lehmann-Scheff, 279 multiplicative probability, 22 P. Lvys continuity, 187 Rao-Blackwell, 278 Slutskys, 207 total probability, 23 uniqueness, 145, 151 Walds, 383 Tolerance interval(s), 413414 interpretation of, 414 Tolerance limits, 397 Transformation(s) invariance under monotone, 493 linear, 239244 of continuous r.v.s, 218224, 226237 of discrete r.v.s, 216218, 225 orthogonal, 239240 the multivariate case of, 223237 the univariate case of, 216222 Transitive relationship, 6 Type-I error, 332 probability of, 332 Type-II error, 332 probability of, 332
U U statistic, 495 Unbiasedness, 278, 286, 289 Unbiased statistic, 278 asymptotically, 489 unique, 279 Uniform distribution, 60, 70 ch.f. of, 150, 544 continuous, 70 discrete, 60 expectation of, 113, 543 graphs of, 60, 70 m.g.f. of, 161, 544 parameters of, 70 p.d.f. of, 60, 70, 544 variance of, 113, 543 Uniformly minimum variance unbiasedness, 279, 290 Uniformly minimum variance unbiased (UMVU) estimator(s) (estimate(s)), 290 291 in Binomial distribution, 292294, 296 in Bivariate Normal distribution, 296 in Gamma distribution, 305 in Geometric distribution, 297 in Negative Binomial distribution, 296 in Negative Exponential distribution, 296 in Normal distribution, 294295, 303305 in Poisson distribution, 294, 303 Uniformly minimum variance unbiased statistic(s), 279 in Binomial distribution, 279 in Negative Exponential distribution, 279280 in Normal distribution, 279 in Poisson distribution, 280 Uniformly most powerful (UMP) test(s), 333, 343, 345 in Binomial distribution, 347 in distributions with the MLR property, 343 in Exponential distributions, 345346 in Normal distribution, 349350, 358 in Poisson distribution, 348 Uniformly most powerful unbiased (UMPU) test(s), 353, 357 in Exponential distributions, 354 in Normal distributions, 355, 357360 in the presence of nuisance parameters, 357364 Uniform probability measure, 60 Union of sets, 2 V Variance, 107, 109 basic properties of, 111 covariance of a matrix of r.v.s, 418 interpretation of, 109
572
Index
Variance continued minimum, 289 of Beta distribution, 120, 543 of Binomial distribution, 114, 542 of Chi-square distribution, 118, 542 of Gamma distribution, 117, 542 of Geometric distribution, 119, 542 of Hypergeometric distribution, 119, 542 of Lognormal distribution, 120 of Negative Binomial distribution, 119, 542 of Negative Exponential distribution, 118, 543 of Normal distribution, 117, 543 of Poisson distribution, 115, 542 of Standard Normal distribution, 116, 542 of Uniform distribution, 113, 543 of Weibull distribution, 114 Vector(s), 499 components of a, 499 equal, 499 inner (scalar) product of, 499 linearly dependent, 501 linearly independent, 501 n-dimensional, 499 norm (or length) of a, 500
orthogonal (or perpendicular), 500 orthogonal (or perpendicular), to a subset of, 500 product by a scalar, 499 space(s), 499 dimension of a, 499 some theorems on, 501 spanning (or generating) a, 500 subspace(s), 500 orthocomplement of a, 501 transpose of a, 499 zero, 499 Venn diagram, 1 W Walds lemma for sequential analysis, 383 Weak Law of Large Numbers (WLLNs), 198200, 210214 generalized, 201 application to Chi-square, Negative Exponential and Poisson distributions of the, 202 Wilcoxon-Mann-Whitney, one-sample test, 498 two-sample test, 498

Roussas G A Course in Mathematical Statistics

Uploaded by

Copyright:

Available Formats

Roussas G A Course in Mathematical Statistics

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Roussas G A Course in Mathematical Statistics

Uploaded by

Copyright:

Available Formats

Contents

A Course in Mathematical Statistics

This Page Intentionally Left Blank

A Course in Mathematical Statistics

London Boston Sydney Tokyo Toronto

This book is printed on acid-free paper. Copyright 1997 by Academic Press

Printed in the United States of America 96 97 98 99 00 EB 9 8 7 6 5 4 3 2 1

To my wife and sons

This Page Intentionally Left Blank

Preface to the Second Edition xv Preface to the First Edition xviii

Basic Concepts of Set Theory 1

Some Probabilistic Concepts and Results 14

The Probability of Matchings 47 Exercises 52

On Random Variables and Their Distributions 53

Distribution Functions, Probability Densities, and Their Relationship 85

Moments of Random VariablesSome Moment and Probability Inequalities 106

Characteristic Functions, Moment Generating Functions and Related Theorems 138

Stochastic Independence with Some Applications 164

Basic Limit Theorems 180

Transformations of Random Variables and Random Vectors 212

Order Statistics and Related Theorems 245

Sufciency and Related Theorems 259

Point Estimation 284

Testing Hypotheses 327

13.2 13.3 13.4 13.5 13.6 13.7 13.8

Decision-Theoretic Viewpoint of Testing Hypotheses 375

Sequential Procedures 382

Condence RegionsTolerance Intervals 397

The General Linear Hypothesis 416

The Multivariate Normal Distribution 463

Quadratic Forms 476

Nonparametric Inference 485

Topics from Vector and Matrix Algebra 499

Noncentral t-, 2-, and F-Distributions

Noncentral x2-Distribution 508 Noncentral F-Distribution 509

Some Notation and Abbreviations

Answers to Selected Exercises

Preface to the Second Edition

Contents Preface to the Second Edition

Preface to the Second Contents Edition

Preface to the First Edition

Contents Preface to the First Edition

Contents Preface to the First Edition

1.1 Some Denitions and Notation

Basic Concepts of Set Theory

1.1 Some Denitions and Notation

1.1.1 Set Operations

1 Basic Concepts of Set Theory

2. The union of the sets Aj, j = 1, 2, . . . , n, to be denoted by

U A j = {s S ; s A j for at least one j = 1, 2, , n}.

U A j = {s S ; s A j for at least one j = 1, 2, }.

3. The intersection of the sets Aj, j = 1, 2, . . . , n, to be denoted by

I A j = {s S ; s A j for all j = 1, 2, , n}.

1.1 Some Denitions and Notation

4. The difference A1 A2 is dened by

5. The symmetric difference A1 A2 is dened by

1.1.2 Further Denitions and Notation

1 Basic Concepts of Set Theory

Properties of the Operations on Sets