This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
0 and therefore 0) < H(t).This implies S(w) < t and
PsoCP> PSz
o = 1
cP\302\253
ii>\302\253
-
p\037
_\302\253
Fromt 1.7we obtainthat) d Y H o Psipy dO' 9=&0)
iscontinuous on [0,(x].It followsthat there issomej E [0,(X] such that d
_
=
Ps
d8
9=90)
p,
Thisprovesthe assertion.
0)
:
for all (x, p E [0,1] there donotexisttests 13.2Remark. Let 90 E e.Ingeneral, = p. Hencethere neednot existtwocP E Y such that PsoCP= (x, dO' PalfJ 9
sidedS-testssatisfying IX
E
.. theseconditions. But for
d.
90
[0,1]there are two-sidedS-tests
Pc.= 90q>
IX,
d8P9q>)
cp* E
every
fF satisfying
80 E e and every
=0.)
8=80)
lemma choosing This followsfrom the preceding qJ =:
(X.)
13.3Lemma. Supposethat E isan exponential experimentofrank I. Let8 90
- 00< + k Sf ' (h ) a.e.
S-testsatisfying and letq>* be a two-sided k 1 e R, k2 e litsuch that
..-
cP
_
I if fa > k 1fao 2 90 {o if fa < k 1f90 + k 2 Sfao')
t1
\037
=+=
t2
<00.Then there are
v _
ProofWe have to show that there are kj E n, k 2 En, such that I if t > k'iebS + \"2SeIlS, _ (Ilv )_a.e. q> {0 if 1 < \"Ie\"s+ k'2 Se\"5, where b = .90 9 * O. the system of linearequations))) Case1:Assumethat '1< 2 , Consider
-
'
13.Two.sidedtesting for exponential experiments:Part 2
ebll + It ebll = I, It.eb/2 + k;12 ebl2 = 1 The system has a uniquesolution since) e'\" t 1 ebll ..12)(t 2 = el'111 D.= evIl) .. k't
65)
k\037
.)
-
I
12ebrz
t
I)
) > O.
The solution is)
- ( e - II') e ) I-D 1 .1t - -D(e e '2) 1
k'
t 2 bl2
bll
bl
2
lo
.)
we notethat sgn b sgnk\037. Then,there is no intervalwhere Moreover, g:t 1-+k'li\" + t eb, , I E R, \037
k\037
isconstant; in addition, the property) g'(t)(s t) 0 if g(l) g(s) that g isa quasi-concave function. Thisimplies that {g::::: of implies I}consists = at mosttwo elements and {g>1} (/ 1,/2) since{II'12} {g= 1}.Hence 1> k'ieb, + k\037tebl impliest < II or t> 12 , and 1
-
\037
\037
\037
The system has a uniquesolution since)
Ie .- be (:1 D'0 + t)e blo
CblO
blo
b10)
is) The solution
-1
(blo + l)eb'O, k'i ::::: D) k'z
=
1
be'\"\302\260.
D)))
= e2b'O(bto +1
-bl > o)
o.)
Chaptcr2:Elementary Theory of TestingHypotheses)
66
notethat sgn b * sgn and argue as in case1 : h'. t k'I e'\" + k' ((I' t E IR ,) isa quasi-concave Thusa function,and there isno intervalwhereh isconstant. localextremumof h isa strictglobalmaximum,and from h(to) = 1,h'(1o)= 0 and h\" (/ 0) t' 0 we get that 1> k 1 e + kiteblis equivalent to t * 10'This provesthe assertion. 0)
2'
We
k\037
\037
bl
13.4Theorem.Supposethat E is an exponential experimentof rank I. Let 90 e andcp .'F.If cp* E.'Fis a two-sided S-testsatisfying \342\202\254
\342\202\254
= Psocp. d p, * do sCP I}'
PSolp,)
-
= d
df:)
9\03790
P\037cP
9\03790')
then)
Pscp.2:PsCP if 9 * 90 , classof testsfor (H,K).) S-Iestsisa complete Thus, the setof alltwo-sided
'
S-testwith t l = -00.Letfo.=fso ProofCase1:Assumethat cp* isa two-sided and fl'= Sj\037. We observe,that lp* isan upperS-testand from Theorems(11.6) i t follows that is a N P-test the for (!0'!1) in senseof cp* generalized (10.4) The same is true of cp, and cp* and cp coincide Definition(10.2). (hv)-a,e,on {ft * t 2fo}.Hencecp is(hv)-equivalent to an upperS-testand from (9.9)(2) it followsthat the power functionsof cp and cp* coincide. is provedsimilarly. Case2:If t 2 + 00,then the assertion there Case3:Assumethat 00< t l t 2 <00.Let 9 * .90 , By Lemma(13.3) are k I E !R, k 2 E IR, suchthat
::
* cp
1 {o
=
if if
-
\037
fs>klfso+k2 Sfso. (hv)-a.e. fs < ktfSo+ k 2 Sfso'
we obtain From(10.3)
Pscp.
\037
PsCP if
9 =F 90 ,
0)
13.5CoroUary.Supposethat E isan exponential experimento.frankl.lfvalue
at a pointof e S-testscoincide andslopeof the powerfunctionsof two two-sided on S-testsare admissible then they coincide Moreover,two-sided for (H,K).)
e.
is an exponential experimentof rank I. Let = Assume that cp.E '\037a(H, K) {90},K {.9:[) .90}.
13.6Corollary.Supposethat (1.E
[0,1],80 E
\342\202\254o),
and H =
is a two-sided S-test.Then)))
E
=1=
13.Two-sidedlesling for exponcnlial cxperiments:Part 2 P\037tp*
= sup{Pscp: cpE .rp;a.(H, K)} if 9 =f 90
67)
,)
= 0 sincethe power K) satisfies !Fa.(H. PsoCP= (I.\037 Ps'P 3=80) has a localminimumat 90 , 0
ProofEvery
cp E
13.7Corollary.SupposethaI E is an exponential experiment01rank I. LeI (X
E
[0,1],90 E e, and H = {.90},K = {.9:9 .90}.If a lestcp E !Fa.(H,K) i.'i =4=
K) at a single optimalin S;a.(H, poill/.9 =t: .90 then it is uniformly optimalin \037a.(H, K).)
the assertion istrivial in case = 0 or = 1.Let ProofSinceE ishomogeneous E (0,1), Further let cp E !F,AH, K) and 9 E K be the pointwhere cp is optimal. a two-sided i .e. E be S-test, cp. :Fa.(H, K) I jf S < t 1 or S> t 2' v-a.e. . cp = {o If t 1 < S < t 2 . (X
(X
(X
.
-
'
(0,1),Lemma 9.7 implies 00< 'I :::::; 2 < + oc. lienee,Lemma 13.3 k l E 1R, k 2 E !R such that) givesconstants As
(X
E
* cp
- {0 _ I
This shows that
if
I> k1/80+ k 2 S/80
if f< kd8.0+ k 2 Sfso ' tp*
is a generalizedN P-testfor
(j\037o'
Sf90;
j\037).
From the
with tp* optimalityof cp it followsby Theorems10.4and 13.4that cp coincides v-a.e.on {Is k1fso + k2Sj\037}.Accordingto the proofof Lemma (13.3) the and coincide v-a.e. where t S t teststp S 1 and tp* 2' Thus,tp isa two-sided S-testand thereforeuniformlyoptimalin (H,K). :f=
=+=
=+=
0)))
!F\302\253
Chapter3: Binary Experiments)
The power and simplicityof the lemma of Neyman and Pearsongives riseto the development This theory is a of a general theory of binary experiments.
caseofthe generaldecision seemsto simple special theory,but itsisolation in severalrespects. beadvantageous Generaldecision o n relies theory powerful In contrast,the theory of binary experiinstruments of functionalanalysis. ments can be basedexclusivelyon the lemma of Neyman and Pearson.A betweenexperiments, the so-caHed decision-theoreticaHy meaningfuldistance deficiency,is easy to handlefor binary experiments. In Section 14we definethe errorfunction of a binary experiment. Section 15 containsthe discussion of the natural semi-ordering of the classof binary In particular. we show it can be expressed experiments. by the pointwise The topological structureis treatedsimilarly, orderingof errorfunctions. and convergence of binary experiments Finally,it is provedthat semiordering can alsobe expressed functions o f by power optimallevel-oc-tests. Sections 16and 17 arc concerned with equivalence classesof binary experiments and their characterization. It turns out that besides the errorfunction boththe distribution of the likelihood ratioand itsMellintransform determine A the equivalence classes iscompactness of the spaceof uniquely. consequence binary experiments. It is convenient to introduceat this point the conceptof contiguous of probabilitymeasures. theseare sequences of binary sequences Essentially, The whoseaccumulation experiments. experiments pointsare homogeneous essential in Section 18. facts are presented the of 3 is Theconcept ofcontiguity is whole well-known. Practically chapter very
dueto LeCam[1960].)
14.The error function) Consider a binary experimentE = (D,.9I, (P,
Q\302\273.)
14.1Definition.The errorfunctionof the binary experimentE is the function g:[0,1] [0,t] which is definedby g(oc)= inf [(1 oc)Pcp+ ocQ(1 cp)]t oc E COt 1].
-.
-
-
.F\037
00 we definefor reasons In the followingassertion ofconvenience: = 1.The t +00)))
14.The error function
69)
to Q and of Q with respect to Pare ofP with respect Lebesgue decompositions denotedby and M) (\037; . N).) (\037\037.
14.2Theorem.Let g be the errorfunction of E. if 0 :5k \037.
areequivalent: e:F then the followingassertions
(1)
\037.
(2)
g(IX) = (1
E
'\302\245J.;(P,
-
Q) for
\037
IX, 0
\037
IX
\037
- - 1.
= 1
k
-
<X
+ exQ(l
ex) p\037.
\037.).)
Proof (1) (2):If k = 0 then Q\037* = 1andtherefore \037
+
C 0) Pcp\" C 0) Q(I \037
-
= o.)
rp\")
\037
On the otherhand we have)
g
C ) \037o
=g(l)
Q(I-cp)
\037
O.)
\037
:\037\037
If k = 00then p\037. = 0 and therefore
C:'00)
Pcp\"+
C:00) Q(I-rp*)=
O.)
On the otherhand we have)
1 g 1+ 00 = g(O) = inf ( )
-.
P\037
= O.
tPE\037)
Let 0 < k ex
<00and =
1
l+k For any iF we have dQ dQ J dp dP+ M'r-.N' J (l-IX)-IXdP 1 [ IX
\037dP
(1-
+ ex! = (1
-
\037)dQ
IX)
The infimum isattainedfor
1 if \037.
\037E
=
0 if
+
(1- L ex)
P
Denote 11'= {Ps:9 E e}.Let QoE C(1I')besuch that Q() '\" We (1) (3): = Ll (a,do,Qo)' Let may chooseL(E)= Ll (n,.9I,Qo) and L(EI..#o) M1: L,(0.,do,Qo) -+ L,(0.,d, Qo) be the operatorsuch that for every classf E L.(n.sfo.Qo) the value M1f is the corresponding Qo.equivalence class Qo).Note that the functionsin MIl are doequivalence in Lt (Q,.PI, where 0 denotes the Qo-completion measurable of 0 in It isobviousthat . . to sh ow t h at M dPsl.PIo = dPsl.PI . h It remams MIlSa stocastlc operator. 1
e.
9.
\037rd
\037\037
See.Thisfollowsfrom 20.6where for every measurable e. 0 for every
/1 E
\037rd.
(dQoldo )
it
isshownthat
dQol\037rd
is.ii0-
:PsII\037: Qo)
24.14Remark. Suppose that E = (Q,.rd,9')isa dominated experimentand let il be the 9-completion of .PI.Define E = (Q,.ii, Then it is obviousthat 9). of E.On the otherhand we notethat EI.9I= E and henceE isa randomization d isE-suflicient. HenceTheorem24.13 that E isa randomization of E.) implies
24.15Theorem.Supposethat E = (n,.91,{Ps:.9 E e})is a dominated experiment and T:(a,.PI)-+ (at>.PI.)is a measurablemapping. Then the following assertions areequivalent: (1) T is E-sufficient. (2) (3)
T.E. E?: E IS a randomization
017;.E.)
The further argumentsrely ProofTheequivalence (1) (2) followsfrom 22.4. 1 on Lemma 23.5which impliesthat '4E and EIT- (.PI.)are mutual randomiwe obtainthat (1)isequivalentwith zationsofeach other.From Theorem24.13 I of EI T- (dI)' Sincethe relation of beinga the fact that E is a randomization of T.E. is transitive it followsthat E is a randomization randomization that a E randomization anotherapplication of transitivity shows is Conversely, of T.E.This implies of EIT-1 (d1) if it is a randomization (1). 0) \037
to hasan immediategeneralization Theimplication (3) => (2) ofTheorem24.13 arbitrary pairsofdominated experiments.)))
25.Slatistical isomorphism
109)
24.16Theorem.If a dominated experime\"tFe 8(e)is a randomizationof a dominated Ee then E f F. experiment 8(e) Proof.DenoteE= (DI\"SIIt., {\037: ge e})and F= (Q2\"\0372' {Qs:Be e}).Let If M.:L(E) L(F) be a transitionsuch that MI = Qs,9 E d let the be Let M2 be the classin M fP e :IF (Q2' 2) corresponding Markov operator which isdual to Mt.Then for tp e M2 ip, 0 tp 1,we have = QsCP= QsfP,ge 0) Pst#' = Ps(M 2cp) = (MIPs)(cp)
-.
e.
\037
\037
(\302\243).
e.
\037
\037
of the preceding isnotvalid.The orderstructure which Theconverse assertion
of' doesnotcoincide with the is definedby the relation\"is a randomization of the former order orderstructure A decisiontheoretic interpretation in Chapter9. However, both order structureis possibleand is established relation. Thisis provedfordominated structures inducethe same equivalence \037.
in the followingsection.) experiments
24.17Remark. Finally, we notethat Theorem(23.9)remains valid if the that Fisa randomizof exhaustivityisreplacedby the assumption assumption ationofE.Forprovingthis,repeatthe proofof Theorem(23.9)usinga pairof insteadof the kernel K.) operators
25.Statisticalisomorphism) 15.1DefinitiOD. Two dominatedexperiments in See)are statistically isomor-
of the other.) phicif each is a randomization
Example.If E = (D,.91, {P,9:9 e e})is an experimentand .91 0 d is a sub-a-field then E and EI.91 iff E 0 are statistically EI..9I isomorphic o.Thisis a consequence of Theorem24.13. 2\037.2
\037
'\"'\"
2)
shallprovein thissectionthat two dominatedexperiments E and Fare iff E.-F. This resultis a particularcaseof the statistically isomorphic 2 randomization criterion which is provedin full generalityin section 55.First, we consider finite experiments.) We
25.3Definition(Blackwell[1951]). Let e be a finite setand = E (D,..91, Then) {Ps:9 E 8})an experiment. 2: p. Pa )Sf9 a.9 ) ((d!: d\037
a\302\243:=!R
fJ
fJE6)
is the standardmeasureof
E.)))
1to
Chapter4: Sufficiency.Exhaustivity
and Randomizations)
25.4Theorem(Blackwell[1951]). l.ete beafmitesetand E, FE Bee).Then F isa randomizationofE iff thereexistsa stochastic kernelK:58x \037(58)-+ [0,1] satisfying thefollowingconditions: (1) JA(y)K(x,dY)=A(X),xeS8,9Ee. (2)
tJF.(A)
= J K(x,A)tJF(dx),
A
E \037(S9).)
9 E e}) is a randomizationof Proof Assume that F = (U2 , d2'{Qs.: = E (Ul , d'l' {P\037:.9E e}).For E and F we define the so-called standard experiments)
1;.=(S9'\037(S9)'{AUF.: 9 E e}), and 1;'=(S8'91(59), {AUF:9 E e}),) Let)
d
Ps. Tt:Wtl---t. d
(
7\"2:
W2 I---t
.
)h8,
-(Wt)
L P(I (1.9) Q9
(d I:Q(I .\037
(IE 9)
(W 2
\302\273
)h9,
Wt E
W2 E
1;
{It,) U2 .
1;.. 1;..
ThenTt isE-sufficicnt, isF-sufficicntand Es = F.It follows E, = E F is a that is a randomization of Ej. By assumption from Theorem24.15 randomizationE, and by Example 23.4(3) and Theorem 24.11,f; is a of F. It followsthat F's is a randomization of Es and Theorem randomization f\037
24.12implies, that Es iseven exhaustivefor F's.Hence, there existsa stochastic kernel M:S9x \037(S9)-+ [0,1]suchthat J [JsduF = J M(.,A)PsduE , A E \037(S9)' 9 E
e.
A)
be the probability measure which is definedby Let JlI6V(S9)x !M(S9) p(A t xA 2)= J
;=1,2.
M(x,A2)uE(dx),AiE\037(S8)'
AI)
kernel suchthat Let K:S9x \037(S8)-+ [0,1]be a stochastic p(A t x A 2) = J
K(x,AI) p(dx.S9)
.042)
= J K(x,At)uF(dx), AjE \037(S9)' i =
1,2.
A2)
It
is obviousthat
K satisfies we have) condition (2).Moreover,
JAduF = J M(..A)AduE = AJ \037dp
A
= JJ A(Y) K(.,dy)dut\" A)))
25.Statistical isomorphism
111)
for 8 e e and every A 2 E \037(S9)' Eventually improvingK ona setof\",-mcasure zeroyieldsa kernel satisfying condition (1). in t his reversed order yieldsthe proofof the converse. 0) Repeating proof
of potentialtheory we have obtainedthat F is a Usingthe terminology randomization ofE iff is a dilationof U\"\
(1\302\243
25.5Corollary.Let
e be a finiteset and E.FE 8(e).Then E and Fare
isomorphic iJJ = UF') statistically UE;
Let us apply Theorem isomorphic. ProofAssumethat E and F are statistically For Z E S'rthe function (5.19). (X')'ET 1-+ n x:',(x,),\037TEST, 'f!T)
'1'::
isconcave. Since is a dilationof UF (1\302\243
we have)
H(UE) :\":' J tp:dUf = JJ tp:(y)K(x,dy) uF(dx)
Jtpz{JyK(x, (1p(dx) = J tp:du,.. = H(uF). Sincealso(1F is a dilationof (1E we have \037
=
dy\302\273
H\302\253(1F)
\037
H(UE) which
implies
H\302\253(1E)
H\302\253(1,..).
Then with the notationof the proofof Assume conversely, that uE = (1,... = and F and are Theorem25.4we have Es Sinceboth E and it followsthat E and F are statistically statistically isomorphic isomorphic, f\037.
too.
l:.\037,
f\037
0)
can be expressed in terms of the likelihood Statistical isomorphism processes. Let E=(Ql,.w'l,{p e}).Then dPa s Ee}) and F= (Q2,.w'2,{Qs:8e
(dP.S) dQa and are the likelihood of E and F with base9. processes (dQs)aE9)
a\0379
25.6Corollary.Let e be a finite set and E, FE 8(e).Then E and Fare
statistically isomorphic iff)
dQ !1' Ps - !1' ((dPs)af!9 ) ((dQs) dPa
a
Sf!9)
Qs
)
for every 9 E e.) Thenwe have UE = (IF' ProofAssumethat E and Farestatistically isomorphic. Let .9 E e and Z E S8such that Zs * O. Easy computations yield)))
112
Chapter 4: Sufficiency,E'l:hauSlivity Zl>
d\037
J I}s
( ) d\037
and Randomizations)
dQ dPs= H(uF.)(Z) = H(uF) (Z) = J }Js
Zl>
(dQ:)
dQs.)
of Theorem5.13provesonepart of the assertion. For the other application part we notethat)
An
dPtI dPs
dP(1
d L.
1+ L '4-a
,.s)
\037
and)
dPs d L. fE9)
Ps-a.e.if
(1 9,) \037
d\037
dPs)
-
\037
1 1+ L dPr ,*sdPs)
\037-a.e.)
Sincea similarrelationholdswith P replacedby Q, it followsfrom the that) assumption,
dQtI _ 1'. !I'((d dP Qs) S - !I' tlE9 :L )tlE9 ) d-:L ) (( Q, ) t69) u9) for all 9 e the assertion = for every 9 e. Adding theseequalities tI
Pr
E
follows.
E
(1\302\243
UF
0)
Now, we are in the experiments.)
criterionfor finite positionto provethe randomization
25.7Theorem.Let e be a finite .<jet and E,FE 8(e). Then E and Fare F. statistically isomorphic iff E ..... 2)
is a consequence of Theorem24.16. Assume ProofOnepart of the assertion that) converselythat E 2' F. Let mE 59'Theorem22.5implies a
I
for all
8
I
a,bE lit Let
Po
= 1 I
=
-
L Ptl + b <1e9) L m tl Ptl ae9
e
_181L a
QtI + b L mtlQtI <168 aE8)
Pa. PI = I a\0379
m(1 Pt/' a\0379
Qo=
1
fer
a\0379
Q\",Ql
ofTheorem(22.5) Another application yields(Po,PI),... 2 (Qo,QI)' a69m\" Q\". FromCorollary16.5we obtain) \037
dQl !I'(dPt Po =!I' dPo ) (dQo ) Qo)))
25.Statistical isomorphism which implies
fi'
(
=
-
m..-.!!!:\037
\037
8T9 d L a,,9) \037
\037
I
\037
I
\037
a\0379
113)
p.
)
f1
1 !I'(Se9 L m9 dQs lel Lf;9 Qa . ) 'd!:Qa f1
aE9)
Thisis valid forevery mE Sf) and thereforeit followseasily that
25.5. by Corollary provesthe assertion
u\302\243
=
UF'
This
0)
is a littlebitmoreinvolved.) The caseof arbitrary dominated experiments Then E 25.8Theorem.Supposethat E.FESee)are dominated experiments.
andF are statistically isomorphic iff E '\"F. 2)
is a consequence of Theorem24.t 6. Proof Again) onepart of the assertion '\" Assumingthat E 2 F it followsfrom Theorem22.5that the mappingPs H Qs definesa linearis0metry betweenspan{P8: 9 E e}and span{Qs:9 E e}.It can thereforebeextendedto a linear isometrybetween\037{Ps:9 E e} and \037 {Qs:9 E e}.Let Po E C(&')such that Po\"'\" {P8: 9 E e}and let Qobe the image of Po under the isometrydefinedabove.Another application of Theorem22.5 that) implies
(QI>\037\"I>
We
{P8: 9E ev{Q}}) 2'(02,.912, {Qs:9E ev{Q}}).)
obtainfrom Corollary25.6that)
dQs dPs !I'((dPo !I' P.0 _ )Su ) ((dQo)Sea Q ) on for every (8) and henceeven for = e. Denotethisdistribution 0)
C(E A
(X
In it followsthat Qo\"'\"{Qs: 9 E 8}.Now, we define @ Se9oSi(IR+)by /1. particular
the experiment)
G=
(\037!, @ &fI(R...),{AJl:Be
lh9)
e}).
Let)
TI : WI H
dP8
(d)10(WI)) . dQs. (dQo (llJ2))868),
WI E
QI')
(1)2E
O2
S\0379
T2:llJ2
\037
,)))
114
Chapler4: Sufficiency.Exhauslivity
and Randomizalions)
7i..!:: ..1-'.
= (j = 72 Thenwe have Moreover. by Lemma20.6the mappings Tt = E and and T2 are E- and F-sufficient. Theorem 24.15 E are G Hence,by TI.. = and F and F G are also statistically statistically isomorphic. isomorphic. T2,. Thisprovesthat E and F are statistically isomorphic. n)
25.9Corollary.Two dominated experimentsE= (Ql..!31., {Ps:ge e})and F = (.Q2'.!31 9 E e})arestatistically 2 . {Qs: isomorphic iff)
)...p.) !R(( =
!R((
.
\037\0371
\037\037
Q.),
ge e)
Then Corollary25.6 Proof.Assumethat E and F are statistically isomorphic. that implies
!R((
L.p.)
\037
\037\037
!R((
\037\037:
L.Q.} 9E e,) e.
for every ex e A (8) and hence even for ex = If converselythe condition is satisfiedthen it followsfrom Corollary25.6 A glance at Theorems are statistically that all finite subexperiments isomorphic. 25.8and 22.5showsthat in thiscase\037ven E and F are isomorphic. 0)
to dominatedexperiThe methodof the proofof Theorem25.8isrestricted a mentssinceit restson a particular construction of \"standardexperiment\"on For arbitrary experiments thisconstruction is not possibleand rather to provesimilarresults. differentmethodshave to bedeveloped Thisisdonein Chapters8 and IR\037.
9.)))
Chapter5: ExponentialExperiments)
The objectof the presentchapteris to providethe most importantfacts
the testingof linear functionson Gaussianshift experiments. concerning to give elementary Admittedly. for one-sided testingproblemsit is possible proofsof the basicfacts,usingonly the Neyman-Pearsonlemma. But for two-
sidedtestingproblemsthe mostconvenientway runs over the theory of conditional testsfor exponenlial However,we discuss experiments. exponential for to that our extent asis indispensable purposes. experiments only Section26 containsthe basicfacts on exponential such as experiments with respectto a one-dimensiona reductionby sufficiencyand decomposition into a of of rank 1.In Section 27 mixture experiments parameter exponential is usedto developsometheory of conditional tests.The thisdecomposition resultsobtainedthere are appliedto Gaussianshift experiments in Section 28. The contentof Chapter5 isa purely classical oneand itspresentation goes A much moredetailed discussion of the back to the bookof Lehmann [1959]. is offeredby Wilting [1985].) testsand itsapplications theory of conditional
26.Basicfacts) 26.1Definition.Let (D,d, v) be a (i-finitemeasure spaceand let (-0) R be openand convex.An experimentE = (D,d, {P\037I..w': [) E e}) is an exponential II
\037
experimentif)
dP. =
dt C(9)hexp
where h:Q -+ IR and S:Q
\302\2539,
-
S\302\273,
R\"
[) e e,)
are .\037-measurable functions.)
From Theorem By definition every exponential experimentis homogeneous. 20.9it followsthat the mappingS isE-sufficient. Hence,by Corollary22.4,we
E '\"E. For the analysisof testingproblems is thereforesufficientto S. consider E insteadof have
it
S;
E.)
26.2Remark. Supposethat E = (Q, .9 E (:o)}) is an exponential experiment.Let ,tV 0 s:; bethe (i-fieldwhich is inducedby S.Since..c{ is E-sufficient 0 there existsa Borelfunction hi:R k -+ such .\037,
{P..\037:
.\037
\037
that)))
116
Chaptcr 5:Exponential Experiments) dP91,\037o=
dvldo
C(8)hl oSexp\302\2538,S\302\273, 8E e.)
If we denoteJl :=hi'V 0 S-I then we obtain) d\037(SI P.) 9 (t) = d/l
C(8)exp\302\2538,t\302\273,
te
IR\\
8e
e.
HenceS.E = (IRk, ar, {.P(SI P,9):8 E e})is an exponential experiment.
26.3Definition.An exponentialexperiment E = (IRk,
ducedif)
dP9 dv
(1) =
C(8)exp
\302\2538,
t\302\273,
t
E
IRJt,
\037k,
8E {P,9:
e}) IS re-
8 E e.)
26.4Theorem.A reducedexpo1lemial 9 E e})is comexperimem(IRk, fH\", {P,9: plete,i.e.: lfg: -+ iii isa Borelfunction satisfying Psigi<00and Psg= Ofor = every 8e e.then g 0 v-a.e. IR\"
followsfrom Theorem5.7. ProofThe assertion
0)
26.SCoronary.If E isan arbitrary exponential experimemof the form of 26.1 which on S is uniquely then every non-randomizedcritical function only depends determinedby itspowerfunction.) and thereforeevery critical Proof The reducedexperimentS.E is complete E is its determined uniquely by power function.FromTheorem S. 24.15it followsthat E is a randomi7.ationof S.E. If tp = qJ 0 SE fF (Q,d) is and has the same non-randomized then q> e (IRk.\037)is non-randomized power function for S.E as tp has for E. By Remark 24.17tp is uniquely determined by itspower function. 0) functionfor
\037
of which involve onesinglecoordinate Sincewe consider only testingproblems 9 E e and treat the othercoordinates as nuisanceparametersit will be of e tochangeournotation.In the followingwe write the elements convenient [} of as pairs(8,t') where 8 E IR and t' E \037A-t. Let us callthe first coordinate l' the nuisance (9.t) E e the structural parameter and the secondcoordinate With of parameter. thisnotationthe densities a reducedexponential experiment can be written as)
d::.(x. t
y) =
C(8,t') e9 e
IRA:
-1,(8,t) E
e.
The following is the basic decomposition theoremfor exponential experiments.)))
26.Basicfacts
117)
26.6Theorem.Supposethat E = (IRk, fMI', {P9.r : (8,t) E e}) is a reducedexin the (8,t) E e} can be decomposed ponentialexperiment. Then &' = {p$.r:
followingway:
Thereare Markov kernels &I\037 x \037Ic-I, 8E pr 1 (e),and probability measures
G$,rl\302\243r
-1,(9,t) E e,satisfying the relation P$,r(A)= J f9(A);y) Gs,r(dy),
for every A E \037, (8,r) E a, such that the experiment(!ii,&f, (1)for every YE {&(.,y):9E prl(e)})is a re\037Ie-I
ducedexponential experimentof rank 1,and 8 (2) for every E e the experiment(IR\" I,\037\" I, {GS.r : experiment.) exponential
-
!e E
9
})is a reduced
function Proof There is a probabilitymeasure PI\037k and a \037-measurable
h:R x IRk-I
IR+
Ps.r(A) =
such that)
C(9,1:)J eS.-.:+(r.y) hex,y) P(dx,dy) A)
forA E !!lie, (9,t) E
e.Takefor examplesome(80 to) e and definep:=PSo.ro' ,
E
easure PI\037k can be decomposed The probabilitym by a regular conditional k -1
probabilityQIR x.tJIsuch that
peA) = J Q(y,AY) Po (dy),
A E
8Ik
,)
where Po = Plar-t x IR. It followsthat for every A f9,r(A) =
E
rJr and every (.9,'t) E
e
Sx C(9,'t) Rle-. J J e e(r.) hex,y) Q(y,dx)Po(dy) . y
A\"
Let us define k
(y, 8):=J eS}Ihex,y) Q(y,dx),(y, .9)E IRk -I X pr.(8). R)
It isobviousthat for every 9 E prde) we have Po{ye (Rk -I:k (y, 9) = oo}= O. Thisimplies that A{.ge prl (8):key,9) = oo}= 0 for Po-almost every ye R\"-I. is an However, prl(e)is an open interval and {.gepr.(e):k(y,9)<00} -} interval for every y E HI.-I.This implies that for Po-almost every y E [Rk the set{.9E pr}(8):key,9) = oo}= 0. We may thereforechangethe kernel Q in such a way that k (y, .9)< 00 for every Y E -I and every .9 e pr.(e). Let yE \037k-l be fixedand assume that key,91) = 0 for some91 E pr1(e).It follows that h(.,y)= 0 Q(y,.)-a.e.and thereforek(y,9) = 0 for every 9E pr.ce).Hencewe obtainthat for every YE IRk-I the function 9.-k(y,9) eitheris positiveor vanishesidentically. Let M= {yelRk-l:k(y,.)=O}. It is clearthat Mefif\"-I.We define for BEprl (8)and Be IR\"
iN)))
118
Chapter 5:Exponential Experiments)
Q(y,dx), y;M, k(;,8)!eSXh(x,y)
\037(B,y):=
and F;I!\302\245
&(B,y) = &(B,Yo) for some fixed Yo;M if ye M. Then x IRk-I,8 E prl (8), satisfies (1).For (8,t) E e and Be \037-Iwe define G9,,(B)= C(8,t) f e:be
Obviously, (2). Gs.,I\302\243lt-l, (8,t) E e, satisfies followsfrom) The remainingassertion P9.r (A) = C(9,t) f eb e
=
C(9,t) R\"-I,t>' J J e9xe
=
C(9,t) M')J F;(A',y)k(y,9)e
=
C(9,t) f J<$(AY, y) key,9)e
=
C(9,t) f f;(A',y) f eS h(x,y) Q(y,dx)e
R)
=
C(9,t) J \037(A', y) eSx e
=f
f;(A'.y) G9,r(dy), A E !JIk,(9,t) E
e.
0)
It is importantto note that the measures Gs.r , (9,t) E e, are necessarily pairwiseequivalent. of the kind provedin Theorem26.6it is immediate Given a decomposition = X that Gs,rl\037-l P9,rl R \037k-l and that y 1--+&(A',y), ye IRk-I,isa versionof that this conthe conditional probabilityof Ps,r given Pi -I. It is essential of the nuisance ditionalprobabilityis independent parameter t.)
26.7Remark. Supposethat E = (D,.9I, (.9,t) E en is an exponential {Ps.r: a If we denoteS..E Then E reduced experiment. experiment. S. is exponential = (HI:, for every A E 1r 1r,{Q9.,: (8,t) E e})then Theorem26.6implies Qs.r(A)= f f;(A',y) Gs,r(dy),(9,t) E e, which means in terms of E that) A} = \037,r{SE
It followsthat
)
I Fj(A',y)2'(SIPs (dx,dy).
Ale
,...,
...,
s\\ (82 , Ps.r(S A 182 Sk}= Ps(ASz..... which doesnotdependon the nuisance parameter \342\202\254
t.)))
S.\302\273
27.Conditional tcsts
119)
26.8Lemma. Supposethat E is an exponentialexperiment and let cP E:F(a,d). Then E is continuousand for every t E prz(e) the function 9 PS.rCPisdifferentiableon 9'with derivative t---+
i)
=
:19PS.rCP9=90)
U
p9o.r (S.cp)
- PSo.r(S\\)p . (cp). 9o r
followsfrom Lemmas 5.6and 11.5. ProofThe assertion
0)
26.9Corollary.Supposethat E is a reducedexponentialexperiment and on e80 then letip E F (R\".aI\.")If t !',go. r cP is constant t---+
=
!o
U.:1Ps\"cP9=90
J:
9 fS(cp,y) 9=90)Gso,,(dy),
Proof Let \037o.rCP = ex, t E elJo. Then it followsthat F9o(cply) = ex, G9o.r-a.e., (90 , t) E We obtainthat
e.
a J U 9-.&(cp,y) \037
Gso.,(dy)
-
S=lJo
= J F9o(cp id,y) G9o.r(dy) ex J FlJo(id,y) G9o,,(dy) = P9o,,(cpid) exP 9o.,(id).
-
Thisprovesthe assertion.
0)
27.Conditionaltests) Supposethat E = (A\", experi{PS.r:(9,T) E e})is a reducedexponential ment.Let 90 E prt (9).We will consider two kindsof testingproblems: Onesidt:dtestingproblems, which are of the fonn) H = {(9,T) E 9 90, T arbitrary), K = {(9,t) E 8:8> 80't arbitrary},) \037\",
e:
\037
and two-sided testingproblemsof the fonn H = {(9,t) E 9 = 90't arbitrary},
e: K = {(8,T) e e:8
=+=
27.1Definition.A testcp E 1 if
80't arbitrary}.) is a conditional (H\",\037) upper testjf
\037
x,Y ) = 0 I.f x>t(y), x
120
Chapter 5:Exponential Experiments)
As we shallsee,conditional for optimal uppertestsare propercandidates testsof one-sided testingproblems(H,K).)
27.2Lemma. Supposethat (H,K) isa onesidedtestingproblem.A conditional K) respectivelyin K) iff it satisfies upper testlp E !F(R , &r) is in = a Gso.r-a.e., rE eSo .F;o(lp(.,y),y) Ie
:F\302\253(H.
!F\302\253$(H.
.)
:F:(H,10.Then P80.rlp= a,'t' E eso. Then onepart of foUowsfrom Theorems the assertion 26.6and 26.4.Assumingconverselythat w e the condition issatisfied choose1p(x,y) = a,(x,y) E R i. ThenCorollary9.8 Proof.Assumethat
E
lp
that implies .&(lp(.,y),y)
if 9 80 , a .e.,t E eso,) .F;(lp(.,y),y)a if 9> 90 ,) GSo,r\037
IX
\037
\037
which provesthe assertion.
0)
that (H,K) isa one-sidR.dtestin\037 problem. 27.3Lemma. Suppose Thenfor every E [0,1] there is a conditional E lest upper lp Yo.(1/,10.) IX
ofTheorem26.6.Let (t\\"E") Proof.Recallthe decomposition
R
\037
R
bedenseand
define)
00),y) a, n EN},Y ERie 1. It is obviousthat I: R\" -1-+ A is a Borelfunction.Moreover,it is easily seen t(y):=inf{t\":
.F;o\302\253(t\",
that
&o\302\253t(y),oo),y)
\037
showsthat the test)
IX
\037
and F90(Lt(y),\037),y) \037
IX.
Now standardreasoning
I if x> t(y), (x,y)eR, {0 if x
<'P\302\253(x,y)=
27.4Theorem.Supposethat (H,K) is a one-sidedtestingproblem.If cp.E fFa.(H,K) is a conditional upper test then lp* is uniformly optimalin K),) :Fo.$(ll, Proof.Let lp E fF:(H,10be arbitrary. Then P90,rlp = a for every (90'r) E Theorems26.4and 26.6we obtain Combining
e
e.
t E 90. J lp(x,y) F80(dx l y) = ex Gso,r-a.c., The same assertion holdsfor lp*.Hencethere is M R\"-1such that G90.r (M) = 1,'t' E So, and)))
e
\037
27.Conditional tests
121)
= J q>(X,Y)I:\037(dx,y)= ct on M. J ip*(X'Y)\037o(dx,y) Sinceq>*(.,y)is an upperid-testfor every fixed YE IRJ.-lit followsfrom Corollary9.8and Remark 9.9that J q>* (x,y) l\037(dx, y)
J q>(x,y) Fs(dx,y)
\037
Thisimplies PS,fcp.
\037
PS,fq>
if
9\037
90 , (9,t)E
9 90,
if
\037
e.
y EM.
0)
27.5Corollary,Supposethat (ll,K) is a one-sidedtestingproblem.If E :Fg.$(H, in :Fa,(H, K) isoptimal K)forat leastonepoilll(B1, t l ) E e,B1 * 90, then q> is uniformly optimalin !F:(H,K).) q>
Theorems K) be a conditional Proof Let ip* E .'Fa,(H, uppertest.Combining 26.4,26.6and 27.4we obtain = J q>*(x,y)Fso(dx,y) = ct J q>(x,y)Fso(dx,y) the optimality for every (8,T) E and employing of q> at (BI , T I ) we Gs.r-a.e.
e,
obtain)
J (Jq> (x,y) &,(dx,y)
-J
q>.(x, y) Fs,(dx,
y\302\273
G91, tl (dy)
\037
O.
Let M be the setof y where the first equations hold.For y E M consider the , K), where experiments Ey:= {&(.,y): 9 e pr.(e)}and the testingproblem(11 R = {9e prl (8):B Bo}and K:=prl (e)\\R.By the proofof Theorem(27.4), if 91 < 90 in :Fa$(n, K) for E\" y E M. Therefore, q>* (., y) is unifonnly optimal \037
we have)
J cP(x,y) 1-9 (dx,y) \\
\037
J cp* (x,y) &\\ (dx,y), y EM,
and if BI > 90 J q> (x,y) &.(dx,y)
\037
J q>* (x,y) Fs\\ (dx,y),
In any case,we obtain) J cp(x,y)\037. (dx,y) = J q>* (x,y) 1-81(dx,y)) and hence,GS.f-a.e. for every (9,t) E GS\\'fl-a.e.
Y
EM.
e.Now, restrictM to those
pointsy where the last equationholds.Sincethen for y E M the power functionsof (.,y) and q>* (.,y) coincide at Bo and 91, Corollary11.4shows that cp(., i n is K). It followsthat y) unifonnly optimal F;(il, = J q>*(x,Y)Fs(dx,y), Beprl(e), Jq>(x,y).F;(dx,y) and hencethe assertion. 0) q>
As
anotherconsequence we observethat the test q>* of Theorem27.4
is)))
122
Chapter 5:Exponential Expcrimcnts)
admissible. In fact, any bettertestis in \037a.(H, K) and thereforeshouldbe i n with lp+.) optima] !Jia.(H, K).Hence,it coincides 27.6Definition.A testcp E g (HA:, tr) is a conditionallwo-sided leslif 1 if X
(x
( 11;11 ).
- 11;11
-
seethat the preceding isnotdiflicultto assertion isalsovalid if W = 1 1ro.c), l'> O. The charm of the argument liesin the fact that it restsonly on the It
Neyman-Pearson lemma in the version of Lemma 28.1.The proof of the in its fulJ generalityrequires assertion someelementaryBayesiantechniques.
Thereforewe postpone it toSection 40.
resultsto a slightly moregeneral situation. Finally we extend the preceding = For tEL and <1 > 0 let Pr.u !f(<1id+ tl Nil)' In the followingwe consider the = teL.<1> O}). experimentF (H,fR(H). {.P,.u: For every <1 > 0 the experiment (H,fII(H),{P,.C1: teL})is of the same type as the experiment E if the vector spaceH is endowedwith the inner 1 1= <., It is natural to calJ an estimate() e .1t(F, product<.,.)\" \037
f\037
.). median-unbiased for F ismedian-unbiased for every R(e,t, (1)= II W(lx -f(t) I) e(',dx)dP'.C1'teL, i
\037)
(]
iff it
f\037,
<1
(1
>
> O. We denote) O.)))
166
Chapter 7: Theory of
Estimation)
34.6'Ibeorem.Every medianunbiased estimate (!off satisfie.'i for every tEL, (J > 0,)
-
[/(1) <,f(I)+ d]) P'..\037(., and)
R(q,t,
0\")
\037
:;; (,,:,, ) <1>
<1>
Clf\037
)'
< > 0,d> 0,
v O,1S1 (ds).) J W(lIfll'ls!)
Proof.Apply Lemma 34,2and Theorem34.3to F;,(J > O.
0)
34.7CoroUary.The estimate K. = foPL isa medianunbiased estimate off and estimates optimalamongallmedianunbiased off)
35.Mean unbiasedestimation) that e 0 is an arbitrary setand E = (fl,.flI,{Ps:.9 E e})an experiSuppose ment in S(8).Denote = {Ps: 8 E 8). For the purposeof thissectionthe of n !R2 (Q,d,Ps) are calledestimates. elements =*=
(fjJ
91'9)
35.1Definition.A
e
admitsan unbiasedestimateK if K = 9 E e. The set of all (mean)-unbiased estimates off is satisfies f(9) Ps(K), denotedby H(f).) function f
\037!R
An esti35.2Definition.Supposethat f e -+ R admitsunbiasedestimates. mate K* E H(f) iscalledan unbiased estimate ofWliformly minimalvariance
-
f(9\302\2732)
PS\302\253K.
= inf \"E
Ps\302\253K
if)
-
f(9\302\2732),
ll(f))
From Steiner'sformula it followsthat for K2 E HCn,and every 8 E
e
-
f(8\302