Professional Documents
Culture Documents
Fall 2016
and be, respectively, the cdfs of and . Let ( ) denote the set of all
and write .
Theorem 1
Theorem 2
, constant
3
1
1
and = = , = 1,2,3,
4
4
0, < 0
1
,
0
<
For each n the cdf is () = 4
1
1,
1
STAT 410
We see that
Fall 2016
< 0 implies () 0 as
> 0 implies () 1 as
Therefore () () =
0, < 0
for every 0, i.e. for every point of
1, 0
By Theorem 2 we would conclude that 0 as well. For a direct proof note that
for any fixed > 0 we have
3
,
4
(| | ) =
0,
1
<
So the probability = 0 eventually, for all > . Since > 0 was arbitrary, we
STAT 410
Fall 2016
() = 2
1 2
2 = () as
() =
1 +
() = ()
1
2
= (|| )
= 21 () 0
STAT 410
Fall 2016
Example 4.
Let 1 , 2 , be i.i.d. Uniform(0, ). Let = max(1 , 2 , , ).
First show that . This follows because, given any > 0 and less than ,
(| | ) = ( ) =
,
() = max () = , 0 < < .
() 1 , > 0, .
, where ~().
STAT 410
Fall 2016
() = ( ) = , 0 < < 1
() = (1 ) = 1
= 1 1
/
, 0 < < .
limiting distribution of .
1 () = (1 ) = 1 1
() = 1
If = ,
0 < < ,
1
1
, 0 < < 1
= 1 1 , 0 < < .
lim () = 1
1/
Then ~().
STAT 410
If < ,
If > ,
Fall 2016
Theorem 3
( ) ()
Theorem 4
, 0 +
Theorem 5
Slutskys Theorem
, ,
+ +
() () for || < .
Theorem 6
Let ~ , = . Then
() =
() = 1 + 1 as .
Binomial distribution ).
STAT 410
Fall 2016
= = 1 2 as .
Note () = , where ( = 1) = 1 1 1.
b)
2 2
1 2
, < .
2
By Taylor approximation,
2
1
1
= 1 + + 2 + .
So for < ,
2
STAT 410
Fall 2016
2
2
1
1
() = 1 + + 2 + 1
= 1
=
1 2
1
+
1
2
2
1
1 +
1
1 2
2
1 2
= 2
as
STAT 410
Fall 2016
1
=
=1
2
( )2
= 20
Example 8. Let 1 , 2 , , are i.i.d. with mean and variance 2 and finite
fourth moment 4 = ( 4 ). Then, by the weak law of large numbers,
1
2 (12 ) = 2 + 2
=1
Furthermore, using our previous results we can show convergence of the sample
variance:
1
2 =
( )2
1
=
=1
2 2 (1){( 2 + 2 ) 2 } = 2
1
=1
STAT 410
1
a.
b.
c.
d.
e.
f.
2
1 2 1
=1
2
12
2
=1
=1 ln( ) 1
=1
+1
1
>
=1
2
2
( ) (=1 )
=
~(0,1).
10
Fall 2016